diff --git a/.gitignore b/.gitignore
index 48ab04b..323b336 100644
--- a/.gitignore
+++ b/.gitignore
@@ -9,4 +9,6 @@ venv
 leetcode-problems-tmp.json
 
 scripts/__pycache__/
-descriptions/
\ No newline at end of file
+descriptions/
+.venv/
+__pycache__/
diff --git a/data/book-sets.json b/data/book-sets.json
index 296441f..df596e3 100644
--- a/data/book-sets.json
+++ b/data/book-sets.json
@@ -1,4207 +1 @@
-[
-    {
-        "title": "LeetCode 75",
-        "description": "Problem list from official https://leetcode.com/studyplan/leetcode-75/",
-        "tags": [
-            "Array",
-            "String",
-            "Two Pointers",
-            "Sliding Window",
-            "Prefix Sum",
-            "Hash Map",
-            "Stack",
-            "Queue",
-            "Linked List",
-            "Binary Tree",
-            "Graph",
-            "Dynamic Programming"
-        ],
-        "problems": [
-            104,
-            136,
-            206,
-            283,
-            338,
-            345,
-            374,
-            392,
-            605,
-            643,
-            700,
-            724,
-            746,
-            872,
-            933,
-            1071,
-            1137,
-            1207,
-            1431,
-            1732,
-            1768,
-            2215,
-            11,
-            17,
-            62,
-            72,
-            151,
-            162,
-            198,
-            199,
-            208,
-            215,
-            216,
-            236,
-            238,
-            328,
-            334,
-            394,
-            399,
-            435,
-            437,
-            443,
-            450,
-            452,
-            547,
-            649,
-            714,
-            735,
-            739,
-            790,
-            841,
-            875,
-            901,
-            994,
-            1004,
-            1143,
-            1161,
-            1268,
-            1318,
-            1372,
-            1448,
-            1456,
-            1466,
-            1493,
-            1657,
-            1679,
-            1926,
-            2095,
-            2130,
-            2300,
-            2336,
-            2352,
-            2390,
-            2462,
-            2542
-        ]
-    },
-    {
-        "title": "LeetCode Top 150",
-        "description": "Problem list from official https://leetcode.com/studyplan/top-interview-150",
-        "tags": [],
-        "problems": [
-            1,
-            9,
-            13,
-            14,
-            20,
-            21,
-            26,
-            27,
-            28,
-            35,
-            58,
-            66,
-            67,
-            69,
-            70,
-            88,
-            100,
-            101,
-            104,
-            108,
-            112,
-            121,
-            125,
-            136,
-            141,
-            169,
-            190,
-            191,
-            202,
-            205,
-            219,
-            222,
-            226,
-            228,
-            242,
-            290,
-            383,
-            392,
-            530,
-            637,
-            2,
-            3,
-            5,
-            6,
-            11,
-            12,
-            15,
-            17,
-            19,
-            22,
-            33,
-            34,
-            36,
-            39,
-            45,
-            46,
-            48,
-            49,
-            50,
-            53,
-            54,
-            55,
-            56,
-            57,
-            61,
-            63,
-            64,
-            71,
-            72,
-            73,
-            74,
-            77,
-            79,
-            80,
-            82,
-            86,
-            92,
-            97,
-            98,
-            102,
-            103,
-            105,
-            106,
-            114,
-            117,
-            120,
-            122,
-            128,
-            129,
-            130,
-            133,
-            134,
-            137,
-            138,
-            139,
-            146,
-            148,
-            150,
-            151,
-            153,
-            155,
-            162,
-            167,
-            172,
-            173,
-            189,
-            198,
-            199,
-            200,
-            201,
-            207,
-            208,
-            209,
-            210,
-            211,
-            215,
-            221,
-            230,
-            236,
-            238,
-            274,
-            289,
-            300,
-            322,
-            373,
-            380,
-            399,
-            427,
-            433,
-            452,
-            909,
-            918,
-            4,
-            23,
-            25,
-            30,
-            42,
-            52,
-            68,
-            76,
-            123,
-            124,
-            127,
-            135,
-            149,
-            188,
-            212,
-            224,
-            295,
-            502
-        ]
-    },
-    {
-        "title": "Top 100 Liked Questions",
-        "description": "Problem list from official https://leetcode.com/studyplan/top-100-liked/",
-        "tags": [
-            "Essential",
-            "High-Value Interview Prep"
-        ],
-        "problems": [
-            1,
-            20,
-            21,
-            70,
-            94,
-            101,
-            104,
-            121,
-            136,
-            141,
-            160,
-            169,
-            190,
-            206,
-            234,
-            242,
-            344,
-            412,
-            448,
-            543,
-            617,
-            876,
-            1046,
-            1304,
-            1337,
-            1480,
-            1528,
-            1672,
-            2,
-            3,
-            5,
-            7,
-            11,
-            15,
-            17,
-            19,
-            31,
-            33,
-            34,
-            39,
-            46,
-            48,
-            49,
-            53,
-            56,
-            62,
-            64,
-            72,
-            75,
-            78,
-            79,
-            98,
-            102,
-            105,
-            114,
-            128,
-            139,
-            146,
-            148,
-            155,
-            198,
-            199,
-            200,
-            207,
-            208,
-            215,
-            221,
-            230,
-            236,
-            238,
-            240,
-            287,
-            300,
-            322,
-            337,
-            347,
-            378,
-            438,
-            494,
-            560,
-            581,
-            647,
-            695,
-            739,
-            973,
-            981,
-            994,
-            1029,
-            1167,
-            1249,
-            1288,
-            1423,
-            1584,
-            4,
-            23,
-            42,
-            76,
-            84,
-            124,
-            297,
-            460
-        ]
-    },
-    {
-        "title": "All",
-        "description": "",
-        "tags": [],
-        "problems": [
-            1,
-            2,
-            3,
-            4,
-            5,
-            6,
-            7,
-            9,
-            11,
-            12,
-            13,
-            14,
-            15,
-            17,
-            19,
-            20,
-            21,
-            22,
-            23,
-            25,
-            26,
-            27,
-            28,
-            30,
-            31,
-            33,
-            34,
-            35,
-            36,
-            39,
-            42,
-            45,
-            46,
-            48,
-            49,
-            50,
-            52,
-            53,
-            54,
-            55,
-            56,
-            57,
-            58,
-            61,
-            62,
-            63,
-            64,
-            66,
-            67,
-            68,
-            69,
-            70,
-            71,
-            72,
-            73,
-            74,
-            75,
-            76,
-            77,
-            78,
-            79,
-            80,
-            82,
-            84,
-            86,
-            88,
-            89,
-            92,
-            94,
-            97,
-            98,
-            100,
-            101,
-            102,
-            103,
-            104,
-            105,
-            106,
-            108,
-            112,
-            114,
-            116,
-            117,
-            120,
-            121,
-            122,
-            123,
-            124,
-            125,
-            127,
-            128,
-            129,
-            130,
-            133,
-            134,
-            135,
-            136,
-            137,
-            138,
-            139,
-            141,
-            142,
-            146,
-            148,
-            149,
-            150,
-            151,
-            152,
-            153,
-            155,
-            156,
-            157,
-            158,
-            159,
-            160,
-            161,
-            162,
-            163,
-            167,
-            169,
-            170,
-            172,
-            173,
-            188,
-            189,
-            190,
-            191,
-            198,
-            199,
-            200,
-            201,
-            202,
-            205,
-            206,
-            207,
-            208,
-            209,
-            210,
-            211,
-            212,
-            215,
-            216,
-            217,
-            219,
-            221,
-            222,
-            224,
-            226,
-            228,
-            230,
-            234,
-            235,
-            236,
-            237,
-            238,
-            239,
-            240,
-            242,
-            268,
-            274,
-            278,
-            283,
-            287,
-            289,
-            290,
-            295,
-            297,
-            300,
-            322,
-            328,
-            334,
-            337,
-            338,
-            344,
-            345,
-            347,
-            373,
-            374,
-            378,
-            380,
-            383,
-            392,
-            394,
-            399,
-            409,
-            412,
-            427,
-            433,
-            435,
-            437,
-            438,
-            443,
-            448,
-            450,
-            452,
-            460,
-            494,
-            502,
-            509,
-            530,
-            543,
-            547,
-            560,
-            581,
-            605,
-            617,
-            637,
-            643,
-            647,
-            649,
-            695,
-            700,
-            701,
-            704,
-            714,
-            724,
-            733,
-            735,
-            739,
-            746,
-            790,
-            797,
-            841,
-            872,
-            875,
-            876,
-            901,
-            909,
-            918,
-            933,
-            973,
-            981,
-            994,
-            997,
-            1004,
-            1008,
-            1029,
-            1038,
-            1046,
-            1071,
-            1079,
-            1127,
-            1137,
-            1143,
-            1161,
-            1167,
-            1207,
-            1249,
-            1261,
-            1268,
-            1288,
-            1304,
-            1318,
-            1337,
-            1347,
-            1372,
-            1423,
-            1431,
-            1448,
-            1456,
-            1466,
-            1480,
-            1493,
-            1515,
-            1523,
-            1528,
-            1551,
-            1557,
-            1584,
-            1605,
-            1630,
-            1657,
-            1672,
-            1679,
-            1704,
-            1732,
-            1768,
-            1769,
-            1798,
-            1823,
-            1828,
-            1920,
-            1925,
-            1926,
-            1929,
-            1957,
-            1963,
-            2011,
-            2044,
-            2095,
-            2110,
-            2119,
-            2120,
-            2125,
-            2130,
-            2147,
-            2161,
-            2181,
-            2211,
-            2215,
-            2221,
-            2265,
-            2300,
-            2326,
-            2336,
-            2352,
-            2390,
-            2419,
-            2433,
-            2462,
-            2482,
-            2542,
-            2627,
-            2657,
-            2703,
-            2723,
-            2769,
-            2785,
-            2807,
-            2862,
-            2879,
-            2884,
-            2888,
-            2894,
-            2942,
-            3100,
-            3110,
-            3133,
-            3164,
-            3190,
-            3197,
-            3228,
-            3291,
-            3320,
-            3351,
-            3380,
-            3381,
-            3413,
-            3424,
-            3432,
-            3444,
-            3471,
-            3512,
-            3522,
-            3531,
-            3577,
-            3583,
-            3602,
-            3603,
-            3606,
-            3607,
-            3608,
-            3622,
-            3623,
-            3625,
-            3663,
-            3668,
-            3678,
-            3683,
-            3688,
-            3692,
-            3697,
-            3701,
-            3702,
-            3703,
-            3705,
-            3707,
-            3708,
-            3709,
-            3712,
-            3713,
-            3714,
-            3718,
-            3719,
-            3720,
-            3722,
-            3723,
-            3724,
-            3726,
-            3727,
-            3728,
-            3731,
-            3732,
-            3733,
-            3736,
-            3737,
-            3738,
-            3739,
-            3740,
-            3741,
-            3742,
-            3743,
-            3745,
-            3747,
-            3748,
-            3750,
-            3751,
-            3752,
-            3753,
-            3754,
-            3755,
-            3756,
-            3757,
-            3759,
-            3760,
-            3761,
-            3764,
-            3765,
-            3766,
-            3767,
-            3768,
-            3770,
-            3771,
-            3772
-        ]
-    },
-    {
-        "title": "Visualization",
-        "description": "",
-        "tags": [],
-        "problems": [
-            1,
-            2,
-            11,
-            1431,
-            1679,
-            1768,
-            1798,
-            2215,
-            3603,
-            3622,
-            3623
-        ]
-    },
-    {
-        "title": "All-TODO",
-        "description": "",
-        "tags": [],
-        "problems": [
-            8,
-            10,
-            16,
-            18,
-            24,
-            29,
-            32,
-            37,
-            38,
-            40,
-            41,
-            43,
-            44,
-            47,
-            51,
-            59,
-            60,
-            65,
-            81,
-            83,
-            85,
-            87,
-            90,
-            91,
-            93,
-            95,
-            96,
-            99,
-            107,
-            109,
-            110,
-            111,
-            113,
-            115,
-            118,
-            119,
-            126,
-            131,
-            132,
-            140,
-            143,
-            144,
-            145,
-            147,
-            154,
-            164,
-            165,
-            166,
-            168,
-            171,
-            174,
-            175,
-            176,
-            177,
-            178,
-            179,
-            180,
-            181,
-            182,
-            183,
-            184,
-            185,
-            187,
-            192,
-            193,
-            194,
-            195,
-            196,
-            197,
-            203,
-            204,
-            213,
-            214,
-            218,
-            220,
-            223,
-            225,
-            227,
-            229,
-            231,
-            232,
-            233,
-            241,
-            257,
-            258,
-            260,
-            262,
-            263,
-            264,
-            273,
-            275,
-            279,
-            282,
-            284,
-            292,
-            299,
-            301,
-            303,
-            304,
-            306,
-            307,
-            309,
-            310,
-            312,
-            313,
-            315,
-            316,
-            318,
-            319,
-            321,
-            324,
-            326,
-            327,
-            329,
-            330,
-            331,
-            332,
-            335,
-            336,
-            341,
-            342,
-            343,
-            349,
-            350,
-            352,
-            354,
-            355,
-            357,
-            363,
-            365,
-            367,
-            368,
-            370,
-            371,
-            372,
-            375,
-            376,
-            377,
-            379,
-            381,
-            382,
-            384,
-            385,
-            386,
-            387,
-            388,
-            389,
-            390,
-            391,
-            393,
-            395,
-            396,
-            397,
-            398,
-            400,
-            401,
-            402,
-            403,
-            404,
-            405,
-            406,
-            407,
-            408,
-            410,
-            411,
-            413,
-            414,
-            415,
-            416,
-            417,
-            418,
-            419,
-            420,
-            421,
-            422,
-            423,
-            424,
-            425,
-            426,
-            428,
-            429,
-            430,
-            431,
-            432,
-            434,
-            436,
-            439,
-            440,
-            441,
-            442,
-            444,
-            445,
-            446,
-            447,
-            449,
-            451,
-            453,
-            454,
-            455,
-            456,
-            457,
-            458,
-            459,
-            461,
-            462,
-            463,
-            464,
-            465,
-            466,
-            467,
-            468,
-            469,
-            470,
-            471,
-            472,
-            473,
-            474,
-            475,
-            476,
-            477,
-            478,
-            479,
-            480,
-            481,
-            482,
-            483,
-            484,
-            485,
-            486,
-            487,
-            488,
-            489,
-            490,
-            491,
-            492,
-            493,
-            495,
-            496,
-            497,
-            498,
-            499,
-            500,
-            501,
-            503,
-            504,
-            505,
-            506,
-            507,
-            508,
-            510,
-            511,
-            512,
-            513,
-            514,
-            515,
-            516,
-            517,
-            518,
-            519,
-            520,
-            521,
-            522,
-            523,
-            524,
-            525,
-            526,
-            527,
-            528,
-            529,
-            531,
-            532,
-            533,
-            534,
-            535,
-            536,
-            537,
-            538,
-            539,
-            540,
-            541,
-            542,
-            544,
-            545,
-            546,
-            548,
-            549,
-            550,
-            551,
-            552,
-            553,
-            554,
-            555,
-            556,
-            557,
-            558,
-            559,
-            561,
-            562,
-            563,
-            564,
-            565,
-            566,
-            567,
-            568,
-            569,
-            570,
-            571,
-            572,
-            573,
-            574,
-            575,
-            576,
-            577,
-            578,
-            579,
-            580,
-            582,
-            583,
-            584,
-            585,
-            586,
-            587,
-            588,
-            589,
-            590,
-            591,
-            592,
-            593,
-            594,
-            595,
-            596,
-            597,
-            598,
-            599,
-            600,
-            601,
-            602,
-            603,
-            604,
-            606,
-            607,
-            608,
-            609,
-            610,
-            611,
-            612,
-            613,
-            614,
-            615,
-            616,
-            618,
-            619,
-            620,
-            621,
-            622,
-            623,
-            624,
-            625,
-            626,
-            627,
-            628,
-            629,
-            630,
-            631,
-            632,
-            633,
-            634,
-            635,
-            636,
-            638,
-            639,
-            640,
-            641,
-            642,
-            644,
-            645,
-            646,
-            648,
-            650,
-            651,
-            652,
-            653,
-            654,
-            655,
-            656,
-            657,
-            658,
-            659,
-            660,
-            661,
-            662,
-            663,
-            664,
-            665,
-            666,
-            667,
-            668,
-            669,
-            670,
-            671,
-            672,
-            673,
-            674,
-            675,
-            676,
-            677,
-            678,
-            679,
-            680,
-            681,
-            682,
-            683,
-            684,
-            685,
-            686,
-            687,
-            688,
-            689,
-            690,
-            691,
-            692,
-            693,
-            694,
-            696,
-            697,
-            698,
-            699,
-            702,
-            703,
-            705,
-            706,
-            707,
-            708,
-            709,
-            710,
-            711,
-            712,
-            713,
-            715,
-            716,
-            717,
-            718,
-            719,
-            720,
-            721,
-            722,
-            723,
-            725,
-            726,
-            727,
-            728,
-            729,
-            730,
-            731,
-            732,
-            734,
-            736,
-            737,
-            738,
-            740,
-            741,
-            742,
-            743,
-            744,
-            745,
-            747,
-            748,
-            749,
-            750,
-            751,
-            752,
-            753,
-            754,
-            755,
-            756,
-            757,
-            758,
-            759,
-            760,
-            761,
-            762,
-            763,
-            764,
-            765,
-            766,
-            767,
-            768,
-            769,
-            770,
-            771,
-            772,
-            773,
-            774,
-            775,
-            776,
-            777,
-            778,
-            779,
-            780,
-            781,
-            782,
-            783,
-            784,
-            785,
-            786,
-            787,
-            788,
-            789,
-            791,
-            792,
-            793,
-            794,
-            795,
-            796,
-            798,
-            799,
-            800,
-            801,
-            802,
-            803,
-            804,
-            805,
-            806,
-            807,
-            808,
-            809,
-            810,
-            811,
-            812,
-            813,
-            814,
-            815,
-            816,
-            817,
-            818,
-            819,
-            820,
-            821,
-            822,
-            823,
-            824,
-            825,
-            826,
-            827,
-            828,
-            829,
-            830,
-            831,
-            832,
-            833,
-            834,
-            835,
-            836,
-            837,
-            838,
-            839,
-            840,
-            842,
-            843,
-            844,
-            845,
-            846,
-            847,
-            848,
-            849,
-            850,
-            851,
-            852,
-            853,
-            854,
-            855,
-            856,
-            857,
-            858,
-            859,
-            860,
-            861,
-            862,
-            863,
-            864,
-            865,
-            866,
-            867,
-            868,
-            869,
-            870,
-            871,
-            873,
-            874,
-            877,
-            878,
-            879,
-            880,
-            881,
-            882,
-            883,
-            884,
-            885,
-            886,
-            887,
-            888,
-            889,
-            890,
-            891,
-            892,
-            893,
-            894,
-            895,
-            896,
-            897,
-            898,
-            899,
-            900,
-            902,
-            903,
-            904,
-            905,
-            906,
-            907,
-            908,
-            910,
-            911,
-            912,
-            913,
-            914,
-            915,
-            916,
-            917,
-            919,
-            920,
-            921,
-            922,
-            923,
-            924,
-            925,
-            926,
-            927,
-            928,
-            929,
-            930,
-            931,
-            932,
-            934,
-            935,
-            936,
-            937,
-            938,
-            939,
-            940,
-            941,
-            942,
-            943,
-            944,
-            945,
-            946,
-            947,
-            948,
-            949,
-            950,
-            951,
-            952,
-            953,
-            954,
-            955,
-            956,
-            957,
-            958,
-            959,
-            960,
-            961,
-            962,
-            963,
-            964,
-            965,
-            966,
-            967,
-            968,
-            969,
-            970,
-            971,
-            972,
-            974,
-            975,
-            976,
-            977,
-            978,
-            979,
-            980,
-            982,
-            983,
-            984,
-            985,
-            986,
-            987,
-            988,
-            989,
-            990,
-            991,
-            992,
-            993,
-            995,
-            996,
-            998,
-            999,
-            1000,
-            1001,
-            1002,
-            1003,
-            1005,
-            1006,
-            1007,
-            1009,
-            1010,
-            1011,
-            1012,
-            1013,
-            1014,
-            1015,
-            1016,
-            1017,
-            1018,
-            1019,
-            1020,
-            1021,
-            1022,
-            1023,
-            1024,
-            1025,
-            1026,
-            1027,
-            1028,
-            1030,
-            1031,
-            1032,
-            1033,
-            1034,
-            1035,
-            1036,
-            1037,
-            1039,
-            1040,
-            1041,
-            1042,
-            1043,
-            1044,
-            1045,
-            1047,
-            1048,
-            1049,
-            1050,
-            1051,
-            1052,
-            1053,
-            1054,
-            1061,
-            1068,
-            1070,
-            1072,
-            1073,
-            1074,
-            1075,
-            1078,
-            1080,
-            1081,
-            1084,
-            1089,
-            1090,
-            1091,
-            1092,
-            1093,
-            1094,
-            1095,
-            1096,
-            1103,
-            1104,
-            1105,
-            1106,
-            1108,
-            1109,
-            1110,
-            1111,
-            1114,
-            1115,
-            1116,
-            1117,
-            1122,
-            1123,
-            1124,
-            1125,
-            1128,
-            1129,
-            1130,
-            1131,
-            1138,
-            1139,
-            1140,
-            1141,
-            1144,
-            1145,
-            1146,
-            1147,
-            1148,
-            1154,
-            1155,
-            1156,
-            1157,
-            1158,
-            1160,
-            1162,
-            1163,
-            1164,
-            1169,
-            1170,
-            1171,
-            1172,
-            1174,
-            1175,
-            1177,
-            1178,
-            1179,
-            1184,
-            1185,
-            1186,
-            1187,
-            1189,
-            1190,
-            1191,
-            1192,
-            1193,
-            1195,
-            1200,
-            1201,
-            1202,
-            1203,
-            1204,
-            1206,
-            1208,
-            1209,
-            1210,
-            1211,
-            1217,
-            1218,
-            1219,
-            1220,
-            1221,
-            1222,
-            1223,
-            1224,
-            1226,
-            1227,
-            1232,
-            1233,
-            1234,
-            1235,
-            1237,
-            1238,
-            1239,
-            1240,
-            1247,
-            1248,
-            1250,
-            1251,
-            1252,
-            1253,
-            1254,
-            1255,
-            1260,
-            1262,
-            1263,
-            1266,
-            1267,
-            1269,
-            1275,
-            1276,
-            1277,
-            1278,
-            1280,
-            1281,
-            1282,
-            1283,
-            1284,
-            1286,
-            1287,
-            1289,
-            1290,
-            1291,
-            1292,
-            1293,
-            1295,
-            1296,
-            1297,
-            1298,
-            1299,
-            1300,
-            1301,
-            1302,
-            1305,
-            1306,
-            1307,
-            1309,
-            1310,
-            1311,
-            1312,
-            1313,
-            1314,
-            1315,
-            1316,
-            1317,
-            1319,
-            1320,
-            1321,
-            1323,
-            1324,
-            1325,
-            1326,
-            1327,
-            1328,
-            1329,
-            1330,
-            1331,
-            1332,
-            1333,
-            1334,
-            1335,
-            1338,
-            1339,
-            1340,
-            1341,
-            1342,
-            1343,
-            1344,
-            1345,
-            1346,
-            1348,
-            1349,
-            1351,
-            1352,
-            1353,
-            1354,
-            1356,
-            1357,
-            1358,
-            1359,
-            1360,
-            1361,
-            1362,
-            1363,
-            1365,
-            1366,
-            1367,
-            1368,
-            1370,
-            1371,
-            1373,
-            1374,
-            1375,
-            1376,
-            1377,
-            1378,
-            1379,
-            1380,
-            1381,
-            1382,
-            1383,
-            1385,
-            1386,
-            1387,
-            1388,
-            1389,
-            1390,
-            1391,
-            1392,
-            1393,
-            1394,
-            1395,
-            1396,
-            1397,
-            1399,
-            1400,
-            1401,
-            1402,
-            1403,
-            1404,
-            1405,
-            1406,
-            1407,
-            1408,
-            1409,
-            1410,
-            1411,
-            1413,
-            1414,
-            1415,
-            1416,
-            1417,
-            1418,
-            1419,
-            1420,
-            1422,
-            1424,
-            1425,
-            1432,
-            1433,
-            1434,
-            1436,
-            1437,
-            1438,
-            1439,
-            1441,
-            1442,
-            1443,
-            1444,
-            1446,
-            1447,
-            1449,
-            1450,
-            1451,
-            1452,
-            1453,
-            1455,
-            1457,
-            1458,
-            1460,
-            1461,
-            1462,
-            1463,
-            1464,
-            1465,
-            1467,
-            1470,
-            1471,
-            1472,
-            1473,
-            1475,
-            1476,
-            1477,
-            1478,
-            1481,
-            1482,
-            1483,
-            1484,
-            1486,
-            1487,
-            1488,
-            1489,
-            1491,
-            1492,
-            1494,
-            1496,
-            1497,
-            1498,
-            1499,
-            1502,
-            1503,
-            1504,
-            1505,
-            1507,
-            1508,
-            1509,
-            1510,
-            1512,
-            1513,
-            1514,
-            1517,
-            1518,
-            1519,
-            1520,
-            1521,
-            1524,
-            1525,
-            1526,
-            1527,
-            1529,
-            1530,
-            1531,
-            1534,
-            1535,
-            1536,
-            1537,
-            1539,
-            1540,
-            1541,
-            1542,
-            1544,
-            1545,
-            1546,
-            1547,
-            1550,
-            1552,
-            1553,
-            1556,
-            1558,
-            1559,
-            1560,
-            1561,
-            1562,
-            1563,
-            1566,
-            1567,
-            1568,
-            1569,
-            1572,
-            1573,
-            1574,
-            1575,
-            1576,
-            1577,
-            1578,
-            1579,
-            1581,
-            1582,
-            1583,
-            1585,
-            1587,
-            1588,
-            1589,
-            1590,
-            1591,
-            1592,
-            1593,
-            1594,
-            1595,
-            1598,
-            1599,
-            1600,
-            1601,
-            1603,
-            1604,
-            1606,
-            1608,
-            1609,
-            1610,
-            1611,
-            1614,
-            1615,
-            1616,
-            1617,
-            1619,
-            1620,
-            1621,
-            1622,
-            1624,
-            1625,
-            1626,
-            1627,
-            1629,
-            1631,
-            1632,
-            1633,
-            1636,
-            1637,
-            1638,
-            1639,
-            1640,
-            1641,
-            1642,
-            1643,
-            1646,
-            1647,
-            1648,
-            1649,
-            1652,
-            1653,
-            1654,
-            1655,
-            1656,
-            1658,
-            1659,
-            1661,
-            1662,
-            1663,
-            1664,
-            1665,
-            1667,
-            1668,
-            1669,
-            1670,
-            1671,
-            1673,
-            1674,
-            1675,
-            1678,
-            1680,
-            1681,
-            1683,
-            1684,
-            1685,
-            1686,
-            1687,
-            1688,
-            1689,
-            1690,
-            1691,
-            1693,
-            1694,
-            1695,
-            1696,
-            1697,
-            1700,
-            1701,
-            1702,
-            1703,
-            1705,
-            1706,
-            1707,
-            1710,
-            1711,
-            1712,
-            1713,
-            1716,
-            1717,
-            1718,
-            1719,
-            1720,
-            1721,
-            1722,
-            1723,
-            1725,
-            1726,
-            1727,
-            1728,
-            1729,
-            1731,
-            1733,
-            1734,
-            1735,
-            1736,
-            1737,
-            1738,
-            1739,
-            1741,
-            1742,
-            1743,
-            1744,
-            1745,
-            1748,
-            1749,
-            1750,
-            1751,
-            1752,
-            1753,
-            1754,
-            1755,
-            1757,
-            1758,
-            1759,
-            1760,
-            1761,
-            1763,
-            1764,
-            1765,
-            1766,
-            1770,
-            1771,
-            1773,
-            1774,
-            1775,
-            1776,
-            1779,
-            1780,
-            1781,
-            1782,
-            1784,
-            1785,
-            1786,
-            1787,
-            1789,
-            1790,
-            1791,
-            1792,
-            1793,
-            1795,
-            1796,
-            1797,
-            1799,
-            1800,
-            1801,
-            1802,
-            1803,
-            1805,
-            1806,
-            1807,
-            1808,
-            1812,
-            1813,
-            1814,
-            1815,
-            1816,
-            1817,
-            1818,
-            1819,
-            1822,
-            1824,
-            1825,
-            1827,
-            1829,
-            1830,
-            1832,
-            1833,
-            1834,
-            1835,
-            1837,
-            1838,
-            1839,
-            1840,
-            1844,
-            1845,
-            1846,
-            1847,
-            1848,
-            1849,
-            1850,
-            1851,
-            1854,
-            1855,
-            1856,
-            1857,
-            1859,
-            1860,
-            1861,
-            1862,
-            1863,
-            1864,
-            1865,
-            1866,
-            1869,
-            1870,
-            1871,
-            1872,
-            1873,
-            1876,
-            1877,
-            1878,
-            1879,
-            1880,
-            1881,
-            1882,
-            1883,
-            1884,
-            1886,
-            1887,
-            1888,
-            1889,
-            1890,
-            1893,
-            1894,
-            1895,
-            1896,
-            1897,
-            1898,
-            1899,
-            1900,
-            1901,
-            1903,
-            1904,
-            1905,
-            1906,
-            1907,
-            1909,
-            1910,
-            1911,
-            1912,
-            1913,
-            1914,
-            1915,
-            1916,
-            1921,
-            1922,
-            1923,
-            1927,
-            1928,
-            1930,
-            1931,
-            1932,
-            1934,
-            1935,
-            1936,
-            1937,
-            1938,
-            1941,
-            1942,
-            1943,
-            1944,
-            1945,
-            1946,
-            1947,
-            1948,
-            1952,
-            1953,
-            1954,
-            1955,
-            1958,
-            1959,
-            1960,
-            1961,
-            1962,
-            1964,
-            1965,
-            1967,
-            1968,
-            1969,
-            1970,
-            1971,
-            1974,
-            1975,
-            1976,
-            1977,
-            1978,
-            1979,
-            1980,
-            1981,
-            1982,
-            1984,
-            1985,
-            1986,
-            1987,
-            1991,
-            1992,
-            1993,
-            1994,
-            1995,
-            1996,
-            1997,
-            1998,
-            2000,
-            2001,
-            2002,
-            2003,
-            2006,
-            2007,
-            2008,
-            2009,
-            2012,
-            2013,
-            2014,
-            2016,
-            2017,
-            2018,
-            2019,
-            2022,
-            2023,
-            2024,
-            2025,
-            2027,
-            2028,
-            2029,
-            2030,
-            2032,
-            2033,
-            2034,
-            2035,
-            2037,
-            2038,
-            2039,
-            2040,
-            2042,
-            2043,
-            2045,
-            2047,
-            2048,
-            2049,
-            2050,
-            2053,
-            2054,
-            2055,
-            2056,
-            2057,
-            2058,
-            2059,
-            2060,
-            2062,
-            2063,
-            2064,
-            2065,
-            2068,
-            2069,
-            2070,
-            2071,
-            2073,
-            2074,
-            2075,
-            2076,
-            2078,
-            2079,
-            2080,
-            2081,
-            2085,
-            2086,
-            2087,
-            2088,
-            2089,
-            2090,
-            2091,
-            2092,
-            2094,
-            2096,
-            2097,
-            2099,
-            2100,
-            2101,
-            2102,
-            2103,
-            2104,
-            2105,
-            2106,
-            2108,
-            2109,
-            2111,
-            2114,
-            2115,
-            2116,
-            2117,
-            2121,
-            2122,
-            2124,
-            2126,
-            2127,
-            2129,
-            2131,
-            2132,
-            2133,
-            2134,
-            2135,
-            2136,
-            2138,
-            2139,
-            2140,
-            2141,
-            2144,
-            2145,
-            2146,
-            2148,
-            2149,
-            2150,
-            2151,
-            2154,
-            2155,
-            2156,
-            2157,
-            2160,
-            2162,
-            2163,
-            2164,
-            2165,
-            2166,
-            2167,
-            2169,
-            2170,
-            2171,
-            2172,
-            2176,
-            2177,
-            2178,
-            2179,
-            2180,
-            2182,
-            2183,
-            2185,
-            2186,
-            2187,
-            2188,
-            2190,
-            2191,
-            2192,
-            2193,
-            2194,
-            2195,
-            2196,
-            2197,
-            2200,
-            2201,
-            2202,
-            2203,
-            2206,
-            2207,
-            2208,
-            2209,
-            2210,
-            2212,
-            2213,
-            2216,
-            2217,
-            2218,
-            2220,
-            2222,
-            2223,
-            2224,
-            2225,
-            2226,
-            2227,
-            2231,
-            2232,
-            2233,
-            2234,
-            2235,
-            2236,
-            2239,
-            2240,
-            2241,
-            2242,
-            2243,
-            2244,
-            2245,
-            2246,
-            2248,
-            2249,
-            2250,
-            2251,
-            2255,
-            2256,
-            2257,
-            2258,
-            2259,
-            2260,
-            2261,
-            2262,
-            2264,
-            2266,
-            2267,
-            2269,
-            2270,
-            2271,
-            2272,
-            2273,
-            2274,
-            2275,
-            2276,
-            2278,
-            2279,
-            2280,
-            2281,
-            2283,
-            2284,
-            2285,
-            2286,
-            2287,
-            2288,
-            2289,
-            2290,
-            2293,
-            2294,
-            2295,
-            2296,
-            2299,
-            2301,
-            2302,
-            2303,
-            2304,
-            2305,
-            2306,
-            2309,
-            2310,
-            2311,
-            2312,
-            2315,
-            2316,
-            2317,
-            2318,
-            2319,
-            2320,
-            2321,
-            2322,
-            2325,
-            2327,
-            2328,
-            2331,
-            2332,
-            2333,
-            2334,
-            2335,
-            2337,
-            2338,
-            2341,
-            2342,
-            2343,
-            2344,
-            2347,
-            2348,
-            2349,
-            2350,
-            2351,
-            2353,
-            2354,
-            2356,
-            2357,
-            2358,
-            2359,
-            2360,
-            2363,
-            2364,
-            2365,
-            2366,
-            2367,
-            2368,
-            2369,
-            2370,
-            2373,
-            2374,
-            2375,
-            2376,
-            2379,
-            2380,
-            2381,
-            2382,
-            2383,
-            2384,
-            2385,
-            2386,
-            2389,
-            2391,
-            2392,
-            2395,
-            2396,
-            2397,
-            2398,
-            2399,
-            2400,
-            2401,
-            2402,
-            2404,
-            2405,
-            2406,
-            2407,
-            2409,
-            2410,
-            2411,
-            2412,
-            2413,
-            2414,
-            2415,
-            2416,
-            2418,
-            2420,
-            2421,
-            2423,
-            2424,
-            2425,
-            2426,
-            2427,
-            2428,
-            2429,
-            2430,
-            2432,
-            2434,
-            2435,
-            2437,
-            2438,
-            2439,
-            2440,
-            2441,
-            2442,
-            2443,
-            2444,
-            2446,
-            2447,
-            2448,
-            2449,
-            2451,
-            2452,
-            2453,
-            2454,
-            2455,
-            2456,
-            2457,
-            2458,
-            2460,
-            2461,
-            2463,
-            2465,
-            2466,
-            2467,
-            2468,
-            2469,
-            2470,
-            2471,
-            2472,
-            2475,
-            2476,
-            2477,
-            2478,
-            2481,
-            2483,
-            2484,
-            2485,
-            2486,
-            2487,
-            2488,
-            2490,
-            2491,
-            2492,
-            2493,
-            2496,
-            2497,
-            2498,
-            2499,
-            2500,
-            2501,
-            2502,
-            2503,
-            2506,
-            2507,
-            2508,
-            2509,
-            2511,
-            2512,
-            2513,
-            2514,
-            2515,
-            2516,
-            2517,
-            2518,
-            2520,
-            2521,
-            2522,
-            2523,
-            2525,
-            2526,
-            2527,
-            2528,
-            2529,
-            2530,
-            2531,
-            2532,
-            2535,
-            2536,
-            2537,
-            2538,
-            2540,
-            2541,
-            2543,
-            2544,
-            2545,
-            2546,
-            2547,
-            2549,
-            2550,
-            2551,
-            2552,
-            2553,
-            2554,
-            2555,
-            2556,
-            2558,
-            2559,
-            2560,
-            2561,
-            2562,
-            2563,
-            2564,
-            2565,
-            2566,
-            2567,
-            2568,
-            2569,
-            2570,
-            2571,
-            2572,
-            2573,
-            2574,
-            2575,
-            2576,
-            2577,
-            2578,
-            2579,
-            2580,
-            2581,
-            2582,
-            2583,
-            2584,
-            2585,
-            2586,
-            2587,
-            2588,
-            2589,
-            2591,
-            2592,
-            2593,
-            2594,
-            2595,
-            2596,
-            2597,
-            2598,
-            2600,
-            2601,
-            2602,
-            2603,
-            2605,
-            2606,
-            2607,
-            2608,
-            2609,
-            2610,
-            2611,
-            2612,
-            2614,
-            2615,
-            2616,
-            2617,
-            2618,
-            2619,
-            2620,
-            2621,
-            2622,
-            2623,
-            2624,
-            2625,
-            2626,
-            2629,
-            2630,
-            2631,
-            2634,
-            2635,
-            2637,
-            2639,
-            2640,
-            2641,
-            2642,
-            2643,
-            2644,
-            2645,
-            2646,
-            2648,
-            2649,
-            2650,
-            2651,
-            2652,
-            2653,
-            2654,
-            2656,
-            2658,
-            2659,
-            2660,
-            2661,
-            2662,
-            2663,
-            2665,
-            2666,
-            2667,
-            2670,
-            2671,
-            2672,
-            2673,
-            2677,
-            2678,
-            2679,
-            2680,
-            2681,
-            2682,
-            2683,
-            2684,
-            2685,
-            2693,
-            2694,
-            2695,
-            2696,
-            2697,
-            2698,
-            2699,
-            2704,
-            2705,
-            2706,
-            2707,
-            2708,
-            2709,
-            2710,
-            2711,
-            2712,
-            2713,
-            2715,
-            2716,
-            2717,
-            2718,
-            2719,
-            2721,
-            2722,
-            2724,
-            2725,
-            2726,
-            2727,
-            2729,
-            2730,
-            2731,
-            2732,
-            2733,
-            2734,
-            2735,
-            2736,
-            2739,
-            2740,
-            2741,
-            2742,
-            2744,
-            2745,
-            2746,
-            2747,
-            2748,
-            2749,
-            2750,
-            2751,
-            2760,
-            2761,
-            2762,
-            2763,
-            2765,
-            2766,
-            2767,
-            2768,
-            2770,
-            2771,
-            2772,
-            2778,
-            2779,
-            2780,
-            2781,
-            2784,
-            2786,
-            2787,
-            2788,
-            2789,
-            2790,
-            2791,
-            2798,
-            2799,
-            2800,
-            2801,
-            2806,
-            2808,
-            2809,
-            2810,
-            2811,
-            2812,
-            2813,
-            2815,
-            2816,
-            2817,
-            2818,
-            2824,
-            2825,
-            2826,
-            2827,
-            2828,
-            2829,
-            2830,
-            2831,
-            2833,
-            2834,
-            2835,
-            2836,
-            2839,
-            2840,
-            2841,
-            2842,
-            2843,
-            2844,
-            2845,
-            2846,
-            2848,
-            2849,
-            2850,
-            2851,
-            2855,
-            2856,
-            2857,
-            2858,
-            2859,
-            2860,
-            2861,
-            2864,
-            2865,
-            2866,
-            2867,
-            2869,
-            2870,
-            2871,
-            2872,
-            2873,
-            2874,
-            2875,
-            2876,
-            2877,
-            2878,
-            2880,
-            2881,
-            2882,
-            2883,
-            2885,
-            2886,
-            2887,
-            2889,
-            2890,
-            2891,
-            2895,
-            2896,
-            2897,
-            2899,
-            2900,
-            2901,
-            2902,
-            2903,
-            2904,
-            2905,
-            2906,
-            2908,
-            2909,
-            2910,
-            2911,
-            2913,
-            2914,
-            2915,
-            2916,
-            2917,
-            2918,
-            2919,
-            2920,
-            2923,
-            2924,
-            2925,
-            2926,
-            2928,
-            2929,
-            2930,
-            2931,
-            2932,
-            2933,
-            2934,
-            2935,
-            2937,
-            2938,
-            2939,
-            2940,
-            2943,
-            2944,
-            2945,
-            2946,
-            2947,
-            2948,
-            2949,
-            2951,
-            2952,
-            2953,
-            2954,
-            2956,
-            2957,
-            2958,
-            2959,
-            2960,
-            2961,
-            2962,
-            2963,
-            2965,
-            2966,
-            2967,
-            2968,
-            2970,
-            2971,
-            2972,
-            2973,
-            2974,
-            2975,
-            2976,
-            2977,
-            2980,
-            2981,
-            2982,
-            2983,
-            2996,
-            2997,
-            2998,
-            2999,
-            3000,
-            3001,
-            3002,
-            3003,
-            3005,
-            3006,
-            3007,
-            3008,
-            3010,
-            3011,
-            3012,
-            3013,
-            3014,
-            3015,
-            3016,
-            3017,
-            3019,
-            3020,
-            3021,
-            3022,
-            3024,
-            3025,
-            3026,
-            3027,
-            3028,
-            3029,
-            3030,
-            3031,
-            3033,
-            3034,
-            3035,
-            3036,
-            3038,
-            3039,
-            3040,
-            3041,
-            3042,
-            3043,
-            3044,
-            3045,
-            3046,
-            3047,
-            3048,
-            3049,
-            3065,
-            3066,
-            3067,
-            3068,
-            3069,
-            3070,
-            3071,
-            3072,
-            3074,
-            3075,
-            3076,
-            3077,
-            3079,
-            3080,
-            3081,
-            3082,
-            3083,
-            3084,
-            3085,
-            3086,
-            3090,
-            3091,
-            3092,
-            3093,
-            3095,
-            3096,
-            3097,
-            3098,
-            3099,
-            3101,
-            3102,
-            3105,
-            3106,
-            3107,
-            3108,
-            3111,
-            3112,
-            3113,
-            3114,
-            3115,
-            3116,
-            3117,
-            3120,
-            3121,
-            3122,
-            3123,
-            3127,
-            3128,
-            3129,
-            3130,
-            3131,
-            3132,
-            3134,
-            3136,
-            3137,
-            3138,
-            3139,
-            3142,
-            3143,
-            3144,
-            3145,
-            3146,
-            3147,
-            3148,
-            3149,
-            3151,
-            3152,
-            3153,
-            3154,
-            3158,
-            3159,
-            3160,
-            3161,
-            3162,
-            3163,
-            3165,
-            3168,
-            3169,
-            3170,
-            3171,
-            3174,
-            3175,
-            3176,
-            3177,
-            3178,
-            3179,
-            3180,
-            3181,
-            3184,
-            3185,
-            3186,
-            3187,
-            3191,
-            3192,
-            3193,
-            3194,
-            3195,
-            3196,
-            3200,
-            3201,
-            3202,
-            3203,
-            3206,
-            3207,
-            3208,
-            3209,
-            3210,
-            3211,
-            3212,
-            3213,
-            3216,
-            3217,
-            3218,
-            3219,
-            3220,
-            3222,
-            3223,
-            3224,
-            3225,
-            3226,
-            3227,
-            3229,
-            3232,
-            3233,
-            3234,
-            3235,
-            3238,
-            3239,
-            3240,
-            3241,
-            3242,
-            3243,
-            3244,
-            3245,
-            3248,
-            3249,
-            3250,
-            3251,
-            3254,
-            3255,
-            3256,
-            3257,
-            3258,
-            3259,
-            3260,
-            3261,
-            3264,
-            3265,
-            3266,
-            3267,
-            3270,
-            3271,
-            3272,
-            3273,
-            3274,
-            3275,
-            3276,
-            3277,
-            3280,
-            3281,
-            3282,
-            3283,
-            3285,
-            3286,
-            3287,
-            3288,
-            3289,
-            3290,
-            3292,
-            3295,
-            3296,
-            3297,
-            3298,
-            3300,
-            3301,
-            3302,
-            3303,
-            3304,
-            3305,
-            3306,
-            3307,
-            3309,
-            3310,
-            3311,
-            3312,
-            3314,
-            3315,
-            3316,
-            3317,
-            3318,
-            3319,
-            3321,
-            3324,
-            3325,
-            3326,
-            3327,
-            3330,
-            3331,
-            3332,
-            3333,
-            3334,
-            3335,
-            3336,
-            3337,
-            3340,
-            3341,
-            3342,
-            3343,
-            3345,
-            3346,
-            3347,
-            3348,
-            3349,
-            3350,
-            3352,
-            3354,
-            3355,
-            3356,
-            3357,
-            3360,
-            3361,
-            3362,
-            3363,
-            3364,
-            3365,
-            3366,
-            3367,
-            3370,
-            3371,
-            3372,
-            3373,
-            3374,
-            3375,
-            3376,
-            3377,
-            3378,
-            3379,
-            3382,
-            3386,
-            3387,
-            3388,
-            3389,
-            3392,
-            3393,
-            3394,
-            3395,
-            3396,
-            3397,
-            3398,
-            3399,
-            3402,
-            3403,
-            3404,
-            3405,
-            3407,
-            3408,
-            3409,
-            3410,
-            3411,
-            3412,
-            3414,
-            3417,
-            3418,
-            3419,
-            3420,
-            3421,
-            3423,
-            3425,
-            3426,
-            3427,
-            3428,
-            3429,
-            3430,
-            3433,
-            3434,
-            3435,
-            3436,
-            3438,
-            3439,
-            3440,
-            3441,
-            3442,
-            3443,
-            3445,
-            3446,
-            3447,
-            3448,
-            3449,
-            3451,
-            3452,
-            3453,
-            3454,
-            3455,
-            3456,
-            3457,
-            3458,
-            3459,
-            3461,
-            3462,
-            3463,
-            3464,
-            3465,
-            3467,
-            3468,
-            3469,
-            3470,
-            3472,
-            3473,
-            3474,
-            3475,
-            3477,
-            3478,
-            3479,
-            3480,
-            3482,
-            3483,
-            3484,
-            3485,
-            3486,
-            3487,
-            3488,
-            3489,
-            3490,
-            3492,
-            3493,
-            3494,
-            3495,
-            3497,
-            3498,
-            3499,
-            3500,
-            3501,
-            3502,
-            3503,
-            3504,
-            3505,
-            3507,
-            3508,
-            3509,
-            3510,
-            3513,
-            3514,
-            3515,
-            3516,
-            3517,
-            3518,
-            3519,
-            3521,
-            3523,
-            3524,
-            3525,
-            3527,
-            3528,
-            3529,
-            3530,
-            3532,
-            3533,
-            3534,
-            3536,
-            3537,
-            3538,
-            3539,
-            3541,
-            3542,
-            3543,
-            3544,
-            3545,
-            3546,
-            3547,
-            3548,
-            3550,
-            3551,
-            3552,
-            3553,
-            3554,
-            3556,
-            3557,
-            3558,
-            3559,
-            3560,
-            3561,
-            3562,
-            3563,
-            3564,
-            3566,
-            3567,
-            3568,
-            3569,
-            3570,
-            3572,
-            3573,
-            3574,
-            3575,
-            3576,
-            3578,
-            3579,
-            3580,
-            3582,
-            3584,
-            3585,
-            3586,
-            3587,
-            3588,
-            3589,
-            3590,
-            3591,
-            3592,
-            3593,
-            3594,
-            3597,
-            3598,
-            3599,
-            3600,
-            3601,
-            3604,
-            3605,
-            3609,
-            3611,
-            3612,
-            3613,
-            3614,
-            3615,
-            3617,
-            3618,
-            3619,
-            3620,
-            3621,
-            3624,
-            3626,
-            3627,
-            3628,
-            3629,
-            3630,
-            3633,
-            3634,
-            3635,
-            3636,
-            3637,
-            3638,
-            3639,
-            3640,
-            3642,
-            3643,
-            3644,
-            3645,
-            3646,
-            3648,
-            3649,
-            3650,
-            3651,
-            3652,
-            3653,
-            3654,
-            3655,
-            3657,
-            3658,
-            3659,
-            3660,
-            3661,
-            3664,
-            3665,
-            3666,
-            3669,
-            3670,
-            3671,
-            3673,
-            3674,
-            3675,
-            3676,
-            3677,
-            3679,
-            3680,
-            3681,
-            3684,
-            3685,
-            3686,
-            3689,
-            3690,
-            3691,
-            3693,
-            3694,
-            3695,
-            3698,
-            3699,
-            3700,
-            3704,
-            3706,
-            3710,
-            3711,
-            3715,
-            3716,
-            3717,
-            3721,
-            3725,
-            3729,
-            3730,
-            3734,
-            3735,
-            3744,
-            3746,
-            3749,
-            3758,
-            3763,
-            3773,
-            3774,
-            3775,
-            3776,
-            3777,
-            3778,
-            3779,
-            3780,
-            3781,
-            3782,
-            3783,
-            3784,
-            3785,
-            3786,
-            3787,
-            3788,
-            3789,
-            3790,
-            3791,
-            3792,
-            3793,
-            3794,
-            3795,
-            3796,
-            3797,
-            3798,
-            3799
-        ],
-        "premium": [
-            27,
-            156,
-            157,
-            158,
-            159,
-            161,
-            163,
-            170,
-            186,
-            243,
-            244,
-            245,
-            246,
-            247,
-            248,
-            249,
-            250,
-            251,
-            252,
-            253,
-            254,
-            255,
-            256,
-            259,
-            261,
-            265,
-            266,
-            267,
-            269,
-            270,
-            271,
-            272,
-            276,
-            277,
-            280,
-            281,
-            285,
-            286,
-            288,
-            291,
-            293,
-            294,
-            296,
-            298,
-            302,
-            305,
-            308,
-            311,
-            314,
-            317,
-            320,
-            323,
-            325,
-            333,
-            339,
-            340,
-            346,
-            348,
-            351,
-            353,
-            356,
-            358,
-            359,
-            360,
-            361,
-            362,
-            364,
-            366,
-            369,
-            1055,
-            1056,
-            1057,
-            1058,
-            1059,
-            1060,
-            1062,
-            1063,
-            1064,
-            1065,
-            1066,
-            1067,
-            1069,
-            1076,
-            1077,
-            1082,
-            1083,
-            1085,
-            1086,
-            1087,
-            1088,
-            1097,
-            1098,
-            1099,
-            1100,
-            1101,
-            1102,
-            1107,
-            1112,
-            1113,
-            1118,
-            1119,
-            1120,
-            1121,
-            1126,
-            1127,
-            1132,
-            1133,
-            1134,
-            1135,
-            1136,
-            1142,
-            1149,
-            1150,
-            1151,
-            1152,
-            1153,
-            1159,
-            1165,
-            1166,
-            1167,
-            1168,
-            1173,
-            1176,
-            1180,
-            1181,
-            1182,
-            1183,
-            1188,
-            1194,
-            1196,
-            1197,
-            1198,
-            1199,
-            1205,
-            1212,
-            1213,
-            1214,
-            1215,
-            1216,
-            1225,
-            1228,
-            1229,
-            1230,
-            1231,
-            1236,
-            1241,
-            1242,
-            1243,
-            1244,
-            1245,
-            1246,
-            1256,
-            1257,
-            1258,
-            1259,
-            1264,
-            1265,
-            1270,
-            1271,
-            1272,
-            1273,
-            1274,
-            1279,
-            1285,
-            1294,
-            1303,
-            1308,
-            1322,
-            1336,
-            1350,
-            1355,
-            1364,
-            1369,
-            1384,
-            1398,
-            1412,
-            1421,
-            1426,
-            1427,
-            1428,
-            1429,
-            1430,
-            1435,
-            1440,
-            1445,
-            1454,
-            1459,
-            1468,
-            1469,
-            1474,
-            1479,
-            1485,
-            1490,
-            1495,
-            1500,
-            1501,
-            1506,
-            1511,
-            1516,
-            1522,
-            1532,
-            1533,
-            1538,
-            1543,
-            1548,
-            1549,
-            1554,
-            1555,
-            1564,
-            1565,
-            1570,
-            1571,
-            1580,
-            1586,
-            1596,
-            1597,
-            1602,
-            1607,
-            1612,
-            1613,
-            1618,
-            1623,
-            1628,
-            1634,
-            1635,
-            1644,
-            1645,
-            1650,
-            1651,
-            1660,
-            1666,
-            1676,
-            1677,
-            1682,
-            1692,
-            1698,
-            1699,
-            1708,
-            1709,
-            1714,
-            1715,
-            1724,
-            1730,
-            1740,
-            1746,
-            1747,
-            1756,
-            1762,
-            1767,
-            1772,
-            1777,
-            1778,
-            1783,
-            1788,
-            1794,
-            1804,
-            1809,
-            1810,
-            1811,
-            1820,
-            1821,
-            1826,
-            1831,
-            1836,
-            1841,
-            1842,
-            1843,
-            1852,
-            1853,
-            1858,
-            1867,
-            1868,
-            1874,
-            1875,
-            1885,
-            1891,
-            1892,
-            1902,
-            1908,
-            1917,
-            1918,
-            1919,
-            1924,
-            1933,
-            1939,
-            1940,
-            1949,
-            1950,
-            1951,
-            1956,
-            1966,
-            1972,
-            1973,
-            1983,
-            1988,
-            1989,
-            1990,
-            1999,
-            2004,
-            2005,
-            2010,
-            2015,
-            2020,
-            2021,
-            2026,
-            2031,
-            2036,
-            2041,
-            2046,
-            2051,
-            2052,
-            2061,
-            2066,
-            2067,
-            2072,
-            2077,
-            2082,
-            2083,
-            2084,
-            2093,
-            2098,
-            2107,
-            2112,
-            2113,
-            2118,
-            2123,
-            2128,
-            2137,
-            2142,
-            2143,
-            2152,
-            2153,
-            2158,
-            2159,
-            2168,
-            2173,
-            2174,
-            2175,
-            2184,
-            2189,
-            2198,
-            2199,
-            2204,
-            2205,
-            2214,
-            2219,
-            2228,
-            2229,
-            2230,
-            2237,
-            2238,
-            2247,
-            2252,
-            2253,
-            2254,
-            2263,
-            2268,
-            2277,
-            2282,
-            2291,
-            2292,
-            2297,
-            2298,
-            2307,
-            2308,
-            2313,
-            2314,
-            2323,
-            2324,
-            2329,
-            2330,
-            2339,
-            2340,
-            2345,
-            2346,
-            2355,
-            2361,
-            2362,
-            2371,
-            2372,
-            2377,
-            2378,
-            2387,
-            2388,
-            2393,
-            2394,
-            2403,
-            2408,
-            2417,
-            2422,
-            2431,
-            2436,
-            2445,
-            2450,
-            2459,
-            2464,
-            2473,
-            2474,
-            2479,
-            2480,
-            2489,
-            2494,
-            2495,
-            2504,
-            2505,
-            2510,
-            2519,
-            2524,
-            2533,
-            2534,
-            2539,
-            2548,
-            2557,
-            2590,
-            2599,
-            2604,
-            2613,
-            2628,
-            2632,
-            2633,
-            2636,
-            2638,
-            2647,
-            2655,
-            2664,
-            2668,
-            2669,
-            2674,
-            2675,
-            2676,
-            2686,
-            2687,
-            2688,
-            2689,
-            2690,
-            2691,
-            2692,
-            2700,
-            2701,
-            2702,
-            2714,
-            2720,
-            2728,
-            2737,
-            2738,
-            2743,
-            2752,
-            2753,
-            2754,
-            2755,
-            2756,
-            2757,
-            2758,
-            2759,
-            2764,
-            2773,
-            2774,
-            2775,
-            2776,
-            2777,
-            2782,
-            2783,
-            2792,
-            2793,
-            2794,
-            2795,
-            2796,
-            2797,
-            2802,
-            2803,
-            2804,
-            2805,
-            2814,
-            2819,
-            2820,
-            2821,
-            2822,
-            2823,
-            2832,
-            2837,
-            2838,
-            2847,
-            2852,
-            2853,
-            2854,
-            2863,
-            2868,
-            2892,
-            2893,
-            2898,
-            2907,
-            2912,
-            2921,
-            2922,
-            2927,
-            2936,
-            2941,
-            2950,
-            2955,
-            2964,
-            2969,
-            2978,
-            2979,
-            2984,
-            2985,
-            2986,
-            2987,
-            2988,
-            2989,
-            2990,
-            2991,
-            2992,
-            2993,
-            2994,
-            2995,
-            3004,
-            3009,
-            3018,
-            3023,
-            3032,
-            3037,
-            3050,
-            3051,
-            3052,
-            3053,
-            3054,
-            3055,
-            3056,
-            3057,
-            3058,
-            3059,
-            3060,
-            3061,
-            3062,
-            3063,
-            3064,
-            3073,
-            3078,
-            3087,
-            3088,
-            3089,
-            3094,
-            3103,
-            3104,
-            3109,
-            3118,
-            3119,
-            3124,
-            3125,
-            3126,
-            3135,
-            3140,
-            3141,
-            3150,
-            3155,
-            3156,
-            3157,
-            3166,
-            3167,
-            3172,
-            3173,
-            3182,
-            3183,
-            3188,
-            3189,
-            3198,
-            3199,
-            3204,
-            3205,
-            3214,
-            3215,
-            3221,
-            3230,
-            3231,
-            3236,
-            3237,
-            3246,
-            3247,
-            3252,
-            3253,
-            3262,
-            3263,
-            3268,
-            3269,
-            3278,
-            3279,
-            3284,
-            3293,
-            3294,
-            3299,
-            3308,
-            3313,
-            3322,
-            3323,
-            3328,
-            3329,
-            3338,
-            3339,
-            3344,
-            3353,
-            3358,
-            3359,
-            3368,
-            3369,
-            3383,
-            3384,
-            3385,
-            3390,
-            3391,
-            3400,
-            3401,
-            3406,
-            3415,
-            3416,
-            3422,
-            3431,
-            3437,
-            3450,
-            3460,
-            3466,
-            3476,
-            3481,
-            3491,
-            3496,
-            3506,
-            3511,
-            3520,
-            3526,
-            3535,
-            3540,
-            3549,
-            3555,
-            3565,
-            3571,
-            3581,
-            3595,
-            3596,
-            3610,
-            3616,
-            3631,
-            3632,
-            3641,
-            3647,
-            3656,
-            3662,
-            3667,
-            3672,
-            3682,
-            3687,
-            3696
-        ],
-        "useLatestExplanation": true
-    }
-]
\ No newline at end of file
+[{"title": "LeetCode 75", "description": "Problem list from official https://leetcode.com/studyplan/leetcode-75/", "tags": ["Array", "String", "Two Pointers", "Sliding Window", "Prefix Sum", "Hash Map", "Stack", "Queue", "Linked List", "Binary Tree", "Graph", "Dynamic Programming"], "problems": [104, 136, 206, 283, 338, 345, 374, 392, 605, 643, 700, 724, 746, 872, 933, 1071, 1137, 1207, 1431, 1732, 1768, 2215, 11, 17, 62, 72, 151, 162, 198, 199, 208, 215, 216, 236, 238, 328, 334, 394, 399, 435, 437, 443, 450, 452, 547, 649, 714, 735, 739, 790, 841, 875, 901, 994, 1004, 1143, 1161, 1268, 1318, 1372, 1448, 1456, 1466, 1493, 1657, 1679, 1926, 2095, 2130, 2300, 2336, 2352, 2390, 2462, 2542]}, {"title": "LeetCode Top 150", "description": "Problem list from official https://leetcode.com/studyplan/top-interview-150", "tags": [], "problems": [1, 9, 13, 14, 20, 21, 26, 27, 28, 35, 58, 66, 67, 69, 70, 88, 100, 101, 104, 108, 112, 121, 125, 136, 141, 169, 190, 191, 202, 205, 219, 222, 226, 228, 242, 290, 383, 392, 530, 637, 2, 3, 5, 6, 11, 12, 15, 17, 19, 22, 33, 34, 36, 39, 45, 46, 48, 49, 50, 53, 54, 55, 56, 57, 61, 63, 64, 71, 72, 73, 74, 77, 79, 80, 82, 86, 92, 97, 98, 102, 103, 105, 106, 114, 117, 120, 122, 128, 129, 130, 133, 134, 137, 138, 139, 146, 148, 150, 151, 153, 155, 162, 167, 172, 173, 189, 198, 199, 200, 201, 207, 208, 209, 210, 211, 215, 221, 230, 236, 238, 274, 289, 300, 322, 373, 380, 399, 427, 433, 452, 909, 918, 4, 23, 25, 30, 42, 52, 68, 76, 123, 124, 127, 135, 149, 188, 212, 224, 295, 502]}, {"title": "Top 100 Liked Questions", "description": "Problem list from official https://leetcode.com/studyplan/top-100-liked/", "tags": ["Essential", "High-Value Interview Prep"], "problems": [1, 20, 21, 70, 94, 101, 104, 121, 136, 141, 160, 169, 190, 206, 234, 242, 344, 412, 448, 543, 617, 876, 1046, 1304, 1337, 1480, 1528, 1672, 2, 3, 5, 7, 11, 15, 17, 19, 31, 33, 34, 39, 46, 48, 49, 53, 56, 62, 64, 72, 75, 78, 79, 98, 102, 105, 114, 128, 139, 146, 148, 155, 198, 199, 200, 207, 208, 215, 221, 230, 236, 238, 240, 287, 300, 322, 337, 347, 378, 438, 494, 560, 581, 647, 695, 739, 973, 981, 994, 1029, 1167, 1249, 1288, 1423, 1584, 4, 23, 42, 76, 84, 124, 297, 460]}, {"title": "All", "description": "", "tags": [], "problems": [1, 2, 3, 4, 5, 6, 7, 9, 11, 12, 13, 14, 15, 17, 19, 20, 21, 22, 23, 25, 26, 27, 28, 30, 31, 33, 34, 35, 36, 39, 42, 45, 46, 48, 49, 50, 52, 53, 54, 55, 56, 57, 58, 61, 62, 63, 64, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 82, 84, 86, 88, 89, 92, 94, 97, 98, 100, 101, 102, 103, 104, 105, 106, 108, 112, 114, 116, 117, 120, 121, 122, 123, 124, 125, 127, 128, 129, 130, 133, 134, 135, 136, 137, 138, 139, 141, 142, 146, 148, 149, 150, 151, 152, 153, 155, 156, 157, 158, 159, 160, 161, 162, 163, 167, 169, 170, 172, 173, 188, 189, 190, 191, 198, 199, 200, 201, 202, 205, 206, 207, 208, 209, 210, 211, 212, 215, 216, 217, 219, 221, 222, 224, 226, 228, 230, 234, 235, 236, 237, 238, 239, 240, 242, 268, 274, 278, 283, 287, 289, 290, 295, 297, 300, 322, 328, 334, 337, 338, 344, 345, 347, 373, 374, 378, 380, 383, 392, 394, 399, 409, 412, 427, 433, 435, 437, 438, 443, 448, 450, 452, 460, 494, 502, 509, 530, 543, 547, 560, 581, 605, 617, 637, 643, 647, 649, 695, 700, 701, 704, 714, 724, 733, 735, 739, 746, 790, 797, 841, 872, 875, 876, 901, 909, 918, 933, 973, 981, 994, 997, 1004, 1008, 1029, 1038, 1046, 1071, 1079, 1127, 1137, 1143, 1161, 1167, 1207, 1249, 1261, 1268, 1288, 1304, 1318, 1337, 1347, 1372, 1423, 1431, 1448, 1456, 1466, 1480, 1493, 1515, 1523, 1528, 1551, 1557, 1584, 1605, 1630, 1657, 1672, 1679, 1704, 1732, 1768, 1769, 1798, 1823, 1828, 1920, 1925, 1926, 1929, 1957, 1963, 2011, 2044, 2095, 2110, 2119, 2120, 2125, 2130, 2147, 2161, 2181, 2211, 2215, 2221, 2265, 2300, 2326, 2336, 2352, 2390, 2419, 2433, 2462, 2482, 2542, 2627, 2657, 2703, 2723, 2769, 2785, 2807, 2862, 2879, 2884, 2888, 2894, 2942, 3100, 3110, 3133, 3164, 3190, 3197, 3228, 3291, 3320, 3351, 3380, 3381, 3413, 3424, 3432, 3444, 3471, 3512, 3522, 3531, 3562, 3577, 3583, 3602, 3603, 3606, 3607, 3608, 3622, 3623, 3625, 3663, 3668, 3678, 3683, 3688, 3692, 3697, 3701, 3702, 3703, 3705, 3707, 3708, 3709, 3712, 3713, 3714, 3718, 3719, 3720, 3722, 3723, 3724, 3726, 3727, 3728, 3731, 3732, 3733, 3736, 3737, 3738, 3739, 3740, 3741, 3742, 3743, 3745, 3747, 3748, 3750, 3751, 3752, 3753, 3754, 3755, 3756, 3757, 3759, 3760, 3761, 3764, 3765, 3766, 3767, 3768, 3770, 3771, 3772]}, {"title": "Visualization", "description": "", "tags": [], "problems": [1, 2, 11, 1431, 1679, 1768, 1798, 2215, 3603, 3622, 3623]}, {"title": "All-TODO", "description": "", "tags": [], "problems": [8, 10, 16, 18, 24, 29, 32, 37, 38, 40, 41, 43, 44, 47, 51, 59, 60, 65, 81, 83, 85, 87, 90, 91, 93, 95, 96, 99, 107, 109, 110, 111, 113, 115, 118, 119, 126, 131, 132, 140, 143, 144, 145, 147, 154, 164, 165, 166, 168, 171, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 187, 192, 193, 194, 195, 196, 197, 203, 204, 213, 214, 218, 220, 223, 225, 227, 229, 231, 232, 233, 241, 257, 258, 260, 262, 263, 264, 273, 275, 279, 282, 284, 292, 299, 301, 303, 304, 306, 307, 309, 310, 312, 313, 315, 316, 318, 319, 321, 324, 326, 327, 329, 330, 331, 332, 335, 336, 341, 342, 343, 349, 350, 352, 354, 355, 357, 363, 365, 367, 368, 370, 371, 372, 375, 376, 377, 379, 381, 382, 384, 385, 386, 387, 388, 389, 390, 391, 393, 395, 396, 397, 398, 400, 401, 402, 403, 404, 405, 406, 407, 408, 410, 411, 413, 414, 415, 416, 417, 418, 419, 420, 421, 422, 423, 424, 425, 426, 428, 429, 430, 431, 432, 434, 436, 439, 440, 441, 442, 444, 445, 446, 447, 449, 451, 453, 454, 455, 456, 457, 458, 459, 461, 462, 463, 464, 465, 466, 467, 468, 469, 470, 471, 472, 473, 474, 475, 476, 477, 478, 479, 480, 481, 482, 483, 484, 485, 486, 487, 488, 489, 490, 491, 492, 493, 495, 496, 497, 498, 499, 500, 501, 503, 504, 505, 506, 507, 508, 510, 511, 512, 513, 514, 515, 516, 517, 518, 519, 520, 521, 522, 523, 524, 525, 526, 527, 528, 529, 531, 532, 533, 534, 535, 536, 537, 538, 539, 540, 541, 542, 544, 545, 546, 548, 549, 550, 551, 552, 553, 554, 555, 556, 557, 558, 559, 561, 562, 563, 564, 565, 566, 567, 568, 569, 570, 571, 572, 573, 574, 575, 576, 577, 578, 579, 580, 582, 583, 584, 585, 586, 587, 588, 589, 590, 591, 592, 593, 594, 595, 596, 597, 598, 599, 600, 601, 602, 603, 604, 606, 607, 608, 609, 610, 611, 612, 613, 614, 615, 616, 618, 619, 620, 621, 622, 623, 624, 625, 626, 627, 628, 629, 630, 631, 632, 633, 634, 635, 636, 638, 639, 640, 641, 642, 644, 645, 646, 648, 650, 651, 652, 653, 654, 655, 656, 657, 658, 659, 660, 661, 662, 663, 664, 665, 666, 667, 668, 669, 670, 671, 672, 673, 674, 675, 676, 677, 678, 679, 680, 681, 682, 683, 684, 685, 686, 687, 688, 689, 690, 691, 692, 693, 694, 696, 697, 698, 699, 702, 703, 705, 706, 707, 708, 709, 710, 711, 712, 713, 715, 716, 717, 718, 719, 720, 721, 722, 723, 725, 726, 727, 728, 729, 730, 731, 732, 734, 736, 737, 738, 740, 741, 742, 743, 744, 745, 747, 748, 749, 750, 751, 752, 753, 754, 755, 756, 757, 758, 759, 760, 761, 762, 763, 764, 765, 766, 767, 768, 769, 770, 771, 772, 773, 774, 775, 776, 777, 778, 779, 780, 781, 782, 783, 784, 785, 786, 787, 788, 789, 791, 792, 793, 794, 795, 796, 798, 799, 800, 801, 802, 803, 804, 805, 806, 807, 808, 809, 810, 811, 812, 813, 814, 815, 816, 817, 818, 819, 820, 821, 822, 823, 824, 825, 826, 827, 828, 829, 830, 831, 832, 833, 834, 835, 836, 837, 838, 839, 840, 842, 843, 844, 845, 846, 847, 848, 849, 850, 851, 852, 853, 854, 855, 856, 857, 858, 859, 860, 861, 862, 863, 864, 865, 866, 867, 868, 869, 870, 871, 873, 874, 877, 878, 879, 880, 881, 882, 883, 884, 885, 886, 887, 888, 889, 890, 891, 892, 893, 894, 895, 896, 897, 898, 899, 900, 902, 903, 904, 905, 906, 907, 908, 910, 911, 912, 913, 914, 915, 916, 917, 919, 920, 921, 922, 923, 924, 925, 926, 927, 928, 929, 930, 931, 932, 934, 935, 936, 937, 938, 939, 940, 941, 942, 943, 944, 945, 946, 947, 948, 949, 950, 951, 952, 953, 954, 955, 956, 957, 958, 959, 960, 961, 962, 963, 964, 965, 966, 967, 968, 969, 970, 971, 972, 974, 975, 976, 977, 978, 979, 980, 982, 983, 984, 985, 986, 987, 988, 989, 990, 991, 992, 993, 995, 996, 998, 999, 1000, 1001, 1002, 1003, 1005, 1006, 1007, 1009, 1010, 1011, 1012, 1013, 1014, 1015, 1016, 1017, 1018, 1019, 1020, 1021, 1022, 1023, 1024, 1025, 1026, 1027, 1028, 1030, 1031, 1032, 1033, 1034, 1035, 1036, 1037, 1039, 1040, 1041, 1042, 1043, 1044, 1045, 1047, 1048, 1049, 1050, 1051, 1052, 1053, 1054, 1061, 1068, 1070, 1072, 1073, 1074, 1075, 1078, 1080, 1081, 1084, 1089, 1090, 1091, 1092, 1093, 1094, 1095, 1096, 1103, 1104, 1105, 1106, 1108, 1109, 1110, 1111, 1114, 1115, 1116, 1117, 1122, 1123, 1124, 1125, 1128, 1129, 1130, 1131, 1138, 1139, 1140, 1141, 1144, 1145, 1146, 1147, 1148, 1154, 1155, 1156, 1157, 1158, 1160, 1162, 1163, 1164, 1169, 1170, 1171, 1172, 1174, 1175, 1177, 1178, 1179, 1184, 1185, 1186, 1187, 1189, 1190, 1191, 1192, 1193, 1195, 1200, 1201, 1202, 1203, 1204, 1206, 1208, 1209, 1210, 1211, 1217, 1218, 1219, 1220, 1221, 1222, 1223, 1224, 1226, 1227, 1232, 1233, 1234, 1235, 1237, 1238, 1239, 1240, 1247, 1248, 1250, 1251, 1252, 1253, 1254, 1255, 1260, 1262, 1263, 1266, 1267, 1269, 1275, 1276, 1277, 1278, 1280, 1281, 1282, 1283, 1284, 1286, 1287, 1289, 1290, 1291, 1292, 1293, 1295, 1296, 1297, 1298, 1299, 1300, 1301, 1302, 1305, 1306, 1307, 1309, 1310, 1311, 1312, 1313, 1314, 1315, 1316, 1317, 1319, 1320, 1321, 1323, 1324, 1325, 1326, 1327, 1328, 1329, 1330, 1331, 1332, 1333, 1334, 1335, 1338, 1339, 1340, 1341, 1342, 1343, 1344, 1345, 1346, 1348, 1349, 1351, 1352, 1353, 1354, 1356, 1357, 1358, 1359, 1360, 1361, 1362, 1363, 1365, 1366, 1367, 1368, 1370, 1371, 1373, 1374, 1375, 1376, 1377, 1378, 1379, 1380, 1381, 1382, 1383, 1385, 1386, 1387, 1388, 1389, 1390, 1391, 1392, 1393, 1394, 1395, 1396, 1397, 1399, 1400, 1401, 1402, 1403, 1404, 1405, 1406, 1407, 1408, 1409, 1410, 1411, 1413, 1414, 1415, 1416, 1417, 1418, 1419, 1420, 1422, 1424, 1425, 1432, 1433, 1434, 1436, 1437, 1438, 1439, 1441, 1442, 1443, 1444, 1446, 1447, 1449, 1450, 1451, 1452, 1453, 1455, 1457, 1458, 1460, 1461, 1462, 1463, 1464, 1465, 1467, 1470, 1471, 1472, 1473, 1475, 1476, 1477, 1478, 1481, 1482, 1483, 1484, 1486, 1487, 1488, 1489, 1491, 1492, 1494, 1496, 1497, 1498, 1499, 1502, 1503, 1504, 1505, 1507, 1508, 1509, 1510, 1512, 1513, 1514, 1517, 1518, 1519, 1520, 1521, 1524, 1525, 1526, 1527, 1529, 1530, 1531, 1534, 1535, 1536, 1537, 1539, 1540, 1541, 1542, 1544, 1545, 1546, 1547, 1550, 1552, 1553, 1556, 1558, 1559, 1560, 1561, 1562, 1563, 1566, 1567, 1568, 1569, 1572, 1573, 1574, 1575, 1576, 1577, 1578, 1579, 1581, 1582, 1583, 1585, 1587, 1588, 1589, 1590, 1591, 1592, 1593, 1594, 1595, 1598, 1599, 1600, 1601, 1603, 1604, 1606, 1608, 1609, 1610, 1611, 1614, 1615, 1616, 1617, 1619, 1620, 1621, 1622, 1624, 1625, 1626, 1627, 1629, 1631, 1632, 1633, 1636, 1637, 1638, 1639, 1640, 1641, 1642, 1643, 1646, 1647, 1648, 1649, 1652, 1653, 1654, 1655, 1656, 1658, 1659, 1661, 1662, 1663, 1664, 1665, 1667, 1668, 1669, 1670, 1671, 1673, 1674, 1675, 1678, 1680, 1681, 1683, 1684, 1685, 1686, 1687, 1688, 1689, 1690, 1691, 1693, 1694, 1695, 1696, 1697, 1700, 1701, 1702, 1703, 1705, 1706, 1707, 1710, 1711, 1712, 1713, 1716, 1717, 1718, 1719, 1720, 1721, 1722, 1723, 1725, 1726, 1727, 1728, 1729, 1731, 1733, 1734, 1735, 1736, 1737, 1738, 1739, 1741, 1742, 1743, 1744, 1745, 1748, 1749, 1750, 1751, 1752, 1753, 1754, 1755, 1757, 1758, 1759, 1760, 1761, 1763, 1764, 1765, 1766, 1770, 1771, 1773, 1774, 1775, 1776, 1779, 1780, 1781, 1782, 1784, 1785, 1786, 1787, 1789, 1790, 1791, 1792, 1793, 1795, 1796, 1797, 1799, 1800, 1801, 1802, 1803, 1805, 1806, 1807, 1808, 1812, 1813, 1814, 1815, 1816, 1817, 1818, 1819, 1822, 1824, 1825, 1827, 1829, 1830, 1832, 1833, 1834, 1835, 1837, 1838, 1839, 1840, 1844, 1845, 1846, 1847, 1848, 1849, 1850, 1851, 1854, 1855, 1856, 1857, 1859, 1860, 1861, 1862, 1863, 1864, 1865, 1866, 1869, 1870, 1871, 1872, 1873, 1876, 1877, 1878, 1879, 1880, 1881, 1882, 1883, 1884, 1886, 1887, 1888, 1889, 1890, 1893, 1894, 1895, 1896, 1897, 1898, 1899, 1900, 1901, 1903, 1904, 1905, 1906, 1907, 1909, 1910, 1911, 1912, 1913, 1914, 1915, 1916, 1921, 1922, 1923, 1927, 1928, 1930, 1931, 1932, 1934, 1935, 1936, 1937, 1938, 1941, 1942, 1943, 1944, 1945, 1946, 1947, 1948, 1952, 1953, 1954, 1955, 1958, 1959, 1960, 1961, 1962, 1964, 1965, 1967, 1968, 1969, 1970, 1971, 1974, 1975, 1976, 1977, 1978, 1979, 1980, 1981, 1982, 1984, 1985, 1986, 1987, 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 2000, 2001, 2002, 2003, 2006, 2007, 2008, 2009, 2012, 2013, 2014, 2016, 2017, 2018, 2019, 2022, 2023, 2024, 2025, 2027, 2028, 2029, 2030, 2032, 2033, 2034, 2035, 2037, 2038, 2039, 2040, 2042, 2043, 2045, 2047, 2048, 2049, 2050, 2053, 2054, 2055, 2056, 2057, 2058, 2059, 2060, 2062, 2063, 2064, 2065, 2068, 2069, 2070, 2071, 2073, 2074, 2075, 2076, 2078, 2079, 2080, 2081, 2085, 2086, 2087, 2088, 2089, 2090, 2091, 2092, 2094, 2096, 2097, 2099, 2100, 2101, 2102, 2103, 2104, 2105, 2106, 2108, 2109, 2111, 2114, 2115, 2116, 2117, 2121, 2122, 2124, 2126, 2127, 2129, 2131, 2132, 2133, 2134, 2135, 2136, 2138, 2139, 2140, 2141, 2144, 2145, 2146, 2148, 2149, 2150, 2151, 2154, 2155, 2156, 2157, 2160, 2162, 2163, 2164, 2165, 2166, 2167, 2169, 2170, 2171, 2172, 2176, 2177, 2178, 2179, 2180, 2182, 2183, 2185, 2186, 2187, 2188, 2190, 2191, 2192, 2193, 2194, 2195, 2196, 2197, 2200, 2201, 2202, 2203, 2206, 2207, 2208, 2209, 2210, 2212, 2213, 2216, 2217, 2218, 2220, 2222, 2223, 2224, 2225, 2226, 2227, 2231, 2232, 2233, 2234, 2235, 2236, 2239, 2240, 2241, 2242, 2243, 2244, 2245, 2246, 2248, 2249, 2250, 2251, 2255, 2256, 2257, 2258, 2259, 2260, 2261, 2262, 2264, 2266, 2267, 2269, 2270, 2271, 2272, 2273, 2274, 2275, 2276, 2278, 2279, 2280, 2281, 2283, 2284, 2285, 2286, 2287, 2288, 2289, 2290, 2293, 2294, 2295, 2296, 2299, 2301, 2302, 2303, 2304, 2305, 2306, 2309, 2310, 2311, 2312, 2315, 2316, 2317, 2318, 2319, 2320, 2321, 2322, 2325, 2327, 2328, 2331, 2332, 2333, 2334, 2335, 2337, 2338, 2341, 2342, 2343, 2344, 2347, 2348, 2349, 2350, 2351, 2353, 2354, 2356, 2357, 2358, 2359, 2360, 2363, 2364, 2365, 2366, 2367, 2368, 2369, 2370, 2373, 2374, 2375, 2376, 2379, 2380, 2381, 2382, 2383, 2384, 2385, 2386, 2389, 2391, 2392, 2395, 2396, 2397, 2398, 2399, 2400, 2401, 2402, 2404, 2405, 2406, 2407, 2409, 2410, 2411, 2412, 2413, 2414, 2415, 2416, 2418, 2420, 2421, 2423, 2424, 2425, 2426, 2427, 2428, 2429, 2430, 2432, 2434, 2435, 2437, 2438, 2439, 2440, 2441, 2442, 2443, 2444, 2446, 2447, 2448, 2449, 2451, 2452, 2453, 2454, 2455, 2456, 2457, 2458, 2460, 2461, 2463, 2465, 2466, 2467, 2468, 2469, 2470, 2471, 2472, 2475, 2476, 2477, 2478, 2481, 2483, 2484, 2485, 2486, 2487, 2488, 2490, 2491, 2492, 2493, 2496, 2497, 2498, 2499, 2500, 2501, 2502, 2503, 2506, 2507, 2508, 2509, 2511, 2512, 2513, 2514, 2515, 2516, 2517, 2518, 2520, 2521, 2522, 2523, 2525, 2526, 2527, 2528, 2529, 2530, 2531, 2532, 2535, 2536, 2537, 2538, 2540, 2541, 2543, 2544, 2545, 2546, 2547, 2549, 2550, 2551, 2552, 2553, 2554, 2555, 2556, 2558, 2559, 2560, 2561, 2562, 2563, 2564, 2565, 2566, 2567, 2568, 2569, 2570, 2571, 2572, 2573, 2574, 2575, 2576, 2577, 2578, 2579, 2580, 2581, 2582, 2583, 2584, 2585, 2586, 2587, 2588, 2589, 2591, 2592, 2593, 2594, 2595, 2596, 2597, 2598, 2600, 2601, 2602, 2603, 2605, 2606, 2607, 2608, 2609, 2610, 2611, 2612, 2614, 2615, 2616, 2617, 2618, 2619, 2620, 2621, 2622, 2623, 2624, 2625, 2626, 2629, 2630, 2631, 2634, 2635, 2637, 2639, 2640, 2641, 2642, 2643, 2644, 2645, 2646, 2648, 2649, 2650, 2651, 2652, 2653, 2654, 2656, 2658, 2659, 2660, 2661, 2662, 2663, 2665, 2666, 2667, 2670, 2671, 2672, 2673, 2677, 2678, 2679, 2680, 2681, 2682, 2683, 2684, 2685, 2693, 2694, 2695, 2696, 2697, 2698, 2699, 2704, 2705, 2706, 2707, 2708, 2709, 2710, 2711, 2712, 2713, 2715, 2716, 2717, 2718, 2719, 2721, 2722, 2724, 2725, 2726, 2727, 2729, 2730, 2731, 2732, 2733, 2734, 2735, 2736, 2739, 2740, 2741, 2742, 2744, 2745, 2746, 2747, 2748, 2749, 2750, 2751, 2760, 2761, 2762, 2763, 2765, 2766, 2767, 2768, 2770, 2771, 2772, 2778, 2779, 2780, 2781, 2784, 2786, 2787, 2788, 2789, 2790, 2791, 2798, 2799, 2800, 2801, 2806, 2808, 2809, 2810, 2811, 2812, 2813, 2815, 2816, 2817, 2818, 2824, 2825, 2826, 2827, 2828, 2829, 2830, 2831, 2833, 2834, 2835, 2836, 2839, 2840, 2841, 2842, 2843, 2844, 2845, 2846, 2848, 2849, 2850, 2851, 2855, 2856, 2857, 2858, 2859, 2860, 2861, 2864, 2865, 2866, 2867, 2869, 2870, 2871, 2872, 2873, 2874, 2875, 2876, 2877, 2878, 2880, 2881, 2882, 2883, 2885, 2886, 2887, 2889, 2890, 2891, 2895, 2896, 2897, 2899, 2900, 2901, 2902, 2903, 2904, 2905, 2906, 2908, 2909, 2910, 2911, 2913, 2914, 2915, 2916, 2917, 2918, 2919, 2920, 2923, 2924, 2925, 2926, 2928, 2929, 2930, 2931, 2932, 2933, 2934, 2935, 2937, 2938, 2939, 2940, 2943, 2944, 2945, 2946, 2947, 2948, 2949, 2951, 2952, 2953, 2954, 2956, 2957, 2958, 2959, 2960, 2961, 2962, 2963, 2965, 2966, 2967, 2968, 2970, 2971, 2972, 2973, 2974, 2975, 2976, 2977, 2980, 2981, 2982, 2983, 2996, 2997, 2998, 2999, 3000, 3001, 3002, 3003, 3005, 3006, 3007, 3008, 3010, 3011, 3012, 3013, 3014, 3015, 3016, 3017, 3019, 3020, 3021, 3022, 3024, 3025, 3026, 3027, 3028, 3029, 3030, 3031, 3033, 3034, 3035, 3036, 3038, 3039, 3040, 3041, 3042, 3043, 3044, 3045, 3046, 3047, 3048, 3049, 3065, 3066, 3067, 3068, 3069, 3070, 3071, 3072, 3074, 3075, 3076, 3077, 3079, 3080, 3081, 3082, 3083, 3084, 3085, 3086, 3090, 3091, 3092, 3093, 3095, 3096, 3097, 3098, 3099, 3101, 3102, 3105, 3106, 3107, 3108, 3111, 3112, 3113, 3114, 3115, 3116, 3117, 3120, 3121, 3122, 3123, 3127, 3128, 3129, 3130, 3131, 3132, 3134, 3136, 3137, 3138, 3139, 3142, 3143, 3144, 3145, 3146, 3147, 3148, 3149, 3151, 3152, 3153, 3154, 3158, 3159, 3160, 3161, 3162, 3163, 3165, 3168, 3169, 3170, 3171, 3174, 3175, 3176, 3177, 3178, 3179, 3180, 3181, 3184, 3185, 3186, 3187, 3191, 3192, 3193, 3194, 3195, 3196, 3200, 3201, 3202, 3203, 3206, 3207, 3208, 3209, 3210, 3211, 3212, 3213, 3216, 3217, 3218, 3219, 3220, 3222, 3223, 3224, 3225, 3226, 3227, 3229, 3232, 3233, 3234, 3235, 3238, 3239, 3240, 3241, 3242, 3243, 3244, 3245, 3248, 3249, 3250, 3251, 3254, 3255, 3256, 3257, 3258, 3259, 3260, 3261, 3264, 3265, 3266, 3267, 3270, 3271, 3272, 3273, 3274, 3275, 3276, 3277, 3280, 3281, 3282, 3283, 3285, 3286, 3287, 3288, 3289, 3290, 3292, 3295, 3296, 3297, 3298, 3300, 3301, 3302, 3303, 3304, 3305, 3306, 3307, 3309, 3310, 3311, 3312, 3314, 3315, 3316, 3317, 3318, 3319, 3321, 3324, 3325, 3326, 3327, 3330, 3331, 3332, 3333, 3334, 3335, 3336, 3337, 3340, 3341, 3342, 3343, 3345, 3346, 3347, 3348, 3349, 3350, 3352, 3354, 3355, 3356, 3357, 3360, 3361, 3362, 3363, 3364, 3365, 3366, 3367, 3370, 3371, 3372, 3373, 3374, 3375, 3376, 3377, 3378, 3379, 3382, 3386, 3387, 3388, 3389, 3392, 3393, 3394, 3395, 3396, 3397, 3398, 3399, 3402, 3403, 3404, 3405, 3407, 3408, 3409, 3410, 3411, 3412, 3414, 3417, 3418, 3419, 3420, 3421, 3423, 3425, 3426, 3427, 3428, 3429, 3430, 3433, 3434, 3435, 3436, 3438, 3439, 3440, 3441, 3442, 3443, 3445, 3446, 3447, 3448, 3449, 3451, 3452, 3453, 3454, 3455, 3456, 3457, 3458, 3459, 3461, 3462, 3463, 3464, 3465, 3467, 3468, 3469, 3470, 3472, 3473, 3474, 3475, 3477, 3478, 3479, 3480, 3482, 3483, 3484, 3485, 3486, 3487, 3488, 3489, 3490, 3492, 3493, 3494, 3495, 3497, 3498, 3499, 3500, 3501, 3502, 3503, 3504, 3505, 3507, 3508, 3509, 3510, 3513, 3514, 3515, 3516, 3517, 3518, 3519, 3521, 3523, 3524, 3525, 3527, 3528, 3529, 3530, 3532, 3533, 3534, 3536, 3537, 3538, 3539, 3541, 3542, 3543, 3544, 3545, 3546, 3547, 3548, 3550, 3551, 3552, 3553, 3554, 3556, 3557, 3558, 3559, 3560, 3561, 3563, 3564, 3566, 3567, 3568, 3569, 3570, 3572, 3573, 3574, 3575, 3576, 3578, 3579, 3580, 3582, 3584, 3585, 3586, 3587, 3588, 3589, 3590, 3591, 3592, 3593, 3594, 3597, 3598, 3599, 3600, 3601, 3604, 3605, 3609, 3611, 3612, 3613, 3614, 3615, 3617, 3618, 3619, 3620, 3621, 3624, 3626, 3627, 3628, 3629, 3630, 3633, 3634, 3635, 3636, 3637, 3638, 3639, 3640, 3642, 3643, 3644, 3645, 3646, 3648, 3649, 3650, 3651, 3652, 3653, 3654, 3655, 3657, 3658, 3659, 3660, 3661, 3664, 3665, 3666, 3669, 3670, 3671, 3673, 3674, 3675, 3676, 3677, 3679, 3680, 3681, 3684, 3685, 3686, 3689, 3690, 3691, 3693, 3694, 3695, 3698, 3699, 3700, 3704, 3706, 3710, 3711, 3715, 3716, 3717, 3721, 3725, 3729, 3730, 3734, 3735, 3744, 3746, 3749, 3758, 3763, 3773, 3774, 3775, 3776, 3777, 3778, 3779, 3780, 3781, 3782, 3783, 3784, 3785, 3786, 3787, 3788, 3789, 3790, 3791, 3792, 3793, 3794, 3795, 3796, 3797, 3798, 3799], "premium": [27, 156, 157, 158, 159, 161, 163, 170, 186, 243, 244, 245, 246, 247, 248, 249, 250, 251, 252, 253, 254, 255, 256, 259, 261, 265, 266, 267, 269, 270, 271, 272, 276, 277, 280, 281, 285, 286, 288, 291, 293, 294, 296, 298, 302, 305, 308, 311, 314, 317, 320, 323, 325, 333, 339, 340, 346, 348, 351, 353, 356, 358, 359, 360, 361, 362, 364, 366, 369, 1055, 1056, 1057, 1058, 1059, 1060, 1062, 1063, 1064, 1065, 1066, 1067, 1069, 1076, 1077, 1082, 1083, 1085, 1086, 1087, 1088, 1097, 1098, 1099, 1100, 1101, 1102, 1107, 1112, 1113, 1118, 1119, 1120, 1121, 1126, 1127, 1132, 1133, 1134, 1135, 1136, 1142, 1149, 1150, 1151, 1152, 1153, 1159, 1165, 1166, 1167, 1168, 1173, 1176, 1180, 1181, 1182, 1183, 1188, 1194, 1196, 1197, 1198, 1199, 1205, 1212, 1213, 1214, 1215, 1216, 1225, 1228, 1229, 1230, 1231, 1236, 1241, 1242, 1243, 1244, 1245, 1246, 1256, 1257, 1258, 1259, 1264, 1265, 1270, 1271, 1272, 1273, 1274, 1279, 1285, 1294, 1303, 1308, 1322, 1336, 1350, 1355, 1364, 1369, 1384, 1398, 1412, 1421, 1426, 1427, 1428, 1429, 1430, 1435, 1440, 1445, 1454, 1459, 1468, 1469, 1474, 1479, 1485, 1490, 1495, 1500, 1501, 1506, 1511, 1516, 1522, 1532, 1533, 1538, 1543, 1548, 1549, 1554, 1555, 1564, 1565, 1570, 1571, 1580, 1586, 1596, 1597, 1602, 1607, 1612, 1613, 1618, 1623, 1628, 1634, 1635, 1644, 1645, 1650, 1651, 1660, 1666, 1676, 1677, 1682, 1692, 1698, 1699, 1708, 1709, 1714, 1715, 1724, 1730, 1740, 1746, 1747, 1756, 1762, 1767, 1772, 1777, 1778, 1783, 1788, 1794, 1804, 1809, 1810, 1811, 1820, 1821, 1826, 1831, 1836, 1841, 1842, 1843, 1852, 1853, 1858, 1867, 1868, 1874, 1875, 1885, 1891, 1892, 1902, 1908, 1917, 1918, 1919, 1924, 1933, 1939, 1940, 1949, 1950, 1951, 1956, 1966, 1972, 1973, 1983, 1988, 1989, 1990, 1999, 2004, 2005, 2010, 2015, 2020, 2021, 2026, 2031, 2036, 2041, 2046, 2051, 2052, 2061, 2066, 2067, 2072, 2077, 2082, 2083, 2084, 2093, 2098, 2107, 2112, 2113, 2118, 2123, 2128, 2137, 2142, 2143, 2152, 2153, 2158, 2159, 2168, 2173, 2174, 2175, 2184, 2189, 2198, 2199, 2204, 2205, 2214, 2219, 2228, 2229, 2230, 2237, 2238, 2247, 2252, 2253, 2254, 2263, 2268, 2277, 2282, 2291, 2292, 2297, 2298, 2307, 2308, 2313, 2314, 2323, 2324, 2329, 2330, 2339, 2340, 2345, 2346, 2355, 2361, 2362, 2371, 2372, 2377, 2378, 2387, 2388, 2393, 2394, 2403, 2408, 2417, 2422, 2431, 2436, 2445, 2450, 2459, 2464, 2473, 2474, 2479, 2480, 2489, 2494, 2495, 2504, 2505, 2510, 2519, 2524, 2533, 2534, 2539, 2548, 2557, 2590, 2599, 2604, 2613, 2628, 2632, 2633, 2636, 2638, 2647, 2655, 2664, 2668, 2669, 2674, 2675, 2676, 2686, 2687, 2688, 2689, 2690, 2691, 2692, 2700, 2701, 2702, 2714, 2720, 2728, 2737, 2738, 2743, 2752, 2753, 2754, 2755, 2756, 2757, 2758, 2759, 2764, 2773, 2774, 2775, 2776, 2777, 2782, 2783, 2792, 2793, 2794, 2795, 2796, 2797, 2802, 2803, 2804, 2805, 2814, 2819, 2820, 2821, 2822, 2823, 2832, 2837, 2838, 2847, 2852, 2853, 2854, 2863, 2868, 2892, 2893, 2898, 2907, 2912, 2921, 2922, 2927, 2936, 2941, 2950, 2955, 2964, 2969, 2978, 2979, 2984, 2985, 2986, 2987, 2988, 2989, 2990, 2991, 2992, 2993, 2994, 2995, 3004, 3009, 3018, 3023, 3032, 3037, 3050, 3051, 3052, 3053, 3054, 3055, 3056, 3057, 3058, 3059, 3060, 3061, 3062, 3063, 3064, 3073, 3078, 3087, 3088, 3089, 3094, 3103, 3104, 3109, 3118, 3119, 3124, 3125, 3126, 3135, 3140, 3141, 3150, 3155, 3156, 3157, 3166, 3167, 3172, 3173, 3182, 3183, 3188, 3189, 3198, 3199, 3204, 3205, 3214, 3215, 3221, 3230, 3231, 3236, 3237, 3246, 3247, 3252, 3253, 3262, 3263, 3268, 3269, 3278, 3279, 3284, 3293, 3294, 3299, 3308, 3313, 3322, 3323, 3328, 3329, 3338, 3339, 3344, 3353, 3358, 3359, 3368, 3369, 3383, 3384, 3385, 3390, 3391, 3400, 3401, 3406, 3415, 3416, 3422, 3431, 3437, 3450, 3460, 3466, 3476, 3481, 3491, 3496, 3506, 3511, 3520, 3526, 3535, 3540, 3549, 3555, 3565, 3571, 3581, 3595, 3596, 3610, 3616, 3631, 3632, 3641, 3647, 3656, 3662, 3667, 3672, 3682, 3687, 3696], "useLatestExplanation": true}]
\ No newline at end of file
diff --git a/data/leetcode-problems.json b/data/leetcode-problems.json
index aeccf99..d3382e2 100644
--- a/data/leetcode-problems.json
+++ b/data/leetcode-problems.json
@@ -1,25844 +1,26448 @@
 {
-  "1": {"category": "Array & Hashing", "difficulty": "Easy", "id": 1, "link": "https://leetcode.com/problems/two-sum/", "title": "Two Sum"},
+  "1": {
+    "id": 1,
+    "category": "Array & Hashing",
+    "title": "Two Sum",
+    "difficulty": "Easy",
+    "link": "https://leetcode.com/problems/two-sum/"
+  },
   "2": {
+    "id": 2,
     "category": "Linked List",
+    "title": "Add Two Numbers",
     "difficulty": "Medium",
-    "id": 2,
-    "link": "https://leetcode.com/problems/add-two-numbers/",
-    "title": "Add Two Numbers"
+    "link": "https://leetcode.com/problems/add-two-numbers/"
   },
   "3": {
+    "id": 3,
     "category": "Sliding Window",
+    "title": "Longest Substring Without Repeating Characters",
     "difficulty": "Medium",
-    "id": 3,
-    "link": "https://leetcode.com/problems/longest-substring-without-repeating-characters/",
-    "title": "Longest Substring Without Repeating Characters"
+    "link": "https://leetcode.com/problems/longest-substring-without-repeating-characters/"
   },
   "4": {
+    "id": 4,
     "category": "Binary Search",
+    "title": "Median of Two Sorted Arrays",
     "difficulty": "Hard",
-    "id": 4,
-    "link": "https://leetcode.com/problems/median-of-two-sorted-arrays/",
-    "title": "Median of Two Sorted Arrays"
+    "link": "https://leetcode.com/problems/median-of-two-sorted-arrays/"
   },
   "5": {
+    "id": 5,
     "category": "Dynamic Programming",
+    "title": "Longest Palindromic Substring",
     "difficulty": "Medium",
-    "id": 5,
-    "link": "https://leetcode.com/problems/longest-palindromic-substring/",
-    "title": "Longest Palindromic Substring"
+    "link": "https://leetcode.com/problems/longest-palindromic-substring/"
   },
   "6": {
+    "id": 6,
     "category": "Array & Hashing",
+    "title": "Zigzag Conversion",
     "difficulty": "Medium",
-    "id": 6,
-    "link": "https://leetcode.com/problems/zigzag-conversion/",
-    "title": "Zigzag Conversion"
+    "link": "https://leetcode.com/problems/zigzag-conversion/"
   },
   "7": {
+    "id": 7,
     "category": "Math & Geometry",
+    "title": "Reverse Integer",
     "difficulty": "Medium",
-    "id": 7,
-    "link": "https://leetcode.com/problems/reverse-integer/",
-    "title": "Reverse Integer"
+    "link": "https://leetcode.com/problems/reverse-integer/"
   },
   "8": {
+    "id": 8,
     "category": "Array & Hashing",
+    "title": "String to Integer (atoi)",
     "difficulty": "Medium",
-    "id": 8,
-    "link": "https://leetcode.com/problems/string-to-integer-atoi/",
-    "title": "String to Integer (atoi)"
+    "link": "https://leetcode.com/problems/string-to-integer-atoi/"
   },
   "9": {
+    "id": 9,
     "category": "Math & Geometry",
+    "title": "Palindrome Number",
     "difficulty": "Easy",
-    "id": 9,
-    "link": "https://leetcode.com/problems/palindrome-number/",
-    "title": "Palindrome Number"
+    "link": "https://leetcode.com/problems/palindrome-number/"
   },
   "10": {
+    "id": 10,
     "category": "Dynamic Programming",
+    "title": "Regular Expression Matching",
     "difficulty": "Hard",
-    "id": 10,
-    "link": "https://leetcode.com/problems/regular-expression-matching/",
-    "title": "Regular Expression Matching"
+    "link": "https://leetcode.com/problems/regular-expression-matching/"
   },
   "11": {
+    "id": 11,
     "category": "Greedy",
+    "title": "Container With Most Water",
     "difficulty": "Medium",
-    "id": 11,
-    "link": "https://leetcode.com/problems/container-with-most-water/",
-    "title": "Container With Most Water"
+    "link": "https://leetcode.com/problems/container-with-most-water/"
   },
   "12": {
+    "id": 12,
     "category": "Math & Geometry",
+    "title": "Integer to Roman",
     "difficulty": "Medium",
-    "id": 12,
-    "link": "https://leetcode.com/problems/integer-to-roman/",
-    "title": "Integer to Roman"
+    "link": "https://leetcode.com/problems/integer-to-roman/"
   },
   "13": {
+    "id": 13,
     "category": "Math & Geometry",
+    "title": "Roman to Integer",
     "difficulty": "Easy",
-    "id": 13,
-    "link": "https://leetcode.com/problems/roman-to-integer/",
-    "title": "Roman to Integer"
+    "link": "https://leetcode.com/problems/roman-to-integer/"
   },
   "14": {
+    "id": 14,
     "category": "Trie",
+    "title": "Longest Common Prefix",
     "difficulty": "Easy",
-    "id": 14,
-    "link": "https://leetcode.com/problems/longest-common-prefix/",
-    "title": "Longest Common Prefix"
+    "link": "https://leetcode.com/problems/longest-common-prefix/"
   },
-  "15": {"category": "Two Pointers", "difficulty": "Medium", "id": 15, "link": "https://leetcode.com/problems/3sum/", "title": "3Sum"},
-  "16": {
+  "15": {
+    "id": 15,
     "category": "Two Pointers",
+    "title": "3Sum",
     "difficulty": "Medium",
+    "link": "https://leetcode.com/problems/3sum/"
+  },
+  "16": {
     "id": 16,
-    "link": "https://leetcode.com/problems/3sum-closest/",
-    "title": "3Sum Closest"
+    "category": "Two Pointers",
+    "title": "3Sum Closest",
+    "difficulty": "Medium",
+    "link": "https://leetcode.com/problems/3sum-closest/"
   },
   "17": {
+    "id": 17,
     "category": "Backtracking",
+    "title": "Letter Combinations of a Phone Number",
     "difficulty": "Medium",
-    "id": 17,
-    "link": "https://leetcode.com/problems/letter-combinations-of-a-phone-number/",
-    "title": "Letter Combinations of a Phone Number"
+    "link": "https://leetcode.com/problems/letter-combinations-of-a-phone-number/"
+  },
+  "18": {
+    "id": 18,
+    "category": "Two Pointers",
+    "title": "4Sum",
+    "difficulty": "Medium",
+    "link": "https://leetcode.com/problems/4sum/"
   },
-  "18": {"category": "Two Pointers", "difficulty": "Medium", "id": 18, "link": "https://leetcode.com/problems/4sum/", "title": "4Sum"},
   "19": {
+    "id": 19,
     "category": "Linked List",
+    "title": "Remove Nth Node From End of List",
     "difficulty": "Medium",
-    "id": 19,
-    "link": "https://leetcode.com/problems/remove-nth-node-from-end-of-list/",
-    "title": "Remove Nth Node From End of List"
+    "link": "https://leetcode.com/problems/remove-nth-node-from-end-of-list/"
   },
   "20": {
+    "id": 20,
     "category": "Stack",
+    "title": "Valid Parentheses",
     "difficulty": "Easy",
-    "id": 20,
-    "link": "https://leetcode.com/problems/valid-parentheses/",
-    "title": "Valid Parentheses"
+    "link": "https://leetcode.com/problems/valid-parentheses/"
   },
   "21": {
+    "id": 21,
     "category": "Linked List",
+    "title": "Merge Two Sorted Lists",
     "difficulty": "Easy",
-    "id": 21,
-    "link": "https://leetcode.com/problems/merge-two-sorted-lists/",
-    "title": "Merge Two Sorted Lists"
+    "link": "https://leetcode.com/problems/merge-two-sorted-lists/"
   },
   "22": {
+    "id": 22,
     "category": "Dynamic Programming",
+    "title": "Generate Parentheses",
     "difficulty": "Medium",
-    "id": 22,
-    "link": "https://leetcode.com/problems/generate-parentheses/",
-    "title": "Generate Parentheses"
+    "link": "https://leetcode.com/problems/generate-parentheses/"
   },
   "23": {
+    "id": 23,
     "category": "Heap (Priority Queue)",
+    "title": "Merge k Sorted Lists",
     "difficulty": "Hard",
-    "id": 23,
-    "link": "https://leetcode.com/problems/merge-k-sorted-lists/",
-    "title": "Merge k Sorted Lists"
+    "link": "https://leetcode.com/problems/merge-k-sorted-lists/"
   },
   "24": {
+    "id": 24,
     "category": "Linked List",
+    "title": "Swap Nodes in Pairs",
     "difficulty": "Medium",
-    "id": 24,
-    "link": "https://leetcode.com/problems/swap-nodes-in-pairs/",
-    "title": "Swap Nodes in Pairs"
+    "link": "https://leetcode.com/problems/swap-nodes-in-pairs/"
   },
   "25": {
+    "id": 25,
     "category": "Linked List",
+    "title": "Reverse Nodes in k-Group",
     "difficulty": "Hard",
-    "id": 25,
-    "link": "https://leetcode.com/problems/reverse-nodes-in-k-group/",
-    "title": "Reverse Nodes in k-Group"
+    "link": "https://leetcode.com/problems/reverse-nodes-in-k-group/"
   },
   "26": {
+    "id": 26,
     "category": "Two Pointers",
+    "title": "Remove Duplicates from Sorted Array",
     "difficulty": "Easy",
-    "id": 26,
-    "link": "https://leetcode.com/problems/remove-duplicates-from-sorted-array/",
-    "title": "Remove Duplicates from Sorted Array"
+    "link": "https://leetcode.com/problems/remove-duplicates-from-sorted-array/"
   },
   "27": {
+    "id": 27,
     "category": "Two Pointers",
+    "title": "Remove Element",
     "difficulty": "Easy",
-    "id": 27,
-    "link": "https://leetcode.com/problems/remove-element/",
-    "title": "Remove Element"
+    "link": "https://leetcode.com/problems/remove-element/"
   },
   "28": {
+    "id": 28,
     "category": "Two Pointers",
+    "title": "Find the Index of the First Occurrence in a String",
     "difficulty": "Easy",
-    "id": 28,
-    "link": "https://leetcode.com/problems/find-the-index-of-the-first-occurrence-in-a-string/",
-    "title": "Find the Index of the First Occurrence in a String"
+    "link": "https://leetcode.com/problems/find-the-index-of-the-first-occurrence-in-a-string/"
   },
   "29": {
+    "id": 29,
     "category": "Bit Manipulation",
+    "title": "Divide Two Integers",
     "difficulty": "Medium",
-    "id": 29,
-    "link": "https://leetcode.com/problems/divide-two-integers/",
-    "title": "Divide Two Integers"
+    "link": "https://leetcode.com/problems/divide-two-integers/"
   },
   "30": {
+    "id": 30,
     "category": "Sliding Window",
+    "title": "Substring with Concatenation of All Words",
     "difficulty": "Hard",
-    "id": 30,
-    "link": "https://leetcode.com/problems/substring-with-concatenation-of-all-words/",
-    "title": "Substring with Concatenation of All Words"
+    "link": "https://leetcode.com/problems/substring-with-concatenation-of-all-words/"
   },
   "31": {
+    "id": 31,
     "category": "Two Pointers",
+    "title": "Next Permutation",
     "difficulty": "Medium",
-    "id": 31,
-    "link": "https://leetcode.com/problems/next-permutation/",
-    "title": "Next Permutation"
+    "link": "https://leetcode.com/problems/next-permutation/"
   },
   "32": {
+    "id": 32,
     "category": "Dynamic Programming",
+    "title": "Longest Valid Parentheses",
     "difficulty": "Hard",
-    "id": 32,
-    "link": "https://leetcode.com/problems/longest-valid-parentheses/",
-    "title": "Longest Valid Parentheses"
+    "link": "https://leetcode.com/problems/longest-valid-parentheses/"
   },
   "33": {
+    "id": 33,
     "category": "Binary Search",
+    "title": "Search in Rotated Sorted Array",
     "difficulty": "Medium",
-    "id": 33,
-    "link": "https://leetcode.com/problems/search-in-rotated-sorted-array/",
-    "title": "Search in Rotated Sorted Array"
+    "link": "https://leetcode.com/problems/search-in-rotated-sorted-array/"
   },
   "34": {
+    "id": 34,
     "category": "Binary Search",
+    "title": "Find First and Last Position of Element in Sorted Array",
     "difficulty": "Medium",
-    "id": 34,
-    "link": "https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array/",
-    "title": "Find First and Last Position of Element in Sorted Array"
+    "link": "https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array/"
   },
   "35": {
+    "id": 35,
     "category": "Binary Search",
+    "title": "Search Insert Position",
     "difficulty": "Easy",
-    "id": 35,
-    "link": "https://leetcode.com/problems/search-insert-position/",
-    "title": "Search Insert Position"
+    "link": "https://leetcode.com/problems/search-insert-position/"
   },
   "36": {
+    "id": 36,
     "category": "Array & Hashing",
+    "title": "Valid Sudoku",
     "difficulty": "Medium",
-    "id": 36,
-    "link": "https://leetcode.com/problems/valid-sudoku/",
-    "title": "Valid Sudoku"
+    "link": "https://leetcode.com/problems/valid-sudoku/"
   },
   "37": {
+    "id": 37,
     "category": "Backtracking",
+    "title": "Sudoku Solver",
     "difficulty": "Hard",
-    "id": 37,
-    "link": "https://leetcode.com/problems/sudoku-solver/",
-    "title": "Sudoku Solver"
+    "link": "https://leetcode.com/problems/sudoku-solver/"
   },
   "38": {
+    "id": 38,
     "category": "Array & Hashing",
+    "title": "Count and Say",
     "difficulty": "Medium",
-    "id": 38,
-    "link": "https://leetcode.com/problems/count-and-say/",
-    "title": "Count and Say"
+    "link": "https://leetcode.com/problems/count-and-say/"
   },
   "39": {
+    "id": 39,
     "category": "Backtracking",
+    "title": "Combination Sum",
     "difficulty": "Medium",
-    "id": 39,
-    "link": "https://leetcode.com/problems/combination-sum/",
-    "title": "Combination Sum"
+    "link": "https://leetcode.com/problems/combination-sum/"
   },
   "40": {
+    "id": 40,
     "category": "Backtracking",
+    "title": "Combination Sum II",
     "difficulty": "Medium",
-    "id": 40,
-    "link": "https://leetcode.com/problems/combination-sum-ii/",
-    "title": "Combination Sum II"
+    "link": "https://leetcode.com/problems/combination-sum-ii/"
   },
   "41": {
+    "id": 41,
     "category": "Array & Hashing",
+    "title": "First Missing Positive",
     "difficulty": "Hard",
-    "id": 41,
-    "link": "https://leetcode.com/problems/first-missing-positive/",
-    "title": "First Missing Positive"
+    "link": "https://leetcode.com/problems/first-missing-positive/"
   },
   "42": {
+    "id": 42,
     "category": "Dynamic Programming",
+    "title": "Trapping Rain Water",
     "difficulty": "Hard",
-    "id": 42,
-    "link": "https://leetcode.com/problems/trapping-rain-water/",
-    "title": "Trapping Rain Water"
+    "link": "https://leetcode.com/problems/trapping-rain-water/"
   },
   "43": {
+    "id": 43,
     "category": "Math & Geometry",
+    "title": "Multiply Strings",
     "difficulty": "Medium",
-    "id": 43,
-    "link": "https://leetcode.com/problems/multiply-strings/",
-    "title": "Multiply Strings"
+    "link": "https://leetcode.com/problems/multiply-strings/"
   },
   "44": {
+    "id": 44,
     "category": "Dynamic Programming",
+    "title": "Wildcard Matching",
     "difficulty": "Hard",
-    "id": 44,
-    "link": "https://leetcode.com/problems/wildcard-matching/",
-    "title": "Wildcard Matching"
+    "link": "https://leetcode.com/problems/wildcard-matching/"
   },
   "45": {
+    "id": 45,
     "category": "Dynamic Programming",
+    "title": "Jump Game II",
     "difficulty": "Medium",
-    "id": 45,
-    "link": "https://leetcode.com/problems/jump-game-ii/",
-    "title": "Jump Game II"
+    "link": "https://leetcode.com/problems/jump-game-ii/"
   },
   "46": {
+    "id": 46,
     "category": "Backtracking",
+    "title": "Permutations",
     "difficulty": "Medium",
-    "id": 46,
-    "link": "https://leetcode.com/problems/permutations/",
-    "title": "Permutations"
+    "link": "https://leetcode.com/problems/permutations/"
   },
   "47": {
+    "id": 47,
     "category": "Backtracking",
+    "title": "Permutations II",
     "difficulty": "Medium",
-    "id": 47,
-    "link": "https://leetcode.com/problems/permutations-ii/",
-    "title": "Permutations II"
+    "link": "https://leetcode.com/problems/permutations-ii/"
   },
   "48": {
+    "id": 48,
     "category": "Math & Geometry",
+    "title": "Rotate Image",
     "difficulty": "Medium",
-    "id": 48,
-    "link": "https://leetcode.com/problems/rotate-image/",
-    "title": "Rotate Image"
+    "link": "https://leetcode.com/problems/rotate-image/"
   },
   "49": {
+    "id": 49,
     "category": "Array & Hashing",
+    "title": "Group Anagrams",
     "difficulty": "Medium",
-    "id": 49,
-    "link": "https://leetcode.com/problems/group-anagrams/",
-    "title": "Group Anagrams"
+    "link": "https://leetcode.com/problems/group-anagrams/"
+  },
+  "50": {
+    "id": 50,
+    "category": "Math & Geometry",
+    "title": "Pow(x, n)",
+    "difficulty": "Medium",
+    "link": "https://leetcode.com/problems/powx-n/"
+  },
+  "51": {
+    "id": 51,
+    "category": "Backtracking",
+    "title": "N-Queens",
+    "difficulty": "Hard",
+    "link": "https://leetcode.com/problems/n-queens/"
+  },
+  "52": {
+    "id": 52,
+    "category": "Backtracking",
+    "title": "N-Queens II",
+    "difficulty": "Hard",
+    "link": "https://leetcode.com/problems/n-queens-ii/"
   },
-  "50": {"category": "Math & Geometry", "difficulty": "Medium", "id": 50, "link": "https://leetcode.com/problems/powx-n/", "title": "Pow(x, n)"},
-  "51": {"category": "Backtracking", "difficulty": "Hard", "id": 51, "link": "https://leetcode.com/problems/n-queens/", "title": "N-Queens"},
-  "52": {"category": "Backtracking", "difficulty": "Hard", "id": 52, "link": "https://leetcode.com/problems/n-queens-ii/", "title": "N-Queens II"},
   "53": {
+    "id": 53,
     "category": "Dynamic Programming",
+    "title": "Maximum Subarray",
     "difficulty": "Medium",
-    "id": 53,
-    "link": "https://leetcode.com/problems/maximum-subarray/",
-    "title": "Maximum Subarray"
+    "link": "https://leetcode.com/problems/maximum-subarray/"
   },
   "54": {
+    "id": 54,
     "category": "Array & Hashing",
+    "title": "Spiral Matrix",
     "difficulty": "Medium",
-    "id": 54,
-    "link": "https://leetcode.com/problems/spiral-matrix/",
-    "title": "Spiral Matrix"
+    "link": "https://leetcode.com/problems/spiral-matrix/"
   },
   "55": {
+    "id": 55,
     "category": "Dynamic Programming",
+    "title": "Jump Game",
     "difficulty": "Medium",
-    "id": 55,
-    "link": "https://leetcode.com/problems/jump-game/",
-    "title": "Jump Game"
+    "link": "https://leetcode.com/problems/jump-game/"
   },
   "56": {
+    "id": 56,
     "category": "Array & Hashing",
+    "title": "Merge Intervals",
     "difficulty": "Medium",
-    "id": 56,
-    "link": "https://leetcode.com/problems/merge-intervals/",
-    "title": "Merge Intervals"
+    "link": "https://leetcode.com/problems/merge-intervals/"
   },
   "57": {
+    "id": 57,
     "category": "Array & Hashing",
+    "title": "Insert Interval",
     "difficulty": "Medium",
-    "id": 57,
-    "link": "https://leetcode.com/problems/insert-interval/",
-    "title": "Insert Interval"
+    "link": "https://leetcode.com/problems/insert-interval/"
   },
   "58": {
+    "id": 58,
     "category": "Array & Hashing",
+    "title": "Length of Last Word",
     "difficulty": "Easy",
-    "id": 58,
-    "link": "https://leetcode.com/problems/length-of-last-word/",
-    "title": "Length of Last Word"
+    "link": "https://leetcode.com/problems/length-of-last-word/"
   },
   "59": {
+    "id": 59,
     "category": "Array & Hashing",
+    "title": "Spiral Matrix II",
     "difficulty": "Medium",
-    "id": 59,
-    "link": "https://leetcode.com/problems/spiral-matrix-ii/",
-    "title": "Spiral Matrix II"
+    "link": "https://leetcode.com/problems/spiral-matrix-ii/"
   },
   "60": {
+    "id": 60,
     "category": "Math & Geometry",
+    "title": "Permutation Sequence",
     "difficulty": "Hard",
-    "id": 60,
-    "link": "https://leetcode.com/problems/permutation-sequence/",
-    "title": "Permutation Sequence"
+    "link": "https://leetcode.com/problems/permutation-sequence/"
+  },
+  "61": {
+    "id": 61,
+    "category": "Linked List",
+    "title": "Rotate List",
+    "difficulty": "Medium",
+    "link": "https://leetcode.com/problems/rotate-list/"
   },
-  "61": {"category": "Linked List", "difficulty": "Medium", "id": 61, "link": "https://leetcode.com/problems/rotate-list/", "title": "Rotate List"},
   "62": {
+    "id": 62,
     "category": "Dynamic Programming",
+    "title": "Unique Paths",
     "difficulty": "Medium",
-    "id": 62,
-    "link": "https://leetcode.com/problems/unique-paths/",
-    "title": "Unique Paths"
+    "link": "https://leetcode.com/problems/unique-paths/"
   },
   "63": {
+    "id": 63,
     "category": "Dynamic Programming",
+    "title": "Unique Paths II",
     "difficulty": "Medium",
-    "id": 63,
-    "link": "https://leetcode.com/problems/unique-paths-ii/",
-    "title": "Unique Paths II"
+    "link": "https://leetcode.com/problems/unique-paths-ii/"
   },
   "64": {
+    "id": 64,
     "category": "Dynamic Programming",
+    "title": "Minimum Path Sum",
     "difficulty": "Medium",
-    "id": 64,
-    "link": "https://leetcode.com/problems/minimum-path-sum/",
-    "title": "Minimum Path Sum"
+    "link": "https://leetcode.com/problems/minimum-path-sum/"
   },
   "65": {
+    "id": 65,
     "category": "Array & Hashing",
+    "title": "Valid Number",
     "difficulty": "Hard",
-    "id": 65,
-    "link": "https://leetcode.com/problems/valid-number/",
-    "title": "Valid Number"
+    "link": "https://leetcode.com/problems/valid-number/"
+  },
+  "66": {
+    "id": 66,
+    "category": "Math & Geometry",
+    "title": "Plus One",
+    "difficulty": "Easy",
+    "link": "https://leetcode.com/problems/plus-one/"
+  },
+  "67": {
+    "id": 67,
+    "category": "Bit Manipulation",
+    "title": "Add Binary",
+    "difficulty": "Easy",
+    "link": "https://leetcode.com/problems/add-binary/"
   },
-  "66": {"category": "Math & Geometry", "difficulty": "Easy", "id": 66, "link": "https://leetcode.com/problems/plus-one/", "title": "Plus One"},
-  "67": {"category": "Bit Manipulation", "difficulty": "Easy", "id": 67, "link": "https://leetcode.com/problems/add-binary/", "title": "Add Binary"},
   "68": {
+    "id": 68,
     "category": "Array & Hashing",
+    "title": "Text Justification",
     "difficulty": "Hard",
-    "id": 68,
-    "link": "https://leetcode.com/problems/text-justification/",
-    "title": "Text Justification"
+    "link": "https://leetcode.com/problems/text-justification/"
+  },
+  "69": {
+    "id": 69,
+    "category": "Binary Search",
+    "title": "Sqrt(x)",
+    "difficulty": "Easy",
+    "link": "https://leetcode.com/problems/sqrtx/"
   },
-  "69": {"category": "Binary Search", "difficulty": "Easy", "id": 69, "link": "https://leetcode.com/problems/sqrtx/", "title": "Sqrt(x)"},
   "70": {
+    "id": 70,
     "category": "Dynamic Programming",
+    "title": "Climbing Stairs",
     "difficulty": "Easy",
-    "id": 70,
-    "link": "https://leetcode.com/problems/climbing-stairs/",
-    "title": "Climbing Stairs"
+    "link": "https://leetcode.com/problems/climbing-stairs/"
+  },
+  "71": {
+    "id": 71,
+    "category": "Stack",
+    "title": "Simplify Path",
+    "difficulty": "Medium",
+    "link": "https://leetcode.com/problems/simplify-path/"
   },
-  "71": {"category": "Stack", "difficulty": "Medium", "id": 71, "link": "https://leetcode.com/problems/simplify-path/", "title": "Simplify Path"},
   "72": {
+    "id": 72,
     "category": "Dynamic Programming",
+    "title": "Edit Distance",
     "difficulty": "Medium",
-    "id": 72,
-    "link": "https://leetcode.com/problems/edit-distance/",
-    "title": "Edit Distance"
+    "link": "https://leetcode.com/problems/edit-distance/"
   },
   "73": {
+    "id": 73,
     "category": "Array & Hashing",
+    "title": "Set Matrix Zeroes",
     "difficulty": "Medium",
-    "id": 73,
-    "link": "https://leetcode.com/problems/set-matrix-zeroes/",
-    "title": "Set Matrix Zeroes"
+    "link": "https://leetcode.com/problems/set-matrix-zeroes/"
   },
   "74": {
+    "id": 74,
     "category": "Binary Search",
+    "title": "Search a 2D Matrix",
     "difficulty": "Medium",
-    "id": 74,
-    "link": "https://leetcode.com/problems/search-a-2d-matrix/",
-    "title": "Search a 2D Matrix"
+    "link": "https://leetcode.com/problems/search-a-2d-matrix/"
+  },
+  "75": {
+    "id": 75,
+    "category": "Two Pointers",
+    "title": "Sort Colors",
+    "difficulty": "Medium",
+    "link": "https://leetcode.com/problems/sort-colors/"
   },
-  "75": {"category": "Two Pointers", "difficulty": "Medium", "id": 75, "link": "https://leetcode.com/problems/sort-colors/", "title": "Sort Colors"},
   "76": {
+    "id": 76,
     "category": "Sliding Window",
+    "title": "Minimum Window Substring",
     "difficulty": "Hard",
-    "id": 76,
-    "link": "https://leetcode.com/problems/minimum-window-substring/",
-    "title": "Minimum Window Substring"
+    "link": "https://leetcode.com/problems/minimum-window-substring/"
   },
   "77": {
+    "id": 77,
     "category": "Backtracking",
+    "title": "Combinations",
     "difficulty": "Medium",
-    "id": 77,
-    "link": "https://leetcode.com/problems/combinations/",
-    "title": "Combinations"
+    "link": "https://leetcode.com/problems/combinations/"
+  },
+  "78": {
+    "id": 78,
+    "category": "Backtracking",
+    "title": "Subsets",
+    "difficulty": "Medium",
+    "link": "https://leetcode.com/problems/subsets/"
   },
-  "78": {"category": "Backtracking", "difficulty": "Medium", "id": 78, "link": "https://leetcode.com/problems/subsets/", "title": "Subsets"},
   "79": {
+    "id": 79,
     "category": "Graph Traversal",
+    "title": "Word Search",
     "difficulty": "Medium",
-    "id": 79,
-    "link": "https://leetcode.com/problems/word-search/",
-    "title": "Word Search"
+    "link": "https://leetcode.com/problems/word-search/"
   },
   "80": {
+    "id": 80,
     "category": "Two Pointers",
+    "title": "Remove Duplicates from Sorted Array II",
     "difficulty": "Medium",
-    "id": 80,
-    "link": "https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii/",
-    "title": "Remove Duplicates from Sorted Array II"
+    "link": "https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii/"
   },
   "81": {
+    "id": 81,
     "category": "Binary Search",
+    "title": "Search in Rotated Sorted Array II",
     "difficulty": "Medium",
-    "id": 81,
-    "link": "https://leetcode.com/problems/search-in-rotated-sorted-array-ii/",
-    "title": "Search in Rotated Sorted Array II"
+    "link": "https://leetcode.com/problems/search-in-rotated-sorted-array-ii/"
   },
   "82": {
+    "id": 82,
     "category": "Linked List",
+    "title": "Remove Duplicates from Sorted List II",
     "difficulty": "Medium",
-    "id": 82,
-    "link": "https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii/",
-    "title": "Remove Duplicates from Sorted List II"
+    "link": "https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii/"
   },
   "83": {
+    "id": 83,
     "category": "Linked List",
+    "title": "Remove Duplicates from Sorted List",
     "difficulty": "Easy",
-    "id": 83,
-    "link": "https://leetcode.com/problems/remove-duplicates-from-sorted-list/",
-    "title": "Remove Duplicates from Sorted List"
+    "link": "https://leetcode.com/problems/remove-duplicates-from-sorted-list/"
   },
   "84": {
+    "id": 84,
     "category": "Stack",
+    "title": "Largest Rectangle in Histogram",
     "difficulty": "Hard",
-    "id": 84,
-    "link": "https://leetcode.com/problems/largest-rectangle-in-histogram/",
-    "title": "Largest Rectangle in Histogram"
+    "link": "https://leetcode.com/problems/largest-rectangle-in-histogram/"
   },
   "85": {
+    "id": 85,
     "category": "Dynamic Programming",
+    "title": "Maximal Rectangle",
     "difficulty": "Hard",
-    "id": 85,
-    "link": "https://leetcode.com/problems/maximal-rectangle/",
-    "title": "Maximal Rectangle"
+    "link": "https://leetcode.com/problems/maximal-rectangle/"
   },
   "86": {
+    "id": 86,
     "category": "Linked List",
+    "title": "Partition List",
     "difficulty": "Medium",
-    "id": 86,
-    "link": "https://leetcode.com/problems/partition-list/",
-    "title": "Partition List"
+    "link": "https://leetcode.com/problems/partition-list/"
   },
   "87": {
+    "id": 87,
     "category": "Dynamic Programming",
+    "title": "Scramble String",
     "difficulty": "Hard",
-    "id": 87,
-    "link": "https://leetcode.com/problems/scramble-string/",
-    "title": "Scramble String"
+    "link": "https://leetcode.com/problems/scramble-string/"
   },
   "88": {
+    "id": 88,
     "category": "Two Pointers",
+    "title": "Merge Sorted Array",
     "difficulty": "Easy",
-    "id": 88,
-    "link": "https://leetcode.com/problems/merge-sorted-array/",
-    "title": "Merge Sorted Array"
+    "link": "https://leetcode.com/problems/merge-sorted-array/"
+  },
+  "89": {
+    "id": 89,
+    "category": "Backtracking",
+    "title": "Gray Code",
+    "difficulty": "Medium",
+    "link": "https://leetcode.com/problems/gray-code/"
+  },
+  "90": {
+    "id": 90,
+    "category": "Backtracking",
+    "title": "Subsets II",
+    "difficulty": "Medium",
+    "link": "https://leetcode.com/problems/subsets-ii/"
   },
-  "89": {"category": "Backtracking", "difficulty": "Medium", "id": 89, "link": "https://leetcode.com/problems/gray-code/", "title": "Gray Code"},
-  "90": {"category": "Backtracking", "difficulty": "Medium", "id": 90, "link": "https://leetcode.com/problems/subsets-ii/", "title": "Subsets II"},
   "91": {
+    "id": 91,
     "category": "Dynamic Programming",
+    "title": "Decode Ways",
     "difficulty": "Medium",
-    "id": 91,
-    "link": "https://leetcode.com/problems/decode-ways/",
-    "title": "Decode Ways"
+    "link": "https://leetcode.com/problems/decode-ways/"
   },
   "92": {
+    "id": 92,
     "category": "Linked List",
+    "title": "Reverse Linked List II",
     "difficulty": "Medium",
-    "id": 92,
-    "link": "https://leetcode.com/problems/reverse-linked-list-ii/",
-    "title": "Reverse Linked List II"
+    "link": "https://leetcode.com/problems/reverse-linked-list-ii/"
   },
   "93": {
+    "id": 93,
     "category": "Backtracking",
+    "title": "Restore IP Addresses",
     "difficulty": "Medium",
-    "id": 93,
-    "link": "https://leetcode.com/problems/restore-ip-addresses/",
-    "title": "Restore IP Addresses"
+    "link": "https://leetcode.com/problems/restore-ip-addresses/"
   },
   "94": {
+    "id": 94,
     "category": "Tree",
+    "title": "Binary Tree Inorder Traversal",
     "difficulty": "Easy",
-    "id": 94,
-    "link": "https://leetcode.com/problems/binary-tree-inorder-traversal/",
-    "title": "Binary Tree Inorder Traversal"
+    "link": "https://leetcode.com/problems/binary-tree-inorder-traversal/"
   },
   "95": {
+    "id": 95,
     "category": "Tree",
+    "title": "Unique Binary Search Trees II",
     "difficulty": "Medium",
-    "id": 95,
-    "link": "https://leetcode.com/problems/unique-binary-search-trees-ii/",
-    "title": "Unique Binary Search Trees II"
+    "link": "https://leetcode.com/problems/unique-binary-search-trees-ii/"
   },
   "96": {
+    "id": 96,
     "category": "Tree",
+    "title": "Unique Binary Search Trees",
     "difficulty": "Medium",
-    "id": 96,
-    "link": "https://leetcode.com/problems/unique-binary-search-trees/",
-    "title": "Unique Binary Search Trees"
+    "link": "https://leetcode.com/problems/unique-binary-search-trees/"
   },
   "97": {
+    "id": 97,
     "category": "Dynamic Programming",
+    "title": "Interleaving String",
     "difficulty": "Medium",
-    "id": 97,
-    "link": "https://leetcode.com/problems/interleaving-string/",
-    "title": "Interleaving String"
+    "link": "https://leetcode.com/problems/interleaving-string/"
   },
   "98": {
+    "id": 98,
     "category": "Tree",
+    "title": "Validate Binary Search Tree",
     "difficulty": "Medium",
-    "id": 98,
-    "link": "https://leetcode.com/problems/validate-binary-search-tree/",
-    "title": "Validate Binary Search Tree"
+    "link": "https://leetcode.com/problems/validate-binary-search-tree/"
   },
   "99": {
+    "id": 99,
     "category": "Tree",
+    "title": "Recover Binary Search Tree",
     "difficulty": "Medium",
-    "id": 99,
-    "link": "https://leetcode.com/problems/recover-binary-search-tree/",
-    "title": "Recover Binary Search Tree"
+    "link": "https://leetcode.com/problems/recover-binary-search-tree/"
+  },
+  "100": {
+    "id": 100,
+    "category": "Tree",
+    "title": "Same Tree",
+    "difficulty": "Easy",
+    "link": "https://leetcode.com/problems/same-tree/"
+  },
+  "101": {
+    "id": 101,
+    "category": "Tree",
+    "title": "Symmetric Tree",
+    "difficulty": "Easy",
+    "link": "https://leetcode.com/problems/symmetric-tree/"
   },
-  "100": {"category": "Tree", "difficulty": "Easy", "id": 100, "link": "https://leetcode.com/problems/same-tree/", "title": "Same Tree"},
-  "101": {"category": "Tree", "difficulty": "Easy", "id": 101, "link": "https://leetcode.com/problems/symmetric-tree/", "title": "Symmetric Tree"},
   "102": {
+    "id": 102,
     "category": "Tree",
+    "title": "Binary Tree Level Order Traversal",
     "difficulty": "Medium",
-    "id": 102,
-    "link": "https://leetcode.com/problems/binary-tree-level-order-traversal/",
-    "title": "Binary Tree Level Order Traversal"
+    "link": "https://leetcode.com/problems/binary-tree-level-order-traversal/"
   },
   "103": {
+    "id": 103,
     "category": "Tree",
+    "title": "Binary Tree Zigzag Level Order Traversal",
     "difficulty": "Medium",
-    "id": 103,
-    "link": "https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/",
-    "title": "Binary Tree Zigzag Level Order Traversal"
+    "link": "https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/"
   },
   "104": {
+    "id": 104,
     "category": "Tree",
+    "title": "Maximum Depth of Binary Tree",
     "difficulty": "Easy",
-    "id": 104,
-    "link": "https://leetcode.com/problems/maximum-depth-of-binary-tree/",
-    "title": "Maximum Depth of Binary Tree"
+    "link": "https://leetcode.com/problems/maximum-depth-of-binary-tree/"
   },
   "105": {
+    "id": 105,
     "category": "Tree",
+    "title": "Construct Binary Tree from Preorder and Inorder Traversal",
     "difficulty": "Medium",
-    "id": 105,
-    "link": "https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/",
-    "title": "Construct Binary Tree from Preorder and Inorder Traversal"
+    "link": "https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/"
   },
   "106": {
+    "id": 106,
     "category": "Tree",
+    "title": "Construct Binary Tree from Inorder and Postorder Traversal",
     "difficulty": "Medium",
-    "id": 106,
-    "link": "https://leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal/",
-    "title": "Construct Binary Tree from Inorder and Postorder Traversal"
+    "link": "https://leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal/"
   },
   "107": {
+    "id": 107,
     "category": "Tree",
+    "title": "Binary Tree Level Order Traversal II",
     "difficulty": "Medium",
-    "id": 107,
-    "link": "https://leetcode.com/problems/binary-tree-level-order-traversal-ii/",
-    "title": "Binary Tree Level Order Traversal II"
+    "link": "https://leetcode.com/problems/binary-tree-level-order-traversal-ii/"
   },
   "108": {
+    "id": 108,
     "category": "Tree",
+    "title": "Convert Sorted Array to Binary Search Tree",
     "difficulty": "Easy",
-    "id": 108,
-    "link": "https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/",
-    "title": "Convert Sorted Array to Binary Search Tree"
+    "link": "https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/"
   },
   "109": {
+    "id": 109,
     "category": "Tree",
+    "title": "Convert Sorted List to Binary Search Tree",
     "difficulty": "Medium",
-    "id": 109,
-    "link": "https://leetcode.com/problems/convert-sorted-list-to-binary-search-tree/",
-    "title": "Convert Sorted List to Binary Search Tree"
+    "link": "https://leetcode.com/problems/convert-sorted-list-to-binary-search-tree/"
   },
   "110": {
+    "id": 110,
     "category": "Tree",
+    "title": "Balanced Binary Tree",
     "difficulty": "Easy",
-    "id": 110,
-    "link": "https://leetcode.com/problems/balanced-binary-tree/",
-    "title": "Balanced Binary Tree"
+    "link": "https://leetcode.com/problems/balanced-binary-tree/"
   },
   "111": {
+    "id": 111,
     "category": "Tree",
+    "title": "Minimum Depth of Binary Tree",
     "difficulty": "Easy",
-    "id": 111,
-    "link": "https://leetcode.com/problems/minimum-depth-of-binary-tree/",
-    "title": "Minimum Depth of Binary Tree"
+    "link": "https://leetcode.com/problems/minimum-depth-of-binary-tree/"
   },
-  "112": {"category": "Tree", "difficulty": "Easy", "id": 112, "link": "https://leetcode.com/problems/path-sum/", "title": "Path Sum"},
-  "113": {"category": "Tree", "difficulty": "Medium", "id": 113, "link": "https://leetcode.com/problems/path-sum-ii/", "title": "Path Sum II"},
-  "114": {
+  "112": {
+    "id": 112,
     "category": "Tree",
+    "title": "Path Sum",
+    "difficulty": "Easy",
+    "link": "https://leetcode.com/problems/path-sum/"
+  },
+  "113": {
+    "id": 113,
+    "category": "Tree",
+    "title": "Path Sum II",
     "difficulty": "Medium",
+    "link": "https://leetcode.com/problems/path-sum-ii/"
+  },
+  "114": {
     "id": 114,
-    "link": "https://leetcode.com/problems/flatten-binary-tree-to-linked-list/",
-    "title": "Flatten Binary Tree to Linked List"
+    "category": "Tree",
+    "title": "Flatten Binary Tree to Linked List",
+    "difficulty": "Medium",
+    "link": "https://leetcode.com/problems/flatten-binary-tree-to-linked-list/"
   },
   "115": {
+    "id": 115,
     "category": "Dynamic Programming",
+    "title": "Distinct Subsequences",
     "difficulty": "Hard",
-    "id": 115,
-    "link": "https://leetcode.com/problems/distinct-subsequences/",
-    "title": "Distinct Subsequences"
+    "link": "https://leetcode.com/problems/distinct-subsequences/"
   },
   "116": {
+    "id": 116,
     "category": "Tree",
+    "title": "Populating Next Right Pointers in Each Node",
     "difficulty": "Medium",
-    "id": 116,
-    "link": "https://leetcode.com/problems/populating-next-right-pointers-in-each-node/",
-    "title": "Populating Next Right Pointers in Each Node"
+    "link": "https://leetcode.com/problems/populating-next-right-pointers-in-each-node/"
   },
   "117": {
+    "id": 117,
     "category": "Tree",
+    "title": "Populating Next Right Pointers in Each Node II",
     "difficulty": "Medium",
-    "id": 117,
-    "link": "https://leetcode.com/problems/populating-next-right-pointers-in-each-node-ii/",
-    "title": "Populating Next Right Pointers in Each Node II"
+    "link": "https://leetcode.com/problems/populating-next-right-pointers-in-each-node-ii/"
   },
   "118": {
+    "id": 118,
     "category": "Dynamic Programming",
+    "title": "Pascal's Triangle",
     "difficulty": "Easy",
-    "id": 118,
-    "link": "https://leetcode.com/problems/pascals-triangle/",
-    "title": "Pascal's Triangle"
+    "link": "https://leetcode.com/problems/pascals-triangle/"
   },
   "119": {
+    "id": 119,
     "category": "Dynamic Programming",
+    "title": "Pascal's Triangle II",
     "difficulty": "Easy",
-    "id": 119,
-    "link": "https://leetcode.com/problems/pascals-triangle-ii/",
-    "title": "Pascal's Triangle II"
+    "link": "https://leetcode.com/problems/pascals-triangle-ii/"
   },
   "120": {
+    "id": 120,
     "category": "Dynamic Programming",
+    "title": "Triangle",
     "difficulty": "Medium",
-    "id": 120,
-    "link": "https://leetcode.com/problems/triangle/",
-    "title": "Triangle"
+    "link": "https://leetcode.com/problems/triangle/"
   },
   "121": {
+    "id": 121,
     "category": "Dynamic Programming",
+    "title": "Best Time to Buy and Sell Stock",
     "difficulty": "Easy",
-    "id": 121,
-    "link": "https://leetcode.com/problems/best-time-to-buy-and-sell-stock/",
-    "title": "Best Time to Buy and Sell Stock"
+    "link": "https://leetcode.com/problems/best-time-to-buy-and-sell-stock/"
   },
   "122": {
+    "id": 122,
     "category": "Dynamic Programming",
+    "title": "Best Time to Buy and Sell Stock II",
     "difficulty": "Medium",
-    "id": 122,
-    "link": "https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/",
-    "title": "Best Time to Buy and Sell Stock II"
+    "link": "https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/"
   },
   "123": {
+    "id": 123,
     "category": "Dynamic Programming",
+    "title": "Best Time to Buy and Sell Stock III",
     "difficulty": "Hard",
-    "id": 123,
-    "link": "https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iii/",
-    "title": "Best Time to Buy and Sell Stock III"
+    "link": "https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iii/"
   },
   "124": {
+    "id": 124,
     "category": "Tree",
+    "title": "Binary Tree Maximum Path Sum",
     "difficulty": "Hard",
-    "id": 124,
-    "link": "https://leetcode.com/problems/binary-tree-maximum-path-sum/",
-    "title": "Binary Tree Maximum Path Sum"
+    "link": "https://leetcode.com/problems/binary-tree-maximum-path-sum/"
   },
   "125": {
+    "id": 125,
     "category": "Two Pointers",
+    "title": "Valid Palindrome",
     "difficulty": "Easy",
-    "id": 125,
-    "link": "https://leetcode.com/problems/valid-palindrome/",
-    "title": "Valid Palindrome"
+    "link": "https://leetcode.com/problems/valid-palindrome/"
   },
   "126": {
+    "id": 126,
     "category": "Graph Traversal",
+    "title": "Word Ladder II",
     "difficulty": "Hard",
-    "id": 126,
-    "link": "https://leetcode.com/problems/word-ladder-ii/",
-    "title": "Word Ladder II"
+    "link": "https://leetcode.com/problems/word-ladder-ii/"
   },
   "127": {
+    "id": 127,
     "category": "Graph Traversal",
+    "title": "Word Ladder",
     "difficulty": "Hard",
-    "id": 127,
-    "link": "https://leetcode.com/problems/word-ladder/",
-    "title": "Word Ladder"
+    "link": "https://leetcode.com/problems/word-ladder/"
   },
   "128": {
+    "id": 128,
     "category": "Graph Traversal",
+    "title": "Longest Consecutive Sequence",
     "difficulty": "Medium",
-    "id": 128,
-    "link": "https://leetcode.com/problems/longest-consecutive-sequence/",
-    "title": "Longest Consecutive Sequence"
+    "link": "https://leetcode.com/problems/longest-consecutive-sequence/"
   },
   "129": {
+    "id": 129,
     "category": "Tree",
+    "title": "Sum Root to Leaf Numbers",
     "difficulty": "Medium",
-    "id": 129,
-    "link": "https://leetcode.com/problems/sum-root-to-leaf-numbers/",
-    "title": "Sum Root to Leaf Numbers"
+    "link": "https://leetcode.com/problems/sum-root-to-leaf-numbers/"
   },
   "130": {
+    "id": 130,
     "category": "Graph Traversal",
+    "title": "Surrounded Regions",
     "difficulty": "Medium",
-    "id": 130,
-    "link": "https://leetcode.com/problems/surrounded-regions/",
-    "title": "Surrounded Regions"
+    "link": "https://leetcode.com/problems/surrounded-regions/"
   },
   "131": {
+    "id": 131,
     "category": "Dynamic Programming",
+    "title": "Palindrome Partitioning",
     "difficulty": "Medium",
-    "id": 131,
-    "link": "https://leetcode.com/problems/palindrome-partitioning/",
-    "title": "Palindrome Partitioning"
+    "link": "https://leetcode.com/problems/palindrome-partitioning/"
   },
   "132": {
+    "id": 132,
     "category": "Dynamic Programming",
+    "title": "Palindrome Partitioning II",
     "difficulty": "Hard",
-    "id": 132,
-    "link": "https://leetcode.com/problems/palindrome-partitioning-ii/",
-    "title": "Palindrome Partitioning II"
+    "link": "https://leetcode.com/problems/palindrome-partitioning-ii/"
   },
   "133": {
+    "id": 133,
     "category": "Graph Traversal",
+    "title": "Clone Graph",
     "difficulty": "Medium",
-    "id": 133,
-    "link": "https://leetcode.com/problems/clone-graph/",
-    "title": "Clone Graph"
+    "link": "https://leetcode.com/problems/clone-graph/"
+  },
+  "134": {
+    "id": 134,
+    "category": "Greedy",
+    "title": "Gas Station",
+    "difficulty": "Medium",
+    "link": "https://leetcode.com/problems/gas-station/"
+  },
+  "135": {
+    "id": 135,
+    "category": "Greedy",
+    "title": "Candy",
+    "difficulty": "Hard",
+    "link": "https://leetcode.com/problems/candy/"
   },
-  "134": {"category": "Greedy", "difficulty": "Medium", "id": 134, "link": "https://leetcode.com/problems/gas-station/", "title": "Gas Station"},
-  "135": {"category": "Greedy", "difficulty": "Hard", "id": 135, "link": "https://leetcode.com/problems/candy/", "title": "Candy"},
   "136": {
+    "id": 136,
     "category": "Bit Manipulation",
+    "title": "Single Number",
     "difficulty": "Easy",
-    "id": 136,
-    "link": "https://leetcode.com/problems/single-number/",
-    "title": "Single Number"
+    "link": "https://leetcode.com/problems/single-number/"
   },
   "137": {
+    "id": 137,
     "category": "Bit Manipulation",
+    "title": "Single Number II",
     "difficulty": "Medium",
-    "id": 137,
-    "link": "https://leetcode.com/problems/single-number-ii/",
-    "title": "Single Number II"
+    "link": "https://leetcode.com/problems/single-number-ii/"
   },
   "138": {
+    "id": 138,
     "category": "Linked List",
+    "title": "Copy List with Random Pointer",
     "difficulty": "Medium",
-    "id": 138,
-    "link": "https://leetcode.com/problems/copy-list-with-random-pointer/",
-    "title": "Copy List with Random Pointer"
+    "link": "https://leetcode.com/problems/copy-list-with-random-pointer/"
   },
   "139": {
+    "id": 139,
     "category": "Dynamic Programming",
+    "title": "Word Break",
     "difficulty": "Medium",
-    "id": 139,
-    "link": "https://leetcode.com/problems/word-break/",
-    "title": "Word Break"
+    "link": "https://leetcode.com/problems/word-break/"
   },
   "140": {
+    "id": 140,
     "category": "Dynamic Programming",
+    "title": "Word Break II",
     "difficulty": "Hard",
-    "id": 140,
-    "link": "https://leetcode.com/problems/word-break-ii/",
-    "title": "Word Break II"
+    "link": "https://leetcode.com/problems/word-break-ii/"
   },
   "141": {
+    "id": 141,
     "category": "Linked List",
+    "title": "Linked List Cycle",
     "difficulty": "Easy",
-    "id": 141,
-    "link": "https://leetcode.com/problems/linked-list-cycle/",
-    "title": "Linked List Cycle"
+    "link": "https://leetcode.com/problems/linked-list-cycle/"
   },
   "142": {
+    "id": 142,
     "category": "Linked List",
+    "title": "Linked List Cycle II",
     "difficulty": "Medium",
-    "id": 142,
-    "link": "https://leetcode.com/problems/linked-list-cycle-ii/",
-    "title": "Linked List Cycle II"
+    "link": "https://leetcode.com/problems/linked-list-cycle-ii/"
+  },
+  "143": {
+    "id": 143,
+    "category": "Stack",
+    "title": "Reorder List",
+    "difficulty": "Medium",
+    "link": "https://leetcode.com/problems/reorder-list/"
   },
-  "143": {"category": "Stack", "difficulty": "Medium", "id": 143, "link": "https://leetcode.com/problems/reorder-list/", "title": "Reorder List"},
   "144": {
+    "id": 144,
     "category": "Tree",
+    "title": "Binary Tree Preorder Traversal",
     "difficulty": "Easy",
-    "id": 144,
-    "link": "https://leetcode.com/problems/binary-tree-preorder-traversal/",
-    "title": "Binary Tree Preorder Traversal"
+    "link": "https://leetcode.com/problems/binary-tree-preorder-traversal/"
   },
   "145": {
+    "id": 145,
     "category": "Tree",
+    "title": "Binary Tree Postorder Traversal",
     "difficulty": "Easy",
-    "id": 145,
-    "link": "https://leetcode.com/problems/binary-tree-postorder-traversal/",
-    "title": "Binary Tree Postorder Traversal"
+    "link": "https://leetcode.com/problems/binary-tree-postorder-traversal/"
   },
-  "146": {"category": "Linked List", "difficulty": "Medium", "id": 146, "link": "https://leetcode.com/problems/lru-cache/", "title": "LRU Cache"},
-  "147": {
+  "146": {
+    "id": 146,
     "category": "Linked List",
+    "title": "LRU Cache",
     "difficulty": "Medium",
+    "link": "https://leetcode.com/problems/lru-cache/"
+  },
+  "147": {
     "id": 147,
-    "link": "https://leetcode.com/problems/insertion-sort-list/",
-    "title": "Insertion Sort List"
+    "category": "Linked List",
+    "title": "Insertion Sort List",
+    "difficulty": "Medium",
+    "link": "https://leetcode.com/problems/insertion-sort-list/"
+  },
+  "148": {
+    "id": 148,
+    "category": "Linked List",
+    "title": "Sort List",
+    "difficulty": "Medium",
+    "link": "https://leetcode.com/problems/sort-list/"
   },
-  "148": {"category": "Linked List", "difficulty": "Medium", "id": 148, "link": "https://leetcode.com/problems/sort-list/", "title": "Sort List"},
   "149": {
+    "id": 149,
     "category": "Math & Geometry",
+    "title": "Max Points on a Line",
     "difficulty": "Hard",
-    "id": 149,
-    "link": "https://leetcode.com/problems/max-points-on-a-line/",
-    "title": "Max Points on a Line"
+    "link": "https://leetcode.com/problems/max-points-on-a-line/"
   },
   "150": {
+    "id": 150,
     "category": "Stack",
+    "title": "Evaluate Reverse Polish Notation",
     "difficulty": "Medium",
-    "id": 150,
-    "link": "https://leetcode.com/problems/evaluate-reverse-polish-notation/",
-    "title": "Evaluate Reverse Polish Notation"
+    "link": "https://leetcode.com/problems/evaluate-reverse-polish-notation/"
   },
   "151": {
+    "id": 151,
     "category": "Two Pointers",
+    "title": "Reverse Words in a String",
     "difficulty": "Medium",
-    "id": 151,
-    "link": "https://leetcode.com/problems/reverse-words-in-a-string/",
-    "title": "Reverse Words in a String"
+    "link": "https://leetcode.com/problems/reverse-words-in-a-string/"
   },
   "152": {
+    "id": 152,
     "category": "Dynamic Programming",
+    "title": "Maximum Product Subarray",
     "difficulty": "Medium",
-    "id": 152,
-    "link": "https://leetcode.com/problems/maximum-product-subarray/",
-    "title": "Maximum Product Subarray"
+    "link": "https://leetcode.com/problems/maximum-product-subarray/"
   },
   "153": {
+    "id": 153,
     "category": "Binary Search",
+    "title": "Find Minimum in Rotated Sorted Array",
     "difficulty": "Medium",
-    "id": 153,
-    "link": "https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/",
-    "title": "Find Minimum in Rotated Sorted Array"
+    "link": "https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/"
   },
   "154": {
+    "id": 154,
     "category": "Binary Search",
+    "title": "Find Minimum in Rotated Sorted Array II",
     "difficulty": "Hard",
-    "id": 154,
-    "link": "https://leetcode.com/problems/find-minimum-in-rotated-sorted-array-ii/",
-    "title": "Find Minimum in Rotated Sorted Array II"
+    "link": "https://leetcode.com/problems/find-minimum-in-rotated-sorted-array-ii/"
+  },
+  "155": {
+    "id": 155,
+    "category": "Stack",
+    "title": "Min Stack",
+    "difficulty": "Medium",
+    "link": "https://leetcode.com/problems/min-stack/"
   },
-  "155": {"category": "Stack", "difficulty": "Medium", "id": 155, "link": "https://leetcode.com/problems/min-stack/", "title": "Min Stack"},
   "156": {
+    "id": 156,
     "category": "Tree",
+    "title": "Binary Tree Upside Down",
     "difficulty": "Medium",
-    "id": 156,
-    "link": "https://leetcode.com/problems/binary-tree-upside-down/",
-    "title": "Binary Tree Upside Down"
+    "link": "https://leetcode.com/problems/binary-tree-upside-down/"
   },
   "157": {
+    "id": 157,
     "category": "Array & Hashing",
+    "title": "Read N Characters Given Read4",
     "difficulty": "Easy",
-    "id": 157,
-    "link": "https://leetcode.com/problems/read-n-characters-given-read4/",
-    "title": "Read N Characters Given Read4"
+    "link": "https://leetcode.com/problems/read-n-characters-given-read4/"
   },
   "158": {
+    "id": 158,
     "category": "Array & Hashing",
+    "title": "Read N Characters Given read4 II - Call Multiple Times",
     "difficulty": "Hard",
-    "id": 158,
-    "link": "https://leetcode.com/problems/read-n-characters-given-read4-ii-call-multiple-times/",
-    "title": "Read N Characters Given read4 II - Call Multiple Times"
+    "link": "https://leetcode.com/problems/read-n-characters-given-read4-ii-call-multiple-times/"
   },
   "159": {
+    "id": 159,
     "category": "Sliding Window",
+    "title": "Longest Substring with At Most Two Distinct Characters",
     "difficulty": "Medium",
-    "id": 159,
-    "link": "https://leetcode.com/problems/longest-substring-with-at-most-two-distinct-characters/",
-    "title": "Longest Substring with At Most Two Distinct Characters"
+    "link": "https://leetcode.com/problems/longest-substring-with-at-most-two-distinct-characters/"
   },
   "160": {
+    "id": 160,
     "category": "Linked List",
+    "title": "Intersection of Two Linked Lists",
     "difficulty": "Easy",
-    "id": 160,
-    "link": "https://leetcode.com/problems/intersection-of-two-linked-lists/",
-    "title": "Intersection of Two Linked Lists"
+    "link": "https://leetcode.com/problems/intersection-of-two-linked-lists/"
   },
   "161": {
+    "id": 161,
     "category": "Two Pointers",
+    "title": "One Edit Distance",
     "difficulty": "Medium",
-    "id": 161,
-    "link": "https://leetcode.com/problems/one-edit-distance/",
-    "title": "One Edit Distance"
+    "link": "https://leetcode.com/problems/one-edit-distance/"
   },
   "162": {
+    "id": 162,
     "category": "Binary Search",
+    "title": "Find Peak Element",
     "difficulty": "Medium",
-    "id": 162,
-    "link": "https://leetcode.com/problems/find-peak-element/",
-    "title": "Find Peak Element"
+    "link": "https://leetcode.com/problems/find-peak-element/"
   },
   "163": {
+    "id": 163,
     "category": "Array & Hashing",
+    "title": "Missing Ranges",
     "difficulty": "Easy",
-    "id": 163,
-    "link": "https://leetcode.com/problems/missing-ranges/",
-    "title": "Missing Ranges"
+    "link": "https://leetcode.com/problems/missing-ranges/"
   },
   "164": {
+    "id": 164,
     "category": "Array & Hashing",
+    "title": "Maximum Gap",
     "difficulty": "Medium",
-    "id": 164,
-    "link": "https://leetcode.com/problems/maximum-gap/",
-    "title": "Maximum Gap"
+    "link": "https://leetcode.com/problems/maximum-gap/"
   },
   "165": {
+    "id": 165,
     "category": "Two Pointers",
+    "title": "Compare Version Numbers",
     "difficulty": "Medium",
-    "id": 165,
-    "link": "https://leetcode.com/problems/compare-version-numbers/",
-    "title": "Compare Version Numbers"
+    "link": "https://leetcode.com/problems/compare-version-numbers/"
   },
   "166": {
+    "id": 166,
     "category": "Math & Geometry",
+    "title": "Fraction to Recurring Decimal",
     "difficulty": "Medium",
-    "id": 166,
-    "link": "https://leetcode.com/problems/fraction-to-recurring-decimal/",
-    "title": "Fraction to Recurring Decimal"
+    "link": "https://leetcode.com/problems/fraction-to-recurring-decimal/"
   },
   "167": {
+    "id": 167,
     "category": "Binary Search",
+    "title": "Two Sum II - Input Array Is Sorted",
     "difficulty": "Medium",
-    "id": 167,
-    "link": "https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/",
-    "title": "Two Sum II - Input Array Is Sorted"
+    "link": "https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/"
   },
   "168": {
+    "id": 168,
     "category": "Math & Geometry",
+    "title": "Excel Sheet Column Title",
     "difficulty": "Easy",
-    "id": 168,
-    "link": "https://leetcode.com/problems/excel-sheet-column-title/",
-    "title": "Excel Sheet Column Title"
+    "link": "https://leetcode.com/problems/excel-sheet-column-title/"
   },
   "169": {
+    "id": 169,
     "category": "Array & Hashing",
+    "title": "Majority Element",
     "difficulty": "Easy",
-    "id": 169,
-    "link": "https://leetcode.com/problems/majority-element/",
-    "title": "Majority Element"
+    "link": "https://leetcode.com/problems/majority-element/"
   },
   "170": {
+    "id": 170,
     "category": "Two Pointers",
+    "title": "Two Sum III - Data structure design",
     "difficulty": "Easy",
-    "id": 170,
-    "link": "https://leetcode.com/problems/two-sum-iii-data-structure-design/",
-    "title": "Two Sum III - Data structure design"
+    "link": "https://leetcode.com/problems/two-sum-iii-data-structure-design/"
   },
   "171": {
+    "id": 171,
     "category": "Math & Geometry",
+    "title": "Excel Sheet Column Number",
     "difficulty": "Easy",
-    "id": 171,
-    "link": "https://leetcode.com/problems/excel-sheet-column-number/",
-    "title": "Excel Sheet Column Number"
+    "link": "https://leetcode.com/problems/excel-sheet-column-number/"
   },
   "172": {
+    "id": 172,
     "category": "Math & Geometry",
+    "title": "Factorial Trailing Zeroes",
     "difficulty": "Medium",
-    "id": 172,
-    "link": "https://leetcode.com/problems/factorial-trailing-zeroes/",
-    "title": "Factorial Trailing Zeroes"
+    "link": "https://leetcode.com/problems/factorial-trailing-zeroes/"
   },
   "173": {
+    "id": 173,
     "category": "Tree",
+    "title": "Binary Search Tree Iterator",
     "difficulty": "Medium",
-    "id": 173,
-    "link": "https://leetcode.com/problems/binary-search-tree-iterator/",
-    "title": "Binary Search Tree Iterator"
+    "link": "https://leetcode.com/problems/binary-search-tree-iterator/"
   },
   "174": {
+    "id": 174,
     "category": "Dynamic Programming",
+    "title": "Dungeon Game",
     "difficulty": "Hard",
-    "id": 174,
-    "link": "https://leetcode.com/problems/dungeon-game/",
-    "title": "Dungeon Game"
+    "link": "https://leetcode.com/problems/dungeon-game/"
   },
   "175": {
+    "id": 175,
     "category": "Database",
+    "title": "Combine Two Tables",
     "difficulty": "Easy",
-    "id": 175,
-    "link": "https://leetcode.com/problems/combine-two-tables/",
-    "title": "Combine Two Tables"
+    "link": "https://leetcode.com/problems/combine-two-tables/"
   },
   "176": {
+    "id": 176,
     "category": "Database",
+    "title": "Second Highest Salary",
     "difficulty": "Medium",
-    "id": 176,
-    "link": "https://leetcode.com/problems/second-highest-salary/",
-    "title": "Second Highest Salary"
+    "link": "https://leetcode.com/problems/second-highest-salary/"
   },
   "177": {
+    "id": 177,
     "category": "Database",
+    "title": "Nth Highest Salary",
     "difficulty": "Medium",
-    "id": 177,
-    "link": "https://leetcode.com/problems/nth-highest-salary/",
-    "title": "Nth Highest Salary"
+    "link": "https://leetcode.com/problems/nth-highest-salary/"
+  },
+  "178": {
+    "id": 178,
+    "category": "Database",
+    "title": "Rank Scores",
+    "difficulty": "Medium",
+    "link": "https://leetcode.com/problems/rank-scores/"
   },
-  "178": {"category": "Database", "difficulty": "Medium", "id": 178, "link": "https://leetcode.com/problems/rank-scores/", "title": "Rank Scores"},
   "179": {
+    "id": 179,
     "category": "Greedy",
+    "title": "Largest Number",
     "difficulty": "Medium",
-    "id": 179,
-    "link": "https://leetcode.com/problems/largest-number/",
-    "title": "Largest Number"
+    "link": "https://leetcode.com/problems/largest-number/"
   },
   "180": {
+    "id": 180,
     "category": "Database",
+    "title": "Consecutive Numbers",
     "difficulty": "Medium",
-    "id": 180,
-    "link": "https://leetcode.com/problems/consecutive-numbers/",
-    "title": "Consecutive Numbers"
+    "link": "https://leetcode.com/problems/consecutive-numbers/"
   },
   "181": {
+    "id": 181,
     "category": "Database",
+    "title": "Employees Earning More Than Their Managers",
     "difficulty": "Easy",
-    "id": 181,
-    "link": "https://leetcode.com/problems/employees-earning-more-than-their-managers/",
-    "title": "Employees Earning More Than Their Managers"
+    "link": "https://leetcode.com/problems/employees-earning-more-than-their-managers/"
   },
   "182": {
+    "id": 182,
     "category": "Database",
+    "title": "Duplicate Emails",
     "difficulty": "Easy",
-    "id": 182,
-    "link": "https://leetcode.com/problems/duplicate-emails/",
-    "title": "Duplicate Emails"
+    "link": "https://leetcode.com/problems/duplicate-emails/"
   },
   "183": {
+    "id": 183,
     "category": "Database",
+    "title": "Customers Who Never Order",
     "difficulty": "Easy",
-    "id": 183,
-    "link": "https://leetcode.com/problems/customers-who-never-order/",
-    "title": "Customers Who Never Order"
+    "link": "https://leetcode.com/problems/customers-who-never-order/"
   },
   "184": {
+    "id": 184,
     "category": "Database",
+    "title": "Department Highest Salary",
     "difficulty": "Medium",
-    "id": 184,
-    "link": "https://leetcode.com/problems/department-highest-salary/",
-    "title": "Department Highest Salary"
+    "link": "https://leetcode.com/problems/department-highest-salary/"
   },
   "185": {
+    "id": 185,
     "category": "Database",
+    "title": "Department Top Three Salaries",
     "difficulty": "Hard",
-    "id": 185,
-    "link": "https://leetcode.com/problems/department-top-three-salaries/",
-    "title": "Department Top Three Salaries"
+    "link": "https://leetcode.com/problems/department-top-three-salaries/"
   },
   "186": {
+    "id": 186,
     "category": "Two Pointers",
+    "title": "Reverse Words in a String II",
     "difficulty": "Medium",
-    "id": 186,
-    "link": "https://leetcode.com/problems/reverse-words-in-a-string-ii/",
-    "title": "Reverse Words in a String II"
+    "link": "https://leetcode.com/problems/reverse-words-in-a-string-ii/"
   },
   "187": {
+    "id": 187,
     "category": "Sliding Window",
+    "title": "Repeated DNA Sequences",
     "difficulty": "Medium",
-    "id": 187,
-    "link": "https://leetcode.com/problems/repeated-dna-sequences/",
-    "title": "Repeated DNA Sequences"
+    "link": "https://leetcode.com/problems/repeated-dna-sequences/"
   },
   "188": {
+    "id": 188,
     "category": "Dynamic Programming",
+    "title": "Best Time to Buy and Sell Stock IV",
     "difficulty": "Hard",
-    "id": 188,
-    "link": "https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv/",
-    "title": "Best Time to Buy and Sell Stock IV"
+    "link": "https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv/"
   },
   "189": {
+    "id": 189,
     "category": "Math & Geometry",
+    "title": "Rotate Array",
     "difficulty": "Medium",
-    "id": 189,
-    "link": "https://leetcode.com/problems/rotate-array/",
-    "title": "Rotate Array"
+    "link": "https://leetcode.com/problems/rotate-array/"
   },
   "190": {
+    "id": 190,
     "category": "Bit Manipulation",
+    "title": "Reverse Bits",
     "difficulty": "Easy",
-    "id": 190,
-    "link": "https://leetcode.com/problems/reverse-bits/",
-    "title": "Reverse Bits"
+    "link": "https://leetcode.com/problems/reverse-bits/"
   },
   "191": {
+    "id": 191,
     "category": "Bit Manipulation",
+    "title": "Number of 1 Bits",
     "difficulty": "Easy",
-    "id": 191,
-    "link": "https://leetcode.com/problems/number-of-1-bits/",
-    "title": "Number of 1 Bits"
+    "link": "https://leetcode.com/problems/number-of-1-bits/"
   },
   "192": {
+    "id": 192,
     "category": "Array & Hashing",
+    "title": "Word Frequency",
     "difficulty": "Medium",
-    "id": 192,
-    "link": "https://leetcode.com/problems/word-frequency/",
-    "title": "Word Frequency"
+    "link": "https://leetcode.com/problems/word-frequency/"
   },
   "193": {
+    "id": 193,
     "category": "Array & Hashing",
+    "title": "Valid Phone Numbers",
     "difficulty": "Easy",
-    "id": 193,
-    "link": "https://leetcode.com/problems/valid-phone-numbers/",
-    "title": "Valid Phone Numbers"
+    "link": "https://leetcode.com/problems/valid-phone-numbers/"
   },
   "194": {
+    "id": 194,
     "category": "Array & Hashing",
+    "title": "Transpose File",
     "difficulty": "Medium",
-    "id": 194,
-    "link": "https://leetcode.com/problems/transpose-file/",
-    "title": "Transpose File"
+    "link": "https://leetcode.com/problems/transpose-file/"
+  },
+  "195": {
+    "id": 195,
+    "category": "Array & Hashing",
+    "title": "Tenth Line",
+    "difficulty": "Easy",
+    "link": "https://leetcode.com/problems/tenth-line/"
   },
-  "195": {"category": "Array & Hashing", "difficulty": "Easy", "id": 195, "link": "https://leetcode.com/problems/tenth-line/", "title": "Tenth Line"},
   "196": {
+    "id": 196,
     "category": "Database",
+    "title": "Delete Duplicate Emails",
     "difficulty": "Easy",
-    "id": 196,
-    "link": "https://leetcode.com/problems/delete-duplicate-emails/",
-    "title": "Delete Duplicate Emails"
+    "link": "https://leetcode.com/problems/delete-duplicate-emails/"
   },
   "197": {
+    "id": 197,
     "category": "Database",
+    "title": "Rising Temperature",
     "difficulty": "Easy",
-    "id": 197,
-    "link": "https://leetcode.com/problems/rising-temperature/",
-    "title": "Rising Temperature"
+    "link": "https://leetcode.com/problems/rising-temperature/"
   },
   "198": {
+    "id": 198,
     "category": "Dynamic Programming",
+    "title": "House Robber",
     "difficulty": "Medium",
-    "id": 198,
-    "link": "https://leetcode.com/problems/house-robber/",
-    "title": "House Robber"
+    "link": "https://leetcode.com/problems/house-robber/"
   },
   "199": {
+    "id": 199,
     "category": "Tree",
+    "title": "Binary Tree Right Side View",
     "difficulty": "Medium",
-    "id": 199,
-    "link": "https://leetcode.com/problems/binary-tree-right-side-view/",
-    "title": "Binary Tree Right Side View"
+    "link": "https://leetcode.com/problems/binary-tree-right-side-view/"
   },
   "200": {
+    "id": 200,
     "category": "Graph Traversal",
+    "title": "Number of Islands",
     "difficulty": "Medium",
-    "id": 200,
-    "link": "https://leetcode.com/problems/number-of-islands/",
-    "title": "Number of Islands"
+    "link": "https://leetcode.com/problems/number-of-islands/"
   },
   "201": {
+    "id": 201,
     "category": "Bit Manipulation",
+    "title": "Bitwise AND of Numbers Range",
     "difficulty": "Medium",
-    "id": 201,
-    "link": "https://leetcode.com/problems/bitwise-and-of-numbers-range/",
-    "title": "Bitwise AND of Numbers Range"
+    "link": "https://leetcode.com/problems/bitwise-and-of-numbers-range/"
   },
   "202": {
+    "id": 202,
     "category": "Math & Geometry",
+    "title": "Happy Number",
     "difficulty": "Easy",
-    "id": 202,
-    "link": "https://leetcode.com/problems/happy-number/",
-    "title": "Happy Number"
+    "link": "https://leetcode.com/problems/happy-number/"
   },
   "203": {
+    "id": 203,
     "category": "Linked List",
+    "title": "Remove Linked List Elements",
     "difficulty": "Easy",
-    "id": 203,
-    "link": "https://leetcode.com/problems/remove-linked-list-elements/",
-    "title": "Remove Linked List Elements"
+    "link": "https://leetcode.com/problems/remove-linked-list-elements/"
   },
   "204": {
+    "id": 204,
     "category": "Math & Geometry",
+    "title": "Count Primes",
     "difficulty": "Medium",
-    "id": 204,
-    "link": "https://leetcode.com/problems/count-primes/",
-    "title": "Count Primes"
+    "link": "https://leetcode.com/problems/count-primes/"
   },
   "205": {
+    "id": 205,
     "category": "Array & Hashing",
+    "title": "Isomorphic Strings",
     "difficulty": "Easy",
-    "id": 205,
-    "link": "https://leetcode.com/problems/isomorphic-strings/",
-    "title": "Isomorphic Strings"
+    "link": "https://leetcode.com/problems/isomorphic-strings/"
   },
   "206": {
+    "id": 206,
     "category": "Linked List",
+    "title": "Reverse Linked List",
     "difficulty": "Easy",
-    "id": 206,
-    "link": "https://leetcode.com/problems/reverse-linked-list/",
-    "title": "Reverse Linked List"
+    "link": "https://leetcode.com/problems/reverse-linked-list/"
   },
   "207": {
+    "id": 207,
     "category": "Graph Traversal",
+    "title": "Course Schedule",
     "difficulty": "Medium",
-    "id": 207,
-    "link": "https://leetcode.com/problems/course-schedule/",
-    "title": "Course Schedule"
+    "link": "https://leetcode.com/problems/course-schedule/"
   },
   "208": {
+    "id": 208,
     "category": "Trie",
+    "title": "Implement Trie (Prefix Tree)",
     "difficulty": "Medium",
-    "id": 208,
-    "link": "https://leetcode.com/problems/implement-trie-prefix-tree/",
-    "title": "Implement Trie (Prefix Tree)"
+    "link": "https://leetcode.com/problems/implement-trie-prefix-tree/"
   },
   "209": {
+    "id": 209,
     "category": "Sliding Window",
+    "title": "Minimum Size Subarray Sum",
     "difficulty": "Medium",
-    "id": 209,
-    "link": "https://leetcode.com/problems/minimum-size-subarray-sum/",
-    "title": "Minimum Size Subarray Sum"
+    "link": "https://leetcode.com/problems/minimum-size-subarray-sum/"
   },
   "210": {
+    "id": 210,
     "category": "Graph Traversal",
+    "title": "Course Schedule II",
     "difficulty": "Medium",
-    "id": 210,
-    "link": "https://leetcode.com/problems/course-schedule-ii/",
-    "title": "Course Schedule II"
+    "link": "https://leetcode.com/problems/course-schedule-ii/"
   },
   "211": {
+    "id": 211,
     "category": "Graph Traversal",
+    "title": "Design Add and Search Words Data Structure",
     "difficulty": "Medium",
-    "id": 211,
-    "link": "https://leetcode.com/problems/design-add-and-search-words-data-structure/",
-    "title": "Design Add and Search Words Data Structure"
+    "link": "https://leetcode.com/problems/design-add-and-search-words-data-structure/"
   },
   "212": {
+    "id": 212,
     "category": "Backtracking",
+    "title": "Word Search II",
     "difficulty": "Hard",
-    "id": 212,
-    "link": "https://leetcode.com/problems/word-search-ii/",
-    "title": "Word Search II"
+    "link": "https://leetcode.com/problems/word-search-ii/"
   },
   "213": {
+    "id": 213,
     "category": "Dynamic Programming",
+    "title": "House Robber II",
     "difficulty": "Medium",
-    "id": 213,
-    "link": "https://leetcode.com/problems/house-robber-ii/",
-    "title": "House Robber II"
+    "link": "https://leetcode.com/problems/house-robber-ii/"
   },
   "214": {
+    "id": 214,
     "category": "Array & Hashing",
+    "title": "Shortest Palindrome",
     "difficulty": "Hard",
-    "id": 214,
-    "link": "https://leetcode.com/problems/shortest-palindrome/",
-    "title": "Shortest Palindrome"
+    "link": "https://leetcode.com/problems/shortest-palindrome/"
   },
   "215": {
+    "id": 215,
     "category": "Heap (Priority Queue)",
+    "title": "Kth Largest Element in an Array",
     "difficulty": "Medium",
-    "id": 215,
-    "link": "https://leetcode.com/problems/kth-largest-element-in-an-array/",
-    "title": "Kth Largest Element in an Array"
+    "link": "https://leetcode.com/problems/kth-largest-element-in-an-array/"
   },
   "216": {
+    "id": 216,
     "category": "Backtracking",
+    "title": "Combination Sum III",
     "difficulty": "Medium",
-    "id": 216,
-    "link": "https://leetcode.com/problems/combination-sum-iii/",
-    "title": "Combination Sum III"
+    "link": "https://leetcode.com/problems/combination-sum-iii/"
   },
   "217": {
+    "id": 217,
     "category": "Array & Hashing",
+    "title": "Contains Duplicate",
     "difficulty": "Easy",
-    "id": 217,
-    "link": "https://leetcode.com/problems/contains-duplicate/",
-    "title": "Contains Duplicate"
+    "link": "https://leetcode.com/problems/contains-duplicate/"
   },
   "218": {
+    "id": 218,
     "category": "Tree",
+    "title": "The Skyline Problem",
     "difficulty": "Hard",
-    "id": 218,
-    "link": "https://leetcode.com/problems/the-skyline-problem/",
-    "title": "The Skyline Problem"
+    "link": "https://leetcode.com/problems/the-skyline-problem/"
   },
   "219": {
+    "id": 219,
     "category": "Sliding Window",
+    "title": "Contains Duplicate II",
     "difficulty": "Easy",
-    "id": 219,
-    "link": "https://leetcode.com/problems/contains-duplicate-ii/",
-    "title": "Contains Duplicate II"
+    "link": "https://leetcode.com/problems/contains-duplicate-ii/"
   },
   "220": {
+    "id": 220,
     "category": "Sliding Window",
+    "title": "Contains Duplicate III",
     "difficulty": "Hard",
-    "id": 220,
-    "link": "https://leetcode.com/problems/contains-duplicate-iii/",
-    "title": "Contains Duplicate III"
+    "link": "https://leetcode.com/problems/contains-duplicate-iii/"
   },
   "221": {
+    "id": 221,
     "category": "Dynamic Programming",
+    "title": "Maximal Square",
     "difficulty": "Medium",
-    "id": 221,
-    "link": "https://leetcode.com/problems/maximal-square/",
-    "title": "Maximal Square"
+    "link": "https://leetcode.com/problems/maximal-square/"
   },
   "222": {
+    "id": 222,
     "category": "Tree",
+    "title": "Count Complete Tree Nodes",
     "difficulty": "Easy",
-    "id": 222,
-    "link": "https://leetcode.com/problems/count-complete-tree-nodes/",
-    "title": "Count Complete Tree Nodes"
+    "link": "https://leetcode.com/problems/count-complete-tree-nodes/"
   },
   "223": {
+    "id": 223,
     "category": "Math & Geometry",
+    "title": "Rectangle Area",
     "difficulty": "Medium",
-    "id": 223,
-    "link": "https://leetcode.com/problems/rectangle-area/",
-    "title": "Rectangle Area"
+    "link": "https://leetcode.com/problems/rectangle-area/"
   },
   "224": {
+    "id": 224,
     "category": "Stack",
+    "title": "Basic Calculator",
     "difficulty": "Hard",
-    "id": 224,
-    "link": "https://leetcode.com/problems/basic-calculator/",
-    "title": "Basic Calculator"
+    "link": "https://leetcode.com/problems/basic-calculator/"
   },
   "225": {
+    "id": 225,
     "category": "Stack",
+    "title": "Implement Stack using Queues",
     "difficulty": "Easy",
-    "id": 225,
-    "link": "https://leetcode.com/problems/implement-stack-using-queues/",
-    "title": "Implement Stack using Queues"
+    "link": "https://leetcode.com/problems/implement-stack-using-queues/"
   },
   "226": {
+    "id": 226,
     "category": "Tree",
+    "title": "Invert Binary Tree",
     "difficulty": "Easy",
-    "id": 226,
-    "link": "https://leetcode.com/problems/invert-binary-tree/",
-    "title": "Invert Binary Tree"
+    "link": "https://leetcode.com/problems/invert-binary-tree/"
   },
   "227": {
+    "id": 227,
     "category": "Stack",
+    "title": "Basic Calculator II",
     "difficulty": "Medium",
-    "id": 227,
-    "link": "https://leetcode.com/problems/basic-calculator-ii/",
-    "title": "Basic Calculator II"
+    "link": "https://leetcode.com/problems/basic-calculator-ii/"
   },
   "228": {
+    "id": 228,
     "category": "Array & Hashing",
+    "title": "Summary Ranges",
     "difficulty": "Easy",
-    "id": 228,
-    "link": "https://leetcode.com/problems/summary-ranges/",
-    "title": "Summary Ranges"
+    "link": "https://leetcode.com/problems/summary-ranges/"
   },
   "229": {
+    "id": 229,
     "category": "Array & Hashing",
+    "title": "Majority Element II",
     "difficulty": "Medium",
-    "id": 229,
-    "link": "https://leetcode.com/problems/majority-element-ii/",
-    "title": "Majority Element II"
+    "link": "https://leetcode.com/problems/majority-element-ii/"
   },
   "230": {
+    "id": 230,
     "category": "Tree",
+    "title": "Kth Smallest Element in a BST",
     "difficulty": "Medium",
-    "id": 230,
-    "link": "https://leetcode.com/problems/kth-smallest-element-in-a-bst/",
-    "title": "Kth Smallest Element in a BST"
+    "link": "https://leetcode.com/problems/kth-smallest-element-in-a-bst/"
   },
   "231": {
+    "id": 231,
     "category": "Bit Manipulation",
+    "title": "Power of Two",
     "difficulty": "Easy",
-    "id": 231,
-    "link": "https://leetcode.com/problems/power-of-two/",
-    "title": "Power of Two"
+    "link": "https://leetcode.com/problems/power-of-two/"
   },
   "232": {
+    "id": 232,
     "category": "Stack",
+    "title": "Implement Queue using Stacks",
     "difficulty": "Easy",
-    "id": 232,
-    "link": "https://leetcode.com/problems/implement-queue-using-stacks/",
-    "title": "Implement Queue using Stacks"
+    "link": "https://leetcode.com/problems/implement-queue-using-stacks/"
   },
   "233": {
+    "id": 233,
     "category": "Dynamic Programming",
+    "title": "Number of Digit One",
     "difficulty": "Hard",
-    "id": 233,
-    "link": "https://leetcode.com/problems/number-of-digit-one/",
-    "title": "Number of Digit One"
+    "link": "https://leetcode.com/problems/number-of-digit-one/"
   },
   "234": {
+    "id": 234,
     "category": "Stack",
+    "title": "Palindrome Linked List",
     "difficulty": "Easy",
-    "id": 234,
-    "link": "https://leetcode.com/problems/palindrome-linked-list/",
-    "title": "Palindrome Linked List"
+    "link": "https://leetcode.com/problems/palindrome-linked-list/"
   },
   "235": {
+    "id": 235,
     "category": "Tree",
+    "title": "Lowest Common Ancestor of a Binary Search Tree",
     "difficulty": "Medium",
-    "id": 235,
-    "link": "https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/",
-    "title": "Lowest Common Ancestor of a Binary Search Tree"
+    "link": "https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/"
   },
   "236": {
+    "id": 236,
     "category": "Tree",
+    "title": "Lowest Common Ancestor of a Binary Tree",
     "difficulty": "Medium",
-    "id": 236,
-    "link": "https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/",
-    "title": "Lowest Common Ancestor of a Binary Tree"
+    "link": "https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/"
   },
   "237": {
+    "id": 237,
     "category": "Linked List",
+    "title": "Delete Node in a Linked List",
     "difficulty": "Medium",
-    "id": 237,
-    "link": "https://leetcode.com/problems/delete-node-in-a-linked-list/",
-    "title": "Delete Node in a Linked List"
+    "link": "https://leetcode.com/problems/delete-node-in-a-linked-list/"
   },
   "238": {
+    "id": 238,
     "category": "Array & Hashing",
+    "title": "Product of Array Except Self",
     "difficulty": "Medium",
-    "id": 238,
-    "link": "https://leetcode.com/problems/product-of-array-except-self/",
-    "title": "Product of Array Except Self"
+    "link": "https://leetcode.com/problems/product-of-array-except-self/"
   },
   "239": {
+    "id": 239,
     "category": "Sliding Window",
+    "title": "Sliding Window Maximum",
     "difficulty": "Hard",
-    "id": 239,
-    "link": "https://leetcode.com/problems/sliding-window-maximum/",
-    "title": "Sliding Window Maximum"
+    "link": "https://leetcode.com/problems/sliding-window-maximum/"
   },
   "240": {
+    "id": 240,
     "category": "Binary Search",
+    "title": "Search a 2D Matrix II",
     "difficulty": "Medium",
-    "id": 240,
-    "link": "https://leetcode.com/problems/search-a-2d-matrix-ii/",
-    "title": "Search a 2D Matrix II"
+    "link": "https://leetcode.com/problems/search-a-2d-matrix-ii/"
   },
   "241": {
+    "id": 241,
     "category": "Dynamic Programming",
+    "title": "Different Ways to Add Parentheses",
     "difficulty": "Medium",
-    "id": 241,
-    "link": "https://leetcode.com/problems/different-ways-to-add-parentheses/",
-    "title": "Different Ways to Add Parentheses"
+    "link": "https://leetcode.com/problems/different-ways-to-add-parentheses/"
   },
   "242": {
+    "id": 242,
     "category": "Array & Hashing",
+    "title": "Valid Anagram",
     "difficulty": "Easy",
-    "id": 242,
-    "link": "https://leetcode.com/problems/valid-anagram/",
-    "title": "Valid Anagram"
+    "link": "https://leetcode.com/problems/valid-anagram/"
   },
   "243": {
+    "id": 243,
     "category": "Array & Hashing",
+    "title": "Shortest Word Distance",
     "difficulty": "Easy",
-    "id": 243,
-    "link": "https://leetcode.com/problems/shortest-word-distance/",
-    "title": "Shortest Word Distance"
+    "link": "https://leetcode.com/problems/shortest-word-distance/"
   },
   "244": {
+    "id": 244,
     "category": "Two Pointers",
+    "title": "Shortest Word Distance II",
     "difficulty": "Medium",
-    "id": 244,
-    "link": "https://leetcode.com/problems/shortest-word-distance-ii/",
-    "title": "Shortest Word Distance II"
+    "link": "https://leetcode.com/problems/shortest-word-distance-ii/"
   },
   "245": {
+    "id": 245,
     "category": "Array & Hashing",
+    "title": "Shortest Word Distance III",
     "difficulty": "Medium",
-    "id": 245,
-    "link": "https://leetcode.com/problems/shortest-word-distance-iii/",
-    "title": "Shortest Word Distance III"
+    "link": "https://leetcode.com/problems/shortest-word-distance-iii/"
   },
   "246": {
+    "id": 246,
     "category": "Two Pointers",
+    "title": "Strobogrammatic Number",
     "difficulty": "Easy",
-    "id": 246,
-    "link": "https://leetcode.com/problems/strobogrammatic-number/",
-    "title": "Strobogrammatic Number"
+    "link": "https://leetcode.com/problems/strobogrammatic-number/"
   },
   "247": {
+    "id": 247,
     "category": "Array & Hashing",
+    "title": "Strobogrammatic Number II",
     "difficulty": "Medium",
-    "id": 247,
-    "link": "https://leetcode.com/problems/strobogrammatic-number-ii/",
-    "title": "Strobogrammatic Number II"
+    "link": "https://leetcode.com/problems/strobogrammatic-number-ii/"
   },
   "248": {
+    "id": 248,
     "category": "Array & Hashing",
+    "title": "Strobogrammatic Number III",
     "difficulty": "Hard",
-    "id": 248,
-    "link": "https://leetcode.com/problems/strobogrammatic-number-iii/",
-    "title": "Strobogrammatic Number III"
+    "link": "https://leetcode.com/problems/strobogrammatic-number-iii/"
   },
   "249": {
+    "id": 249,
     "category": "Array & Hashing",
+    "title": "Group Shifted Strings",
     "difficulty": "Medium",
-    "id": 249,
-    "link": "https://leetcode.com/problems/group-shifted-strings/",
-    "title": "Group Shifted Strings"
+    "link": "https://leetcode.com/problems/group-shifted-strings/"
   },
   "250": {
+    "id": 250,
     "category": "Tree",
+    "title": "Count Univalue Subtrees",
     "difficulty": "Medium",
-    "id": 250,
-    "link": "https://leetcode.com/problems/count-univalue-subtrees/",
-    "title": "Count Univalue Subtrees"
+    "link": "https://leetcode.com/problems/count-univalue-subtrees/"
   },
   "251": {
+    "id": 251,
     "category": "Two Pointers",
+    "title": "Flatten 2D Vector",
     "difficulty": "Medium",
-    "id": 251,
-    "link": "https://leetcode.com/problems/flatten-2d-vector/",
-    "title": "Flatten 2D Vector"
+    "link": "https://leetcode.com/problems/flatten-2d-vector/"
   },
   "252": {
+    "id": 252,
     "category": "Array & Hashing",
+    "title": "Meeting Rooms",
     "difficulty": "Easy",
-    "id": 252,
-    "link": "https://leetcode.com/problems/meeting-rooms/",
-    "title": "Meeting Rooms"
+    "link": "https://leetcode.com/problems/meeting-rooms/"
   },
   "253": {
+    "id": 253,
     "category": "Heap (Priority Queue)",
+    "title": "Meeting Rooms II",
     "difficulty": "Medium",
-    "id": 253,
-    "link": "https://leetcode.com/problems/meeting-rooms-ii/",
-    "title": "Meeting Rooms II"
+    "link": "https://leetcode.com/problems/meeting-rooms-ii/"
   },
   "254": {
+    "id": 254,
     "category": "Backtracking",
+    "title": "Factor Combinations",
     "difficulty": "Medium",
-    "id": 254,
-    "link": "https://leetcode.com/problems/factor-combinations/",
-    "title": "Factor Combinations"
+    "link": "https://leetcode.com/problems/factor-combinations/"
   },
   "255": {
+    "id": 255,
     "category": "Tree",
+    "title": "Verify Preorder Sequence in Binary Search Tree",
     "difficulty": "Medium",
-    "id": 255,
-    "link": "https://leetcode.com/problems/verify-preorder-sequence-in-binary-search-tree/",
-    "title": "Verify Preorder Sequence in Binary Search Tree"
+    "link": "https://leetcode.com/problems/verify-preorder-sequence-in-binary-search-tree/"
   },
   "256": {
+    "id": 256,
     "category": "Dynamic Programming",
+    "title": "Paint House",
     "difficulty": "Medium",
-    "id": 256,
-    "link": "https://leetcode.com/problems/paint-house/",
-    "title": "Paint House"
+    "link": "https://leetcode.com/problems/paint-house/"
   },
   "257": {
+    "id": 257,
     "category": "Tree",
+    "title": "Binary Tree Paths",
     "difficulty": "Easy",
-    "id": 257,
-    "link": "https://leetcode.com/problems/binary-tree-paths/",
-    "title": "Binary Tree Paths"
+    "link": "https://leetcode.com/problems/binary-tree-paths/"
+  },
+  "258": {
+    "id": 258,
+    "category": "Math & Geometry",
+    "title": "Add Digits",
+    "difficulty": "Easy",
+    "link": "https://leetcode.com/problems/add-digits/"
   },
-  "258": {"category": "Math & Geometry", "difficulty": "Easy", "id": 258, "link": "https://leetcode.com/problems/add-digits/", "title": "Add Digits"},
   "259": {
+    "id": 259,
     "category": "Binary Search",
+    "title": "3Sum Smaller",
     "difficulty": "Medium",
-    "id": 259,
-    "link": "https://leetcode.com/problems/3sum-smaller/",
-    "title": "3Sum Smaller"
+    "link": "https://leetcode.com/problems/3sum-smaller/"
   },
   "260": {
+    "id": 260,
     "category": "Bit Manipulation",
+    "title": "Single Number III",
     "difficulty": "Medium",
-    "id": 260,
-    "link": "https://leetcode.com/problems/single-number-iii/",
-    "title": "Single Number III"
+    "link": "https://leetcode.com/problems/single-number-iii/"
   },
   "261": {
+    "id": 261,
     "category": "Graph Traversal",
+    "title": "Graph Valid Tree",
     "difficulty": "Medium",
-    "id": 261,
-    "link": "https://leetcode.com/problems/graph-valid-tree/",
-    "title": "Graph Valid Tree"
+    "link": "https://leetcode.com/problems/graph-valid-tree/"
   },
   "262": {
+    "id": 262,
     "category": "Database",
+    "title": "Trips and Users",
     "difficulty": "Hard",
-    "id": 262,
-    "link": "https://leetcode.com/problems/trips-and-users/",
-    "title": "Trips and Users"
+    "link": "https://leetcode.com/problems/trips-and-users/"
   },
   "263": {
+    "id": 263,
     "category": "Math & Geometry",
+    "title": "Ugly Number",
     "difficulty": "Easy",
-    "id": 263,
-    "link": "https://leetcode.com/problems/ugly-number/",
-    "title": "Ugly Number"
+    "link": "https://leetcode.com/problems/ugly-number/"
   },
   "264": {
+    "id": 264,
     "category": "Dynamic Programming",
+    "title": "Ugly Number II",
     "difficulty": "Medium",
-    "id": 264,
-    "link": "https://leetcode.com/problems/ugly-number-ii/",
-    "title": "Ugly Number II"
+    "link": "https://leetcode.com/problems/ugly-number-ii/"
   },
   "265": {
+    "id": 265,
     "category": "Dynamic Programming",
+    "title": "Paint House II",
     "difficulty": "Hard",
-    "id": 265,
-    "link": "https://leetcode.com/problems/paint-house-ii/",
-    "title": "Paint House II"
+    "link": "https://leetcode.com/problems/paint-house-ii/"
   },
   "266": {
+    "id": 266,
     "category": "Bit Manipulation",
+    "title": "Palindrome Permutation",
     "difficulty": "Easy",
-    "id": 266,
-    "link": "https://leetcode.com/problems/palindrome-permutation/",
-    "title": "Palindrome Permutation"
+    "link": "https://leetcode.com/problems/palindrome-permutation/"
   },
   "267": {
+    "id": 267,
     "category": "Backtracking",
+    "title": "Palindrome Permutation II",
     "difficulty": "Medium",
-    "id": 267,
-    "link": "https://leetcode.com/problems/palindrome-permutation-ii/",
-    "title": "Palindrome Permutation II"
+    "link": "https://leetcode.com/problems/palindrome-permutation-ii/"
   },
   "268": {
+    "id": 268,
     "category": "Binary Search",
+    "title": "Missing Number",
     "difficulty": "Easy",
-    "id": 268,
-    "link": "https://leetcode.com/problems/missing-number/",
-    "title": "Missing Number"
+    "link": "https://leetcode.com/problems/missing-number/"
   },
   "269": {
+    "id": 269,
     "category": "Graph Traversal",
+    "title": "Alien Dictionary",
     "difficulty": "Hard",
-    "id": 269,
-    "link": "https://leetcode.com/problems/alien-dictionary/",
-    "title": "Alien Dictionary"
+    "link": "https://leetcode.com/problems/alien-dictionary/"
   },
   "270": {
+    "id": 270,
     "category": "Tree",
+    "title": "Closest Binary Search Tree Value",
     "difficulty": "Easy",
-    "id": 270,
-    "link": "https://leetcode.com/problems/closest-binary-search-tree-value/",
-    "title": "Closest Binary Search Tree Value"
+    "link": "https://leetcode.com/problems/closest-binary-search-tree-value/"
   },
   "271": {
+    "id": 271,
     "category": "Array & Hashing",
+    "title": "Encode and Decode Strings",
     "difficulty": "Medium",
-    "id": 271,
-    "link": "https://leetcode.com/problems/encode-and-decode-strings/",
-    "title": "Encode and Decode Strings"
+    "link": "https://leetcode.com/problems/encode-and-decode-strings/"
   },
   "272": {
+    "id": 272,
     "category": "Tree",
+    "title": "Closest Binary Search Tree Value II",
     "difficulty": "Hard",
-    "id": 272,
-    "link": "https://leetcode.com/problems/closest-binary-search-tree-value-ii/",
-    "title": "Closest Binary Search Tree Value II"
+    "link": "https://leetcode.com/problems/closest-binary-search-tree-value-ii/"
   },
   "273": {
+    "id": 273,
     "category": "Math & Geometry",
+    "title": "Integer to English Words",
     "difficulty": "Hard",
-    "id": 273,
-    "link": "https://leetcode.com/problems/integer-to-english-words/",
-    "title": "Integer to English Words"
+    "link": "https://leetcode.com/problems/integer-to-english-words/"
+  },
+  "274": {
+    "id": 274,
+    "category": "Array & Hashing",
+    "title": "H-Index",
+    "difficulty": "Medium",
+    "link": "https://leetcode.com/problems/h-index/"
+  },
+  "275": {
+    "id": 275,
+    "category": "Binary Search",
+    "title": "H-Index II",
+    "difficulty": "Medium",
+    "link": "https://leetcode.com/problems/h-index-ii/"
   },
-  "274": {"category": "Array & Hashing", "difficulty": "Medium", "id": 274, "link": "https://leetcode.com/problems/h-index/", "title": "H-Index"},
-  "275": {"category": "Binary Search", "difficulty": "Medium", "id": 275, "link": "https://leetcode.com/problems/h-index-ii/", "title": "H-Index II"},
   "276": {
+    "id": 276,
     "category": "Dynamic Programming",
+    "title": "Paint Fence",
     "difficulty": "Medium",
-    "id": 276,
-    "link": "https://leetcode.com/problems/paint-fence/",
-    "title": "Paint Fence"
+    "link": "https://leetcode.com/problems/paint-fence/"
   },
   "277": {
+    "id": 277,
     "category": "Graph Traversal",
+    "title": "Find the Celebrity",
     "difficulty": "Medium",
-    "id": 277,
-    "link": "https://leetcode.com/problems/find-the-celebrity/",
-    "title": "Find the Celebrity"
+    "link": "https://leetcode.com/problems/find-the-celebrity/"
   },
   "278": {
+    "id": 278,
     "category": "Binary Search",
+    "title": "First Bad Version",
     "difficulty": "Easy",
-    "id": 278,
-    "link": "https://leetcode.com/problems/first-bad-version/",
-    "title": "First Bad Version"
+    "link": "https://leetcode.com/problems/first-bad-version/"
   },
   "279": {
+    "id": 279,
     "category": "Graph Traversal",
+    "title": "Perfect Squares",
     "difficulty": "Medium",
-    "id": 279,
-    "link": "https://leetcode.com/problems/perfect-squares/",
-    "title": "Perfect Squares"
+    "link": "https://leetcode.com/problems/perfect-squares/"
+  },
+  "280": {
+    "id": 280,
+    "category": "Greedy",
+    "title": "Wiggle Sort",
+    "difficulty": "Medium",
+    "link": "https://leetcode.com/problems/wiggle-sort/"
   },
-  "280": {"category": "Greedy", "difficulty": "Medium", "id": 280, "link": "https://leetcode.com/problems/wiggle-sort/", "title": "Wiggle Sort"},
   "281": {
+    "id": 281,
     "category": "Array & Hashing",
+    "title": "Zigzag Iterator",
     "difficulty": "Medium",
-    "id": 281,
-    "link": "https://leetcode.com/problems/zigzag-iterator/",
-    "title": "Zigzag Iterator"
+    "link": "https://leetcode.com/problems/zigzag-iterator/"
   },
   "282": {
+    "id": 282,
     "category": "Backtracking",
+    "title": "Expression Add Operators",
     "difficulty": "Hard",
-    "id": 282,
-    "link": "https://leetcode.com/problems/expression-add-operators/",
-    "title": "Expression Add Operators"
+    "link": "https://leetcode.com/problems/expression-add-operators/"
+  },
+  "283": {
+    "id": 283,
+    "category": "Two Pointers",
+    "title": "Move Zeroes",
+    "difficulty": "Easy",
+    "link": "https://leetcode.com/problems/move-zeroes/"
   },
-  "283": {"category": "Two Pointers", "difficulty": "Easy", "id": 283, "link": "https://leetcode.com/problems/move-zeroes/", "title": "Move Zeroes"},
   "284": {
+    "id": 284,
     "category": "Array & Hashing",
+    "title": "Peeking Iterator",
     "difficulty": "Medium",
-    "id": 284,
-    "link": "https://leetcode.com/problems/peeking-iterator/",
-    "title": "Peeking Iterator"
+    "link": "https://leetcode.com/problems/peeking-iterator/"
   },
   "285": {
+    "id": 285,
     "category": "Tree",
+    "title": "Inorder Successor in BST",
     "difficulty": "Medium",
-    "id": 285,
-    "link": "https://leetcode.com/problems/inorder-successor-in-bst/",
-    "title": "Inorder Successor in BST"
+    "link": "https://leetcode.com/problems/inorder-successor-in-bst/"
   },
   "286": {
+    "id": 286,
     "category": "Graph Traversal",
+    "title": "Walls and Gates",
     "difficulty": "Medium",
-    "id": 286,
-    "link": "https://leetcode.com/problems/walls-and-gates/",
-    "title": "Walls and Gates"
+    "link": "https://leetcode.com/problems/walls-and-gates/"
   },
   "287": {
+    "id": 287,
     "category": "Binary Search",
+    "title": "Find the Duplicate Number",
     "difficulty": "Medium",
-    "id": 287,
-    "link": "https://leetcode.com/problems/find-the-duplicate-number/",
-    "title": "Find the Duplicate Number"
+    "link": "https://leetcode.com/problems/find-the-duplicate-number/"
   },
   "288": {
+    "id": 288,
     "category": "Array & Hashing",
+    "title": "Unique Word Abbreviation",
     "difficulty": "Medium",
-    "id": 288,
-    "link": "https://leetcode.com/problems/unique-word-abbreviation/",
-    "title": "Unique Word Abbreviation"
+    "link": "https://leetcode.com/problems/unique-word-abbreviation/"
   },
   "289": {
+    "id": 289,
     "category": "Array & Hashing",
+    "title": "Game of Life",
     "difficulty": "Medium",
-    "id": 289,
-    "link": "https://leetcode.com/problems/game-of-life/",
-    "title": "Game of Life"
+    "link": "https://leetcode.com/problems/game-of-life/"
   },
   "290": {
+    "id": 290,
     "category": "Array & Hashing",
+    "title": "Word Pattern",
     "difficulty": "Easy",
-    "id": 290,
-    "link": "https://leetcode.com/problems/word-pattern/",
-    "title": "Word Pattern"
+    "link": "https://leetcode.com/problems/word-pattern/"
   },
   "291": {
+    "id": 291,
     "category": "Backtracking",
+    "title": "Word Pattern II",
     "difficulty": "Medium",
-    "id": 291,
-    "link": "https://leetcode.com/problems/word-pattern-ii/",
-    "title": "Word Pattern II"
+    "link": "https://leetcode.com/problems/word-pattern-ii/"
+  },
+  "292": {
+    "id": 292,
+    "category": "Math & Geometry",
+    "title": "Nim Game",
+    "difficulty": "Easy",
+    "link": "https://leetcode.com/problems/nim-game/"
+  },
+  "293": {
+    "id": 293,
+    "category": "Array & Hashing",
+    "title": "Flip Game",
+    "difficulty": "Easy",
+    "link": "https://leetcode.com/problems/flip-game/"
   },
-  "292": {"category": "Math & Geometry", "difficulty": "Easy", "id": 292, "link": "https://leetcode.com/problems/nim-game/", "title": "Nim Game"},
-  "293": {"category": "Array & Hashing", "difficulty": "Easy", "id": 293, "link": "https://leetcode.com/problems/flip-game/", "title": "Flip Game"},
   "294": {
+    "id": 294,
     "category": "Dynamic Programming",
+    "title": "Flip Game II",
     "difficulty": "Medium",
-    "id": 294,
-    "link": "https://leetcode.com/problems/flip-game-ii/",
-    "title": "Flip Game II"
+    "link": "https://leetcode.com/problems/flip-game-ii/"
   },
   "295": {
+    "id": 295,
     "category": "Heap (Priority Queue)",
+    "title": "Find Median from Data Stream",
     "difficulty": "Hard",
-    "id": 295,
-    "link": "https://leetcode.com/problems/find-median-from-data-stream/",
-    "title": "Find Median from Data Stream"
+    "link": "https://leetcode.com/problems/find-median-from-data-stream/"
   },
   "296": {
+    "id": 296,
     "category": "Math & Geometry",
+    "title": "Best Meeting Point",
     "difficulty": "Hard",
-    "id": 296,
-    "link": "https://leetcode.com/problems/best-meeting-point/",
-    "title": "Best Meeting Point"
+    "link": "https://leetcode.com/problems/best-meeting-point/"
   },
   "297": {
+    "id": 297,
     "category": "Tree",
+    "title": "Serialize and Deserialize Binary Tree",
     "difficulty": "Hard",
-    "id": 297,
-    "link": "https://leetcode.com/problems/serialize-and-deserialize-binary-tree/",
-    "title": "Serialize and Deserialize Binary Tree"
+    "link": "https://leetcode.com/problems/serialize-and-deserialize-binary-tree/"
   },
   "298": {
+    "id": 298,
     "category": "Tree",
+    "title": "Binary Tree Longest Consecutive Sequence",
     "difficulty": "Medium",
-    "id": 298,
-    "link": "https://leetcode.com/problems/binary-tree-longest-consecutive-sequence/",
-    "title": "Binary Tree Longest Consecutive Sequence"
+    "link": "https://leetcode.com/problems/binary-tree-longest-consecutive-sequence/"
   },
   "299": {
+    "id": 299,
     "category": "Array & Hashing",
+    "title": "Bulls and Cows",
     "difficulty": "Medium",
-    "id": 299,
-    "link": "https://leetcode.com/problems/bulls-and-cows/",
-    "title": "Bulls and Cows"
+    "link": "https://leetcode.com/problems/bulls-and-cows/"
   },
   "300": {
+    "id": 300,
     "category": "Dynamic Programming",
+    "title": "Longest Increasing Subsequence",
     "difficulty": "Medium",
-    "id": 300,
-    "link": "https://leetcode.com/problems/longest-increasing-subsequence/",
-    "title": "Longest Increasing Subsequence"
+    "link": "https://leetcode.com/problems/longest-increasing-subsequence/"
   },
   "301": {
+    "id": 301,
     "category": "Graph Traversal",
+    "title": "Remove Invalid Parentheses",
     "difficulty": "Hard",
-    "id": 301,
-    "link": "https://leetcode.com/problems/remove-invalid-parentheses/",
-    "title": "Remove Invalid Parentheses"
+    "link": "https://leetcode.com/problems/remove-invalid-parentheses/"
   },
   "302": {
+    "id": 302,
     "category": "Graph Traversal",
+    "title": "Smallest Rectangle Enclosing Black Pixels",
     "difficulty": "Hard",
-    "id": 302,
-    "link": "https://leetcode.com/problems/smallest-rectangle-enclosing-black-pixels/",
-    "title": "Smallest Rectangle Enclosing Black Pixels"
+    "link": "https://leetcode.com/problems/smallest-rectangle-enclosing-black-pixels/"
   },
   "303": {
+    "id": 303,
     "category": "Array & Hashing",
+    "title": "Range Sum Query - Immutable",
     "difficulty": "Easy",
-    "id": 303,
-    "link": "https://leetcode.com/problems/range-sum-query-immutable/",
-    "title": "Range Sum Query - Immutable"
+    "link": "https://leetcode.com/problems/range-sum-query-immutable/"
   },
   "304": {
+    "id": 304,
     "category": "Array & Hashing",
+    "title": "Range Sum Query 2D - Immutable",
     "difficulty": "Medium",
-    "id": 304,
-    "link": "https://leetcode.com/problems/range-sum-query-2d-immutable/",
-    "title": "Range Sum Query 2D - Immutable"
+    "link": "https://leetcode.com/problems/range-sum-query-2d-immutable/"
   },
   "305": {
+    "id": 305,
     "category": "Graph Traversal",
+    "title": "Number of Islands II",
     "difficulty": "Hard",
-    "id": 305,
-    "link": "https://leetcode.com/problems/number-of-islands-ii/",
-    "title": "Number of Islands II"
+    "link": "https://leetcode.com/problems/number-of-islands-ii/"
   },
   "306": {
+    "id": 306,
     "category": "Backtracking",
+    "title": "Additive Number",
     "difficulty": "Medium",
-    "id": 306,
-    "link": "https://leetcode.com/problems/additive-number/",
-    "title": "Additive Number"
+    "link": "https://leetcode.com/problems/additive-number/"
   },
   "307": {
+    "id": 307,
     "category": "Tree",
+    "title": "Range Sum Query - Mutable",
     "difficulty": "Medium",
-    "id": 307,
-    "link": "https://leetcode.com/problems/range-sum-query-mutable/",
-    "title": "Range Sum Query - Mutable"
+    "link": "https://leetcode.com/problems/range-sum-query-mutable/"
   },
   "308": {
+    "id": 308,
     "category": "Tree",
+    "title": "Range Sum Query 2D - Mutable",
     "difficulty": "Medium",
-    "id": 308,
-    "link": "https://leetcode.com/problems/range-sum-query-2d-mutable/",
-    "title": "Range Sum Query 2D - Mutable"
+    "link": "https://leetcode.com/problems/range-sum-query-2d-mutable/"
   },
   "309": {
+    "id": 309,
     "category": "Dynamic Programming",
+    "title": "Best Time to Buy and Sell Stock with Cooldown",
     "difficulty": "Medium",
-    "id": 309,
-    "link": "https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-cooldown/",
-    "title": "Best Time to Buy and Sell Stock with Cooldown"
+    "link": "https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-cooldown/"
   },
   "310": {
+    "id": 310,
     "category": "Graph Traversal",
+    "title": "Minimum Height Trees",
     "difficulty": "Medium",
-    "id": 310,
-    "link": "https://leetcode.com/problems/minimum-height-trees/",
-    "title": "Minimum Height Trees"
+    "link": "https://leetcode.com/problems/minimum-height-trees/"
   },
   "311": {
+    "id": 311,
     "category": "Array & Hashing",
+    "title": "Sparse Matrix Multiplication",
     "difficulty": "Medium",
-    "id": 311,
-    "link": "https://leetcode.com/problems/sparse-matrix-multiplication/",
-    "title": "Sparse Matrix Multiplication"
+    "link": "https://leetcode.com/problems/sparse-matrix-multiplication/"
   },
   "312": {
+    "id": 312,
     "category": "Dynamic Programming",
+    "title": "Burst Balloons",
     "difficulty": "Hard",
-    "id": 312,
-    "link": "https://leetcode.com/problems/burst-balloons/",
-    "title": "Burst Balloons"
+    "link": "https://leetcode.com/problems/burst-balloons/"
   },
   "313": {
+    "id": 313,
     "category": "Dynamic Programming",
+    "title": "Super Ugly Number",
     "difficulty": "Medium",
-    "id": 313,
-    "link": "https://leetcode.com/problems/super-ugly-number/",
-    "title": "Super Ugly Number"
+    "link": "https://leetcode.com/problems/super-ugly-number/"
   },
   "314": {
+    "id": 314,
     "category": "Tree",
+    "title": "Binary Tree Vertical Order Traversal",
     "difficulty": "Medium",
-    "id": 314,
-    "link": "https://leetcode.com/problems/binary-tree-vertical-order-traversal/",
-    "title": "Binary Tree Vertical Order Traversal"
+    "link": "https://leetcode.com/problems/binary-tree-vertical-order-traversal/"
   },
   "315": {
+    "id": 315,
     "category": "Tree",
+    "title": "Count of Smaller Numbers After Self",
     "difficulty": "Hard",
-    "id": 315,
-    "link": "https://leetcode.com/problems/count-of-smaller-numbers-after-self/",
-    "title": "Count of Smaller Numbers After Self"
+    "link": "https://leetcode.com/problems/count-of-smaller-numbers-after-self/"
   },
   "316": {
+    "id": 316,
     "category": "Stack",
+    "title": "Remove Duplicate Letters",
     "difficulty": "Medium",
-    "id": 316,
-    "link": "https://leetcode.com/problems/remove-duplicate-letters/",
-    "title": "Remove Duplicate Letters"
+    "link": "https://leetcode.com/problems/remove-duplicate-letters/"
   },
   "317": {
+    "id": 317,
     "category": "Graph Traversal",
+    "title": "Shortest Distance from All Buildings",
     "difficulty": "Hard",
-    "id": 317,
-    "link": "https://leetcode.com/problems/shortest-distance-from-all-buildings/",
-    "title": "Shortest Distance from All Buildings"
+    "link": "https://leetcode.com/problems/shortest-distance-from-all-buildings/"
   },
   "318": {
+    "id": 318,
     "category": "Bit Manipulation",
+    "title": "Maximum Product of Word Lengths",
     "difficulty": "Medium",
-    "id": 318,
-    "link": "https://leetcode.com/problems/maximum-product-of-word-lengths/",
-    "title": "Maximum Product of Word Lengths"
+    "link": "https://leetcode.com/problems/maximum-product-of-word-lengths/"
   },
   "319": {
+    "id": 319,
     "category": "Math & Geometry",
+    "title": "Bulb Switcher",
     "difficulty": "Medium",
-    "id": 319,
-    "link": "https://leetcode.com/problems/bulb-switcher/",
-    "title": "Bulb Switcher"
+    "link": "https://leetcode.com/problems/bulb-switcher/"
   },
   "320": {
+    "id": 320,
     "category": "Backtracking",
+    "title": "Generalized Abbreviation",
     "difficulty": "Medium",
-    "id": 320,
-    "link": "https://leetcode.com/problems/generalized-abbreviation/",
-    "title": "Generalized Abbreviation"
+    "link": "https://leetcode.com/problems/generalized-abbreviation/"
   },
   "321": {
+    "id": 321,
     "category": "Stack",
+    "title": "Create Maximum Number",
     "difficulty": "Hard",
-    "id": 321,
-    "link": "https://leetcode.com/problems/create-maximum-number/",
-    "title": "Create Maximum Number"
+    "link": "https://leetcode.com/problems/create-maximum-number/"
   },
   "322": {
+    "id": 322,
     "category": "Graph Traversal",
+    "title": "Coin Change",
     "difficulty": "Medium",
-    "id": 322,
-    "link": "https://leetcode.com/problems/coin-change/",
-    "title": "Coin Change"
+    "link": "https://leetcode.com/problems/coin-change/"
   },
   "323": {
+    "id": 323,
     "category": "Graph Traversal",
+    "title": "Number of Connected Components in an Undirected Graph",
     "difficulty": "Medium",
-    "id": 323,
-    "link": "https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph/",
-    "title": "Number of Connected Components in an Undirected Graph"
+    "link": "https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph/"
   },
   "324": {
+    "id": 324,
     "category": "Greedy",
+    "title": "Wiggle Sort II",
     "difficulty": "Medium",
-    "id": 324,
-    "link": "https://leetcode.com/problems/wiggle-sort-ii/",
-    "title": "Wiggle Sort II"
+    "link": "https://leetcode.com/problems/wiggle-sort-ii/"
   },
   "325": {
+    "id": 325,
     "category": "Array & Hashing",
+    "title": "Maximum Size Subarray Sum Equals k",
     "difficulty": "Medium",
-    "id": 325,
-    "link": "https://leetcode.com/problems/maximum-size-subarray-sum-equals-k/",
-    "title": "Maximum Size Subarray Sum Equals k"
+    "link": "https://leetcode.com/problems/maximum-size-subarray-sum-equals-k/"
   },
   "326": {
+    "id": 326,
     "category": "Math & Geometry",
+    "title": "Power of Three",
     "difficulty": "Easy",
-    "id": 326,
-    "link": "https://leetcode.com/problems/power-of-three/",
-    "title": "Power of Three"
+    "link": "https://leetcode.com/problems/power-of-three/"
   },
   "327": {
+    "id": 327,
     "category": "Tree",
+    "title": "Count of Range Sum",
     "difficulty": "Hard",
-    "id": 327,
-    "link": "https://leetcode.com/problems/count-of-range-sum/",
-    "title": "Count of Range Sum"
+    "link": "https://leetcode.com/problems/count-of-range-sum/"
   },
   "328": {
+    "id": 328,
     "category": "Linked List",
+    "title": "Odd Even Linked List",
     "difficulty": "Medium",
-    "id": 328,
-    "link": "https://leetcode.com/problems/odd-even-linked-list/",
-    "title": "Odd Even Linked List"
+    "link": "https://leetcode.com/problems/odd-even-linked-list/"
   },
   "329": {
+    "id": 329,
     "category": "Graph Traversal",
+    "title": "Longest Increasing Path in a Matrix",
     "difficulty": "Hard",
-    "id": 329,
-    "link": "https://leetcode.com/problems/longest-increasing-path-in-a-matrix/",
-    "title": "Longest Increasing Path in a Matrix"
+    "link": "https://leetcode.com/problems/longest-increasing-path-in-a-matrix/"
+  },
+  "330": {
+    "id": 330,
+    "category": "Greedy",
+    "title": "Patching Array",
+    "difficulty": "Hard",
+    "link": "https://leetcode.com/problems/patching-array/"
   },
-  "330": {"category": "Greedy", "difficulty": "Hard", "id": 330, "link": "https://leetcode.com/problems/patching-array/", "title": "Patching Array"},
   "331": {
+    "id": 331,
     "category": "Tree",
+    "title": "Verify Preorder Serialization of a Binary Tree",
     "difficulty": "Medium",
-    "id": 331,
-    "link": "https://leetcode.com/problems/verify-preorder-serialization-of-a-binary-tree/",
-    "title": "Verify Preorder Serialization of a Binary Tree"
+    "link": "https://leetcode.com/problems/verify-preorder-serialization-of-a-binary-tree/"
   },
   "332": {
+    "id": 332,
     "category": "Graph Traversal",
+    "title": "Reconstruct Itinerary",
     "difficulty": "Hard",
-    "id": 332,
-    "link": "https://leetcode.com/problems/reconstruct-itinerary/",
-    "title": "Reconstruct Itinerary"
+    "link": "https://leetcode.com/problems/reconstruct-itinerary/"
   },
   "333": {
+    "id": 333,
     "category": "Tree",
+    "title": "Largest BST Subtree",
     "difficulty": "Medium",
-    "id": 333,
-    "link": "https://leetcode.com/problems/largest-bst-subtree/",
-    "title": "Largest BST Subtree"
+    "link": "https://leetcode.com/problems/largest-bst-subtree/"
   },
   "334": {
+    "id": 334,
     "category": "Greedy",
+    "title": "Increasing Triplet Subsequence",
     "difficulty": "Medium",
-    "id": 334,
-    "link": "https://leetcode.com/problems/increasing-triplet-subsequence/",
-    "title": "Increasing Triplet Subsequence"
+    "link": "https://leetcode.com/problems/increasing-triplet-subsequence/"
   },
   "335": {
+    "id": 335,
     "category": "Math & Geometry",
+    "title": "Self Crossing",
     "difficulty": "Hard",
-    "id": 335,
-    "link": "https://leetcode.com/problems/self-crossing/",
-    "title": "Self Crossing"
+    "link": "https://leetcode.com/problems/self-crossing/"
   },
   "336": {
+    "id": 336,
     "category": "Trie",
+    "title": "Palindrome Pairs",
     "difficulty": "Hard",
-    "id": 336,
-    "link": "https://leetcode.com/problems/palindrome-pairs/",
-    "title": "Palindrome Pairs"
+    "link": "https://leetcode.com/problems/palindrome-pairs/"
   },
   "337": {
+    "id": 337,
     "category": "Tree",
+    "title": "House Robber III",
     "difficulty": "Medium",
-    "id": 337,
-    "link": "https://leetcode.com/problems/house-robber-iii/",
-    "title": "House Robber III"
+    "link": "https://leetcode.com/problems/house-robber-iii/"
   },
   "338": {
+    "id": 338,
     "category": "Dynamic Programming",
+    "title": "Counting Bits",
     "difficulty": "Easy",
-    "id": 338,
-    "link": "https://leetcode.com/problems/counting-bits/",
-    "title": "Counting Bits"
+    "link": "https://leetcode.com/problems/counting-bits/"
   },
   "339": {
+    "id": 339,
     "category": "Graph Traversal",
+    "title": "Nested List Weight Sum",
     "difficulty": "Medium",
-    "id": 339,
-    "link": "https://leetcode.com/problems/nested-list-weight-sum/",
-    "title": "Nested List Weight Sum"
+    "link": "https://leetcode.com/problems/nested-list-weight-sum/"
   },
   "340": {
+    "id": 340,
     "category": "Sliding Window",
+    "title": "Longest Substring with At Most K Distinct Characters",
     "difficulty": "Medium",
-    "id": 340,
-    "link": "https://leetcode.com/problems/longest-substring-with-at-most-k-distinct-characters/",
-    "title": "Longest Substring with At Most K Distinct Characters"
+    "link": "https://leetcode.com/problems/longest-substring-with-at-most-k-distinct-characters/"
   },
   "341": {
+    "id": 341,
     "category": "Tree",
+    "title": "Flatten Nested List Iterator",
     "difficulty": "Medium",
-    "id": 341,
-    "link": "https://leetcode.com/problems/flatten-nested-list-iterator/",
-    "title": "Flatten Nested List Iterator"
+    "link": "https://leetcode.com/problems/flatten-nested-list-iterator/"
   },
   "342": {
+    "id": 342,
     "category": "Bit Manipulation",
+    "title": "Power of Four",
     "difficulty": "Easy",
-    "id": 342,
-    "link": "https://leetcode.com/problems/power-of-four/",
-    "title": "Power of Four"
+    "link": "https://leetcode.com/problems/power-of-four/"
   },
   "343": {
+    "id": 343,
     "category": "Dynamic Programming",
+    "title": "Integer Break",
     "difficulty": "Medium",
-    "id": 343,
-    "link": "https://leetcode.com/problems/integer-break/",
-    "title": "Integer Break"
+    "link": "https://leetcode.com/problems/integer-break/"
   },
   "344": {
+    "id": 344,
     "category": "Two Pointers",
+    "title": "Reverse String",
     "difficulty": "Easy",
-    "id": 344,
-    "link": "https://leetcode.com/problems/reverse-string/",
-    "title": "Reverse String"
+    "link": "https://leetcode.com/problems/reverse-string/"
   },
   "345": {
+    "id": 345,
     "category": "Two Pointers",
+    "title": "Reverse Vowels of a String",
     "difficulty": "Easy",
-    "id": 345,
-    "link": "https://leetcode.com/problems/reverse-vowels-of-a-string/",
-    "title": "Reverse Vowels of a String"
+    "link": "https://leetcode.com/problems/reverse-vowels-of-a-string/"
   },
   "346": {
+    "id": 346,
     "category": "Array & Hashing",
+    "title": "Moving Average from Data Stream",
     "difficulty": "Easy",
-    "id": 346,
-    "link": "https://leetcode.com/problems/moving-average-from-data-stream/",
-    "title": "Moving Average from Data Stream"
+    "link": "https://leetcode.com/problems/moving-average-from-data-stream/"
   },
   "347": {
+    "id": 347,
     "category": "Heap (Priority Queue)",
+    "title": "Top K Frequent Elements",
     "difficulty": "Medium",
-    "id": 347,
-    "link": "https://leetcode.com/problems/top-k-frequent-elements/",
-    "title": "Top K Frequent Elements"
+    "link": "https://leetcode.com/problems/top-k-frequent-elements/"
   },
   "348": {
+    "id": 348,
     "category": "Array & Hashing",
+    "title": "Design Tic-Tac-Toe",
     "difficulty": "Medium",
-    "id": 348,
-    "link": "https://leetcode.com/problems/design-tic-tac-toe/",
-    "title": "Design Tic-Tac-Toe"
+    "link": "https://leetcode.com/problems/design-tic-tac-toe/"
   },
   "349": {
+    "id": 349,
     "category": "Binary Search",
+    "title": "Intersection of Two Arrays",
     "difficulty": "Easy",
-    "id": 349,
-    "link": "https://leetcode.com/problems/intersection-of-two-arrays/",
-    "title": "Intersection of Two Arrays"
+    "link": "https://leetcode.com/problems/intersection-of-two-arrays/"
   },
   "350": {
+    "id": 350,
     "category": "Binary Search",
+    "title": "Intersection of Two Arrays II",
     "difficulty": "Easy",
-    "id": 350,
-    "link": "https://leetcode.com/problems/intersection-of-two-arrays-ii/",
-    "title": "Intersection of Two Arrays II"
+    "link": "https://leetcode.com/problems/intersection-of-two-arrays-ii/"
   },
   "351": {
+    "id": 351,
     "category": "Dynamic Programming",
+    "title": "Android Unlock Patterns",
     "difficulty": "Medium",
-    "id": 351,
-    "link": "https://leetcode.com/problems/android-unlock-patterns/",
-    "title": "Android Unlock Patterns"
+    "link": "https://leetcode.com/problems/android-unlock-patterns/"
   },
   "352": {
+    "id": 352,
     "category": "Graph Traversal",
+    "title": "Data Stream as Disjoint Intervals",
     "difficulty": "Hard",
-    "id": 352,
-    "link": "https://leetcode.com/problems/data-stream-as-disjoint-intervals/",
-    "title": "Data Stream as Disjoint Intervals"
+    "link": "https://leetcode.com/problems/data-stream-as-disjoint-intervals/"
   },
   "353": {
+    "id": 353,
     "category": "Array & Hashing",
+    "title": "Design Snake Game",
     "difficulty": "Medium",
-    "id": 353,
-    "link": "https://leetcode.com/problems/design-snake-game/",
-    "title": "Design Snake Game"
+    "link": "https://leetcode.com/problems/design-snake-game/"
   },
   "354": {
+    "id": 354,
     "category": "Dynamic Programming",
+    "title": "Russian Doll Envelopes",
     "difficulty": "Hard",
-    "id": 354,
-    "link": "https://leetcode.com/problems/russian-doll-envelopes/",
-    "title": "Russian Doll Envelopes"
+    "link": "https://leetcode.com/problems/russian-doll-envelopes/"
   },
   "355": {
+    "id": 355,
     "category": "Heap (Priority Queue)",
+    "title": "Design Twitter",
     "difficulty": "Medium",
-    "id": 355,
-    "link": "https://leetcode.com/problems/design-twitter/",
-    "title": "Design Twitter"
+    "link": "https://leetcode.com/problems/design-twitter/"
   },
   "356": {
+    "id": 356,
     "category": "Math & Geometry",
+    "title": "Line Reflection",
     "difficulty": "Medium",
-    "id": 356,
-    "link": "https://leetcode.com/problems/line-reflection/",
-    "title": "Line Reflection"
+    "link": "https://leetcode.com/problems/line-reflection/"
   },
   "357": {
+    "id": 357,
     "category": "Dynamic Programming",
+    "title": "Count Numbers with Unique Digits",
     "difficulty": "Medium",
-    "id": 357,
-    "link": "https://leetcode.com/problems/count-numbers-with-unique-digits/",
-    "title": "Count Numbers with Unique Digits"
+    "link": "https://leetcode.com/problems/count-numbers-with-unique-digits/"
   },
   "358": {
+    "id": 358,
     "category": "Heap (Priority Queue)",
+    "title": "Rearrange String k Distance Apart",
     "difficulty": "Hard",
-    "id": 358,
-    "link": "https://leetcode.com/problems/rearrange-string-k-distance-apart/",
-    "title": "Rearrange String k Distance Apart"
+    "link": "https://leetcode.com/problems/rearrange-string-k-distance-apart/"
   },
   "359": {
+    "id": 359,
     "category": "Array & Hashing",
+    "title": "Logger Rate Limiter",
     "difficulty": "Easy",
-    "id": 359,
-    "link": "https://leetcode.com/problems/logger-rate-limiter/",
-    "title": "Logger Rate Limiter"
+    "link": "https://leetcode.com/problems/logger-rate-limiter/"
   },
   "360": {
+    "id": 360,
     "category": "Math & Geometry",
+    "title": "Sort Transformed Array",
     "difficulty": "Medium",
-    "id": 360,
-    "link": "https://leetcode.com/problems/sort-transformed-array/",
-    "title": "Sort Transformed Array"
+    "link": "https://leetcode.com/problems/sort-transformed-array/"
   },
   "361": {
+    "id": 361,
     "category": "Dynamic Programming",
+    "title": "Bomb Enemy",
     "difficulty": "Medium",
-    "id": 361,
-    "link": "https://leetcode.com/problems/bomb-enemy/",
-    "title": "Bomb Enemy"
+    "link": "https://leetcode.com/problems/bomb-enemy/"
   },
   "362": {
+    "id": 362,
     "category": "Binary Search",
+    "title": "Design Hit Counter",
     "difficulty": "Medium",
-    "id": 362,
-    "link": "https://leetcode.com/problems/design-hit-counter/",
-    "title": "Design Hit Counter"
+    "link": "https://leetcode.com/problems/design-hit-counter/"
   },
   "363": {
+    "id": 363,
     "category": "Binary Search",
+    "title": "Max Sum of Rectangle No Larger Than K",
     "difficulty": "Hard",
-    "id": 363,
-    "link": "https://leetcode.com/problems/max-sum-of-rectangle-no-larger-than-k/",
-    "title": "Max Sum of Rectangle No Larger Than K"
+    "link": "https://leetcode.com/problems/max-sum-of-rectangle-no-larger-than-k/"
   },
   "364": {
+    "id": 364,
     "category": "Graph Traversal",
+    "title": "Nested List Weight Sum II",
     "difficulty": "Medium",
-    "id": 364,
-    "link": "https://leetcode.com/problems/nested-list-weight-sum-ii/",
-    "title": "Nested List Weight Sum II"
+    "link": "https://leetcode.com/problems/nested-list-weight-sum-ii/"
   },
   "365": {
+    "id": 365,
     "category": "Graph Traversal",
+    "title": "Water and Jug Problem",
     "difficulty": "Medium",
-    "id": 365,
-    "link": "https://leetcode.com/problems/water-and-jug-problem/",
-    "title": "Water and Jug Problem"
+    "link": "https://leetcode.com/problems/water-and-jug-problem/"
   },
   "366": {
+    "id": 366,
     "category": "Tree",
+    "title": "Find Leaves of Binary Tree",
     "difficulty": "Medium",
-    "id": 366,
-    "link": "https://leetcode.com/problems/find-leaves-of-binary-tree/",
-    "title": "Find Leaves of Binary Tree"
+    "link": "https://leetcode.com/problems/find-leaves-of-binary-tree/"
   },
   "367": {
+    "id": 367,
     "category": "Binary Search",
+    "title": "Valid Perfect Square",
     "difficulty": "Easy",
-    "id": 367,
-    "link": "https://leetcode.com/problems/valid-perfect-square/",
-    "title": "Valid Perfect Square"
+    "link": "https://leetcode.com/problems/valid-perfect-square/"
   },
   "368": {
+    "id": 368,
     "category": "Dynamic Programming",
+    "title": "Largest Divisible Subset",
     "difficulty": "Medium",
-    "id": 368,
-    "link": "https://leetcode.com/problems/largest-divisible-subset/",
-    "title": "Largest Divisible Subset"
+    "link": "https://leetcode.com/problems/largest-divisible-subset/"
   },
   "369": {
+    "id": 369,
     "category": "Linked List",
+    "title": "Plus One Linked List",
     "difficulty": "Medium",
-    "id": 369,
-    "link": "https://leetcode.com/problems/plus-one-linked-list/",
-    "title": "Plus One Linked List"
+    "link": "https://leetcode.com/problems/plus-one-linked-list/"
   },
   "370": {
+    "id": 370,
     "category": "Array & Hashing",
+    "title": "Range Addition",
     "difficulty": "Medium",
-    "id": 370,
-    "link": "https://leetcode.com/problems/range-addition/",
-    "title": "Range Addition"
+    "link": "https://leetcode.com/problems/range-addition/"
   },
   "371": {
+    "id": 371,
     "category": "Bit Manipulation",
+    "title": "Sum of Two Integers",
     "difficulty": "Medium",
-    "id": 371,
-    "link": "https://leetcode.com/problems/sum-of-two-integers/",
-    "title": "Sum of Two Integers"
+    "link": "https://leetcode.com/problems/sum-of-two-integers/"
+  },
+  "372": {
+    "id": 372,
+    "category": "Math & Geometry",
+    "title": "Super Pow",
+    "difficulty": "Medium",
+    "link": "https://leetcode.com/problems/super-pow/"
   },
-  "372": {"category": "Math & Geometry", "difficulty": "Medium", "id": 372, "link": "https://leetcode.com/problems/super-pow/", "title": "Super Pow"},
   "373": {
+    "id": 373,
     "category": "Heap (Priority Queue)",
+    "title": "Find K Pairs with Smallest Sums",
     "difficulty": "Medium",
-    "id": 373,
-    "link": "https://leetcode.com/problems/find-k-pairs-with-smallest-sums/",
-    "title": "Find K Pairs with Smallest Sums"
+    "link": "https://leetcode.com/problems/find-k-pairs-with-smallest-sums/"
   },
   "374": {
+    "id": 374,
     "category": "Binary Search",
+    "title": "Guess Number Higher or Lower",
     "difficulty": "Easy",
-    "id": 374,
-    "link": "https://leetcode.com/problems/guess-number-higher-or-lower/",
-    "title": "Guess Number Higher or Lower"
+    "link": "https://leetcode.com/problems/guess-number-higher-or-lower/"
   },
   "375": {
+    "id": 375,
     "category": "Dynamic Programming",
+    "title": "Guess Number Higher or Lower II",
     "difficulty": "Medium",
-    "id": 375,
-    "link": "https://leetcode.com/problems/guess-number-higher-or-lower-ii/",
-    "title": "Guess Number Higher or Lower II"
+    "link": "https://leetcode.com/problems/guess-number-higher-or-lower-ii/"
   },
   "376": {
+    "id": 376,
     "category": "Dynamic Programming",
+    "title": "Wiggle Subsequence",
     "difficulty": "Medium",
-    "id": 376,
-    "link": "https://leetcode.com/problems/wiggle-subsequence/",
-    "title": "Wiggle Subsequence"
+    "link": "https://leetcode.com/problems/wiggle-subsequence/"
   },
   "377": {
+    "id": 377,
     "category": "Dynamic Programming",
+    "title": "Combination Sum IV",
     "difficulty": "Medium",
-    "id": 377,
-    "link": "https://leetcode.com/problems/combination-sum-iv/",
-    "title": "Combination Sum IV"
+    "link": "https://leetcode.com/problems/combination-sum-iv/"
   },
   "378": {
+    "id": 378,
     "category": "Binary Search",
+    "title": "Kth Smallest Element in a Sorted Matrix",
     "difficulty": "Medium",
-    "id": 378,
-    "link": "https://leetcode.com/problems/kth-smallest-element-in-a-sorted-matrix/",
-    "title": "Kth Smallest Element in a Sorted Matrix"
+    "link": "https://leetcode.com/problems/kth-smallest-element-in-a-sorted-matrix/"
   },
   "379": {
+    "id": 379,
     "category": "Linked List",
+    "title": "Design Phone Directory",
     "difficulty": "Medium",
-    "id": 379,
-    "link": "https://leetcode.com/problems/design-phone-directory/",
-    "title": "Design Phone Directory"
+    "link": "https://leetcode.com/problems/design-phone-directory/"
   },
   "380": {
+    "id": 380,
     "category": "Math & Geometry",
+    "title": "Insert Delete GetRandom O(1)",
     "difficulty": "Medium",
-    "id": 380,
-    "link": "https://leetcode.com/problems/insert-delete-getrandom-o1/",
-    "title": "Insert Delete GetRandom O(1)"
+    "link": "https://leetcode.com/problems/insert-delete-getrandom-o1/"
   },
   "381": {
+    "id": 381,
     "category": "Math & Geometry",
+    "title": "Insert Delete GetRandom O(1) - Duplicates allowed",
     "difficulty": "Hard",
-    "id": 381,
-    "link": "https://leetcode.com/problems/insert-delete-getrandom-o1-duplicates-allowed/",
-    "title": "Insert Delete GetRandom O(1) - Duplicates allowed"
+    "link": "https://leetcode.com/problems/insert-delete-getrandom-o1-duplicates-allowed/"
   },
   "382": {
+    "id": 382,
     "category": "Linked List",
+    "title": "Linked List Random Node",
     "difficulty": "Medium",
-    "id": 382,
-    "link": "https://leetcode.com/problems/linked-list-random-node/",
-    "title": "Linked List Random Node"
+    "link": "https://leetcode.com/problems/linked-list-random-node/"
   },
   "383": {
+    "id": 383,
     "category": "Array & Hashing",
+    "title": "Ransom Note",
     "difficulty": "Easy",
-    "id": 383,
-    "link": "https://leetcode.com/problems/ransom-note/",
-    "title": "Ransom Note"
+    "link": "https://leetcode.com/problems/ransom-note/"
   },
   "384": {
+    "id": 384,
     "category": "Math & Geometry",
+    "title": "Shuffle an Array",
     "difficulty": "Medium",
-    "id": 384,
-    "link": "https://leetcode.com/problems/shuffle-an-array/",
-    "title": "Shuffle an Array"
+    "link": "https://leetcode.com/problems/shuffle-an-array/"
   },
   "385": {
+    "id": 385,
     "category": "Graph Traversal",
+    "title": "Mini Parser",
     "difficulty": "Medium",
-    "id": 385,
-    "link": "https://leetcode.com/problems/mini-parser/",
-    "title": "Mini Parser"
+    "link": "https://leetcode.com/problems/mini-parser/"
   },
   "386": {
+    "id": 386,
     "category": "Graph Traversal",
+    "title": "Lexicographical Numbers",
     "difficulty": "Medium",
-    "id": 386,
-    "link": "https://leetcode.com/problems/lexicographical-numbers/",
-    "title": "Lexicographical Numbers"
+    "link": "https://leetcode.com/problems/lexicographical-numbers/"
   },
   "387": {
+    "id": 387,
     "category": "Array & Hashing",
+    "title": "First Unique Character in a String",
     "difficulty": "Easy",
-    "id": 387,
-    "link": "https://leetcode.com/problems/first-unique-character-in-a-string/",
-    "title": "First Unique Character in a String"
+    "link": "https://leetcode.com/problems/first-unique-character-in-a-string/"
   },
   "388": {
+    "id": 388,
     "category": "Graph Traversal",
+    "title": "Longest Absolute File Path",
     "difficulty": "Medium",
-    "id": 388,
-    "link": "https://leetcode.com/problems/longest-absolute-file-path/",
-    "title": "Longest Absolute File Path"
+    "link": "https://leetcode.com/problems/longest-absolute-file-path/"
   },
   "389": {
+    "id": 389,
     "category": "Bit Manipulation",
+    "title": "Find the Difference",
     "difficulty": "Easy",
-    "id": 389,
-    "link": "https://leetcode.com/problems/find-the-difference/",
-    "title": "Find the Difference"
+    "link": "https://leetcode.com/problems/find-the-difference/"
   },
   "390": {
+    "id": 390,
     "category": "Math & Geometry",
+    "title": "Elimination Game",
     "difficulty": "Medium",
-    "id": 390,
-    "link": "https://leetcode.com/problems/elimination-game/",
-    "title": "Elimination Game"
+    "link": "https://leetcode.com/problems/elimination-game/"
   },
   "391": {
+    "id": 391,
     "category": "Math & Geometry",
+    "title": "Perfect Rectangle",
     "difficulty": "Hard",
-    "id": 391,
-    "link": "https://leetcode.com/problems/perfect-rectangle/",
-    "title": "Perfect Rectangle"
+    "link": "https://leetcode.com/problems/perfect-rectangle/"
   },
   "392": {
+    "id": 392,
     "category": "Dynamic Programming",
+    "title": "Is Subsequence",
     "difficulty": "Easy",
-    "id": 392,
-    "link": "https://leetcode.com/problems/is-subsequence/",
-    "title": "Is Subsequence"
+    "link": "https://leetcode.com/problems/is-subsequence/"
   },
   "393": {
+    "id": 393,
     "category": "Bit Manipulation",
+    "title": "UTF-8 Validation",
     "difficulty": "Medium",
-    "id": 393,
-    "link": "https://leetcode.com/problems/utf-8-validation/",
-    "title": "UTF-8 Validation"
+    "link": "https://leetcode.com/problems/utf-8-validation/"
+  },
+  "394": {
+    "id": 394,
+    "category": "Stack",
+    "title": "Decode String",
+    "difficulty": "Medium",
+    "link": "https://leetcode.com/problems/decode-string/"
   },
-  "394": {"category": "Stack", "difficulty": "Medium", "id": 394, "link": "https://leetcode.com/problems/decode-string/", "title": "Decode String"},
   "395": {
+    "id": 395,
     "category": "Sliding Window",
+    "title": "Longest Substring with At Least K Repeating Characters",
     "difficulty": "Medium",
-    "id": 395,
-    "link": "https://leetcode.com/problems/longest-substring-with-at-least-k-repeating-characters/",
-    "title": "Longest Substring with At Least K Repeating Characters"
+    "link": "https://leetcode.com/problems/longest-substring-with-at-least-k-repeating-characters/"
   },
   "396": {
+    "id": 396,
     "category": "Dynamic Programming",
+    "title": "Rotate Function",
     "difficulty": "Medium",
-    "id": 396,
-    "link": "https://leetcode.com/problems/rotate-function/",
-    "title": "Rotate Function"
+    "link": "https://leetcode.com/problems/rotate-function/"
   },
   "397": {
+    "id": 397,
     "category": "Dynamic Programming",
+    "title": "Integer Replacement",
     "difficulty": "Medium",
-    "id": 397,
-    "link": "https://leetcode.com/problems/integer-replacement/",
-    "title": "Integer Replacement"
+    "link": "https://leetcode.com/problems/integer-replacement/"
   },
   "398": {
+    "id": 398,
     "category": "Math & Geometry",
+    "title": "Random Pick Index",
     "difficulty": "Medium",
-    "id": 398,
-    "link": "https://leetcode.com/problems/random-pick-index/",
-    "title": "Random Pick Index"
+    "link": "https://leetcode.com/problems/random-pick-index/"
   },
   "399": {
+    "id": 399,
     "category": "Graph Traversal",
+    "title": "Evaluate Division",
     "difficulty": "Medium",
-    "id": 399,
-    "link": "https://leetcode.com/problems/evaluate-division/",
-    "title": "Evaluate Division"
+    "link": "https://leetcode.com/problems/evaluate-division/"
+  },
+  "400": {
+    "id": 400,
+    "category": "Binary Search",
+    "title": "Nth Digit",
+    "difficulty": "Medium",
+    "link": "https://leetcode.com/problems/nth-digit/"
   },
-  "400": {"category": "Binary Search", "difficulty": "Medium", "id": 400, "link": "https://leetcode.com/problems/nth-digit/", "title": "Nth Digit"},
   "401": {
+    "id": 401,
     "category": "Backtracking",
+    "title": "Binary Watch",
     "difficulty": "Easy",
-    "id": 401,
-    "link": "https://leetcode.com/problems/binary-watch/",
-    "title": "Binary Watch"
+    "link": "https://leetcode.com/problems/binary-watch/"
   },
   "402": {
+    "id": 402,
     "category": "Stack",
+    "title": "Remove K Digits",
     "difficulty": "Medium",
-    "id": 402,
-    "link": "https://leetcode.com/problems/remove-k-digits/",
-    "title": "Remove K Digits"
+    "link": "https://leetcode.com/problems/remove-k-digits/"
   },
   "403": {
+    "id": 403,
     "category": "Dynamic Programming",
+    "title": "Frog Jump",
     "difficulty": "Hard",
-    "id": 403,
-    "link": "https://leetcode.com/problems/frog-jump/",
-    "title": "Frog Jump"
+    "link": "https://leetcode.com/problems/frog-jump/"
   },
   "404": {
+    "id": 404,
     "category": "Tree",
+    "title": "Sum of Left Leaves",
     "difficulty": "Easy",
-    "id": 404,
-    "link": "https://leetcode.com/problems/sum-of-left-leaves/",
-    "title": "Sum of Left Leaves"
+    "link": "https://leetcode.com/problems/sum-of-left-leaves/"
   },
   "405": {
+    "id": 405,
     "category": "Bit Manipulation",
+    "title": "Convert a Number to Hexadecimal",
     "difficulty": "Easy",
-    "id": 405,
-    "link": "https://leetcode.com/problems/convert-a-number-to-hexadecimal/",
-    "title": "Convert a Number to Hexadecimal"
+    "link": "https://leetcode.com/problems/convert-a-number-to-hexadecimal/"
   },
   "406": {
+    "id": 406,
     "category": "Tree",
+    "title": "Queue Reconstruction by Height",
     "difficulty": "Medium",
-    "id": 406,
-    "link": "https://leetcode.com/problems/queue-reconstruction-by-height/",
-    "title": "Queue Reconstruction by Height"
+    "link": "https://leetcode.com/problems/queue-reconstruction-by-height/"
   },
   "407": {
+    "id": 407,
     "category": "Graph Traversal",
+    "title": "Trapping Rain Water II",
     "difficulty": "Hard",
-    "id": 407,
-    "link": "https://leetcode.com/problems/trapping-rain-water-ii/",
-    "title": "Trapping Rain Water II"
+    "link": "https://leetcode.com/problems/trapping-rain-water-ii/"
   },
   "408": {
+    "id": 408,
     "category": "Two Pointers",
+    "title": "Valid Word Abbreviation",
     "difficulty": "Easy",
-    "id": 408,
-    "link": "https://leetcode.com/problems/valid-word-abbreviation/",
-    "title": "Valid Word Abbreviation"
+    "link": "https://leetcode.com/problems/valid-word-abbreviation/"
   },
   "409": {
+    "id": 409,
     "category": "Greedy",
+    "title": "Longest Palindrome",
     "difficulty": "Easy",
-    "id": 409,
-    "link": "https://leetcode.com/problems/longest-palindrome/",
-    "title": "Longest Palindrome"
+    "link": "https://leetcode.com/problems/longest-palindrome/"
   },
   "410": {
+    "id": 410,
     "category": "Dynamic Programming",
+    "title": "Split Array Largest Sum",
     "difficulty": "Hard",
-    "id": 410,
-    "link": "https://leetcode.com/problems/split-array-largest-sum/",
-    "title": "Split Array Largest Sum"
+    "link": "https://leetcode.com/problems/split-array-largest-sum/"
   },
   "411": {
+    "id": 411,
     "category": "Backtracking",
+    "title": "Minimum Unique Word Abbreviation",
     "difficulty": "Hard",
-    "id": 411,
-    "link": "https://leetcode.com/problems/minimum-unique-word-abbreviation/",
-    "title": "Minimum Unique Word Abbreviation"
+    "link": "https://leetcode.com/problems/minimum-unique-word-abbreviation/"
+  },
+  "412": {
+    "id": 412,
+    "category": "Math & Geometry",
+    "title": "Fizz Buzz",
+    "difficulty": "Easy",
+    "link": "https://leetcode.com/problems/fizz-buzz/"
   },
-  "412": {"category": "Math & Geometry", "difficulty": "Easy", "id": 412, "link": "https://leetcode.com/problems/fizz-buzz/", "title": "Fizz Buzz"},
   "413": {
+    "id": 413,
     "category": "Dynamic Programming",
+    "title": "Arithmetic Slices",
     "difficulty": "Medium",
-    "id": 413,
-    "link": "https://leetcode.com/problems/arithmetic-slices/",
-    "title": "Arithmetic Slices"
+    "link": "https://leetcode.com/problems/arithmetic-slices/"
   },
   "414": {
+    "id": 414,
     "category": "Array & Hashing",
+    "title": "Third Maximum Number",
     "difficulty": "Easy",
-    "id": 414,
-    "link": "https://leetcode.com/problems/third-maximum-number/",
-    "title": "Third Maximum Number"
+    "link": "https://leetcode.com/problems/third-maximum-number/"
   },
   "415": {
+    "id": 415,
     "category": "Math & Geometry",
+    "title": "Add Strings",
     "difficulty": "Easy",
-    "id": 415,
-    "link": "https://leetcode.com/problems/add-strings/",
-    "title": "Add Strings"
+    "link": "https://leetcode.com/problems/add-strings/"
   },
   "416": {
+    "id": 416,
     "category": "Dynamic Programming",
+    "title": "Partition Equal Subset Sum",
     "difficulty": "Medium",
-    "id": 416,
-    "link": "https://leetcode.com/problems/partition-equal-subset-sum/",
-    "title": "Partition Equal Subset Sum"
+    "link": "https://leetcode.com/problems/partition-equal-subset-sum/"
   },
   "417": {
+    "id": 417,
     "category": "Graph Traversal",
+    "title": "Pacific Atlantic Water Flow",
     "difficulty": "Medium",
-    "id": 417,
-    "link": "https://leetcode.com/problems/pacific-atlantic-water-flow/",
-    "title": "Pacific Atlantic Water Flow"
+    "link": "https://leetcode.com/problems/pacific-atlantic-water-flow/"
   },
   "418": {
+    "id": 418,
     "category": "Dynamic Programming",
+    "title": "Sentence Screen Fitting",
     "difficulty": "Medium",
-    "id": 418,
-    "link": "https://leetcode.com/problems/sentence-screen-fitting/",
-    "title": "Sentence Screen Fitting"
+    "link": "https://leetcode.com/problems/sentence-screen-fitting/"
   },
   "419": {
+    "id": 419,
     "category": "Graph Traversal",
+    "title": "Battleships in a Board",
     "difficulty": "Medium",
-    "id": 419,
-    "link": "https://leetcode.com/problems/battleships-in-a-board/",
-    "title": "Battleships in a Board"
+    "link": "https://leetcode.com/problems/battleships-in-a-board/"
   },
   "420": {
+    "id": 420,
     "category": "Heap (Priority Queue)",
+    "title": "Strong Password Checker",
     "difficulty": "Hard",
-    "id": 420,
-    "link": "https://leetcode.com/problems/strong-password-checker/",
-    "title": "Strong Password Checker"
+    "link": "https://leetcode.com/problems/strong-password-checker/"
   },
   "421": {
+    "id": 421,
     "category": "Trie",
+    "title": "Maximum XOR of Two Numbers in an Array",
     "difficulty": "Medium",
-    "id": 421,
-    "link": "https://leetcode.com/problems/maximum-xor-of-two-numbers-in-an-array/",
-    "title": "Maximum XOR of Two Numbers in an Array"
+    "link": "https://leetcode.com/problems/maximum-xor-of-two-numbers-in-an-array/"
   },
   "422": {
+    "id": 422,
     "category": "Array & Hashing",
+    "title": "Valid Word Square",
     "difficulty": "Easy",
-    "id": 422,
-    "link": "https://leetcode.com/problems/valid-word-square/",
-    "title": "Valid Word Square"
+    "link": "https://leetcode.com/problems/valid-word-square/"
   },
   "423": {
+    "id": 423,
     "category": "Math & Geometry",
+    "title": "Reconstruct Original Digits from English",
     "difficulty": "Medium",
-    "id": 423,
-    "link": "https://leetcode.com/problems/reconstruct-original-digits-from-english/",
-    "title": "Reconstruct Original Digits from English"
+    "link": "https://leetcode.com/problems/reconstruct-original-digits-from-english/"
   },
   "424": {
+    "id": 424,
     "category": "Sliding Window",
+    "title": "Longest Repeating Character Replacement",
     "difficulty": "Medium",
-    "id": 424,
-    "link": "https://leetcode.com/problems/longest-repeating-character-replacement/",
-    "title": "Longest Repeating Character Replacement"
+    "link": "https://leetcode.com/problems/longest-repeating-character-replacement/"
   },
   "425": {
+    "id": 425,
     "category": "Backtracking",
+    "title": "Word Squares",
     "difficulty": "Hard",
-    "id": 425,
-    "link": "https://leetcode.com/problems/word-squares/",
-    "title": "Word Squares"
+    "link": "https://leetcode.com/problems/word-squares/"
   },
   "426": {
+    "id": 426,
     "category": "Tree",
+    "title": "Convert Binary Search Tree to Sorted Doubly Linked List",
     "difficulty": "Medium",
-    "id": 426,
-    "link": "https://leetcode.com/problems/convert-binary-search-tree-to-sorted-doubly-linked-list/",
-    "title": "Convert Binary Search Tree to Sorted Doubly Linked List"
+    "link": "https://leetcode.com/problems/convert-binary-search-tree-to-sorted-doubly-linked-list/"
   },
   "427": {
+    "id": 427,
     "category": "Tree",
+    "title": "Construct Quad Tree",
     "difficulty": "Medium",
-    "id": 427,
-    "link": "https://leetcode.com/problems/construct-quad-tree/",
-    "title": "Construct Quad Tree"
+    "link": "https://leetcode.com/problems/construct-quad-tree/"
   },
   "428": {
+    "id": 428,
     "category": "Tree",
+    "title": "Serialize and Deserialize N-ary Tree",
     "difficulty": "Hard",
-    "id": 428,
-    "link": "https://leetcode.com/problems/serialize-and-deserialize-n-ary-tree/",
-    "title": "Serialize and Deserialize N-ary Tree"
+    "link": "https://leetcode.com/problems/serialize-and-deserialize-n-ary-tree/"
   },
   "429": {
+    "id": 429,
     "category": "Tree",
+    "title": "N-ary Tree Level Order Traversal",
     "difficulty": "Medium",
-    "id": 429,
-    "link": "https://leetcode.com/problems/n-ary-tree-level-order-traversal/",
-    "title": "N-ary Tree Level Order Traversal"
+    "link": "https://leetcode.com/problems/n-ary-tree-level-order-traversal/"
   },
   "430": {
+    "id": 430,
     "category": "Graph Traversal",
+    "title": "Flatten a Multilevel Doubly Linked List",
     "difficulty": "Medium",
-    "id": 430,
-    "link": "https://leetcode.com/problems/flatten-a-multilevel-doubly-linked-list/",
-    "title": "Flatten a Multilevel Doubly Linked List"
+    "link": "https://leetcode.com/problems/flatten-a-multilevel-doubly-linked-list/"
   },
   "431": {
+    "id": 431,
     "category": "Tree",
+    "title": "Encode N-ary Tree to Binary Tree",
     "difficulty": "Hard",
-    "id": 431,
-    "link": "https://leetcode.com/problems/encode-n-ary-tree-to-binary-tree/",
-    "title": "Encode N-ary Tree to Binary Tree"
+    "link": "https://leetcode.com/problems/encode-n-ary-tree-to-binary-tree/"
   },
   "432": {
+    "id": 432,
     "category": "Linked List",
+    "title": "All O`one Data Structure",
     "difficulty": "Hard",
-    "id": 432,
-    "link": "https://leetcode.com/problems/all-oone-data-structure/",
-    "title": "All O`one Data Structure"
+    "link": "https://leetcode.com/problems/all-oone-data-structure/"
   },
   "433": {
+    "id": 433,
     "category": "Graph Traversal",
+    "title": "Minimum Genetic Mutation",
     "difficulty": "Medium",
-    "id": 433,
-    "link": "https://leetcode.com/problems/minimum-genetic-mutation/",
-    "title": "Minimum Genetic Mutation"
+    "link": "https://leetcode.com/problems/minimum-genetic-mutation/"
   },
   "434": {
+    "id": 434,
     "category": "Array & Hashing",
+    "title": "Number of Segments in a String",
     "difficulty": "Easy",
-    "id": 434,
-    "link": "https://leetcode.com/problems/number-of-segments-in-a-string/",
-    "title": "Number of Segments in a String"
+    "link": "https://leetcode.com/problems/number-of-segments-in-a-string/"
   },
   "435": {
+    "id": 435,
     "category": "Dynamic Programming",
+    "title": "Non-overlapping Intervals",
     "difficulty": "Medium",
-    "id": 435,
-    "link": "https://leetcode.com/problems/non-overlapping-intervals/",
-    "title": "Non-overlapping Intervals"
+    "link": "https://leetcode.com/problems/non-overlapping-intervals/"
   },
   "436": {
+    "id": 436,
     "category": "Binary Search",
+    "title": "Find Right Interval",
     "difficulty": "Medium",
-    "id": 436,
-    "link": "https://leetcode.com/problems/find-right-interval/",
-    "title": "Find Right Interval"
+    "link": "https://leetcode.com/problems/find-right-interval/"
+  },
+  "437": {
+    "id": 437,
+    "category": "Tree",
+    "title": "Path Sum III",
+    "difficulty": "Medium",
+    "link": "https://leetcode.com/problems/path-sum-iii/"
   },
-  "437": {"category": "Tree", "difficulty": "Medium", "id": 437, "link": "https://leetcode.com/problems/path-sum-iii/", "title": "Path Sum III"},
   "438": {
+    "id": 438,
     "category": "Sliding Window",
+    "title": "Find All Anagrams in a String",
     "difficulty": "Medium",
-    "id": 438,
-    "link": "https://leetcode.com/problems/find-all-anagrams-in-a-string/",
-    "title": "Find All Anagrams in a String"
+    "link": "https://leetcode.com/problems/find-all-anagrams-in-a-string/"
   },
   "439": {
+    "id": 439,
     "category": "Stack",
+    "title": "Ternary Expression Parser",
     "difficulty": "Medium",
-    "id": 439,
-    "link": "https://leetcode.com/problems/ternary-expression-parser/",
-    "title": "Ternary Expression Parser"
+    "link": "https://leetcode.com/problems/ternary-expression-parser/"
   },
   "440": {
+    "id": 440,
     "category": "Trie",
+    "title": "K-th Smallest in Lexicographical Order",
     "difficulty": "Hard",
-    "id": 440,
-    "link": "https://leetcode.com/problems/k-th-smallest-in-lexicographical-order/",
-    "title": "K-th Smallest in Lexicographical Order"
+    "link": "https://leetcode.com/problems/k-th-smallest-in-lexicographical-order/"
   },
   "441": {
+    "id": 441,
     "category": "Binary Search",
+    "title": "Arranging Coins",
     "difficulty": "Easy",
-    "id": 441,
-    "link": "https://leetcode.com/problems/arranging-coins/",
-    "title": "Arranging Coins"
+    "link": "https://leetcode.com/problems/arranging-coins/"
   },
   "442": {
+    "id": 442,
     "category": "Array & Hashing",
+    "title": "Find All Duplicates in an Array",
     "difficulty": "Medium",
-    "id": 442,
-    "link": "https://leetcode.com/problems/find-all-duplicates-in-an-array/",
-    "title": "Find All Duplicates in an Array"
+    "link": "https://leetcode.com/problems/find-all-duplicates-in-an-array/"
   },
   "443": {
+    "id": 443,
     "category": "Two Pointers",
+    "title": "String Compression",
     "difficulty": "Medium",
-    "id": 443,
-    "link": "https://leetcode.com/problems/string-compression/",
-    "title": "String Compression"
+    "link": "https://leetcode.com/problems/string-compression/"
   },
   "444": {
+    "id": 444,
     "category": "Graph Traversal",
+    "title": "Sequence Reconstruction",
     "difficulty": "Medium",
-    "id": 444,
-    "link": "https://leetcode.com/problems/sequence-reconstruction/",
-    "title": "Sequence Reconstruction"
+    "link": "https://leetcode.com/problems/sequence-reconstruction/"
   },
   "445": {
+    "id": 445,
     "category": "Stack",
+    "title": "Add Two Numbers II",
     "difficulty": "Medium",
-    "id": 445,
-    "link": "https://leetcode.com/problems/add-two-numbers-ii/",
-    "title": "Add Two Numbers II"
+    "link": "https://leetcode.com/problems/add-two-numbers-ii/"
   },
   "446": {
+    "id": 446,
     "category": "Dynamic Programming",
+    "title": "Arithmetic Slices II - Subsequence",
     "difficulty": "Hard",
-    "id": 446,
-    "link": "https://leetcode.com/problems/arithmetic-slices-ii-subsequence/",
-    "title": "Arithmetic Slices II - Subsequence"
+    "link": "https://leetcode.com/problems/arithmetic-slices-ii-subsequence/"
   },
   "447": {
+    "id": 447,
     "category": "Math & Geometry",
+    "title": "Number of Boomerangs",
     "difficulty": "Medium",
-    "id": 447,
-    "link": "https://leetcode.com/problems/number-of-boomerangs/",
-    "title": "Number of Boomerangs"
+    "link": "https://leetcode.com/problems/number-of-boomerangs/"
   },
   "448": {
+    "id": 448,
     "category": "Array & Hashing",
+    "title": "Find All Numbers Disappeared in an Array",
     "difficulty": "Easy",
-    "id": 448,
-    "link": "https://leetcode.com/problems/find-all-numbers-disappeared-in-an-array/",
-    "title": "Find All Numbers Disappeared in an Array"
+    "link": "https://leetcode.com/problems/find-all-numbers-disappeared-in-an-array/"
   },
   "449": {
+    "id": 449,
     "category": "Tree",
+    "title": "Serialize and Deserialize BST",
     "difficulty": "Medium",
-    "id": 449,
-    "link": "https://leetcode.com/problems/serialize-and-deserialize-bst/",
-    "title": "Serialize and Deserialize BST"
+    "link": "https://leetcode.com/problems/serialize-and-deserialize-bst/"
   },
   "450": {
+    "id": 450,
     "category": "Tree",
+    "title": "Delete Node in a BST",
     "difficulty": "Medium",
-    "id": 450,
-    "link": "https://leetcode.com/problems/delete-node-in-a-bst/",
-    "title": "Delete Node in a BST"
+    "link": "https://leetcode.com/problems/delete-node-in-a-bst/"
   },
   "451": {
+    "id": 451,
     "category": "Heap (Priority Queue)",
+    "title": "Sort Characters By Frequency",
     "difficulty": "Medium",
-    "id": 451,
-    "link": "https://leetcode.com/problems/sort-characters-by-frequency/",
-    "title": "Sort Characters By Frequency"
+    "link": "https://leetcode.com/problems/sort-characters-by-frequency/"
   },
   "452": {
+    "id": 452,
     "category": "Greedy",
+    "title": "Minimum Number of Arrows to Burst Balloons",
     "difficulty": "Medium",
-    "id": 452,
-    "link": "https://leetcode.com/problems/minimum-number-of-arrows-to-burst-balloons/",
-    "title": "Minimum Number of Arrows to Burst Balloons"
+    "link": "https://leetcode.com/problems/minimum-number-of-arrows-to-burst-balloons/"
   },
   "453": {
+    "id": 453,
     "category": "Math & Geometry",
+    "title": "Minimum Moves to Equal Array Elements",
     "difficulty": "Medium",
-    "id": 453,
-    "link": "https://leetcode.com/problems/minimum-moves-to-equal-array-elements/",
-    "title": "Minimum Moves to Equal Array Elements"
+    "link": "https://leetcode.com/problems/minimum-moves-to-equal-array-elements/"
+  },
+  "454": {
+    "id": 454,
+    "category": "Array & Hashing",
+    "title": "4Sum II",
+    "difficulty": "Medium",
+    "link": "https://leetcode.com/problems/4sum-ii/"
+  },
+  "455": {
+    "id": 455,
+    "category": "Greedy",
+    "title": "Assign Cookies",
+    "difficulty": "Easy",
+    "link": "https://leetcode.com/problems/assign-cookies/"
   },
-  "454": {"category": "Array & Hashing", "difficulty": "Medium", "id": 454, "link": "https://leetcode.com/problems/4sum-ii/", "title": "4Sum II"},
-  "455": {"category": "Greedy", "difficulty": "Easy", "id": 455, "link": "https://leetcode.com/problems/assign-cookies/", "title": "Assign Cookies"},
   "456": {
+    "id": 456,
     "category": "Binary Search",
+    "title": "132 Pattern",
     "difficulty": "Medium",
-    "id": 456,
-    "link": "https://leetcode.com/problems/132-pattern/",
-    "title": "132 Pattern"
+    "link": "https://leetcode.com/problems/132-pattern/"
   },
   "457": {
+    "id": 457,
     "category": "Two Pointers",
+    "title": "Circular Array Loop",
     "difficulty": "Medium",
-    "id": 457,
-    "link": "https://leetcode.com/problems/circular-array-loop/",
-    "title": "Circular Array Loop"
+    "link": "https://leetcode.com/problems/circular-array-loop/"
   },
   "458": {
+    "id": 458,
     "category": "Dynamic Programming",
+    "title": "Poor Pigs",
     "difficulty": "Hard",
-    "id": 458,
-    "link": "https://leetcode.com/problems/poor-pigs/",
-    "title": "Poor Pigs"
+    "link": "https://leetcode.com/problems/poor-pigs/"
   },
   "459": {
+    "id": 459,
     "category": "Array & Hashing",
+    "title": "Repeated Substring Pattern",
     "difficulty": "Easy",
-    "id": 459,
-    "link": "https://leetcode.com/problems/repeated-substring-pattern/",
-    "title": "Repeated Substring Pattern"
+    "link": "https://leetcode.com/problems/repeated-substring-pattern/"
+  },
+  "460": {
+    "id": 460,
+    "category": "Linked List",
+    "title": "LFU Cache",
+    "difficulty": "Hard",
+    "link": "https://leetcode.com/problems/lfu-cache/"
   },
-  "460": {"category": "Linked List", "difficulty": "Hard", "id": 460, "link": "https://leetcode.com/problems/lfu-cache/", "title": "LFU Cache"},
   "461": {
+    "id": 461,
     "category": "Bit Manipulation",
+    "title": "Hamming Distance",
     "difficulty": "Easy",
-    "id": 461,
-    "link": "https://leetcode.com/problems/hamming-distance/",
-    "title": "Hamming Distance"
+    "link": "https://leetcode.com/problems/hamming-distance/"
   },
   "462": {
+    "id": 462,
     "category": "Math & Geometry",
+    "title": "Minimum Moves to Equal Array Elements II",
     "difficulty": "Medium",
-    "id": 462,
-    "link": "https://leetcode.com/problems/minimum-moves-to-equal-array-elements-ii/",
-    "title": "Minimum Moves to Equal Array Elements II"
+    "link": "https://leetcode.com/problems/minimum-moves-to-equal-array-elements-ii/"
   },
   "463": {
+    "id": 463,
     "category": "Graph Traversal",
+    "title": "Island Perimeter",
     "difficulty": "Easy",
-    "id": 463,
-    "link": "https://leetcode.com/problems/island-perimeter/",
-    "title": "Island Perimeter"
+    "link": "https://leetcode.com/problems/island-perimeter/"
   },
   "464": {
+    "id": 464,
     "category": "Dynamic Programming",
+    "title": "Can I Win",
     "difficulty": "Medium",
-    "id": 464,
-    "link": "https://leetcode.com/problems/can-i-win/",
-    "title": "Can I Win"
+    "link": "https://leetcode.com/problems/can-i-win/"
   },
   "465": {
+    "id": 465,
     "category": "Dynamic Programming",
+    "title": "Optimal Account Balancing",
     "difficulty": "Hard",
-    "id": 465,
-    "link": "https://leetcode.com/problems/optimal-account-balancing/",
-    "title": "Optimal Account Balancing"
+    "link": "https://leetcode.com/problems/optimal-account-balancing/"
   },
   "466": {
+    "id": 466,
     "category": "Dynamic Programming",
+    "title": "Count The Repetitions",
     "difficulty": "Hard",
-    "id": 466,
-    "link": "https://leetcode.com/problems/count-the-repetitions/",
-    "title": "Count The Repetitions"
+    "link": "https://leetcode.com/problems/count-the-repetitions/"
   },
   "467": {
+    "id": 467,
     "category": "Dynamic Programming",
+    "title": "Unique Substrings in Wraparound String",
     "difficulty": "Medium",
-    "id": 467,
-    "link": "https://leetcode.com/problems/unique-substrings-in-wraparound-string/",
-    "title": "Unique Substrings in Wraparound String"
+    "link": "https://leetcode.com/problems/unique-substrings-in-wraparound-string/"
   },
   "468": {
+    "id": 468,
     "category": "Array & Hashing",
+    "title": "Validate IP Address",
     "difficulty": "Medium",
-    "id": 468,
-    "link": "https://leetcode.com/problems/validate-ip-address/",
-    "title": "Validate IP Address"
+    "link": "https://leetcode.com/problems/validate-ip-address/"
   },
   "469": {
+    "id": 469,
     "category": "Math & Geometry",
+    "title": "Convex Polygon",
     "difficulty": "Medium",
-    "id": 469,
-    "link": "https://leetcode.com/problems/convex-polygon/",
-    "title": "Convex Polygon"
+    "link": "https://leetcode.com/problems/convex-polygon/"
   },
   "470": {
+    "id": 470,
     "category": "Math & Geometry",
+    "title": "Implement Rand10() Using Rand7()",
     "difficulty": "Medium",
-    "id": 470,
-    "link": "https://leetcode.com/problems/implement-rand10-using-rand7/",
-    "title": "Implement Rand10() Using Rand7()"
+    "link": "https://leetcode.com/problems/implement-rand10-using-rand7/"
   },
   "471": {
+    "id": 471,
     "category": "Dynamic Programming",
+    "title": "Encode String with Shortest Length",
     "difficulty": "Hard",
-    "id": 471,
-    "link": "https://leetcode.com/problems/encode-string-with-shortest-length/",
-    "title": "Encode String with Shortest Length"
+    "link": "https://leetcode.com/problems/encode-string-with-shortest-length/"
   },
   "472": {
+    "id": 472,
     "category": "Graph Traversal",
+    "title": "Concatenated Words",
     "difficulty": "Hard",
-    "id": 472,
-    "link": "https://leetcode.com/problems/concatenated-words/",
-    "title": "Concatenated Words"
+    "link": "https://leetcode.com/problems/concatenated-words/"
   },
   "473": {
+    "id": 473,
     "category": "Dynamic Programming",
+    "title": "Matchsticks to Square",
     "difficulty": "Medium",
-    "id": 473,
-    "link": "https://leetcode.com/problems/matchsticks-to-square/",
-    "title": "Matchsticks to Square"
+    "link": "https://leetcode.com/problems/matchsticks-to-square/"
   },
   "474": {
+    "id": 474,
     "category": "Dynamic Programming",
+    "title": "Ones and Zeroes",
     "difficulty": "Medium",
-    "id": 474,
-    "link": "https://leetcode.com/problems/ones-and-zeroes/",
-    "title": "Ones and Zeroes"
+    "link": "https://leetcode.com/problems/ones-and-zeroes/"
+  },
+  "475": {
+    "id": 475,
+    "category": "Binary Search",
+    "title": "Heaters",
+    "difficulty": "Medium",
+    "link": "https://leetcode.com/problems/heaters/"
   },
-  "475": {"category": "Binary Search", "difficulty": "Medium", "id": 475, "link": "https://leetcode.com/problems/heaters/", "title": "Heaters"},
   "476": {
+    "id": 476,
     "category": "Bit Manipulation",
+    "title": "Number Complement",
     "difficulty": "Easy",
-    "id": 476,
-    "link": "https://leetcode.com/problems/number-complement/",
-    "title": "Number Complement"
+    "link": "https://leetcode.com/problems/number-complement/"
   },
   "477": {
+    "id": 477,
     "category": "Bit Manipulation",
+    "title": "Total Hamming Distance",
     "difficulty": "Medium",
-    "id": 477,
-    "link": "https://leetcode.com/problems/total-hamming-distance/",
-    "title": "Total Hamming Distance"
+    "link": "https://leetcode.com/problems/total-hamming-distance/"
   },
   "478": {
+    "id": 478,
     "category": "Math & Geometry",
+    "title": "Generate Random Point in a Circle",
     "difficulty": "Medium",
-    "id": 478,
-    "link": "https://leetcode.com/problems/generate-random-point-in-a-circle/",
-    "title": "Generate Random Point in a Circle"
+    "link": "https://leetcode.com/problems/generate-random-point-in-a-circle/"
   },
   "479": {
+    "id": 479,
     "category": "Math & Geometry",
+    "title": "Largest Palindrome Product",
     "difficulty": "Hard",
-    "id": 479,
-    "link": "https://leetcode.com/problems/largest-palindrome-product/",
-    "title": "Largest Palindrome Product"
+    "link": "https://leetcode.com/problems/largest-palindrome-product/"
   },
   "480": {
+    "id": 480,
     "category": "Sliding Window",
+    "title": "Sliding Window Median",
     "difficulty": "Hard",
-    "id": 480,
-    "link": "https://leetcode.com/problems/sliding-window-median/",
-    "title": "Sliding Window Median"
+    "link": "https://leetcode.com/problems/sliding-window-median/"
   },
   "481": {
+    "id": 481,
     "category": "Two Pointers",
+    "title": "Magical String",
     "difficulty": "Medium",
-    "id": 481,
-    "link": "https://leetcode.com/problems/magical-string/",
-    "title": "Magical String"
+    "link": "https://leetcode.com/problems/magical-string/"
   },
   "482": {
+    "id": 482,
     "category": "Array & Hashing",
+    "title": "License Key Formatting",
     "difficulty": "Easy",
-    "id": 482,
-    "link": "https://leetcode.com/problems/license-key-formatting/",
-    "title": "License Key Formatting"
+    "link": "https://leetcode.com/problems/license-key-formatting/"
   },
   "483": {
+    "id": 483,
     "category": "Binary Search",
+    "title": "Smallest Good Base",
     "difficulty": "Hard",
-    "id": 483,
-    "link": "https://leetcode.com/problems/smallest-good-base/",
-    "title": "Smallest Good Base"
+    "link": "https://leetcode.com/problems/smallest-good-base/"
   },
   "484": {
+    "id": 484,
     "category": "Stack",
+    "title": "Find Permutation",
     "difficulty": "Medium",
-    "id": 484,
-    "link": "https://leetcode.com/problems/find-permutation/",
-    "title": "Find Permutation"
+    "link": "https://leetcode.com/problems/find-permutation/"
   },
   "485": {
+    "id": 485,
     "category": "Array & Hashing",
+    "title": "Max Consecutive Ones",
     "difficulty": "Easy",
-    "id": 485,
-    "link": "https://leetcode.com/problems/max-consecutive-ones/",
-    "title": "Max Consecutive Ones"
+    "link": "https://leetcode.com/problems/max-consecutive-ones/"
   },
   "486": {
+    "id": 486,
     "category": "Dynamic Programming",
+    "title": "Predict the Winner",
     "difficulty": "Medium",
-    "id": 486,
-    "link": "https://leetcode.com/problems/predict-the-winner/",
-    "title": "Predict the Winner"
+    "link": "https://leetcode.com/problems/predict-the-winner/"
   },
   "487": {
+    "id": 487,
     "category": "Dynamic Programming",
+    "title": "Max Consecutive Ones II",
     "difficulty": "Medium",
-    "id": 487,
-    "link": "https://leetcode.com/problems/max-consecutive-ones-ii/",
-    "title": "Max Consecutive Ones II"
+    "link": "https://leetcode.com/problems/max-consecutive-ones-ii/"
+  },
+  "488": {
+    "id": 488,
+    "category": "Graph Traversal",
+    "title": "Zuma Game",
+    "difficulty": "Hard",
+    "link": "https://leetcode.com/problems/zuma-game/"
   },
-  "488": {"category": "Graph Traversal", "difficulty": "Hard", "id": 488, "link": "https://leetcode.com/problems/zuma-game/", "title": "Zuma Game"},
   "489": {
+    "id": 489,
     "category": "Backtracking",
+    "title": "Robot Room Cleaner",
     "difficulty": "Hard",
-    "id": 489,
-    "link": "https://leetcode.com/problems/robot-room-cleaner/",
-    "title": "Robot Room Cleaner"
+    "link": "https://leetcode.com/problems/robot-room-cleaner/"
   },
-  "490": {"category": "Graph Traversal", "difficulty": "Medium", "id": 490, "link": "https://leetcode.com/problems/the-maze/", "title": "The Maze"},
-  "491": {
-    "category": "Backtracking",
+  "490": {
+    "id": 490,
+    "category": "Graph Traversal",
+    "title": "The Maze",
     "difficulty": "Medium",
+    "link": "https://leetcode.com/problems/the-maze/"
+  },
+  "491": {
     "id": 491,
-    "link": "https://leetcode.com/problems/non-decreasing-subsequences/",
-    "title": "Non-decreasing Subsequences"
+    "category": "Backtracking",
+    "title": "Non-decreasing Subsequences",
+    "difficulty": "Medium",
+    "link": "https://leetcode.com/problems/non-decreasing-subsequences/"
   },
   "492": {
+    "id": 492,
     "category": "Math & Geometry",
+    "title": "Construct the Rectangle",
     "difficulty": "Easy",
-    "id": 492,
-    "link": "https://leetcode.com/problems/construct-the-rectangle/",
-    "title": "Construct the Rectangle"
+    "link": "https://leetcode.com/problems/construct-the-rectangle/"
+  },
+  "493": {
+    "id": 493,
+    "category": "Tree",
+    "title": "Reverse Pairs",
+    "difficulty": "Hard",
+    "link": "https://leetcode.com/problems/reverse-pairs/"
   },
-  "493": {"category": "Tree", "difficulty": "Hard", "id": 493, "link": "https://leetcode.com/problems/reverse-pairs/", "title": "Reverse Pairs"},
   "494": {
+    "id": 494,
     "category": "Dynamic Programming",
+    "title": "Target Sum",
     "difficulty": "Medium",
-    "id": 494,
-    "link": "https://leetcode.com/problems/target-sum/",
-    "title": "Target Sum"
+    "link": "https://leetcode.com/problems/target-sum/"
   },
   "495": {
+    "id": 495,
     "category": "Array & Hashing",
+    "title": "Teemo Attacking",
     "difficulty": "Easy",
-    "id": 495,
-    "link": "https://leetcode.com/problems/teemo-attacking/",
-    "title": "Teemo Attacking"
+    "link": "https://leetcode.com/problems/teemo-attacking/"
   },
   "496": {
+    "id": 496,
     "category": "Stack",
+    "title": "Next Greater Element I",
     "difficulty": "Easy",
-    "id": 496,
-    "link": "https://leetcode.com/problems/next-greater-element-i/",
-    "title": "Next Greater Element I"
+    "link": "https://leetcode.com/problems/next-greater-element-i/"
   },
   "497": {
+    "id": 497,
     "category": "Binary Search",
+    "title": "Random Point in Non-overlapping Rectangles",
     "difficulty": "Medium",
-    "id": 497,
-    "link": "https://leetcode.com/problems/random-point-in-non-overlapping-rectangles/",
-    "title": "Random Point in Non-overlapping Rectangles"
+    "link": "https://leetcode.com/problems/random-point-in-non-overlapping-rectangles/"
   },
   "498": {
+    "id": 498,
     "category": "Array & Hashing",
+    "title": "Diagonal Traverse",
     "difficulty": "Medium",
-    "id": 498,
-    "link": "https://leetcode.com/problems/diagonal-traverse/",
-    "title": "Diagonal Traverse"
+    "link": "https://leetcode.com/problems/diagonal-traverse/"
   },
   "499": {
+    "id": 499,
     "category": "Graph Traversal",
+    "title": "The Maze III",
     "difficulty": "Hard",
-    "id": 499,
-    "link": "https://leetcode.com/problems/the-maze-iii/",
-    "title": "The Maze III"
+    "link": "https://leetcode.com/problems/the-maze-iii/"
   },
   "500": {
+    "id": 500,
     "category": "Array & Hashing",
+    "title": "Keyboard Row",
     "difficulty": "Easy",
-    "id": 500,
-    "link": "https://leetcode.com/problems/keyboard-row/",
-    "title": "Keyboard Row"
+    "link": "https://leetcode.com/problems/keyboard-row/"
   },
   "501": {
+    "id": 501,
     "category": "Tree",
+    "title": "Find Mode in Binary Search Tree",
     "difficulty": "Easy",
-    "id": 501,
-    "link": "https://leetcode.com/problems/find-mode-in-binary-search-tree/",
-    "title": "Find Mode in Binary Search Tree"
+    "link": "https://leetcode.com/problems/find-mode-in-binary-search-tree/"
+  },
+  "502": {
+    "id": 502,
+    "category": "Heap (Priority Queue)",
+    "title": "IPO",
+    "difficulty": "Hard",
+    "link": "https://leetcode.com/problems/ipo/"
   },
-  "502": {"category": "Heap (Priority Queue)", "difficulty": "Hard", "id": 502, "link": "https://leetcode.com/problems/ipo/", "title": "IPO"},
   "503": {
+    "id": 503,
     "category": "Stack",
+    "title": "Next Greater Element II",
     "difficulty": "Medium",
-    "id": 503,
-    "link": "https://leetcode.com/problems/next-greater-element-ii/",
-    "title": "Next Greater Element II"
+    "link": "https://leetcode.com/problems/next-greater-element-ii/"
+  },
+  "504": {
+    "id": 504,
+    "category": "Math & Geometry",
+    "title": "Base 7",
+    "difficulty": "Easy",
+    "link": "https://leetcode.com/problems/base-7/"
   },
-  "504": {"category": "Math & Geometry", "difficulty": "Easy", "id": 504, "link": "https://leetcode.com/problems/base-7/", "title": "Base 7"},
   "505": {
+    "id": 505,
     "category": "Graph Traversal",
+    "title": "The Maze II",
     "difficulty": "Medium",
-    "id": 505,
-    "link": "https://leetcode.com/problems/the-maze-ii/",
-    "title": "The Maze II"
+    "link": "https://leetcode.com/problems/the-maze-ii/"
   },
   "506": {
+    "id": 506,
     "category": "Heap (Priority Queue)",
+    "title": "Relative Ranks",
     "difficulty": "Easy",
-    "id": 506,
-    "link": "https://leetcode.com/problems/relative-ranks/",
-    "title": "Relative Ranks"
+    "link": "https://leetcode.com/problems/relative-ranks/"
   },
   "507": {
+    "id": 507,
     "category": "Math & Geometry",
+    "title": "Perfect Number",
     "difficulty": "Easy",
-    "id": 507,
-    "link": "https://leetcode.com/problems/perfect-number/",
-    "title": "Perfect Number"
+    "link": "https://leetcode.com/problems/perfect-number/"
   },
   "508": {
+    "id": 508,
     "category": "Tree",
+    "title": "Most Frequent Subtree Sum",
     "difficulty": "Medium",
-    "id": 508,
-    "link": "https://leetcode.com/problems/most-frequent-subtree-sum/",
-    "title": "Most Frequent Subtree Sum"
+    "link": "https://leetcode.com/problems/most-frequent-subtree-sum/"
   },
   "509": {
+    "id": 509,
     "category": "Dynamic Programming",
+    "title": "Fibonacci Number",
     "difficulty": "Easy",
-    "id": 509,
-    "link": "https://leetcode.com/problems/fibonacci-number/",
-    "title": "Fibonacci Number"
+    "link": "https://leetcode.com/problems/fibonacci-number/"
   },
   "510": {
+    "id": 510,
     "category": "Tree",
+    "title": "Inorder Successor in BST II",
     "difficulty": "Medium",
-    "id": 510,
-    "link": "https://leetcode.com/problems/inorder-successor-in-bst-ii/",
-    "title": "Inorder Successor in BST II"
+    "link": "https://leetcode.com/problems/inorder-successor-in-bst-ii/"
   },
   "511": {
+    "id": 511,
     "category": "Database",
+    "title": "Game Play Analysis I",
     "difficulty": "Easy",
-    "id": 511,
-    "link": "https://leetcode.com/problems/game-play-analysis-i/",
-    "title": "Game Play Analysis I"
+    "link": "https://leetcode.com/problems/game-play-analysis-i/"
   },
   "512": {
+    "id": 512,
     "category": "Database",
+    "title": "Game Play Analysis II",
     "difficulty": "Easy",
-    "id": 512,
-    "link": "https://leetcode.com/problems/game-play-analysis-ii/",
-    "title": "Game Play Analysis II"
+    "link": "https://leetcode.com/problems/game-play-analysis-ii/"
   },
   "513": {
+    "id": 513,
     "category": "Tree",
+    "title": "Find Bottom Left Tree Value",
     "difficulty": "Medium",
-    "id": 513,
-    "link": "https://leetcode.com/problems/find-bottom-left-tree-value/",
-    "title": "Find Bottom Left Tree Value"
+    "link": "https://leetcode.com/problems/find-bottom-left-tree-value/"
   },
   "514": {
+    "id": 514,
     "category": "Graph Traversal",
+    "title": "Freedom Trail",
     "difficulty": "Hard",
-    "id": 514,
-    "link": "https://leetcode.com/problems/freedom-trail/",
-    "title": "Freedom Trail"
+    "link": "https://leetcode.com/problems/freedom-trail/"
   },
   "515": {
+    "id": 515,
     "category": "Tree",
+    "title": "Find Largest Value in Each Tree Row",
     "difficulty": "Medium",
-    "id": 515,
-    "link": "https://leetcode.com/problems/find-largest-value-in-each-tree-row/",
-    "title": "Find Largest Value in Each Tree Row"
+    "link": "https://leetcode.com/problems/find-largest-value-in-each-tree-row/"
   },
   "516": {
+    "id": 516,
     "category": "Dynamic Programming",
+    "title": "Longest Palindromic Subsequence",
     "difficulty": "Medium",
-    "id": 516,
-    "link": "https://leetcode.com/problems/longest-palindromic-subsequence/",
-    "title": "Longest Palindromic Subsequence"
+    "link": "https://leetcode.com/problems/longest-palindromic-subsequence/"
   },
   "517": {
+    "id": 517,
     "category": "Greedy",
+    "title": "Super Washing Machines",
     "difficulty": "Hard",
-    "id": 517,
-    "link": "https://leetcode.com/problems/super-washing-machines/",
-    "title": "Super Washing Machines"
+    "link": "https://leetcode.com/problems/super-washing-machines/"
   },
   "518": {
+    "id": 518,
     "category": "Dynamic Programming",
+    "title": "Coin Change II",
     "difficulty": "Medium",
-    "id": 518,
-    "link": "https://leetcode.com/problems/coin-change-ii/",
-    "title": "Coin Change II"
+    "link": "https://leetcode.com/problems/coin-change-ii/"
   },
   "519": {
+    "id": 519,
     "category": "Math & Geometry",
+    "title": "Random Flip Matrix",
     "difficulty": "Medium",
-    "id": 519,
-    "link": "https://leetcode.com/problems/random-flip-matrix/",
-    "title": "Random Flip Matrix"
+    "link": "https://leetcode.com/problems/random-flip-matrix/"
   },
   "520": {
+    "id": 520,
     "category": "Array & Hashing",
+    "title": "Detect Capital",
     "difficulty": "Easy",
-    "id": 520,
-    "link": "https://leetcode.com/problems/detect-capital/",
-    "title": "Detect Capital"
+    "link": "https://leetcode.com/problems/detect-capital/"
   },
   "521": {
+    "id": 521,
     "category": "Array & Hashing",
+    "title": "Longest Uncommon Subsequence I",
     "difficulty": "Easy",
-    "id": 521,
-    "link": "https://leetcode.com/problems/longest-uncommon-subsequence-i/",
-    "title": "Longest Uncommon Subsequence I"
+    "link": "https://leetcode.com/problems/longest-uncommon-subsequence-i/"
   },
   "522": {
+    "id": 522,
     "category": "Two Pointers",
+    "title": "Longest Uncommon Subsequence II",
     "difficulty": "Medium",
-    "id": 522,
-    "link": "https://leetcode.com/problems/longest-uncommon-subsequence-ii/",
-    "title": "Longest Uncommon Subsequence II"
+    "link": "https://leetcode.com/problems/longest-uncommon-subsequence-ii/"
   },
   "523": {
+    "id": 523,
     "category": "Math & Geometry",
+    "title": "Continuous Subarray Sum",
     "difficulty": "Medium",
-    "id": 523,
-    "link": "https://leetcode.com/problems/continuous-subarray-sum/",
-    "title": "Continuous Subarray Sum"
+    "link": "https://leetcode.com/problems/continuous-subarray-sum/"
   },
   "524": {
+    "id": 524,
     "category": "Two Pointers",
+    "title": "Longest Word in Dictionary through Deleting",
     "difficulty": "Medium",
-    "id": 524,
-    "link": "https://leetcode.com/problems/longest-word-in-dictionary-through-deleting/",
-    "title": "Longest Word in Dictionary through Deleting"
+    "link": "https://leetcode.com/problems/longest-word-in-dictionary-through-deleting/"
   },
   "525": {
+    "id": 525,
     "category": "Array & Hashing",
+    "title": "Contiguous Array",
     "difficulty": "Medium",
-    "id": 525,
-    "link": "https://leetcode.com/problems/contiguous-array/",
-    "title": "Contiguous Array"
+    "link": "https://leetcode.com/problems/contiguous-array/"
   },
   "526": {
+    "id": 526,
     "category": "Dynamic Programming",
+    "title": "Beautiful Arrangement",
     "difficulty": "Medium",
-    "id": 526,
-    "link": "https://leetcode.com/problems/beautiful-arrangement/",
-    "title": "Beautiful Arrangement"
+    "link": "https://leetcode.com/problems/beautiful-arrangement/"
   },
   "527": {
+    "id": 527,
     "category": "Trie",
+    "title": "Word Abbreviation",
     "difficulty": "Hard",
-    "id": 527,
-    "link": "https://leetcode.com/problems/word-abbreviation/",
-    "title": "Word Abbreviation"
+    "link": "https://leetcode.com/problems/word-abbreviation/"
   },
   "528": {
+    "id": 528,
     "category": "Binary Search",
+    "title": "Random Pick with Weight",
     "difficulty": "Medium",
-    "id": 528,
-    "link": "https://leetcode.com/problems/random-pick-with-weight/",
-    "title": "Random Pick with Weight"
+    "link": "https://leetcode.com/problems/random-pick-with-weight/"
   },
   "529": {
+    "id": 529,
     "category": "Graph Traversal",
+    "title": "Minesweeper",
     "difficulty": "Medium",
-    "id": 529,
-    "link": "https://leetcode.com/problems/minesweeper/",
-    "title": "Minesweeper"
+    "link": "https://leetcode.com/problems/minesweeper/"
   },
   "530": {
+    "id": 530,
     "category": "Tree",
+    "title": "Minimum Absolute Difference in BST",
     "difficulty": "Easy",
-    "id": 530,
-    "link": "https://leetcode.com/problems/minimum-absolute-difference-in-bst/",
-    "title": "Minimum Absolute Difference in BST"
+    "link": "https://leetcode.com/problems/minimum-absolute-difference-in-bst/"
   },
   "531": {
+    "id": 531,
     "category": "Array & Hashing",
+    "title": "Lonely Pixel I",
     "difficulty": "Medium",
-    "id": 531,
-    "link": "https://leetcode.com/problems/lonely-pixel-i/",
-    "title": "Lonely Pixel I"
+    "link": "https://leetcode.com/problems/lonely-pixel-i/"
   },
   "532": {
+    "id": 532,
     "category": "Binary Search",
+    "title": "K-diff Pairs in an Array",
     "difficulty": "Medium",
-    "id": 532,
-    "link": "https://leetcode.com/problems/k-diff-pairs-in-an-array/",
-    "title": "K-diff Pairs in an Array"
+    "link": "https://leetcode.com/problems/k-diff-pairs-in-an-array/"
   },
   "533": {
+    "id": 533,
     "category": "Array & Hashing",
+    "title": "Lonely Pixel II",
     "difficulty": "Medium",
-    "id": 533,
-    "link": "https://leetcode.com/problems/lonely-pixel-ii/",
-    "title": "Lonely Pixel II"
+    "link": "https://leetcode.com/problems/lonely-pixel-ii/"
   },
   "534": {
+    "id": 534,
     "category": "Database",
+    "title": "Game Play Analysis III",
     "difficulty": "Medium",
-    "id": 534,
-    "link": "https://leetcode.com/problems/game-play-analysis-iii/",
-    "title": "Game Play Analysis III"
+    "link": "https://leetcode.com/problems/game-play-analysis-iii/"
   },
   "535": {
+    "id": 535,
     "category": "Array & Hashing",
+    "title": "Encode and Decode TinyURL",
     "difficulty": "Medium",
-    "id": 535,
-    "link": "https://leetcode.com/problems/encode-and-decode-tinyurl/",
-    "title": "Encode and Decode TinyURL"
+    "link": "https://leetcode.com/problems/encode-and-decode-tinyurl/"
   },
   "536": {
+    "id": 536,
     "category": "Tree",
+    "title": "Construct Binary Tree from String",
     "difficulty": "Medium",
-    "id": 536,
-    "link": "https://leetcode.com/problems/construct-binary-tree-from-string/",
-    "title": "Construct Binary Tree from String"
+    "link": "https://leetcode.com/problems/construct-binary-tree-from-string/"
   },
   "537": {
+    "id": 537,
     "category": "Math & Geometry",
+    "title": "Complex Number Multiplication",
     "difficulty": "Medium",
-    "id": 537,
-    "link": "https://leetcode.com/problems/complex-number-multiplication/",
-    "title": "Complex Number Multiplication"
+    "link": "https://leetcode.com/problems/complex-number-multiplication/"
   },
   "538": {
+    "id": 538,
     "category": "Tree",
+    "title": "Convert BST to Greater Tree",
     "difficulty": "Medium",
-    "id": 538,
-    "link": "https://leetcode.com/problems/convert-bst-to-greater-tree/",
-    "title": "Convert BST to Greater Tree"
+    "link": "https://leetcode.com/problems/convert-bst-to-greater-tree/"
   },
   "539": {
+    "id": 539,
     "category": "Math & Geometry",
+    "title": "Minimum Time Difference",
     "difficulty": "Medium",
-    "id": 539,
-    "link": "https://leetcode.com/problems/minimum-time-difference/",
-    "title": "Minimum Time Difference"
+    "link": "https://leetcode.com/problems/minimum-time-difference/"
   },
   "540": {
+    "id": 540,
     "category": "Binary Search",
+    "title": "Single Element in a Sorted Array",
     "difficulty": "Medium",
-    "id": 540,
-    "link": "https://leetcode.com/problems/single-element-in-a-sorted-array/",
-    "title": "Single Element in a Sorted Array"
+    "link": "https://leetcode.com/problems/single-element-in-a-sorted-array/"
   },
   "541": {
+    "id": 541,
     "category": "Two Pointers",
+    "title": "Reverse String II",
     "difficulty": "Easy",
-    "id": 541,
-    "link": "https://leetcode.com/problems/reverse-string-ii/",
-    "title": "Reverse String II"
+    "link": "https://leetcode.com/problems/reverse-string-ii/"
+  },
+  "542": {
+    "id": 542,
+    "category": "Graph Traversal",
+    "title": "01 Matrix",
+    "difficulty": "Medium",
+    "link": "https://leetcode.com/problems/01-matrix/"
   },
-  "542": {"category": "Graph Traversal", "difficulty": "Medium", "id": 542, "link": "https://leetcode.com/problems/01-matrix/", "title": "01 Matrix"},
   "543": {
+    "id": 543,
     "category": "Tree",
+    "title": "Diameter of Binary Tree",
     "difficulty": "Easy",
-    "id": 543,
-    "link": "https://leetcode.com/problems/diameter-of-binary-tree/",
-    "title": "Diameter of Binary Tree"
+    "link": "https://leetcode.com/problems/diameter-of-binary-tree/"
   },
   "544": {
+    "id": 544,
     "category": "Array & Hashing",
+    "title": "Output Contest Matches",
     "difficulty": "Medium",
-    "id": 544,
-    "link": "https://leetcode.com/problems/output-contest-matches/",
-    "title": "Output Contest Matches"
+    "link": "https://leetcode.com/problems/output-contest-matches/"
   },
   "545": {
+    "id": 545,
     "category": "Tree",
+    "title": "Boundary of Binary Tree",
     "difficulty": "Medium",
-    "id": 545,
-    "link": "https://leetcode.com/problems/boundary-of-binary-tree/",
-    "title": "Boundary of Binary Tree"
+    "link": "https://leetcode.com/problems/boundary-of-binary-tree/"
   },
   "546": {
+    "id": 546,
     "category": "Dynamic Programming",
+    "title": "Remove Boxes",
     "difficulty": "Hard",
-    "id": 546,
-    "link": "https://leetcode.com/problems/remove-boxes/",
-    "title": "Remove Boxes"
+    "link": "https://leetcode.com/problems/remove-boxes/"
   },
   "547": {
+    "id": 547,
     "category": "Graph Traversal",
+    "title": "Number of Provinces",
     "difficulty": "Medium",
-    "id": 547,
-    "link": "https://leetcode.com/problems/number-of-provinces/",
-    "title": "Number of Provinces"
+    "link": "https://leetcode.com/problems/number-of-provinces/"
   },
   "548": {
+    "id": 548,
     "category": "Array & Hashing",
+    "title": "Split Array with Equal Sum",
     "difficulty": "Hard",
-    "id": 548,
-    "link": "https://leetcode.com/problems/split-array-with-equal-sum/",
-    "title": "Split Array with Equal Sum"
+    "link": "https://leetcode.com/problems/split-array-with-equal-sum/"
   },
   "549": {
+    "id": 549,
     "category": "Tree",
+    "title": "Binary Tree Longest Consecutive Sequence II",
     "difficulty": "Medium",
-    "id": 549,
-    "link": "https://leetcode.com/problems/binary-tree-longest-consecutive-sequence-ii/",
-    "title": "Binary Tree Longest Consecutive Sequence II"
+    "link": "https://leetcode.com/problems/binary-tree-longest-consecutive-sequence-ii/"
   },
   "550": {
+    "id": 550,
     "category": "Database",
+    "title": "Game Play Analysis IV",
     "difficulty": "Medium",
-    "id": 550,
-    "link": "https://leetcode.com/problems/game-play-analysis-iv/",
-    "title": "Game Play Analysis IV"
+    "link": "https://leetcode.com/problems/game-play-analysis-iv/"
   },
   "551": {
+    "id": 551,
     "category": "Array & Hashing",
+    "title": "Student Attendance Record I",
     "difficulty": "Easy",
-    "id": 551,
-    "link": "https://leetcode.com/problems/student-attendance-record-i/",
-    "title": "Student Attendance Record I"
+    "link": "https://leetcode.com/problems/student-attendance-record-i/"
   },
   "552": {
+    "id": 552,
     "category": "Dynamic Programming",
+    "title": "Student Attendance Record II",
     "difficulty": "Hard",
-    "id": 552,
-    "link": "https://leetcode.com/problems/student-attendance-record-ii/",
-    "title": "Student Attendance Record II"
+    "link": "https://leetcode.com/problems/student-attendance-record-ii/"
   },
   "553": {
+    "id": 553,
     "category": "Dynamic Programming",
+    "title": "Optimal Division",
     "difficulty": "Medium",
-    "id": 553,
-    "link": "https://leetcode.com/problems/optimal-division/",
-    "title": "Optimal Division"
+    "link": "https://leetcode.com/problems/optimal-division/"
   },
   "554": {
+    "id": 554,
     "category": "Array & Hashing",
+    "title": "Brick Wall",
     "difficulty": "Medium",
-    "id": 554,
-    "link": "https://leetcode.com/problems/brick-wall/",
-    "title": "Brick Wall"
+    "link": "https://leetcode.com/problems/brick-wall/"
   },
   "555": {
+    "id": 555,
     "category": "Greedy",
+    "title": "Split Concatenated Strings",
     "difficulty": "Medium",
-    "id": 555,
-    "link": "https://leetcode.com/problems/split-concatenated-strings/",
-    "title": "Split Concatenated Strings"
+    "link": "https://leetcode.com/problems/split-concatenated-strings/"
   },
   "556": {
+    "id": 556,
     "category": "Math & Geometry",
+    "title": "Next Greater Element III",
     "difficulty": "Medium",
-    "id": 556,
-    "link": "https://leetcode.com/problems/next-greater-element-iii/",
-    "title": "Next Greater Element III"
+    "link": "https://leetcode.com/problems/next-greater-element-iii/"
   },
   "557": {
+    "id": 557,
     "category": "Two Pointers",
+    "title": "Reverse Words in a String III",
     "difficulty": "Easy",
-    "id": 557,
-    "link": "https://leetcode.com/problems/reverse-words-in-a-string-iii/",
-    "title": "Reverse Words in a String III"
+    "link": "https://leetcode.com/problems/reverse-words-in-a-string-iii/"
   },
   "558": {
+    "id": 558,
     "category": "Tree",
+    "title": "Logical OR of Two Binary Grids Represented as Quad-Trees",
     "difficulty": "Medium",
-    "id": 558,
-    "link": "https://leetcode.com/problems/logical-or-of-two-binary-grids-represented-as-quad-trees/",
-    "title": "Logical OR of Two Binary Grids Represented as Quad-Trees"
+    "link": "https://leetcode.com/problems/logical-or-of-two-binary-grids-represented-as-quad-trees/"
   },
   "559": {
+    "id": 559,
     "category": "Tree",
+    "title": "Maximum Depth of N-ary Tree",
     "difficulty": "Easy",
-    "id": 559,
-    "link": "https://leetcode.com/problems/maximum-depth-of-n-ary-tree/",
-    "title": "Maximum Depth of N-ary Tree"
+    "link": "https://leetcode.com/problems/maximum-depth-of-n-ary-tree/"
   },
   "560": {
+    "id": 560,
     "category": "Array & Hashing",
+    "title": "Subarray Sum Equals K",
     "difficulty": "Medium",
-    "id": 560,
-    "link": "https://leetcode.com/problems/subarray-sum-equals-k/",
-    "title": "Subarray Sum Equals K"
+    "link": "https://leetcode.com/problems/subarray-sum-equals-k/"
   },
   "561": {
+    "id": 561,
     "category": "Greedy",
+    "title": "Array Partition",
     "difficulty": "Easy",
-    "id": 561,
-    "link": "https://leetcode.com/problems/array-partition/",
-    "title": "Array Partition"
+    "link": "https://leetcode.com/problems/array-partition/"
   },
   "562": {
+    "id": 562,
     "category": "Dynamic Programming",
+    "title": "Longest Line of Consecutive One in Matrix",
     "difficulty": "Medium",
-    "id": 562,
-    "link": "https://leetcode.com/problems/longest-line-of-consecutive-one-in-matrix/",
-    "title": "Longest Line of Consecutive One in Matrix"
+    "link": "https://leetcode.com/problems/longest-line-of-consecutive-one-in-matrix/"
   },
   "563": {
+    "id": 563,
     "category": "Tree",
+    "title": "Binary Tree Tilt",
     "difficulty": "Easy",
-    "id": 563,
-    "link": "https://leetcode.com/problems/binary-tree-tilt/",
-    "title": "Binary Tree Tilt"
+    "link": "https://leetcode.com/problems/binary-tree-tilt/"
   },
   "564": {
+    "id": 564,
     "category": "Math & Geometry",
+    "title": "Find the Closest Palindrome",
     "difficulty": "Hard",
-    "id": 564,
-    "link": "https://leetcode.com/problems/find-the-closest-palindrome/",
-    "title": "Find the Closest Palindrome"
+    "link": "https://leetcode.com/problems/find-the-closest-palindrome/"
   },
   "565": {
+    "id": 565,
     "category": "Graph Traversal",
+    "title": "Array Nesting",
     "difficulty": "Medium",
-    "id": 565,
-    "link": "https://leetcode.com/problems/array-nesting/",
-    "title": "Array Nesting"
+    "link": "https://leetcode.com/problems/array-nesting/"
   },
   "566": {
+    "id": 566,
     "category": "Array & Hashing",
+    "title": "Reshape the Matrix",
     "difficulty": "Easy",
-    "id": 566,
-    "link": "https://leetcode.com/problems/reshape-the-matrix/",
-    "title": "Reshape the Matrix"
+    "link": "https://leetcode.com/problems/reshape-the-matrix/"
   },
   "567": {
+    "id": 567,
     "category": "Sliding Window",
+    "title": "Permutation in String",
     "difficulty": "Medium",
-    "id": 567,
-    "link": "https://leetcode.com/problems/permutation-in-string/",
-    "title": "Permutation in String"
+    "link": "https://leetcode.com/problems/permutation-in-string/"
   },
   "568": {
+    "id": 568,
     "category": "Dynamic Programming",
+    "title": "Maximum Vacation Days",
     "difficulty": "Hard",
-    "id": 568,
-    "link": "https://leetcode.com/problems/maximum-vacation-days/",
-    "title": "Maximum Vacation Days"
+    "link": "https://leetcode.com/problems/maximum-vacation-days/"
   },
   "569": {
+    "id": 569,
     "category": "Database",
+    "title": "Median Employee Salary",
     "difficulty": "Hard",
-    "id": 569,
-    "link": "https://leetcode.com/problems/median-employee-salary/",
-    "title": "Median Employee Salary"
+    "link": "https://leetcode.com/problems/median-employee-salary/"
   },
   "570": {
+    "id": 570,
     "category": "Database",
+    "title": "Managers with at Least 5 Direct Reports",
     "difficulty": "Medium",
-    "id": 570,
-    "link": "https://leetcode.com/problems/managers-with-at-least-5-direct-reports/",
-    "title": "Managers with at Least 5 Direct Reports"
+    "link": "https://leetcode.com/problems/managers-with-at-least-5-direct-reports/"
   },
   "571": {
+    "id": 571,
     "category": "Database",
+    "title": "Find Median Given Frequency of Numbers",
     "difficulty": "Hard",
-    "id": 571,
-    "link": "https://leetcode.com/problems/find-median-given-frequency-of-numbers/",
-    "title": "Find Median Given Frequency of Numbers"
+    "link": "https://leetcode.com/problems/find-median-given-frequency-of-numbers/"
   },
   "572": {
+    "id": 572,
     "category": "Tree",
+    "title": "Subtree of Another Tree",
     "difficulty": "Easy",
-    "id": 572,
-    "link": "https://leetcode.com/problems/subtree-of-another-tree/",
-    "title": "Subtree of Another Tree"
+    "link": "https://leetcode.com/problems/subtree-of-another-tree/"
   },
   "573": {
+    "id": 573,
     "category": "Math & Geometry",
+    "title": "Squirrel Simulation",
     "difficulty": "Medium",
-    "id": 573,
-    "link": "https://leetcode.com/problems/squirrel-simulation/",
-    "title": "Squirrel Simulation"
+    "link": "https://leetcode.com/problems/squirrel-simulation/"
   },
   "574": {
+    "id": 574,
     "category": "Database",
+    "title": "Winning Candidate",
     "difficulty": "Medium",
-    "id": 574,
-    "link": "https://leetcode.com/problems/winning-candidate/",
-    "title": "Winning Candidate"
+    "link": "https://leetcode.com/problems/winning-candidate/"
   },
   "575": {
+    "id": 575,
     "category": "Array & Hashing",
+    "title": "Distribute Candies",
     "difficulty": "Easy",
-    "id": 575,
-    "link": "https://leetcode.com/problems/distribute-candies/",
-    "title": "Distribute Candies"
+    "link": "https://leetcode.com/problems/distribute-candies/"
   },
   "576": {
+    "id": 576,
     "category": "Dynamic Programming",
+    "title": "Out of Boundary Paths",
     "difficulty": "Medium",
-    "id": 576,
-    "link": "https://leetcode.com/problems/out-of-boundary-paths/",
-    "title": "Out of Boundary Paths"
+    "link": "https://leetcode.com/problems/out-of-boundary-paths/"
   },
   "577": {
+    "id": 577,
     "category": "Database",
+    "title": "Employee Bonus",
     "difficulty": "Easy",
-    "id": 577,
-    "link": "https://leetcode.com/problems/employee-bonus/",
-    "title": "Employee Bonus"
+    "link": "https://leetcode.com/problems/employee-bonus/"
   },
   "578": {
+    "id": 578,
     "category": "Database",
+    "title": "Get Highest Answer Rate Question",
     "difficulty": "Medium",
-    "id": 578,
-    "link": "https://leetcode.com/problems/get-highest-answer-rate-question/",
-    "title": "Get Highest Answer Rate Question"
+    "link": "https://leetcode.com/problems/get-highest-answer-rate-question/"
   },
   "579": {
+    "id": 579,
     "category": "Database",
+    "title": "Find Cumulative Salary of an Employee",
     "difficulty": "Hard",
-    "id": 579,
-    "link": "https://leetcode.com/problems/find-cumulative-salary-of-an-employee/",
-    "title": "Find Cumulative Salary of an Employee"
+    "link": "https://leetcode.com/problems/find-cumulative-salary-of-an-employee/"
   },
   "580": {
+    "id": 580,
     "category": "Database",
+    "title": "Count Student Number in Departments",
     "difficulty": "Medium",
-    "id": 580,
-    "link": "https://leetcode.com/problems/count-student-number-in-departments/",
-    "title": "Count Student Number in Departments"
+    "link": "https://leetcode.com/problems/count-student-number-in-departments/"
   },
   "581": {
+    "id": 581,
     "category": "Stack",
+    "title": "Shortest Unsorted Continuous Subarray",
     "difficulty": "Medium",
-    "id": 581,
-    "link": "https://leetcode.com/problems/shortest-unsorted-continuous-subarray/",
-    "title": "Shortest Unsorted Continuous Subarray"
+    "link": "https://leetcode.com/problems/shortest-unsorted-continuous-subarray/"
+  },
+  "582": {
+    "id": 582,
+    "category": "Tree",
+    "title": "Kill Process",
+    "difficulty": "Medium",
+    "link": "https://leetcode.com/problems/kill-process/"
   },
-  "582": {"category": "Tree", "difficulty": "Medium", "id": 582, "link": "https://leetcode.com/problems/kill-process/", "title": "Kill Process"},
   "583": {
+    "id": 583,
     "category": "Dynamic Programming",
+    "title": "Delete Operation for Two Strings",
     "difficulty": "Medium",
-    "id": 583,
-    "link": "https://leetcode.com/problems/delete-operation-for-two-strings/",
-    "title": "Delete Operation for Two Strings"
+    "link": "https://leetcode.com/problems/delete-operation-for-two-strings/"
   },
   "584": {
+    "id": 584,
     "category": "Database",
+    "title": "Find Customer Referee",
     "difficulty": "Easy",
-    "id": 584,
-    "link": "https://leetcode.com/problems/find-customer-referee/",
-    "title": "Find Customer Referee"
+    "link": "https://leetcode.com/problems/find-customer-referee/"
   },
   "585": {
+    "id": 585,
     "category": "Database",
+    "title": "Investments in 2016",
     "difficulty": "Medium",
-    "id": 585,
-    "link": "https://leetcode.com/problems/investments-in-2016/",
-    "title": "Investments in 2016"
+    "link": "https://leetcode.com/problems/investments-in-2016/"
   },
   "586": {
+    "id": 586,
     "category": "Database",
+    "title": "Customer Placing the Largest Number of Orders",
     "difficulty": "Easy",
-    "id": 586,
-    "link": "https://leetcode.com/problems/customer-placing-the-largest-number-of-orders/",
-    "title": "Customer Placing the Largest Number of Orders"
+    "link": "https://leetcode.com/problems/customer-placing-the-largest-number-of-orders/"
   },
   "587": {
+    "id": 587,
     "category": "Math & Geometry",
+    "title": "Erect the Fence",
     "difficulty": "Hard",
-    "id": 587,
-    "link": "https://leetcode.com/problems/erect-the-fence/",
-    "title": "Erect the Fence"
+    "link": "https://leetcode.com/problems/erect-the-fence/"
   },
   "588": {
+    "id": 588,
     "category": "Trie",
+    "title": "Design In-Memory File System",
     "difficulty": "Hard",
-    "id": 588,
-    "link": "https://leetcode.com/problems/design-in-memory-file-system/",
-    "title": "Design In-Memory File System"
+    "link": "https://leetcode.com/problems/design-in-memory-file-system/"
   },
   "589": {
+    "id": 589,
     "category": "Tree",
+    "title": "N-ary Tree Preorder Traversal",
     "difficulty": "Easy",
-    "id": 589,
-    "link": "https://leetcode.com/problems/n-ary-tree-preorder-traversal/",
-    "title": "N-ary Tree Preorder Traversal"
+    "link": "https://leetcode.com/problems/n-ary-tree-preorder-traversal/"
   },
   "590": {
+    "id": 590,
     "category": "Tree",
+    "title": "N-ary Tree Postorder Traversal",
     "difficulty": "Easy",
-    "id": 590,
-    "link": "https://leetcode.com/problems/n-ary-tree-postorder-traversal/",
-    "title": "N-ary Tree Postorder Traversal"
+    "link": "https://leetcode.com/problems/n-ary-tree-postorder-traversal/"
+  },
+  "591": {
+    "id": 591,
+    "category": "Stack",
+    "title": "Tag Validator",
+    "difficulty": "Hard",
+    "link": "https://leetcode.com/problems/tag-validator/"
   },
-  "591": {"category": "Stack", "difficulty": "Hard", "id": 591, "link": "https://leetcode.com/problems/tag-validator/", "title": "Tag Validator"},
   "592": {
+    "id": 592,
     "category": "Math & Geometry",
+    "title": "Fraction Addition and Subtraction",
     "difficulty": "Medium",
-    "id": 592,
-    "link": "https://leetcode.com/problems/fraction-addition-and-subtraction/",
-    "title": "Fraction Addition and Subtraction"
+    "link": "https://leetcode.com/problems/fraction-addition-and-subtraction/"
   },
   "593": {
+    "id": 593,
     "category": "Math & Geometry",
+    "title": "Valid Square",
     "difficulty": "Medium",
-    "id": 593,
-    "link": "https://leetcode.com/problems/valid-square/",
-    "title": "Valid Square"
+    "link": "https://leetcode.com/problems/valid-square/"
   },
   "594": {
+    "id": 594,
     "category": "Sliding Window",
+    "title": "Longest Harmonious Subsequence",
     "difficulty": "Easy",
-    "id": 594,
-    "link": "https://leetcode.com/problems/longest-harmonious-subsequence/",
-    "title": "Longest Harmonious Subsequence"
+    "link": "https://leetcode.com/problems/longest-harmonious-subsequence/"
   },
-  "595": {"category": "Database", "difficulty": "Easy", "id": 595, "link": "https://leetcode.com/problems/big-countries/", "title": "Big Countries"},
-  "596": {
+  "595": {
+    "id": 595,
     "category": "Database",
+    "title": "Big Countries",
     "difficulty": "Easy",
+    "link": "https://leetcode.com/problems/big-countries/"
+  },
+  "596": {
     "id": 596,
-    "link": "https://leetcode.com/problems/classes-with-at-least-5-students/",
-    "title": "Classes With at Least 5 Students"
+    "category": "Database",
+    "title": "Classes With at Least 5 Students",
+    "difficulty": "Easy",
+    "link": "https://leetcode.com/problems/classes-with-at-least-5-students/"
   },
   "597": {
+    "id": 597,
     "category": "Database",
+    "title": "Friend Requests I: Overall Acceptance Rate",
     "difficulty": "Easy",
-    "id": 597,
-    "link": "https://leetcode.com/problems/friend-requests-i-overall-acceptance-rate/",
-    "title": "Friend Requests I: Overall Acceptance Rate"
+    "link": "https://leetcode.com/problems/friend-requests-i-overall-acceptance-rate/"
   },
   "598": {
+    "id": 598,
     "category": "Math & Geometry",
+    "title": "Range Addition II",
     "difficulty": "Easy",
-    "id": 598,
-    "link": "https://leetcode.com/problems/range-addition-ii/",
-    "title": "Range Addition II"
+    "link": "https://leetcode.com/problems/range-addition-ii/"
   },
   "599": {
+    "id": 599,
     "category": "Array & Hashing",
+    "title": "Minimum Index Sum of Two Lists",
     "difficulty": "Easy",
-    "id": 599,
-    "link": "https://leetcode.com/problems/minimum-index-sum-of-two-lists/",
-    "title": "Minimum Index Sum of Two Lists"
+    "link": "https://leetcode.com/problems/minimum-index-sum-of-two-lists/"
   },
   "600": {
+    "id": 600,
     "category": "Dynamic Programming",
+    "title": "Non-negative Integers without Consecutive Ones",
     "difficulty": "Hard",
-    "id": 600,
-    "link": "https://leetcode.com/problems/non-negative-integers-without-consecutive-ones/",
-    "title": "Non-negative Integers without Consecutive Ones"
+    "link": "https://leetcode.com/problems/non-negative-integers-without-consecutive-ones/"
   },
   "601": {
+    "id": 601,
     "category": "Database",
+    "title": "Human Traffic of Stadium",
     "difficulty": "Hard",
-    "id": 601,
-    "link": "https://leetcode.com/problems/human-traffic-of-stadium/",
-    "title": "Human Traffic of Stadium"
+    "link": "https://leetcode.com/problems/human-traffic-of-stadium/"
   },
   "602": {
+    "id": 602,
     "category": "Database",
+    "title": "Friend Requests II: Who Has the Most Friends",
     "difficulty": "Medium",
-    "id": 602,
-    "link": "https://leetcode.com/problems/friend-requests-ii-who-has-the-most-friends/",
-    "title": "Friend Requests II: Who Has the Most Friends"
+    "link": "https://leetcode.com/problems/friend-requests-ii-who-has-the-most-friends/"
   },
   "603": {
+    "id": 603,
     "category": "Database",
+    "title": "Consecutive Available Seats",
     "difficulty": "Easy",
-    "id": 603,
-    "link": "https://leetcode.com/problems/consecutive-available-seats/",
-    "title": "Consecutive Available Seats"
+    "link": "https://leetcode.com/problems/consecutive-available-seats/"
   },
   "604": {
+    "id": 604,
     "category": "Array & Hashing",
+    "title": "Design Compressed String Iterator",
     "difficulty": "Easy",
-    "id": 604,
-    "link": "https://leetcode.com/problems/design-compressed-string-iterator/",
-    "title": "Design Compressed String Iterator"
+    "link": "https://leetcode.com/problems/design-compressed-string-iterator/"
   },
   "605": {
+    "id": 605,
     "category": "Greedy",
+    "title": "Can Place Flowers",
     "difficulty": "Easy",
-    "id": 605,
-    "link": "https://leetcode.com/problems/can-place-flowers/",
-    "title": "Can Place Flowers"
+    "link": "https://leetcode.com/problems/can-place-flowers/"
   },
   "606": {
+    "id": 606,
     "category": "Tree",
+    "title": "Construct String from Binary Tree",
     "difficulty": "Medium",
-    "id": 606,
-    "link": "https://leetcode.com/problems/construct-string-from-binary-tree/",
-    "title": "Construct String from Binary Tree"
+    "link": "https://leetcode.com/problems/construct-string-from-binary-tree/"
+  },
+  "607": {
+    "id": 607,
+    "category": "Database",
+    "title": "Sales Person",
+    "difficulty": "Easy",
+    "link": "https://leetcode.com/problems/sales-person/"
+  },
+  "608": {
+    "id": 608,
+    "category": "Database",
+    "title": "Tree Node",
+    "difficulty": "Medium",
+    "link": "https://leetcode.com/problems/tree-node/"
   },
-  "607": {"category": "Database", "difficulty": "Easy", "id": 607, "link": "https://leetcode.com/problems/sales-person/", "title": "Sales Person"},
-  "608": {"category": "Database", "difficulty": "Medium", "id": 608, "link": "https://leetcode.com/problems/tree-node/", "title": "Tree Node"},
   "609": {
+    "id": 609,
     "category": "Array & Hashing",
+    "title": "Find Duplicate File in System",
     "difficulty": "Medium",
-    "id": 609,
-    "link": "https://leetcode.com/problems/find-duplicate-file-in-system/",
-    "title": "Find Duplicate File in System"
+    "link": "https://leetcode.com/problems/find-duplicate-file-in-system/"
   },
   "610": {
+    "id": 610,
     "category": "Database",
+    "title": "Triangle Judgement",
     "difficulty": "Easy",
-    "id": 610,
-    "link": "https://leetcode.com/problems/triangle-judgement/",
-    "title": "Triangle Judgement"
+    "link": "https://leetcode.com/problems/triangle-judgement/"
   },
   "611": {
+    "id": 611,
     "category": "Binary Search",
+    "title": "Valid Triangle Number",
     "difficulty": "Medium",
-    "id": 611,
-    "link": "https://leetcode.com/problems/valid-triangle-number/",
-    "title": "Valid Triangle Number"
+    "link": "https://leetcode.com/problems/valid-triangle-number/"
   },
   "612": {
+    "id": 612,
     "category": "Database",
+    "title": "Shortest Distance in a Plane",
     "difficulty": "Medium",
-    "id": 612,
-    "link": "https://leetcode.com/problems/shortest-distance-in-a-plane/",
-    "title": "Shortest Distance in a Plane"
+    "link": "https://leetcode.com/problems/shortest-distance-in-a-plane/"
   },
   "613": {
+    "id": 613,
     "category": "Database",
+    "title": "Shortest Distance in a Line",
     "difficulty": "Easy",
-    "id": 613,
-    "link": "https://leetcode.com/problems/shortest-distance-in-a-line/",
-    "title": "Shortest Distance in a Line"
+    "link": "https://leetcode.com/problems/shortest-distance-in-a-line/"
   },
   "614": {
+    "id": 614,
     "category": "Database",
+    "title": "Second Degree Follower",
     "difficulty": "Medium",
-    "id": 614,
-    "link": "https://leetcode.com/problems/second-degree-follower/",
-    "title": "Second Degree Follower"
+    "link": "https://leetcode.com/problems/second-degree-follower/"
   },
   "615": {
+    "id": 615,
     "category": "Database",
+    "title": "Average Salary: Departments VS Company",
     "difficulty": "Hard",
-    "id": 615,
-    "link": "https://leetcode.com/problems/average-salary-departments-vs-company/",
-    "title": "Average Salary: Departments VS Company"
+    "link": "https://leetcode.com/problems/average-salary-departments-vs-company/"
   },
   "616": {
+    "id": 616,
     "category": "Trie",
+    "title": "Add Bold Tag in String",
     "difficulty": "Medium",
-    "id": 616,
-    "link": "https://leetcode.com/problems/add-bold-tag-in-string/",
-    "title": "Add Bold Tag in String"
+    "link": "https://leetcode.com/problems/add-bold-tag-in-string/"
   },
   "617": {
+    "id": 617,
     "category": "Tree",
+    "title": "Merge Two Binary Trees",
     "difficulty": "Easy",
-    "id": 617,
-    "link": "https://leetcode.com/problems/merge-two-binary-trees/",
-    "title": "Merge Two Binary Trees"
+    "link": "https://leetcode.com/problems/merge-two-binary-trees/"
   },
   "618": {
+    "id": 618,
     "category": "Database",
+    "title": "Students Report By Geography",
     "difficulty": "Hard",
-    "id": 618,
-    "link": "https://leetcode.com/problems/students-report-by-geography/",
-    "title": "Students Report By Geography"
+    "link": "https://leetcode.com/problems/students-report-by-geography/"
   },
   "619": {
+    "id": 619,
     "category": "Database",
+    "title": "Biggest Single Number",
     "difficulty": "Easy",
-    "id": 619,
-    "link": "https://leetcode.com/problems/biggest-single-number/",
-    "title": "Biggest Single Number"
+    "link": "https://leetcode.com/problems/biggest-single-number/"
   },
   "620": {
+    "id": 620,
     "category": "Database",
+    "title": "Not Boring Movies",
     "difficulty": "Easy",
-    "id": 620,
-    "link": "https://leetcode.com/problems/not-boring-movies/",
-    "title": "Not Boring Movies"
+    "link": "https://leetcode.com/problems/not-boring-movies/"
   },
   "621": {
+    "id": 621,
     "category": "Heap (Priority Queue)",
+    "title": "Task Scheduler",
     "difficulty": "Medium",
-    "id": 621,
-    "link": "https://leetcode.com/problems/task-scheduler/",
-    "title": "Task Scheduler"
+    "link": "https://leetcode.com/problems/task-scheduler/"
   },
   "622": {
+    "id": 622,
     "category": "Linked List",
+    "title": "Design Circular Queue",
     "difficulty": "Medium",
-    "id": 622,
-    "link": "https://leetcode.com/problems/design-circular-queue/",
-    "title": "Design Circular Queue"
+    "link": "https://leetcode.com/problems/design-circular-queue/"
   },
   "623": {
+    "id": 623,
     "category": "Tree",
+    "title": "Add One Row to Tree",
     "difficulty": "Medium",
-    "id": 623,
-    "link": "https://leetcode.com/problems/add-one-row-to-tree/",
-    "title": "Add One Row to Tree"
+    "link": "https://leetcode.com/problems/add-one-row-to-tree/"
   },
   "624": {
+    "id": 624,
     "category": "Greedy",
+    "title": "Maximum Distance in Arrays",
     "difficulty": "Medium",
-    "id": 624,
-    "link": "https://leetcode.com/problems/maximum-distance-in-arrays/",
-    "title": "Maximum Distance in Arrays"
+    "link": "https://leetcode.com/problems/maximum-distance-in-arrays/"
   },
   "625": {
+    "id": 625,
     "category": "Greedy",
+    "title": "Minimum Factorization",
     "difficulty": "Medium",
-    "id": 625,
-    "link": "https://leetcode.com/problems/minimum-factorization/",
-    "title": "Minimum Factorization"
+    "link": "https://leetcode.com/problems/minimum-factorization/"
   },
   "626": {
+    "id": 626,
     "category": "Database",
+    "title": "Exchange Seats",
     "difficulty": "Medium",
-    "id": 626,
-    "link": "https://leetcode.com/problems/exchange-seats/",
-    "title": "Exchange Seats"
+    "link": "https://leetcode.com/problems/exchange-seats/"
   },
   "627": {
+    "id": 627,
     "category": "Database",
+    "title": "Swap Sex of Employees",
     "difficulty": "Easy",
-    "id": 627,
-    "link": "https://leetcode.com/problems/swap-sex-of-employees/",
-    "title": "Swap Sex of Employees"
+    "link": "https://leetcode.com/problems/swap-sex-of-employees/"
   },
   "628": {
+    "id": 628,
     "category": "Math & Geometry",
+    "title": "Maximum Product of Three Numbers",
     "difficulty": "Easy",
-    "id": 628,
-    "link": "https://leetcode.com/problems/maximum-product-of-three-numbers/",
-    "title": "Maximum Product of Three Numbers"
+    "link": "https://leetcode.com/problems/maximum-product-of-three-numbers/"
   },
   "629": {
+    "id": 629,
     "category": "Dynamic Programming",
+    "title": "K Inverse Pairs Array",
     "difficulty": "Hard",
-    "id": 629,
-    "link": "https://leetcode.com/problems/k-inverse-pairs-array/",
-    "title": "K Inverse Pairs Array"
+    "link": "https://leetcode.com/problems/k-inverse-pairs-array/"
   },
   "630": {
+    "id": 630,
     "category": "Heap (Priority Queue)",
+    "title": "Course Schedule III",
     "difficulty": "Hard",
-    "id": 630,
-    "link": "https://leetcode.com/problems/course-schedule-iii/",
-    "title": "Course Schedule III"
+    "link": "https://leetcode.com/problems/course-schedule-iii/"
   },
   "631": {
+    "id": 631,
     "category": "Graph Traversal",
+    "title": "Design Excel Sum Formula",
     "difficulty": "Hard",
-    "id": 631,
-    "link": "https://leetcode.com/problems/design-excel-sum-formula/",
-    "title": "Design Excel Sum Formula"
+    "link": "https://leetcode.com/problems/design-excel-sum-formula/"
   },
   "632": {
+    "id": 632,
     "category": "Sliding Window",
+    "title": "Smallest Range Covering Elements from K Lists",
     "difficulty": "Hard",
-    "id": 632,
-    "link": "https://leetcode.com/problems/smallest-range-covering-elements-from-k-lists/",
-    "title": "Smallest Range Covering Elements from K Lists"
+    "link": "https://leetcode.com/problems/smallest-range-covering-elements-from-k-lists/"
   },
   "633": {
+    "id": 633,
     "category": "Binary Search",
+    "title": "Sum of Square Numbers",
     "difficulty": "Medium",
-    "id": 633,
-    "link": "https://leetcode.com/problems/sum-of-square-numbers/",
-    "title": "Sum of Square Numbers"
+    "link": "https://leetcode.com/problems/sum-of-square-numbers/"
   },
   "634": {
+    "id": 634,
     "category": "Dynamic Programming",
+    "title": "Find the Derangement of An Array",
     "difficulty": "Medium",
-    "id": 634,
-    "link": "https://leetcode.com/problems/find-the-derangement-of-an-array/",
-    "title": "Find the Derangement of An Array"
+    "link": "https://leetcode.com/problems/find-the-derangement-of-an-array/"
   },
   "635": {
+    "id": 635,
     "category": "Array & Hashing",
+    "title": "Design Log Storage System",
     "difficulty": "Medium",
-    "id": 635,
-    "link": "https://leetcode.com/problems/design-log-storage-system/",
-    "title": "Design Log Storage System"
+    "link": "https://leetcode.com/problems/design-log-storage-system/"
   },
   "636": {
+    "id": 636,
     "category": "Stack",
+    "title": "Exclusive Time of Functions",
     "difficulty": "Medium",
-    "id": 636,
-    "link": "https://leetcode.com/problems/exclusive-time-of-functions/",
-    "title": "Exclusive Time of Functions"
+    "link": "https://leetcode.com/problems/exclusive-time-of-functions/"
   },
   "637": {
+    "id": 637,
     "category": "Tree",
+    "title": "Average of Levels in Binary Tree",
     "difficulty": "Easy",
-    "id": 637,
-    "link": "https://leetcode.com/problems/average-of-levels-in-binary-tree/",
-    "title": "Average of Levels in Binary Tree"
+    "link": "https://leetcode.com/problems/average-of-levels-in-binary-tree/"
   },
   "638": {
+    "id": 638,
     "category": "Dynamic Programming",
+    "title": "Shopping Offers",
     "difficulty": "Medium",
-    "id": 638,
-    "link": "https://leetcode.com/problems/shopping-offers/",
-    "title": "Shopping Offers"
+    "link": "https://leetcode.com/problems/shopping-offers/"
   },
   "639": {
+    "id": 639,
     "category": "Dynamic Programming",
+    "title": "Decode Ways II",
     "difficulty": "Hard",
-    "id": 639,
-    "link": "https://leetcode.com/problems/decode-ways-ii/",
-    "title": "Decode Ways II"
+    "link": "https://leetcode.com/problems/decode-ways-ii/"
   },
   "640": {
+    "id": 640,
     "category": "Math & Geometry",
+    "title": "Solve the Equation",
     "difficulty": "Medium",
-    "id": 640,
-    "link": "https://leetcode.com/problems/solve-the-equation/",
-    "title": "Solve the Equation"
+    "link": "https://leetcode.com/problems/solve-the-equation/"
   },
   "641": {
+    "id": 641,
     "category": "Linked List",
+    "title": "Design Circular Deque",
     "difficulty": "Medium",
-    "id": 641,
-    "link": "https://leetcode.com/problems/design-circular-deque/",
-    "title": "Design Circular Deque"
+    "link": "https://leetcode.com/problems/design-circular-deque/"
   },
   "642": {
+    "id": 642,
     "category": "Graph Traversal",
+    "title": "Design Search Autocomplete System",
     "difficulty": "Hard",
-    "id": 642,
-    "link": "https://leetcode.com/problems/design-search-autocomplete-system/",
-    "title": "Design Search Autocomplete System"
+    "link": "https://leetcode.com/problems/design-search-autocomplete-system/"
   },
   "643": {
+    "id": 643,
     "category": "Sliding Window",
+    "title": "Maximum Average Subarray I",
     "difficulty": "Easy",
-    "id": 643,
-    "link": "https://leetcode.com/problems/maximum-average-subarray-i/",
-    "title": "Maximum Average Subarray I"
+    "link": "https://leetcode.com/problems/maximum-average-subarray-i/"
   },
   "644": {
+    "id": 644,
     "category": "Binary Search",
+    "title": "Maximum Average Subarray II",
     "difficulty": "Hard",
-    "id": 644,
-    "link": "https://leetcode.com/problems/maximum-average-subarray-ii/",
-    "title": "Maximum Average Subarray II"
+    "link": "https://leetcode.com/problems/maximum-average-subarray-ii/"
   },
   "645": {
+    "id": 645,
     "category": "Bit Manipulation",
+    "title": "Set Mismatch",
     "difficulty": "Easy",
-    "id": 645,
-    "link": "https://leetcode.com/problems/set-mismatch/",
-    "title": "Set Mismatch"
+    "link": "https://leetcode.com/problems/set-mismatch/"
   },
   "646": {
+    "id": 646,
     "category": "Dynamic Programming",
+    "title": "Maximum Length of Pair Chain",
     "difficulty": "Medium",
-    "id": 646,
-    "link": "https://leetcode.com/problems/maximum-length-of-pair-chain/",
-    "title": "Maximum Length of Pair Chain"
+    "link": "https://leetcode.com/problems/maximum-length-of-pair-chain/"
   },
   "647": {
+    "id": 647,
     "category": "Dynamic Programming",
+    "title": "Palindromic Substrings",
     "difficulty": "Medium",
-    "id": 647,
-    "link": "https://leetcode.com/problems/palindromic-substrings/",
-    "title": "Palindromic Substrings"
+    "link": "https://leetcode.com/problems/palindromic-substrings/"
+  },
+  "648": {
+    "id": 648,
+    "category": "Trie",
+    "title": "Replace Words",
+    "difficulty": "Medium",
+    "link": "https://leetcode.com/problems/replace-words/"
+  },
+  "649": {
+    "id": 649,
+    "category": "Greedy",
+    "title": "Dota2 Senate",
+    "difficulty": "Medium",
+    "link": "https://leetcode.com/problems/dota2-senate/"
   },
-  "648": {"category": "Trie", "difficulty": "Medium", "id": 648, "link": "https://leetcode.com/problems/replace-words/", "title": "Replace Words"},
-  "649": {"category": "Greedy", "difficulty": "Medium", "id": 649, "link": "https://leetcode.com/problems/dota2-senate/", "title": "Dota2 Senate"},
   "650": {
+    "id": 650,
     "category": "Dynamic Programming",
+    "title": "2 Keys Keyboard",
     "difficulty": "Medium",
-    "id": 650,
-    "link": "https://leetcode.com/problems/2-keys-keyboard/",
-    "title": "2 Keys Keyboard"
+    "link": "https://leetcode.com/problems/2-keys-keyboard/"
   },
   "651": {
+    "id": 651,
     "category": "Dynamic Programming",
+    "title": "4 Keys Keyboard",
     "difficulty": "Medium",
-    "id": 651,
-    "link": "https://leetcode.com/problems/4-keys-keyboard/",
-    "title": "4 Keys Keyboard"
+    "link": "https://leetcode.com/problems/4-keys-keyboard/"
   },
   "652": {
+    "id": 652,
     "category": "Tree",
+    "title": "Find Duplicate Subtrees",
     "difficulty": "Medium",
-    "id": 652,
-    "link": "https://leetcode.com/problems/find-duplicate-subtrees/",
-    "title": "Find Duplicate Subtrees"
+    "link": "https://leetcode.com/problems/find-duplicate-subtrees/"
   },
   "653": {
+    "id": 653,
     "category": "Tree",
+    "title": "Two Sum IV - Input is a BST",
     "difficulty": "Easy",
-    "id": 653,
-    "link": "https://leetcode.com/problems/two-sum-iv-input-is-a-bst/",
-    "title": "Two Sum IV - Input is a BST"
+    "link": "https://leetcode.com/problems/two-sum-iv-input-is-a-bst/"
   },
   "654": {
+    "id": 654,
     "category": "Tree",
+    "title": "Maximum Binary Tree",
     "difficulty": "Medium",
-    "id": 654,
-    "link": "https://leetcode.com/problems/maximum-binary-tree/",
-    "title": "Maximum Binary Tree"
+    "link": "https://leetcode.com/problems/maximum-binary-tree/"
   },
   "655": {
+    "id": 655,
     "category": "Tree",
+    "title": "Print Binary Tree",
     "difficulty": "Medium",
-    "id": 655,
-    "link": "https://leetcode.com/problems/print-binary-tree/",
-    "title": "Print Binary Tree"
+    "link": "https://leetcode.com/problems/print-binary-tree/"
   },
   "656": {
+    "id": 656,
     "category": "Dynamic Programming",
+    "title": "Coin Path",
     "difficulty": "Hard",
-    "id": 656,
-    "link": "https://leetcode.com/problems/coin-path/",
-    "title": "Coin Path"
+    "link": "https://leetcode.com/problems/coin-path/"
   },
   "657": {
+    "id": 657,
     "category": "Array & Hashing",
+    "title": "Robot Return to Origin",
     "difficulty": "Easy",
-    "id": 657,
-    "link": "https://leetcode.com/problems/robot-return-to-origin/",
-    "title": "Robot Return to Origin"
+    "link": "https://leetcode.com/problems/robot-return-to-origin/"
   },
   "658": {
+    "id": 658,
     "category": "Sliding Window",
+    "title": "Find K Closest Elements",
     "difficulty": "Medium",
-    "id": 658,
-    "link": "https://leetcode.com/problems/find-k-closest-elements/",
-    "title": "Find K Closest Elements"
+    "link": "https://leetcode.com/problems/find-k-closest-elements/"
   },
   "659": {
+    "id": 659,
     "category": "Heap (Priority Queue)",
+    "title": "Split Array into Consecutive Subsequences",
     "difficulty": "Medium",
-    "id": 659,
-    "link": "https://leetcode.com/problems/split-array-into-consecutive-subsequences/",
-    "title": "Split Array into Consecutive Subsequences"
+    "link": "https://leetcode.com/problems/split-array-into-consecutive-subsequences/"
+  },
+  "660": {
+    "id": 660,
+    "category": "Math & Geometry",
+    "title": "Remove 9",
+    "difficulty": "Hard",
+    "link": "https://leetcode.com/problems/remove-9/"
   },
-  "660": {"category": "Math & Geometry", "difficulty": "Hard", "id": 660, "link": "https://leetcode.com/problems/remove-9/", "title": "Remove 9"},
   "661": {
+    "id": 661,
     "category": "Array & Hashing",
+    "title": "Image Smoother",
     "difficulty": "Easy",
-    "id": 661,
-    "link": "https://leetcode.com/problems/image-smoother/",
-    "title": "Image Smoother"
+    "link": "https://leetcode.com/problems/image-smoother/"
   },
   "662": {
+    "id": 662,
     "category": "Tree",
+    "title": "Maximum Width of Binary Tree",
     "difficulty": "Medium",
-    "id": 662,
-    "link": "https://leetcode.com/problems/maximum-width-of-binary-tree/",
-    "title": "Maximum Width of Binary Tree"
+    "link": "https://leetcode.com/problems/maximum-width-of-binary-tree/"
   },
   "663": {
+    "id": 663,
     "category": "Tree",
+    "title": "Equal Tree Partition",
     "difficulty": "Medium",
-    "id": 663,
-    "link": "https://leetcode.com/problems/equal-tree-partition/",
-    "title": "Equal Tree Partition"
+    "link": "https://leetcode.com/problems/equal-tree-partition/"
   },
   "664": {
+    "id": 664,
     "category": "Dynamic Programming",
+    "title": "Strange Printer",
     "difficulty": "Hard",
-    "id": 664,
-    "link": "https://leetcode.com/problems/strange-printer/",
-    "title": "Strange Printer"
+    "link": "https://leetcode.com/problems/strange-printer/"
   },
   "665": {
+    "id": 665,
     "category": "Array & Hashing",
+    "title": "Non-decreasing Array",
     "difficulty": "Medium",
-    "id": 665,
-    "link": "https://leetcode.com/problems/non-decreasing-array/",
-    "title": "Non-decreasing Array"
+    "link": "https://leetcode.com/problems/non-decreasing-array/"
+  },
+  "666": {
+    "id": 666,
+    "category": "Tree",
+    "title": "Path Sum IV",
+    "difficulty": "Medium",
+    "link": "https://leetcode.com/problems/path-sum-iv/"
   },
-  "666": {"category": "Tree", "difficulty": "Medium", "id": 666, "link": "https://leetcode.com/problems/path-sum-iv/", "title": "Path Sum IV"},
   "667": {
+    "id": 667,
     "category": "Math & Geometry",
+    "title": "Beautiful Arrangement II",
     "difficulty": "Medium",
-    "id": 667,
-    "link": "https://leetcode.com/problems/beautiful-arrangement-ii/",
-    "title": "Beautiful Arrangement II"
+    "link": "https://leetcode.com/problems/beautiful-arrangement-ii/"
   },
   "668": {
+    "id": 668,
     "category": "Binary Search",
+    "title": "Kth Smallest Number in Multiplication Table",
     "difficulty": "Hard",
-    "id": 668,
-    "link": "https://leetcode.com/problems/kth-smallest-number-in-multiplication-table/",
-    "title": "Kth Smallest Number in Multiplication Table"
+    "link": "https://leetcode.com/problems/kth-smallest-number-in-multiplication-table/"
   },
   "669": {
+    "id": 669,
     "category": "Tree",
+    "title": "Trim a Binary Search Tree",
     "difficulty": "Medium",
-    "id": 669,
-    "link": "https://leetcode.com/problems/trim-a-binary-search-tree/",
-    "title": "Trim a Binary Search Tree"
+    "link": "https://leetcode.com/problems/trim-a-binary-search-tree/"
+  },
+  "670": {
+    "id": 670,
+    "category": "Greedy",
+    "title": "Maximum Swap",
+    "difficulty": "Medium",
+    "link": "https://leetcode.com/problems/maximum-swap/"
   },
-  "670": {"category": "Greedy", "difficulty": "Medium", "id": 670, "link": "https://leetcode.com/problems/maximum-swap/", "title": "Maximum Swap"},
   "671": {
+    "id": 671,
     "category": "Tree",
+    "title": "Second Minimum Node In a Binary Tree",
     "difficulty": "Easy",
-    "id": 671,
-    "link": "https://leetcode.com/problems/second-minimum-node-in-a-binary-tree/",
-    "title": "Second Minimum Node In a Binary Tree"
+    "link": "https://leetcode.com/problems/second-minimum-node-in-a-binary-tree/"
   },
   "672": {
+    "id": 672,
     "category": "Graph Traversal",
+    "title": "Bulb Switcher II",
     "difficulty": "Medium",
-    "id": 672,
-    "link": "https://leetcode.com/problems/bulb-switcher-ii/",
-    "title": "Bulb Switcher II"
+    "link": "https://leetcode.com/problems/bulb-switcher-ii/"
   },
   "673": {
+    "id": 673,
     "category": "Tree",
+    "title": "Number of Longest Increasing Subsequence",
     "difficulty": "Medium",
-    "id": 673,
-    "link": "https://leetcode.com/problems/number-of-longest-increasing-subsequence/",
-    "title": "Number of Longest Increasing Subsequence"
+    "link": "https://leetcode.com/problems/number-of-longest-increasing-subsequence/"
   },
   "674": {
+    "id": 674,
     "category": "Array & Hashing",
+    "title": "Longest Continuous Increasing Subsequence",
     "difficulty": "Easy",
-    "id": 674,
-    "link": "https://leetcode.com/problems/longest-continuous-increasing-subsequence/",
-    "title": "Longest Continuous Increasing Subsequence"
+    "link": "https://leetcode.com/problems/longest-continuous-increasing-subsequence/"
   },
   "675": {
+    "id": 675,
     "category": "Graph Traversal",
+    "title": "Cut Off Trees for Golf Event",
     "difficulty": "Hard",
-    "id": 675,
-    "link": "https://leetcode.com/problems/cut-off-trees-for-golf-event/",
-    "title": "Cut Off Trees for Golf Event"
+    "link": "https://leetcode.com/problems/cut-off-trees-for-golf-event/"
   },
   "676": {
+    "id": 676,
     "category": "Graph Traversal",
+    "title": "Implement Magic Dictionary",
     "difficulty": "Medium",
-    "id": 676,
-    "link": "https://leetcode.com/problems/implement-magic-dictionary/",
-    "title": "Implement Magic Dictionary"
+    "link": "https://leetcode.com/problems/implement-magic-dictionary/"
+  },
+  "677": {
+    "id": 677,
+    "category": "Trie",
+    "title": "Map Sum Pairs",
+    "difficulty": "Medium",
+    "link": "https://leetcode.com/problems/map-sum-pairs/"
   },
-  "677": {"category": "Trie", "difficulty": "Medium", "id": 677, "link": "https://leetcode.com/problems/map-sum-pairs/", "title": "Map Sum Pairs"},
   "678": {
+    "id": 678,
     "category": "Dynamic Programming",
+    "title": "Valid Parenthesis String",
     "difficulty": "Medium",
-    "id": 678,
-    "link": "https://leetcode.com/problems/valid-parenthesis-string/",
-    "title": "Valid Parenthesis String"
+    "link": "https://leetcode.com/problems/valid-parenthesis-string/"
+  },
+  "679": {
+    "id": 679,
+    "category": "Backtracking",
+    "title": "24 Game",
+    "difficulty": "Hard",
+    "link": "https://leetcode.com/problems/24-game/"
   },
-  "679": {"category": "Backtracking", "difficulty": "Hard", "id": 679, "link": "https://leetcode.com/problems/24-game/", "title": "24 Game"},
   "680": {
+    "id": 680,
     "category": "Greedy",
+    "title": "Valid Palindrome II",
     "difficulty": "Easy",
-    "id": 680,
-    "link": "https://leetcode.com/problems/valid-palindrome-ii/",
-    "title": "Valid Palindrome II"
+    "link": "https://leetcode.com/problems/valid-palindrome-ii/"
   },
   "681": {
+    "id": 681,
     "category": "Backtracking",
+    "title": "Next Closest Time",
     "difficulty": "Medium",
-    "id": 681,
-    "link": "https://leetcode.com/problems/next-closest-time/",
-    "title": "Next Closest Time"
+    "link": "https://leetcode.com/problems/next-closest-time/"
+  },
+  "682": {
+    "id": 682,
+    "category": "Stack",
+    "title": "Baseball Game",
+    "difficulty": "Easy",
+    "link": "https://leetcode.com/problems/baseball-game/"
+  },
+  "683": {
+    "id": 683,
+    "category": "Tree",
+    "title": "K Empty Slots",
+    "difficulty": "Hard",
+    "link": "https://leetcode.com/problems/k-empty-slots/"
   },
-  "682": {"category": "Stack", "difficulty": "Easy", "id": 682, "link": "https://leetcode.com/problems/baseball-game/", "title": "Baseball Game"},
-  "683": {"category": "Tree", "difficulty": "Hard", "id": 683, "link": "https://leetcode.com/problems/k-empty-slots/", "title": "K Empty Slots"},
   "684": {
+    "id": 684,
     "category": "Graph Traversal",
+    "title": "Redundant Connection",
     "difficulty": "Medium",
-    "id": 684,
-    "link": "https://leetcode.com/problems/redundant-connection/",
-    "title": "Redundant Connection"
+    "link": "https://leetcode.com/problems/redundant-connection/"
   },
   "685": {
+    "id": 685,
     "category": "Graph Traversal",
+    "title": "Redundant Connection II",
     "difficulty": "Hard",
-    "id": 685,
-    "link": "https://leetcode.com/problems/redundant-connection-ii/",
-    "title": "Redundant Connection II"
+    "link": "https://leetcode.com/problems/redundant-connection-ii/"
   },
   "686": {
+    "id": 686,
     "category": "Array & Hashing",
+    "title": "Repeated String Match",
     "difficulty": "Medium",
-    "id": 686,
-    "link": "https://leetcode.com/problems/repeated-string-match/",
-    "title": "Repeated String Match"
+    "link": "https://leetcode.com/problems/repeated-string-match/"
   },
   "687": {
+    "id": 687,
     "category": "Tree",
+    "title": "Longest Univalue Path",
     "difficulty": "Medium",
-    "id": 687,
-    "link": "https://leetcode.com/problems/longest-univalue-path/",
-    "title": "Longest Univalue Path"
+    "link": "https://leetcode.com/problems/longest-univalue-path/"
   },
   "688": {
+    "id": 688,
     "category": "Dynamic Programming",
+    "title": "Knight Probability in Chessboard",
     "difficulty": "Medium",
-    "id": 688,
-    "link": "https://leetcode.com/problems/knight-probability-in-chessboard/",
-    "title": "Knight Probability in Chessboard"
+    "link": "https://leetcode.com/problems/knight-probability-in-chessboard/"
   },
   "689": {
+    "id": 689,
     "category": "Dynamic Programming",
+    "title": "Maximum Sum of 3 Non-Overlapping Subarrays",
     "difficulty": "Hard",
-    "id": 689,
-    "link": "https://leetcode.com/problems/maximum-sum-of-3-non-overlapping-subarrays/",
-    "title": "Maximum Sum of 3 Non-Overlapping Subarrays"
+    "link": "https://leetcode.com/problems/maximum-sum-of-3-non-overlapping-subarrays/"
   },
   "690": {
+    "id": 690,
     "category": "Tree",
+    "title": "Employee Importance",
     "difficulty": "Medium",
-    "id": 690,
-    "link": "https://leetcode.com/problems/employee-importance/",
-    "title": "Employee Importance"
+    "link": "https://leetcode.com/problems/employee-importance/"
   },
   "691": {
+    "id": 691,
     "category": "Dynamic Programming",
+    "title": "Stickers to Spell Word",
     "difficulty": "Hard",
-    "id": 691,
-    "link": "https://leetcode.com/problems/stickers-to-spell-word/",
-    "title": "Stickers to Spell Word"
+    "link": "https://leetcode.com/problems/stickers-to-spell-word/"
   },
   "692": {
+    "id": 692,
     "category": "Heap (Priority Queue)",
+    "title": "Top K Frequent Words",
     "difficulty": "Medium",
-    "id": 692,
-    "link": "https://leetcode.com/problems/top-k-frequent-words/",
-    "title": "Top K Frequent Words"
+    "link": "https://leetcode.com/problems/top-k-frequent-words/"
   },
   "693": {
+    "id": 693,
     "category": "Bit Manipulation",
+    "title": "Binary Number with Alternating Bits",
     "difficulty": "Easy",
-    "id": 693,
-    "link": "https://leetcode.com/problems/binary-number-with-alternating-bits/",
-    "title": "Binary Number with Alternating Bits"
+    "link": "https://leetcode.com/problems/binary-number-with-alternating-bits/"
   },
   "694": {
+    "id": 694,
     "category": "Graph Traversal",
+    "title": "Number of Distinct Islands",
     "difficulty": "Medium",
-    "id": 694,
-    "link": "https://leetcode.com/problems/number-of-distinct-islands/",
-    "title": "Number of Distinct Islands"
+    "link": "https://leetcode.com/problems/number-of-distinct-islands/"
   },
   "695": {
+    "id": 695,
     "category": "Graph Traversal",
+    "title": "Max Area of Island",
     "difficulty": "Medium",
-    "id": 695,
-    "link": "https://leetcode.com/problems/max-area-of-island/",
-    "title": "Max Area of Island"
+    "link": "https://leetcode.com/problems/max-area-of-island/"
   },
   "696": {
+    "id": 696,
     "category": "Two Pointers",
+    "title": "Count Binary Substrings",
     "difficulty": "Easy",
-    "id": 696,
-    "link": "https://leetcode.com/problems/count-binary-substrings/",
-    "title": "Count Binary Substrings"
+    "link": "https://leetcode.com/problems/count-binary-substrings/"
   },
   "697": {
+    "id": 697,
     "category": "Array & Hashing",
+    "title": "Degree of an Array",
     "difficulty": "Easy",
-    "id": 697,
-    "link": "https://leetcode.com/problems/degree-of-an-array/",
-    "title": "Degree of an Array"
+    "link": "https://leetcode.com/problems/degree-of-an-array/"
   },
   "698": {
+    "id": 698,
     "category": "Dynamic Programming",
+    "title": "Partition to K Equal Sum Subsets",
     "difficulty": "Medium",
-    "id": 698,
-    "link": "https://leetcode.com/problems/partition-to-k-equal-sum-subsets/",
-    "title": "Partition to K Equal Sum Subsets"
+    "link": "https://leetcode.com/problems/partition-to-k-equal-sum-subsets/"
+  },
+  "699": {
+    "id": 699,
+    "category": "Tree",
+    "title": "Falling Squares",
+    "difficulty": "Hard",
+    "link": "https://leetcode.com/problems/falling-squares/"
   },
-  "699": {"category": "Tree", "difficulty": "Hard", "id": 699, "link": "https://leetcode.com/problems/falling-squares/", "title": "Falling Squares"},
   "700": {
+    "id": 700,
     "category": "Tree",
+    "title": "Search in a Binary Search Tree",
     "difficulty": "Easy",
-    "id": 700,
-    "link": "https://leetcode.com/problems/search-in-a-binary-search-tree/",
-    "title": "Search in a Binary Search Tree"
+    "link": "https://leetcode.com/problems/search-in-a-binary-search-tree/"
   },
   "701": {
+    "id": 701,
     "category": "Tree",
+    "title": "Insert into a Binary Search Tree",
     "difficulty": "Medium",
-    "id": 701,
-    "link": "https://leetcode.com/problems/insert-into-a-binary-search-tree/",
-    "title": "Insert into a Binary Search Tree"
+    "link": "https://leetcode.com/problems/insert-into-a-binary-search-tree/"
   },
   "702": {
+    "id": 702,
     "category": "Binary Search",
+    "title": "Search in a Sorted Array of Unknown Size",
     "difficulty": "Medium",
-    "id": 702,
-    "link": "https://leetcode.com/problems/search-in-a-sorted-array-of-unknown-size/",
-    "title": "Search in a Sorted Array of Unknown Size"
+    "link": "https://leetcode.com/problems/search-in-a-sorted-array-of-unknown-size/"
   },
   "703": {
+    "id": 703,
     "category": "Tree",
+    "title": "Kth Largest Element in a Stream",
     "difficulty": "Easy",
-    "id": 703,
-    "link": "https://leetcode.com/problems/kth-largest-element-in-a-stream/",
-    "title": "Kth Largest Element in a Stream"
+    "link": "https://leetcode.com/problems/kth-largest-element-in-a-stream/"
   },
   "704": {
+    "id": 704,
     "category": "Binary Search",
+    "title": "Binary Search",
     "difficulty": "Easy",
-    "id": 704,
-    "link": "https://leetcode.com/problems/binary-search/",
-    "title": "Binary Search"
+    "link": "https://leetcode.com/problems/binary-search/"
   },
   "705": {
+    "id": 705,
     "category": "Linked List",
+    "title": "Design HashSet",
     "difficulty": "Easy",
-    "id": 705,
-    "link": "https://leetcode.com/problems/design-hashset/",
-    "title": "Design HashSet"
+    "link": "https://leetcode.com/problems/design-hashset/"
   },
   "706": {
+    "id": 706,
     "category": "Linked List",
+    "title": "Design HashMap",
     "difficulty": "Easy",
-    "id": 706,
-    "link": "https://leetcode.com/problems/design-hashmap/",
-    "title": "Design HashMap"
+    "link": "https://leetcode.com/problems/design-hashmap/"
   },
   "707": {
+    "id": 707,
     "category": "Linked List",
+    "title": "Design Linked List",
     "difficulty": "Medium",
-    "id": 707,
-    "link": "https://leetcode.com/problems/design-linked-list/",
-    "title": "Design Linked List"
+    "link": "https://leetcode.com/problems/design-linked-list/"
   },
   "708": {
+    "id": 708,
     "category": "Linked List",
+    "title": "Insert into a Sorted Circular Linked List",
     "difficulty": "Medium",
-    "id": 708,
-    "link": "https://leetcode.com/problems/insert-into-a-sorted-circular-linked-list/",
-    "title": "Insert into a Sorted Circular Linked List"
+    "link": "https://leetcode.com/problems/insert-into-a-sorted-circular-linked-list/"
   },
   "709": {
+    "id": 709,
     "category": "Array & Hashing",
+    "title": "To Lower Case",
     "difficulty": "Easy",
-    "id": 709,
-    "link": "https://leetcode.com/problems/to-lower-case/",
-    "title": "To Lower Case"
+    "link": "https://leetcode.com/problems/to-lower-case/"
   },
   "710": {
+    "id": 710,
     "category": "Binary Search",
+    "title": "Random Pick with Blacklist",
     "difficulty": "Hard",
-    "id": 710,
-    "link": "https://leetcode.com/problems/random-pick-with-blacklist/",
-    "title": "Random Pick with Blacklist"
+    "link": "https://leetcode.com/problems/random-pick-with-blacklist/"
   },
   "711": {
+    "id": 711,
     "category": "Graph Traversal",
+    "title": "Number of Distinct Islands II",
     "difficulty": "Hard",
-    "id": 711,
-    "link": "https://leetcode.com/problems/number-of-distinct-islands-ii/",
-    "title": "Number of Distinct Islands II"
+    "link": "https://leetcode.com/problems/number-of-distinct-islands-ii/"
   },
   "712": {
+    "id": 712,
     "category": "Dynamic Programming",
+    "title": "Minimum ASCII Delete Sum for Two Strings",
     "difficulty": "Medium",
-    "id": 712,
-    "link": "https://leetcode.com/problems/minimum-ascii-delete-sum-for-two-strings/",
-    "title": "Minimum ASCII Delete Sum for Two Strings"
+    "link": "https://leetcode.com/problems/minimum-ascii-delete-sum-for-two-strings/"
   },
   "713": {
+    "id": 713,
     "category": "Sliding Window",
+    "title": "Subarray Product Less Than K",
     "difficulty": "Medium",
-    "id": 713,
-    "link": "https://leetcode.com/problems/subarray-product-less-than-k/",
-    "title": "Subarray Product Less Than K"
+    "link": "https://leetcode.com/problems/subarray-product-less-than-k/"
   },
   "714": {
+    "id": 714,
     "category": "Dynamic Programming",
+    "title": "Best Time to Buy and Sell Stock with Transaction Fee",
     "difficulty": "Medium",
-    "id": 714,
-    "link": "https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-transaction-fee/",
-    "title": "Best Time to Buy and Sell Stock with Transaction Fee"
+    "link": "https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-transaction-fee/"
+  },
+  "715": {
+    "id": 715,
+    "category": "Tree",
+    "title": "Range Module",
+    "difficulty": "Hard",
+    "link": "https://leetcode.com/problems/range-module/"
+  },
+  "716": {
+    "id": 716,
+    "category": "Stack",
+    "title": "Max Stack",
+    "difficulty": "Hard",
+    "link": "https://leetcode.com/problems/max-stack/"
   },
-  "715": {"category": "Tree", "difficulty": "Hard", "id": 715, "link": "https://leetcode.com/problems/range-module/", "title": "Range Module"},
-  "716": {"category": "Stack", "difficulty": "Hard", "id": 716, "link": "https://leetcode.com/problems/max-stack/", "title": "Max Stack"},
   "717": {
+    "id": 717,
     "category": "Array & Hashing",
+    "title": "1-bit and 2-bit Characters",
     "difficulty": "Easy",
-    "id": 717,
-    "link": "https://leetcode.com/problems/1-bit-and-2-bit-characters/",
-    "title": "1-bit and 2-bit Characters"
+    "link": "https://leetcode.com/problems/1-bit-and-2-bit-characters/"
   },
   "718": {
+    "id": 718,
     "category": "Dynamic Programming",
+    "title": "Maximum Length of Repeated Subarray",
     "difficulty": "Medium",
-    "id": 718,
-    "link": "https://leetcode.com/problems/maximum-length-of-repeated-subarray/",
-    "title": "Maximum Length of Repeated Subarray"
+    "link": "https://leetcode.com/problems/maximum-length-of-repeated-subarray/"
   },
   "719": {
+    "id": 719,
     "category": "Binary Search",
+    "title": "Find K-th Smallest Pair Distance",
     "difficulty": "Hard",
-    "id": 719,
-    "link": "https://leetcode.com/problems/find-k-th-smallest-pair-distance/",
-    "title": "Find K-th Smallest Pair Distance"
+    "link": "https://leetcode.com/problems/find-k-th-smallest-pair-distance/"
   },
   "720": {
+    "id": 720,
     "category": "Trie",
+    "title": "Longest Word in Dictionary",
     "difficulty": "Medium",
-    "id": 720,
-    "link": "https://leetcode.com/problems/longest-word-in-dictionary/",
-    "title": "Longest Word in Dictionary"
+    "link": "https://leetcode.com/problems/longest-word-in-dictionary/"
   },
   "721": {
+    "id": 721,
     "category": "Graph Traversal",
+    "title": "Accounts Merge",
     "difficulty": "Medium",
-    "id": 721,
-    "link": "https://leetcode.com/problems/accounts-merge/",
-    "title": "Accounts Merge"
+    "link": "https://leetcode.com/problems/accounts-merge/"
   },
   "722": {
+    "id": 722,
     "category": "Array & Hashing",
+    "title": "Remove Comments",
     "difficulty": "Medium",
-    "id": 722,
-    "link": "https://leetcode.com/problems/remove-comments/",
-    "title": "Remove Comments"
+    "link": "https://leetcode.com/problems/remove-comments/"
   },
   "723": {
+    "id": 723,
     "category": "Two Pointers",
+    "title": "Candy Crush",
     "difficulty": "Medium",
-    "id": 723,
-    "link": "https://leetcode.com/problems/candy-crush/",
-    "title": "Candy Crush"
+    "link": "https://leetcode.com/problems/candy-crush/"
   },
   "724": {
+    "id": 724,
     "category": "Array & Hashing",
+    "title": "Find Pivot Index",
     "difficulty": "Easy",
-    "id": 724,
-    "link": "https://leetcode.com/problems/find-pivot-index/",
-    "title": "Find Pivot Index"
+    "link": "https://leetcode.com/problems/find-pivot-index/"
   },
   "725": {
+    "id": 725,
     "category": "Linked List",
+    "title": "Split Linked List in Parts",
     "difficulty": "Medium",
-    "id": 725,
-    "link": "https://leetcode.com/problems/split-linked-list-in-parts/",
-    "title": "Split Linked List in Parts"
+    "link": "https://leetcode.com/problems/split-linked-list-in-parts/"
+  },
+  "726": {
+    "id": 726,
+    "category": "Stack",
+    "title": "Number of Atoms",
+    "difficulty": "Hard",
+    "link": "https://leetcode.com/problems/number-of-atoms/"
   },
-  "726": {"category": "Stack", "difficulty": "Hard", "id": 726, "link": "https://leetcode.com/problems/number-of-atoms/", "title": "Number of Atoms"},
   "727": {
+    "id": 727,
     "category": "Dynamic Programming",
+    "title": "Minimum Window Subsequence",
     "difficulty": "Hard",
-    "id": 727,
-    "link": "https://leetcode.com/problems/minimum-window-subsequence/",
-    "title": "Minimum Window Subsequence"
+    "link": "https://leetcode.com/problems/minimum-window-subsequence/"
   },
   "728": {
+    "id": 728,
     "category": "Math & Geometry",
+    "title": "Self Dividing Numbers",
     "difficulty": "Easy",
-    "id": 728,
-    "link": "https://leetcode.com/problems/self-dividing-numbers/",
-    "title": "Self Dividing Numbers"
+    "link": "https://leetcode.com/problems/self-dividing-numbers/"
+  },
+  "729": {
+    "id": 729,
+    "category": "Tree",
+    "title": "My Calendar I",
+    "difficulty": "Medium",
+    "link": "https://leetcode.com/problems/my-calendar-i/"
   },
-  "729": {"category": "Tree", "difficulty": "Medium", "id": 729, "link": "https://leetcode.com/problems/my-calendar-i/", "title": "My Calendar I"},
   "730": {
+    "id": 730,
     "category": "Dynamic Programming",
+    "title": "Count Different Palindromic Subsequences",
     "difficulty": "Hard",
-    "id": 730,
-    "link": "https://leetcode.com/problems/count-different-palindromic-subsequences/",
-    "title": "Count Different Palindromic Subsequences"
-  },
-  "731": {"category": "Tree", "difficulty": "Medium", "id": 731, "link": "https://leetcode.com/problems/my-calendar-ii/", "title": "My Calendar II"},
-  "732": {"category": "Tree", "difficulty": "Hard", "id": 732, "link": "https://leetcode.com/problems/my-calendar-iii/", "title": "My Calendar III"},
-  "733": {"category": "Graph Traversal", "difficulty": "Easy", "id": 733, "link": "https://leetcode.com/problems/flood-fill/", "title": "Flood Fill"},
-  "734": {
-    "category": "Array & Hashing",
-    "difficulty": "Easy",
-    "id": 734,
-    "link": "https://leetcode.com/problems/sentence-similarity/",
-    "title": "Sentence Similarity"
+    "link": "https://leetcode.com/problems/count-different-palindromic-subsequences/"
+  },
+  "731": {
+    "id": 731,
+    "category": "Tree",
+    "title": "My Calendar II",
+    "difficulty": "Medium",
+    "link": "https://leetcode.com/problems/my-calendar-ii/"
+  },
+  "732": {
+    "id": 732,
+    "category": "Tree",
+    "title": "My Calendar III",
+    "difficulty": "Hard",
+    "link": "https://leetcode.com/problems/my-calendar-iii/"
+  },
+  "733": {
+    "id": 733,
+    "category": "Graph Traversal",
+    "title": "Flood Fill",
+    "difficulty": "Easy",
+    "link": "https://leetcode.com/problems/flood-fill/"
+  },
+  "734": {
+    "id": 734,
+    "category": "Array & Hashing",
+    "title": "Sentence Similarity",
+    "difficulty": "Easy",
+    "link": "https://leetcode.com/problems/sentence-similarity/"
   },
   "735": {
+    "id": 735,
     "category": "Stack",
+    "title": "Asteroid Collision",
     "difficulty": "Medium",
-    "id": 735,
-    "link": "https://leetcode.com/problems/asteroid-collision/",
-    "title": "Asteroid Collision"
+    "link": "https://leetcode.com/problems/asteroid-collision/"
   },
   "736": {
+    "id": 736,
     "category": "Stack",
+    "title": "Parse Lisp Expression",
     "difficulty": "Hard",
-    "id": 736,
-    "link": "https://leetcode.com/problems/parse-lisp-expression/",
-    "title": "Parse Lisp Expression"
+    "link": "https://leetcode.com/problems/parse-lisp-expression/"
   },
   "737": {
+    "id": 737,
     "category": "Graph Traversal",
+    "title": "Sentence Similarity II",
     "difficulty": "Medium",
-    "id": 737,
-    "link": "https://leetcode.com/problems/sentence-similarity-ii/",
-    "title": "Sentence Similarity II"
+    "link": "https://leetcode.com/problems/sentence-similarity-ii/"
   },
   "738": {
+    "id": 738,
     "category": "Greedy",
+    "title": "Monotone Increasing Digits",
     "difficulty": "Medium",
-    "id": 738,
-    "link": "https://leetcode.com/problems/monotone-increasing-digits/",
-    "title": "Monotone Increasing Digits"
+    "link": "https://leetcode.com/problems/monotone-increasing-digits/"
   },
   "739": {
+    "id": 739,
     "category": "Stack",
+    "title": "Daily Temperatures",
     "difficulty": "Medium",
-    "id": 739,
-    "link": "https://leetcode.com/problems/daily-temperatures/",
-    "title": "Daily Temperatures"
+    "link": "https://leetcode.com/problems/daily-temperatures/"
   },
   "740": {
+    "id": 740,
     "category": "Dynamic Programming",
+    "title": "Delete and Earn",
     "difficulty": "Medium",
-    "id": 740,
-    "link": "https://leetcode.com/problems/delete-and-earn/",
-    "title": "Delete and Earn"
+    "link": "https://leetcode.com/problems/delete-and-earn/"
   },
   "741": {
+    "id": 741,
     "category": "Dynamic Programming",
+    "title": "Cherry Pickup",
     "difficulty": "Hard",
-    "id": 741,
-    "link": "https://leetcode.com/problems/cherry-pickup/",
-    "title": "Cherry Pickup"
+    "link": "https://leetcode.com/problems/cherry-pickup/"
   },
   "742": {
+    "id": 742,
     "category": "Tree",
+    "title": "Closest Leaf in a Binary Tree",
     "difficulty": "Medium",
-    "id": 742,
-    "link": "https://leetcode.com/problems/closest-leaf-in-a-binary-tree/",
-    "title": "Closest Leaf in a Binary Tree"
+    "link": "https://leetcode.com/problems/closest-leaf-in-a-binary-tree/"
   },
   "743": {
+    "id": 743,
     "category": "Graph Traversal",
+    "title": "Network Delay Time",
     "difficulty": "Medium",
-    "id": 743,
-    "link": "https://leetcode.com/problems/network-delay-time/",
-    "title": "Network Delay Time"
+    "link": "https://leetcode.com/problems/network-delay-time/"
   },
   "744": {
+    "id": 744,
     "category": "Binary Search",
+    "title": "Find Smallest Letter Greater Than Target",
     "difficulty": "Easy",
-    "id": 744,
-    "link": "https://leetcode.com/problems/find-smallest-letter-greater-than-target/",
-    "title": "Find Smallest Letter Greater Than Target"
+    "link": "https://leetcode.com/problems/find-smallest-letter-greater-than-target/"
   },
   "745": {
+    "id": 745,
     "category": "Trie",
+    "title": "Prefix and Suffix Search",
     "difficulty": "Hard",
-    "id": 745,
-    "link": "https://leetcode.com/problems/prefix-and-suffix-search/",
-    "title": "Prefix and Suffix Search"
+    "link": "https://leetcode.com/problems/prefix-and-suffix-search/"
   },
   "746": {
+    "id": 746,
     "category": "Dynamic Programming",
+    "title": "Min Cost Climbing Stairs",
     "difficulty": "Easy",
-    "id": 746,
-    "link": "https://leetcode.com/problems/min-cost-climbing-stairs/",
-    "title": "Min Cost Climbing Stairs"
+    "link": "https://leetcode.com/problems/min-cost-climbing-stairs/"
   },
   "747": {
+    "id": 747,
     "category": "Array & Hashing",
+    "title": "Largest Number At Least Twice of Others",
     "difficulty": "Easy",
-    "id": 747,
-    "link": "https://leetcode.com/problems/largest-number-at-least-twice-of-others/",
-    "title": "Largest Number At Least Twice of Others"
+    "link": "https://leetcode.com/problems/largest-number-at-least-twice-of-others/"
   },
   "748": {
+    "id": 748,
     "category": "Array & Hashing",
+    "title": "Shortest Completing Word",
     "difficulty": "Easy",
-    "id": 748,
-    "link": "https://leetcode.com/problems/shortest-completing-word/",
-    "title": "Shortest Completing Word"
+    "link": "https://leetcode.com/problems/shortest-completing-word/"
   },
   "749": {
+    "id": 749,
     "category": "Graph Traversal",
+    "title": "Contain Virus",
     "difficulty": "Hard",
-    "id": 749,
-    "link": "https://leetcode.com/problems/contain-virus/",
-    "title": "Contain Virus"
+    "link": "https://leetcode.com/problems/contain-virus/"
   },
   "750": {
+    "id": 750,
     "category": "Dynamic Programming",
+    "title": "Number Of Corner Rectangles",
     "difficulty": "Medium",
-    "id": 750,
-    "link": "https://leetcode.com/problems/number-of-corner-rectangles/",
-    "title": "Number Of Corner Rectangles"
+    "link": "https://leetcode.com/problems/number-of-corner-rectangles/"
   },
   "751": {
+    "id": 751,
     "category": "Bit Manipulation",
+    "title": "IP to CIDR",
     "difficulty": "Medium",
-    "id": 751,
-    "link": "https://leetcode.com/problems/ip-to-cidr/",
-    "title": "IP to CIDR"
+    "link": "https://leetcode.com/problems/ip-to-cidr/"
   },
   "752": {
+    "id": 752,
     "category": "Graph Traversal",
+    "title": "Open the Lock",
     "difficulty": "Medium",
-    "id": 752,
-    "link": "https://leetcode.com/problems/open-the-lock/",
-    "title": "Open the Lock"
+    "link": "https://leetcode.com/problems/open-the-lock/"
   },
   "753": {
+    "id": 753,
     "category": "Graph Traversal",
+    "title": "Cracking the Safe",
     "difficulty": "Hard",
-    "id": 753,
-    "link": "https://leetcode.com/problems/cracking-the-safe/",
-    "title": "Cracking the Safe"
+    "link": "https://leetcode.com/problems/cracking-the-safe/"
   },
   "754": {
+    "id": 754,
     "category": "Binary Search",
+    "title": "Reach a Number",
     "difficulty": "Medium",
-    "id": 754,
-    "link": "https://leetcode.com/problems/reach-a-number/",
-    "title": "Reach a Number"
+    "link": "https://leetcode.com/problems/reach-a-number/"
   },
   "755": {
+    "id": 755,
     "category": "Array & Hashing",
+    "title": "Pour Water",
     "difficulty": "Medium",
-    "id": 755,
-    "link": "https://leetcode.com/problems/pour-water/",
-    "title": "Pour Water"
+    "link": "https://leetcode.com/problems/pour-water/"
   },
   "756": {
+    "id": 756,
     "category": "Backtracking",
+    "title": "Pyramid Transition Matrix",
     "difficulty": "Medium",
-    "id": 756,
-    "link": "https://leetcode.com/problems/pyramid-transition-matrix/",
-    "title": "Pyramid Transition Matrix"
+    "link": "https://leetcode.com/problems/pyramid-transition-matrix/"
   },
   "757": {
+    "id": 757,
     "category": "Greedy",
+    "title": "Set Intersection Size At Least Two",
     "difficulty": "Hard",
-    "id": 757,
-    "link": "https://leetcode.com/problems/set-intersection-size-at-least-two/",
-    "title": "Set Intersection Size At Least Two"
+    "link": "https://leetcode.com/problems/set-intersection-size-at-least-two/"
   },
   "758": {
+    "id": 758,
     "category": "Trie",
+    "title": "Bold Words in String",
     "difficulty": "Medium",
-    "id": 758,
-    "link": "https://leetcode.com/problems/bold-words-in-string/",
-    "title": "Bold Words in String"
+    "link": "https://leetcode.com/problems/bold-words-in-string/"
   },
   "759": {
+    "id": 759,
     "category": "Heap (Priority Queue)",
+    "title": "Employee Free Time",
     "difficulty": "Hard",
-    "id": 759,
-    "link": "https://leetcode.com/problems/employee-free-time/",
-    "title": "Employee Free Time"
+    "link": "https://leetcode.com/problems/employee-free-time/"
   },
   "760": {
+    "id": 760,
     "category": "Array & Hashing",
+    "title": "Find Anagram Mappings",
     "difficulty": "Easy",
-    "id": 760,
-    "link": "https://leetcode.com/problems/find-anagram-mappings/",
-    "title": "Find Anagram Mappings"
+    "link": "https://leetcode.com/problems/find-anagram-mappings/"
   },
   "761": {
+    "id": 761,
     "category": "Array & Hashing",
+    "title": "Special Binary String",
     "difficulty": "Hard",
-    "id": 761,
-    "link": "https://leetcode.com/problems/special-binary-string/",
-    "title": "Special Binary String"
+    "link": "https://leetcode.com/problems/special-binary-string/"
   },
   "762": {
+    "id": 762,
     "category": "Bit Manipulation",
+    "title": "Prime Number of Set Bits in Binary Representation",
     "difficulty": "Easy",
-    "id": 762,
-    "link": "https://leetcode.com/problems/prime-number-of-set-bits-in-binary-representation/",
-    "title": "Prime Number of Set Bits in Binary Representation"
+    "link": "https://leetcode.com/problems/prime-number-of-set-bits-in-binary-representation/"
   },
   "763": {
+    "id": 763,
     "category": "Greedy",
+    "title": "Partition Labels",
     "difficulty": "Medium",
-    "id": 763,
-    "link": "https://leetcode.com/problems/partition-labels/",
-    "title": "Partition Labels"
+    "link": "https://leetcode.com/problems/partition-labels/"
   },
   "764": {
+    "id": 764,
     "category": "Dynamic Programming",
+    "title": "Largest Plus Sign",
     "difficulty": "Medium",
-    "id": 764,
-    "link": "https://leetcode.com/problems/largest-plus-sign/",
-    "title": "Largest Plus Sign"
+    "link": "https://leetcode.com/problems/largest-plus-sign/"
   },
   "765": {
+    "id": 765,
     "category": "Graph Traversal",
+    "title": "Couples Holding Hands",
     "difficulty": "Hard",
-    "id": 765,
-    "link": "https://leetcode.com/problems/couples-holding-hands/",
-    "title": "Couples Holding Hands"
+    "link": "https://leetcode.com/problems/couples-holding-hands/"
   },
   "766": {
+    "id": 766,
     "category": "Array & Hashing",
+    "title": "Toeplitz Matrix",
     "difficulty": "Easy",
-    "id": 766,
-    "link": "https://leetcode.com/problems/toeplitz-matrix/",
-    "title": "Toeplitz Matrix"
+    "link": "https://leetcode.com/problems/toeplitz-matrix/"
   },
   "767": {
+    "id": 767,
     "category": "Heap (Priority Queue)",
+    "title": "Reorganize String",
     "difficulty": "Medium",
-    "id": 767,
-    "link": "https://leetcode.com/problems/reorganize-string/",
-    "title": "Reorganize String"
+    "link": "https://leetcode.com/problems/reorganize-string/"
   },
   "768": {
+    "id": 768,
     "category": "Stack",
+    "title": "Max Chunks To Make Sorted II",
     "difficulty": "Hard",
-    "id": 768,
-    "link": "https://leetcode.com/problems/max-chunks-to-make-sorted-ii/",
-    "title": "Max Chunks To Make Sorted II"
+    "link": "https://leetcode.com/problems/max-chunks-to-make-sorted-ii/"
   },
   "769": {
+    "id": 769,
     "category": "Stack",
+    "title": "Max Chunks To Make Sorted",
     "difficulty": "Medium",
-    "id": 769,
-    "link": "https://leetcode.com/problems/max-chunks-to-make-sorted/",
-    "title": "Max Chunks To Make Sorted"
+    "link": "https://leetcode.com/problems/max-chunks-to-make-sorted/"
   },
   "770": {
+    "id": 770,
     "category": "Stack",
+    "title": "Basic Calculator IV",
     "difficulty": "Hard",
-    "id": 770,
-    "link": "https://leetcode.com/problems/basic-calculator-iv/",
-    "title": "Basic Calculator IV"
+    "link": "https://leetcode.com/problems/basic-calculator-iv/"
   },
   "771": {
+    "id": 771,
     "category": "Array & Hashing",
+    "title": "Jewels and Stones",
     "difficulty": "Easy",
-    "id": 771,
-    "link": "https://leetcode.com/problems/jewels-and-stones/",
-    "title": "Jewels and Stones"
+    "link": "https://leetcode.com/problems/jewels-and-stones/"
   },
   "772": {
+    "id": 772,
     "category": "Stack",
+    "title": "Basic Calculator III",
     "difficulty": "Hard",
-    "id": 772,
-    "link": "https://leetcode.com/problems/basic-calculator-iii/",
-    "title": "Basic Calculator III"
+    "link": "https://leetcode.com/problems/basic-calculator-iii/"
   },
   "773": {
+    "id": 773,
     "category": "Graph Traversal",
+    "title": "Sliding Puzzle",
     "difficulty": "Hard",
-    "id": 773,
-    "link": "https://leetcode.com/problems/sliding-puzzle/",
-    "title": "Sliding Puzzle"
+    "link": "https://leetcode.com/problems/sliding-puzzle/"
   },
   "774": {
+    "id": 774,
     "category": "Binary Search",
+    "title": "Minimize Max Distance to Gas Station",
     "difficulty": "Hard",
-    "id": 774,
-    "link": "https://leetcode.com/problems/minimize-max-distance-to-gas-station/",
-    "title": "Minimize Max Distance to Gas Station"
+    "link": "https://leetcode.com/problems/minimize-max-distance-to-gas-station/"
   },
   "775": {
+    "id": 775,
     "category": "Math & Geometry",
+    "title": "Global and Local Inversions",
     "difficulty": "Medium",
-    "id": 775,
-    "link": "https://leetcode.com/problems/global-and-local-inversions/",
-    "title": "Global and Local Inversions"
+    "link": "https://leetcode.com/problems/global-and-local-inversions/"
+  },
+  "776": {
+    "id": 776,
+    "category": "Tree",
+    "title": "Split BST",
+    "difficulty": "Medium",
+    "link": "https://leetcode.com/problems/split-bst/"
   },
-  "776": {"category": "Tree", "difficulty": "Medium", "id": 776, "link": "https://leetcode.com/problems/split-bst/", "title": "Split BST"},
   "777": {
+    "id": 777,
     "category": "Two Pointers",
+    "title": "Swap Adjacent in LR String",
     "difficulty": "Medium",
-    "id": 777,
-    "link": "https://leetcode.com/problems/swap-adjacent-in-lr-string/",
-    "title": "Swap Adjacent in LR String"
+    "link": "https://leetcode.com/problems/swap-adjacent-in-lr-string/"
   },
   "778": {
+    "id": 778,
     "category": "Graph Traversal",
+    "title": "Swim in Rising Water",
     "difficulty": "Hard",
-    "id": 778,
-    "link": "https://leetcode.com/problems/swim-in-rising-water/",
-    "title": "Swim in Rising Water"
+    "link": "https://leetcode.com/problems/swim-in-rising-water/"
   },
   "779": {
+    "id": 779,
     "category": "Bit Manipulation",
+    "title": "K-th Symbol in Grammar",
     "difficulty": "Medium",
-    "id": 779,
-    "link": "https://leetcode.com/problems/k-th-symbol-in-grammar/",
-    "title": "K-th Symbol in Grammar"
+    "link": "https://leetcode.com/problems/k-th-symbol-in-grammar/"
   },
   "780": {
+    "id": 780,
     "category": "Math & Geometry",
+    "title": "Reaching Points",
     "difficulty": "Hard",
-    "id": 780,
-    "link": "https://leetcode.com/problems/reaching-points/",
-    "title": "Reaching Points"
+    "link": "https://leetcode.com/problems/reaching-points/"
   },
   "781": {
+    "id": 781,
     "category": "Greedy",
+    "title": "Rabbits in Forest",
     "difficulty": "Medium",
-    "id": 781,
-    "link": "https://leetcode.com/problems/rabbits-in-forest/",
-    "title": "Rabbits in Forest"
+    "link": "https://leetcode.com/problems/rabbits-in-forest/"
   },
   "782": {
+    "id": 782,
     "category": "Bit Manipulation",
+    "title": "Transform to Chessboard",
     "difficulty": "Hard",
-    "id": 782,
-    "link": "https://leetcode.com/problems/transform-to-chessboard/",
-    "title": "Transform to Chessboard"
+    "link": "https://leetcode.com/problems/transform-to-chessboard/"
   },
   "783": {
+    "id": 783,
     "category": "Tree",
+    "title": "Minimum Distance Between BST Nodes",
     "difficulty": "Easy",
-    "id": 783,
-    "link": "https://leetcode.com/problems/minimum-distance-between-bst-nodes/",
-    "title": "Minimum Distance Between BST Nodes"
+    "link": "https://leetcode.com/problems/minimum-distance-between-bst-nodes/"
   },
   "784": {
+    "id": 784,
     "category": "Backtracking",
+    "title": "Letter Case Permutation",
     "difficulty": "Medium",
-    "id": 784,
-    "link": "https://leetcode.com/problems/letter-case-permutation/",
-    "title": "Letter Case Permutation"
+    "link": "https://leetcode.com/problems/letter-case-permutation/"
   },
   "785": {
+    "id": 785,
     "category": "Graph Traversal",
+    "title": "Is Graph Bipartite?",
     "difficulty": "Medium",
-    "id": 785,
-    "link": "https://leetcode.com/problems/is-graph-bipartite/",
-    "title": "Is Graph Bipartite?"
+    "link": "https://leetcode.com/problems/is-graph-bipartite/"
   },
   "786": {
+    "id": 786,
     "category": "Binary Search",
+    "title": "K-th Smallest Prime Fraction",
     "difficulty": "Medium",
-    "id": 786,
-    "link": "https://leetcode.com/problems/k-th-smallest-prime-fraction/",
-    "title": "K-th Smallest Prime Fraction"
+    "link": "https://leetcode.com/problems/k-th-smallest-prime-fraction/"
   },
   "787": {
+    "id": 787,
     "category": "Graph Traversal",
+    "title": "Cheapest Flights Within K Stops",
     "difficulty": "Medium",
-    "id": 787,
-    "link": "https://leetcode.com/problems/cheapest-flights-within-k-stops/",
-    "title": "Cheapest Flights Within K Stops"
+    "link": "https://leetcode.com/problems/cheapest-flights-within-k-stops/"
   },
   "788": {
+    "id": 788,
     "category": "Dynamic Programming",
+    "title": "Rotated Digits",
     "difficulty": "Medium",
-    "id": 788,
-    "link": "https://leetcode.com/problems/rotated-digits/",
-    "title": "Rotated Digits"
+    "link": "https://leetcode.com/problems/rotated-digits/"
   },
   "789": {
+    "id": 789,
     "category": "Math & Geometry",
+    "title": "Escape The Ghosts",
     "difficulty": "Medium",
-    "id": 789,
-    "link": "https://leetcode.com/problems/escape-the-ghosts/",
-    "title": "Escape The Ghosts"
+    "link": "https://leetcode.com/problems/escape-the-ghosts/"
   },
   "790": {
+    "id": 790,
     "category": "Dynamic Programming",
+    "title": "Domino and Tromino Tiling",
     "difficulty": "Medium",
-    "id": 790,
-    "link": "https://leetcode.com/problems/domino-and-tromino-tiling/",
-    "title": "Domino and Tromino Tiling"
+    "link": "https://leetcode.com/problems/domino-and-tromino-tiling/"
   },
   "791": {
+    "id": 791,
     "category": "Array & Hashing",
+    "title": "Custom Sort String",
     "difficulty": "Medium",
-    "id": 791,
-    "link": "https://leetcode.com/problems/custom-sort-string/",
-    "title": "Custom Sort String"
+    "link": "https://leetcode.com/problems/custom-sort-string/"
   },
   "792": {
+    "id": 792,
     "category": "Dynamic Programming",
+    "title": "Number of Matching Subsequences",
     "difficulty": "Medium",
-    "id": 792,
-    "link": "https://leetcode.com/problems/number-of-matching-subsequences/",
-    "title": "Number of Matching Subsequences"
+    "link": "https://leetcode.com/problems/number-of-matching-subsequences/"
   },
   "793": {
+    "id": 793,
     "category": "Binary Search",
+    "title": "Preimage Size of Factorial Zeroes Function",
     "difficulty": "Hard",
-    "id": 793,
-    "link": "https://leetcode.com/problems/preimage-size-of-factorial-zeroes-function/",
-    "title": "Preimage Size of Factorial Zeroes Function"
+    "link": "https://leetcode.com/problems/preimage-size-of-factorial-zeroes-function/"
   },
   "794": {
+    "id": 794,
     "category": "Array & Hashing",
+    "title": "Valid Tic-Tac-Toe State",
     "difficulty": "Medium",
-    "id": 794,
-    "link": "https://leetcode.com/problems/valid-tic-tac-toe-state/",
-    "title": "Valid Tic-Tac-Toe State"
+    "link": "https://leetcode.com/problems/valid-tic-tac-toe-state/"
   },
   "795": {
+    "id": 795,
     "category": "Two Pointers",
+    "title": "Number of Subarrays with Bounded Maximum",
     "difficulty": "Medium",
-    "id": 795,
-    "link": "https://leetcode.com/problems/number-of-subarrays-with-bounded-maximum/",
-    "title": "Number of Subarrays with Bounded Maximum"
+    "link": "https://leetcode.com/problems/number-of-subarrays-with-bounded-maximum/"
   },
   "796": {
+    "id": 796,
     "category": "Array & Hashing",
+    "title": "Rotate String",
     "difficulty": "Easy",
-    "id": 796,
-    "link": "https://leetcode.com/problems/rotate-string/",
-    "title": "Rotate String"
+    "link": "https://leetcode.com/problems/rotate-string/"
   },
   "797": {
+    "id": 797,
     "category": "Graph Traversal",
+    "title": "All Paths From Source to Target",
     "difficulty": "Medium",
-    "id": 797,
-    "link": "https://leetcode.com/problems/all-paths-from-source-to-target/",
-    "title": "All Paths From Source to Target"
+    "link": "https://leetcode.com/problems/all-paths-from-source-to-target/"
   },
   "798": {
+    "id": 798,
     "category": "Array & Hashing",
+    "title": "Smallest Rotation with Highest Score",
     "difficulty": "Hard",
-    "id": 798,
-    "link": "https://leetcode.com/problems/smallest-rotation-with-highest-score/",
-    "title": "Smallest Rotation with Highest Score"
+    "link": "https://leetcode.com/problems/smallest-rotation-with-highest-score/"
   },
   "799": {
+    "id": 799,
     "category": "Dynamic Programming",
+    "title": "Champagne Tower",
     "difficulty": "Medium",
-    "id": 799,
-    "link": "https://leetcode.com/problems/champagne-tower/",
-    "title": "Champagne Tower"
+    "link": "https://leetcode.com/problems/champagne-tower/"
   },
   "800": {
+    "id": 800,
     "category": "Math & Geometry",
+    "title": "Similar RGB Color",
     "difficulty": "Easy",
-    "id": 800,
-    "link": "https://leetcode.com/problems/similar-rgb-color/",
-    "title": "Similar RGB Color"
+    "link": "https://leetcode.com/problems/similar-rgb-color/"
   },
   "801": {
+    "id": 801,
     "category": "Dynamic Programming",
+    "title": "Minimum Swaps To Make Sequences Increasing",
     "difficulty": "Hard",
-    "id": 801,
-    "link": "https://leetcode.com/problems/minimum-swaps-to-make-sequences-increasing/",
-    "title": "Minimum Swaps To Make Sequences Increasing"
+    "link": "https://leetcode.com/problems/minimum-swaps-to-make-sequences-increasing/"
   },
   "802": {
+    "id": 802,
     "category": "Graph Traversal",
+    "title": "Find Eventual Safe States",
     "difficulty": "Medium",
-    "id": 802,
-    "link": "https://leetcode.com/problems/find-eventual-safe-states/",
-    "title": "Find Eventual Safe States"
+    "link": "https://leetcode.com/problems/find-eventual-safe-states/"
   },
   "803": {
+    "id": 803,
     "category": "Graph Traversal",
+    "title": "Bricks Falling When Hit",
     "difficulty": "Hard",
-    "id": 803,
-    "link": "https://leetcode.com/problems/bricks-falling-when-hit/",
-    "title": "Bricks Falling When Hit"
+    "link": "https://leetcode.com/problems/bricks-falling-when-hit/"
   },
   "804": {
+    "id": 804,
     "category": "Array & Hashing",
+    "title": "Unique Morse Code Words",
     "difficulty": "Easy",
-    "id": 804,
-    "link": "https://leetcode.com/problems/unique-morse-code-words/",
-    "title": "Unique Morse Code Words"
+    "link": "https://leetcode.com/problems/unique-morse-code-words/"
   },
   "805": {
+    "id": 805,
     "category": "Dynamic Programming",
+    "title": "Split Array With Same Average",
     "difficulty": "Hard",
-    "id": 805,
-    "link": "https://leetcode.com/problems/split-array-with-same-average/",
-    "title": "Split Array With Same Average"
+    "link": "https://leetcode.com/problems/split-array-with-same-average/"
   },
   "806": {
+    "id": 806,
     "category": "Array & Hashing",
+    "title": "Number of Lines To Write String",
     "difficulty": "Easy",
-    "id": 806,
-    "link": "https://leetcode.com/problems/number-of-lines-to-write-string/",
-    "title": "Number of Lines To Write String"
+    "link": "https://leetcode.com/problems/number-of-lines-to-write-string/"
   },
   "807": {
+    "id": 807,
     "category": "Greedy",
+    "title": "Max Increase to Keep City Skyline",
     "difficulty": "Medium",
-    "id": 807,
-    "link": "https://leetcode.com/problems/max-increase-to-keep-city-skyline/",
-    "title": "Max Increase to Keep City Skyline"
+    "link": "https://leetcode.com/problems/max-increase-to-keep-city-skyline/"
   },
   "808": {
+    "id": 808,
     "category": "Dynamic Programming",
+    "title": "Soup Servings",
     "difficulty": "Medium",
-    "id": 808,
-    "link": "https://leetcode.com/problems/soup-servings/",
-    "title": "Soup Servings"
+    "link": "https://leetcode.com/problems/soup-servings/"
   },
   "809": {
+    "id": 809,
     "category": "Two Pointers",
+    "title": "Expressive Words",
     "difficulty": "Medium",
-    "id": 809,
-    "link": "https://leetcode.com/problems/expressive-words/",
-    "title": "Expressive Words"
+    "link": "https://leetcode.com/problems/expressive-words/"
   },
   "810": {
+    "id": 810,
     "category": "Bit Manipulation",
+    "title": "Chalkboard XOR Game",
     "difficulty": "Hard",
-    "id": 810,
-    "link": "https://leetcode.com/problems/chalkboard-xor-game/",
-    "title": "Chalkboard XOR Game"
+    "link": "https://leetcode.com/problems/chalkboard-xor-game/"
   },
   "811": {
+    "id": 811,
     "category": "Array & Hashing",
+    "title": "Subdomain Visit Count",
     "difficulty": "Medium",
-    "id": 811,
-    "link": "https://leetcode.com/problems/subdomain-visit-count/",
-    "title": "Subdomain Visit Count"
+    "link": "https://leetcode.com/problems/subdomain-visit-count/"
   },
   "812": {
+    "id": 812,
     "category": "Math & Geometry",
+    "title": "Largest Triangle Area",
     "difficulty": "Easy",
-    "id": 812,
-    "link": "https://leetcode.com/problems/largest-triangle-area/",
-    "title": "Largest Triangle Area"
+    "link": "https://leetcode.com/problems/largest-triangle-area/"
   },
   "813": {
+    "id": 813,
     "category": "Dynamic Programming",
+    "title": "Largest Sum of Averages",
     "difficulty": "Medium",
-    "id": 813,
-    "link": "https://leetcode.com/problems/largest-sum-of-averages/",
-    "title": "Largest Sum of Averages"
+    "link": "https://leetcode.com/problems/largest-sum-of-averages/"
   },
   "814": {
+    "id": 814,
     "category": "Tree",
+    "title": "Binary Tree Pruning",
     "difficulty": "Medium",
-    "id": 814,
-    "link": "https://leetcode.com/problems/binary-tree-pruning/",
-    "title": "Binary Tree Pruning"
+    "link": "https://leetcode.com/problems/binary-tree-pruning/"
+  },
+  "815": {
+    "id": 815,
+    "category": "Graph Traversal",
+    "title": "Bus Routes",
+    "difficulty": "Hard",
+    "link": "https://leetcode.com/problems/bus-routes/"
   },
-  "815": {"category": "Graph Traversal", "difficulty": "Hard", "id": 815, "link": "https://leetcode.com/problems/bus-routes/", "title": "Bus Routes"},
   "816": {
+    "id": 816,
     "category": "Backtracking",
+    "title": "Ambiguous Coordinates",
     "difficulty": "Medium",
-    "id": 816,
-    "link": "https://leetcode.com/problems/ambiguous-coordinates/",
-    "title": "Ambiguous Coordinates"
+    "link": "https://leetcode.com/problems/ambiguous-coordinates/"
   },
   "817": {
+    "id": 817,
     "category": "Linked List",
+    "title": "Linked List Components",
     "difficulty": "Medium",
-    "id": 817,
-    "link": "https://leetcode.com/problems/linked-list-components/",
-    "title": "Linked List Components"
+    "link": "https://leetcode.com/problems/linked-list-components/"
+  },
+  "818": {
+    "id": 818,
+    "category": "Dynamic Programming",
+    "title": "Race Car",
+    "difficulty": "Hard",
+    "link": "https://leetcode.com/problems/race-car/"
   },
-  "818": {"category": "Dynamic Programming", "difficulty": "Hard", "id": 818, "link": "https://leetcode.com/problems/race-car/", "title": "Race Car"},
   "819": {
+    "id": 819,
     "category": "Array & Hashing",
+    "title": "Most Common Word",
     "difficulty": "Easy",
-    "id": 819,
-    "link": "https://leetcode.com/problems/most-common-word/",
-    "title": "Most Common Word"
+    "link": "https://leetcode.com/problems/most-common-word/"
   },
   "820": {
+    "id": 820,
     "category": "Trie",
+    "title": "Short Encoding of Words",
     "difficulty": "Medium",
-    "id": 820,
-    "link": "https://leetcode.com/problems/short-encoding-of-words/",
-    "title": "Short Encoding of Words"
+    "link": "https://leetcode.com/problems/short-encoding-of-words/"
   },
   "821": {
+    "id": 821,
     "category": "Two Pointers",
+    "title": "Shortest Distance to a Character",
     "difficulty": "Easy",
-    "id": 821,
-    "link": "https://leetcode.com/problems/shortest-distance-to-a-character/",
-    "title": "Shortest Distance to a Character"
+    "link": "https://leetcode.com/problems/shortest-distance-to-a-character/"
   },
   "822": {
+    "id": 822,
     "category": "Array & Hashing",
+    "title": "Card Flipping Game",
     "difficulty": "Medium",
-    "id": 822,
-    "link": "https://leetcode.com/problems/card-flipping-game/",
-    "title": "Card Flipping Game"
+    "link": "https://leetcode.com/problems/card-flipping-game/"
   },
   "823": {
+    "id": 823,
     "category": "Dynamic Programming",
+    "title": "Binary Trees With Factors",
     "difficulty": "Medium",
-    "id": 823,
-    "link": "https://leetcode.com/problems/binary-trees-with-factors/",
-    "title": "Binary Trees With Factors"
+    "link": "https://leetcode.com/problems/binary-trees-with-factors/"
+  },
+  "824": {
+    "id": 824,
+    "category": "Array & Hashing",
+    "title": "Goat Latin",
+    "difficulty": "Easy",
+    "link": "https://leetcode.com/problems/goat-latin/"
   },
-  "824": {"category": "Array & Hashing", "difficulty": "Easy", "id": 824, "link": "https://leetcode.com/problems/goat-latin/", "title": "Goat Latin"},
   "825": {
+    "id": 825,
     "category": "Binary Search",
+    "title": "Friends Of Appropriate Ages",
     "difficulty": "Medium",
-    "id": 825,
-    "link": "https://leetcode.com/problems/friends-of-appropriate-ages/",
-    "title": "Friends Of Appropriate Ages"
+    "link": "https://leetcode.com/problems/friends-of-appropriate-ages/"
   },
   "826": {
+    "id": 826,
     "category": "Binary Search",
+    "title": "Most Profit Assigning Work",
     "difficulty": "Medium",
-    "id": 826,
-    "link": "https://leetcode.com/problems/most-profit-assigning-work/",
-    "title": "Most Profit Assigning Work"
+    "link": "https://leetcode.com/problems/most-profit-assigning-work/"
   },
   "827": {
+    "id": 827,
     "category": "Graph Traversal",
+    "title": "Making A Large Island",
     "difficulty": "Hard",
-    "id": 827,
-    "link": "https://leetcode.com/problems/making-a-large-island/",
-    "title": "Making A Large Island"
+    "link": "https://leetcode.com/problems/making-a-large-island/"
   },
   "828": {
+    "id": 828,
     "category": "Dynamic Programming",
+    "title": "Count Unique Characters of All Substrings of a Given String",
     "difficulty": "Hard",
-    "id": 828,
-    "link": "https://leetcode.com/problems/count-unique-characters-of-all-substrings-of-a-given-string/",
-    "title": "Count Unique Characters of All Substrings of a Given String"
+    "link": "https://leetcode.com/problems/count-unique-characters-of-all-substrings-of-a-given-string/"
   },
   "829": {
+    "id": 829,
     "category": "Math & Geometry",
+    "title": "Consecutive Numbers Sum",
     "difficulty": "Hard",
-    "id": 829,
-    "link": "https://leetcode.com/problems/consecutive-numbers-sum/",
-    "title": "Consecutive Numbers Sum"
+    "link": "https://leetcode.com/problems/consecutive-numbers-sum/"
   },
   "830": {
+    "id": 830,
     "category": "Array & Hashing",
+    "title": "Positions of Large Groups",
     "difficulty": "Easy",
-    "id": 830,
-    "link": "https://leetcode.com/problems/positions-of-large-groups/",
-    "title": "Positions of Large Groups"
+    "link": "https://leetcode.com/problems/positions-of-large-groups/"
   },
   "831": {
+    "id": 831,
     "category": "Array & Hashing",
+    "title": "Masking Personal Information",
     "difficulty": "Medium",
-    "id": 831,
-    "link": "https://leetcode.com/problems/masking-personal-information/",
-    "title": "Masking Personal Information"
+    "link": "https://leetcode.com/problems/masking-personal-information/"
   },
   "832": {
+    "id": 832,
     "category": "Bit Manipulation",
+    "title": "Flipping an Image",
     "difficulty": "Easy",
-    "id": 832,
-    "link": "https://leetcode.com/problems/flipping-an-image/",
-    "title": "Flipping an Image"
+    "link": "https://leetcode.com/problems/flipping-an-image/"
   },
   "833": {
+    "id": 833,
     "category": "Array & Hashing",
+    "title": "Find And Replace in String",
     "difficulty": "Medium",
-    "id": 833,
-    "link": "https://leetcode.com/problems/find-and-replace-in-string/",
-    "title": "Find And Replace in String"
+    "link": "https://leetcode.com/problems/find-and-replace-in-string/"
   },
   "834": {
+    "id": 834,
     "category": "Tree",
+    "title": "Sum of Distances in Tree",
     "difficulty": "Hard",
-    "id": 834,
-    "link": "https://leetcode.com/problems/sum-of-distances-in-tree/",
-    "title": "Sum of Distances in Tree"
+    "link": "https://leetcode.com/problems/sum-of-distances-in-tree/"
   },
   "835": {
+    "id": 835,
     "category": "Array & Hashing",
+    "title": "Image Overlap",
     "difficulty": "Medium",
-    "id": 835,
-    "link": "https://leetcode.com/problems/image-overlap/",
-    "title": "Image Overlap"
+    "link": "https://leetcode.com/problems/image-overlap/"
   },
   "836": {
+    "id": 836,
     "category": "Math & Geometry",
+    "title": "Rectangle Overlap",
     "difficulty": "Easy",
-    "id": 836,
-    "link": "https://leetcode.com/problems/rectangle-overlap/",
-    "title": "Rectangle Overlap"
+    "link": "https://leetcode.com/problems/rectangle-overlap/"
   },
   "837": {
+    "id": 837,
     "category": "Dynamic Programming",
+    "title": "New 21 Game",
     "difficulty": "Medium",
-    "id": 837,
-    "link": "https://leetcode.com/problems/new-21-game/",
-    "title": "New 21 Game"
+    "link": "https://leetcode.com/problems/new-21-game/"
   },
   "838": {
+    "id": 838,
     "category": "Dynamic Programming",
+    "title": "Push Dominoes",
     "difficulty": "Medium",
-    "id": 838,
-    "link": "https://leetcode.com/problems/push-dominoes/",
-    "title": "Push Dominoes"
+    "link": "https://leetcode.com/problems/push-dominoes/"
   },
   "839": {
+    "id": 839,
     "category": "Graph Traversal",
+    "title": "Similar String Groups",
     "difficulty": "Hard",
-    "id": 839,
-    "link": "https://leetcode.com/problems/similar-string-groups/",
-    "title": "Similar String Groups"
+    "link": "https://leetcode.com/problems/similar-string-groups/"
   },
   "840": {
+    "id": 840,
     "category": "Math & Geometry",
+    "title": "Magic Squares In Grid",
     "difficulty": "Medium",
-    "id": 840,
-    "link": "https://leetcode.com/problems/magic-squares-in-grid/",
-    "title": "Magic Squares In Grid"
+    "link": "https://leetcode.com/problems/magic-squares-in-grid/"
   },
   "841": {
+    "id": 841,
     "category": "Graph Traversal",
+    "title": "Keys and Rooms",
     "difficulty": "Medium",
-    "id": 841,
-    "link": "https://leetcode.com/problems/keys-and-rooms/",
-    "title": "Keys and Rooms"
+    "link": "https://leetcode.com/problems/keys-and-rooms/"
   },
   "842": {
+    "id": 842,
     "category": "Backtracking",
+    "title": "Split Array into Fibonacci Sequence",
     "difficulty": "Medium",
-    "id": 842,
-    "link": "https://leetcode.com/problems/split-array-into-fibonacci-sequence/",
-    "title": "Split Array into Fibonacci Sequence"
+    "link": "https://leetcode.com/problems/split-array-into-fibonacci-sequence/"
   },
   "843": {
+    "id": 843,
     "category": "Math & Geometry",
+    "title": "Guess the Word",
     "difficulty": "Hard",
-    "id": 843,
-    "link": "https://leetcode.com/problems/guess-the-word/",
-    "title": "Guess the Word"
+    "link": "https://leetcode.com/problems/guess-the-word/"
   },
   "844": {
+    "id": 844,
     "category": "Stack",
+    "title": "Backspace String Compare",
     "difficulty": "Easy",
-    "id": 844,
-    "link": "https://leetcode.com/problems/backspace-string-compare/",
-    "title": "Backspace String Compare"
+    "link": "https://leetcode.com/problems/backspace-string-compare/"
   },
   "845": {
+    "id": 845,
     "category": "Dynamic Programming",
+    "title": "Longest Mountain in Array",
     "difficulty": "Medium",
-    "id": 845,
-    "link": "https://leetcode.com/problems/longest-mountain-in-array/",
-    "title": "Longest Mountain in Array"
+    "link": "https://leetcode.com/problems/longest-mountain-in-array/"
   },
   "846": {
+    "id": 846,
     "category": "Greedy",
+    "title": "Hand of Straights",
     "difficulty": "Medium",
-    "id": 846,
-    "link": "https://leetcode.com/problems/hand-of-straights/",
-    "title": "Hand of Straights"
+    "link": "https://leetcode.com/problems/hand-of-straights/"
   },
   "847": {
+    "id": 847,
     "category": "Graph Traversal",
+    "title": "Shortest Path Visiting All Nodes",
     "difficulty": "Hard",
-    "id": 847,
-    "link": "https://leetcode.com/problems/shortest-path-visiting-all-nodes/",
-    "title": "Shortest Path Visiting All Nodes"
+    "link": "https://leetcode.com/problems/shortest-path-visiting-all-nodes/"
   },
   "848": {
+    "id": 848,
     "category": "Array & Hashing",
+    "title": "Shifting Letters",
     "difficulty": "Medium",
-    "id": 848,
-    "link": "https://leetcode.com/problems/shifting-letters/",
-    "title": "Shifting Letters"
+    "link": "https://leetcode.com/problems/shifting-letters/"
   },
   "849": {
+    "id": 849,
     "category": "Array & Hashing",
+    "title": "Maximize Distance to Closest Person",
     "difficulty": "Medium",
-    "id": 849,
-    "link": "https://leetcode.com/problems/maximize-distance-to-closest-person/",
-    "title": "Maximize Distance to Closest Person"
+    "link": "https://leetcode.com/problems/maximize-distance-to-closest-person/"
   },
   "850": {
+    "id": 850,
     "category": "Tree",
+    "title": "Rectangle Area II",
     "difficulty": "Hard",
-    "id": 850,
-    "link": "https://leetcode.com/problems/rectangle-area-ii/",
-    "title": "Rectangle Area II"
+    "link": "https://leetcode.com/problems/rectangle-area-ii/"
   },
   "851": {
+    "id": 851,
     "category": "Graph Traversal",
+    "title": "Loud and Rich",
     "difficulty": "Medium",
-    "id": 851,
-    "link": "https://leetcode.com/problems/loud-and-rich/",
-    "title": "Loud and Rich"
+    "link": "https://leetcode.com/problems/loud-and-rich/"
   },
   "852": {
+    "id": 852,
     "category": "Binary Search",
+    "title": "Peak Index in a Mountain Array",
     "difficulty": "Medium",
-    "id": 852,
-    "link": "https://leetcode.com/problems/peak-index-in-a-mountain-array/",
-    "title": "Peak Index in a Mountain Array"
+    "link": "https://leetcode.com/problems/peak-index-in-a-mountain-array/"
   },
-  "853": {"category": "Stack", "difficulty": "Medium", "id": 853, "link": "https://leetcode.com/problems/car-fleet/", "title": "Car Fleet"},
-  "854": {
-    "category": "Graph Traversal",
-    "difficulty": "Hard",
+  "853": {
+    "id": 853,
+    "category": "Stack",
+    "title": "Car Fleet",
+    "difficulty": "Medium",
+    "link": "https://leetcode.com/problems/car-fleet/"
+  },
+  "854": {
     "id": 854,
-    "link": "https://leetcode.com/problems/k-similar-strings/",
-    "title": "K-Similar Strings"
+    "category": "Graph Traversal",
+    "title": "K-Similar Strings",
+    "difficulty": "Hard",
+    "link": "https://leetcode.com/problems/k-similar-strings/"
   },
   "855": {
+    "id": 855,
     "category": "Heap (Priority Queue)",
+    "title": "Exam Room",
     "difficulty": "Medium",
-    "id": 855,
-    "link": "https://leetcode.com/problems/exam-room/",
-    "title": "Exam Room"
+    "link": "https://leetcode.com/problems/exam-room/"
   },
   "856": {
+    "id": 856,
     "category": "Stack",
+    "title": "Score of Parentheses",
     "difficulty": "Medium",
-    "id": 856,
-    "link": "https://leetcode.com/problems/score-of-parentheses/",
-    "title": "Score of Parentheses"
+    "link": "https://leetcode.com/problems/score-of-parentheses/"
   },
   "857": {
+    "id": 857,
     "category": "Heap (Priority Queue)",
+    "title": "Minimum Cost to Hire K Workers",
     "difficulty": "Hard",
-    "id": 857,
-    "link": "https://leetcode.com/problems/minimum-cost-to-hire-k-workers/",
-    "title": "Minimum Cost to Hire K Workers"
+    "link": "https://leetcode.com/problems/minimum-cost-to-hire-k-workers/"
   },
   "858": {
+    "id": 858,
     "category": "Math & Geometry",
+    "title": "Mirror Reflection",
     "difficulty": "Medium",
-    "id": 858,
-    "link": "https://leetcode.com/problems/mirror-reflection/",
-    "title": "Mirror Reflection"
+    "link": "https://leetcode.com/problems/mirror-reflection/"
   },
   "859": {
+    "id": 859,
     "category": "Array & Hashing",
+    "title": "Buddy Strings",
     "difficulty": "Easy",
-    "id": 859,
-    "link": "https://leetcode.com/problems/buddy-strings/",
-    "title": "Buddy Strings"
+    "link": "https://leetcode.com/problems/buddy-strings/"
   },
   "860": {
+    "id": 860,
     "category": "Greedy",
+    "title": "Lemonade Change",
     "difficulty": "Easy",
-    "id": 860,
-    "link": "https://leetcode.com/problems/lemonade-change/",
-    "title": "Lemonade Change"
+    "link": "https://leetcode.com/problems/lemonade-change/"
   },
   "861": {
+    "id": 861,
     "category": "Bit Manipulation",
+    "title": "Score After Flipping Matrix",
     "difficulty": "Medium",
-    "id": 861,
-    "link": "https://leetcode.com/problems/score-after-flipping-matrix/",
-    "title": "Score After Flipping Matrix"
+    "link": "https://leetcode.com/problems/score-after-flipping-matrix/"
   },
   "862": {
+    "id": 862,
     "category": "Sliding Window",
+    "title": "Shortest Subarray with Sum at Least K",
     "difficulty": "Hard",
-    "id": 862,
-    "link": "https://leetcode.com/problems/shortest-subarray-with-sum-at-least-k/",
-    "title": "Shortest Subarray with Sum at Least K"
+    "link": "https://leetcode.com/problems/shortest-subarray-with-sum-at-least-k/"
   },
   "863": {
+    "id": 863,
     "category": "Tree",
+    "title": "All Nodes Distance K in Binary Tree",
     "difficulty": "Medium",
-    "id": 863,
-    "link": "https://leetcode.com/problems/all-nodes-distance-k-in-binary-tree/",
-    "title": "All Nodes Distance K in Binary Tree"
+    "link": "https://leetcode.com/problems/all-nodes-distance-k-in-binary-tree/"
   },
   "864": {
+    "id": 864,
     "category": "Graph Traversal",
+    "title": "Shortest Path to Get All Keys",
     "difficulty": "Hard",
-    "id": 864,
-    "link": "https://leetcode.com/problems/shortest-path-to-get-all-keys/",
-    "title": "Shortest Path to Get All Keys"
+    "link": "https://leetcode.com/problems/shortest-path-to-get-all-keys/"
   },
   "865": {
+    "id": 865,
     "category": "Tree",
+    "title": "Smallest Subtree with all the Deepest Nodes",
     "difficulty": "Medium",
-    "id": 865,
-    "link": "https://leetcode.com/problems/smallest-subtree-with-all-the-deepest-nodes/",
-    "title": "Smallest Subtree with all the Deepest Nodes"
+    "link": "https://leetcode.com/problems/smallest-subtree-with-all-the-deepest-nodes/"
   },
   "866": {
+    "id": 866,
     "category": "Math & Geometry",
+    "title": "Prime Palindrome",
     "difficulty": "Medium",
-    "id": 866,
-    "link": "https://leetcode.com/problems/prime-palindrome/",
-    "title": "Prime Palindrome"
+    "link": "https://leetcode.com/problems/prime-palindrome/"
   },
   "867": {
+    "id": 867,
     "category": "Array & Hashing",
+    "title": "Transpose Matrix",
     "difficulty": "Easy",
-    "id": 867,
-    "link": "https://leetcode.com/problems/transpose-matrix/",
-    "title": "Transpose Matrix"
+    "link": "https://leetcode.com/problems/transpose-matrix/"
   },
   "868": {
+    "id": 868,
     "category": "Bit Manipulation",
+    "title": "Binary Gap",
     "difficulty": "Easy",
-    "id": 868,
-    "link": "https://leetcode.com/problems/binary-gap/",
-    "title": "Binary Gap"
+    "link": "https://leetcode.com/problems/binary-gap/"
   },
   "869": {
+    "id": 869,
     "category": "Math & Geometry",
+    "title": "Reordered Power of 2",
     "difficulty": "Medium",
-    "id": 869,
-    "link": "https://leetcode.com/problems/reordered-power-of-2/",
-    "title": "Reordered Power of 2"
+    "link": "https://leetcode.com/problems/reordered-power-of-2/"
   },
   "870": {
+    "id": 870,
     "category": "Greedy",
+    "title": "Advantage Shuffle",
     "difficulty": "Medium",
-    "id": 870,
-    "link": "https://leetcode.com/problems/advantage-shuffle/",
-    "title": "Advantage Shuffle"
+    "link": "https://leetcode.com/problems/advantage-shuffle/"
   },
   "871": {
+    "id": 871,
     "category": "Dynamic Programming",
+    "title": "Minimum Number of Refueling Stops",
     "difficulty": "Hard",
-    "id": 871,
-    "link": "https://leetcode.com/problems/minimum-number-of-refueling-stops/",
-    "title": "Minimum Number of Refueling Stops"
+    "link": "https://leetcode.com/problems/minimum-number-of-refueling-stops/"
   },
   "872": {
+    "id": 872,
     "category": "Tree",
+    "title": "Leaf-Similar Trees",
     "difficulty": "Easy",
-    "id": 872,
-    "link": "https://leetcode.com/problems/leaf-similar-trees/",
-    "title": "Leaf-Similar Trees"
+    "link": "https://leetcode.com/problems/leaf-similar-trees/"
   },
   "873": {
+    "id": 873,
     "category": "Dynamic Programming",
+    "title": "Length of Longest Fibonacci Subsequence",
     "difficulty": "Medium",
-    "id": 873,
-    "link": "https://leetcode.com/problems/length-of-longest-fibonacci-subsequence/",
-    "title": "Length of Longest Fibonacci Subsequence"
+    "link": "https://leetcode.com/problems/length-of-longest-fibonacci-subsequence/"
   },
   "874": {
+    "id": 874,
     "category": "Array & Hashing",
+    "title": "Walking Robot Simulation",
     "difficulty": "Medium",
-    "id": 874,
-    "link": "https://leetcode.com/problems/walking-robot-simulation/",
-    "title": "Walking Robot Simulation"
+    "link": "https://leetcode.com/problems/walking-robot-simulation/"
   },
   "875": {
+    "id": 875,
     "category": "Binary Search",
+    "title": "Koko Eating Bananas",
     "difficulty": "Medium",
-    "id": 875,
-    "link": "https://leetcode.com/problems/koko-eating-bananas/",
-    "title": "Koko Eating Bananas"
+    "link": "https://leetcode.com/problems/koko-eating-bananas/"
   },
   "876": {
+    "id": 876,
     "category": "Linked List",
+    "title": "Middle of the Linked List",
     "difficulty": "Easy",
-    "id": 876,
-    "link": "https://leetcode.com/problems/middle-of-the-linked-list/",
-    "title": "Middle of the Linked List"
+    "link": "https://leetcode.com/problems/middle-of-the-linked-list/"
   },
   "877": {
+    "id": 877,
     "category": "Dynamic Programming",
+    "title": "Stone Game",
     "difficulty": "Medium",
-    "id": 877,
-    "link": "https://leetcode.com/problems/stone-game/",
-    "title": "Stone Game"
+    "link": "https://leetcode.com/problems/stone-game/"
   },
   "878": {
+    "id": 878,
     "category": "Binary Search",
+    "title": "Nth Magical Number",
     "difficulty": "Hard",
-    "id": 878,
-    "link": "https://leetcode.com/problems/nth-magical-number/",
-    "title": "Nth Magical Number"
+    "link": "https://leetcode.com/problems/nth-magical-number/"
   },
   "879": {
+    "id": 879,
     "category": "Dynamic Programming",
+    "title": "Profitable Schemes",
     "difficulty": "Hard",
-    "id": 879,
-    "link": "https://leetcode.com/problems/profitable-schemes/",
-    "title": "Profitable Schemes"
+    "link": "https://leetcode.com/problems/profitable-schemes/"
   },
   "880": {
+    "id": 880,
     "category": "Stack",
+    "title": "Decoded String at Index",
     "difficulty": "Medium",
-    "id": 880,
-    "link": "https://leetcode.com/problems/decoded-string-at-index/",
-    "title": "Decoded String at Index"
+    "link": "https://leetcode.com/problems/decoded-string-at-index/"
   },
   "881": {
+    "id": 881,
     "category": "Greedy",
+    "title": "Boats to Save People",
     "difficulty": "Medium",
-    "id": 881,
-    "link": "https://leetcode.com/problems/boats-to-save-people/",
-    "title": "Boats to Save People"
+    "link": "https://leetcode.com/problems/boats-to-save-people/"
   },
   "882": {
+    "id": 882,
     "category": "Graph Traversal",
+    "title": "Reachable Nodes In Subdivided Graph",
     "difficulty": "Hard",
-    "id": 882,
-    "link": "https://leetcode.com/problems/reachable-nodes-in-subdivided-graph/",
-    "title": "Reachable Nodes In Subdivided Graph"
+    "link": "https://leetcode.com/problems/reachable-nodes-in-subdivided-graph/"
   },
   "883": {
+    "id": 883,
     "category": "Math & Geometry",
+    "title": "Projection Area of 3D Shapes",
     "difficulty": "Easy",
-    "id": 883,
-    "link": "https://leetcode.com/problems/projection-area-of-3d-shapes/",
-    "title": "Projection Area of 3D Shapes"
+    "link": "https://leetcode.com/problems/projection-area-of-3d-shapes/"
   },
   "884": {
+    "id": 884,
     "category": "Array & Hashing",
+    "title": "Uncommon Words from Two Sentences",
     "difficulty": "Easy",
-    "id": 884,
-    "link": "https://leetcode.com/problems/uncommon-words-from-two-sentences/",
-    "title": "Uncommon Words from Two Sentences"
+    "link": "https://leetcode.com/problems/uncommon-words-from-two-sentences/"
   },
   "885": {
+    "id": 885,
     "category": "Array & Hashing",
+    "title": "Spiral Matrix III",
     "difficulty": "Medium",
-    "id": 885,
-    "link": "https://leetcode.com/problems/spiral-matrix-iii/",
-    "title": "Spiral Matrix III"
+    "link": "https://leetcode.com/problems/spiral-matrix-iii/"
   },
   "886": {
+    "id": 886,
     "category": "Graph Traversal",
+    "title": "Possible Bipartition",
     "difficulty": "Medium",
-    "id": 886,
-    "link": "https://leetcode.com/problems/possible-bipartition/",
-    "title": "Possible Bipartition"
+    "link": "https://leetcode.com/problems/possible-bipartition/"
   },
   "887": {
+    "id": 887,
     "category": "Dynamic Programming",
+    "title": "Super Egg Drop",
     "difficulty": "Hard",
-    "id": 887,
-    "link": "https://leetcode.com/problems/super-egg-drop/",
-    "title": "Super Egg Drop"
+    "link": "https://leetcode.com/problems/super-egg-drop/"
   },
   "888": {
+    "id": 888,
     "category": "Binary Search",
+    "title": "Fair Candy Swap",
     "difficulty": "Easy",
-    "id": 888,
-    "link": "https://leetcode.com/problems/fair-candy-swap/",
-    "title": "Fair Candy Swap"
+    "link": "https://leetcode.com/problems/fair-candy-swap/"
   },
   "889": {
+    "id": 889,
     "category": "Tree",
+    "title": "Construct Binary Tree from Preorder and Postorder Traversal",
     "difficulty": "Medium",
-    "id": 889,
-    "link": "https://leetcode.com/problems/construct-binary-tree-from-preorder-and-postorder-traversal/",
-    "title": "Construct Binary Tree from Preorder and Postorder Traversal"
+    "link": "https://leetcode.com/problems/construct-binary-tree-from-preorder-and-postorder-traversal/"
   },
   "890": {
+    "id": 890,
     "category": "Array & Hashing",
+    "title": "Find and Replace Pattern",
     "difficulty": "Medium",
-    "id": 890,
-    "link": "https://leetcode.com/problems/find-and-replace-pattern/",
-    "title": "Find and Replace Pattern"
+    "link": "https://leetcode.com/problems/find-and-replace-pattern/"
   },
   "891": {
+    "id": 891,
     "category": "Math & Geometry",
+    "title": "Sum of Subsequence Widths",
     "difficulty": "Hard",
-    "id": 891,
-    "link": "https://leetcode.com/problems/sum-of-subsequence-widths/",
-    "title": "Sum of Subsequence Widths"
+    "link": "https://leetcode.com/problems/sum-of-subsequence-widths/"
   },
   "892": {
+    "id": 892,
     "category": "Math & Geometry",
+    "title": "Surface Area of 3D Shapes",
     "difficulty": "Easy",
-    "id": 892,
-    "link": "https://leetcode.com/problems/surface-area-of-3d-shapes/",
-    "title": "Surface Area of 3D Shapes"
+    "link": "https://leetcode.com/problems/surface-area-of-3d-shapes/"
   },
   "893": {
+    "id": 893,
     "category": "Array & Hashing",
+    "title": "Groups of Special-Equivalent Strings",
     "difficulty": "Medium",
-    "id": 893,
-    "link": "https://leetcode.com/problems/groups-of-special-equivalent-strings/",
-    "title": "Groups of Special-Equivalent Strings"
+    "link": "https://leetcode.com/problems/groups-of-special-equivalent-strings/"
   },
   "894": {
+    "id": 894,
     "category": "Tree",
+    "title": "All Possible Full Binary Trees",
     "difficulty": "Medium",
-    "id": 894,
-    "link": "https://leetcode.com/problems/all-possible-full-binary-trees/",
-    "title": "All Possible Full Binary Trees"
+    "link": "https://leetcode.com/problems/all-possible-full-binary-trees/"
   },
   "895": {
+    "id": 895,
     "category": "Stack",
+    "title": "Maximum Frequency Stack",
     "difficulty": "Hard",
-    "id": 895,
-    "link": "https://leetcode.com/problems/maximum-frequency-stack/",
-    "title": "Maximum Frequency Stack"
+    "link": "https://leetcode.com/problems/maximum-frequency-stack/"
   },
   "896": {
+    "id": 896,
     "category": "Array & Hashing",
+    "title": "Monotonic Array",
     "difficulty": "Easy",
-    "id": 896,
-    "link": "https://leetcode.com/problems/monotonic-array/",
-    "title": "Monotonic Array"
+    "link": "https://leetcode.com/problems/monotonic-array/"
   },
   "897": {
+    "id": 897,
     "category": "Tree",
+    "title": "Increasing Order Search Tree",
     "difficulty": "Easy",
-    "id": 897,
-    "link": "https://leetcode.com/problems/increasing-order-search-tree/",
-    "title": "Increasing Order Search Tree"
+    "link": "https://leetcode.com/problems/increasing-order-search-tree/"
   },
   "898": {
+    "id": 898,
     "category": "Dynamic Programming",
+    "title": "Bitwise ORs of Subarrays",
     "difficulty": "Medium",
-    "id": 898,
-    "link": "https://leetcode.com/problems/bitwise-ors-of-subarrays/",
-    "title": "Bitwise ORs of Subarrays"
+    "link": "https://leetcode.com/problems/bitwise-ors-of-subarrays/"
   },
   "899": {
+    "id": 899,
     "category": "Math & Geometry",
+    "title": "Orderly Queue",
     "difficulty": "Hard",
-    "id": 899,
-    "link": "https://leetcode.com/problems/orderly-queue/",
-    "title": "Orderly Queue"
+    "link": "https://leetcode.com/problems/orderly-queue/"
   },
   "900": {
+    "id": 900,
     "category": "Array & Hashing",
+    "title": "RLE Iterator",
     "difficulty": "Medium",
-    "id": 900,
-    "link": "https://leetcode.com/problems/rle-iterator/",
-    "title": "RLE Iterator"
+    "link": "https://leetcode.com/problems/rle-iterator/"
   },
   "901": {
+    "id": 901,
     "category": "Stack",
+    "title": "Online Stock Span",
     "difficulty": "Medium",
-    "id": 901,
-    "link": "https://leetcode.com/problems/online-stock-span/",
-    "title": "Online Stock Span"
+    "link": "https://leetcode.com/problems/online-stock-span/"
   },
   "902": {
+    "id": 902,
     "category": "Dynamic Programming",
+    "title": "Numbers At Most N Given Digit Set",
     "difficulty": "Hard",
-    "id": 902,
-    "link": "https://leetcode.com/problems/numbers-at-most-n-given-digit-set/",
-    "title": "Numbers At Most N Given Digit Set"
+    "link": "https://leetcode.com/problems/numbers-at-most-n-given-digit-set/"
   },
   "903": {
+    "id": 903,
     "category": "Dynamic Programming",
+    "title": "Valid Permutations for DI Sequence",
     "difficulty": "Hard",
-    "id": 903,
-    "link": "https://leetcode.com/problems/valid-permutations-for-di-sequence/",
-    "title": "Valid Permutations for DI Sequence"
+    "link": "https://leetcode.com/problems/valid-permutations-for-di-sequence/"
   },
   "904": {
+    "id": 904,
     "category": "Sliding Window",
+    "title": "Fruit Into Baskets",
     "difficulty": "Medium",
-    "id": 904,
-    "link": "https://leetcode.com/problems/fruit-into-baskets/",
-    "title": "Fruit Into Baskets"
+    "link": "https://leetcode.com/problems/fruit-into-baskets/"
   },
   "905": {
+    "id": 905,
     "category": "Two Pointers",
+    "title": "Sort Array By Parity",
     "difficulty": "Easy",
-    "id": 905,
-    "link": "https://leetcode.com/problems/sort-array-by-parity/",
-    "title": "Sort Array By Parity"
+    "link": "https://leetcode.com/problems/sort-array-by-parity/"
   },
   "906": {
+    "id": 906,
     "category": "Math & Geometry",
+    "title": "Super Palindromes",
     "difficulty": "Hard",
-    "id": 906,
-    "link": "https://leetcode.com/problems/super-palindromes/",
-    "title": "Super Palindromes"
+    "link": "https://leetcode.com/problems/super-palindromes/"
   },
   "907": {
+    "id": 907,
     "category": "Dynamic Programming",
+    "title": "Sum of Subarray Minimums",
     "difficulty": "Medium",
-    "id": 907,
-    "link": "https://leetcode.com/problems/sum-of-subarray-minimums/",
-    "title": "Sum of Subarray Minimums"
+    "link": "https://leetcode.com/problems/sum-of-subarray-minimums/"
   },
   "908": {
+    "id": 908,
     "category": "Math & Geometry",
+    "title": "Smallest Range I",
     "difficulty": "Easy",
-    "id": 908,
-    "link": "https://leetcode.com/problems/smallest-range-i/",
-    "title": "Smallest Range I"
+    "link": "https://leetcode.com/problems/smallest-range-i/"
   },
   "909": {
+    "id": 909,
     "category": "Graph Traversal",
+    "title": "Snakes and Ladders",
     "difficulty": "Medium",
-    "id": 909,
-    "link": "https://leetcode.com/problems/snakes-and-ladders/",
-    "title": "Snakes and Ladders"
+    "link": "https://leetcode.com/problems/snakes-and-ladders/"
   },
   "910": {
+    "id": 910,
     "category": "Greedy",
+    "title": "Smallest Range II",
     "difficulty": "Medium",
-    "id": 910,
-    "link": "https://leetcode.com/problems/smallest-range-ii/",
-    "title": "Smallest Range II"
+    "link": "https://leetcode.com/problems/smallest-range-ii/"
   },
   "911": {
+    "id": 911,
     "category": "Binary Search",
+    "title": "Online Election",
     "difficulty": "Medium",
-    "id": 911,
-    "link": "https://leetcode.com/problems/online-election/",
-    "title": "Online Election"
+    "link": "https://leetcode.com/problems/online-election/"
   },
   "912": {
+    "id": 912,
     "category": "Heap (Priority Queue)",
+    "title": "Sort an Array",
     "difficulty": "Medium",
-    "id": 912,
-    "link": "https://leetcode.com/problems/sort-an-array/",
-    "title": "Sort an Array"
+    "link": "https://leetcode.com/problems/sort-an-array/"
   },
   "913": {
+    "id": 913,
     "category": "Graph Traversal",
+    "title": "Cat and Mouse",
     "difficulty": "Hard",
-    "id": 913,
-    "link": "https://leetcode.com/problems/cat-and-mouse/",
-    "title": "Cat and Mouse"
+    "link": "https://leetcode.com/problems/cat-and-mouse/"
   },
   "914": {
+    "id": 914,
     "category": "Math & Geometry",
+    "title": "X of a Kind in a Deck of Cards",
     "difficulty": "Easy",
-    "id": 914,
-    "link": "https://leetcode.com/problems/x-of-a-kind-in-a-deck-of-cards/",
-    "title": "X of a Kind in a Deck of Cards"
+    "link": "https://leetcode.com/problems/x-of-a-kind-in-a-deck-of-cards/"
   },
   "915": {
+    "id": 915,
     "category": "Array & Hashing",
+    "title": "Partition Array into Disjoint Intervals",
     "difficulty": "Medium",
-    "id": 915,
-    "link": "https://leetcode.com/problems/partition-array-into-disjoint-intervals/",
-    "title": "Partition Array into Disjoint Intervals"
+    "link": "https://leetcode.com/problems/partition-array-into-disjoint-intervals/"
   },
   "916": {
+    "id": 916,
     "category": "Array & Hashing",
+    "title": "Word Subsets",
     "difficulty": "Medium",
-    "id": 916,
-    "link": "https://leetcode.com/problems/word-subsets/",
-    "title": "Word Subsets"
+    "link": "https://leetcode.com/problems/word-subsets/"
   },
   "917": {
+    "id": 917,
     "category": "Two Pointers",
+    "title": "Reverse Only Letters",
     "difficulty": "Easy",
-    "id": 917,
-    "link": "https://leetcode.com/problems/reverse-only-letters/",
-    "title": "Reverse Only Letters"
+    "link": "https://leetcode.com/problems/reverse-only-letters/"
   },
   "918": {
+    "id": 918,
     "category": "Dynamic Programming",
+    "title": "Maximum Sum Circular Subarray",
     "difficulty": "Medium",
-    "id": 918,
-    "link": "https://leetcode.com/problems/maximum-sum-circular-subarray/",
-    "title": "Maximum Sum Circular Subarray"
+    "link": "https://leetcode.com/problems/maximum-sum-circular-subarray/"
   },
   "919": {
+    "id": 919,
     "category": "Tree",
+    "title": "Complete Binary Tree Inserter",
     "difficulty": "Medium",
-    "id": 919,
-    "link": "https://leetcode.com/problems/complete-binary-tree-inserter/",
-    "title": "Complete Binary Tree Inserter"
+    "link": "https://leetcode.com/problems/complete-binary-tree-inserter/"
   },
   "920": {
+    "id": 920,
     "category": "Dynamic Programming",
+    "title": "Number of Music Playlists",
     "difficulty": "Hard",
-    "id": 920,
-    "link": "https://leetcode.com/problems/number-of-music-playlists/",
-    "title": "Number of Music Playlists"
+    "link": "https://leetcode.com/problems/number-of-music-playlists/"
   },
   "921": {
+    "id": 921,
     "category": "Stack",
+    "title": "Minimum Add to Make Parentheses Valid",
     "difficulty": "Medium",
-    "id": 921,
-    "link": "https://leetcode.com/problems/minimum-add-to-make-parentheses-valid/",
-    "title": "Minimum Add to Make Parentheses Valid"
+    "link": "https://leetcode.com/problems/minimum-add-to-make-parentheses-valid/"
   },
   "922": {
+    "id": 922,
     "category": "Two Pointers",
+    "title": "Sort Array By Parity II",
     "difficulty": "Easy",
-    "id": 922,
-    "link": "https://leetcode.com/problems/sort-array-by-parity-ii/",
-    "title": "Sort Array By Parity II"
+    "link": "https://leetcode.com/problems/sort-array-by-parity-ii/"
   },
   "923": {
+    "id": 923,
     "category": "Two Pointers",
+    "title": "3Sum With Multiplicity",
     "difficulty": "Medium",
-    "id": 923,
-    "link": "https://leetcode.com/problems/3sum-with-multiplicity/",
-    "title": "3Sum With Multiplicity"
+    "link": "https://leetcode.com/problems/3sum-with-multiplicity/"
   },
   "924": {
+    "id": 924,
     "category": "Graph Traversal",
+    "title": "Minimize Malware Spread",
     "difficulty": "Hard",
-    "id": 924,
-    "link": "https://leetcode.com/problems/minimize-malware-spread/",
-    "title": "Minimize Malware Spread"
+    "link": "https://leetcode.com/problems/minimize-malware-spread/"
   },
   "925": {
+    "id": 925,
     "category": "Two Pointers",
+    "title": "Long Pressed Name",
     "difficulty": "Easy",
-    "id": 925,
-    "link": "https://leetcode.com/problems/long-pressed-name/",
-    "title": "Long Pressed Name"
+    "link": "https://leetcode.com/problems/long-pressed-name/"
   },
   "926": {
+    "id": 926,
     "category": "Dynamic Programming",
+    "title": "Flip String to Monotone Increasing",
     "difficulty": "Medium",
-    "id": 926,
-    "link": "https://leetcode.com/problems/flip-string-to-monotone-increasing/",
-    "title": "Flip String to Monotone Increasing"
+    "link": "https://leetcode.com/problems/flip-string-to-monotone-increasing/"
   },
   "927": {
+    "id": 927,
     "category": "Math & Geometry",
+    "title": "Three Equal Parts",
     "difficulty": "Hard",
-    "id": 927,
-    "link": "https://leetcode.com/problems/three-equal-parts/",
-    "title": "Three Equal Parts"
+    "link": "https://leetcode.com/problems/three-equal-parts/"
   },
   "928": {
+    "id": 928,
     "category": "Graph Traversal",
+    "title": "Minimize Malware Spread II",
     "difficulty": "Hard",
-    "id": 928,
-    "link": "https://leetcode.com/problems/minimize-malware-spread-ii/",
-    "title": "Minimize Malware Spread II"
+    "link": "https://leetcode.com/problems/minimize-malware-spread-ii/"
   },
   "929": {
+    "id": 929,
     "category": "Array & Hashing",
+    "title": "Unique Email Addresses",
     "difficulty": "Easy",
-    "id": 929,
-    "link": "https://leetcode.com/problems/unique-email-addresses/",
-    "title": "Unique Email Addresses"
+    "link": "https://leetcode.com/problems/unique-email-addresses/"
   },
   "930": {
+    "id": 930,
     "category": "Sliding Window",
+    "title": "Binary Subarrays With Sum",
     "difficulty": "Medium",
-    "id": 930,
-    "link": "https://leetcode.com/problems/binary-subarrays-with-sum/",
-    "title": "Binary Subarrays With Sum"
+    "link": "https://leetcode.com/problems/binary-subarrays-with-sum/"
   },
   "931": {
+    "id": 931,
     "category": "Dynamic Programming",
+    "title": "Minimum Falling Path Sum",
     "difficulty": "Medium",
-    "id": 931,
-    "link": "https://leetcode.com/problems/minimum-falling-path-sum/",
-    "title": "Minimum Falling Path Sum"
+    "link": "https://leetcode.com/problems/minimum-falling-path-sum/"
   },
   "932": {
+    "id": 932,
     "category": "Math & Geometry",
+    "title": "Beautiful Array",
     "difficulty": "Medium",
-    "id": 932,
-    "link": "https://leetcode.com/problems/beautiful-array/",
-    "title": "Beautiful Array"
+    "link": "https://leetcode.com/problems/beautiful-array/"
   },
   "933": {
+    "id": 933,
     "category": "Array & Hashing",
+    "title": "Number of Recent Calls",
     "difficulty": "Easy",
-    "id": 933,
-    "link": "https://leetcode.com/problems/number-of-recent-calls/",
-    "title": "Number of Recent Calls"
+    "link": "https://leetcode.com/problems/number-of-recent-calls/"
   },
   "934": {
+    "id": 934,
     "category": "Graph Traversal",
+    "title": "Shortest Bridge",
     "difficulty": "Medium",
-    "id": 934,
-    "link": "https://leetcode.com/problems/shortest-bridge/",
-    "title": "Shortest Bridge"
+    "link": "https://leetcode.com/problems/shortest-bridge/"
   },
   "935": {
+    "id": 935,
     "category": "Dynamic Programming",
+    "title": "Knight Dialer",
     "difficulty": "Medium",
-    "id": 935,
-    "link": "https://leetcode.com/problems/knight-dialer/",
-    "title": "Knight Dialer"
+    "link": "https://leetcode.com/problems/knight-dialer/"
   },
   "936": {
+    "id": 936,
     "category": "Stack",
+    "title": "Stamping The Sequence",
     "difficulty": "Hard",
-    "id": 936,
-    "link": "https://leetcode.com/problems/stamping-the-sequence/",
-    "title": "Stamping The Sequence"
+    "link": "https://leetcode.com/problems/stamping-the-sequence/"
   },
   "937": {
+    "id": 937,
     "category": "Array & Hashing",
+    "title": "Reorder Data in Log Files",
     "difficulty": "Medium",
-    "id": 937,
-    "link": "https://leetcode.com/problems/reorder-data-in-log-files/",
-    "title": "Reorder Data in Log Files"
+    "link": "https://leetcode.com/problems/reorder-data-in-log-files/"
   },
   "938": {
+    "id": 938,
     "category": "Tree",
+    "title": "Range Sum of BST",
     "difficulty": "Easy",
-    "id": 938,
-    "link": "https://leetcode.com/problems/range-sum-of-bst/",
-    "title": "Range Sum of BST"
+    "link": "https://leetcode.com/problems/range-sum-of-bst/"
   },
   "939": {
+    "id": 939,
     "category": "Math & Geometry",
+    "title": "Minimum Area Rectangle",
     "difficulty": "Medium",
-    "id": 939,
-    "link": "https://leetcode.com/problems/minimum-area-rectangle/",
-    "title": "Minimum Area Rectangle"
+    "link": "https://leetcode.com/problems/minimum-area-rectangle/"
   },
   "940": {
+    "id": 940,
     "category": "Dynamic Programming",
+    "title": "Distinct Subsequences II",
     "difficulty": "Hard",
-    "id": 940,
-    "link": "https://leetcode.com/problems/distinct-subsequences-ii/",
-    "title": "Distinct Subsequences II"
+    "link": "https://leetcode.com/problems/distinct-subsequences-ii/"
   },
   "941": {
+    "id": 941,
     "category": "Array & Hashing",
+    "title": "Valid Mountain Array",
     "difficulty": "Easy",
-    "id": 941,
-    "link": "https://leetcode.com/problems/valid-mountain-array/",
-    "title": "Valid Mountain Array"
+    "link": "https://leetcode.com/problems/valid-mountain-array/"
   },
   "942": {
+    "id": 942,
     "category": "Greedy",
+    "title": "DI String Match",
     "difficulty": "Easy",
-    "id": 942,
-    "link": "https://leetcode.com/problems/di-string-match/",
-    "title": "DI String Match"
+    "link": "https://leetcode.com/problems/di-string-match/"
   },
   "943": {
+    "id": 943,
     "category": "Dynamic Programming",
+    "title": "Find the Shortest Superstring",
     "difficulty": "Hard",
-    "id": 943,
-    "link": "https://leetcode.com/problems/find-the-shortest-superstring/",
-    "title": "Find the Shortest Superstring"
+    "link": "https://leetcode.com/problems/find-the-shortest-superstring/"
   },
   "944": {
+    "id": 944,
     "category": "Array & Hashing",
+    "title": "Delete Columns to Make Sorted",
     "difficulty": "Easy",
-    "id": 944,
-    "link": "https://leetcode.com/problems/delete-columns-to-make-sorted/",
-    "title": "Delete Columns to Make Sorted"
+    "link": "https://leetcode.com/problems/delete-columns-to-make-sorted/"
   },
   "945": {
+    "id": 945,
     "category": "Greedy",
+    "title": "Minimum Increment to Make Array Unique",
     "difficulty": "Medium",
-    "id": 945,
-    "link": "https://leetcode.com/problems/minimum-increment-to-make-array-unique/",
-    "title": "Minimum Increment to Make Array Unique"
+    "link": "https://leetcode.com/problems/minimum-increment-to-make-array-unique/"
   },
   "946": {
+    "id": 946,
     "category": "Stack",
+    "title": "Validate Stack Sequences",
     "difficulty": "Medium",
-    "id": 946,
-    "link": "https://leetcode.com/problems/validate-stack-sequences/",
-    "title": "Validate Stack Sequences"
+    "link": "https://leetcode.com/problems/validate-stack-sequences/"
   },
   "947": {
+    "id": 947,
     "category": "Graph Traversal",
+    "title": "Most Stones Removed with Same Row or Column",
     "difficulty": "Medium",
-    "id": 947,
-    "link": "https://leetcode.com/problems/most-stones-removed-with-same-row-or-column/",
-    "title": "Most Stones Removed with Same Row or Column"
+    "link": "https://leetcode.com/problems/most-stones-removed-with-same-row-or-column/"
+  },
+  "948": {
+    "id": 948,
+    "category": "Greedy",
+    "title": "Bag of Tokens",
+    "difficulty": "Medium",
+    "link": "https://leetcode.com/problems/bag-of-tokens/"
   },
-  "948": {"category": "Greedy", "difficulty": "Medium", "id": 948, "link": "https://leetcode.com/problems/bag-of-tokens/", "title": "Bag of Tokens"},
   "949": {
+    "id": 949,
     "category": "Backtracking",
+    "title": "Largest Time for Given Digits",
     "difficulty": "Medium",
-    "id": 949,
-    "link": "https://leetcode.com/problems/largest-time-for-given-digits/",
-    "title": "Largest Time for Given Digits"
+    "link": "https://leetcode.com/problems/largest-time-for-given-digits/"
   },
   "950": {
+    "id": 950,
     "category": "Array & Hashing",
+    "title": "Reveal Cards In Increasing Order",
     "difficulty": "Medium",
-    "id": 950,
-    "link": "https://leetcode.com/problems/reveal-cards-in-increasing-order/",
-    "title": "Reveal Cards In Increasing Order"
+    "link": "https://leetcode.com/problems/reveal-cards-in-increasing-order/"
   },
   "951": {
+    "id": 951,
     "category": "Tree",
+    "title": "Flip Equivalent Binary Trees",
     "difficulty": "Medium",
-    "id": 951,
-    "link": "https://leetcode.com/problems/flip-equivalent-binary-trees/",
-    "title": "Flip Equivalent Binary Trees"
+    "link": "https://leetcode.com/problems/flip-equivalent-binary-trees/"
   },
   "952": {
+    "id": 952,
     "category": "Graph Traversal",
+    "title": "Largest Component Size by Common Factor",
     "difficulty": "Hard",
-    "id": 952,
-    "link": "https://leetcode.com/problems/largest-component-size-by-common-factor/",
-    "title": "Largest Component Size by Common Factor"
+    "link": "https://leetcode.com/problems/largest-component-size-by-common-factor/"
   },
   "953": {
+    "id": 953,
     "category": "Array & Hashing",
+    "title": "Verifying an Alien Dictionary",
     "difficulty": "Easy",
-    "id": 953,
-    "link": "https://leetcode.com/problems/verifying-an-alien-dictionary/",
-    "title": "Verifying an Alien Dictionary"
+    "link": "https://leetcode.com/problems/verifying-an-alien-dictionary/"
   },
   "954": {
+    "id": 954,
     "category": "Greedy",
+    "title": "Array of Doubled Pairs",
     "difficulty": "Medium",
-    "id": 954,
-    "link": "https://leetcode.com/problems/array-of-doubled-pairs/",
-    "title": "Array of Doubled Pairs"
+    "link": "https://leetcode.com/problems/array-of-doubled-pairs/"
   },
   "955": {
+    "id": 955,
     "category": "Greedy",
+    "title": "Delete Columns to Make Sorted II",
     "difficulty": "Medium",
-    "id": 955,
-    "link": "https://leetcode.com/problems/delete-columns-to-make-sorted-ii/",
-    "title": "Delete Columns to Make Sorted II"
+    "link": "https://leetcode.com/problems/delete-columns-to-make-sorted-ii/"
   },
   "956": {
+    "id": 956,
     "category": "Dynamic Programming",
+    "title": "Tallest Billboard",
     "difficulty": "Hard",
-    "id": 956,
-    "link": "https://leetcode.com/problems/tallest-billboard/",
-    "title": "Tallest Billboard"
+    "link": "https://leetcode.com/problems/tallest-billboard/"
   },
   "957": {
+    "id": 957,
     "category": "Bit Manipulation",
+    "title": "Prison Cells After N Days",
     "difficulty": "Medium",
-    "id": 957,
-    "link": "https://leetcode.com/problems/prison-cells-after-n-days/",
-    "title": "Prison Cells After N Days"
+    "link": "https://leetcode.com/problems/prison-cells-after-n-days/"
   },
   "958": {
+    "id": 958,
     "category": "Tree",
+    "title": "Check Completeness of a Binary Tree",
     "difficulty": "Medium",
-    "id": 958,
-    "link": "https://leetcode.com/problems/check-completeness-of-a-binary-tree/",
-    "title": "Check Completeness of a Binary Tree"
+    "link": "https://leetcode.com/problems/check-completeness-of-a-binary-tree/"
   },
   "959": {
+    "id": 959,
     "category": "Graph Traversal",
+    "title": "Regions Cut By Slashes",
     "difficulty": "Medium",
-    "id": 959,
-    "link": "https://leetcode.com/problems/regions-cut-by-slashes/",
-    "title": "Regions Cut By Slashes"
+    "link": "https://leetcode.com/problems/regions-cut-by-slashes/"
   },
   "960": {
+    "id": 960,
     "category": "Dynamic Programming",
+    "title": "Delete Columns to Make Sorted III",
     "difficulty": "Hard",
-    "id": 960,
-    "link": "https://leetcode.com/problems/delete-columns-to-make-sorted-iii/",
-    "title": "Delete Columns to Make Sorted III"
+    "link": "https://leetcode.com/problems/delete-columns-to-make-sorted-iii/"
   },
   "961": {
+    "id": 961,
     "category": "Array & Hashing",
+    "title": "N-Repeated Element in Size 2N Array",
     "difficulty": "Easy",
-    "id": 961,
-    "link": "https://leetcode.com/problems/n-repeated-element-in-size-2n-array/",
-    "title": "N-Repeated Element in Size 2N Array"
+    "link": "https://leetcode.com/problems/n-repeated-element-in-size-2n-array/"
   },
   "962": {
+    "id": 962,
     "category": "Stack",
+    "title": "Maximum Width Ramp",
     "difficulty": "Medium",
-    "id": 962,
-    "link": "https://leetcode.com/problems/maximum-width-ramp/",
-    "title": "Maximum Width Ramp"
+    "link": "https://leetcode.com/problems/maximum-width-ramp/"
   },
   "963": {
+    "id": 963,
     "category": "Math & Geometry",
+    "title": "Minimum Area Rectangle II",
     "difficulty": "Medium",
-    "id": 963,
-    "link": "https://leetcode.com/problems/minimum-area-rectangle-ii/",
-    "title": "Minimum Area Rectangle II"
+    "link": "https://leetcode.com/problems/minimum-area-rectangle-ii/"
   },
   "964": {
+    "id": 964,
     "category": "Dynamic Programming",
+    "title": "Least Operators to Express Number",
     "difficulty": "Hard",
-    "id": 964,
-    "link": "https://leetcode.com/problems/least-operators-to-express-number/",
-    "title": "Least Operators to Express Number"
+    "link": "https://leetcode.com/problems/least-operators-to-express-number/"
   },
   "965": {
+    "id": 965,
     "category": "Tree",
+    "title": "Univalued Binary Tree",
     "difficulty": "Easy",
-    "id": 965,
-    "link": "https://leetcode.com/problems/univalued-binary-tree/",
-    "title": "Univalued Binary Tree"
+    "link": "https://leetcode.com/problems/univalued-binary-tree/"
   },
   "966": {
+    "id": 966,
     "category": "Array & Hashing",
+    "title": "Vowel Spellchecker",
     "difficulty": "Medium",
-    "id": 966,
-    "link": "https://leetcode.com/problems/vowel-spellchecker/",
-    "title": "Vowel Spellchecker"
+    "link": "https://leetcode.com/problems/vowel-spellchecker/"
   },
   "967": {
+    "id": 967,
     "category": "Graph Traversal",
+    "title": "Numbers With Same Consecutive Differences",
     "difficulty": "Medium",
-    "id": 967,
-    "link": "https://leetcode.com/problems/numbers-with-same-consecutive-differences/",
-    "title": "Numbers With Same Consecutive Differences"
+    "link": "https://leetcode.com/problems/numbers-with-same-consecutive-differences/"
   },
   "968": {
+    "id": 968,
     "category": "Tree",
+    "title": "Binary Tree Cameras",
     "difficulty": "Hard",
-    "id": 968,
-    "link": "https://leetcode.com/problems/binary-tree-cameras/",
-    "title": "Binary Tree Cameras"
+    "link": "https://leetcode.com/problems/binary-tree-cameras/"
   },
   "969": {
+    "id": 969,
     "category": "Greedy",
+    "title": "Pancake Sorting",
     "difficulty": "Medium",
-    "id": 969,
-    "link": "https://leetcode.com/problems/pancake-sorting/",
-    "title": "Pancake Sorting"
+    "link": "https://leetcode.com/problems/pancake-sorting/"
   },
   "970": {
+    "id": 970,
     "category": "Math & Geometry",
+    "title": "Powerful Integers",
     "difficulty": "Medium",
-    "id": 970,
-    "link": "https://leetcode.com/problems/powerful-integers/",
-    "title": "Powerful Integers"
+    "link": "https://leetcode.com/problems/powerful-integers/"
   },
   "971": {
+    "id": 971,
     "category": "Tree",
+    "title": "Flip Binary Tree To Match Preorder Traversal",
     "difficulty": "Medium",
-    "id": 971,
-    "link": "https://leetcode.com/problems/flip-binary-tree-to-match-preorder-traversal/",
-    "title": "Flip Binary Tree To Match Preorder Traversal"
+    "link": "https://leetcode.com/problems/flip-binary-tree-to-match-preorder-traversal/"
   },
   "972": {
+    "id": 972,
     "category": "Math & Geometry",
+    "title": "Equal Rational Numbers",
     "difficulty": "Hard",
-    "id": 972,
-    "link": "https://leetcode.com/problems/equal-rational-numbers/",
-    "title": "Equal Rational Numbers"
+    "link": "https://leetcode.com/problems/equal-rational-numbers/"
   },
   "973": {
+    "id": 973,
     "category": "Heap (Priority Queue)",
+    "title": "K Closest Points to Origin",
     "difficulty": "Medium",
-    "id": 973,
-    "link": "https://leetcode.com/problems/k-closest-points-to-origin/",
-    "title": "K Closest Points to Origin"
+    "link": "https://leetcode.com/problems/k-closest-points-to-origin/"
   },
   "974": {
+    "id": 974,
     "category": "Array & Hashing",
+    "title": "Subarray Sums Divisible by K",
     "difficulty": "Medium",
-    "id": 974,
-    "link": "https://leetcode.com/problems/subarray-sums-divisible-by-k/",
-    "title": "Subarray Sums Divisible by K"
+    "link": "https://leetcode.com/problems/subarray-sums-divisible-by-k/"
   },
   "975": {
+    "id": 975,
     "category": "Dynamic Programming",
+    "title": "Odd Even Jump",
     "difficulty": "Hard",
-    "id": 975,
-    "link": "https://leetcode.com/problems/odd-even-jump/",
-    "title": "Odd Even Jump"
+    "link": "https://leetcode.com/problems/odd-even-jump/"
   },
   "976": {
+    "id": 976,
     "category": "Greedy",
+    "title": "Largest Perimeter Triangle",
     "difficulty": "Easy",
-    "id": 976,
-    "link": "https://leetcode.com/problems/largest-perimeter-triangle/",
-    "title": "Largest Perimeter Triangle"
+    "link": "https://leetcode.com/problems/largest-perimeter-triangle/"
   },
   "977": {
+    "id": 977,
     "category": "Two Pointers",
+    "title": "Squares of a Sorted Array",
     "difficulty": "Easy",
-    "id": 977,
-    "link": "https://leetcode.com/problems/squares-of-a-sorted-array/",
-    "title": "Squares of a Sorted Array"
+    "link": "https://leetcode.com/problems/squares-of-a-sorted-array/"
   },
   "978": {
+    "id": 978,
     "category": "Dynamic Programming",
+    "title": "Longest Turbulent Subarray",
     "difficulty": "Medium",
-    "id": 978,
-    "link": "https://leetcode.com/problems/longest-turbulent-subarray/",
-    "title": "Longest Turbulent Subarray"
+    "link": "https://leetcode.com/problems/longest-turbulent-subarray/"
   },
   "979": {
+    "id": 979,
     "category": "Tree",
+    "title": "Distribute Coins in Binary Tree",
     "difficulty": "Medium",
-    "id": 979,
-    "link": "https://leetcode.com/problems/distribute-coins-in-binary-tree/",
-    "title": "Distribute Coins in Binary Tree"
+    "link": "https://leetcode.com/problems/distribute-coins-in-binary-tree/"
   },
   "980": {
+    "id": 980,
     "category": "Backtracking",
+    "title": "Unique Paths III",
     "difficulty": "Hard",
-    "id": 980,
-    "link": "https://leetcode.com/problems/unique-paths-iii/",
-    "title": "Unique Paths III"
+    "link": "https://leetcode.com/problems/unique-paths-iii/"
   },
   "981": {
+    "id": 981,
     "category": "Binary Search",
+    "title": "Time Based Key-Value Store",
     "difficulty": "Medium",
-    "id": 981,
-    "link": "https://leetcode.com/problems/time-based-key-value-store/",
-    "title": "Time Based Key-Value Store"
+    "link": "https://leetcode.com/problems/time-based-key-value-store/"
   },
   "982": {
+    "id": 982,
     "category": "Bit Manipulation",
+    "title": "Triples with Bitwise AND Equal To Zero",
     "difficulty": "Hard",
-    "id": 982,
-    "link": "https://leetcode.com/problems/triples-with-bitwise-and-equal-to-zero/",
-    "title": "Triples with Bitwise AND Equal To Zero"
+    "link": "https://leetcode.com/problems/triples-with-bitwise-and-equal-to-zero/"
   },
   "983": {
+    "id": 983,
     "category": "Dynamic Programming",
+    "title": "Minimum Cost For Tickets",
     "difficulty": "Medium",
-    "id": 983,
-    "link": "https://leetcode.com/problems/minimum-cost-for-tickets/",
-    "title": "Minimum Cost For Tickets"
+    "link": "https://leetcode.com/problems/minimum-cost-for-tickets/"
   },
   "984": {
+    "id": 984,
     "category": "Greedy",
+    "title": "String Without AAA or BBB",
     "difficulty": "Medium",
-    "id": 984,
-    "link": "https://leetcode.com/problems/string-without-aaa-or-bbb/",
-    "title": "String Without AAA or BBB"
+    "link": "https://leetcode.com/problems/string-without-aaa-or-bbb/"
   },
   "985": {
+    "id": 985,
     "category": "Array & Hashing",
+    "title": "Sum of Even Numbers After Queries",
     "difficulty": "Medium",
-    "id": 985,
-    "link": "https://leetcode.com/problems/sum-of-even-numbers-after-queries/",
-    "title": "Sum of Even Numbers After Queries"
+    "link": "https://leetcode.com/problems/sum-of-even-numbers-after-queries/"
   },
   "986": {
+    "id": 986,
     "category": "Two Pointers",
+    "title": "Interval List Intersections",
     "difficulty": "Medium",
-    "id": 986,
-    "link": "https://leetcode.com/problems/interval-list-intersections/",
-    "title": "Interval List Intersections"
+    "link": "https://leetcode.com/problems/interval-list-intersections/"
   },
   "987": {
+    "id": 987,
     "category": "Tree",
+    "title": "Vertical Order Traversal of a Binary Tree",
     "difficulty": "Hard",
-    "id": 987,
-    "link": "https://leetcode.com/problems/vertical-order-traversal-of-a-binary-tree/",
-    "title": "Vertical Order Traversal of a Binary Tree"
+    "link": "https://leetcode.com/problems/vertical-order-traversal-of-a-binary-tree/"
   },
   "988": {
+    "id": 988,
     "category": "Tree",
+    "title": "Smallest String Starting From Leaf",
     "difficulty": "Medium",
-    "id": 988,
-    "link": "https://leetcode.com/problems/smallest-string-starting-from-leaf/",
-    "title": "Smallest String Starting From Leaf"
+    "link": "https://leetcode.com/problems/smallest-string-starting-from-leaf/"
   },
   "989": {
+    "id": 989,
     "category": "Math & Geometry",
+    "title": "Add to Array-Form of Integer",
     "difficulty": "Easy",
-    "id": 989,
-    "link": "https://leetcode.com/problems/add-to-array-form-of-integer/",
-    "title": "Add to Array-Form of Integer"
+    "link": "https://leetcode.com/problems/add-to-array-form-of-integer/"
   },
   "990": {
+    "id": 990,
     "category": "Graph Traversal",
+    "title": "Satisfiability of Equality Equations",
     "difficulty": "Medium",
-    "id": 990,
-    "link": "https://leetcode.com/problems/satisfiability-of-equality-equations/",
-    "title": "Satisfiability of Equality Equations"
+    "link": "https://leetcode.com/problems/satisfiability-of-equality-equations/"
   },
   "991": {
+    "id": 991,
     "category": "Greedy",
+    "title": "Broken Calculator",
     "difficulty": "Medium",
-    "id": 991,
-    "link": "https://leetcode.com/problems/broken-calculator/",
-    "title": "Broken Calculator"
+    "link": "https://leetcode.com/problems/broken-calculator/"
   },
   "992": {
+    "id": 992,
     "category": "Sliding Window",
+    "title": "Subarrays with K Different Integers",
     "difficulty": "Hard",
-    "id": 992,
-    "link": "https://leetcode.com/problems/subarrays-with-k-different-integers/",
-    "title": "Subarrays with K Different Integers"
+    "link": "https://leetcode.com/problems/subarrays-with-k-different-integers/"
   },
   "993": {
+    "id": 993,
     "category": "Tree",
+    "title": "Cousins in Binary Tree",
     "difficulty": "Easy",
-    "id": 993,
-    "link": "https://leetcode.com/problems/cousins-in-binary-tree/",
-    "title": "Cousins in Binary Tree"
+    "link": "https://leetcode.com/problems/cousins-in-binary-tree/"
   },
   "994": {
+    "id": 994,
     "category": "Graph Traversal",
+    "title": "Rotting Oranges",
     "difficulty": "Medium",
-    "id": 994,
-    "link": "https://leetcode.com/problems/rotting-oranges/",
-    "title": "Rotting Oranges"
+    "link": "https://leetcode.com/problems/rotting-oranges/"
   },
   "995": {
+    "id": 995,
     "category": "Sliding Window",
+    "title": "Minimum Number of K Consecutive Bit Flips",
     "difficulty": "Hard",
-    "id": 995,
-    "link": "https://leetcode.com/problems/minimum-number-of-k-consecutive-bit-flips/",
-    "title": "Minimum Number of K Consecutive Bit Flips"
+    "link": "https://leetcode.com/problems/minimum-number-of-k-consecutive-bit-flips/"
   },
   "996": {
+    "id": 996,
     "category": "Dynamic Programming",
+    "title": "Number of Squareful Arrays",
     "difficulty": "Hard",
-    "id": 996,
-    "link": "https://leetcode.com/problems/number-of-squareful-arrays/",
-    "title": "Number of Squareful Arrays"
+    "link": "https://leetcode.com/problems/number-of-squareful-arrays/"
   },
   "997": {
+    "id": 997,
     "category": "Graph Traversal",
+    "title": "Find the Town Judge",
     "difficulty": "Easy",
-    "id": 997,
-    "link": "https://leetcode.com/problems/find-the-town-judge/",
-    "title": "Find the Town Judge"
+    "link": "https://leetcode.com/problems/find-the-town-judge/"
   },
   "998": {
+    "id": 998,
     "category": "Tree",
+    "title": "Maximum Binary Tree II",
     "difficulty": "Medium",
-    "id": 998,
-    "link": "https://leetcode.com/problems/maximum-binary-tree-ii/",
-    "title": "Maximum Binary Tree II"
+    "link": "https://leetcode.com/problems/maximum-binary-tree-ii/"
   },
   "999": {
+    "id": 999,
     "category": "Array & Hashing",
+    "title": "Available Captures for Rook",
     "difficulty": "Easy",
-    "id": 999,
-    "link": "https://leetcode.com/problems/available-captures-for-rook/",
-    "title": "Available Captures for Rook"
+    "link": "https://leetcode.com/problems/available-captures-for-rook/"
   },
   "1000": {
+    "id": 1000,
     "category": "Dynamic Programming",
+    "title": "Minimum Cost to Merge Stones",
     "difficulty": "Hard",
-    "id": 1000,
-    "link": "https://leetcode.com/problems/minimum-cost-to-merge-stones/",
-    "title": "Minimum Cost to Merge Stones"
+    "link": "https://leetcode.com/problems/minimum-cost-to-merge-stones/"
   },
   "1001": {
+    "id": 1001,
     "category": "Array & Hashing",
+    "title": "Grid Illumination",
     "difficulty": "Hard",
-    "id": 1001,
-    "link": "https://leetcode.com/problems/grid-illumination/",
-    "title": "Grid Illumination"
+    "link": "https://leetcode.com/problems/grid-illumination/"
   },
   "1002": {
+    "id": 1002,
     "category": "Array & Hashing",
+    "title": "Find Common Characters",
     "difficulty": "Easy",
-    "id": 1002,
-    "link": "https://leetcode.com/problems/find-common-characters/",
-    "title": "Find Common Characters"
+    "link": "https://leetcode.com/problems/find-common-characters/"
   },
   "1003": {
+    "id": 1003,
     "category": "Stack",
+    "title": "Check If Word Is Valid After Substitutions",
     "difficulty": "Medium",
-    "id": 1003,
-    "link": "https://leetcode.com/problems/check-if-word-is-valid-after-substitutions/",
-    "title": "Check If Word Is Valid After Substitutions"
+    "link": "https://leetcode.com/problems/check-if-word-is-valid-after-substitutions/"
   },
   "1004": {
+    "id": 1004,
     "category": "Sliding Window",
+    "title": "Max Consecutive Ones III",
     "difficulty": "Medium",
-    "id": 1004,
-    "link": "https://leetcode.com/problems/max-consecutive-ones-iii/",
-    "title": "Max Consecutive Ones III"
+    "link": "https://leetcode.com/problems/max-consecutive-ones-iii/"
   },
   "1005": {
+    "id": 1005,
     "category": "Greedy",
+    "title": "Maximize Sum Of Array After K Negations",
     "difficulty": "Easy",
-    "id": 1005,
-    "link": "https://leetcode.com/problems/maximize-sum-of-array-after-k-negations/",
-    "title": "Maximize Sum Of Array After K Negations"
+    "link": "https://leetcode.com/problems/maximize-sum-of-array-after-k-negations/"
   },
   "1006": {
+    "id": 1006,
     "category": "Stack",
+    "title": "Clumsy Factorial",
     "difficulty": "Medium",
-    "id": 1006,
-    "link": "https://leetcode.com/problems/clumsy-factorial/",
-    "title": "Clumsy Factorial"
+    "link": "https://leetcode.com/problems/clumsy-factorial/"
   },
   "1007": {
+    "id": 1007,
     "category": "Greedy",
+    "title": "Minimum Domino Rotations For Equal Row",
     "difficulty": "Medium",
-    "id": 1007,
-    "link": "https://leetcode.com/problems/minimum-domino-rotations-for-equal-row/",
-    "title": "Minimum Domino Rotations For Equal Row"
+    "link": "https://leetcode.com/problems/minimum-domino-rotations-for-equal-row/"
   },
   "1008": {
+    "id": 1008,
     "category": "Tree",
+    "title": "Construct Binary Search Tree from Preorder Traversal",
     "difficulty": "Medium",
-    "id": 1008,
-    "link": "https://leetcode.com/problems/construct-binary-search-tree-from-preorder-traversal/",
-    "title": "Construct Binary Search Tree from Preorder Traversal"
+    "link": "https://leetcode.com/problems/construct-binary-search-tree-from-preorder-traversal/"
   },
   "1009": {
+    "id": 1009,
     "category": "Bit Manipulation",
+    "title": "Complement of Base 10 Integer",
     "difficulty": "Easy",
-    "id": 1009,
-    "link": "https://leetcode.com/problems/complement-of-base-10-integer/",
-    "title": "Complement of Base 10 Integer"
+    "link": "https://leetcode.com/problems/complement-of-base-10-integer/"
   },
   "1010": {
+    "id": 1010,
     "category": "Array & Hashing",
+    "title": "Pairs of Songs With Total Durations Divisible by 60",
     "difficulty": "Medium",
-    "id": 1010,
-    "link": "https://leetcode.com/problems/pairs-of-songs-with-total-durations-divisible-by-60/",
-    "title": "Pairs of Songs With Total Durations Divisible by 60"
+    "link": "https://leetcode.com/problems/pairs-of-songs-with-total-durations-divisible-by-60/"
   },
   "1011": {
+    "id": 1011,
     "category": "Binary Search",
+    "title": "Capacity To Ship Packages Within D Days",
     "difficulty": "Medium",
-    "id": 1011,
-    "link": "https://leetcode.com/problems/capacity-to-ship-packages-within-d-days/",
-    "title": "Capacity To Ship Packages Within D Days"
+    "link": "https://leetcode.com/problems/capacity-to-ship-packages-within-d-days/"
   },
   "1012": {
+    "id": 1012,
     "category": "Dynamic Programming",
+    "title": "Numbers With Repeated Digits",
     "difficulty": "Hard",
-    "id": 1012,
-    "link": "https://leetcode.com/problems/numbers-with-repeated-digits/",
-    "title": "Numbers With Repeated Digits"
+    "link": "https://leetcode.com/problems/numbers-with-repeated-digits/"
   },
   "1013": {
+    "id": 1013,
     "category": "Greedy",
+    "title": "Partition Array Into Three Parts With Equal Sum",
     "difficulty": "Easy",
-    "id": 1013,
-    "link": "https://leetcode.com/problems/partition-array-into-three-parts-with-equal-sum/",
-    "title": "Partition Array Into Three Parts With Equal Sum"
+    "link": "https://leetcode.com/problems/partition-array-into-three-parts-with-equal-sum/"
   },
   "1014": {
+    "id": 1014,
     "category": "Dynamic Programming",
+    "title": "Best Sightseeing Pair",
     "difficulty": "Medium",
-    "id": 1014,
-    "link": "https://leetcode.com/problems/best-sightseeing-pair/",
-    "title": "Best Sightseeing Pair"
+    "link": "https://leetcode.com/problems/best-sightseeing-pair/"
   },
   "1015": {
+    "id": 1015,
     "category": "Math & Geometry",
+    "title": "Smallest Integer Divisible by K",
     "difficulty": "Medium",
-    "id": 1015,
-    "link": "https://leetcode.com/problems/smallest-integer-divisible-by-k/",
-    "title": "Smallest Integer Divisible by K"
+    "link": "https://leetcode.com/problems/smallest-integer-divisible-by-k/"
   },
   "1016": {
+    "id": 1016,
     "category": "Sliding Window",
+    "title": "Binary String With Substrings Representing 1 To N",
     "difficulty": "Medium",
-    "id": 1016,
-    "link": "https://leetcode.com/problems/binary-string-with-substrings-representing-1-to-n/",
-    "title": "Binary String With Substrings Representing 1 To N"
+    "link": "https://leetcode.com/problems/binary-string-with-substrings-representing-1-to-n/"
   },
   "1017": {
+    "id": 1017,
     "category": "Math & Geometry",
+    "title": "Convert to Base -2",
     "difficulty": "Medium",
-    "id": 1017,
-    "link": "https://leetcode.com/problems/convert-to-base-2/",
-    "title": "Convert to Base -2"
+    "link": "https://leetcode.com/problems/convert-to-base-2/"
   },
   "1018": {
+    "id": 1018,
     "category": "Bit Manipulation",
+    "title": "Binary Prefix Divisible By 5",
     "difficulty": "Easy",
-    "id": 1018,
-    "link": "https://leetcode.com/problems/binary-prefix-divisible-by-5/",
-    "title": "Binary Prefix Divisible By 5"
+    "link": "https://leetcode.com/problems/binary-prefix-divisible-by-5/"
   },
   "1019": {
+    "id": 1019,
     "category": "Stack",
+    "title": "Next Greater Node In Linked List",
     "difficulty": "Medium",
-    "id": 1019,
-    "link": "https://leetcode.com/problems/next-greater-node-in-linked-list/",
-    "title": "Next Greater Node In Linked List"
+    "link": "https://leetcode.com/problems/next-greater-node-in-linked-list/"
   },
   "1020": {
+    "id": 1020,
     "category": "Graph Traversal",
+    "title": "Number of Enclaves",
     "difficulty": "Medium",
-    "id": 1020,
-    "link": "https://leetcode.com/problems/number-of-enclaves/",
-    "title": "Number of Enclaves"
+    "link": "https://leetcode.com/problems/number-of-enclaves/"
   },
   "1021": {
+    "id": 1021,
     "category": "Stack",
+    "title": "Remove Outermost Parentheses",
     "difficulty": "Easy",
-    "id": 1021,
-    "link": "https://leetcode.com/problems/remove-outermost-parentheses/",
-    "title": "Remove Outermost Parentheses"
+    "link": "https://leetcode.com/problems/remove-outermost-parentheses/"
   },
   "1022": {
+    "id": 1022,
     "category": "Tree",
+    "title": "Sum of Root To Leaf Binary Numbers",
     "difficulty": "Easy",
-    "id": 1022,
-    "link": "https://leetcode.com/problems/sum-of-root-to-leaf-binary-numbers/",
-    "title": "Sum of Root To Leaf Binary Numbers"
+    "link": "https://leetcode.com/problems/sum-of-root-to-leaf-binary-numbers/"
   },
   "1023": {
+    "id": 1023,
     "category": "Trie",
+    "title": "Camelcase Matching",
     "difficulty": "Medium",
-    "id": 1023,
-    "link": "https://leetcode.com/problems/camelcase-matching/",
-    "title": "Camelcase Matching"
+    "link": "https://leetcode.com/problems/camelcase-matching/"
   },
   "1024": {
+    "id": 1024,
     "category": "Dynamic Programming",
+    "title": "Video Stitching",
     "difficulty": "Medium",
-    "id": 1024,
-    "link": "https://leetcode.com/problems/video-stitching/",
-    "title": "Video Stitching"
+    "link": "https://leetcode.com/problems/video-stitching/"
   },
   "1025": {
+    "id": 1025,
     "category": "Dynamic Programming",
+    "title": "Divisor Game",
     "difficulty": "Easy",
-    "id": 1025,
-    "link": "https://leetcode.com/problems/divisor-game/",
-    "title": "Divisor Game"
+    "link": "https://leetcode.com/problems/divisor-game/"
   },
   "1026": {
+    "id": 1026,
     "category": "Tree",
+    "title": "Maximum Difference Between Node and Ancestor",
     "difficulty": "Medium",
-    "id": 1026,
-    "link": "https://leetcode.com/problems/maximum-difference-between-node-and-ancestor/",
-    "title": "Maximum Difference Between Node and Ancestor"
+    "link": "https://leetcode.com/problems/maximum-difference-between-node-and-ancestor/"
   },
   "1027": {
+    "id": 1027,
     "category": "Dynamic Programming",
+    "title": "Longest Arithmetic Subsequence",
     "difficulty": "Medium",
-    "id": 1027,
-    "link": "https://leetcode.com/problems/longest-arithmetic-subsequence/",
-    "title": "Longest Arithmetic Subsequence"
+    "link": "https://leetcode.com/problems/longest-arithmetic-subsequence/"
   },
   "1028": {
+    "id": 1028,
     "category": "Tree",
+    "title": "Recover a Tree From Preorder Traversal",
     "difficulty": "Hard",
-    "id": 1028,
-    "link": "https://leetcode.com/problems/recover-a-tree-from-preorder-traversal/",
-    "title": "Recover a Tree From Preorder Traversal"
+    "link": "https://leetcode.com/problems/recover-a-tree-from-preorder-traversal/"
   },
   "1029": {
+    "id": 1029,
     "category": "Greedy",
+    "title": "Two City Scheduling",
     "difficulty": "Medium",
-    "id": 1029,
-    "link": "https://leetcode.com/problems/two-city-scheduling/",
-    "title": "Two City Scheduling"
+    "link": "https://leetcode.com/problems/two-city-scheduling/"
   },
   "1030": {
+    "id": 1030,
     "category": "Math & Geometry",
+    "title": "Matrix Cells in Distance Order",
     "difficulty": "Easy",
-    "id": 1030,
-    "link": "https://leetcode.com/problems/matrix-cells-in-distance-order/",
-    "title": "Matrix Cells in Distance Order"
+    "link": "https://leetcode.com/problems/matrix-cells-in-distance-order/"
   },
   "1031": {
+    "id": 1031,
     "category": "Dynamic Programming",
+    "title": "Maximum Sum of Two Non-Overlapping Subarrays",
     "difficulty": "Medium",
-    "id": 1031,
-    "link": "https://leetcode.com/problems/maximum-sum-of-two-non-overlapping-subarrays/",
-    "title": "Maximum Sum of Two Non-Overlapping Subarrays"
+    "link": "https://leetcode.com/problems/maximum-sum-of-two-non-overlapping-subarrays/"
   },
   "1032": {
+    "id": 1032,
     "category": "Trie",
+    "title": "Stream of Characters",
     "difficulty": "Hard",
-    "id": 1032,
-    "link": "https://leetcode.com/problems/stream-of-characters/",
-    "title": "Stream of Characters"
+    "link": "https://leetcode.com/problems/stream-of-characters/"
   },
   "1033": {
+    "id": 1033,
     "category": "Math & Geometry",
+    "title": "Moving Stones Until Consecutive",
     "difficulty": "Medium",
-    "id": 1033,
-    "link": "https://leetcode.com/problems/moving-stones-until-consecutive/",
-    "title": "Moving Stones Until Consecutive"
+    "link": "https://leetcode.com/problems/moving-stones-until-consecutive/"
   },
   "1034": {
+    "id": 1034,
     "category": "Graph Traversal",
+    "title": "Coloring A Border",
     "difficulty": "Medium",
-    "id": 1034,
-    "link": "https://leetcode.com/problems/coloring-a-border/",
-    "title": "Coloring A Border"
+    "link": "https://leetcode.com/problems/coloring-a-border/"
   },
   "1035": {
+    "id": 1035,
     "category": "Dynamic Programming",
+    "title": "Uncrossed Lines",
     "difficulty": "Medium",
-    "id": 1035,
-    "link": "https://leetcode.com/problems/uncrossed-lines/",
-    "title": "Uncrossed Lines"
+    "link": "https://leetcode.com/problems/uncrossed-lines/"
   },
   "1036": {
+    "id": 1036,
     "category": "Graph Traversal",
+    "title": "Escape a Large Maze",
     "difficulty": "Hard",
-    "id": 1036,
-    "link": "https://leetcode.com/problems/escape-a-large-maze/",
-    "title": "Escape a Large Maze"
+    "link": "https://leetcode.com/problems/escape-a-large-maze/"
   },
   "1037": {
+    "id": 1037,
     "category": "Math & Geometry",
+    "title": "Valid Boomerang",
     "difficulty": "Easy",
-    "id": 1037,
-    "link": "https://leetcode.com/problems/valid-boomerang/",
-    "title": "Valid Boomerang"
+    "link": "https://leetcode.com/problems/valid-boomerang/"
   },
   "1038": {
+    "id": 1038,
     "category": "Tree",
+    "title": "Binary Search Tree to Greater Sum Tree",
     "difficulty": "Medium",
-    "id": 1038,
-    "link": "https://leetcode.com/problems/binary-search-tree-to-greater-sum-tree/",
-    "title": "Binary Search Tree to Greater Sum Tree"
+    "link": "https://leetcode.com/problems/binary-search-tree-to-greater-sum-tree/"
   },
   "1039": {
+    "id": 1039,
     "category": "Dynamic Programming",
+    "title": "Minimum Score Triangulation of Polygon",
     "difficulty": "Medium",
-    "id": 1039,
-    "link": "https://leetcode.com/problems/minimum-score-triangulation-of-polygon/",
-    "title": "Minimum Score Triangulation of Polygon"
+    "link": "https://leetcode.com/problems/minimum-score-triangulation-of-polygon/"
   },
   "1040": {
+    "id": 1040,
     "category": "Sliding Window",
+    "title": "Moving Stones Until Consecutive II",
     "difficulty": "Medium",
-    "id": 1040,
-    "link": "https://leetcode.com/problems/moving-stones-until-consecutive-ii/",
-    "title": "Moving Stones Until Consecutive II"
+    "link": "https://leetcode.com/problems/moving-stones-until-consecutive-ii/"
   },
   "1041": {
+    "id": 1041,
     "category": "Math & Geometry",
+    "title": "Robot Bounded In Circle",
     "difficulty": "Medium",
-    "id": 1041,
-    "link": "https://leetcode.com/problems/robot-bounded-in-circle/",
-    "title": "Robot Bounded In Circle"
+    "link": "https://leetcode.com/problems/robot-bounded-in-circle/"
   },
   "1042": {
+    "id": 1042,
     "category": "Graph Traversal",
+    "title": "Flower Planting With No Adjacent",
     "difficulty": "Medium",
-    "id": 1042,
-    "link": "https://leetcode.com/problems/flower-planting-with-no-adjacent/",
-    "title": "Flower Planting With No Adjacent"
+    "link": "https://leetcode.com/problems/flower-planting-with-no-adjacent/"
   },
   "1043": {
+    "id": 1043,
     "category": "Dynamic Programming",
+    "title": "Partition Array for Maximum Sum",
     "difficulty": "Medium",
-    "id": 1043,
-    "link": "https://leetcode.com/problems/partition-array-for-maximum-sum/",
-    "title": "Partition Array for Maximum Sum"
+    "link": "https://leetcode.com/problems/partition-array-for-maximum-sum/"
   },
   "1044": {
+    "id": 1044,
     "category": "Sliding Window",
+    "title": "Longest Duplicate Substring",
     "difficulty": "Hard",
-    "id": 1044,
-    "link": "https://leetcode.com/problems/longest-duplicate-substring/",
-    "title": "Longest Duplicate Substring"
+    "link": "https://leetcode.com/problems/longest-duplicate-substring/"
   },
   "1045": {
+    "id": 1045,
     "category": "Database",
+    "title": "Customers Who Bought All Products",
     "difficulty": "Medium",
-    "id": 1045,
-    "link": "https://leetcode.com/problems/customers-who-bought-all-products/",
-    "title": "Customers Who Bought All Products"
+    "link": "https://leetcode.com/problems/customers-who-bought-all-products/"
   },
   "1046": {
+    "id": 1046,
     "category": "Heap (Priority Queue)",
+    "title": "Last Stone Weight",
     "difficulty": "Easy",
-    "id": 1046,
-    "link": "https://leetcode.com/problems/last-stone-weight/",
-    "title": "Last Stone Weight"
+    "link": "https://leetcode.com/problems/last-stone-weight/"
   },
   "1047": {
+    "id": 1047,
     "category": "Stack",
+    "title": "Remove All Adjacent Duplicates In String",
     "difficulty": "Easy",
-    "id": 1047,
-    "link": "https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string/",
-    "title": "Remove All Adjacent Duplicates In String"
+    "link": "https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string/"
   },
   "1048": {
+    "id": 1048,
     "category": "Dynamic Programming",
+    "title": "Longest String Chain",
     "difficulty": "Medium",
-    "id": 1048,
-    "link": "https://leetcode.com/problems/longest-string-chain/",
-    "title": "Longest String Chain"
+    "link": "https://leetcode.com/problems/longest-string-chain/"
   },
   "1049": {
+    "id": 1049,
     "category": "Dynamic Programming",
+    "title": "Last Stone Weight II",
     "difficulty": "Medium",
-    "id": 1049,
-    "link": "https://leetcode.com/problems/last-stone-weight-ii/",
-    "title": "Last Stone Weight II"
+    "link": "https://leetcode.com/problems/last-stone-weight-ii/"
   },
   "1050": {
+    "id": 1050,
     "category": "Database",
+    "title": "Actors and Directors Who Cooperated At Least Three Times",
     "difficulty": "Easy",
-    "id": 1050,
-    "link": "https://leetcode.com/problems/actors-and-directors-who-cooperated-at-least-three-times/",
-    "title": "Actors and Directors Who Cooperated At Least Three Times"
+    "link": "https://leetcode.com/problems/actors-and-directors-who-cooperated-at-least-three-times/"
   },
   "1051": {
+    "id": 1051,
     "category": "Array & Hashing",
+    "title": "Height Checker",
     "difficulty": "Easy",
-    "id": 1051,
-    "link": "https://leetcode.com/problems/height-checker/",
-    "title": "Height Checker"
+    "link": "https://leetcode.com/problems/height-checker/"
   },
   "1052": {
+    "id": 1052,
     "category": "Sliding Window",
+    "title": "Grumpy Bookstore Owner",
     "difficulty": "Medium",
-    "id": 1052,
-    "link": "https://leetcode.com/problems/grumpy-bookstore-owner/",
-    "title": "Grumpy Bookstore Owner"
+    "link": "https://leetcode.com/problems/grumpy-bookstore-owner/"
   },
   "1053": {
+    "id": 1053,
     "category": "Greedy",
+    "title": "Previous Permutation With One Swap",
     "difficulty": "Medium",
-    "id": 1053,
-    "link": "https://leetcode.com/problems/previous-permutation-with-one-swap/",
-    "title": "Previous Permutation With One Swap"
+    "link": "https://leetcode.com/problems/previous-permutation-with-one-swap/"
   },
   "1054": {
+    "id": 1054,
     "category": "Heap (Priority Queue)",
+    "title": "Distant Barcodes",
     "difficulty": "Medium",
-    "id": 1054,
-    "link": "https://leetcode.com/problems/distant-barcodes/",
-    "title": "Distant Barcodes"
+    "link": "https://leetcode.com/problems/distant-barcodes/"
   },
   "1055": {
+    "id": 1055,
     "category": "Binary Search",
+    "title": "Shortest Way to Form String",
     "difficulty": "Medium",
-    "id": 1055,
-    "link": "https://leetcode.com/problems/shortest-way-to-form-string/",
-    "title": "Shortest Way to Form String"
+    "link": "https://leetcode.com/problems/shortest-way-to-form-string/"
   },
   "1056": {
+    "id": 1056,
     "category": "Math & Geometry",
+    "title": "Confusing Number",
     "difficulty": "Easy",
-    "id": 1056,
-    "link": "https://leetcode.com/problems/confusing-number/",
-    "title": "Confusing Number"
+    "link": "https://leetcode.com/problems/confusing-number/"
   },
   "1057": {
+    "id": 1057,
     "category": "Heap (Priority Queue)",
+    "title": "Campus Bikes",
     "difficulty": "Medium",
-    "id": 1057,
-    "link": "https://leetcode.com/problems/campus-bikes/",
-    "title": "Campus Bikes"
+    "link": "https://leetcode.com/problems/campus-bikes/"
   },
   "1058": {
+    "id": 1058,
     "category": "Greedy",
+    "title": "Minimize Rounding Error to Meet Target",
     "difficulty": "Medium",
-    "id": 1058,
-    "link": "https://leetcode.com/problems/minimize-rounding-error-to-meet-target/",
-    "title": "Minimize Rounding Error to Meet Target"
+    "link": "https://leetcode.com/problems/minimize-rounding-error-to-meet-target/"
   },
   "1059": {
+    "id": 1059,
     "category": "Graph Traversal",
+    "title": "All Paths from Source Lead to Destination",
     "difficulty": "Medium",
-    "id": 1059,
-    "link": "https://leetcode.com/problems/all-paths-from-source-lead-to-destination/",
-    "title": "All Paths from Source Lead to Destination"
+    "link": "https://leetcode.com/problems/all-paths-from-source-lead-to-destination/"
   },
   "1060": {
+    "id": 1060,
     "category": "Binary Search",
+    "title": "Missing Element in Sorted Array",
     "difficulty": "Medium",
-    "id": 1060,
-    "link": "https://leetcode.com/problems/missing-element-in-sorted-array/",
-    "title": "Missing Element in Sorted Array"
+    "link": "https://leetcode.com/problems/missing-element-in-sorted-array/"
   },
   "1061": {
+    "id": 1061,
     "category": "Graph Traversal",
+    "title": "Lexicographically Smallest Equivalent String",
     "difficulty": "Medium",
-    "id": 1061,
-    "link": "https://leetcode.com/problems/lexicographically-smallest-equivalent-string/",
-    "title": "Lexicographically Smallest Equivalent String"
+    "link": "https://leetcode.com/problems/lexicographically-smallest-equivalent-string/"
   },
   "1062": {
+    "id": 1062,
     "category": "Dynamic Programming",
+    "title": "Longest Repeating Substring",
     "difficulty": "Medium",
-    "id": 1062,
-    "link": "https://leetcode.com/problems/longest-repeating-substring/",
-    "title": "Longest Repeating Substring"
+    "link": "https://leetcode.com/problems/longest-repeating-substring/"
   },
   "1063": {
+    "id": 1063,
     "category": "Stack",
+    "title": "Number of Valid Subarrays",
     "difficulty": "Hard",
-    "id": 1063,
-    "link": "https://leetcode.com/problems/number-of-valid-subarrays/",
-    "title": "Number of Valid Subarrays"
+    "link": "https://leetcode.com/problems/number-of-valid-subarrays/"
   },
   "1064": {
+    "id": 1064,
     "category": "Binary Search",
+    "title": "Fixed Point",
     "difficulty": "Easy",
-    "id": 1064,
-    "link": "https://leetcode.com/problems/fixed-point/",
-    "title": "Fixed Point"
+    "link": "https://leetcode.com/problems/fixed-point/"
   },
   "1065": {
+    "id": 1065,
     "category": "Trie",
+    "title": "Index Pairs of a String",
     "difficulty": "Easy",
-    "id": 1065,
-    "link": "https://leetcode.com/problems/index-pairs-of-a-string/",
-    "title": "Index Pairs of a String"
+    "link": "https://leetcode.com/problems/index-pairs-of-a-string/"
   },
   "1066": {
+    "id": 1066,
     "category": "Dynamic Programming",
+    "title": "Campus Bikes II",
     "difficulty": "Medium",
-    "id": 1066,
-    "link": "https://leetcode.com/problems/campus-bikes-ii/",
-    "title": "Campus Bikes II"
+    "link": "https://leetcode.com/problems/campus-bikes-ii/"
   },
   "1067": {
+    "id": 1067,
     "category": "Dynamic Programming",
+    "title": "Digit Count in Range",
     "difficulty": "Hard",
-    "id": 1067,
-    "link": "https://leetcode.com/problems/digit-count-in-range/",
-    "title": "Digit Count in Range"
+    "link": "https://leetcode.com/problems/digit-count-in-range/"
   },
   "1068": {
+    "id": 1068,
     "category": "Database",
+    "title": "Product Sales Analysis I",
     "difficulty": "Easy",
-    "id": 1068,
-    "link": "https://leetcode.com/problems/product-sales-analysis-i/",
-    "title": "Product Sales Analysis I"
+    "link": "https://leetcode.com/problems/product-sales-analysis-i/"
   },
   "1069": {
+    "id": 1069,
     "category": "Database",
+    "title": "Product Sales Analysis II",
     "difficulty": "Easy",
-    "id": 1069,
-    "link": "https://leetcode.com/problems/product-sales-analysis-ii/",
-    "title": "Product Sales Analysis II"
+    "link": "https://leetcode.com/problems/product-sales-analysis-ii/"
   },
   "1070": {
+    "id": 1070,
     "category": "Database",
+    "title": "Product Sales Analysis III",
     "difficulty": "Medium",
-    "id": 1070,
-    "link": "https://leetcode.com/problems/product-sales-analysis-iii/",
-    "title": "Product Sales Analysis III"
+    "link": "https://leetcode.com/problems/product-sales-analysis-iii/"
   },
   "1071": {
+    "id": 1071,
     "category": "Math & Geometry",
+    "title": "Greatest Common Divisor of Strings",
     "difficulty": "Easy",
-    "id": 1071,
-    "link": "https://leetcode.com/problems/greatest-common-divisor-of-strings/",
-    "title": "Greatest Common Divisor of Strings"
+    "link": "https://leetcode.com/problems/greatest-common-divisor-of-strings/"
   },
   "1072": {
+    "id": 1072,
     "category": "Array & Hashing",
+    "title": "Flip Columns For Maximum Number of Equal Rows",
     "difficulty": "Medium",
-    "id": 1072,
-    "link": "https://leetcode.com/problems/flip-columns-for-maximum-number-of-equal-rows/",
-    "title": "Flip Columns For Maximum Number of Equal Rows"
+    "link": "https://leetcode.com/problems/flip-columns-for-maximum-number-of-equal-rows/"
   },
   "1073": {
+    "id": 1073,
     "category": "Math & Geometry",
+    "title": "Adding Two Negabinary Numbers",
     "difficulty": "Medium",
-    "id": 1073,
-    "link": "https://leetcode.com/problems/adding-two-negabinary-numbers/",
-    "title": "Adding Two Negabinary Numbers"
+    "link": "https://leetcode.com/problems/adding-two-negabinary-numbers/"
   },
   "1074": {
+    "id": 1074,
     "category": "Array & Hashing",
+    "title": "Number of Submatrices That Sum to Target",
     "difficulty": "Hard",
-    "id": 1074,
-    "link": "https://leetcode.com/problems/number-of-submatrices-that-sum-to-target/",
-    "title": "Number of Submatrices That Sum to Target"
+    "link": "https://leetcode.com/problems/number-of-submatrices-that-sum-to-target/"
   },
   "1075": {
+    "id": 1075,
     "category": "Database",
+    "title": "Project Employees I",
     "difficulty": "Easy",
-    "id": 1075,
-    "link": "https://leetcode.com/problems/project-employees-i/",
-    "title": "Project Employees I"
+    "link": "https://leetcode.com/problems/project-employees-i/"
   },
   "1076": {
+    "id": 1076,
     "category": "Database",
+    "title": "Project Employees II",
     "difficulty": "Easy",
-    "id": 1076,
-    "link": "https://leetcode.com/problems/project-employees-ii/",
-    "title": "Project Employees II"
+    "link": "https://leetcode.com/problems/project-employees-ii/"
   },
   "1077": {
+    "id": 1077,
     "category": "Database",
+    "title": "Project Employees III",
     "difficulty": "Medium",
-    "id": 1077,
-    "link": "https://leetcode.com/problems/project-employees-iii/",
-    "title": "Project Employees III"
+    "link": "https://leetcode.com/problems/project-employees-iii/"
   },
   "1078": {
+    "id": 1078,
     "category": "Array & Hashing",
+    "title": "Occurrences After Bigram",
     "difficulty": "Easy",
-    "id": 1078,
-    "link": "https://leetcode.com/problems/occurrences-after-bigram/",
-    "title": "Occurrences After Bigram"
+    "link": "https://leetcode.com/problems/occurrences-after-bigram/"
   },
   "1079": {
+    "id": 1079,
     "category": "Backtracking",
+    "title": "Letter Tile Possibilities",
     "difficulty": "Medium",
-    "id": 1079,
-    "link": "https://leetcode.com/problems/letter-tile-possibilities/",
-    "title": "Letter Tile Possibilities"
+    "link": "https://leetcode.com/problems/letter-tile-possibilities/"
   },
   "1080": {
+    "id": 1080,
     "category": "Tree",
+    "title": "Insufficient Nodes in Root to Leaf Paths",
     "difficulty": "Medium",
-    "id": 1080,
-    "link": "https://leetcode.com/problems/insufficient-nodes-in-root-to-leaf-paths/",
-    "title": "Insufficient Nodes in Root to Leaf Paths"
+    "link": "https://leetcode.com/problems/insufficient-nodes-in-root-to-leaf-paths/"
   },
   "1081": {
+    "id": 1081,
     "category": "Stack",
+    "title": "Smallest Subsequence of Distinct Characters",
     "difficulty": "Medium",
-    "id": 1081,
-    "link": "https://leetcode.com/problems/smallest-subsequence-of-distinct-characters/",
-    "title": "Smallest Subsequence of Distinct Characters"
+    "link": "https://leetcode.com/problems/smallest-subsequence-of-distinct-characters/"
   },
   "1082": {
+    "id": 1082,
     "category": "Database",
+    "title": "Sales Analysis I",
     "difficulty": "Easy",
-    "id": 1082,
-    "link": "https://leetcode.com/problems/sales-analysis-i/",
-    "title": "Sales Analysis I"
+    "link": "https://leetcode.com/problems/sales-analysis-i/"
   },
   "1083": {
+    "id": 1083,
     "category": "Database",
+    "title": "Sales Analysis II",
     "difficulty": "Easy",
-    "id": 1083,
-    "link": "https://leetcode.com/problems/sales-analysis-ii/",
-    "title": "Sales Analysis II"
+    "link": "https://leetcode.com/problems/sales-analysis-ii/"
   },
   "1084": {
+    "id": 1084,
     "category": "Database",
+    "title": "Sales Analysis III",
     "difficulty": "Easy",
-    "id": 1084,
-    "link": "https://leetcode.com/problems/sales-analysis-iii/",
-    "title": "Sales Analysis III"
+    "link": "https://leetcode.com/problems/sales-analysis-iii/"
   },
   "1085": {
+    "id": 1085,
     "category": "Math & Geometry",
+    "title": "Sum of Digits in the Minimum Number",
     "difficulty": "Easy",
-    "id": 1085,
-    "link": "https://leetcode.com/problems/sum-of-digits-in-the-minimum-number/",
-    "title": "Sum of Digits in the Minimum Number"
+    "link": "https://leetcode.com/problems/sum-of-digits-in-the-minimum-number/"
   },
   "1086": {
+    "id": 1086,
     "category": "Heap (Priority Queue)",
+    "title": "High Five",
     "difficulty": "Easy",
-    "id": 1086,
-    "link": "https://leetcode.com/problems/high-five/",
-    "title": "High Five"
+    "link": "https://leetcode.com/problems/high-five/"
   },
   "1087": {
+    "id": 1087,
     "category": "Graph Traversal",
+    "title": "Brace Expansion",
     "difficulty": "Medium",
-    "id": 1087,
-    "link": "https://leetcode.com/problems/brace-expansion/",
-    "title": "Brace Expansion"
+    "link": "https://leetcode.com/problems/brace-expansion/"
   },
   "1088": {
+    "id": 1088,
     "category": "Backtracking",
+    "title": "Confusing Number II",
     "difficulty": "Hard",
-    "id": 1088,
-    "link": "https://leetcode.com/problems/confusing-number-ii/",
-    "title": "Confusing Number II"
+    "link": "https://leetcode.com/problems/confusing-number-ii/"
   },
   "1089": {
+    "id": 1089,
     "category": "Two Pointers",
+    "title": "Duplicate Zeros",
     "difficulty": "Easy",
-    "id": 1089,
-    "link": "https://leetcode.com/problems/duplicate-zeros/",
-    "title": "Duplicate Zeros"
+    "link": "https://leetcode.com/problems/duplicate-zeros/"
   },
   "1090": {
+    "id": 1090,
     "category": "Greedy",
+    "title": "Largest Values From Labels",
     "difficulty": "Medium",
-    "id": 1090,
-    "link": "https://leetcode.com/problems/largest-values-from-labels/",
-    "title": "Largest Values From Labels"
+    "link": "https://leetcode.com/problems/largest-values-from-labels/"
   },
   "1091": {
+    "id": 1091,
     "category": "Graph Traversal",
+    "title": "Shortest Path in Binary Matrix",
     "difficulty": "Medium",
-    "id": 1091,
-    "link": "https://leetcode.com/problems/shortest-path-in-binary-matrix/",
-    "title": "Shortest Path in Binary Matrix"
+    "link": "https://leetcode.com/problems/shortest-path-in-binary-matrix/"
   },
   "1092": {
+    "id": 1092,
     "category": "Dynamic Programming",
+    "title": "Shortest Common Supersequence ",
     "difficulty": "Hard",
-    "id": 1092,
-    "link": "https://leetcode.com/problems/shortest-common-supersequence/",
-    "title": "Shortest Common Supersequence "
+    "link": "https://leetcode.com/problems/shortest-common-supersequence/"
   },
   "1093": {
+    "id": 1093,
     "category": "Math & Geometry",
+    "title": "Statistics from a Large Sample",
     "difficulty": "Medium",
-    "id": 1093,
-    "link": "https://leetcode.com/problems/statistics-from-a-large-sample/",
-    "title": "Statistics from a Large Sample"
+    "link": "https://leetcode.com/problems/statistics-from-a-large-sample/"
   },
   "1094": {
+    "id": 1094,
     "category": "Heap (Priority Queue)",
+    "title": "Car Pooling",
     "difficulty": "Medium",
-    "id": 1094,
-    "link": "https://leetcode.com/problems/car-pooling/",
-    "title": "Car Pooling"
+    "link": "https://leetcode.com/problems/car-pooling/"
   },
   "1095": {
+    "id": 1095,
     "category": "Binary Search",
+    "title": "Find in Mountain Array",
     "difficulty": "Hard",
-    "id": 1095,
-    "link": "https://leetcode.com/problems/find-in-mountain-array/",
-    "title": "Find in Mountain Array"
+    "link": "https://leetcode.com/problems/find-in-mountain-array/"
   },
   "1096": {
+    "id": 1096,
     "category": "Graph Traversal",
+    "title": "Brace Expansion II",
     "difficulty": "Hard",
-    "id": 1096,
-    "link": "https://leetcode.com/problems/brace-expansion-ii/",
-    "title": "Brace Expansion II"
+    "link": "https://leetcode.com/problems/brace-expansion-ii/"
   },
   "1097": {
+    "id": 1097,
     "category": "Database",
+    "title": "Game Play Analysis V",
     "difficulty": "Hard",
-    "id": 1097,
-    "link": "https://leetcode.com/problems/game-play-analysis-v/",
-    "title": "Game Play Analysis V"
+    "link": "https://leetcode.com/problems/game-play-analysis-v/"
   },
   "1098": {
+    "id": 1098,
     "category": "Database",
+    "title": "Unpopular Books",
     "difficulty": "Medium",
-    "id": 1098,
-    "link": "https://leetcode.com/problems/unpopular-books/",
-    "title": "Unpopular Books"
+    "link": "https://leetcode.com/problems/unpopular-books/"
   },
   "1099": {
+    "id": 1099,
     "category": "Binary Search",
+    "title": "Two Sum Less Than K",
     "difficulty": "Easy",
-    "id": 1099,
-    "link": "https://leetcode.com/problems/two-sum-less-than-k/",
-    "title": "Two Sum Less Than K"
+    "link": "https://leetcode.com/problems/two-sum-less-than-k/"
   },
   "1100": {
+    "id": 1100,
     "category": "Sliding Window",
+    "title": "Find K-Length Substrings With No Repeated Characters",
     "difficulty": "Medium",
-    "id": 1100,
-    "link": "https://leetcode.com/problems/find-k-length-substrings-with-no-repeated-characters/",
-    "title": "Find K-Length Substrings With No Repeated Characters"
+    "link": "https://leetcode.com/problems/find-k-length-substrings-with-no-repeated-characters/"
   },
   "1101": {
+    "id": 1101,
     "category": "Graph Traversal",
+    "title": "The Earliest Moment When Everyone Become Friends",
     "difficulty": "Medium",
-    "id": 1101,
-    "link": "https://leetcode.com/problems/the-earliest-moment-when-everyone-become-friends/",
-    "title": "The Earliest Moment When Everyone Become Friends"
+    "link": "https://leetcode.com/problems/the-earliest-moment-when-everyone-become-friends/"
   },
   "1102": {
+    "id": 1102,
     "category": "Graph Traversal",
+    "title": "Path With Maximum Minimum Value",
     "difficulty": "Medium",
-    "id": 1102,
-    "link": "https://leetcode.com/problems/path-with-maximum-minimum-value/",
-    "title": "Path With Maximum Minimum Value"
+    "link": "https://leetcode.com/problems/path-with-maximum-minimum-value/"
   },
   "1103": {
+    "id": 1103,
     "category": "Math & Geometry",
+    "title": "Distribute Candies to People",
     "difficulty": "Easy",
-    "id": 1103,
-    "link": "https://leetcode.com/problems/distribute-candies-to-people/",
-    "title": "Distribute Candies to People"
+    "link": "https://leetcode.com/problems/distribute-candies-to-people/"
   },
   "1104": {
+    "id": 1104,
     "category": "Tree",
+    "title": "Path In Zigzag Labelled Binary Tree",
     "difficulty": "Medium",
-    "id": 1104,
-    "link": "https://leetcode.com/problems/path-in-zigzag-labelled-binary-tree/",
-    "title": "Path In Zigzag Labelled Binary Tree"
+    "link": "https://leetcode.com/problems/path-in-zigzag-labelled-binary-tree/"
   },
   "1105": {
+    "id": 1105,
     "category": "Dynamic Programming",
+    "title": "Filling Bookcase Shelves",
     "difficulty": "Medium",
-    "id": 1105,
-    "link": "https://leetcode.com/problems/filling-bookcase-shelves/",
-    "title": "Filling Bookcase Shelves"
+    "link": "https://leetcode.com/problems/filling-bookcase-shelves/"
   },
   "1106": {
+    "id": 1106,
     "category": "Stack",
+    "title": "Parsing A Boolean Expression",
     "difficulty": "Hard",
-    "id": 1106,
-    "link": "https://leetcode.com/problems/parsing-a-boolean-expression/",
-    "title": "Parsing A Boolean Expression"
+    "link": "https://leetcode.com/problems/parsing-a-boolean-expression/"
   },
   "1107": {
+    "id": 1107,
     "category": "Database",
+    "title": "New Users Daily Count",
     "difficulty": "Medium",
-    "id": 1107,
-    "link": "https://leetcode.com/problems/new-users-daily-count/",
-    "title": "New Users Daily Count"
+    "link": "https://leetcode.com/problems/new-users-daily-count/"
   },
   "1108": {
+    "id": 1108,
     "category": "Array & Hashing",
+    "title": "Defanging an IP Address",
     "difficulty": "Easy",
-    "id": 1108,
-    "link": "https://leetcode.com/problems/defanging-an-ip-address/",
-    "title": "Defanging an IP Address"
+    "link": "https://leetcode.com/problems/defanging-an-ip-address/"
   },
   "1109": {
+    "id": 1109,
     "category": "Array & Hashing",
+    "title": "Corporate Flight Bookings",
     "difficulty": "Medium",
-    "id": 1109,
-    "link": "https://leetcode.com/problems/corporate-flight-bookings/",
-    "title": "Corporate Flight Bookings"
+    "link": "https://leetcode.com/problems/corporate-flight-bookings/"
   },
   "1110": {
+    "id": 1110,
     "category": "Tree",
+    "title": "Delete Nodes And Return Forest",
     "difficulty": "Medium",
-    "id": 1110,
-    "link": "https://leetcode.com/problems/delete-nodes-and-return-forest/",
-    "title": "Delete Nodes And Return Forest"
+    "link": "https://leetcode.com/problems/delete-nodes-and-return-forest/"
   },
   "1111": {
+    "id": 1111,
     "category": "Stack",
+    "title": "Maximum Nesting Depth of Two Valid Parentheses Strings",
     "difficulty": "Medium",
-    "id": 1111,
-    "link": "https://leetcode.com/problems/maximum-nesting-depth-of-two-valid-parentheses-strings/",
-    "title": "Maximum Nesting Depth of Two Valid Parentheses Strings"
+    "link": "https://leetcode.com/problems/maximum-nesting-depth-of-two-valid-parentheses-strings/"
   },
   "1112": {
+    "id": 1112,
     "category": "Database",
+    "title": "Highest Grade For Each Student",
     "difficulty": "Medium",
-    "id": 1112,
-    "link": "https://leetcode.com/problems/highest-grade-for-each-student/",
-    "title": "Highest Grade For Each Student"
+    "link": "https://leetcode.com/problems/highest-grade-for-each-student/"
   },
   "1113": {
+    "id": 1113,
     "category": "Database",
+    "title": "Reported Posts",
     "difficulty": "Easy",
-    "id": 1113,
-    "link": "https://leetcode.com/problems/reported-posts/",
-    "title": "Reported Posts"
+    "link": "https://leetcode.com/problems/reported-posts/"
   },
   "1114": {
+    "id": 1114,
     "category": "Array & Hashing",
+    "title": "Print in Order",
     "difficulty": "Easy",
-    "id": 1114,
-    "link": "https://leetcode.com/problems/print-in-order/",
-    "title": "Print in Order"
+    "link": "https://leetcode.com/problems/print-in-order/"
   },
   "1115": {
+    "id": 1115,
     "category": "Array & Hashing",
+    "title": "Print FooBar Alternately",
     "difficulty": "Medium",
-    "id": 1115,
-    "link": "https://leetcode.com/problems/print-foobar-alternately/",
-    "title": "Print FooBar Alternately"
+    "link": "https://leetcode.com/problems/print-foobar-alternately/"
   },
   "1116": {
+    "id": 1116,
     "category": "Array & Hashing",
+    "title": "Print Zero Even Odd",
     "difficulty": "Medium",
-    "id": 1116,
-    "link": "https://leetcode.com/problems/print-zero-even-odd/",
-    "title": "Print Zero Even Odd"
+    "link": "https://leetcode.com/problems/print-zero-even-odd/"
   },
   "1117": {
+    "id": 1117,
     "category": "Array & Hashing",
+    "title": "Building H2O",
     "difficulty": "Medium",
-    "id": 1117,
-    "link": "https://leetcode.com/problems/building-h2o/",
-    "title": "Building H2O"
+    "link": "https://leetcode.com/problems/building-h2o/"
   },
   "1118": {
+    "id": 1118,
     "category": "Math & Geometry",
+    "title": "Number of Days in a Month",
     "difficulty": "Easy",
-    "id": 1118,
-    "link": "https://leetcode.com/problems/number-of-days-in-a-month/",
-    "title": "Number of Days in a Month"
+    "link": "https://leetcode.com/problems/number-of-days-in-a-month/"
   },
   "1119": {
+    "id": 1119,
     "category": "Array & Hashing",
+    "title": "Remove Vowels from a String",
     "difficulty": "Easy",
-    "id": 1119,
-    "link": "https://leetcode.com/problems/remove-vowels-from-a-string/",
-    "title": "Remove Vowels from a String"
+    "link": "https://leetcode.com/problems/remove-vowels-from-a-string/"
   },
   "1120": {
+    "id": 1120,
     "category": "Tree",
+    "title": "Maximum Average Subtree",
     "difficulty": "Medium",
-    "id": 1120,
-    "link": "https://leetcode.com/problems/maximum-average-subtree/",
-    "title": "Maximum Average Subtree"
+    "link": "https://leetcode.com/problems/maximum-average-subtree/"
   },
   "1121": {
+    "id": 1121,
     "category": "Array & Hashing",
+    "title": "Divide Array Into Increasing Sequences",
     "difficulty": "Hard",
-    "id": 1121,
-    "link": "https://leetcode.com/problems/divide-array-into-increasing-sequences/",
-    "title": "Divide Array Into Increasing Sequences"
+    "link": "https://leetcode.com/problems/divide-array-into-increasing-sequences/"
   },
   "1122": {
+    "id": 1122,
     "category": "Array & Hashing",
+    "title": "Relative Sort Array",
     "difficulty": "Easy",
-    "id": 1122,
-    "link": "https://leetcode.com/problems/relative-sort-array/",
-    "title": "Relative Sort Array"
+    "link": "https://leetcode.com/problems/relative-sort-array/"
   },
   "1123": {
+    "id": 1123,
     "category": "Tree",
+    "title": "Lowest Common Ancestor of Deepest Leaves",
     "difficulty": "Medium",
-    "id": 1123,
-    "link": "https://leetcode.com/problems/lowest-common-ancestor-of-deepest-leaves/",
-    "title": "Lowest Common Ancestor of Deepest Leaves"
+    "link": "https://leetcode.com/problems/lowest-common-ancestor-of-deepest-leaves/"
   },
   "1124": {
+    "id": 1124,
     "category": "Stack",
+    "title": "Longest Well-Performing Interval",
     "difficulty": "Medium",
-    "id": 1124,
-    "link": "https://leetcode.com/problems/longest-well-performing-interval/",
-    "title": "Longest Well-Performing Interval"
+    "link": "https://leetcode.com/problems/longest-well-performing-interval/"
   },
   "1125": {
+    "id": 1125,
     "category": "Dynamic Programming",
+    "title": "Smallest Sufficient Team",
     "difficulty": "Hard",
-    "id": 1125,
-    "link": "https://leetcode.com/problems/smallest-sufficient-team/",
-    "title": "Smallest Sufficient Team"
+    "link": "https://leetcode.com/problems/smallest-sufficient-team/"
   },
   "1126": {
+    "id": 1126,
     "category": "Database",
+    "title": "Active Businesses",
     "difficulty": "Medium",
-    "id": 1126,
-    "link": "https://leetcode.com/problems/active-businesses/",
-    "title": "Active Businesses"
+    "link": "https://leetcode.com/problems/active-businesses/"
   },
   "1127": {
+    "id": 1127,
     "category": "Database",
+    "title": "User Purchase Platform",
     "difficulty": "Hard",
-    "id": 1127,
-    "link": "https://leetcode.com/problems/user-purchase-platform/",
-    "title": "User Purchase Platform"
+    "link": "https://leetcode.com/problems/user-purchase-platform/"
   },
   "1128": {
+    "id": 1128,
     "category": "Array & Hashing",
+    "title": "Number of Equivalent Domino Pairs",
     "difficulty": "Easy",
-    "id": 1128,
-    "link": "https://leetcode.com/problems/number-of-equivalent-domino-pairs/",
-    "title": "Number of Equivalent Domino Pairs"
+    "link": "https://leetcode.com/problems/number-of-equivalent-domino-pairs/"
   },
   "1129": {
+    "id": 1129,
     "category": "Graph Traversal",
+    "title": "Shortest Path with Alternating Colors",
     "difficulty": "Medium",
-    "id": 1129,
-    "link": "https://leetcode.com/problems/shortest-path-with-alternating-colors/",
-    "title": "Shortest Path with Alternating Colors"
+    "link": "https://leetcode.com/problems/shortest-path-with-alternating-colors/"
   },
   "1130": {
+    "id": 1130,
     "category": "Dynamic Programming",
+    "title": "Minimum Cost Tree From Leaf Values",
     "difficulty": "Medium",
-    "id": 1130,
-    "link": "https://leetcode.com/problems/minimum-cost-tree-from-leaf-values/",
-    "title": "Minimum Cost Tree From Leaf Values"
+    "link": "https://leetcode.com/problems/minimum-cost-tree-from-leaf-values/"
   },
   "1131": {
+    "id": 1131,
     "category": "Math & Geometry",
+    "title": "Maximum of Absolute Value Expression",
     "difficulty": "Medium",
-    "id": 1131,
-    "link": "https://leetcode.com/problems/maximum-of-absolute-value-expression/",
-    "title": "Maximum of Absolute Value Expression"
+    "link": "https://leetcode.com/problems/maximum-of-absolute-value-expression/"
   },
   "1132": {
+    "id": 1132,
     "category": "Database",
+    "title": "Reported Posts II",
     "difficulty": "Medium",
-    "id": 1132,
-    "link": "https://leetcode.com/problems/reported-posts-ii/",
-    "title": "Reported Posts II"
+    "link": "https://leetcode.com/problems/reported-posts-ii/"
   },
   "1133": {
+    "id": 1133,
     "category": "Array & Hashing",
+    "title": "Largest Unique Number",
     "difficulty": "Easy",
-    "id": 1133,
-    "link": "https://leetcode.com/problems/largest-unique-number/",
-    "title": "Largest Unique Number"
+    "link": "https://leetcode.com/problems/largest-unique-number/"
   },
   "1134": {
+    "id": 1134,
     "category": "Math & Geometry",
+    "title": "Armstrong Number",
     "difficulty": "Easy",
-    "id": 1134,
-    "link": "https://leetcode.com/problems/armstrong-number/",
-    "title": "Armstrong Number"
+    "link": "https://leetcode.com/problems/armstrong-number/"
   },
   "1135": {
+    "id": 1135,
     "category": "Tree",
+    "title": "Connecting Cities With Minimum Cost",
     "difficulty": "Medium",
-    "id": 1135,
-    "link": "https://leetcode.com/problems/connecting-cities-with-minimum-cost/",
-    "title": "Connecting Cities With Minimum Cost"
+    "link": "https://leetcode.com/problems/connecting-cities-with-minimum-cost/"
   },
   "1136": {
+    "id": 1136,
     "category": "Graph Traversal",
+    "title": "Parallel Courses",
     "difficulty": "Medium",
-    "id": 1136,
-    "link": "https://leetcode.com/problems/parallel-courses/",
-    "title": "Parallel Courses"
+    "link": "https://leetcode.com/problems/parallel-courses/"
   },
   "1137": {
+    "id": 1137,
     "category": "Dynamic Programming",
+    "title": "N-th Tribonacci Number",
     "difficulty": "Easy",
-    "id": 1137,
-    "link": "https://leetcode.com/problems/n-th-tribonacci-number/",
-    "title": "N-th Tribonacci Number"
+    "link": "https://leetcode.com/problems/n-th-tribonacci-number/"
   },
   "1138": {
+    "id": 1138,
     "category": "Array & Hashing",
+    "title": "Alphabet Board Path",
     "difficulty": "Medium",
-    "id": 1138,
-    "link": "https://leetcode.com/problems/alphabet-board-path/",
-    "title": "Alphabet Board Path"
+    "link": "https://leetcode.com/problems/alphabet-board-path/"
   },
   "1139": {
+    "id": 1139,
     "category": "Dynamic Programming",
+    "title": "Largest 1-Bordered Square",
     "difficulty": "Medium",
-    "id": 1139,
-    "link": "https://leetcode.com/problems/largest-1-bordered-square/",
-    "title": "Largest 1-Bordered Square"
+    "link": "https://leetcode.com/problems/largest-1-bordered-square/"
   },
   "1140": {
+    "id": 1140,
     "category": "Dynamic Programming",
+    "title": "Stone Game II",
     "difficulty": "Medium",
-    "id": 1140,
-    "link": "https://leetcode.com/problems/stone-game-ii/",
-    "title": "Stone Game II"
+    "link": "https://leetcode.com/problems/stone-game-ii/"
   },
   "1141": {
+    "id": 1141,
     "category": "Database",
+    "title": "User Activity for the Past 30 Days I",
     "difficulty": "Easy",
-    "id": 1141,
-    "link": "https://leetcode.com/problems/user-activity-for-the-past-30-days-i/",
-    "title": "User Activity for the Past 30 Days I"
+    "link": "https://leetcode.com/problems/user-activity-for-the-past-30-days-i/"
   },
   "1142": {
+    "id": 1142,
     "category": "Database",
+    "title": "User Activity for the Past 30 Days II",
     "difficulty": "Easy",
-    "id": 1142,
-    "link": "https://leetcode.com/problems/user-activity-for-the-past-30-days-ii/",
-    "title": "User Activity for the Past 30 Days II"
+    "link": "https://leetcode.com/problems/user-activity-for-the-past-30-days-ii/"
   },
   "1143": {
+    "id": 1143,
     "category": "Dynamic Programming",
+    "title": "Longest Common Subsequence",
     "difficulty": "Medium",
-    "id": 1143,
-    "link": "https://leetcode.com/problems/longest-common-subsequence/",
-    "title": "Longest Common Subsequence"
+    "link": "https://leetcode.com/problems/longest-common-subsequence/"
   },
   "1144": {
+    "id": 1144,
     "category": "Greedy",
+    "title": "Decrease Elements To Make Array Zigzag",
     "difficulty": "Medium",
-    "id": 1144,
-    "link": "https://leetcode.com/problems/decrease-elements-to-make-array-zigzag/",
-    "title": "Decrease Elements To Make Array Zigzag"
+    "link": "https://leetcode.com/problems/decrease-elements-to-make-array-zigzag/"
   },
   "1145": {
+    "id": 1145,
     "category": "Tree",
+    "title": "Binary Tree Coloring Game",
     "difficulty": "Medium",
-    "id": 1145,
-    "link": "https://leetcode.com/problems/binary-tree-coloring-game/",
-    "title": "Binary Tree Coloring Game"
+    "link": "https://leetcode.com/problems/binary-tree-coloring-game/"
   },
   "1146": {
+    "id": 1146,
     "category": "Binary Search",
+    "title": "Snapshot Array",
     "difficulty": "Medium",
-    "id": 1146,
-    "link": "https://leetcode.com/problems/snapshot-array/",
-    "title": "Snapshot Array"
+    "link": "https://leetcode.com/problems/snapshot-array/"
   },
   "1147": {
+    "id": 1147,
     "category": "Dynamic Programming",
+    "title": "Longest Chunked Palindrome Decomposition",
     "difficulty": "Hard",
-    "id": 1147,
-    "link": "https://leetcode.com/problems/longest-chunked-palindrome-decomposition/",
-    "title": "Longest Chunked Palindrome Decomposition"
+    "link": "https://leetcode.com/problems/longest-chunked-palindrome-decomposition/"
   },
   "1148": {
+    "id": 1148,
     "category": "Database",
+    "title": "Article Views I",
     "difficulty": "Easy",
-    "id": 1148,
-    "link": "https://leetcode.com/problems/article-views-i/",
-    "title": "Article Views I"
+    "link": "https://leetcode.com/problems/article-views-i/"
   },
   "1149": {
+    "id": 1149,
     "category": "Database",
+    "title": "Article Views II",
     "difficulty": "Medium",
-    "id": 1149,
-    "link": "https://leetcode.com/problems/article-views-ii/",
-    "title": "Article Views II"
+    "link": "https://leetcode.com/problems/article-views-ii/"
   },
   "1150": {
+    "id": 1150,
     "category": "Binary Search",
+    "title": "Check If a Number Is Majority Element in a Sorted Array",
     "difficulty": "Easy",
-    "id": 1150,
-    "link": "https://leetcode.com/problems/check-if-a-number-is-majority-element-in-a-sorted-array/",
-    "title": "Check If a Number Is Majority Element in a Sorted Array"
+    "link": "https://leetcode.com/problems/check-if-a-number-is-majority-element-in-a-sorted-array/"
   },
   "1151": {
+    "id": 1151,
     "category": "Sliding Window",
+    "title": "Minimum Swaps to Group All 1's Together",
     "difficulty": "Medium",
-    "id": 1151,
-    "link": "https://leetcode.com/problems/minimum-swaps-to-group-all-1s-together/",
-    "title": "Minimum Swaps to Group All 1's Together"
+    "link": "https://leetcode.com/problems/minimum-swaps-to-group-all-1s-together/"
   },
   "1152": {
+    "id": 1152,
     "category": "Array & Hashing",
+    "title": "Analyze User Website Visit Pattern",
     "difficulty": "Medium",
-    "id": 1152,
-    "link": "https://leetcode.com/problems/analyze-user-website-visit-pattern/",
-    "title": "Analyze User Website Visit Pattern"
+    "link": "https://leetcode.com/problems/analyze-user-website-visit-pattern/"
   },
   "1153": {
+    "id": 1153,
     "category": "Graph Traversal",
+    "title": "String Transforms Into Another String",
     "difficulty": "Hard",
-    "id": 1153,
-    "link": "https://leetcode.com/problems/string-transforms-into-another-string/",
-    "title": "String Transforms Into Another String"
+    "link": "https://leetcode.com/problems/string-transforms-into-another-string/"
   },
   "1154": {
+    "id": 1154,
     "category": "Math & Geometry",
+    "title": "Day of the Year",
     "difficulty": "Easy",
-    "id": 1154,
-    "link": "https://leetcode.com/problems/day-of-the-year/",
-    "title": "Day of the Year"
+    "link": "https://leetcode.com/problems/day-of-the-year/"
   },
   "1155": {
+    "id": 1155,
     "category": "Dynamic Programming",
+    "title": "Number of Dice Rolls With Target Sum",
     "difficulty": "Medium",
-    "id": 1155,
-    "link": "https://leetcode.com/problems/number-of-dice-rolls-with-target-sum/",
-    "title": "Number of Dice Rolls With Target Sum"
+    "link": "https://leetcode.com/problems/number-of-dice-rolls-with-target-sum/"
   },
   "1156": {
+    "id": 1156,
     "category": "Sliding Window",
+    "title": "Swap For Longest Repeated Character Substring",
     "difficulty": "Medium",
-    "id": 1156,
-    "link": "https://leetcode.com/problems/swap-for-longest-repeated-character-substring/",
-    "title": "Swap For Longest Repeated Character Substring"
+    "link": "https://leetcode.com/problems/swap-for-longest-repeated-character-substring/"
   },
   "1157": {
+    "id": 1157,
     "category": "Tree",
+    "title": "Online Majority Element In Subarray",
     "difficulty": "Hard",
-    "id": 1157,
-    "link": "https://leetcode.com/problems/online-majority-element-in-subarray/",
-    "title": "Online Majority Element In Subarray"
+    "link": "https://leetcode.com/problems/online-majority-element-in-subarray/"
   },
   "1158": {
+    "id": 1158,
     "category": "Database",
+    "title": "Market Analysis I",
     "difficulty": "Medium",
-    "id": 1158,
-    "link": "https://leetcode.com/problems/market-analysis-i/",
-    "title": "Market Analysis I"
+    "link": "https://leetcode.com/problems/market-analysis-i/"
   },
   "1159": {
+    "id": 1159,
     "category": "Database",
+    "title": "Market Analysis II",
     "difficulty": "Hard",
-    "id": 1159,
-    "link": "https://leetcode.com/problems/market-analysis-ii/",
-    "title": "Market Analysis II"
+    "link": "https://leetcode.com/problems/market-analysis-ii/"
   },
   "1160": {
+    "id": 1160,
     "category": "Array & Hashing",
+    "title": "Find Words That Can Be Formed by Characters",
     "difficulty": "Easy",
-    "id": 1160,
-    "link": "https://leetcode.com/problems/find-words-that-can-be-formed-by-characters/",
-    "title": "Find Words That Can Be Formed by Characters"
+    "link": "https://leetcode.com/problems/find-words-that-can-be-formed-by-characters/"
   },
   "1161": {
+    "id": 1161,
     "category": "Tree",
+    "title": "Maximum Level Sum of a Binary Tree",
     "difficulty": "Medium",
-    "id": 1161,
-    "link": "https://leetcode.com/problems/maximum-level-sum-of-a-binary-tree/",
-    "title": "Maximum Level Sum of a Binary Tree"
+    "link": "https://leetcode.com/problems/maximum-level-sum-of-a-binary-tree/"
   },
   "1162": {
+    "id": 1162,
     "category": "Graph Traversal",
+    "title": "As Far from Land as Possible",
     "difficulty": "Medium",
-    "id": 1162,
-    "link": "https://leetcode.com/problems/as-far-from-land-as-possible/",
-    "title": "As Far from Land as Possible"
+    "link": "https://leetcode.com/problems/as-far-from-land-as-possible/"
   },
   "1163": {
+    "id": 1163,
     "category": "Two Pointers",
+    "title": "Last Substring in Lexicographical Order",
     "difficulty": "Hard",
-    "id": 1163,
-    "link": "https://leetcode.com/problems/last-substring-in-lexicographical-order/",
-    "title": "Last Substring in Lexicographical Order"
+    "link": "https://leetcode.com/problems/last-substring-in-lexicographical-order/"
   },
   "1164": {
+    "id": 1164,
     "category": "Database",
+    "title": "Product Price at a Given Date",
     "difficulty": "Medium",
-    "id": 1164,
-    "link": "https://leetcode.com/problems/product-price-at-a-given-date/",
-    "title": "Product Price at a Given Date"
+    "link": "https://leetcode.com/problems/product-price-at-a-given-date/"
   },
   "1165": {
+    "id": 1165,
     "category": "Array & Hashing",
+    "title": "Single-Row Keyboard",
     "difficulty": "Easy",
-    "id": 1165,
-    "link": "https://leetcode.com/problems/single-row-keyboard/",
-    "title": "Single-Row Keyboard"
+    "link": "https://leetcode.com/problems/single-row-keyboard/"
   },
   "1166": {
+    "id": 1166,
     "category": "Trie",
+    "title": "Design File System",
     "difficulty": "Medium",
-    "id": 1166,
-    "link": "https://leetcode.com/problems/design-file-system/",
-    "title": "Design File System"
+    "link": "https://leetcode.com/problems/design-file-system/"
   },
   "1167": {
+    "id": 1167,
     "category": "Heap (Priority Queue)",
+    "title": "Minimum Cost to Connect Sticks",
     "difficulty": "Medium",
-    "id": 1167,
-    "link": "https://leetcode.com/problems/minimum-cost-to-connect-sticks/",
-    "title": "Minimum Cost to Connect Sticks"
+    "link": "https://leetcode.com/problems/minimum-cost-to-connect-sticks/"
   },
   "1168": {
+    "id": 1168,
     "category": "Tree",
+    "title": "Optimize Water Distribution in a Village",
     "difficulty": "Hard",
-    "id": 1168,
-    "link": "https://leetcode.com/problems/optimize-water-distribution-in-a-village/",
-    "title": "Optimize Water Distribution in a Village"
+    "link": "https://leetcode.com/problems/optimize-water-distribution-in-a-village/"
   },
   "1169": {
+    "id": 1169,
     "category": "Array & Hashing",
+    "title": "Invalid Transactions",
     "difficulty": "Medium",
-    "id": 1169,
-    "link": "https://leetcode.com/problems/invalid-transactions/",
-    "title": "Invalid Transactions"
+    "link": "https://leetcode.com/problems/invalid-transactions/"
   },
   "1170": {
+    "id": 1170,
     "category": "Binary Search",
+    "title": "Compare Strings by Frequency of the Smallest Character",
     "difficulty": "Medium",
-    "id": 1170,
-    "link": "https://leetcode.com/problems/compare-strings-by-frequency-of-the-smallest-character/",
-    "title": "Compare Strings by Frequency of the Smallest Character"
+    "link": "https://leetcode.com/problems/compare-strings-by-frequency-of-the-smallest-character/"
   },
   "1171": {
+    "id": 1171,
     "category": "Linked List",
+    "title": "Remove Zero Sum Consecutive Nodes from Linked List",
     "difficulty": "Medium",
-    "id": 1171,
-    "link": "https://leetcode.com/problems/remove-zero-sum-consecutive-nodes-from-linked-list/",
-    "title": "Remove Zero Sum Consecutive Nodes from Linked List"
+    "link": "https://leetcode.com/problems/remove-zero-sum-consecutive-nodes-from-linked-list/"
   },
   "1172": {
+    "id": 1172,
     "category": "Heap (Priority Queue)",
+    "title": "Dinner Plate Stacks",
     "difficulty": "Hard",
-    "id": 1172,
-    "link": "https://leetcode.com/problems/dinner-plate-stacks/",
-    "title": "Dinner Plate Stacks"
+    "link": "https://leetcode.com/problems/dinner-plate-stacks/"
   },
   "1173": {
+    "id": 1173,
     "category": "Database",
+    "title": "Immediate Food Delivery I",
     "difficulty": "Easy",
-    "id": 1173,
-    "link": "https://leetcode.com/problems/immediate-food-delivery-i/",
-    "title": "Immediate Food Delivery I"
+    "link": "https://leetcode.com/problems/immediate-food-delivery-i/"
   },
   "1174": {
+    "id": 1174,
     "category": "Database",
+    "title": "Immediate Food Delivery II",
     "difficulty": "Medium",
-    "id": 1174,
-    "link": "https://leetcode.com/problems/immediate-food-delivery-ii/",
-    "title": "Immediate Food Delivery II"
+    "link": "https://leetcode.com/problems/immediate-food-delivery-ii/"
   },
   "1175": {
+    "id": 1175,
     "category": "Math & Geometry",
+    "title": "Prime Arrangements",
     "difficulty": "Easy",
-    "id": 1175,
-    "link": "https://leetcode.com/problems/prime-arrangements/",
-    "title": "Prime Arrangements"
+    "link": "https://leetcode.com/problems/prime-arrangements/"
   },
   "1176": {
+    "id": 1176,
     "category": "Sliding Window",
+    "title": "Diet Plan Performance",
     "difficulty": "Easy",
-    "id": 1176,
-    "link": "https://leetcode.com/problems/diet-plan-performance/",
-    "title": "Diet Plan Performance"
+    "link": "https://leetcode.com/problems/diet-plan-performance/"
   },
   "1177": {
+    "id": 1177,
     "category": "Bit Manipulation",
+    "title": "Can Make Palindrome from Substring",
     "difficulty": "Medium",
-    "id": 1177,
-    "link": "https://leetcode.com/problems/can-make-palindrome-from-substring/",
-    "title": "Can Make Palindrome from Substring"
+    "link": "https://leetcode.com/problems/can-make-palindrome-from-substring/"
   },
   "1178": {
+    "id": 1178,
     "category": "Trie",
+    "title": "Number of Valid Words for Each Puzzle",
     "difficulty": "Hard",
-    "id": 1178,
-    "link": "https://leetcode.com/problems/number-of-valid-words-for-each-puzzle/",
-    "title": "Number of Valid Words for Each Puzzle"
+    "link": "https://leetcode.com/problems/number-of-valid-words-for-each-puzzle/"
   },
   "1179": {
+    "id": 1179,
     "category": "Database",
+    "title": "Reformat Department Table",
     "difficulty": "Easy",
-    "id": 1179,
-    "link": "https://leetcode.com/problems/reformat-department-table/",
-    "title": "Reformat Department Table"
+    "link": "https://leetcode.com/problems/reformat-department-table/"
   },
   "1180": {
+    "id": 1180,
     "category": "Math & Geometry",
+    "title": "Count Substrings with Only One Distinct Letter",
     "difficulty": "Easy",
-    "id": 1180,
-    "link": "https://leetcode.com/problems/count-substrings-with-only-one-distinct-letter/",
-    "title": "Count Substrings with Only One Distinct Letter"
+    "link": "https://leetcode.com/problems/count-substrings-with-only-one-distinct-letter/"
   },
   "1181": {
+    "id": 1181,
     "category": "Array & Hashing",
+    "title": "Before and After Puzzle",
     "difficulty": "Medium",
-    "id": 1181,
-    "link": "https://leetcode.com/problems/before-and-after-puzzle/",
-    "title": "Before and After Puzzle"
+    "link": "https://leetcode.com/problems/before-and-after-puzzle/"
   },
   "1182": {
+    "id": 1182,
     "category": "Dynamic Programming",
+    "title": "Shortest Distance to Target Color",
     "difficulty": "Medium",
-    "id": 1182,
-    "link": "https://leetcode.com/problems/shortest-distance-to-target-color/",
-    "title": "Shortest Distance to Target Color"
+    "link": "https://leetcode.com/problems/shortest-distance-to-target-color/"
   },
   "1183": {
+    "id": 1183,
     "category": "Heap (Priority Queue)",
+    "title": "Maximum Number of Ones",
     "difficulty": "Hard",
-    "id": 1183,
-    "link": "https://leetcode.com/problems/maximum-number-of-ones/",
-    "title": "Maximum Number of Ones"
+    "link": "https://leetcode.com/problems/maximum-number-of-ones/"
   },
   "1184": {
+    "id": 1184,
     "category": "Array & Hashing",
+    "title": "Distance Between Bus Stops",
     "difficulty": "Easy",
-    "id": 1184,
-    "link": "https://leetcode.com/problems/distance-between-bus-stops/",
-    "title": "Distance Between Bus Stops"
+    "link": "https://leetcode.com/problems/distance-between-bus-stops/"
   },
   "1185": {
+    "id": 1185,
     "category": "Math & Geometry",
+    "title": "Day of the Week",
     "difficulty": "Easy",
-    "id": 1185,
-    "link": "https://leetcode.com/problems/day-of-the-week/",
-    "title": "Day of the Week"
+    "link": "https://leetcode.com/problems/day-of-the-week/"
   },
   "1186": {
+    "id": 1186,
     "category": "Dynamic Programming",
+    "title": "Maximum Subarray Sum with One Deletion",
     "difficulty": "Medium",
-    "id": 1186,
-    "link": "https://leetcode.com/problems/maximum-subarray-sum-with-one-deletion/",
-    "title": "Maximum Subarray Sum with One Deletion"
+    "link": "https://leetcode.com/problems/maximum-subarray-sum-with-one-deletion/"
   },
   "1187": {
+    "id": 1187,
     "category": "Dynamic Programming",
+    "title": "Make Array Strictly Increasing",
     "difficulty": "Hard",
-    "id": 1187,
-    "link": "https://leetcode.com/problems/make-array-strictly-increasing/",
-    "title": "Make Array Strictly Increasing"
+    "link": "https://leetcode.com/problems/make-array-strictly-increasing/"
   },
   "1188": {
+    "id": 1188,
     "category": "Array & Hashing",
+    "title": "Design Bounded Blocking Queue",
     "difficulty": "Medium",
-    "id": 1188,
-    "link": "https://leetcode.com/problems/design-bounded-blocking-queue/",
-    "title": "Design Bounded Blocking Queue"
+    "link": "https://leetcode.com/problems/design-bounded-blocking-queue/"
   },
   "1189": {
+    "id": 1189,
     "category": "Array & Hashing",
+    "title": "Maximum Number of Balloons",
     "difficulty": "Easy",
-    "id": 1189,
-    "link": "https://leetcode.com/problems/maximum-number-of-balloons/",
-    "title": "Maximum Number of Balloons"
+    "link": "https://leetcode.com/problems/maximum-number-of-balloons/"
   },
   "1190": {
+    "id": 1190,
     "category": "Stack",
+    "title": "Reverse Substrings Between Each Pair of Parentheses",
     "difficulty": "Medium",
-    "id": 1190,
-    "link": "https://leetcode.com/problems/reverse-substrings-between-each-pair-of-parentheses/",
-    "title": "Reverse Substrings Between Each Pair of Parentheses"
+    "link": "https://leetcode.com/problems/reverse-substrings-between-each-pair-of-parentheses/"
   },
   "1191": {
+    "id": 1191,
     "category": "Dynamic Programming",
+    "title": "K-Concatenation Maximum Sum",
     "difficulty": "Medium",
-    "id": 1191,
-    "link": "https://leetcode.com/problems/k-concatenation-maximum-sum/",
-    "title": "K-Concatenation Maximum Sum"
+    "link": "https://leetcode.com/problems/k-concatenation-maximum-sum/"
   },
   "1192": {
+    "id": 1192,
     "category": "Graph Traversal",
+    "title": "Critical Connections in a Network",
     "difficulty": "Hard",
-    "id": 1192,
-    "link": "https://leetcode.com/problems/critical-connections-in-a-network/",
-    "title": "Critical Connections in a Network"
+    "link": "https://leetcode.com/problems/critical-connections-in-a-network/"
   },
   "1193": {
+    "id": 1193,
     "category": "Database",
+    "title": "Monthly Transactions I",
     "difficulty": "Medium",
-    "id": 1193,
-    "link": "https://leetcode.com/problems/monthly-transactions-i/",
-    "title": "Monthly Transactions I"
+    "link": "https://leetcode.com/problems/monthly-transactions-i/"
   },
   "1194": {
+    "id": 1194,
     "category": "Database",
+    "title": "Tournament Winners",
     "difficulty": "Hard",
-    "id": 1194,
-    "link": "https://leetcode.com/problems/tournament-winners/",
-    "title": "Tournament Winners"
+    "link": "https://leetcode.com/problems/tournament-winners/"
   },
   "1195": {
+    "id": 1195,
     "category": "Array & Hashing",
+    "title": "Fizz Buzz Multithreaded",
     "difficulty": "Medium",
-    "id": 1195,
-    "link": "https://leetcode.com/problems/fizz-buzz-multithreaded/",
-    "title": "Fizz Buzz Multithreaded"
+    "link": "https://leetcode.com/problems/fizz-buzz-multithreaded/"
   },
   "1196": {
+    "id": 1196,
     "category": "Greedy",
+    "title": "How Many Apples Can You Put into the Basket",
     "difficulty": "Easy",
-    "id": 1196,
-    "link": "https://leetcode.com/problems/how-many-apples-can-you-put-into-the-basket/",
-    "title": "How Many Apples Can You Put into the Basket"
+    "link": "https://leetcode.com/problems/how-many-apples-can-you-put-into-the-basket/"
   },
   "1197": {
+    "id": 1197,
     "category": "Graph Traversal",
+    "title": "Minimum Knight Moves",
     "difficulty": "Medium",
-    "id": 1197,
-    "link": "https://leetcode.com/problems/minimum-knight-moves/",
-    "title": "Minimum Knight Moves"
+    "link": "https://leetcode.com/problems/minimum-knight-moves/"
   },
   "1198": {
+    "id": 1198,
     "category": "Binary Search",
+    "title": "Find Smallest Common Element in All Rows",
     "difficulty": "Medium",
-    "id": 1198,
-    "link": "https://leetcode.com/problems/find-smallest-common-element-in-all-rows/",
-    "title": "Find Smallest Common Element in All Rows"
+    "link": "https://leetcode.com/problems/find-smallest-common-element-in-all-rows/"
   },
   "1199": {
+    "id": 1199,
     "category": "Heap (Priority Queue)",
+    "title": "Minimum Time to Build Blocks",
     "difficulty": "Hard",
-    "id": 1199,
-    "link": "https://leetcode.com/problems/minimum-time-to-build-blocks/",
-    "title": "Minimum Time to Build Blocks"
+    "link": "https://leetcode.com/problems/minimum-time-to-build-blocks/"
   },
   "1200": {
+    "id": 1200,
     "category": "Array & Hashing",
+    "title": "Minimum Absolute Difference",
     "difficulty": "Easy",
-    "id": 1200,
-    "link": "https://leetcode.com/problems/minimum-absolute-difference/",
-    "title": "Minimum Absolute Difference"
+    "link": "https://leetcode.com/problems/minimum-absolute-difference/"
   },
   "1201": {
+    "id": 1201,
     "category": "Binary Search",
+    "title": "Ugly Number III",
     "difficulty": "Medium",
-    "id": 1201,
-    "link": "https://leetcode.com/problems/ugly-number-iii/",
-    "title": "Ugly Number III"
+    "link": "https://leetcode.com/problems/ugly-number-iii/"
   },
   "1202": {
+    "id": 1202,
     "category": "Graph Traversal",
+    "title": "Smallest String With Swaps",
     "difficulty": "Medium",
-    "id": 1202,
-    "link": "https://leetcode.com/problems/smallest-string-with-swaps/",
-    "title": "Smallest String With Swaps"
+    "link": "https://leetcode.com/problems/smallest-string-with-swaps/"
   },
   "1203": {
+    "id": 1203,
     "category": "Graph Traversal",
+    "title": "Sort Items by Groups Respecting Dependencies",
     "difficulty": "Hard",
-    "id": 1203,
-    "link": "https://leetcode.com/problems/sort-items-by-groups-respecting-dependencies/",
-    "title": "Sort Items by Groups Respecting Dependencies"
+    "link": "https://leetcode.com/problems/sort-items-by-groups-respecting-dependencies/"
   },
   "1204": {
+    "id": 1204,
     "category": "Database",
+    "title": "Last Person to Fit in the Bus",
     "difficulty": "Medium",
-    "id": 1204,
-    "link": "https://leetcode.com/problems/last-person-to-fit-in-the-bus/",
-    "title": "Last Person to Fit in the Bus"
+    "link": "https://leetcode.com/problems/last-person-to-fit-in-the-bus/"
   },
   "1205": {
+    "id": 1205,
     "category": "Database",
+    "title": "Monthly Transactions II",
     "difficulty": "Medium",
-    "id": 1205,
-    "link": "https://leetcode.com/problems/monthly-transactions-ii/",
-    "title": "Monthly Transactions II"
+    "link": "https://leetcode.com/problems/monthly-transactions-ii/"
   },
   "1206": {
+    "id": 1206,
     "category": "Linked List",
+    "title": "Design Skiplist",
     "difficulty": "Hard",
-    "id": 1206,
-    "link": "https://leetcode.com/problems/design-skiplist/",
-    "title": "Design Skiplist"
+    "link": "https://leetcode.com/problems/design-skiplist/"
   },
   "1207": {
+    "id": 1207,
     "category": "Array & Hashing",
+    "title": "Unique Number of Occurrences",
     "difficulty": "Easy",
-    "id": 1207,
-    "link": "https://leetcode.com/problems/unique-number-of-occurrences/",
-    "title": "Unique Number of Occurrences"
+    "link": "https://leetcode.com/problems/unique-number-of-occurrences/"
   },
   "1208": {
+    "id": 1208,
     "category": "Sliding Window",
+    "title": "Get Equal Substrings Within Budget",
     "difficulty": "Medium",
-    "id": 1208,
-    "link": "https://leetcode.com/problems/get-equal-substrings-within-budget/",
-    "title": "Get Equal Substrings Within Budget"
+    "link": "https://leetcode.com/problems/get-equal-substrings-within-budget/"
   },
   "1209": {
+    "id": 1209,
     "category": "Stack",
+    "title": "Remove All Adjacent Duplicates in String II",
     "difficulty": "Medium",
-    "id": 1209,
-    "link": "https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string-ii/",
-    "title": "Remove All Adjacent Duplicates in String II"
+    "link": "https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string-ii/"
   },
   "1210": {
+    "id": 1210,
     "category": "Graph Traversal",
+    "title": "Minimum Moves to Reach Target with Rotations",
     "difficulty": "Hard",
-    "id": 1210,
-    "link": "https://leetcode.com/problems/minimum-moves-to-reach-target-with-rotations/",
-    "title": "Minimum Moves to Reach Target with Rotations"
+    "link": "https://leetcode.com/problems/minimum-moves-to-reach-target-with-rotations/"
   },
   "1211": {
+    "id": 1211,
     "category": "Database",
+    "title": "Queries Quality and Percentage",
     "difficulty": "Easy",
-    "id": 1211,
-    "link": "https://leetcode.com/problems/queries-quality-and-percentage/",
-    "title": "Queries Quality and Percentage"
+    "link": "https://leetcode.com/problems/queries-quality-and-percentage/"
   },
   "1212": {
+    "id": 1212,
     "category": "Database",
+    "title": "Team Scores in Football Tournament",
     "difficulty": "Medium",
-    "id": 1212,
-    "link": "https://leetcode.com/problems/team-scores-in-football-tournament/",
-    "title": "Team Scores in Football Tournament"
+    "link": "https://leetcode.com/problems/team-scores-in-football-tournament/"
   },
   "1213": {
+    "id": 1213,
     "category": "Binary Search",
+    "title": "Intersection of Three Sorted Arrays",
     "difficulty": "Easy",
-    "id": 1213,
-    "link": "https://leetcode.com/problems/intersection-of-three-sorted-arrays/",
-    "title": "Intersection of Three Sorted Arrays"
+    "link": "https://leetcode.com/problems/intersection-of-three-sorted-arrays/"
+  },
+  "1214": {
+    "id": 1214,
+    "category": "Tree",
+    "title": "Two Sum BSTs",
+    "difficulty": "Medium",
+    "link": "https://leetcode.com/problems/two-sum-bsts/"
   },
-  "1214": {"category": "Tree", "difficulty": "Medium", "id": 1214, "link": "https://leetcode.com/problems/two-sum-bsts/", "title": "Two Sum BSTs"},
   "1215": {
+    "id": 1215,
     "category": "Graph Traversal",
+    "title": "Stepping Numbers",
     "difficulty": "Medium",
-    "id": 1215,
-    "link": "https://leetcode.com/problems/stepping-numbers/",
-    "title": "Stepping Numbers"
+    "link": "https://leetcode.com/problems/stepping-numbers/"
   },
   "1216": {
+    "id": 1216,
     "category": "Dynamic Programming",
+    "title": "Valid Palindrome III",
     "difficulty": "Hard",
-    "id": 1216,
-    "link": "https://leetcode.com/problems/valid-palindrome-iii/",
-    "title": "Valid Palindrome III"
+    "link": "https://leetcode.com/problems/valid-palindrome-iii/"
   },
   "1217": {
+    "id": 1217,
     "category": "Greedy",
+    "title": "Minimum Cost to Move Chips to The Same Position",
     "difficulty": "Easy",
-    "id": 1217,
-    "link": "https://leetcode.com/problems/minimum-cost-to-move-chips-to-the-same-position/",
-    "title": "Minimum Cost to Move Chips to The Same Position"
+    "link": "https://leetcode.com/problems/minimum-cost-to-move-chips-to-the-same-position/"
   },
   "1218": {
+    "id": 1218,
     "category": "Dynamic Programming",
+    "title": "Longest Arithmetic Subsequence of Given Difference",
     "difficulty": "Medium",
-    "id": 1218,
-    "link": "https://leetcode.com/problems/longest-arithmetic-subsequence-of-given-difference/",
-    "title": "Longest Arithmetic Subsequence of Given Difference"
+    "link": "https://leetcode.com/problems/longest-arithmetic-subsequence-of-given-difference/"
   },
   "1219": {
+    "id": 1219,
     "category": "Backtracking",
+    "title": "Path with Maximum Gold",
     "difficulty": "Medium",
-    "id": 1219,
-    "link": "https://leetcode.com/problems/path-with-maximum-gold/",
-    "title": "Path with Maximum Gold"
+    "link": "https://leetcode.com/problems/path-with-maximum-gold/"
   },
   "1220": {
+    "id": 1220,
     "category": "Dynamic Programming",
+    "title": "Count Vowels Permutation",
     "difficulty": "Hard",
-    "id": 1220,
-    "link": "https://leetcode.com/problems/count-vowels-permutation/",
-    "title": "Count Vowels Permutation"
+    "link": "https://leetcode.com/problems/count-vowels-permutation/"
   },
   "1221": {
+    "id": 1221,
     "category": "Greedy",
+    "title": "Split a String in Balanced Strings",
     "difficulty": "Easy",
-    "id": 1221,
-    "link": "https://leetcode.com/problems/split-a-string-in-balanced-strings/",
-    "title": "Split a String in Balanced Strings"
+    "link": "https://leetcode.com/problems/split-a-string-in-balanced-strings/"
   },
   "1222": {
+    "id": 1222,
     "category": "Array & Hashing",
+    "title": "Queens That Can Attack the King",
     "difficulty": "Medium",
-    "id": 1222,
-    "link": "https://leetcode.com/problems/queens-that-can-attack-the-king/",
-    "title": "Queens That Can Attack the King"
+    "link": "https://leetcode.com/problems/queens-that-can-attack-the-king/"
   },
   "1223": {
+    "id": 1223,
     "category": "Dynamic Programming",
+    "title": "Dice Roll Simulation",
     "difficulty": "Hard",
-    "id": 1223,
-    "link": "https://leetcode.com/problems/dice-roll-simulation/",
-    "title": "Dice Roll Simulation"
+    "link": "https://leetcode.com/problems/dice-roll-simulation/"
   },
   "1224": {
+    "id": 1224,
     "category": "Array & Hashing",
+    "title": "Maximum Equal Frequency",
     "difficulty": "Hard",
-    "id": 1224,
-    "link": "https://leetcode.com/problems/maximum-equal-frequency/",
-    "title": "Maximum Equal Frequency"
+    "link": "https://leetcode.com/problems/maximum-equal-frequency/"
   },
   "1225": {
+    "id": 1225,
     "category": "Database",
+    "title": "Report Contiguous Dates",
     "difficulty": "Hard",
-    "id": 1225,
-    "link": "https://leetcode.com/problems/report-contiguous-dates/",
-    "title": "Report Contiguous Dates"
+    "link": "https://leetcode.com/problems/report-contiguous-dates/"
   },
   "1226": {
+    "id": 1226,
     "category": "Array & Hashing",
+    "title": "The Dining Philosophers",
     "difficulty": "Medium",
-    "id": 1226,
-    "link": "https://leetcode.com/problems/the-dining-philosophers/",
-    "title": "The Dining Philosophers"
+    "link": "https://leetcode.com/problems/the-dining-philosophers/"
   },
   "1227": {
+    "id": 1227,
     "category": "Dynamic Programming",
+    "title": "Airplane Seat Assignment Probability",
     "difficulty": "Medium",
-    "id": 1227,
-    "link": "https://leetcode.com/problems/airplane-seat-assignment-probability/",
-    "title": "Airplane Seat Assignment Probability"
+    "link": "https://leetcode.com/problems/airplane-seat-assignment-probability/"
   },
   "1228": {
+    "id": 1228,
     "category": "Math & Geometry",
+    "title": "Missing Number In Arithmetic Progression",
     "difficulty": "Easy",
-    "id": 1228,
-    "link": "https://leetcode.com/problems/missing-number-in-arithmetic-progression/",
-    "title": "Missing Number In Arithmetic Progression"
+    "link": "https://leetcode.com/problems/missing-number-in-arithmetic-progression/"
   },
   "1229": {
+    "id": 1229,
     "category": "Two Pointers",
+    "title": "Meeting Scheduler",
     "difficulty": "Medium",
-    "id": 1229,
-    "link": "https://leetcode.com/problems/meeting-scheduler/",
-    "title": "Meeting Scheduler"
+    "link": "https://leetcode.com/problems/meeting-scheduler/"
   },
   "1230": {
+    "id": 1230,
     "category": "Dynamic Programming",
+    "title": "Toss Strange Coins",
     "difficulty": "Medium",
-    "id": 1230,
-    "link": "https://leetcode.com/problems/toss-strange-coins/",
-    "title": "Toss Strange Coins"
+    "link": "https://leetcode.com/problems/toss-strange-coins/"
   },
   "1231": {
+    "id": 1231,
     "category": "Binary Search",
+    "title": "Divide Chocolate",
     "difficulty": "Hard",
-    "id": 1231,
-    "link": "https://leetcode.com/problems/divide-chocolate/",
-    "title": "Divide Chocolate"
+    "link": "https://leetcode.com/problems/divide-chocolate/"
   },
   "1232": {
+    "id": 1232,
     "category": "Math & Geometry",
+    "title": "Check If It Is a Straight Line",
     "difficulty": "Easy",
-    "id": 1232,
-    "link": "https://leetcode.com/problems/check-if-it-is-a-straight-line/",
-    "title": "Check If It Is a Straight Line"
+    "link": "https://leetcode.com/problems/check-if-it-is-a-straight-line/"
   },
   "1233": {
+    "id": 1233,
     "category": "Graph Traversal",
+    "title": "Remove Sub-Folders from the Filesystem",
     "difficulty": "Medium",
-    "id": 1233,
-    "link": "https://leetcode.com/problems/remove-sub-folders-from-the-filesystem/",
-    "title": "Remove Sub-Folders from the Filesystem"
+    "link": "https://leetcode.com/problems/remove-sub-folders-from-the-filesystem/"
   },
   "1234": {
+    "id": 1234,
     "category": "Sliding Window",
+    "title": "Replace the Substring for Balanced String",
     "difficulty": "Medium",
-    "id": 1234,
-    "link": "https://leetcode.com/problems/replace-the-substring-for-balanced-string/",
-    "title": "Replace the Substring for Balanced String"
+    "link": "https://leetcode.com/problems/replace-the-substring-for-balanced-string/"
   },
   "1235": {
+    "id": 1235,
     "category": "Dynamic Programming",
+    "title": "Maximum Profit in Job Scheduling",
     "difficulty": "Hard",
-    "id": 1235,
-    "link": "https://leetcode.com/problems/maximum-profit-in-job-scheduling/",
-    "title": "Maximum Profit in Job Scheduling"
+    "link": "https://leetcode.com/problems/maximum-profit-in-job-scheduling/"
   },
   "1236": {
+    "id": 1236,
     "category": "Graph Traversal",
+    "title": "Web Crawler",
     "difficulty": "Medium",
-    "id": 1236,
-    "link": "https://leetcode.com/problems/web-crawler/",
-    "title": "Web Crawler"
+    "link": "https://leetcode.com/problems/web-crawler/"
   },
   "1237": {
+    "id": 1237,
     "category": "Binary Search",
+    "title": "Find Positive Integer Solution for a Given Equation",
     "difficulty": "Medium",
-    "id": 1237,
-    "link": "https://leetcode.com/problems/find-positive-integer-solution-for-a-given-equation/",
-    "title": "Find Positive Integer Solution for a Given Equation"
+    "link": "https://leetcode.com/problems/find-positive-integer-solution-for-a-given-equation/"
   },
   "1238": {
+    "id": 1238,
     "category": "Backtracking",
+    "title": "Circular Permutation in Binary Representation",
     "difficulty": "Medium",
-    "id": 1238,
-    "link": "https://leetcode.com/problems/circular-permutation-in-binary-representation/",
-    "title": "Circular Permutation in Binary Representation"
+    "link": "https://leetcode.com/problems/circular-permutation-in-binary-representation/"
   },
   "1239": {
+    "id": 1239,
     "category": "Backtracking",
+    "title": "Maximum Length of a Concatenated String with Unique Characters",
     "difficulty": "Medium",
-    "id": 1239,
-    "link": "https://leetcode.com/problems/maximum-length-of-a-concatenated-string-with-unique-characters/",
-    "title": "Maximum Length of a Concatenated String with Unique Characters"
+    "link": "https://leetcode.com/problems/maximum-length-of-a-concatenated-string-with-unique-characters/"
   },
   "1240": {
+    "id": 1240,
     "category": "Backtracking",
+    "title": "Tiling a Rectangle with the Fewest Squares",
     "difficulty": "Hard",
-    "id": 1240,
-    "link": "https://leetcode.com/problems/tiling-a-rectangle-with-the-fewest-squares/",
-    "title": "Tiling a Rectangle with the Fewest Squares"
+    "link": "https://leetcode.com/problems/tiling-a-rectangle-with-the-fewest-squares/"
   },
   "1241": {
+    "id": 1241,
     "category": "Database",
+    "title": "Number of Comments per Post",
     "difficulty": "Easy",
-    "id": 1241,
-    "link": "https://leetcode.com/problems/number-of-comments-per-post/",
-    "title": "Number of Comments per Post"
+    "link": "https://leetcode.com/problems/number-of-comments-per-post/"
   },
   "1242": {
+    "id": 1242,
     "category": "Graph Traversal",
+    "title": "Web Crawler Multithreaded",
     "difficulty": "Medium",
-    "id": 1242,
-    "link": "https://leetcode.com/problems/web-crawler-multithreaded/",
-    "title": "Web Crawler Multithreaded"
+    "link": "https://leetcode.com/problems/web-crawler-multithreaded/"
   },
   "1243": {
+    "id": 1243,
     "category": "Array & Hashing",
+    "title": "Array Transformation",
     "difficulty": "Easy",
-    "id": 1243,
-    "link": "https://leetcode.com/problems/array-transformation/",
-    "title": "Array Transformation"
+    "link": "https://leetcode.com/problems/array-transformation/"
   },
   "1244": {
+    "id": 1244,
     "category": "Array & Hashing",
+    "title": "Design A Leaderboard",
     "difficulty": "Medium",
-    "id": 1244,
-    "link": "https://leetcode.com/problems/design-a-leaderboard/",
-    "title": "Design A Leaderboard"
+    "link": "https://leetcode.com/problems/design-a-leaderboard/"
+  },
+  "1245": {
+    "id": 1245,
+    "category": "Tree",
+    "title": "Tree Diameter",
+    "difficulty": "Medium",
+    "link": "https://leetcode.com/problems/tree-diameter/"
   },
-  "1245": {"category": "Tree", "difficulty": "Medium", "id": 1245, "link": "https://leetcode.com/problems/tree-diameter/", "title": "Tree Diameter"},
   "1246": {
+    "id": 1246,
     "category": "Dynamic Programming",
+    "title": "Palindrome Removal",
     "difficulty": "Hard",
-    "id": 1246,
-    "link": "https://leetcode.com/problems/palindrome-removal/",
-    "title": "Palindrome Removal"
+    "link": "https://leetcode.com/problems/palindrome-removal/"
   },
   "1247": {
+    "id": 1247,
     "category": "Greedy",
+    "title": "Minimum Swaps to Make Strings Equal",
     "difficulty": "Medium",
-    "id": 1247,
-    "link": "https://leetcode.com/problems/minimum-swaps-to-make-strings-equal/",
-    "title": "Minimum Swaps to Make Strings Equal"
+    "link": "https://leetcode.com/problems/minimum-swaps-to-make-strings-equal/"
   },
   "1248": {
+    "id": 1248,
     "category": "Sliding Window",
+    "title": "Count Number of Nice Subarrays",
     "difficulty": "Medium",
-    "id": 1248,
-    "link": "https://leetcode.com/problems/count-number-of-nice-subarrays/",
-    "title": "Count Number of Nice Subarrays"
+    "link": "https://leetcode.com/problems/count-number-of-nice-subarrays/"
   },
   "1249": {
+    "id": 1249,
     "category": "Stack",
+    "title": "Minimum Remove to Make Valid Parentheses",
     "difficulty": "Medium",
-    "id": 1249,
-    "link": "https://leetcode.com/problems/minimum-remove-to-make-valid-parentheses/",
-    "title": "Minimum Remove to Make Valid Parentheses"
+    "link": "https://leetcode.com/problems/minimum-remove-to-make-valid-parentheses/"
   },
   "1250": {
+    "id": 1250,
     "category": "Math & Geometry",
+    "title": "Check If It Is a Good Array",
     "difficulty": "Hard",
-    "id": 1250,
-    "link": "https://leetcode.com/problems/check-if-it-is-a-good-array/",
-    "title": "Check If It Is a Good Array"
+    "link": "https://leetcode.com/problems/check-if-it-is-a-good-array/"
   },
   "1251": {
+    "id": 1251,
     "category": "Database",
+    "title": "Average Selling Price",
     "difficulty": "Easy",
-    "id": 1251,
-    "link": "https://leetcode.com/problems/average-selling-price/",
-    "title": "Average Selling Price"
+    "link": "https://leetcode.com/problems/average-selling-price/"
   },
   "1252": {
+    "id": 1252,
     "category": "Math & Geometry",
+    "title": "Cells with Odd Values in a Matrix",
     "difficulty": "Easy",
-    "id": 1252,
-    "link": "https://leetcode.com/problems/cells-with-odd-values-in-a-matrix/",
-    "title": "Cells with Odd Values in a Matrix"
+    "link": "https://leetcode.com/problems/cells-with-odd-values-in-a-matrix/"
   },
   "1253": {
+    "id": 1253,
     "category": "Greedy",
+    "title": "Reconstruct a 2-Row Binary Matrix",
     "difficulty": "Medium",
-    "id": 1253,
-    "link": "https://leetcode.com/problems/reconstruct-a-2-row-binary-matrix/",
-    "title": "Reconstruct a 2-Row Binary Matrix"
+    "link": "https://leetcode.com/problems/reconstruct-a-2-row-binary-matrix/"
   },
   "1254": {
+    "id": 1254,
     "category": "Graph Traversal",
+    "title": "Number of Closed Islands",
     "difficulty": "Medium",
-    "id": 1254,
-    "link": "https://leetcode.com/problems/number-of-closed-islands/",
-    "title": "Number of Closed Islands"
+    "link": "https://leetcode.com/problems/number-of-closed-islands/"
   },
   "1255": {
+    "id": 1255,
     "category": "Dynamic Programming",
+    "title": "Maximum Score Words Formed by Letters",
     "difficulty": "Hard",
-    "id": 1255,
-    "link": "https://leetcode.com/problems/maximum-score-words-formed-by-letters/",
-    "title": "Maximum Score Words Formed by Letters"
+    "link": "https://leetcode.com/problems/maximum-score-words-formed-by-letters/"
   },
   "1256": {
+    "id": 1256,
     "category": "Bit Manipulation",
+    "title": "Encode Number",
     "difficulty": "Medium",
-    "id": 1256,
-    "link": "https://leetcode.com/problems/encode-number/",
-    "title": "Encode Number"
+    "link": "https://leetcode.com/problems/encode-number/"
   },
   "1257": {
+    "id": 1257,
     "category": "Tree",
+    "title": "Smallest Common Region",
     "difficulty": "Medium",
-    "id": 1257,
-    "link": "https://leetcode.com/problems/smallest-common-region/",
-    "title": "Smallest Common Region"
+    "link": "https://leetcode.com/problems/smallest-common-region/"
   },
   "1258": {
+    "id": 1258,
     "category": "Graph Traversal",
+    "title": "Synonymous Sentences",
     "difficulty": "Medium",
-    "id": 1258,
-    "link": "https://leetcode.com/problems/synonymous-sentences/",
-    "title": "Synonymous Sentences"
+    "link": "https://leetcode.com/problems/synonymous-sentences/"
   },
   "1259": {
+    "id": 1259,
     "category": "Dynamic Programming",
+    "title": "Handshakes That Don't Cross",
     "difficulty": "Hard",
-    "id": 1259,
-    "link": "https://leetcode.com/problems/handshakes-that-dont-cross/",
-    "title": "Handshakes That Don't Cross"
+    "link": "https://leetcode.com/problems/handshakes-that-dont-cross/"
   },
   "1260": {
+    "id": 1260,
     "category": "Array & Hashing",
+    "title": "Shift 2D Grid",
     "difficulty": "Easy",
-    "id": 1260,
-    "link": "https://leetcode.com/problems/shift-2d-grid/",
-    "title": "Shift 2D Grid"
+    "link": "https://leetcode.com/problems/shift-2d-grid/"
   },
   "1261": {
+    "id": 1261,
     "category": "Tree",
+    "title": "Find Elements in a Contaminated Binary Tree",
     "difficulty": "Medium",
-    "id": 1261,
-    "link": "https://leetcode.com/problems/find-elements-in-a-contaminated-binary-tree/",
-    "title": "Find Elements in a Contaminated Binary Tree"
+    "link": "https://leetcode.com/problems/find-elements-in-a-contaminated-binary-tree/"
   },
   "1262": {
+    "id": 1262,
     "category": "Dynamic Programming",
+    "title": "Greatest Sum Divisible by Three",
     "difficulty": "Medium",
-    "id": 1262,
-    "link": "https://leetcode.com/problems/greatest-sum-divisible-by-three/",
-    "title": "Greatest Sum Divisible by Three"
+    "link": "https://leetcode.com/problems/greatest-sum-divisible-by-three/"
   },
   "1263": {
+    "id": 1263,
     "category": "Graph Traversal",
+    "title": "Minimum Moves to Move a Box to Their Target Location",
     "difficulty": "Hard",
-    "id": 1263,
-    "link": "https://leetcode.com/problems/minimum-moves-to-move-a-box-to-their-target-location/",
-    "title": "Minimum Moves to Move a Box to Their Target Location"
+    "link": "https://leetcode.com/problems/minimum-moves-to-move-a-box-to-their-target-location/"
   },
   "1264": {
+    "id": 1264,
     "category": "Database",
+    "title": "Page Recommendations",
     "difficulty": "Medium",
-    "id": 1264,
-    "link": "https://leetcode.com/problems/page-recommendations/",
-    "title": "Page Recommendations"
+    "link": "https://leetcode.com/problems/page-recommendations/"
   },
   "1265": {
+    "id": 1265,
     "category": "Stack",
+    "title": "Print Immutable Linked List in Reverse",
     "difficulty": "Medium",
-    "id": 1265,
-    "link": "https://leetcode.com/problems/print-immutable-linked-list-in-reverse/",
-    "title": "Print Immutable Linked List in Reverse"
+    "link": "https://leetcode.com/problems/print-immutable-linked-list-in-reverse/"
   },
   "1266": {
+    "id": 1266,
     "category": "Math & Geometry",
+    "title": "Minimum Time Visiting All Points",
     "difficulty": "Easy",
-    "id": 1266,
-    "link": "https://leetcode.com/problems/minimum-time-visiting-all-points/",
-    "title": "Minimum Time Visiting All Points"
+    "link": "https://leetcode.com/problems/minimum-time-visiting-all-points/"
   },
   "1267": {
+    "id": 1267,
     "category": "Graph Traversal",
+    "title": "Count Servers that Communicate",
     "difficulty": "Medium",
-    "id": 1267,
-    "link": "https://leetcode.com/problems/count-servers-that-communicate/",
-    "title": "Count Servers that Communicate"
+    "link": "https://leetcode.com/problems/count-servers-that-communicate/"
   },
   "1268": {
+    "id": 1268,
     "category": "Binary Search",
+    "title": "Search Suggestions System",
     "difficulty": "Medium",
-    "id": 1268,
-    "link": "https://leetcode.com/problems/search-suggestions-system/",
-    "title": "Search Suggestions System"
+    "link": "https://leetcode.com/problems/search-suggestions-system/"
   },
   "1269": {
+    "id": 1269,
     "category": "Dynamic Programming",
+    "title": "Number of Ways to Stay in the Same Place After Some Steps",
     "difficulty": "Hard",
-    "id": 1269,
-    "link": "https://leetcode.com/problems/number-of-ways-to-stay-in-the-same-place-after-some-steps/",
-    "title": "Number of Ways to Stay in the Same Place After Some Steps"
+    "link": "https://leetcode.com/problems/number-of-ways-to-stay-in-the-same-place-after-some-steps/"
   },
   "1270": {
+    "id": 1270,
     "category": "Database",
+    "title": "All People Report to the Given Manager",
     "difficulty": "Medium",
-    "id": 1270,
-    "link": "https://leetcode.com/problems/all-people-report-to-the-given-manager/",
-    "title": "All People Report to the Given Manager"
+    "link": "https://leetcode.com/problems/all-people-report-to-the-given-manager/"
+  },
+  "1271": {
+    "id": 1271,
+    "category": "Math & Geometry",
+    "title": "Hexspeak",
+    "difficulty": "Easy",
+    "link": "https://leetcode.com/problems/hexspeak/"
   },
-  "1271": {"category": "Math & Geometry", "difficulty": "Easy", "id": 1271, "link": "https://leetcode.com/problems/hexspeak/", "title": "Hexspeak"},
   "1272": {
+    "id": 1272,
     "category": "Array & Hashing",
+    "title": "Remove Interval",
     "difficulty": "Medium",
-    "id": 1272,
-    "link": "https://leetcode.com/problems/remove-interval/",
-    "title": "Remove Interval"
+    "link": "https://leetcode.com/problems/remove-interval/"
   },
   "1273": {
+    "id": 1273,
     "category": "Tree",
+    "title": "Delete Tree Nodes",
     "difficulty": "Medium",
-    "id": 1273,
-    "link": "https://leetcode.com/problems/delete-tree-nodes/",
-    "title": "Delete Tree Nodes"
+    "link": "https://leetcode.com/problems/delete-tree-nodes/"
   },
   "1274": {
+    "id": 1274,
     "category": "Array & Hashing",
+    "title": "Number of Ships in a Rectangle",
     "difficulty": "Hard",
-    "id": 1274,
-    "link": "https://leetcode.com/problems/number-of-ships-in-a-rectangle/",
-    "title": "Number of Ships in a Rectangle"
+    "link": "https://leetcode.com/problems/number-of-ships-in-a-rectangle/"
   },
   "1275": {
+    "id": 1275,
     "category": "Array & Hashing",
+    "title": "Find Winner on a Tic Tac Toe Game",
     "difficulty": "Easy",
-    "id": 1275,
-    "link": "https://leetcode.com/problems/find-winner-on-a-tic-tac-toe-game/",
-    "title": "Find Winner on a Tic Tac Toe Game"
+    "link": "https://leetcode.com/problems/find-winner-on-a-tic-tac-toe-game/"
   },
   "1276": {
+    "id": 1276,
     "category": "Math & Geometry",
+    "title": "Number of Burgers with No Waste of Ingredients",
     "difficulty": "Medium",
-    "id": 1276,
-    "link": "https://leetcode.com/problems/number-of-burgers-with-no-waste-of-ingredients/",
-    "title": "Number of Burgers with No Waste of Ingredients"
+    "link": "https://leetcode.com/problems/number-of-burgers-with-no-waste-of-ingredients/"
   },
   "1277": {
+    "id": 1277,
     "category": "Dynamic Programming",
+    "title": "Count Square Submatrices with All Ones",
     "difficulty": "Medium",
-    "id": 1277,
-    "link": "https://leetcode.com/problems/count-square-submatrices-with-all-ones/",
-    "title": "Count Square Submatrices with All Ones"
+    "link": "https://leetcode.com/problems/count-square-submatrices-with-all-ones/"
   },
   "1278": {
+    "id": 1278,
     "category": "Dynamic Programming",
+    "title": "Palindrome Partitioning III",
     "difficulty": "Hard",
-    "id": 1278,
-    "link": "https://leetcode.com/problems/palindrome-partitioning-iii/",
-    "title": "Palindrome Partitioning III"
+    "link": "https://leetcode.com/problems/palindrome-partitioning-iii/"
   },
   "1279": {
+    "id": 1279,
     "category": "Array & Hashing",
+    "title": "Traffic Light Controlled Intersection",
     "difficulty": "Easy",
-    "id": 1279,
-    "link": "https://leetcode.com/problems/traffic-light-controlled-intersection/",
-    "title": "Traffic Light Controlled Intersection"
+    "link": "https://leetcode.com/problems/traffic-light-controlled-intersection/"
   },
   "1280": {
+    "id": 1280,
     "category": "Database",
+    "title": "Students and Examinations",
     "difficulty": "Easy",
-    "id": 1280,
-    "link": "https://leetcode.com/problems/students-and-examinations/",
-    "title": "Students and Examinations"
+    "link": "https://leetcode.com/problems/students-and-examinations/"
   },
   "1281": {
+    "id": 1281,
     "category": "Math & Geometry",
+    "title": "Subtract the Product and Sum of Digits of an Integer",
     "difficulty": "Easy",
-    "id": 1281,
-    "link": "https://leetcode.com/problems/subtract-the-product-and-sum-of-digits-of-an-integer/",
-    "title": "Subtract the Product and Sum of Digits of an Integer"
+    "link": "https://leetcode.com/problems/subtract-the-product-and-sum-of-digits-of-an-integer/"
   },
   "1282": {
+    "id": 1282,
     "category": "Greedy",
+    "title": "Group the People Given the Group Size They Belong To",
     "difficulty": "Medium",
-    "id": 1282,
-    "link": "https://leetcode.com/problems/group-the-people-given-the-group-size-they-belong-to/",
-    "title": "Group the People Given the Group Size They Belong To"
+    "link": "https://leetcode.com/problems/group-the-people-given-the-group-size-they-belong-to/"
   },
   "1283": {
+    "id": 1283,
     "category": "Binary Search",
+    "title": "Find the Smallest Divisor Given a Threshold",
     "difficulty": "Medium",
-    "id": 1283,
-    "link": "https://leetcode.com/problems/find-the-smallest-divisor-given-a-threshold/",
-    "title": "Find the Smallest Divisor Given a Threshold"
+    "link": "https://leetcode.com/problems/find-the-smallest-divisor-given-a-threshold/"
   },
   "1284": {
+    "id": 1284,
     "category": "Graph Traversal",
+    "title": "Minimum Number of Flips to Convert Binary Matrix to Zero Matrix",
     "difficulty": "Hard",
-    "id": 1284,
-    "link": "https://leetcode.com/problems/minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix/",
-    "title": "Minimum Number of Flips to Convert Binary Matrix to Zero Matrix"
+    "link": "https://leetcode.com/problems/minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix/"
   },
   "1285": {
+    "id": 1285,
     "category": "Database",
+    "title": "Find the Start and End Number of Continuous Ranges",
     "difficulty": "Medium",
-    "id": 1285,
-    "link": "https://leetcode.com/problems/find-the-start-and-end-number-of-continuous-ranges/",
-    "title": "Find the Start and End Number of Continuous Ranges"
+    "link": "https://leetcode.com/problems/find-the-start-and-end-number-of-continuous-ranges/"
   },
   "1286": {
+    "id": 1286,
     "category": "Backtracking",
+    "title": "Iterator for Combination",
     "difficulty": "Medium",
-    "id": 1286,
-    "link": "https://leetcode.com/problems/iterator-for-combination/",
-    "title": "Iterator for Combination"
+    "link": "https://leetcode.com/problems/iterator-for-combination/"
   },
   "1287": {
+    "id": 1287,
     "category": "Array & Hashing",
+    "title": "Element Appearing More Than 25% In Sorted Array",
     "difficulty": "Easy",
-    "id": 1287,
-    "link": "https://leetcode.com/problems/element-appearing-more-than-25-in-sorted-array/",
-    "title": "Element Appearing More Than 25% In Sorted Array"
+    "link": "https://leetcode.com/problems/element-appearing-more-than-25-in-sorted-array/"
   },
   "1288": {
+    "id": 1288,
     "category": "Array & Hashing",
+    "title": "Remove Covered Intervals",
     "difficulty": "Medium",
-    "id": 1288,
-    "link": "https://leetcode.com/problems/remove-covered-intervals/",
-    "title": "Remove Covered Intervals"
+    "link": "https://leetcode.com/problems/remove-covered-intervals/"
   },
   "1289": {
+    "id": 1289,
     "category": "Dynamic Programming",
+    "title": "Minimum Falling Path Sum II",
     "difficulty": "Hard",
-    "id": 1289,
-    "link": "https://leetcode.com/problems/minimum-falling-path-sum-ii/",
-    "title": "Minimum Falling Path Sum II"
+    "link": "https://leetcode.com/problems/minimum-falling-path-sum-ii/"
   },
   "1290": {
+    "id": 1290,
     "category": "Linked List",
+    "title": "Convert Binary Number in a Linked List to Integer",
     "difficulty": "Easy",
-    "id": 1290,
-    "link": "https://leetcode.com/problems/convert-binary-number-in-a-linked-list-to-integer/",
-    "title": "Convert Binary Number in a Linked List to Integer"
+    "link": "https://leetcode.com/problems/convert-binary-number-in-a-linked-list-to-integer/"
   },
   "1291": {
+    "id": 1291,
     "category": "Array & Hashing",
+    "title": "Sequential Digits",
     "difficulty": "Medium",
-    "id": 1291,
-    "link": "https://leetcode.com/problems/sequential-digits/",
-    "title": "Sequential Digits"
+    "link": "https://leetcode.com/problems/sequential-digits/"
   },
   "1292": {
+    "id": 1292,
     "category": "Binary Search",
+    "title": "Maximum Side Length of a Square with Sum Less than or Equal to Threshold",
     "difficulty": "Medium",
-    "id": 1292,
-    "link": "https://leetcode.com/problems/maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold/",
-    "title": "Maximum Side Length of a Square with Sum Less than or Equal to Threshold"
+    "link": "https://leetcode.com/problems/maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold/"
   },
   "1293": {
+    "id": 1293,
     "category": "Graph Traversal",
+    "title": "Shortest Path in a Grid with Obstacles Elimination",
     "difficulty": "Hard",
-    "id": 1293,
-    "link": "https://leetcode.com/problems/shortest-path-in-a-grid-with-obstacles-elimination/",
-    "title": "Shortest Path in a Grid with Obstacles Elimination"
+    "link": "https://leetcode.com/problems/shortest-path-in-a-grid-with-obstacles-elimination/"
   },
   "1294": {
+    "id": 1294,
     "category": "Database",
+    "title": "Weather Type in Each Country",
     "difficulty": "Easy",
-    "id": 1294,
-    "link": "https://leetcode.com/problems/weather-type-in-each-country/",
-    "title": "Weather Type in Each Country"
+    "link": "https://leetcode.com/problems/weather-type-in-each-country/"
   },
   "1295": {
+    "id": 1295,
     "category": "Math & Geometry",
+    "title": "Find Numbers with Even Number of Digits",
     "difficulty": "Easy",
-    "id": 1295,
-    "link": "https://leetcode.com/problems/find-numbers-with-even-number-of-digits/",
-    "title": "Find Numbers with Even Number of Digits"
+    "link": "https://leetcode.com/problems/find-numbers-with-even-number-of-digits/"
   },
   "1296": {
+    "id": 1296,
     "category": "Greedy",
+    "title": "Divide Array in Sets of K Consecutive Numbers",
     "difficulty": "Medium",
-    "id": 1296,
-    "link": "https://leetcode.com/problems/divide-array-in-sets-of-k-consecutive-numbers/",
-    "title": "Divide Array in Sets of K Consecutive Numbers"
+    "link": "https://leetcode.com/problems/divide-array-in-sets-of-k-consecutive-numbers/"
   },
   "1297": {
+    "id": 1297,
     "category": "Sliding Window",
+    "title": "Maximum Number of Occurrences of a Substring",
     "difficulty": "Medium",
-    "id": 1297,
-    "link": "https://leetcode.com/problems/maximum-number-of-occurrences-of-a-substring/",
-    "title": "Maximum Number of Occurrences of a Substring"
+    "link": "https://leetcode.com/problems/maximum-number-of-occurrences-of-a-substring/"
   },
   "1298": {
+    "id": 1298,
     "category": "Graph Traversal",
+    "title": "Maximum Candies You Can Get from Boxes",
     "difficulty": "Hard",
-    "id": 1298,
-    "link": "https://leetcode.com/problems/maximum-candies-you-can-get-from-boxes/",
-    "title": "Maximum Candies You Can Get from Boxes"
+    "link": "https://leetcode.com/problems/maximum-candies-you-can-get-from-boxes/"
   },
   "1299": {
+    "id": 1299,
     "category": "Array & Hashing",
+    "title": "Replace Elements with Greatest Element on Right Side",
     "difficulty": "Easy",
-    "id": 1299,
-    "link": "https://leetcode.com/problems/replace-elements-with-greatest-element-on-right-side/",
-    "title": "Replace Elements with Greatest Element on Right Side"
+    "link": "https://leetcode.com/problems/replace-elements-with-greatest-element-on-right-side/"
   },
   "1300": {
+    "id": 1300,
     "category": "Binary Search",
+    "title": "Sum of Mutated Array Closest to Target",
     "difficulty": "Medium",
-    "id": 1300,
-    "link": "https://leetcode.com/problems/sum-of-mutated-array-closest-to-target/",
-    "title": "Sum of Mutated Array Closest to Target"
+    "link": "https://leetcode.com/problems/sum-of-mutated-array-closest-to-target/"
   },
   "1301": {
+    "id": 1301,
     "category": "Dynamic Programming",
+    "title": "Number of Paths with Max Score",
     "difficulty": "Hard",
-    "id": 1301,
-    "link": "https://leetcode.com/problems/number-of-paths-with-max-score/",
-    "title": "Number of Paths with Max Score"
+    "link": "https://leetcode.com/problems/number-of-paths-with-max-score/"
   },
   "1302": {
+    "id": 1302,
     "category": "Tree",
+    "title": "Deepest Leaves Sum",
     "difficulty": "Medium",
-    "id": 1302,
-    "link": "https://leetcode.com/problems/deepest-leaves-sum/",
-    "title": "Deepest Leaves Sum"
+    "link": "https://leetcode.com/problems/deepest-leaves-sum/"
   },
   "1303": {
+    "id": 1303,
     "category": "Database",
+    "title": "Find the Team Size",
     "difficulty": "Easy",
-    "id": 1303,
-    "link": "https://leetcode.com/problems/find-the-team-size/",
-    "title": "Find the Team Size"
+    "link": "https://leetcode.com/problems/find-the-team-size/"
   },
   "1304": {
+    "id": 1304,
     "category": "Math & Geometry",
+    "title": "Find N Unique Integers Sum up to Zero",
     "difficulty": "Easy",
-    "id": 1304,
-    "link": "https://leetcode.com/problems/find-n-unique-integers-sum-up-to-zero/",
-    "title": "Find N Unique Integers Sum up to Zero"
+    "link": "https://leetcode.com/problems/find-n-unique-integers-sum-up-to-zero/"
   },
   "1305": {
+    "id": 1305,
     "category": "Tree",
+    "title": "All Elements in Two Binary Search Trees",
     "difficulty": "Medium",
-    "id": 1305,
-    "link": "https://leetcode.com/problems/all-elements-in-two-binary-search-trees/",
-    "title": "All Elements in Two Binary Search Trees"
+    "link": "https://leetcode.com/problems/all-elements-in-two-binary-search-trees/"
   },
   "1306": {
+    "id": 1306,
     "category": "Graph Traversal",
+    "title": "Jump Game III",
     "difficulty": "Medium",
-    "id": 1306,
-    "link": "https://leetcode.com/problems/jump-game-iii/",
-    "title": "Jump Game III"
+    "link": "https://leetcode.com/problems/jump-game-iii/"
   },
   "1307": {
+    "id": 1307,
     "category": "Backtracking",
+    "title": "Verbal Arithmetic Puzzle",
     "difficulty": "Hard",
-    "id": 1307,
-    "link": "https://leetcode.com/problems/verbal-arithmetic-puzzle/",
-    "title": "Verbal Arithmetic Puzzle"
+    "link": "https://leetcode.com/problems/verbal-arithmetic-puzzle/"
   },
   "1308": {
+    "id": 1308,
     "category": "Database",
+    "title": "Running Total for Different Genders",
     "difficulty": "Medium",
-    "id": 1308,
-    "link": "https://leetcode.com/problems/running-total-for-different-genders/",
-    "title": "Running Total for Different Genders"
+    "link": "https://leetcode.com/problems/running-total-for-different-genders/"
   },
   "1309": {
+    "id": 1309,
     "category": "Array & Hashing",
+    "title": "Decrypt String from Alphabet to Integer Mapping",
     "difficulty": "Easy",
-    "id": 1309,
-    "link": "https://leetcode.com/problems/decrypt-string-from-alphabet-to-integer-mapping/",
-    "title": "Decrypt String from Alphabet to Integer Mapping"
+    "link": "https://leetcode.com/problems/decrypt-string-from-alphabet-to-integer-mapping/"
   },
   "1310": {
+    "id": 1310,
     "category": "Bit Manipulation",
+    "title": "XOR Queries of a Subarray",
     "difficulty": "Medium",
-    "id": 1310,
-    "link": "https://leetcode.com/problems/xor-queries-of-a-subarray/",
-    "title": "XOR Queries of a Subarray"
+    "link": "https://leetcode.com/problems/xor-queries-of-a-subarray/"
   },
   "1311": {
+    "id": 1311,
     "category": "Graph Traversal",
+    "title": "Get Watched Videos by Your Friends",
     "difficulty": "Medium",
-    "id": 1311,
-    "link": "https://leetcode.com/problems/get-watched-videos-by-your-friends/",
-    "title": "Get Watched Videos by Your Friends"
+    "link": "https://leetcode.com/problems/get-watched-videos-by-your-friends/"
   },
   "1312": {
+    "id": 1312,
     "category": "Dynamic Programming",
+    "title": "Minimum Insertion Steps to Make a String Palindrome",
     "difficulty": "Hard",
-    "id": 1312,
-    "link": "https://leetcode.com/problems/minimum-insertion-steps-to-make-a-string-palindrome/",
-    "title": "Minimum Insertion Steps to Make a String Palindrome"
+    "link": "https://leetcode.com/problems/minimum-insertion-steps-to-make-a-string-palindrome/"
   },
   "1313": {
+    "id": 1313,
     "category": "Array & Hashing",
+    "title": "Decompress Run-Length Encoded List",
     "difficulty": "Easy",
-    "id": 1313,
-    "link": "https://leetcode.com/problems/decompress-run-length-encoded-list/",
-    "title": "Decompress Run-Length Encoded List"
+    "link": "https://leetcode.com/problems/decompress-run-length-encoded-list/"
   },
   "1314": {
+    "id": 1314,
     "category": "Array & Hashing",
+    "title": "Matrix Block Sum",
     "difficulty": "Medium",
-    "id": 1314,
-    "link": "https://leetcode.com/problems/matrix-block-sum/",
-    "title": "Matrix Block Sum"
+    "link": "https://leetcode.com/problems/matrix-block-sum/"
   },
   "1315": {
+    "id": 1315,
     "category": "Tree",
+    "title": "Sum of Nodes with Even-Valued Grandparent",
     "difficulty": "Medium",
-    "id": 1315,
-    "link": "https://leetcode.com/problems/sum-of-nodes-with-even-valued-grandparent/",
-    "title": "Sum of Nodes with Even-Valued Grandparent"
+    "link": "https://leetcode.com/problems/sum-of-nodes-with-even-valued-grandparent/"
   },
   "1316": {
+    "id": 1316,
     "category": "Trie",
+    "title": "Distinct Echo Substrings",
     "difficulty": "Hard",
-    "id": 1316,
-    "link": "https://leetcode.com/problems/distinct-echo-substrings/",
-    "title": "Distinct Echo Substrings"
+    "link": "https://leetcode.com/problems/distinct-echo-substrings/"
   },
   "1317": {
+    "id": 1317,
     "category": "Math & Geometry",
+    "title": "Convert Integer to the Sum of Two No-Zero Integers",
     "difficulty": "Easy",
-    "id": 1317,
-    "link": "https://leetcode.com/problems/convert-integer-to-the-sum-of-two-no-zero-integers/",
-    "title": "Convert Integer to the Sum of Two No-Zero Integers"
+    "link": "https://leetcode.com/problems/convert-integer-to-the-sum-of-two-no-zero-integers/"
   },
   "1318": {
+    "id": 1318,
     "category": "Bit Manipulation",
+    "title": "Minimum Flips to Make a OR b Equal to c",
     "difficulty": "Medium",
-    "id": 1318,
-    "link": "https://leetcode.com/problems/minimum-flips-to-make-a-or-b-equal-to-c/",
-    "title": "Minimum Flips to Make a OR b Equal to c"
+    "link": "https://leetcode.com/problems/minimum-flips-to-make-a-or-b-equal-to-c/"
   },
   "1319": {
+    "id": 1319,
     "category": "Graph Traversal",
+    "title": "Number of Operations to Make Network Connected",
     "difficulty": "Medium",
-    "id": 1319,
-    "link": "https://leetcode.com/problems/number-of-operations-to-make-network-connected/",
-    "title": "Number of Operations to Make Network Connected"
+    "link": "https://leetcode.com/problems/number-of-operations-to-make-network-connected/"
   },
   "1320": {
+    "id": 1320,
     "category": "Dynamic Programming",
+    "title": "Minimum Distance to Type a Word Using Two Fingers",
     "difficulty": "Hard",
-    "id": 1320,
-    "link": "https://leetcode.com/problems/minimum-distance-to-type-a-word-using-two-fingers/",
-    "title": "Minimum Distance to Type a Word Using Two Fingers"
+    "link": "https://leetcode.com/problems/minimum-distance-to-type-a-word-using-two-fingers/"
   },
   "1321": {
+    "id": 1321,
     "category": "Database",
+    "title": "Restaurant Growth",
     "difficulty": "Medium",
-    "id": 1321,
-    "link": "https://leetcode.com/problems/restaurant-growth/",
-    "title": "Restaurant Growth"
+    "link": "https://leetcode.com/problems/restaurant-growth/"
   },
   "1322": {
+    "id": 1322,
     "category": "Database",
+    "title": "Ads Performance",
     "difficulty": "Easy",
-    "id": 1322,
-    "link": "https://leetcode.com/problems/ads-performance/",
-    "title": "Ads Performance"
+    "link": "https://leetcode.com/problems/ads-performance/"
   },
   "1323": {
+    "id": 1323,
     "category": "Greedy",
+    "title": "Maximum 69 Number",
     "difficulty": "Easy",
-    "id": 1323,
-    "link": "https://leetcode.com/problems/maximum-69-number/",
-    "title": "Maximum 69 Number"
+    "link": "https://leetcode.com/problems/maximum-69-number/"
   },
   "1324": {
+    "id": 1324,
     "category": "Array & Hashing",
+    "title": "Print Words Vertically",
     "difficulty": "Medium",
-    "id": 1324,
-    "link": "https://leetcode.com/problems/print-words-vertically/",
-    "title": "Print Words Vertically"
+    "link": "https://leetcode.com/problems/print-words-vertically/"
   },
   "1325": {
+    "id": 1325,
     "category": "Tree",
+    "title": "Delete Leaves With a Given Value",
     "difficulty": "Medium",
-    "id": 1325,
-    "link": "https://leetcode.com/problems/delete-leaves-with-a-given-value/",
-    "title": "Delete Leaves With a Given Value"
+    "link": "https://leetcode.com/problems/delete-leaves-with-a-given-value/"
   },
   "1326": {
+    "id": 1326,
     "category": "Dynamic Programming",
+    "title": "Minimum Number of Taps to Open to Water a Garden",
     "difficulty": "Hard",
-    "id": 1326,
-    "link": "https://leetcode.com/problems/minimum-number-of-taps-to-open-to-water-a-garden/",
-    "title": "Minimum Number of Taps to Open to Water a Garden"
+    "link": "https://leetcode.com/problems/minimum-number-of-taps-to-open-to-water-a-garden/"
   },
   "1327": {
+    "id": 1327,
     "category": "Database",
+    "title": "List the Products Ordered in a Period",
     "difficulty": "Easy",
-    "id": 1327,
-    "link": "https://leetcode.com/problems/list-the-products-ordered-in-a-period/",
-    "title": "List the Products Ordered in a Period"
+    "link": "https://leetcode.com/problems/list-the-products-ordered-in-a-period/"
   },
   "1328": {
+    "id": 1328,
     "category": "Greedy",
+    "title": "Break a Palindrome",
     "difficulty": "Medium",
-    "id": 1328,
-    "link": "https://leetcode.com/problems/break-a-palindrome/",
-    "title": "Break a Palindrome"
+    "link": "https://leetcode.com/problems/break-a-palindrome/"
   },
   "1329": {
+    "id": 1329,
     "category": "Array & Hashing",
+    "title": "Sort the Matrix Diagonally",
     "difficulty": "Medium",
-    "id": 1329,
-    "link": "https://leetcode.com/problems/sort-the-matrix-diagonally/",
-    "title": "Sort the Matrix Diagonally"
+    "link": "https://leetcode.com/problems/sort-the-matrix-diagonally/"
   },
   "1330": {
+    "id": 1330,
     "category": "Greedy",
+    "title": "Reverse Subarray To Maximize Array Value",
     "difficulty": "Hard",
-    "id": 1330,
-    "link": "https://leetcode.com/problems/reverse-subarray-to-maximize-array-value/",
-    "title": "Reverse Subarray To Maximize Array Value"
+    "link": "https://leetcode.com/problems/reverse-subarray-to-maximize-array-value/"
   },
   "1331": {
+    "id": 1331,
     "category": "Array & Hashing",
+    "title": "Rank Transform of an Array",
     "difficulty": "Easy",
-    "id": 1331,
-    "link": "https://leetcode.com/problems/rank-transform-of-an-array/",
-    "title": "Rank Transform of an Array"
+    "link": "https://leetcode.com/problems/rank-transform-of-an-array/"
   },
   "1332": {
+    "id": 1332,
     "category": "Two Pointers",
+    "title": "Remove Palindromic Subsequences",
     "difficulty": "Easy",
-    "id": 1332,
-    "link": "https://leetcode.com/problems/remove-palindromic-subsequences/",
-    "title": "Remove Palindromic Subsequences"
+    "link": "https://leetcode.com/problems/remove-palindromic-subsequences/"
   },
   "1333": {
+    "id": 1333,
     "category": "Array & Hashing",
+    "title": "Filter Restaurants by Vegan-Friendly, Price and Distance",
     "difficulty": "Medium",
-    "id": 1333,
-    "link": "https://leetcode.com/problems/filter-restaurants-by-vegan-friendly-price-and-distance/",
-    "title": "Filter Restaurants by Vegan-Friendly, Price and Distance"
+    "link": "https://leetcode.com/problems/filter-restaurants-by-vegan-friendly-price-and-distance/"
   },
   "1334": {
+    "id": 1334,
     "category": "Graph Traversal",
+    "title": "Find the City With the Smallest Number of Neighbors at a Threshold Distance",
     "difficulty": "Medium",
-    "id": 1334,
-    "link": "https://leetcode.com/problems/find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance/",
-    "title": "Find the City With the Smallest Number of Neighbors at a Threshold Distance"
+    "link": "https://leetcode.com/problems/find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance/"
   },
   "1335": {
+    "id": 1335,
     "category": "Dynamic Programming",
+    "title": "Minimum Difficulty of a Job Schedule",
     "difficulty": "Hard",
-    "id": 1335,
-    "link": "https://leetcode.com/problems/minimum-difficulty-of-a-job-schedule/",
-    "title": "Minimum Difficulty of a Job Schedule"
+    "link": "https://leetcode.com/problems/minimum-difficulty-of-a-job-schedule/"
   },
   "1336": {
+    "id": 1336,
     "category": "Database",
+    "title": "Number of Transactions per Visit",
     "difficulty": "Hard",
-    "id": 1336,
-    "link": "https://leetcode.com/problems/number-of-transactions-per-visit/",
-    "title": "Number of Transactions per Visit"
+    "link": "https://leetcode.com/problems/number-of-transactions-per-visit/"
   },
   "1337": {
+    "id": 1337,
     "category": "Binary Search",
+    "title": "The K Weakest Rows in a Matrix",
     "difficulty": "Easy",
-    "id": 1337,
-    "link": "https://leetcode.com/problems/the-k-weakest-rows-in-a-matrix/",
-    "title": "The K Weakest Rows in a Matrix"
+    "link": "https://leetcode.com/problems/the-k-weakest-rows-in-a-matrix/"
   },
   "1338": {
+    "id": 1338,
     "category": "Heap (Priority Queue)",
+    "title": "Reduce Array Size to The Half",
     "difficulty": "Medium",
-    "id": 1338,
-    "link": "https://leetcode.com/problems/reduce-array-size-to-the-half/",
-    "title": "Reduce Array Size to The Half"
+    "link": "https://leetcode.com/problems/reduce-array-size-to-the-half/"
   },
   "1339": {
+    "id": 1339,
     "category": "Tree",
+    "title": "Maximum Product of Splitted Binary Tree",
     "difficulty": "Medium",
-    "id": 1339,
-    "link": "https://leetcode.com/problems/maximum-product-of-splitted-binary-tree/",
-    "title": "Maximum Product of Splitted Binary Tree"
+    "link": "https://leetcode.com/problems/maximum-product-of-splitted-binary-tree/"
   },
   "1340": {
+    "id": 1340,
     "category": "Dynamic Programming",
+    "title": "Jump Game V",
     "difficulty": "Hard",
-    "id": 1340,
-    "link": "https://leetcode.com/problems/jump-game-v/",
-    "title": "Jump Game V"
+    "link": "https://leetcode.com/problems/jump-game-v/"
   },
   "1341": {
+    "id": 1341,
     "category": "Database",
+    "title": "Movie Rating",
     "difficulty": "Medium",
-    "id": 1341,
-    "link": "https://leetcode.com/problems/movie-rating/",
-    "title": "Movie Rating"
+    "link": "https://leetcode.com/problems/movie-rating/"
   },
   "1342": {
+    "id": 1342,
     "category": "Bit Manipulation",
+    "title": "Number of Steps to Reduce a Number to Zero",
     "difficulty": "Easy",
-    "id": 1342,
-    "link": "https://leetcode.com/problems/number-of-steps-to-reduce-a-number-to-zero/",
-    "title": "Number of Steps to Reduce a Number to Zero"
+    "link": "https://leetcode.com/problems/number-of-steps-to-reduce-a-number-to-zero/"
   },
   "1343": {
+    "id": 1343,
     "category": "Sliding Window",
+    "title": "Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold",
     "difficulty": "Medium",
-    "id": 1343,
-    "link": "https://leetcode.com/problems/number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold/",
-    "title": "Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold"
+    "link": "https://leetcode.com/problems/number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold/"
   },
   "1344": {
+    "id": 1344,
     "category": "Math & Geometry",
+    "title": "Angle Between Hands of a Clock",
     "difficulty": "Medium",
-    "id": 1344,
-    "link": "https://leetcode.com/problems/angle-between-hands-of-a-clock/",
-    "title": "Angle Between Hands of a Clock"
+    "link": "https://leetcode.com/problems/angle-between-hands-of-a-clock/"
   },
   "1345": {
+    "id": 1345,
     "category": "Graph Traversal",
+    "title": "Jump Game IV",
     "difficulty": "Hard",
-    "id": 1345,
-    "link": "https://leetcode.com/problems/jump-game-iv/",
-    "title": "Jump Game IV"
+    "link": "https://leetcode.com/problems/jump-game-iv/"
   },
   "1346": {
+    "id": 1346,
     "category": "Binary Search",
+    "title": "Check If N and Its Double Exist",
     "difficulty": "Easy",
-    "id": 1346,
-    "link": "https://leetcode.com/problems/check-if-n-and-its-double-exist/",
-    "title": "Check If N and Its Double Exist"
+    "link": "https://leetcode.com/problems/check-if-n-and-its-double-exist/"
   },
   "1347": {
+    "id": 1347,
     "category": "Array & Hashing",
+    "title": "Minimum Number of Steps to Make Two Strings Anagram",
     "difficulty": "Medium",
-    "id": 1347,
-    "link": "https://leetcode.com/problems/minimum-number-of-steps-to-make-two-strings-anagram/",
-    "title": "Minimum Number of Steps to Make Two Strings Anagram"
+    "link": "https://leetcode.com/problems/minimum-number-of-steps-to-make-two-strings-anagram/"
   },
   "1348": {
+    "id": 1348,
     "category": "Binary Search",
+    "title": "Tweet Counts Per Frequency",
     "difficulty": "Medium",
-    "id": 1348,
-    "link": "https://leetcode.com/problems/tweet-counts-per-frequency/",
-    "title": "Tweet Counts Per Frequency"
+    "link": "https://leetcode.com/problems/tweet-counts-per-frequency/"
   },
   "1349": {
+    "id": 1349,
     "category": "Dynamic Programming",
+    "title": "Maximum Students Taking Exam",
     "difficulty": "Hard",
-    "id": 1349,
-    "link": "https://leetcode.com/problems/maximum-students-taking-exam/",
-    "title": "Maximum Students Taking Exam"
+    "link": "https://leetcode.com/problems/maximum-students-taking-exam/"
   },
   "1350": {
+    "id": 1350,
     "category": "Database",
+    "title": "Students With Invalid Departments",
     "difficulty": "Easy",
-    "id": 1350,
-    "link": "https://leetcode.com/problems/students-with-invalid-departments/",
-    "title": "Students With Invalid Departments"
+    "link": "https://leetcode.com/problems/students-with-invalid-departments/"
   },
   "1351": {
+    "id": 1351,
     "category": "Binary Search",
+    "title": "Count Negative Numbers in a Sorted Matrix",
     "difficulty": "Easy",
-    "id": 1351,
-    "link": "https://leetcode.com/problems/count-negative-numbers-in-a-sorted-matrix/",
-    "title": "Count Negative Numbers in a Sorted Matrix"
+    "link": "https://leetcode.com/problems/count-negative-numbers-in-a-sorted-matrix/"
   },
   "1352": {
+    "id": 1352,
     "category": "Math & Geometry",
+    "title": "Product of the Last K Numbers",
     "difficulty": "Medium",
-    "id": 1352,
-    "link": "https://leetcode.com/problems/product-of-the-last-k-numbers/",
-    "title": "Product of the Last K Numbers"
+    "link": "https://leetcode.com/problems/product-of-the-last-k-numbers/"
   },
   "1353": {
+    "id": 1353,
     "category": "Heap (Priority Queue)",
+    "title": "Maximum Number of Events That Can Be Attended",
     "difficulty": "Medium",
-    "id": 1353,
-    "link": "https://leetcode.com/problems/maximum-number-of-events-that-can-be-attended/",
-    "title": "Maximum Number of Events That Can Be Attended"
+    "link": "https://leetcode.com/problems/maximum-number-of-events-that-can-be-attended/"
   },
   "1354": {
+    "id": 1354,
     "category": "Heap (Priority Queue)",
+    "title": "Construct Target Array With Multiple Sums",
     "difficulty": "Hard",
-    "id": 1354,
-    "link": "https://leetcode.com/problems/construct-target-array-with-multiple-sums/",
-    "title": "Construct Target Array With Multiple Sums"
+    "link": "https://leetcode.com/problems/construct-target-array-with-multiple-sums/"
   },
   "1355": {
+    "id": 1355,
     "category": "Database",
+    "title": "Activity Participants",
     "difficulty": "Medium",
-    "id": 1355,
-    "link": "https://leetcode.com/problems/activity-participants/",
-    "title": "Activity Participants"
+    "link": "https://leetcode.com/problems/activity-participants/"
   },
   "1356": {
+    "id": 1356,
     "category": "Bit Manipulation",
+    "title": "Sort Integers by The Number of 1 Bits",
     "difficulty": "Easy",
-    "id": 1356,
-    "link": "https://leetcode.com/problems/sort-integers-by-the-number-of-1-bits/",
-    "title": "Sort Integers by The Number of 1 Bits"
+    "link": "https://leetcode.com/problems/sort-integers-by-the-number-of-1-bits/"
   },
   "1357": {
+    "id": 1357,
     "category": "Array & Hashing",
+    "title": "Apply Discount Every n Orders",
     "difficulty": "Medium",
-    "id": 1357,
-    "link": "https://leetcode.com/problems/apply-discount-every-n-orders/",
-    "title": "Apply Discount Every n Orders"
+    "link": "https://leetcode.com/problems/apply-discount-every-n-orders/"
   },
   "1358": {
+    "id": 1358,
     "category": "Sliding Window",
+    "title": "Number of Substrings Containing All Three Characters",
     "difficulty": "Medium",
-    "id": 1358,
-    "link": "https://leetcode.com/problems/number-of-substrings-containing-all-three-characters/",
-    "title": "Number of Substrings Containing All Three Characters"
+    "link": "https://leetcode.com/problems/number-of-substrings-containing-all-three-characters/"
   },
   "1359": {
+    "id": 1359,
     "category": "Dynamic Programming",
+    "title": "Count All Valid Pickup and Delivery Options",
     "difficulty": "Hard",
-    "id": 1359,
-    "link": "https://leetcode.com/problems/count-all-valid-pickup-and-delivery-options/",
-    "title": "Count All Valid Pickup and Delivery Options"
+    "link": "https://leetcode.com/problems/count-all-valid-pickup-and-delivery-options/"
   },
   "1360": {
+    "id": 1360,
     "category": "Math & Geometry",
+    "title": "Number of Days Between Two Dates",
     "difficulty": "Easy",
-    "id": 1360,
-    "link": "https://leetcode.com/problems/number-of-days-between-two-dates/",
-    "title": "Number of Days Between Two Dates"
+    "link": "https://leetcode.com/problems/number-of-days-between-two-dates/"
   },
   "1361": {
+    "id": 1361,
     "category": "Tree",
+    "title": "Validate Binary Tree Nodes",
     "difficulty": "Medium",
-    "id": 1361,
-    "link": "https://leetcode.com/problems/validate-binary-tree-nodes/",
-    "title": "Validate Binary Tree Nodes"
+    "link": "https://leetcode.com/problems/validate-binary-tree-nodes/"
   },
   "1362": {
+    "id": 1362,
     "category": "Math & Geometry",
+    "title": "Closest Divisors",
     "difficulty": "Medium",
-    "id": 1362,
-    "link": "https://leetcode.com/problems/closest-divisors/",
-    "title": "Closest Divisors"
+    "link": "https://leetcode.com/problems/closest-divisors/"
   },
   "1363": {
+    "id": 1363,
     "category": "Dynamic Programming",
+    "title": "Largest Multiple of Three",
     "difficulty": "Hard",
-    "id": 1363,
-    "link": "https://leetcode.com/problems/largest-multiple-of-three/",
-    "title": "Largest Multiple of Three"
+    "link": "https://leetcode.com/problems/largest-multiple-of-three/"
   },
   "1364": {
+    "id": 1364,
     "category": "Database",
+    "title": "Number of Trusted Contacts of a Customer",
     "difficulty": "Medium",
-    "id": 1364,
-    "link": "https://leetcode.com/problems/number-of-trusted-contacts-of-a-customer/",
-    "title": "Number of Trusted Contacts of a Customer"
+    "link": "https://leetcode.com/problems/number-of-trusted-contacts-of-a-customer/"
   },
   "1365": {
+    "id": 1365,
     "category": "Array & Hashing",
+    "title": "How Many Numbers Are Smaller Than the Current Number",
     "difficulty": "Easy",
-    "id": 1365,
-    "link": "https://leetcode.com/problems/how-many-numbers-are-smaller-than-the-current-number/",
-    "title": "How Many Numbers Are Smaller Than the Current Number"
+    "link": "https://leetcode.com/problems/how-many-numbers-are-smaller-than-the-current-number/"
   },
   "1366": {
+    "id": 1366,
     "category": "Array & Hashing",
+    "title": "Rank Teams by Votes",
     "difficulty": "Medium",
-    "id": 1366,
-    "link": "https://leetcode.com/problems/rank-teams-by-votes/",
-    "title": "Rank Teams by Votes"
+    "link": "https://leetcode.com/problems/rank-teams-by-votes/"
   },
   "1367": {
+    "id": 1367,
     "category": "Tree",
+    "title": "Linked List in Binary Tree",
     "difficulty": "Medium",
-    "id": 1367,
-    "link": "https://leetcode.com/problems/linked-list-in-binary-tree/",
-    "title": "Linked List in Binary Tree"
+    "link": "https://leetcode.com/problems/linked-list-in-binary-tree/"
   },
   "1368": {
+    "id": 1368,
     "category": "Graph Traversal",
+    "title": "Minimum Cost to Make at Least One Valid Path in a Grid",
     "difficulty": "Hard",
-    "id": 1368,
-    "link": "https://leetcode.com/problems/minimum-cost-to-make-at-least-one-valid-path-in-a-grid/",
-    "title": "Minimum Cost to Make at Least One Valid Path in a Grid"
+    "link": "https://leetcode.com/problems/minimum-cost-to-make-at-least-one-valid-path-in-a-grid/"
   },
   "1369": {
+    "id": 1369,
     "category": "Database",
+    "title": "Get the Second Most Recent Activity",
     "difficulty": "Hard",
-    "id": 1369,
-    "link": "https://leetcode.com/problems/get-the-second-most-recent-activity/",
-    "title": "Get the Second Most Recent Activity"
+    "link": "https://leetcode.com/problems/get-the-second-most-recent-activity/"
   },
   "1370": {
+    "id": 1370,
     "category": "Array & Hashing",
+    "title": "Increasing Decreasing String",
     "difficulty": "Easy",
-    "id": 1370,
-    "link": "https://leetcode.com/problems/increasing-decreasing-string/",
-    "title": "Increasing Decreasing String"
+    "link": "https://leetcode.com/problems/increasing-decreasing-string/"
   },
   "1371": {
+    "id": 1371,
     "category": "Bit Manipulation",
+    "title": "Find the Longest Substring Containing Vowels in Even Counts",
     "difficulty": "Medium",
-    "id": 1371,
-    "link": "https://leetcode.com/problems/find-the-longest-substring-containing-vowels-in-even-counts/",
-    "title": "Find the Longest Substring Containing Vowels in Even Counts"
+    "link": "https://leetcode.com/problems/find-the-longest-substring-containing-vowels-in-even-counts/"
   },
   "1372": {
+    "id": 1372,
     "category": "Tree",
+    "title": "Longest ZigZag Path in a Binary Tree",
     "difficulty": "Medium",
-    "id": 1372,
-    "link": "https://leetcode.com/problems/longest-zigzag-path-in-a-binary-tree/",
-    "title": "Longest ZigZag Path in a Binary Tree"
+    "link": "https://leetcode.com/problems/longest-zigzag-path-in-a-binary-tree/"
   },
   "1373": {
+    "id": 1373,
     "category": "Tree",
+    "title": "Maximum Sum BST in Binary Tree",
     "difficulty": "Hard",
-    "id": 1373,
-    "link": "https://leetcode.com/problems/maximum-sum-bst-in-binary-tree/",
-    "title": "Maximum Sum BST in Binary Tree"
+    "link": "https://leetcode.com/problems/maximum-sum-bst-in-binary-tree/"
   },
   "1374": {
+    "id": 1374,
     "category": "Array & Hashing",
+    "title": "Generate a String With Characters That Have Odd Counts",
     "difficulty": "Easy",
-    "id": 1374,
-    "link": "https://leetcode.com/problems/generate-a-string-with-characters-that-have-odd-counts/",
-    "title": "Generate a String With Characters That Have Odd Counts"
+    "link": "https://leetcode.com/problems/generate-a-string-with-characters-that-have-odd-counts/"
   },
   "1375": {
+    "id": 1375,
     "category": "Array & Hashing",
+    "title": "Number of Times Binary String Is Prefix-Aligned",
     "difficulty": "Medium",
-    "id": 1375,
-    "link": "https://leetcode.com/problems/number-of-times-binary-string-is-prefix-aligned/",
-    "title": "Number of Times Binary String Is Prefix-Aligned"
+    "link": "https://leetcode.com/problems/number-of-times-binary-string-is-prefix-aligned/"
   },
   "1376": {
+    "id": 1376,
     "category": "Tree",
+    "title": "Time Needed to Inform All Employees",
     "difficulty": "Medium",
-    "id": 1376,
-    "link": "https://leetcode.com/problems/time-needed-to-inform-all-employees/",
-    "title": "Time Needed to Inform All Employees"
+    "link": "https://leetcode.com/problems/time-needed-to-inform-all-employees/"
   },
   "1377": {
+    "id": 1377,
     "category": "Tree",
+    "title": "Frog Position After T Seconds",
     "difficulty": "Hard",
-    "id": 1377,
-    "link": "https://leetcode.com/problems/frog-position-after-t-seconds/",
-    "title": "Frog Position After T Seconds"
+    "link": "https://leetcode.com/problems/frog-position-after-t-seconds/"
   },
   "1378": {
+    "id": 1378,
     "category": "Database",
+    "title": "Replace Employee ID With The Unique Identifier",
     "difficulty": "Easy",
-    "id": 1378,
-    "link": "https://leetcode.com/problems/replace-employee-id-with-the-unique-identifier/",
-    "title": "Replace Employee ID With The Unique Identifier"
+    "link": "https://leetcode.com/problems/replace-employee-id-with-the-unique-identifier/"
   },
   "1379": {
+    "id": 1379,
     "category": "Tree",
+    "title": "Find a Corresponding Node of a Binary Tree in a Clone of That Tree",
     "difficulty": "Easy",
-    "id": 1379,
-    "link": "https://leetcode.com/problems/find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree/",
-    "title": "Find a Corresponding Node of a Binary Tree in a Clone of That Tree"
+    "link": "https://leetcode.com/problems/find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree/"
   },
   "1380": {
+    "id": 1380,
     "category": "Array & Hashing",
+    "title": "Lucky Numbers in a Matrix",
     "difficulty": "Easy",
-    "id": 1380,
-    "link": "https://leetcode.com/problems/lucky-numbers-in-a-matrix/",
-    "title": "Lucky Numbers in a Matrix"
+    "link": "https://leetcode.com/problems/lucky-numbers-in-a-matrix/"
   },
   "1381": {
+    "id": 1381,
     "category": "Stack",
+    "title": "Design a Stack With Increment Operation",
     "difficulty": "Medium",
-    "id": 1381,
-    "link": "https://leetcode.com/problems/design-a-stack-with-increment-operation/",
-    "title": "Design a Stack With Increment Operation"
+    "link": "https://leetcode.com/problems/design-a-stack-with-increment-operation/"
   },
   "1382": {
+    "id": 1382,
     "category": "Tree",
+    "title": "Balance a Binary Search Tree",
     "difficulty": "Medium",
-    "id": 1382,
-    "link": "https://leetcode.com/problems/balance-a-binary-search-tree/",
-    "title": "Balance a Binary Search Tree"
+    "link": "https://leetcode.com/problems/balance-a-binary-search-tree/"
   },
   "1383": {
+    "id": 1383,
     "category": "Heap (Priority Queue)",
+    "title": "Maximum Performance of a Team",
     "difficulty": "Hard",
-    "id": 1383,
-    "link": "https://leetcode.com/problems/maximum-performance-of-a-team/",
-    "title": "Maximum Performance of a Team"
+    "link": "https://leetcode.com/problems/maximum-performance-of-a-team/"
   },
   "1384": {
+    "id": 1384,
     "category": "Database",
+    "title": "Total Sales Amount by Year",
     "difficulty": "Hard",
-    "id": 1384,
-    "link": "https://leetcode.com/problems/total-sales-amount-by-year/",
-    "title": "Total Sales Amount by Year"
+    "link": "https://leetcode.com/problems/total-sales-amount-by-year/"
   },
   "1385": {
+    "id": 1385,
     "category": "Binary Search",
+    "title": "Find the Distance Value Between Two Arrays",
     "difficulty": "Easy",
-    "id": 1385,
-    "link": "https://leetcode.com/problems/find-the-distance-value-between-two-arrays/",
-    "title": "Find the Distance Value Between Two Arrays"
+    "link": "https://leetcode.com/problems/find-the-distance-value-between-two-arrays/"
   },
   "1386": {
+    "id": 1386,
     "category": "Bit Manipulation",
+    "title": "Cinema Seat Allocation",
     "difficulty": "Medium",
-    "id": 1386,
-    "link": "https://leetcode.com/problems/cinema-seat-allocation/",
-    "title": "Cinema Seat Allocation"
+    "link": "https://leetcode.com/problems/cinema-seat-allocation/"
   },
   "1387": {
+    "id": 1387,
     "category": "Dynamic Programming",
+    "title": "Sort Integers by The Power Value",
     "difficulty": "Medium",
-    "id": 1387,
-    "link": "https://leetcode.com/problems/sort-integers-by-the-power-value/",
-    "title": "Sort Integers by The Power Value"
+    "link": "https://leetcode.com/problems/sort-integers-by-the-power-value/"
   },
   "1388": {
+    "id": 1388,
     "category": "Dynamic Programming",
+    "title": "Pizza With 3n Slices",
     "difficulty": "Hard",
-    "id": 1388,
-    "link": "https://leetcode.com/problems/pizza-with-3n-slices/",
-    "title": "Pizza With 3n Slices"
+    "link": "https://leetcode.com/problems/pizza-with-3n-slices/"
   },
   "1389": {
+    "id": 1389,
     "category": "Array & Hashing",
+    "title": "Create Target Array in the Given Order",
     "difficulty": "Easy",
-    "id": 1389,
-    "link": "https://leetcode.com/problems/create-target-array-in-the-given-order/",
-    "title": "Create Target Array in the Given Order"
+    "link": "https://leetcode.com/problems/create-target-array-in-the-given-order/"
   },
   "1390": {
+    "id": 1390,
     "category": "Math & Geometry",
+    "title": "Four Divisors",
     "difficulty": "Medium",
-    "id": 1390,
-    "link": "https://leetcode.com/problems/four-divisors/",
-    "title": "Four Divisors"
+    "link": "https://leetcode.com/problems/four-divisors/"
   },
   "1391": {
+    "id": 1391,
     "category": "Graph Traversal",
+    "title": "Check if There is a Valid Path in a Grid",
     "difficulty": "Medium",
-    "id": 1391,
-    "link": "https://leetcode.com/problems/check-if-there-is-a-valid-path-in-a-grid/",
-    "title": "Check if There is a Valid Path in a Grid"
+    "link": "https://leetcode.com/problems/check-if-there-is-a-valid-path-in-a-grid/"
   },
   "1392": {
+    "id": 1392,
     "category": "Array & Hashing",
+    "title": "Longest Happy Prefix",
     "difficulty": "Hard",
-    "id": 1392,
-    "link": "https://leetcode.com/problems/longest-happy-prefix/",
-    "title": "Longest Happy Prefix"
+    "link": "https://leetcode.com/problems/longest-happy-prefix/"
   },
   "1393": {
+    "id": 1393,
     "category": "Database",
+    "title": "Capital Gain/Loss",
     "difficulty": "Medium",
-    "id": 1393,
-    "link": "https://leetcode.com/problems/capital-gainloss/",
-    "title": "Capital Gain/Loss"
+    "link": "https://leetcode.com/problems/capital-gainloss/"
   },
   "1394": {
+    "id": 1394,
     "category": "Array & Hashing",
+    "title": "Find Lucky Integer in an Array",
     "difficulty": "Easy",
-    "id": 1394,
-    "link": "https://leetcode.com/problems/find-lucky-integer-in-an-array/",
-    "title": "Find Lucky Integer in an Array"
+    "link": "https://leetcode.com/problems/find-lucky-integer-in-an-array/"
   },
   "1395": {
+    "id": 1395,
     "category": "Tree",
+    "title": "Count Number of Teams",
     "difficulty": "Medium",
-    "id": 1395,
-    "link": "https://leetcode.com/problems/count-number-of-teams/",
-    "title": "Count Number of Teams"
+    "link": "https://leetcode.com/problems/count-number-of-teams/"
   },
   "1396": {
+    "id": 1396,
     "category": "Array & Hashing",
+    "title": "Design Underground System",
     "difficulty": "Medium",
-    "id": 1396,
-    "link": "https://leetcode.com/problems/design-underground-system/",
-    "title": "Design Underground System"
+    "link": "https://leetcode.com/problems/design-underground-system/"
   },
   "1397": {
+    "id": 1397,
     "category": "Dynamic Programming",
+    "title": "Find All Good Strings",
     "difficulty": "Hard",
-    "id": 1397,
-    "link": "https://leetcode.com/problems/find-all-good-strings/",
-    "title": "Find All Good Strings"
+    "link": "https://leetcode.com/problems/find-all-good-strings/"
   },
   "1398": {
+    "id": 1398,
     "category": "Database",
+    "title": "Customers Who Bought Products A and B but Not C",
     "difficulty": "Medium",
-    "id": 1398,
-    "link": "https://leetcode.com/problems/customers-who-bought-products-a-and-b-but-not-c/",
-    "title": "Customers Who Bought Products A and B but Not C"
+    "link": "https://leetcode.com/problems/customers-who-bought-products-a-and-b-but-not-c/"
   },
   "1399": {
+    "id": 1399,
     "category": "Math & Geometry",
+    "title": "Count Largest Group",
     "difficulty": "Easy",
-    "id": 1399,
-    "link": "https://leetcode.com/problems/count-largest-group/",
-    "title": "Count Largest Group"
+    "link": "https://leetcode.com/problems/count-largest-group/"
   },
   "1400": {
+    "id": 1400,
     "category": "Greedy",
+    "title": "Construct K Palindrome Strings",
     "difficulty": "Medium",
-    "id": 1400,
-    "link": "https://leetcode.com/problems/construct-k-palindrome-strings/",
-    "title": "Construct K Palindrome Strings"
+    "link": "https://leetcode.com/problems/construct-k-palindrome-strings/"
   },
   "1401": {
+    "id": 1401,
     "category": "Math & Geometry",
+    "title": "Circle and Rectangle Overlapping",
     "difficulty": "Medium",
-    "id": 1401,
-    "link": "https://leetcode.com/problems/circle-and-rectangle-overlapping/",
-    "title": "Circle and Rectangle Overlapping"
+    "link": "https://leetcode.com/problems/circle-and-rectangle-overlapping/"
   },
   "1402": {
+    "id": 1402,
     "category": "Dynamic Programming",
+    "title": "Reducing Dishes",
     "difficulty": "Hard",
-    "id": 1402,
-    "link": "https://leetcode.com/problems/reducing-dishes/",
-    "title": "Reducing Dishes"
+    "link": "https://leetcode.com/problems/reducing-dishes/"
   },
   "1403": {
+    "id": 1403,
     "category": "Greedy",
+    "title": "Minimum Subsequence in Non-Increasing Order",
     "difficulty": "Easy",
-    "id": 1403,
-    "link": "https://leetcode.com/problems/minimum-subsequence-in-non-increasing-order/",
-    "title": "Minimum Subsequence in Non-Increasing Order"
+    "link": "https://leetcode.com/problems/minimum-subsequence-in-non-increasing-order/"
   },
   "1404": {
+    "id": 1404,
     "category": "Bit Manipulation",
+    "title": "Number of Steps to Reduce a Number in Binary Representation to One",
     "difficulty": "Medium",
-    "id": 1404,
-    "link": "https://leetcode.com/problems/number-of-steps-to-reduce-a-number-in-binary-representation-to-one/",
-    "title": "Number of Steps to Reduce a Number in Binary Representation to One"
+    "link": "https://leetcode.com/problems/number-of-steps-to-reduce-a-number-in-binary-representation-to-one/"
   },
   "1405": {
+    "id": 1405,
     "category": "Heap (Priority Queue)",
+    "title": "Longest Happy String",
     "difficulty": "Medium",
-    "id": 1405,
-    "link": "https://leetcode.com/problems/longest-happy-string/",
-    "title": "Longest Happy String"
+    "link": "https://leetcode.com/problems/longest-happy-string/"
   },
   "1406": {
+    "id": 1406,
     "category": "Dynamic Programming",
+    "title": "Stone Game III",
     "difficulty": "Hard",
-    "id": 1406,
-    "link": "https://leetcode.com/problems/stone-game-iii/",
-    "title": "Stone Game III"
+    "link": "https://leetcode.com/problems/stone-game-iii/"
   },
   "1407": {
+    "id": 1407,
     "category": "Database",
+    "title": "Top Travellers",
     "difficulty": "Easy",
-    "id": 1407,
-    "link": "https://leetcode.com/problems/top-travellers/",
-    "title": "Top Travellers"
+    "link": "https://leetcode.com/problems/top-travellers/"
   },
   "1408": {
+    "id": 1408,
     "category": "Array & Hashing",
+    "title": "String Matching in an Array",
     "difficulty": "Easy",
-    "id": 1408,
-    "link": "https://leetcode.com/problems/string-matching-in-an-array/",
-    "title": "String Matching in an Array"
+    "link": "https://leetcode.com/problems/string-matching-in-an-array/"
   },
   "1409": {
+    "id": 1409,
     "category": "Tree",
+    "title": "Queries on a Permutation With Key",
     "difficulty": "Medium",
-    "id": 1409,
-    "link": "https://leetcode.com/problems/queries-on-a-permutation-with-key/",
-    "title": "Queries on a Permutation With Key"
+    "link": "https://leetcode.com/problems/queries-on-a-permutation-with-key/"
   },
   "1410": {
+    "id": 1410,
     "category": "Array & Hashing",
+    "title": "HTML Entity Parser",
     "difficulty": "Medium",
-    "id": 1410,
-    "link": "https://leetcode.com/problems/html-entity-parser/",
-    "title": "HTML Entity Parser"
+    "link": "https://leetcode.com/problems/html-entity-parser/"
   },
   "1411": {
+    "id": 1411,
     "category": "Dynamic Programming",
+    "title": "Number of Ways to Paint N × 3 Grid",
     "difficulty": "Hard",
-    "id": 1411,
-    "link": "https://leetcode.com/problems/number-of-ways-to-paint-n-3-grid/",
-    "title": "Number of Ways to Paint N × 3 Grid"
+    "link": "https://leetcode.com/problems/number-of-ways-to-paint-n-3-grid/"
   },
   "1412": {
+    "id": 1412,
     "category": "Database",
+    "title": "Find the Quiet Students in All Exams",
     "difficulty": "Hard",
-    "id": 1412,
-    "link": "https://leetcode.com/problems/find-the-quiet-students-in-all-exams/",
-    "title": "Find the Quiet Students in All Exams"
+    "link": "https://leetcode.com/problems/find-the-quiet-students-in-all-exams/"
   },
   "1413": {
+    "id": 1413,
     "category": "Array & Hashing",
+    "title": "Minimum Value to Get Positive Step by Step Sum",
     "difficulty": "Easy",
-    "id": 1413,
-    "link": "https://leetcode.com/problems/minimum-value-to-get-positive-step-by-step-sum/",
-    "title": "Minimum Value to Get Positive Step by Step Sum"
+    "link": "https://leetcode.com/problems/minimum-value-to-get-positive-step-by-step-sum/"
   },
   "1414": {
+    "id": 1414,
     "category": "Greedy",
+    "title": "Find the Minimum Number of Fibonacci Numbers Whose Sum Is K",
     "difficulty": "Medium",
-    "id": 1414,
-    "link": "https://leetcode.com/problems/find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k/",
-    "title": "Find the Minimum Number of Fibonacci Numbers Whose Sum Is K"
+    "link": "https://leetcode.com/problems/find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k/"
   },
   "1415": {
+    "id": 1415,
     "category": "Backtracking",
+    "title": "The k-th Lexicographical String of All Happy Strings of Length n",
     "difficulty": "Medium",
-    "id": 1415,
-    "link": "https://leetcode.com/problems/the-k-th-lexicographical-string-of-all-happy-strings-of-length-n/",
-    "title": "The k-th Lexicographical String of All Happy Strings of Length n"
+    "link": "https://leetcode.com/problems/the-k-th-lexicographical-string-of-all-happy-strings-of-length-n/"
   },
   "1416": {
+    "id": 1416,
     "category": "Dynamic Programming",
+    "title": "Restore The Array",
     "difficulty": "Hard",
-    "id": 1416,
-    "link": "https://leetcode.com/problems/restore-the-array/",
-    "title": "Restore The Array"
+    "link": "https://leetcode.com/problems/restore-the-array/"
   },
   "1417": {
+    "id": 1417,
     "category": "Array & Hashing",
+    "title": "Reformat The String",
     "difficulty": "Easy",
-    "id": 1417,
-    "link": "https://leetcode.com/problems/reformat-the-string/",
-    "title": "Reformat The String"
+    "link": "https://leetcode.com/problems/reformat-the-string/"
   },
   "1418": {
+    "id": 1418,
     "category": "Array & Hashing",
+    "title": "Display Table of Food Orders in a Restaurant",
     "difficulty": "Medium",
-    "id": 1418,
-    "link": "https://leetcode.com/problems/display-table-of-food-orders-in-a-restaurant/",
-    "title": "Display Table of Food Orders in a Restaurant"
+    "link": "https://leetcode.com/problems/display-table-of-food-orders-in-a-restaurant/"
   },
   "1419": {
+    "id": 1419,
     "category": "Array & Hashing",
+    "title": "Minimum Number of Frogs Croaking",
     "difficulty": "Medium",
-    "id": 1419,
-    "link": "https://leetcode.com/problems/minimum-number-of-frogs-croaking/",
-    "title": "Minimum Number of Frogs Croaking"
+    "link": "https://leetcode.com/problems/minimum-number-of-frogs-croaking/"
   },
   "1420": {
+    "id": 1420,
     "category": "Dynamic Programming",
+    "title": "Build Array Where You Can Find The Maximum Exactly K Comparisons",
     "difficulty": "Hard",
-    "id": 1420,
-    "link": "https://leetcode.com/problems/build-array-where-you-can-find-the-maximum-exactly-k-comparisons/",
-    "title": "Build Array Where You Can Find The Maximum Exactly K Comparisons"
+    "link": "https://leetcode.com/problems/build-array-where-you-can-find-the-maximum-exactly-k-comparisons/"
+  },
+  "1421": {
+    "id": 1421,
+    "category": "Database",
+    "title": "NPV Queries",
+    "difficulty": "Easy",
+    "link": "https://leetcode.com/problems/npv-queries/"
   },
-  "1421": {"category": "Database", "difficulty": "Easy", "id": 1421, "link": "https://leetcode.com/problems/npv-queries/", "title": "NPV Queries"},
   "1422": {
+    "id": 1422,
     "category": "Array & Hashing",
+    "title": "Maximum Score After Splitting a String",
     "difficulty": "Easy",
-    "id": 1422,
-    "link": "https://leetcode.com/problems/maximum-score-after-splitting-a-string/",
-    "title": "Maximum Score After Splitting a String"
+    "link": "https://leetcode.com/problems/maximum-score-after-splitting-a-string/"
   },
   "1423": {
+    "id": 1423,
     "category": "Sliding Window",
+    "title": "Maximum Points You Can Obtain from Cards",
     "difficulty": "Medium",
-    "id": 1423,
-    "link": "https://leetcode.com/problems/maximum-points-you-can-obtain-from-cards/",
-    "title": "Maximum Points You Can Obtain from Cards"
+    "link": "https://leetcode.com/problems/maximum-points-you-can-obtain-from-cards/"
   },
   "1424": {
+    "id": 1424,
     "category": "Heap (Priority Queue)",
+    "title": "Diagonal Traverse II",
     "difficulty": "Medium",
-    "id": 1424,
-    "link": "https://leetcode.com/problems/diagonal-traverse-ii/",
-    "title": "Diagonal Traverse II"
+    "link": "https://leetcode.com/problems/diagonal-traverse-ii/"
   },
   "1425": {
+    "id": 1425,
     "category": "Dynamic Programming",
+    "title": "Constrained Subsequence Sum",
     "difficulty": "Hard",
-    "id": 1425,
-    "link": "https://leetcode.com/problems/constrained-subsequence-sum/",
-    "title": "Constrained Subsequence Sum"
+    "link": "https://leetcode.com/problems/constrained-subsequence-sum/"
   },
   "1426": {
+    "id": 1426,
     "category": "Array & Hashing",
+    "title": "Counting Elements",
     "difficulty": "Easy",
-    "id": 1426,
-    "link": "https://leetcode.com/problems/counting-elements/",
-    "title": "Counting Elements"
+    "link": "https://leetcode.com/problems/counting-elements/"
   },
   "1427": {
+    "id": 1427,
     "category": "Math & Geometry",
+    "title": "Perform String Shifts",
     "difficulty": "Easy",
-    "id": 1427,
-    "link": "https://leetcode.com/problems/perform-string-shifts/",
-    "title": "Perform String Shifts"
+    "link": "https://leetcode.com/problems/perform-string-shifts/"
   },
   "1428": {
+    "id": 1428,
     "category": "Binary Search",
+    "title": "Leftmost Column with at Least a One",
     "difficulty": "Medium",
-    "id": 1428,
-    "link": "https://leetcode.com/problems/leftmost-column-with-at-least-a-one/",
-    "title": "Leftmost Column with at Least a One"
+    "link": "https://leetcode.com/problems/leftmost-column-with-at-least-a-one/"
   },
   "1429": {
+    "id": 1429,
     "category": "Array & Hashing",
+    "title": "First Unique Number",
     "difficulty": "Medium",
-    "id": 1429,
-    "link": "https://leetcode.com/problems/first-unique-number/",
-    "title": "First Unique Number"
+    "link": "https://leetcode.com/problems/first-unique-number/"
   },
   "1430": {
+    "id": 1430,
     "category": "Tree",
+    "title": "Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree",
     "difficulty": "Medium",
-    "id": 1430,
-    "link": "https://leetcode.com/problems/check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree/",
-    "title": "Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree"
+    "link": "https://leetcode.com/problems/check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree/"
   },
   "1431": {
+    "id": 1431,
     "category": "Array & Hashing",
+    "title": "Kids With the Greatest Number of Candies",
     "difficulty": "Easy",
-    "id": 1431,
-    "link": "https://leetcode.com/problems/kids-with-the-greatest-number-of-candies/",
-    "title": "Kids With the Greatest Number of Candies"
+    "link": "https://leetcode.com/problems/kids-with-the-greatest-number-of-candies/"
   },
   "1432": {
+    "id": 1432,
     "category": "Greedy",
+    "title": "Max Difference You Can Get From Changing an Integer",
     "difficulty": "Medium",
-    "id": 1432,
-    "link": "https://leetcode.com/problems/max-difference-you-can-get-from-changing-an-integer/",
-    "title": "Max Difference You Can Get From Changing an Integer"
+    "link": "https://leetcode.com/problems/max-difference-you-can-get-from-changing-an-integer/"
   },
   "1433": {
+    "id": 1433,
     "category": "Greedy",
+    "title": "Check If a String Can Break Another String",
     "difficulty": "Medium",
-    "id": 1433,
-    "link": "https://leetcode.com/problems/check-if-a-string-can-break-another-string/",
-    "title": "Check If a String Can Break Another String"
+    "link": "https://leetcode.com/problems/check-if-a-string-can-break-another-string/"
   },
   "1434": {
+    "id": 1434,
     "category": "Dynamic Programming",
+    "title": "Number of Ways to Wear Different Hats to Each Other",
     "difficulty": "Hard",
-    "id": 1434,
-    "link": "https://leetcode.com/problems/number-of-ways-to-wear-different-hats-to-each-other/",
-    "title": "Number of Ways to Wear Different Hats to Each Other"
+    "link": "https://leetcode.com/problems/number-of-ways-to-wear-different-hats-to-each-other/"
   },
   "1435": {
+    "id": 1435,
     "category": "Database",
+    "title": "Create a Session Bar Chart",
     "difficulty": "Easy",
-    "id": 1435,
-    "link": "https://leetcode.com/problems/create-a-session-bar-chart/",
-    "title": "Create a Session Bar Chart"
+    "link": "https://leetcode.com/problems/create-a-session-bar-chart/"
   },
   "1436": {
+    "id": 1436,
     "category": "Array & Hashing",
+    "title": "Destination City",
     "difficulty": "Easy",
-    "id": 1436,
-    "link": "https://leetcode.com/problems/destination-city/",
-    "title": "Destination City"
+    "link": "https://leetcode.com/problems/destination-city/"
   },
   "1437": {
+    "id": 1437,
     "category": "Array & Hashing",
+    "title": "Check If All 1's Are at Least Length K Places Away",
     "difficulty": "Easy",
-    "id": 1437,
-    "link": "https://leetcode.com/problems/check-if-all-1s-are-at-least-length-k-places-away/",
-    "title": "Check If All 1's Are at Least Length K Places Away"
+    "link": "https://leetcode.com/problems/check-if-all-1s-are-at-least-length-k-places-away/"
   },
   "1438": {
+    "id": 1438,
     "category": "Sliding Window",
+    "title": "Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit",
     "difficulty": "Medium",
-    "id": 1438,
-    "link": "https://leetcode.com/problems/longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit/",
-    "title": "Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit"
+    "link": "https://leetcode.com/problems/longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit/"
   },
   "1439": {
+    "id": 1439,
     "category": "Binary Search",
+    "title": "Find the Kth Smallest Sum of a Matrix With Sorted Rows",
     "difficulty": "Hard",
-    "id": 1439,
-    "link": "https://leetcode.com/problems/find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows/",
-    "title": "Find the Kth Smallest Sum of a Matrix With Sorted Rows"
+    "link": "https://leetcode.com/problems/find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows/"
   },
   "1440": {
+    "id": 1440,
     "category": "Database",
+    "title": "Evaluate Boolean Expression",
     "difficulty": "Medium",
-    "id": 1440,
-    "link": "https://leetcode.com/problems/evaluate-boolean-expression/",
-    "title": "Evaluate Boolean Expression"
+    "link": "https://leetcode.com/problems/evaluate-boolean-expression/"
   },
   "1441": {
+    "id": 1441,
     "category": "Stack",
+    "title": "Build an Array With Stack Operations",
     "difficulty": "Medium",
-    "id": 1441,
-    "link": "https://leetcode.com/problems/build-an-array-with-stack-operations/",
-    "title": "Build an Array With Stack Operations"
+    "link": "https://leetcode.com/problems/build-an-array-with-stack-operations/"
   },
   "1442": {
+    "id": 1442,
     "category": "Bit Manipulation",
+    "title": "Count Triplets That Can Form Two Arrays of Equal XOR",
     "difficulty": "Medium",
-    "id": 1442,
-    "link": "https://leetcode.com/problems/count-triplets-that-can-form-two-arrays-of-equal-xor/",
-    "title": "Count Triplets That Can Form Two Arrays of Equal XOR"
+    "link": "https://leetcode.com/problems/count-triplets-that-can-form-two-arrays-of-equal-xor/"
   },
   "1443": {
+    "id": 1443,
     "category": "Tree",
+    "title": "Minimum Time to Collect All Apples in a Tree",
     "difficulty": "Medium",
-    "id": 1443,
-    "link": "https://leetcode.com/problems/minimum-time-to-collect-all-apples-in-a-tree/",
-    "title": "Minimum Time to Collect All Apples in a Tree"
+    "link": "https://leetcode.com/problems/minimum-time-to-collect-all-apples-in-a-tree/"
   },
   "1444": {
+    "id": 1444,
     "category": "Dynamic Programming",
+    "title": "Number of Ways of Cutting a Pizza",
     "difficulty": "Hard",
-    "id": 1444,
-    "link": "https://leetcode.com/problems/number-of-ways-of-cutting-a-pizza/",
-    "title": "Number of Ways of Cutting a Pizza"
+    "link": "https://leetcode.com/problems/number-of-ways-of-cutting-a-pizza/"
   },
   "1445": {
+    "id": 1445,
     "category": "Database",
+    "title": "Apples & Oranges",
     "difficulty": "Medium",
-    "id": 1445,
-    "link": "https://leetcode.com/problems/apples-oranges/",
-    "title": "Apples & Oranges"
+    "link": "https://leetcode.com/problems/apples-oranges/"
   },
   "1446": {
+    "id": 1446,
     "category": "Array & Hashing",
+    "title": "Consecutive Characters",
     "difficulty": "Easy",
-    "id": 1446,
-    "link": "https://leetcode.com/problems/consecutive-characters/",
-    "title": "Consecutive Characters"
+    "link": "https://leetcode.com/problems/consecutive-characters/"
   },
   "1447": {
+    "id": 1447,
     "category": "Math & Geometry",
+    "title": "Simplified Fractions",
     "difficulty": "Medium",
-    "id": 1447,
-    "link": "https://leetcode.com/problems/simplified-fractions/",
-    "title": "Simplified Fractions"
+    "link": "https://leetcode.com/problems/simplified-fractions/"
   },
   "1448": {
+    "id": 1448,
     "category": "Tree",
+    "title": "Count Good Nodes in Binary Tree",
     "difficulty": "Medium",
-    "id": 1448,
-    "link": "https://leetcode.com/problems/count-good-nodes-in-binary-tree/",
-    "title": "Count Good Nodes in Binary Tree"
+    "link": "https://leetcode.com/problems/count-good-nodes-in-binary-tree/"
   },
   "1449": {
+    "id": 1449,
     "category": "Dynamic Programming",
+    "title": "Form Largest Integer With Digits That Add up to Target",
     "difficulty": "Hard",
-    "id": 1449,
-    "link": "https://leetcode.com/problems/form-largest-integer-with-digits-that-add-up-to-target/",
-    "title": "Form Largest Integer With Digits That Add up to Target"
+    "link": "https://leetcode.com/problems/form-largest-integer-with-digits-that-add-up-to-target/"
   },
   "1450": {
+    "id": 1450,
     "category": "Array & Hashing",
+    "title": "Number of Students Doing Homework at a Given Time",
     "difficulty": "Easy",
-    "id": 1450,
-    "link": "https://leetcode.com/problems/number-of-students-doing-homework-at-a-given-time/",
-    "title": "Number of Students Doing Homework at a Given Time"
+    "link": "https://leetcode.com/problems/number-of-students-doing-homework-at-a-given-time/"
   },
   "1451": {
+    "id": 1451,
     "category": "Array & Hashing",
+    "title": "Rearrange Words in a Sentence",
     "difficulty": "Medium",
-    "id": 1451,
-    "link": "https://leetcode.com/problems/rearrange-words-in-a-sentence/",
-    "title": "Rearrange Words in a Sentence"
+    "link": "https://leetcode.com/problems/rearrange-words-in-a-sentence/"
   },
   "1452": {
+    "id": 1452,
     "category": "Array & Hashing",
+    "title": "People Whose List of Favorite Companies Is Not a Subset of Another List",
     "difficulty": "Medium",
-    "id": 1452,
-    "link": "https://leetcode.com/problems/people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list/",
-    "title": "People Whose List of Favorite Companies Is Not a Subset of Another List"
+    "link": "https://leetcode.com/problems/people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list/"
   },
   "1453": {
+    "id": 1453,
     "category": "Math & Geometry",
+    "title": "Maximum Number of Darts Inside of a Circular Dartboard",
     "difficulty": "Hard",
-    "id": 1453,
-    "link": "https://leetcode.com/problems/maximum-number-of-darts-inside-of-a-circular-dartboard/",
-    "title": "Maximum Number of Darts Inside of a Circular Dartboard"
+    "link": "https://leetcode.com/problems/maximum-number-of-darts-inside-of-a-circular-dartboard/"
   },
   "1454": {
+    "id": 1454,
     "category": "Database",
+    "title": "Active Users",
     "difficulty": "Medium",
-    "id": 1454,
-    "link": "https://leetcode.com/problems/active-users/",
-    "title": "Active Users"
+    "link": "https://leetcode.com/problems/active-users/"
   },
   "1455": {
+    "id": 1455,
     "category": "Two Pointers",
+    "title": "Check If a Word Occurs As a Prefix of Any Word in a Sentence",
     "difficulty": "Easy",
-    "id": 1455,
-    "link": "https://leetcode.com/problems/check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence/",
-    "title": "Check If a Word Occurs As a Prefix of Any Word in a Sentence"
+    "link": "https://leetcode.com/problems/check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence/"
   },
   "1456": {
+    "id": 1456,
     "category": "Sliding Window",
+    "title": "Maximum Number of Vowels in a Substring of Given Length",
     "difficulty": "Medium",
-    "id": 1456,
-    "link": "https://leetcode.com/problems/maximum-number-of-vowels-in-a-substring-of-given-length/",
-    "title": "Maximum Number of Vowels in a Substring of Given Length"
+    "link": "https://leetcode.com/problems/maximum-number-of-vowels-in-a-substring-of-given-length/"
   },
   "1457": {
+    "id": 1457,
     "category": "Tree",
+    "title": "Pseudo-Palindromic Paths in a Binary Tree",
     "difficulty": "Medium",
-    "id": 1457,
-    "link": "https://leetcode.com/problems/pseudo-palindromic-paths-in-a-binary-tree/",
-    "title": "Pseudo-Palindromic Paths in a Binary Tree"
+    "link": "https://leetcode.com/problems/pseudo-palindromic-paths-in-a-binary-tree/"
   },
   "1458": {
+    "id": 1458,
     "category": "Dynamic Programming",
+    "title": "Max Dot Product of Two Subsequences",
     "difficulty": "Hard",
-    "id": 1458,
-    "link": "https://leetcode.com/problems/max-dot-product-of-two-subsequences/",
-    "title": "Max Dot Product of Two Subsequences"
+    "link": "https://leetcode.com/problems/max-dot-product-of-two-subsequences/"
   },
   "1459": {
+    "id": 1459,
     "category": "Database",
+    "title": "Rectangles Area",
     "difficulty": "Medium",
-    "id": 1459,
-    "link": "https://leetcode.com/problems/rectangles-area/",
-    "title": "Rectangles Area"
+    "link": "https://leetcode.com/problems/rectangles-area/"
   },
   "1460": {
+    "id": 1460,
     "category": "Array & Hashing",
+    "title": "Make Two Arrays Equal by Reversing Subarrays",
     "difficulty": "Easy",
-    "id": 1460,
-    "link": "https://leetcode.com/problems/make-two-arrays-equal-by-reversing-subarrays/",
-    "title": "Make Two Arrays Equal by Reversing Subarrays"
+    "link": "https://leetcode.com/problems/make-two-arrays-equal-by-reversing-subarrays/"
   },
   "1461": {
+    "id": 1461,
     "category": "Bit Manipulation",
+    "title": "Check If a String Contains All Binary Codes of Size K",
     "difficulty": "Medium",
-    "id": 1461,
-    "link": "https://leetcode.com/problems/check-if-a-string-contains-all-binary-codes-of-size-k/",
-    "title": "Check If a String Contains All Binary Codes of Size K"
+    "link": "https://leetcode.com/problems/check-if-a-string-contains-all-binary-codes-of-size-k/"
   },
   "1462": {
+    "id": 1462,
     "category": "Graph Traversal",
+    "title": "Course Schedule IV",
     "difficulty": "Medium",
-    "id": 1462,
-    "link": "https://leetcode.com/problems/course-schedule-iv/",
-    "title": "Course Schedule IV"
+    "link": "https://leetcode.com/problems/course-schedule-iv/"
   },
   "1463": {
+    "id": 1463,
     "category": "Dynamic Programming",
+    "title": "Cherry Pickup II",
     "difficulty": "Hard",
-    "id": 1463,
-    "link": "https://leetcode.com/problems/cherry-pickup-ii/",
-    "title": "Cherry Pickup II"
+    "link": "https://leetcode.com/problems/cherry-pickup-ii/"
   },
   "1464": {
+    "id": 1464,
     "category": "Heap (Priority Queue)",
+    "title": "Maximum Product of Two Elements in an Array",
     "difficulty": "Easy",
-    "id": 1464,
-    "link": "https://leetcode.com/problems/maximum-product-of-two-elements-in-an-array/",
-    "title": "Maximum Product of Two Elements in an Array"
+    "link": "https://leetcode.com/problems/maximum-product-of-two-elements-in-an-array/"
   },
   "1465": {
+    "id": 1465,
     "category": "Greedy",
+    "title": "Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts",
     "difficulty": "Medium",
-    "id": 1465,
-    "link": "https://leetcode.com/problems/maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts/",
-    "title": "Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts"
+    "link": "https://leetcode.com/problems/maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts/"
   },
   "1466": {
+    "id": 1466,
     "category": "Graph Traversal",
+    "title": "Reorder Routes to Make All Paths Lead to the City Zero",
     "difficulty": "Medium",
-    "id": 1466,
-    "link": "https://leetcode.com/problems/reorder-routes-to-make-all-paths-lead-to-the-city-zero/",
-    "title": "Reorder Routes to Make All Paths Lead to the City Zero"
+    "link": "https://leetcode.com/problems/reorder-routes-to-make-all-paths-lead-to-the-city-zero/"
   },
   "1467": {
+    "id": 1467,
     "category": "Dynamic Programming",
+    "title": "Probability of a Two Boxes Having The Same Number of Distinct Balls",
     "difficulty": "Hard",
-    "id": 1467,
-    "link": "https://leetcode.com/problems/probability-of-a-two-boxes-having-the-same-number-of-distinct-balls/",
-    "title": "Probability of a Two Boxes Having The Same Number of Distinct Balls"
+    "link": "https://leetcode.com/problems/probability-of-a-two-boxes-having-the-same-number-of-distinct-balls/"
   },
   "1468": {
+    "id": 1468,
     "category": "Database",
+    "title": "Calculate Salaries",
     "difficulty": "Medium",
-    "id": 1468,
-    "link": "https://leetcode.com/problems/calculate-salaries/",
-    "title": "Calculate Salaries"
+    "link": "https://leetcode.com/problems/calculate-salaries/"
   },
   "1469": {
+    "id": 1469,
     "category": "Tree",
+    "title": "Find All The Lonely Nodes",
     "difficulty": "Easy",
-    "id": 1469,
-    "link": "https://leetcode.com/problems/find-all-the-lonely-nodes/",
-    "title": "Find All The Lonely Nodes"
+    "link": "https://leetcode.com/problems/find-all-the-lonely-nodes/"
   },
   "1470": {
+    "id": 1470,
     "category": "Array & Hashing",
+    "title": "Shuffle the Array",
     "difficulty": "Easy",
-    "id": 1470,
-    "link": "https://leetcode.com/problems/shuffle-the-array/",
-    "title": "Shuffle the Array"
+    "link": "https://leetcode.com/problems/shuffle-the-array/"
   },
   "1471": {
+    "id": 1471,
     "category": "Two Pointers",
+    "title": "The k Strongest Values in an Array",
     "difficulty": "Medium",
-    "id": 1471,
-    "link": "https://leetcode.com/problems/the-k-strongest-values-in-an-array/",
-    "title": "The k Strongest Values in an Array"
+    "link": "https://leetcode.com/problems/the-k-strongest-values-in-an-array/"
   },
   "1472": {
+    "id": 1472,
     "category": "Stack",
+    "title": "Design Browser History",
     "difficulty": "Medium",
-    "id": 1472,
-    "link": "https://leetcode.com/problems/design-browser-history/",
-    "title": "Design Browser History"
+    "link": "https://leetcode.com/problems/design-browser-history/"
   },
   "1473": {
+    "id": 1473,
     "category": "Dynamic Programming",
+    "title": "Paint House III",
     "difficulty": "Hard",
-    "id": 1473,
-    "link": "https://leetcode.com/problems/paint-house-iii/",
-    "title": "Paint House III"
+    "link": "https://leetcode.com/problems/paint-house-iii/"
   },
   "1474": {
+    "id": 1474,
     "category": "Linked List",
+    "title": "Delete N Nodes After M Nodes of a Linked List",
     "difficulty": "Easy",
-    "id": 1474,
-    "link": "https://leetcode.com/problems/delete-n-nodes-after-m-nodes-of-a-linked-list/",
-    "title": "Delete N Nodes After M Nodes of a Linked List"
+    "link": "https://leetcode.com/problems/delete-n-nodes-after-m-nodes-of-a-linked-list/"
   },
   "1475": {
+    "id": 1475,
     "category": "Stack",
+    "title": "Final Prices With a Special Discount in a Shop",
     "difficulty": "Easy",
-    "id": 1475,
-    "link": "https://leetcode.com/problems/final-prices-with-a-special-discount-in-a-shop/",
-    "title": "Final Prices With a Special Discount in a Shop"
+    "link": "https://leetcode.com/problems/final-prices-with-a-special-discount-in-a-shop/"
   },
   "1476": {
+    "id": 1476,
     "category": "Array & Hashing",
+    "title": "Subrectangle Queries",
     "difficulty": "Medium",
-    "id": 1476,
-    "link": "https://leetcode.com/problems/subrectangle-queries/",
-    "title": "Subrectangle Queries"
+    "link": "https://leetcode.com/problems/subrectangle-queries/"
   },
   "1477": {
+    "id": 1477,
     "category": "Dynamic Programming",
+    "title": "Find Two Non-overlapping Sub-arrays Each With Target Sum",
     "difficulty": "Medium",
-    "id": 1477,
-    "link": "https://leetcode.com/problems/find-two-non-overlapping-sub-arrays-each-with-target-sum/",
-    "title": "Find Two Non-overlapping Sub-arrays Each With Target Sum"
+    "link": "https://leetcode.com/problems/find-two-non-overlapping-sub-arrays-each-with-target-sum/"
   },
   "1478": {
+    "id": 1478,
     "category": "Dynamic Programming",
+    "title": "Allocate Mailboxes",
     "difficulty": "Hard",
-    "id": 1478,
-    "link": "https://leetcode.com/problems/allocate-mailboxes/",
-    "title": "Allocate Mailboxes"
+    "link": "https://leetcode.com/problems/allocate-mailboxes/"
   },
   "1479": {
+    "id": 1479,
     "category": "Database",
+    "title": "Sales by Day of the Week",
     "difficulty": "Hard",
-    "id": 1479,
-    "link": "https://leetcode.com/problems/sales-by-day-of-the-week/",
-    "title": "Sales by Day of the Week"
+    "link": "https://leetcode.com/problems/sales-by-day-of-the-week/"
   },
   "1480": {
+    "id": 1480,
     "category": "Array & Hashing",
+    "title": "Running Sum of 1d Array",
     "difficulty": "Easy",
-    "id": 1480,
-    "link": "https://leetcode.com/problems/running-sum-of-1d-array/",
-    "title": "Running Sum of 1d Array"
+    "link": "https://leetcode.com/problems/running-sum-of-1d-array/"
   },
   "1481": {
+    "id": 1481,
     "category": "Greedy",
+    "title": "Least Number of Unique Integers after K Removals",
     "difficulty": "Medium",
-    "id": 1481,
-    "link": "https://leetcode.com/problems/least-number-of-unique-integers-after-k-removals/",
-    "title": "Least Number of Unique Integers after K Removals"
+    "link": "https://leetcode.com/problems/least-number-of-unique-integers-after-k-removals/"
   },
   "1482": {
+    "id": 1482,
     "category": "Binary Search",
+    "title": "Minimum Number of Days to Make m Bouquets",
     "difficulty": "Medium",
-    "id": 1482,
-    "link": "https://leetcode.com/problems/minimum-number-of-days-to-make-m-bouquets/",
-    "title": "Minimum Number of Days to Make m Bouquets"
+    "link": "https://leetcode.com/problems/minimum-number-of-days-to-make-m-bouquets/"
   },
   "1483": {
+    "id": 1483,
     "category": "Tree",
+    "title": "Kth Ancestor of a Tree Node",
     "difficulty": "Hard",
-    "id": 1483,
-    "link": "https://leetcode.com/problems/kth-ancestor-of-a-tree-node/",
-    "title": "Kth Ancestor of a Tree Node"
+    "link": "https://leetcode.com/problems/kth-ancestor-of-a-tree-node/"
   },
   "1484": {
+    "id": 1484,
     "category": "Database",
+    "title": "Group Sold Products By The Date",
     "difficulty": "Easy",
-    "id": 1484,
-    "link": "https://leetcode.com/problems/group-sold-products-by-the-date/",
-    "title": "Group Sold Products By The Date"
+    "link": "https://leetcode.com/problems/group-sold-products-by-the-date/"
   },
   "1485": {
+    "id": 1485,
     "category": "Tree",
+    "title": "Clone Binary Tree With Random Pointer",
     "difficulty": "Medium",
-    "id": 1485,
-    "link": "https://leetcode.com/problems/clone-binary-tree-with-random-pointer/",
-    "title": "Clone Binary Tree With Random Pointer"
+    "link": "https://leetcode.com/problems/clone-binary-tree-with-random-pointer/"
   },
   "1486": {
+    "id": 1486,
     "category": "Bit Manipulation",
+    "title": "XOR Operation in an Array",
     "difficulty": "Easy",
-    "id": 1486,
-    "link": "https://leetcode.com/problems/xor-operation-in-an-array/",
-    "title": "XOR Operation in an Array"
+    "link": "https://leetcode.com/problems/xor-operation-in-an-array/"
   },
   "1487": {
+    "id": 1487,
     "category": "Array & Hashing",
+    "title": "Making File Names Unique",
     "difficulty": "Medium",
-    "id": 1487,
-    "link": "https://leetcode.com/problems/making-file-names-unique/",
-    "title": "Making File Names Unique"
+    "link": "https://leetcode.com/problems/making-file-names-unique/"
   },
   "1488": {
+    "id": 1488,
     "category": "Binary Search",
+    "title": "Avoid Flood in The City",
     "difficulty": "Medium",
-    "id": 1488,
-    "link": "https://leetcode.com/problems/avoid-flood-in-the-city/",
-    "title": "Avoid Flood in The City"
+    "link": "https://leetcode.com/problems/avoid-flood-in-the-city/"
   },
   "1489": {
+    "id": 1489,
     "category": "Tree",
+    "title": "Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree",
     "difficulty": "Hard",
-    "id": 1489,
-    "link": "https://leetcode.com/problems/find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree/",
-    "title": "Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree"
+    "link": "https://leetcode.com/problems/find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree/"
   },
   "1490": {
+    "id": 1490,
     "category": "Tree",
+    "title": "Clone N-ary Tree",
     "difficulty": "Medium",
-    "id": 1490,
-    "link": "https://leetcode.com/problems/clone-n-ary-tree/",
-    "title": "Clone N-ary Tree"
+    "link": "https://leetcode.com/problems/clone-n-ary-tree/"
   },
   "1491": {
+    "id": 1491,
     "category": "Array & Hashing",
+    "title": "Average Salary Excluding the Minimum and Maximum Salary",
     "difficulty": "Easy",
-    "id": 1491,
-    "link": "https://leetcode.com/problems/average-salary-excluding-the-minimum-and-maximum-salary/",
-    "title": "Average Salary Excluding the Minimum and Maximum Salary"
+    "link": "https://leetcode.com/problems/average-salary-excluding-the-minimum-and-maximum-salary/"
   },
   "1492": {
+    "id": 1492,
     "category": "Math & Geometry",
+    "title": "The kth Factor of n",
     "difficulty": "Medium",
-    "id": 1492,
-    "link": "https://leetcode.com/problems/the-kth-factor-of-n/",
-    "title": "The kth Factor of n"
+    "link": "https://leetcode.com/problems/the-kth-factor-of-n/"
   },
   "1493": {
+    "id": 1493,
     "category": "Dynamic Programming",
+    "title": "Longest Subarray of 1's After Deleting One Element",
     "difficulty": "Medium",
-    "id": 1493,
-    "link": "https://leetcode.com/problems/longest-subarray-of-1s-after-deleting-one-element/",
-    "title": "Longest Subarray of 1's After Deleting One Element"
+    "link": "https://leetcode.com/problems/longest-subarray-of-1s-after-deleting-one-element/"
   },
   "1494": {
+    "id": 1494,
     "category": "Graph Traversal",
+    "title": "Parallel Courses II",
     "difficulty": "Hard",
-    "id": 1494,
-    "link": "https://leetcode.com/problems/parallel-courses-ii/",
-    "title": "Parallel Courses II"
+    "link": "https://leetcode.com/problems/parallel-courses-ii/"
   },
   "1495": {
+    "id": 1495,
     "category": "Database",
+    "title": "Friendly Movies Streamed Last Month",
     "difficulty": "Easy",
-    "id": 1495,
-    "link": "https://leetcode.com/problems/friendly-movies-streamed-last-month/",
-    "title": "Friendly Movies Streamed Last Month"
+    "link": "https://leetcode.com/problems/friendly-movies-streamed-last-month/"
   },
   "1496": {
+    "id": 1496,
     "category": "Array & Hashing",
+    "title": "Path Crossing",
     "difficulty": "Easy",
-    "id": 1496,
-    "link": "https://leetcode.com/problems/path-crossing/",
-    "title": "Path Crossing"
+    "link": "https://leetcode.com/problems/path-crossing/"
   },
   "1497": {
+    "id": 1497,
     "category": "Array & Hashing",
+    "title": "Check If Array Pairs Are Divisible by k",
     "difficulty": "Medium",
-    "id": 1497,
-    "link": "https://leetcode.com/problems/check-if-array-pairs-are-divisible-by-k/",
-    "title": "Check If Array Pairs Are Divisible by k"
+    "link": "https://leetcode.com/problems/check-if-array-pairs-are-divisible-by-k/"
   },
   "1498": {
+    "id": 1498,
     "category": "Binary Search",
+    "title": "Number of Subsequences That Satisfy the Given Sum Condition",
     "difficulty": "Medium",
-    "id": 1498,
-    "link": "https://leetcode.com/problems/number-of-subsequences-that-satisfy-the-given-sum-condition/",
-    "title": "Number of Subsequences That Satisfy the Given Sum Condition"
+    "link": "https://leetcode.com/problems/number-of-subsequences-that-satisfy-the-given-sum-condition/"
   },
   "1499": {
+    "id": 1499,
     "category": "Sliding Window",
+    "title": "Max Value of Equation",
     "difficulty": "Hard",
-    "id": 1499,
-    "link": "https://leetcode.com/problems/max-value-of-equation/",
-    "title": "Max Value of Equation"
+    "link": "https://leetcode.com/problems/max-value-of-equation/"
   },
   "1500": {
+    "id": 1500,
     "category": "Heap (Priority Queue)",
+    "title": "Design a File Sharing System",
     "difficulty": "Medium",
-    "id": 1500,
-    "link": "https://leetcode.com/problems/design-a-file-sharing-system/",
-    "title": "Design a File Sharing System"
+    "link": "https://leetcode.com/problems/design-a-file-sharing-system/"
   },
   "1501": {
+    "id": 1501,
     "category": "Database",
+    "title": "Countries You Can Safely Invest In",
     "difficulty": "Medium",
-    "id": 1501,
-    "link": "https://leetcode.com/problems/countries-you-can-safely-invest-in/",
-    "title": "Countries You Can Safely Invest In"
+    "link": "https://leetcode.com/problems/countries-you-can-safely-invest-in/"
   },
   "1502": {
+    "id": 1502,
     "category": "Array & Hashing",
+    "title": "Can Make Arithmetic Progression From Sequence",
     "difficulty": "Easy",
-    "id": 1502,
-    "link": "https://leetcode.com/problems/can-make-arithmetic-progression-from-sequence/",
-    "title": "Can Make Arithmetic Progression From Sequence"
+    "link": "https://leetcode.com/problems/can-make-arithmetic-progression-from-sequence/"
   },
   "1503": {
+    "id": 1503,
     "category": "Array & Hashing",
+    "title": "Last Moment Before All Ants Fall Out of a Plank",
     "difficulty": "Medium",
-    "id": 1503,
-    "link": "https://leetcode.com/problems/last-moment-before-all-ants-fall-out-of-a-plank/",
-    "title": "Last Moment Before All Ants Fall Out of a Plank"
+    "link": "https://leetcode.com/problems/last-moment-before-all-ants-fall-out-of-a-plank/"
   },
   "1504": {
+    "id": 1504,
     "category": "Dynamic Programming",
+    "title": "Count Submatrices With All Ones",
     "difficulty": "Medium",
-    "id": 1504,
-    "link": "https://leetcode.com/problems/count-submatrices-with-all-ones/",
-    "title": "Count Submatrices With All Ones"
+    "link": "https://leetcode.com/problems/count-submatrices-with-all-ones/"
   },
   "1505": {
+    "id": 1505,
     "category": "Tree",
+    "title": "Minimum Possible Integer After at Most K Adjacent Swaps On Digits",
     "difficulty": "Hard",
-    "id": 1505,
-    "link": "https://leetcode.com/problems/minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits/",
-    "title": "Minimum Possible Integer After at Most K Adjacent Swaps On Digits"
+    "link": "https://leetcode.com/problems/minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits/"
   },
   "1506": {
+    "id": 1506,
     "category": "Tree",
+    "title": "Find Root of N-Ary Tree",
     "difficulty": "Medium",
-    "id": 1506,
-    "link": "https://leetcode.com/problems/find-root-of-n-ary-tree/",
-    "title": "Find Root of N-Ary Tree"
+    "link": "https://leetcode.com/problems/find-root-of-n-ary-tree/"
   },
   "1507": {
+    "id": 1507,
     "category": "Array & Hashing",
+    "title": "Reformat Date",
     "difficulty": "Easy",
-    "id": 1507,
-    "link": "https://leetcode.com/problems/reformat-date/",
-    "title": "Reformat Date"
+    "link": "https://leetcode.com/problems/reformat-date/"
   },
   "1508": {
+    "id": 1508,
     "category": "Binary Search",
+    "title": "Range Sum of Sorted Subarray Sums",
     "difficulty": "Medium",
-    "id": 1508,
-    "link": "https://leetcode.com/problems/range-sum-of-sorted-subarray-sums/",
-    "title": "Range Sum of Sorted Subarray Sums"
+    "link": "https://leetcode.com/problems/range-sum-of-sorted-subarray-sums/"
   },
   "1509": {
+    "id": 1509,
     "category": "Greedy",
+    "title": "Minimum Difference Between Largest and Smallest Value in Three Moves",
     "difficulty": "Medium",
-    "id": 1509,
-    "link": "https://leetcode.com/problems/minimum-difference-between-largest-and-smallest-value-in-three-moves/",
-    "title": "Minimum Difference Between Largest and Smallest Value in Three Moves"
+    "link": "https://leetcode.com/problems/minimum-difference-between-largest-and-smallest-value-in-three-moves/"
   },
   "1510": {
+    "id": 1510,
     "category": "Dynamic Programming",
+    "title": "Stone Game IV",
     "difficulty": "Hard",
-    "id": 1510,
-    "link": "https://leetcode.com/problems/stone-game-iv/",
-    "title": "Stone Game IV"
+    "link": "https://leetcode.com/problems/stone-game-iv/"
   },
   "1511": {
+    "id": 1511,
     "category": "Database",
+    "title": "Customer Order Frequency",
     "difficulty": "Easy",
-    "id": 1511,
-    "link": "https://leetcode.com/problems/customer-order-frequency/",
-    "title": "Customer Order Frequency"
+    "link": "https://leetcode.com/problems/customer-order-frequency/"
   },
   "1512": {
+    "id": 1512,
     "category": "Math & Geometry",
+    "title": "Number of Good Pairs",
     "difficulty": "Easy",
-    "id": 1512,
-    "link": "https://leetcode.com/problems/number-of-good-pairs/",
-    "title": "Number of Good Pairs"
+    "link": "https://leetcode.com/problems/number-of-good-pairs/"
   },
   "1513": {
+    "id": 1513,
     "category": "Math & Geometry",
+    "title": "Number of Substrings With Only 1s",
     "difficulty": "Medium",
-    "id": 1513,
-    "link": "https://leetcode.com/problems/number-of-substrings-with-only-1s/",
-    "title": "Number of Substrings With Only 1s"
+    "link": "https://leetcode.com/problems/number-of-substrings-with-only-1s/"
   },
   "1514": {
+    "id": 1514,
     "category": "Graph Traversal",
+    "title": "Path with Maximum Probability",
     "difficulty": "Medium",
-    "id": 1514,
-    "link": "https://leetcode.com/problems/path-with-maximum-probability/",
-    "title": "Path with Maximum Probability"
+    "link": "https://leetcode.com/problems/path-with-maximum-probability/"
   },
   "1515": {
+    "id": 1515,
     "category": "Math & Geometry",
+    "title": "Best Position for a Service Centre",
     "difficulty": "Hard",
-    "id": 1515,
-    "link": "https://leetcode.com/problems/best-position-for-a-service-centre/",
-    "title": "Best Position for a Service Centre"
+    "link": "https://leetcode.com/problems/best-position-for-a-service-centre/"
   },
   "1516": {
+    "id": 1516,
     "category": "Tree",
+    "title": "Move Sub-Tree of N-Ary Tree",
     "difficulty": "Hard",
-    "id": 1516,
-    "link": "https://leetcode.com/problems/move-sub-tree-of-n-ary-tree/",
-    "title": "Move Sub-Tree of N-Ary Tree"
+    "link": "https://leetcode.com/problems/move-sub-tree-of-n-ary-tree/"
   },
   "1517": {
+    "id": 1517,
     "category": "Database",
+    "title": "Find Users With Valid E-Mails",
     "difficulty": "Easy",
-    "id": 1517,
-    "link": "https://leetcode.com/problems/find-users-with-valid-e-mails/",
-    "title": "Find Users With Valid E-Mails"
+    "link": "https://leetcode.com/problems/find-users-with-valid-e-mails/"
   },
   "1518": {
+    "id": 1518,
     "category": "Math & Geometry",
+    "title": "Water Bottles",
     "difficulty": "Easy",
-    "id": 1518,
-    "link": "https://leetcode.com/problems/water-bottles/",
-    "title": "Water Bottles"
+    "link": "https://leetcode.com/problems/water-bottles/"
   },
   "1519": {
+    "id": 1519,
     "category": "Tree",
+    "title": "Number of Nodes in the Sub-Tree With the Same Label",
     "difficulty": "Medium",
-    "id": 1519,
-    "link": "https://leetcode.com/problems/number-of-nodes-in-the-sub-tree-with-the-same-label/",
-    "title": "Number of Nodes in the Sub-Tree With the Same Label"
+    "link": "https://leetcode.com/problems/number-of-nodes-in-the-sub-tree-with-the-same-label/"
   },
   "1520": {
+    "id": 1520,
     "category": "Greedy",
+    "title": "Maximum Number of Non-Overlapping Substrings",
     "difficulty": "Hard",
-    "id": 1520,
-    "link": "https://leetcode.com/problems/maximum-number-of-non-overlapping-substrings/",
-    "title": "Maximum Number of Non-Overlapping Substrings"
+    "link": "https://leetcode.com/problems/maximum-number-of-non-overlapping-substrings/"
   },
   "1521": {
+    "id": 1521,
     "category": "Tree",
+    "title": "Find a Value of a Mysterious Function Closest to Target",
     "difficulty": "Hard",
-    "id": 1521,
-    "link": "https://leetcode.com/problems/find-a-value-of-a-mysterious-function-closest-to-target/",
-    "title": "Find a Value of a Mysterious Function Closest to Target"
+    "link": "https://leetcode.com/problems/find-a-value-of-a-mysterious-function-closest-to-target/"
   },
   "1522": {
+    "id": 1522,
     "category": "Tree",
+    "title": "Diameter of N-Ary Tree",
     "difficulty": "Medium",
-    "id": 1522,
-    "link": "https://leetcode.com/problems/diameter-of-n-ary-tree/",
-    "title": "Diameter of N-Ary Tree"
+    "link": "https://leetcode.com/problems/diameter-of-n-ary-tree/"
   },
   "1523": {
+    "id": 1523,
     "category": "Math & Geometry",
+    "title": "Count Odd Numbers in an Interval Range",
     "difficulty": "Easy",
-    "id": 1523,
-    "link": "https://leetcode.com/problems/count-odd-numbers-in-an-interval-range/",
-    "title": "Count Odd Numbers in an Interval Range"
+    "link": "https://leetcode.com/problems/count-odd-numbers-in-an-interval-range/"
   },
   "1524": {
+    "id": 1524,
     "category": "Dynamic Programming",
+    "title": "Number of Sub-arrays With Odd Sum",
     "difficulty": "Medium",
-    "id": 1524,
-    "link": "https://leetcode.com/problems/number-of-sub-arrays-with-odd-sum/",
-    "title": "Number of Sub-arrays With Odd Sum"
+    "link": "https://leetcode.com/problems/number-of-sub-arrays-with-odd-sum/"
   },
   "1525": {
+    "id": 1525,
     "category": "Dynamic Programming",
+    "title": "Number of Good Ways to Split a String",
     "difficulty": "Medium",
-    "id": 1525,
-    "link": "https://leetcode.com/problems/number-of-good-ways-to-split-a-string/",
-    "title": "Number of Good Ways to Split a String"
+    "link": "https://leetcode.com/problems/number-of-good-ways-to-split-a-string/"
   },
   "1526": {
+    "id": 1526,
     "category": "Dynamic Programming",
+    "title": "Minimum Number of Increments on Subarrays to Form a Target Array",
     "difficulty": "Hard",
-    "id": 1526,
-    "link": "https://leetcode.com/problems/minimum-number-of-increments-on-subarrays-to-form-a-target-array/",
-    "title": "Minimum Number of Increments on Subarrays to Form a Target Array"
+    "link": "https://leetcode.com/problems/minimum-number-of-increments-on-subarrays-to-form-a-target-array/"
   },
   "1527": {
+    "id": 1527,
     "category": "Database",
+    "title": "Patients With a Condition",
     "difficulty": "Easy",
-    "id": 1527,
-    "link": "https://leetcode.com/problems/patients-with-a-condition/",
-    "title": "Patients With a Condition"
+    "link": "https://leetcode.com/problems/patients-with-a-condition/"
   },
   "1528": {
+    "id": 1528,
     "category": "Array & Hashing",
+    "title": "Shuffle String",
     "difficulty": "Easy",
-    "id": 1528,
-    "link": "https://leetcode.com/problems/shuffle-string/",
-    "title": "Shuffle String"
+    "link": "https://leetcode.com/problems/shuffle-string/"
   },
   "1529": {
+    "id": 1529,
     "category": "Greedy",
+    "title": "Minimum Suffix Flips",
     "difficulty": "Medium",
-    "id": 1529,
-    "link": "https://leetcode.com/problems/minimum-suffix-flips/",
-    "title": "Minimum Suffix Flips"
+    "link": "https://leetcode.com/problems/minimum-suffix-flips/"
   },
   "1530": {
+    "id": 1530,
     "category": "Tree",
+    "title": "Number of Good Leaf Nodes Pairs",
     "difficulty": "Medium",
-    "id": 1530,
-    "link": "https://leetcode.com/problems/number-of-good-leaf-nodes-pairs/",
-    "title": "Number of Good Leaf Nodes Pairs"
+    "link": "https://leetcode.com/problems/number-of-good-leaf-nodes-pairs/"
   },
   "1531": {
+    "id": 1531,
     "category": "Dynamic Programming",
+    "title": "String Compression II",
     "difficulty": "Hard",
-    "id": 1531,
-    "link": "https://leetcode.com/problems/string-compression-ii/",
-    "title": "String Compression II"
+    "link": "https://leetcode.com/problems/string-compression-ii/"
   },
   "1532": {
+    "id": 1532,
     "category": "Database",
+    "title": "The Most Recent Three Orders",
     "difficulty": "Medium",
-    "id": 1532,
-    "link": "https://leetcode.com/problems/the-most-recent-three-orders/",
-    "title": "The Most Recent Three Orders"
+    "link": "https://leetcode.com/problems/the-most-recent-three-orders/"
   },
   "1533": {
+    "id": 1533,
     "category": "Binary Search",
+    "title": "Find the Index of the Large Integer",
     "difficulty": "Medium",
-    "id": 1533,
-    "link": "https://leetcode.com/problems/find-the-index-of-the-large-integer/",
-    "title": "Find the Index of the Large Integer"
+    "link": "https://leetcode.com/problems/find-the-index-of-the-large-integer/"
   },
   "1534": {
+    "id": 1534,
     "category": "Array & Hashing",
+    "title": "Count Good Triplets",
     "difficulty": "Easy",
-    "id": 1534,
-    "link": "https://leetcode.com/problems/count-good-triplets/",
-    "title": "Count Good Triplets"
+    "link": "https://leetcode.com/problems/count-good-triplets/"
   },
   "1535": {
+    "id": 1535,
     "category": "Array & Hashing",
+    "title": "Find the Winner of an Array Game",
     "difficulty": "Medium",
-    "id": 1535,
-    "link": "https://leetcode.com/problems/find-the-winner-of-an-array-game/",
-    "title": "Find the Winner of an Array Game"
+    "link": "https://leetcode.com/problems/find-the-winner-of-an-array-game/"
   },
   "1536": {
+    "id": 1536,
     "category": "Greedy",
+    "title": "Minimum Swaps to Arrange a Binary Grid",
     "difficulty": "Medium",
-    "id": 1536,
-    "link": "https://leetcode.com/problems/minimum-swaps-to-arrange-a-binary-grid/",
-    "title": "Minimum Swaps to Arrange a Binary Grid"
+    "link": "https://leetcode.com/problems/minimum-swaps-to-arrange-a-binary-grid/"
   },
   "1537": {
+    "id": 1537,
     "category": "Dynamic Programming",
+    "title": "Get the Maximum Score",
     "difficulty": "Hard",
-    "id": 1537,
-    "link": "https://leetcode.com/problems/get-the-maximum-score/",
-    "title": "Get the Maximum Score"
+    "link": "https://leetcode.com/problems/get-the-maximum-score/"
   },
   "1538": {
+    "id": 1538,
     "category": "Math & Geometry",
+    "title": "Guess the Majority in a Hidden Array",
     "difficulty": "Medium",
-    "id": 1538,
-    "link": "https://leetcode.com/problems/guess-the-majority-in-a-hidden-array/",
-    "title": "Guess the Majority in a Hidden Array"
+    "link": "https://leetcode.com/problems/guess-the-majority-in-a-hidden-array/"
   },
   "1539": {
+    "id": 1539,
     "category": "Binary Search",
+    "title": "Kth Missing Positive Number",
     "difficulty": "Easy",
-    "id": 1539,
-    "link": "https://leetcode.com/problems/kth-missing-positive-number/",
-    "title": "Kth Missing Positive Number"
+    "link": "https://leetcode.com/problems/kth-missing-positive-number/"
   },
   "1540": {
+    "id": 1540,
     "category": "Array & Hashing",
+    "title": "Can Convert String in K Moves",
     "difficulty": "Medium",
-    "id": 1540,
-    "link": "https://leetcode.com/problems/can-convert-string-in-k-moves/",
-    "title": "Can Convert String in K Moves"
+    "link": "https://leetcode.com/problems/can-convert-string-in-k-moves/"
   },
   "1541": {
+    "id": 1541,
     "category": "Stack",
+    "title": "Minimum Insertions to Balance a Parentheses String",
     "difficulty": "Medium",
-    "id": 1541,
-    "link": "https://leetcode.com/problems/minimum-insertions-to-balance-a-parentheses-string/",
-    "title": "Minimum Insertions to Balance a Parentheses String"
+    "link": "https://leetcode.com/problems/minimum-insertions-to-balance-a-parentheses-string/"
   },
   "1542": {
+    "id": 1542,
     "category": "Bit Manipulation",
+    "title": "Find Longest Awesome Substring",
     "difficulty": "Hard",
-    "id": 1542,
-    "link": "https://leetcode.com/problems/find-longest-awesome-substring/",
-    "title": "Find Longest Awesome Substring"
+    "link": "https://leetcode.com/problems/find-longest-awesome-substring/"
   },
   "1543": {
+    "id": 1543,
     "category": "Database",
+    "title": "Fix Product Name Format",
     "difficulty": "Easy",
-    "id": 1543,
-    "link": "https://leetcode.com/problems/fix-product-name-format/",
-    "title": "Fix Product Name Format"
+    "link": "https://leetcode.com/problems/fix-product-name-format/"
   },
   "1544": {
+    "id": 1544,
     "category": "Stack",
+    "title": "Make The String Great",
     "difficulty": "Easy",
-    "id": 1544,
-    "link": "https://leetcode.com/problems/make-the-string-great/",
-    "title": "Make The String Great"
+    "link": "https://leetcode.com/problems/make-the-string-great/"
   },
   "1545": {
+    "id": 1545,
     "category": "Array & Hashing",
+    "title": "Find Kth Bit in Nth Binary String",
     "difficulty": "Medium",
-    "id": 1545,
-    "link": "https://leetcode.com/problems/find-kth-bit-in-nth-binary-string/",
-    "title": "Find Kth Bit in Nth Binary String"
+    "link": "https://leetcode.com/problems/find-kth-bit-in-nth-binary-string/"
   },
   "1546": {
+    "id": 1546,
     "category": "Greedy",
+    "title": "Maximum Number of Non-Overlapping Subarrays With Sum Equals Target",
     "difficulty": "Medium",
-    "id": 1546,
-    "link": "https://leetcode.com/problems/maximum-number-of-non-overlapping-subarrays-with-sum-equals-target/",
-    "title": "Maximum Number of Non-Overlapping Subarrays With Sum Equals Target"
+    "link": "https://leetcode.com/problems/maximum-number-of-non-overlapping-subarrays-with-sum-equals-target/"
   },
   "1547": {
+    "id": 1547,
     "category": "Dynamic Programming",
+    "title": "Minimum Cost to Cut a Stick",
     "difficulty": "Hard",
-    "id": 1547,
-    "link": "https://leetcode.com/problems/minimum-cost-to-cut-a-stick/",
-    "title": "Minimum Cost to Cut a Stick"
+    "link": "https://leetcode.com/problems/minimum-cost-to-cut-a-stick/"
   },
   "1548": {
+    "id": 1548,
     "category": "Graph Traversal",
+    "title": "The Most Similar Path in a Graph",
     "difficulty": "Hard",
-    "id": 1548,
-    "link": "https://leetcode.com/problems/the-most-similar-path-in-a-graph/",
-    "title": "The Most Similar Path in a Graph"
+    "link": "https://leetcode.com/problems/the-most-similar-path-in-a-graph/"
   },
   "1549": {
+    "id": 1549,
     "category": "Database",
+    "title": "The Most Recent Orders for Each Product",
     "difficulty": "Medium",
-    "id": 1549,
-    "link": "https://leetcode.com/problems/the-most-recent-orders-for-each-product/",
-    "title": "The Most Recent Orders for Each Product"
+    "link": "https://leetcode.com/problems/the-most-recent-orders-for-each-product/"
   },
   "1550": {
+    "id": 1550,
     "category": "Array & Hashing",
+    "title": "Three Consecutive Odds",
     "difficulty": "Easy",
-    "id": 1550,
-    "link": "https://leetcode.com/problems/three-consecutive-odds/",
-    "title": "Three Consecutive Odds"
+    "link": "https://leetcode.com/problems/three-consecutive-odds/"
   },
   "1551": {
+    "id": 1551,
     "category": "Math & Geometry",
+    "title": "Minimum Operations to Make Array Equal",
     "difficulty": "Medium",
-    "id": 1551,
-    "link": "https://leetcode.com/problems/minimum-operations-to-make-array-equal/",
-    "title": "Minimum Operations to Make Array Equal"
+    "link": "https://leetcode.com/problems/minimum-operations-to-make-array-equal/"
   },
   "1552": {
+    "id": 1552,
     "category": "Binary Search",
+    "title": "Magnetic Force Between Two Balls",
     "difficulty": "Medium",
-    "id": 1552,
-    "link": "https://leetcode.com/problems/magnetic-force-between-two-balls/",
-    "title": "Magnetic Force Between Two Balls"
+    "link": "https://leetcode.com/problems/magnetic-force-between-two-balls/"
   },
   "1553": {
+    "id": 1553,
     "category": "Dynamic Programming",
+    "title": "Minimum Number of Days to Eat N Oranges",
     "difficulty": "Hard",
-    "id": 1553,
-    "link": "https://leetcode.com/problems/minimum-number-of-days-to-eat-n-oranges/",
-    "title": "Minimum Number of Days to Eat N Oranges"
+    "link": "https://leetcode.com/problems/minimum-number-of-days-to-eat-n-oranges/"
   },
   "1554": {
+    "id": 1554,
     "category": "Array & Hashing",
+    "title": "Strings Differ by One Character",
     "difficulty": "Medium",
-    "id": 1554,
-    "link": "https://leetcode.com/problems/strings-differ-by-one-character/",
-    "title": "Strings Differ by One Character"
+    "link": "https://leetcode.com/problems/strings-differ-by-one-character/"
   },
   "1555": {
+    "id": 1555,
     "category": "Database",
+    "title": "Bank Account Summary",
     "difficulty": "Medium",
-    "id": 1555,
-    "link": "https://leetcode.com/problems/bank-account-summary/",
-    "title": "Bank Account Summary"
+    "link": "https://leetcode.com/problems/bank-account-summary/"
   },
   "1556": {
+    "id": 1556,
     "category": "Array & Hashing",
+    "title": "Thousand Separator",
     "difficulty": "Easy",
-    "id": 1556,
-    "link": "https://leetcode.com/problems/thousand-separator/",
-    "title": "Thousand Separator"
+    "link": "https://leetcode.com/problems/thousand-separator/"
   },
   "1557": {
+    "id": 1557,
     "category": "Graph Traversal",
+    "title": "Minimum Number of Vertices to Reach All Nodes",
     "difficulty": "Medium",
-    "id": 1557,
-    "link": "https://leetcode.com/problems/minimum-number-of-vertices-to-reach-all-nodes/",
-    "title": "Minimum Number of Vertices to Reach All Nodes"
+    "link": "https://leetcode.com/problems/minimum-number-of-vertices-to-reach-all-nodes/"
   },
   "1558": {
+    "id": 1558,
     "category": "Bit Manipulation",
+    "title": "Minimum Numbers of Function Calls to Make Target Array",
     "difficulty": "Medium",
-    "id": 1558,
-    "link": "https://leetcode.com/problems/minimum-numbers-of-function-calls-to-make-target-array/",
-    "title": "Minimum Numbers of Function Calls to Make Target Array"
+    "link": "https://leetcode.com/problems/minimum-numbers-of-function-calls-to-make-target-array/"
   },
   "1559": {
+    "id": 1559,
     "category": "Graph Traversal",
+    "title": "Detect Cycles in 2D Grid",
     "difficulty": "Medium",
-    "id": 1559,
-    "link": "https://leetcode.com/problems/detect-cycles-in-2d-grid/",
-    "title": "Detect Cycles in 2D Grid"
+    "link": "https://leetcode.com/problems/detect-cycles-in-2d-grid/"
   },
   "1560": {
+    "id": 1560,
     "category": "Array & Hashing",
+    "title": "Most Visited Sector in  a Circular Track",
     "difficulty": "Easy",
-    "id": 1560,
-    "link": "https://leetcode.com/problems/most-visited-sector-in-a-circular-track/",
-    "title": "Most Visited Sector in  a Circular Track"
+    "link": "https://leetcode.com/problems/most-visited-sector-in-a-circular-track/"
   },
   "1561": {
+    "id": 1561,
     "category": "Greedy",
+    "title": "Maximum Number of Coins You Can Get",
     "difficulty": "Medium",
-    "id": 1561,
-    "link": "https://leetcode.com/problems/maximum-number-of-coins-you-can-get/",
-    "title": "Maximum Number of Coins You Can Get"
+    "link": "https://leetcode.com/problems/maximum-number-of-coins-you-can-get/"
   },
   "1562": {
+    "id": 1562,
     "category": "Binary Search",
+    "title": "Find Latest Group of Size M",
     "difficulty": "Medium",
-    "id": 1562,
-    "link": "https://leetcode.com/problems/find-latest-group-of-size-m/",
-    "title": "Find Latest Group of Size M"
+    "link": "https://leetcode.com/problems/find-latest-group-of-size-m/"
   },
   "1563": {
+    "id": 1563,
     "category": "Dynamic Programming",
+    "title": "Stone Game V",
     "difficulty": "Hard",
-    "id": 1563,
-    "link": "https://leetcode.com/problems/stone-game-v/",
-    "title": "Stone Game V"
+    "link": "https://leetcode.com/problems/stone-game-v/"
   },
   "1564": {
+    "id": 1564,
     "category": "Greedy",
+    "title": "Put Boxes Into the Warehouse I",
     "difficulty": "Medium",
-    "id": 1564,
-    "link": "https://leetcode.com/problems/put-boxes-into-the-warehouse-i/",
-    "title": "Put Boxes Into the Warehouse I"
+    "link": "https://leetcode.com/problems/put-boxes-into-the-warehouse-i/"
   },
   "1565": {
+    "id": 1565,
     "category": "Database",
+    "title": "Unique Orders and Customers Per Month",
     "difficulty": "Easy",
-    "id": 1565,
-    "link": "https://leetcode.com/problems/unique-orders-and-customers-per-month/",
-    "title": "Unique Orders and Customers Per Month"
+    "link": "https://leetcode.com/problems/unique-orders-and-customers-per-month/"
   },
   "1566": {
+    "id": 1566,
     "category": "Array & Hashing",
+    "title": "Detect Pattern of Length M Repeated K or More Times",
     "difficulty": "Easy",
-    "id": 1566,
-    "link": "https://leetcode.com/problems/detect-pattern-of-length-m-repeated-k-or-more-times/",
-    "title": "Detect Pattern of Length M Repeated K or More Times"
+    "link": "https://leetcode.com/problems/detect-pattern-of-length-m-repeated-k-or-more-times/"
   },
   "1567": {
+    "id": 1567,
     "category": "Dynamic Programming",
+    "title": "Maximum Length of Subarray With Positive Product",
     "difficulty": "Medium",
-    "id": 1567,
-    "link": "https://leetcode.com/problems/maximum-length-of-subarray-with-positive-product/",
-    "title": "Maximum Length of Subarray With Positive Product"
+    "link": "https://leetcode.com/problems/maximum-length-of-subarray-with-positive-product/"
   },
   "1568": {
+    "id": 1568,
     "category": "Graph Traversal",
+    "title": "Minimum Number of Days to Disconnect Island",
     "difficulty": "Hard",
-    "id": 1568,
-    "link": "https://leetcode.com/problems/minimum-number-of-days-to-disconnect-island/",
-    "title": "Minimum Number of Days to Disconnect Island"
+    "link": "https://leetcode.com/problems/minimum-number-of-days-to-disconnect-island/"
   },
   "1569": {
+    "id": 1569,
     "category": "Tree",
+    "title": "Number of Ways to Reorder Array to Get Same BST",
     "difficulty": "Hard",
-    "id": 1569,
-    "link": "https://leetcode.com/problems/number-of-ways-to-reorder-array-to-get-same-bst/",
-    "title": "Number of Ways to Reorder Array to Get Same BST"
+    "link": "https://leetcode.com/problems/number-of-ways-to-reorder-array-to-get-same-bst/"
   },
   "1570": {
+    "id": 1570,
     "category": "Two Pointers",
+    "title": "Dot Product of Two Sparse Vectors",
     "difficulty": "Medium",
-    "id": 1570,
-    "link": "https://leetcode.com/problems/dot-product-of-two-sparse-vectors/",
-    "title": "Dot Product of Two Sparse Vectors"
+    "link": "https://leetcode.com/problems/dot-product-of-two-sparse-vectors/"
   },
   "1571": {
+    "id": 1571,
     "category": "Database",
+    "title": "Warehouse Manager",
     "difficulty": "Easy",
-    "id": 1571,
-    "link": "https://leetcode.com/problems/warehouse-manager/",
-    "title": "Warehouse Manager"
+    "link": "https://leetcode.com/problems/warehouse-manager/"
   },
   "1572": {
+    "id": 1572,
     "category": "Array & Hashing",
+    "title": "Matrix Diagonal Sum",
     "difficulty": "Easy",
-    "id": 1572,
-    "link": "https://leetcode.com/problems/matrix-diagonal-sum/",
-    "title": "Matrix Diagonal Sum"
+    "link": "https://leetcode.com/problems/matrix-diagonal-sum/"
   },
   "1573": {
+    "id": 1573,
     "category": "Math & Geometry",
+    "title": "Number of Ways to Split a String",
     "difficulty": "Medium",
-    "id": 1573,
-    "link": "https://leetcode.com/problems/number-of-ways-to-split-a-string/",
-    "title": "Number of Ways to Split a String"
+    "link": "https://leetcode.com/problems/number-of-ways-to-split-a-string/"
   },
   "1574": {
+    "id": 1574,
     "category": "Binary Search",
+    "title": "Shortest Subarray to be Removed to Make Array Sorted",
     "difficulty": "Medium",
-    "id": 1574,
-    "link": "https://leetcode.com/problems/shortest-subarray-to-be-removed-to-make-array-sorted/",
-    "title": "Shortest Subarray to be Removed to Make Array Sorted"
+    "link": "https://leetcode.com/problems/shortest-subarray-to-be-removed-to-make-array-sorted/"
   },
   "1575": {
+    "id": 1575,
     "category": "Dynamic Programming",
+    "title": "Count All Possible Routes",
     "difficulty": "Hard",
-    "id": 1575,
-    "link": "https://leetcode.com/problems/count-all-possible-routes/",
-    "title": "Count All Possible Routes"
+    "link": "https://leetcode.com/problems/count-all-possible-routes/"
   },
   "1576": {
+    "id": 1576,
     "category": "Array & Hashing",
+    "title": "Replace All ?'s to Avoid Consecutive Repeating Characters",
     "difficulty": "Easy",
-    "id": 1576,
-    "link": "https://leetcode.com/problems/replace-all-s-to-avoid-consecutive-repeating-characters/",
-    "title": "Replace All ?'s to Avoid Consecutive Repeating Characters"
+    "link": "https://leetcode.com/problems/replace-all-s-to-avoid-consecutive-repeating-characters/"
   },
   "1577": {
+    "id": 1577,
     "category": "Math & Geometry",
+    "title": "Number of Ways Where Square of Number Is Equal to Product of Two Numbers",
     "difficulty": "Medium",
-    "id": 1577,
-    "link": "https://leetcode.com/problems/number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers/",
-    "title": "Number of Ways Where Square of Number Is Equal to Product of Two Numbers"
+    "link": "https://leetcode.com/problems/number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers/"
   },
   "1578": {
+    "id": 1578,
     "category": "Dynamic Programming",
+    "title": "Minimum Time to Make Rope Colorful",
     "difficulty": "Medium",
-    "id": 1578,
-    "link": "https://leetcode.com/problems/minimum-time-to-make-rope-colorful/",
-    "title": "Minimum Time to Make Rope Colorful"
+    "link": "https://leetcode.com/problems/minimum-time-to-make-rope-colorful/"
   },
   "1579": {
+    "id": 1579,
     "category": "Graph Traversal",
+    "title": "Remove Max Number of Edges to Keep Graph Fully Traversable",
     "difficulty": "Hard",
-    "id": 1579,
-    "link": "https://leetcode.com/problems/remove-max-number-of-edges-to-keep-graph-fully-traversable/",
-    "title": "Remove Max Number of Edges to Keep Graph Fully Traversable"
+    "link": "https://leetcode.com/problems/remove-max-number-of-edges-to-keep-graph-fully-traversable/"
   },
   "1580": {
+    "id": 1580,
     "category": "Greedy",
+    "title": "Put Boxes Into the Warehouse II",
     "difficulty": "Medium",
-    "id": 1580,
-    "link": "https://leetcode.com/problems/put-boxes-into-the-warehouse-ii/",
-    "title": "Put Boxes Into the Warehouse II"
+    "link": "https://leetcode.com/problems/put-boxes-into-the-warehouse-ii/"
   },
   "1581": {
+    "id": 1581,
     "category": "Database",
+    "title": "Customer Who Visited but Did Not Make Any Transactions",
     "difficulty": "Easy",
-    "id": 1581,
-    "link": "https://leetcode.com/problems/customer-who-visited-but-did-not-make-any-transactions/",
-    "title": "Customer Who Visited but Did Not Make Any Transactions"
+    "link": "https://leetcode.com/problems/customer-who-visited-but-did-not-make-any-transactions/"
   },
   "1582": {
+    "id": 1582,
     "category": "Array & Hashing",
+    "title": "Special Positions in a Binary Matrix",
     "difficulty": "Easy",
-    "id": 1582,
-    "link": "https://leetcode.com/problems/special-positions-in-a-binary-matrix/",
-    "title": "Special Positions in a Binary Matrix"
+    "link": "https://leetcode.com/problems/special-positions-in-a-binary-matrix/"
   },
   "1583": {
+    "id": 1583,
     "category": "Array & Hashing",
+    "title": "Count Unhappy Friends",
     "difficulty": "Medium",
-    "id": 1583,
-    "link": "https://leetcode.com/problems/count-unhappy-friends/",
-    "title": "Count Unhappy Friends"
+    "link": "https://leetcode.com/problems/count-unhappy-friends/"
   },
   "1584": {
+    "id": 1584,
     "category": "Tree",
+    "title": "Min Cost to Connect All Points",
     "difficulty": "Medium",
-    "id": 1584,
-    "link": "https://leetcode.com/problems/min-cost-to-connect-all-points/",
-    "title": "Min Cost to Connect All Points"
+    "link": "https://leetcode.com/problems/min-cost-to-connect-all-points/"
   },
   "1585": {
+    "id": 1585,
     "category": "Greedy",
+    "title": "Check If String Is Transformable With Substring Sort Operations",
     "difficulty": "Hard",
-    "id": 1585,
-    "link": "https://leetcode.com/problems/check-if-string-is-transformable-with-substring-sort-operations/",
-    "title": "Check If String Is Transformable With Substring Sort Operations"
+    "link": "https://leetcode.com/problems/check-if-string-is-transformable-with-substring-sort-operations/"
   },
   "1586": {
+    "id": 1586,
     "category": "Tree",
+    "title": "Binary Search Tree Iterator II",
     "difficulty": "Medium",
-    "id": 1586,
-    "link": "https://leetcode.com/problems/binary-search-tree-iterator-ii/",
-    "title": "Binary Search Tree Iterator II"
+    "link": "https://leetcode.com/problems/binary-search-tree-iterator-ii/"
   },
   "1587": {
+    "id": 1587,
     "category": "Database",
+    "title": "Bank Account Summary II",
     "difficulty": "Easy",
-    "id": 1587,
-    "link": "https://leetcode.com/problems/bank-account-summary-ii/",
-    "title": "Bank Account Summary II"
+    "link": "https://leetcode.com/problems/bank-account-summary-ii/"
   },
   "1588": {
+    "id": 1588,
     "category": "Math & Geometry",
+    "title": "Sum of All Odd Length Subarrays",
     "difficulty": "Easy",
-    "id": 1588,
-    "link": "https://leetcode.com/problems/sum-of-all-odd-length-subarrays/",
-    "title": "Sum of All Odd Length Subarrays"
+    "link": "https://leetcode.com/problems/sum-of-all-odd-length-subarrays/"
   },
   "1589": {
+    "id": 1589,
     "category": "Greedy",
+    "title": "Maximum Sum Obtained of Any Permutation",
     "difficulty": "Medium",
-    "id": 1589,
-    "link": "https://leetcode.com/problems/maximum-sum-obtained-of-any-permutation/",
-    "title": "Maximum Sum Obtained of Any Permutation"
+    "link": "https://leetcode.com/problems/maximum-sum-obtained-of-any-permutation/"
   },
   "1590": {
+    "id": 1590,
     "category": "Array & Hashing",
+    "title": "Make Sum Divisible by P",
     "difficulty": "Medium",
-    "id": 1590,
-    "link": "https://leetcode.com/problems/make-sum-divisible-by-p/",
-    "title": "Make Sum Divisible by P"
+    "link": "https://leetcode.com/problems/make-sum-divisible-by-p/"
   },
   "1591": {
+    "id": 1591,
     "category": "Graph Traversal",
+    "title": "Strange Printer II",
     "difficulty": "Hard",
-    "id": 1591,
-    "link": "https://leetcode.com/problems/strange-printer-ii/",
-    "title": "Strange Printer II"
+    "link": "https://leetcode.com/problems/strange-printer-ii/"
   },
   "1592": {
+    "id": 1592,
     "category": "Array & Hashing",
+    "title": "Rearrange Spaces Between Words",
     "difficulty": "Easy",
-    "id": 1592,
-    "link": "https://leetcode.com/problems/rearrange-spaces-between-words/",
-    "title": "Rearrange Spaces Between Words"
+    "link": "https://leetcode.com/problems/rearrange-spaces-between-words/"
   },
   "1593": {
+    "id": 1593,
     "category": "Backtracking",
+    "title": "Split a String Into the Max Number of Unique Substrings",
     "difficulty": "Medium",
-    "id": 1593,
-    "link": "https://leetcode.com/problems/split-a-string-into-the-max-number-of-unique-substrings/",
-    "title": "Split a String Into the Max Number of Unique Substrings"
+    "link": "https://leetcode.com/problems/split-a-string-into-the-max-number-of-unique-substrings/"
   },
   "1594": {
+    "id": 1594,
     "category": "Dynamic Programming",
+    "title": "Maximum Non Negative Product in a Matrix",
     "difficulty": "Medium",
-    "id": 1594,
-    "link": "https://leetcode.com/problems/maximum-non-negative-product-in-a-matrix/",
-    "title": "Maximum Non Negative Product in a Matrix"
+    "link": "https://leetcode.com/problems/maximum-non-negative-product-in-a-matrix/"
   },
   "1595": {
+    "id": 1595,
     "category": "Dynamic Programming",
+    "title": "Minimum Cost to Connect Two Groups of Points",
     "difficulty": "Hard",
-    "id": 1595,
-    "link": "https://leetcode.com/problems/minimum-cost-to-connect-two-groups-of-points/",
-    "title": "Minimum Cost to Connect Two Groups of Points"
+    "link": "https://leetcode.com/problems/minimum-cost-to-connect-two-groups-of-points/"
   },
   "1596": {
+    "id": 1596,
     "category": "Database",
+    "title": "The Most Frequently Ordered Products for Each Customer",
     "difficulty": "Medium",
-    "id": 1596,
-    "link": "https://leetcode.com/problems/the-most-frequently-ordered-products-for-each-customer/",
-    "title": "The Most Frequently Ordered Products for Each Customer"
+    "link": "https://leetcode.com/problems/the-most-frequently-ordered-products-for-each-customer/"
   },
   "1597": {
+    "id": 1597,
     "category": "Tree",
+    "title": "Build Binary Expression Tree From Infix Expression",
     "difficulty": "Hard",
-    "id": 1597,
-    "link": "https://leetcode.com/problems/build-binary-expression-tree-from-infix-expression/",
-    "title": "Build Binary Expression Tree From Infix Expression"
+    "link": "https://leetcode.com/problems/build-binary-expression-tree-from-infix-expression/"
   },
   "1598": {
+    "id": 1598,
     "category": "Stack",
+    "title": "Crawler Log Folder",
     "difficulty": "Easy",
-    "id": 1598,
-    "link": "https://leetcode.com/problems/crawler-log-folder/",
-    "title": "Crawler Log Folder"
+    "link": "https://leetcode.com/problems/crawler-log-folder/"
   },
   "1599": {
+    "id": 1599,
     "category": "Array & Hashing",
+    "title": "Maximum Profit of Operating a Centennial Wheel",
     "difficulty": "Medium",
-    "id": 1599,
-    "link": "https://leetcode.com/problems/maximum-profit-of-operating-a-centennial-wheel/",
-    "title": "Maximum Profit of Operating a Centennial Wheel"
+    "link": "https://leetcode.com/problems/maximum-profit-of-operating-a-centennial-wheel/"
   },
   "1600": {
+    "id": 1600,
     "category": "Tree",
+    "title": "Throne Inheritance",
     "difficulty": "Medium",
-    "id": 1600,
-    "link": "https://leetcode.com/problems/throne-inheritance/",
-    "title": "Throne Inheritance"
+    "link": "https://leetcode.com/problems/throne-inheritance/"
   },
   "1601": {
+    "id": 1601,
     "category": "Backtracking",
+    "title": "Maximum Number of Achievable Transfer Requests",
     "difficulty": "Hard",
-    "id": 1601,
-    "link": "https://leetcode.com/problems/maximum-number-of-achievable-transfer-requests/",
-    "title": "Maximum Number of Achievable Transfer Requests"
+    "link": "https://leetcode.com/problems/maximum-number-of-achievable-transfer-requests/"
   },
   "1602": {
+    "id": 1602,
     "category": "Tree",
+    "title": "Find Nearest Right Node in Binary Tree",
     "difficulty": "Medium",
-    "id": 1602,
-    "link": "https://leetcode.com/problems/find-nearest-right-node-in-binary-tree/",
-    "title": "Find Nearest Right Node in Binary Tree"
+    "link": "https://leetcode.com/problems/find-nearest-right-node-in-binary-tree/"
   },
   "1603": {
+    "id": 1603,
     "category": "Array & Hashing",
+    "title": "Design Parking System",
     "difficulty": "Easy",
-    "id": 1603,
-    "link": "https://leetcode.com/problems/design-parking-system/",
-    "title": "Design Parking System"
+    "link": "https://leetcode.com/problems/design-parking-system/"
   },
   "1604": {
+    "id": 1604,
     "category": "Array & Hashing",
+    "title": "Alert Using Same Key-Card Three or More Times in a One Hour Period",
     "difficulty": "Medium",
-    "id": 1604,
-    "link": "https://leetcode.com/problems/alert-using-same-key-card-three-or-more-times-in-a-one-hour-period/",
-    "title": "Alert Using Same Key-Card Three or More Times in a One Hour Period"
+    "link": "https://leetcode.com/problems/alert-using-same-key-card-three-or-more-times-in-a-one-hour-period/"
   },
   "1605": {
+    "id": 1605,
     "category": "Greedy",
+    "title": "Find Valid Matrix Given Row and Column Sums",
     "difficulty": "Medium",
-    "id": 1605,
-    "link": "https://leetcode.com/problems/find-valid-matrix-given-row-and-column-sums/",
-    "title": "Find Valid Matrix Given Row and Column Sums"
+    "link": "https://leetcode.com/problems/find-valid-matrix-given-row-and-column-sums/"
   },
   "1606": {
+    "id": 1606,
     "category": "Heap (Priority Queue)",
+    "title": "Find Servers That Handled Most Number of Requests",
     "difficulty": "Hard",
-    "id": 1606,
-    "link": "https://leetcode.com/problems/find-servers-that-handled-most-number-of-requests/",
-    "title": "Find Servers That Handled Most Number of Requests"
+    "link": "https://leetcode.com/problems/find-servers-that-handled-most-number-of-requests/"
   },
   "1607": {
+    "id": 1607,
     "category": "Database",
+    "title": "Sellers With No Sales",
     "difficulty": "Easy",
-    "id": 1607,
-    "link": "https://leetcode.com/problems/sellers-with-no-sales/",
-    "title": "Sellers With No Sales"
+    "link": "https://leetcode.com/problems/sellers-with-no-sales/"
   },
   "1608": {
+    "id": 1608,
     "category": "Binary Search",
+    "title": "Special Array With X Elements Greater Than or Equal X",
     "difficulty": "Easy",
-    "id": 1608,
-    "link": "https://leetcode.com/problems/special-array-with-x-elements-greater-than-or-equal-x/",
-    "title": "Special Array With X Elements Greater Than or Equal X"
+    "link": "https://leetcode.com/problems/special-array-with-x-elements-greater-than-or-equal-x/"
+  },
+  "1609": {
+    "id": 1609,
+    "category": "Tree",
+    "title": "Even Odd Tree",
+    "difficulty": "Medium",
+    "link": "https://leetcode.com/problems/even-odd-tree/"
   },
-  "1609": {"category": "Tree", "difficulty": "Medium", "id": 1609, "link": "https://leetcode.com/problems/even-odd-tree/", "title": "Even Odd Tree"},
   "1610": {
+    "id": 1610,
     "category": "Sliding Window",
+    "title": "Maximum Number of Visible Points",
     "difficulty": "Hard",
-    "id": 1610,
-    "link": "https://leetcode.com/problems/maximum-number-of-visible-points/",
-    "title": "Maximum Number of Visible Points"
+    "link": "https://leetcode.com/problems/maximum-number-of-visible-points/"
   },
   "1611": {
+    "id": 1611,
     "category": "Dynamic Programming",
+    "title": "Minimum One Bit Operations to Make Integers Zero",
     "difficulty": "Hard",
-    "id": 1611,
-    "link": "https://leetcode.com/problems/minimum-one-bit-operations-to-make-integers-zero/",
-    "title": "Minimum One Bit Operations to Make Integers Zero"
+    "link": "https://leetcode.com/problems/minimum-one-bit-operations-to-make-integers-zero/"
   },
   "1612": {
+    "id": 1612,
     "category": "Tree",
+    "title": "Check If Two Expression Trees are Equivalent",
     "difficulty": "Medium",
-    "id": 1612,
-    "link": "https://leetcode.com/problems/check-if-two-expression-trees-are-equivalent/",
-    "title": "Check If Two Expression Trees are Equivalent"
+    "link": "https://leetcode.com/problems/check-if-two-expression-trees-are-equivalent/"
   },
   "1613": {
+    "id": 1613,
     "category": "Database",
+    "title": "Find the Missing IDs",
     "difficulty": "Medium",
-    "id": 1613,
-    "link": "https://leetcode.com/problems/find-the-missing-ids/",
-    "title": "Find the Missing IDs"
+    "link": "https://leetcode.com/problems/find-the-missing-ids/"
   },
   "1614": {
+    "id": 1614,
     "category": "Stack",
+    "title": "Maximum Nesting Depth of the Parentheses",
     "difficulty": "Easy",
-    "id": 1614,
-    "link": "https://leetcode.com/problems/maximum-nesting-depth-of-the-parentheses/",
-    "title": "Maximum Nesting Depth of the Parentheses"
+    "link": "https://leetcode.com/problems/maximum-nesting-depth-of-the-parentheses/"
   },
   "1615": {
+    "id": 1615,
     "category": "Graph Traversal",
+    "title": "Maximal Network Rank",
     "difficulty": "Medium",
-    "id": 1615,
-    "link": "https://leetcode.com/problems/maximal-network-rank/",
-    "title": "Maximal Network Rank"
+    "link": "https://leetcode.com/problems/maximal-network-rank/"
   },
   "1616": {
+    "id": 1616,
     "category": "Two Pointers",
+    "title": "Split Two Strings to Make Palindrome",
     "difficulty": "Medium",
-    "id": 1616,
-    "link": "https://leetcode.com/problems/split-two-strings-to-make-palindrome/",
-    "title": "Split Two Strings to Make Palindrome"
+    "link": "https://leetcode.com/problems/split-two-strings-to-make-palindrome/"
   },
   "1617": {
+    "id": 1617,
     "category": "Tree",
+    "title": "Count Subtrees With Max Distance Between Cities",
     "difficulty": "Hard",
-    "id": 1617,
-    "link": "https://leetcode.com/problems/count-subtrees-with-max-distance-between-cities/",
-    "title": "Count Subtrees With Max Distance Between Cities"
+    "link": "https://leetcode.com/problems/count-subtrees-with-max-distance-between-cities/"
   },
   "1618": {
+    "id": 1618,
     "category": "Binary Search",
+    "title": "Maximum Font to Fit a Sentence in a Screen",
     "difficulty": "Medium",
-    "id": 1618,
-    "link": "https://leetcode.com/problems/maximum-font-to-fit-a-sentence-in-a-screen/",
-    "title": "Maximum Font to Fit a Sentence in a Screen"
+    "link": "https://leetcode.com/problems/maximum-font-to-fit-a-sentence-in-a-screen/"
   },
   "1619": {
+    "id": 1619,
     "category": "Array & Hashing",
+    "title": "Mean of Array After Removing Some Elements",
     "difficulty": "Easy",
-    "id": 1619,
-    "link": "https://leetcode.com/problems/mean-of-array-after-removing-some-elements/",
-    "title": "Mean of Array After Removing Some Elements"
+    "link": "https://leetcode.com/problems/mean-of-array-after-removing-some-elements/"
   },
   "1620": {
+    "id": 1620,
     "category": "Array & Hashing",
+    "title": "Coordinate With Maximum Network Quality",
     "difficulty": "Medium",
-    "id": 1620,
-    "link": "https://leetcode.com/problems/coordinate-with-maximum-network-quality/",
-    "title": "Coordinate With Maximum Network Quality"
+    "link": "https://leetcode.com/problems/coordinate-with-maximum-network-quality/"
   },
   "1621": {
+    "id": 1621,
     "category": "Dynamic Programming",
+    "title": "Number of Sets of K Non-Overlapping Line Segments",
     "difficulty": "Medium",
-    "id": 1621,
-    "link": "https://leetcode.com/problems/number-of-sets-of-k-non-overlapping-line-segments/",
-    "title": "Number of Sets of K Non-Overlapping Line Segments"
+    "link": "https://leetcode.com/problems/number-of-sets-of-k-non-overlapping-line-segments/"
+  },
+  "1622": {
+    "id": 1622,
+    "category": "Tree",
+    "title": "Fancy Sequence",
+    "difficulty": "Hard",
+    "link": "https://leetcode.com/problems/fancy-sequence/"
   },
-  "1622": {"category": "Tree", "difficulty": "Hard", "id": 1622, "link": "https://leetcode.com/problems/fancy-sequence/", "title": "Fancy Sequence"},
   "1623": {
+    "id": 1623,
     "category": "Database",
+    "title": "All Valid Triplets That Can Represent a Country",
     "difficulty": "Easy",
-    "id": 1623,
-    "link": "https://leetcode.com/problems/all-valid-triplets-that-can-represent-a-country/",
-    "title": "All Valid Triplets That Can Represent a Country"
+    "link": "https://leetcode.com/problems/all-valid-triplets-that-can-represent-a-country/"
   },
   "1624": {
+    "id": 1624,
     "category": "Array & Hashing",
+    "title": "Largest Substring Between Two Equal Characters",
     "difficulty": "Easy",
-    "id": 1624,
-    "link": "https://leetcode.com/problems/largest-substring-between-two-equal-characters/",
-    "title": "Largest Substring Between Two Equal Characters"
+    "link": "https://leetcode.com/problems/largest-substring-between-two-equal-characters/"
   },
   "1625": {
+    "id": 1625,
     "category": "Graph Traversal",
+    "title": "Lexicographically Smallest String After Applying Operations",
     "difficulty": "Medium",
-    "id": 1625,
-    "link": "https://leetcode.com/problems/lexicographically-smallest-string-after-applying-operations/",
-    "title": "Lexicographically Smallest String After Applying Operations"
+    "link": "https://leetcode.com/problems/lexicographically-smallest-string-after-applying-operations/"
   },
   "1626": {
+    "id": 1626,
     "category": "Dynamic Programming",
+    "title": "Best Team With No Conflicts",
     "difficulty": "Medium",
-    "id": 1626,
-    "link": "https://leetcode.com/problems/best-team-with-no-conflicts/",
-    "title": "Best Team With No Conflicts"
+    "link": "https://leetcode.com/problems/best-team-with-no-conflicts/"
   },
   "1627": {
+    "id": 1627,
     "category": "Graph Traversal",
+    "title": "Graph Connectivity With Threshold",
     "difficulty": "Hard",
-    "id": 1627,
-    "link": "https://leetcode.com/problems/graph-connectivity-with-threshold/",
-    "title": "Graph Connectivity With Threshold"
+    "link": "https://leetcode.com/problems/graph-connectivity-with-threshold/"
   },
   "1628": {
+    "id": 1628,
     "category": "Tree",
+    "title": "Design an Expression Tree With Evaluate Function",
     "difficulty": "Medium",
-    "id": 1628,
-    "link": "https://leetcode.com/problems/design-an-expression-tree-with-evaluate-function/",
-    "title": "Design an Expression Tree With Evaluate Function"
+    "link": "https://leetcode.com/problems/design-an-expression-tree-with-evaluate-function/"
   },
   "1629": {
+    "id": 1629,
     "category": "Array & Hashing",
+    "title": "Slowest Key",
     "difficulty": "Easy",
-    "id": 1629,
-    "link": "https://leetcode.com/problems/slowest-key/",
-    "title": "Slowest Key"
+    "link": "https://leetcode.com/problems/slowest-key/"
   },
   "1630": {
+    "id": 1630,
     "category": "Array & Hashing",
+    "title": "Arithmetic Subarrays",
     "difficulty": "Medium",
-    "id": 1630,
-    "link": "https://leetcode.com/problems/arithmetic-subarrays/",
-    "title": "Arithmetic Subarrays"
+    "link": "https://leetcode.com/problems/arithmetic-subarrays/"
   },
   "1631": {
+    "id": 1631,
     "category": "Graph Traversal",
+    "title": "Path With Minimum Effort",
     "difficulty": "Medium",
-    "id": 1631,
-    "link": "https://leetcode.com/problems/path-with-minimum-effort/",
-    "title": "Path With Minimum Effort"
+    "link": "https://leetcode.com/problems/path-with-minimum-effort/"
   },
   "1632": {
+    "id": 1632,
     "category": "Graph Traversal",
+    "title": "Rank Transform of a Matrix",
     "difficulty": "Hard",
-    "id": 1632,
-    "link": "https://leetcode.com/problems/rank-transform-of-a-matrix/",
-    "title": "Rank Transform of a Matrix"
+    "link": "https://leetcode.com/problems/rank-transform-of-a-matrix/"
   },
   "1633": {
+    "id": 1633,
     "category": "Database",
+    "title": "Percentage of Users Attended a Contest",
     "difficulty": "Easy",
-    "id": 1633,
-    "link": "https://leetcode.com/problems/percentage-of-users-attended-a-contest/",
-    "title": "Percentage of Users Attended a Contest"
+    "link": "https://leetcode.com/problems/percentage-of-users-attended-a-contest/"
   },
   "1634": {
+    "id": 1634,
     "category": "Linked List",
+    "title": "Add Two Polynomials Represented as Linked Lists",
     "difficulty": "Medium",
-    "id": 1634,
-    "link": "https://leetcode.com/problems/add-two-polynomials-represented-as-linked-lists/",
-    "title": "Add Two Polynomials Represented as Linked Lists"
+    "link": "https://leetcode.com/problems/add-two-polynomials-represented-as-linked-lists/"
   },
   "1635": {
+    "id": 1635,
     "category": "Database",
+    "title": "Hopper Company Queries I",
     "difficulty": "Hard",
-    "id": 1635,
-    "link": "https://leetcode.com/problems/hopper-company-queries-i/",
-    "title": "Hopper Company Queries I"
+    "link": "https://leetcode.com/problems/hopper-company-queries-i/"
   },
   "1636": {
+    "id": 1636,
     "category": "Array & Hashing",
+    "title": "Sort Array by Increasing Frequency",
     "difficulty": "Easy",
-    "id": 1636,
-    "link": "https://leetcode.com/problems/sort-array-by-increasing-frequency/",
-    "title": "Sort Array by Increasing Frequency"
+    "link": "https://leetcode.com/problems/sort-array-by-increasing-frequency/"
   },
   "1637": {
+    "id": 1637,
     "category": "Array & Hashing",
+    "title": "Widest Vertical Area Between Two Points Containing No Points",
     "difficulty": "Easy",
-    "id": 1637,
-    "link": "https://leetcode.com/problems/widest-vertical-area-between-two-points-containing-no-points/",
-    "title": "Widest Vertical Area Between Two Points Containing No Points"
+    "link": "https://leetcode.com/problems/widest-vertical-area-between-two-points-containing-no-points/"
   },
   "1638": {
+    "id": 1638,
     "category": "Dynamic Programming",
+    "title": "Count Substrings That Differ by One Character",
     "difficulty": "Medium",
-    "id": 1638,
-    "link": "https://leetcode.com/problems/count-substrings-that-differ-by-one-character/",
-    "title": "Count Substrings That Differ by One Character"
+    "link": "https://leetcode.com/problems/count-substrings-that-differ-by-one-character/"
   },
   "1639": {
+    "id": 1639,
     "category": "Dynamic Programming",
+    "title": "Number of Ways to Form a Target String Given a Dictionary",
     "difficulty": "Hard",
-    "id": 1639,
-    "link": "https://leetcode.com/problems/number-of-ways-to-form-a-target-string-given-a-dictionary/",
-    "title": "Number of Ways to Form a Target String Given a Dictionary"
+    "link": "https://leetcode.com/problems/number-of-ways-to-form-a-target-string-given-a-dictionary/"
   },
   "1640": {
+    "id": 1640,
     "category": "Array & Hashing",
+    "title": "Check Array Formation Through Concatenation",
     "difficulty": "Easy",
-    "id": 1640,
-    "link": "https://leetcode.com/problems/check-array-formation-through-concatenation/",
-    "title": "Check Array Formation Through Concatenation"
+    "link": "https://leetcode.com/problems/check-array-formation-through-concatenation/"
   },
   "1641": {
+    "id": 1641,
     "category": "Dynamic Programming",
+    "title": "Count Sorted Vowel Strings",
     "difficulty": "Medium",
-    "id": 1641,
-    "link": "https://leetcode.com/problems/count-sorted-vowel-strings/",
-    "title": "Count Sorted Vowel Strings"
+    "link": "https://leetcode.com/problems/count-sorted-vowel-strings/"
   },
   "1642": {
+    "id": 1642,
     "category": "Heap (Priority Queue)",
+    "title": "Furthest Building You Can Reach",
     "difficulty": "Medium",
-    "id": 1642,
-    "link": "https://leetcode.com/problems/furthest-building-you-can-reach/",
-    "title": "Furthest Building You Can Reach"
+    "link": "https://leetcode.com/problems/furthest-building-you-can-reach/"
   },
   "1643": {
+    "id": 1643,
     "category": "Dynamic Programming",
+    "title": "Kth Smallest Instructions",
     "difficulty": "Hard",
-    "id": 1643,
-    "link": "https://leetcode.com/problems/kth-smallest-instructions/",
-    "title": "Kth Smallest Instructions"
+    "link": "https://leetcode.com/problems/kth-smallest-instructions/"
   },
   "1644": {
+    "id": 1644,
     "category": "Tree",
+    "title": "Lowest Common Ancestor of a Binary Tree II",
     "difficulty": "Medium",
-    "id": 1644,
-    "link": "https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree-ii/",
-    "title": "Lowest Common Ancestor of a Binary Tree II"
+    "link": "https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree-ii/"
   },
   "1645": {
+    "id": 1645,
     "category": "Database",
+    "title": "Hopper Company Queries II",
     "difficulty": "Hard",
-    "id": 1645,
-    "link": "https://leetcode.com/problems/hopper-company-queries-ii/",
-    "title": "Hopper Company Queries II"
+    "link": "https://leetcode.com/problems/hopper-company-queries-ii/"
   },
   "1646": {
+    "id": 1646,
     "category": "Array & Hashing",
+    "title": "Get Maximum in Generated Array",
     "difficulty": "Easy",
-    "id": 1646,
-    "link": "https://leetcode.com/problems/get-maximum-in-generated-array/",
-    "title": "Get Maximum in Generated Array"
+    "link": "https://leetcode.com/problems/get-maximum-in-generated-array/"
   },
   "1647": {
+    "id": 1647,
     "category": "Greedy",
+    "title": "Minimum Deletions to Make Character Frequencies Unique",
     "difficulty": "Medium",
-    "id": 1647,
-    "link": "https://leetcode.com/problems/minimum-deletions-to-make-character-frequencies-unique/",
-    "title": "Minimum Deletions to Make Character Frequencies Unique"
+    "link": "https://leetcode.com/problems/minimum-deletions-to-make-character-frequencies-unique/"
   },
   "1648": {
+    "id": 1648,
     "category": "Binary Search",
+    "title": "Sell Diminishing-Valued Colored Balls",
     "difficulty": "Medium",
-    "id": 1648,
-    "link": "https://leetcode.com/problems/sell-diminishing-valued-colored-balls/",
-    "title": "Sell Diminishing-Valued Colored Balls"
+    "link": "https://leetcode.com/problems/sell-diminishing-valued-colored-balls/"
   },
   "1649": {
+    "id": 1649,
     "category": "Tree",
+    "title": "Create Sorted Array through Instructions",
     "difficulty": "Hard",
-    "id": 1649,
-    "link": "https://leetcode.com/problems/create-sorted-array-through-instructions/",
-    "title": "Create Sorted Array through Instructions"
+    "link": "https://leetcode.com/problems/create-sorted-array-through-instructions/"
   },
   "1650": {
+    "id": 1650,
     "category": "Tree",
+    "title": "Lowest Common Ancestor of a Binary Tree III",
     "difficulty": "Medium",
-    "id": 1650,
-    "link": "https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree-iii/",
-    "title": "Lowest Common Ancestor of a Binary Tree III"
+    "link": "https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree-iii/"
   },
   "1651": {
+    "id": 1651,
     "category": "Database",
+    "title": "Hopper Company Queries III",
     "difficulty": "Hard",
-    "id": 1651,
-    "link": "https://leetcode.com/problems/hopper-company-queries-iii/",
-    "title": "Hopper Company Queries III"
+    "link": "https://leetcode.com/problems/hopper-company-queries-iii/"
   },
   "1652": {
+    "id": 1652,
     "category": "Sliding Window",
+    "title": "Defuse the Bomb",
     "difficulty": "Easy",
-    "id": 1652,
-    "link": "https://leetcode.com/problems/defuse-the-bomb/",
-    "title": "Defuse the Bomb"
+    "link": "https://leetcode.com/problems/defuse-the-bomb/"
   },
   "1653": {
+    "id": 1653,
     "category": "Dynamic Programming",
+    "title": "Minimum Deletions to Make String Balanced",
     "difficulty": "Medium",
-    "id": 1653,
-    "link": "https://leetcode.com/problems/minimum-deletions-to-make-string-balanced/",
-    "title": "Minimum Deletions to Make String Balanced"
+    "link": "https://leetcode.com/problems/minimum-deletions-to-make-string-balanced/"
   },
   "1654": {
+    "id": 1654,
     "category": "Graph Traversal",
+    "title": "Minimum Jumps to Reach Home",
     "difficulty": "Medium",
-    "id": 1654,
-    "link": "https://leetcode.com/problems/minimum-jumps-to-reach-home/",
-    "title": "Minimum Jumps to Reach Home"
+    "link": "https://leetcode.com/problems/minimum-jumps-to-reach-home/"
   },
   "1655": {
+    "id": 1655,
     "category": "Dynamic Programming",
+    "title": "Distribute Repeating Integers",
     "difficulty": "Hard",
-    "id": 1655,
-    "link": "https://leetcode.com/problems/distribute-repeating-integers/",
-    "title": "Distribute Repeating Integers"
+    "link": "https://leetcode.com/problems/distribute-repeating-integers/"
   },
   "1656": {
+    "id": 1656,
     "category": "Array & Hashing",
+    "title": "Design an Ordered Stream",
     "difficulty": "Easy",
-    "id": 1656,
-    "link": "https://leetcode.com/problems/design-an-ordered-stream/",
-    "title": "Design an Ordered Stream"
+    "link": "https://leetcode.com/problems/design-an-ordered-stream/"
   },
   "1657": {
+    "id": 1657,
     "category": "Array & Hashing",
+    "title": "Determine if Two Strings Are Close",
     "difficulty": "Medium",
-    "id": 1657,
-    "link": "https://leetcode.com/problems/determine-if-two-strings-are-close/",
-    "title": "Determine if Two Strings Are Close"
+    "link": "https://leetcode.com/problems/determine-if-two-strings-are-close/"
   },
   "1658": {
+    "id": 1658,
     "category": "Sliding Window",
+    "title": "Minimum Operations to Reduce X to Zero",
     "difficulty": "Medium",
-    "id": 1658,
-    "link": "https://leetcode.com/problems/minimum-operations-to-reduce-x-to-zero/",
-    "title": "Minimum Operations to Reduce X to Zero"
+    "link": "https://leetcode.com/problems/minimum-operations-to-reduce-x-to-zero/"
   },
   "1659": {
+    "id": 1659,
     "category": "Dynamic Programming",
+    "title": "Maximize Grid Happiness",
     "difficulty": "Hard",
-    "id": 1659,
-    "link": "https://leetcode.com/problems/maximize-grid-happiness/",
-    "title": "Maximize Grid Happiness"
+    "link": "https://leetcode.com/problems/maximize-grid-happiness/"
   },
   "1660": {
+    "id": 1660,
     "category": "Tree",
+    "title": "Correct a Binary Tree",
     "difficulty": "Medium",
-    "id": 1660,
-    "link": "https://leetcode.com/problems/correct-a-binary-tree/",
-    "title": "Correct a Binary Tree"
+    "link": "https://leetcode.com/problems/correct-a-binary-tree/"
   },
   "1661": {
+    "id": 1661,
     "category": "Database",
+    "title": "Average Time of Process per Machine",
     "difficulty": "Easy",
-    "id": 1661,
-    "link": "https://leetcode.com/problems/average-time-of-process-per-machine/",
-    "title": "Average Time of Process per Machine"
+    "link": "https://leetcode.com/problems/average-time-of-process-per-machine/"
   },
   "1662": {
+    "id": 1662,
     "category": "Array & Hashing",
+    "title": "Check If Two String Arrays are Equivalent",
     "difficulty": "Easy",
-    "id": 1662,
-    "link": "https://leetcode.com/problems/check-if-two-string-arrays-are-equivalent/",
-    "title": "Check If Two String Arrays are Equivalent"
+    "link": "https://leetcode.com/problems/check-if-two-string-arrays-are-equivalent/"
   },
   "1663": {
+    "id": 1663,
     "category": "Greedy",
+    "title": "Smallest String With A Given Numeric Value",
     "difficulty": "Medium",
-    "id": 1663,
-    "link": "https://leetcode.com/problems/smallest-string-with-a-given-numeric-value/",
-    "title": "Smallest String With A Given Numeric Value"
+    "link": "https://leetcode.com/problems/smallest-string-with-a-given-numeric-value/"
   },
   "1664": {
+    "id": 1664,
     "category": "Array & Hashing",
+    "title": "Ways to Make a Fair Array",
     "difficulty": "Medium",
-    "id": 1664,
-    "link": "https://leetcode.com/problems/ways-to-make-a-fair-array/",
-    "title": "Ways to Make a Fair Array"
+    "link": "https://leetcode.com/problems/ways-to-make-a-fair-array/"
   },
   "1665": {
+    "id": 1665,
     "category": "Greedy",
+    "title": "Minimum Initial Energy to Finish Tasks",
     "difficulty": "Hard",
-    "id": 1665,
-    "link": "https://leetcode.com/problems/minimum-initial-energy-to-finish-tasks/",
-    "title": "Minimum Initial Energy to Finish Tasks"
+    "link": "https://leetcode.com/problems/minimum-initial-energy-to-finish-tasks/"
   },
   "1666": {
+    "id": 1666,
     "category": "Tree",
+    "title": "Change the Root of a Binary Tree",
     "difficulty": "Medium",
-    "id": 1666,
-    "link": "https://leetcode.com/problems/change-the-root-of-a-binary-tree/",
-    "title": "Change the Root of a Binary Tree"
+    "link": "https://leetcode.com/problems/change-the-root-of-a-binary-tree/"
   },
   "1667": {
+    "id": 1667,
     "category": "Database",
+    "title": "Fix Names in a Table",
     "difficulty": "Easy",
-    "id": 1667,
-    "link": "https://leetcode.com/problems/fix-names-in-a-table/",
-    "title": "Fix Names in a Table"
+    "link": "https://leetcode.com/problems/fix-names-in-a-table/"
   },
   "1668": {
+    "id": 1668,
     "category": "Dynamic Programming",
+    "title": "Maximum Repeating Substring",
     "difficulty": "Easy",
-    "id": 1668,
-    "link": "https://leetcode.com/problems/maximum-repeating-substring/",
-    "title": "Maximum Repeating Substring"
+    "link": "https://leetcode.com/problems/maximum-repeating-substring/"
   },
   "1669": {
+    "id": 1669,
     "category": "Linked List",
+    "title": "Merge In Between Linked Lists",
     "difficulty": "Medium",
-    "id": 1669,
-    "link": "https://leetcode.com/problems/merge-in-between-linked-lists/",
-    "title": "Merge In Between Linked Lists"
+    "link": "https://leetcode.com/problems/merge-in-between-linked-lists/"
   },
   "1670": {
+    "id": 1670,
     "category": "Linked List",
+    "title": "Design Front Middle Back Queue",
     "difficulty": "Medium",
-    "id": 1670,
-    "link": "https://leetcode.com/problems/design-front-middle-back-queue/",
-    "title": "Design Front Middle Back Queue"
+    "link": "https://leetcode.com/problems/design-front-middle-back-queue/"
   },
   "1671": {
+    "id": 1671,
     "category": "Dynamic Programming",
+    "title": "Minimum Number of Removals to Make Mountain Array",
     "difficulty": "Hard",
-    "id": 1671,
-    "link": "https://leetcode.com/problems/minimum-number-of-removals-to-make-mountain-array/",
-    "title": "Minimum Number of Removals to Make Mountain Array"
+    "link": "https://leetcode.com/problems/minimum-number-of-removals-to-make-mountain-array/"
   },
   "1672": {
+    "id": 1672,
     "category": "Array & Hashing",
+    "title": "Richest Customer Wealth",
     "difficulty": "Easy",
-    "id": 1672,
-    "link": "https://leetcode.com/problems/richest-customer-wealth/",
-    "title": "Richest Customer Wealth"
+    "link": "https://leetcode.com/problems/richest-customer-wealth/"
   },
   "1673": {
+    "id": 1673,
     "category": "Stack",
+    "title": "Find the Most Competitive Subsequence",
     "difficulty": "Medium",
-    "id": 1673,
-    "link": "https://leetcode.com/problems/find-the-most-competitive-subsequence/",
-    "title": "Find the Most Competitive Subsequence"
+    "link": "https://leetcode.com/problems/find-the-most-competitive-subsequence/"
   },
   "1674": {
+    "id": 1674,
     "category": "Array & Hashing",
+    "title": "Minimum Moves to Make Array Complementary",
     "difficulty": "Medium",
-    "id": 1674,
-    "link": "https://leetcode.com/problems/minimum-moves-to-make-array-complementary/",
-    "title": "Minimum Moves to Make Array Complementary"
+    "link": "https://leetcode.com/problems/minimum-moves-to-make-array-complementary/"
   },
   "1675": {
+    "id": 1675,
     "category": "Heap (Priority Queue)",
+    "title": "Minimize Deviation in Array",
     "difficulty": "Hard",
-    "id": 1675,
-    "link": "https://leetcode.com/problems/minimize-deviation-in-array/",
-    "title": "Minimize Deviation in Array"
+    "link": "https://leetcode.com/problems/minimize-deviation-in-array/"
   },
   "1676": {
+    "id": 1676,
     "category": "Tree",
+    "title": "Lowest Common Ancestor of a Binary Tree IV",
     "difficulty": "Medium",
-    "id": 1676,
-    "link": "https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree-iv/",
-    "title": "Lowest Common Ancestor of a Binary Tree IV"
+    "link": "https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree-iv/"
   },
   "1677": {
+    "id": 1677,
     "category": "Database",
+    "title": "Product's Worth Over Invoices",
     "difficulty": "Easy",
-    "id": 1677,
-    "link": "https://leetcode.com/problems/products-worth-over-invoices/",
-    "title": "Product's Worth Over Invoices"
+    "link": "https://leetcode.com/problems/products-worth-over-invoices/"
   },
   "1678": {
+    "id": 1678,
     "category": "Array & Hashing",
+    "title": "Goal Parser Interpretation",
     "difficulty": "Easy",
-    "id": 1678,
-    "link": "https://leetcode.com/problems/goal-parser-interpretation/",
-    "title": "Goal Parser Interpretation"
+    "link": "https://leetcode.com/problems/goal-parser-interpretation/"
   },
   "1679": {
+    "id": 1679,
     "category": "Two Pointers",
+    "title": "Max Number of K-Sum Pairs",
     "difficulty": "Medium",
-    "id": 1679,
-    "link": "https://leetcode.com/problems/max-number-of-k-sum-pairs/",
-    "title": "Max Number of K-Sum Pairs"
+    "link": "https://leetcode.com/problems/max-number-of-k-sum-pairs/"
   },
   "1680": {
+    "id": 1680,
     "category": "Bit Manipulation",
+    "title": "Concatenation of Consecutive Binary Numbers",
     "difficulty": "Medium",
-    "id": 1680,
-    "link": "https://leetcode.com/problems/concatenation-of-consecutive-binary-numbers/",
-    "title": "Concatenation of Consecutive Binary Numbers"
+    "link": "https://leetcode.com/problems/concatenation-of-consecutive-binary-numbers/"
   },
   "1681": {
+    "id": 1681,
     "category": "Dynamic Programming",
+    "title": "Minimum Incompatibility",
     "difficulty": "Hard",
-    "id": 1681,
-    "link": "https://leetcode.com/problems/minimum-incompatibility/",
-    "title": "Minimum Incompatibility"
+    "link": "https://leetcode.com/problems/minimum-incompatibility/"
   },
   "1682": {
+    "id": 1682,
     "category": "Dynamic Programming",
+    "title": "Longest Palindromic Subsequence II",
     "difficulty": "Medium",
-    "id": 1682,
-    "link": "https://leetcode.com/problems/longest-palindromic-subsequence-ii/",
-    "title": "Longest Palindromic Subsequence II"
+    "link": "https://leetcode.com/problems/longest-palindromic-subsequence-ii/"
   },
   "1683": {
+    "id": 1683,
     "category": "Database",
+    "title": "Invalid Tweets",
     "difficulty": "Easy",
-    "id": 1683,
-    "link": "https://leetcode.com/problems/invalid-tweets/",
-    "title": "Invalid Tweets"
+    "link": "https://leetcode.com/problems/invalid-tweets/"
   },
   "1684": {
+    "id": 1684,
     "category": "Bit Manipulation",
+    "title": "Count the Number of Consistent Strings",
     "difficulty": "Easy",
-    "id": 1684,
-    "link": "https://leetcode.com/problems/count-the-number-of-consistent-strings/",
-    "title": "Count the Number of Consistent Strings"
+    "link": "https://leetcode.com/problems/count-the-number-of-consistent-strings/"
   },
   "1685": {
+    "id": 1685,
     "category": "Math & Geometry",
+    "title": "Sum of Absolute Differences in a Sorted Array",
     "difficulty": "Medium",
-    "id": 1685,
-    "link": "https://leetcode.com/problems/sum-of-absolute-differences-in-a-sorted-array/",
-    "title": "Sum of Absolute Differences in a Sorted Array"
+    "link": "https://leetcode.com/problems/sum-of-absolute-differences-in-a-sorted-array/"
   },
   "1686": {
+    "id": 1686,
     "category": "Heap (Priority Queue)",
+    "title": "Stone Game VI",
     "difficulty": "Medium",
-    "id": 1686,
-    "link": "https://leetcode.com/problems/stone-game-vi/",
-    "title": "Stone Game VI"
+    "link": "https://leetcode.com/problems/stone-game-vi/"
   },
   "1687": {
+    "id": 1687,
     "category": "Tree",
+    "title": "Delivering Boxes from Storage to Ports",
     "difficulty": "Hard",
-    "id": 1687,
-    "link": "https://leetcode.com/problems/delivering-boxes-from-storage-to-ports/",
-    "title": "Delivering Boxes from Storage to Ports"
+    "link": "https://leetcode.com/problems/delivering-boxes-from-storage-to-ports/"
   },
   "1688": {
+    "id": 1688,
     "category": "Math & Geometry",
+    "title": "Count of Matches in Tournament",
     "difficulty": "Easy",
-    "id": 1688,
-    "link": "https://leetcode.com/problems/count-of-matches-in-tournament/",
-    "title": "Count of Matches in Tournament"
+    "link": "https://leetcode.com/problems/count-of-matches-in-tournament/"
   },
   "1689": {
+    "id": 1689,
     "category": "Greedy",
+    "title": "Partitioning Into Minimum Number Of Deci-Binary Numbers",
     "difficulty": "Medium",
-    "id": 1689,
-    "link": "https://leetcode.com/problems/partitioning-into-minimum-number-of-deci-binary-numbers/",
-    "title": "Partitioning Into Minimum Number Of Deci-Binary Numbers"
+    "link": "https://leetcode.com/problems/partitioning-into-minimum-number-of-deci-binary-numbers/"
   },
   "1690": {
+    "id": 1690,
     "category": "Dynamic Programming",
+    "title": "Stone Game VII",
     "difficulty": "Medium",
-    "id": 1690,
-    "link": "https://leetcode.com/problems/stone-game-vii/",
-    "title": "Stone Game VII"
+    "link": "https://leetcode.com/problems/stone-game-vii/"
   },
   "1691": {
+    "id": 1691,
     "category": "Dynamic Programming",
+    "title": "Maximum Height by Stacking Cuboids ",
     "difficulty": "Hard",
-    "id": 1691,
-    "link": "https://leetcode.com/problems/maximum-height-by-stacking-cuboids/",
-    "title": "Maximum Height by Stacking Cuboids "
+    "link": "https://leetcode.com/problems/maximum-height-by-stacking-cuboids/"
   },
   "1692": {
+    "id": 1692,
     "category": "Dynamic Programming",
+    "title": "Count Ways to Distribute Candies",
     "difficulty": "Hard",
-    "id": 1692,
-    "link": "https://leetcode.com/problems/count-ways-to-distribute-candies/",
-    "title": "Count Ways to Distribute Candies"
+    "link": "https://leetcode.com/problems/count-ways-to-distribute-candies/"
   },
   "1693": {
+    "id": 1693,
     "category": "Database",
+    "title": "Daily Leads and Partners",
     "difficulty": "Easy",
-    "id": 1693,
-    "link": "https://leetcode.com/problems/daily-leads-and-partners/",
-    "title": "Daily Leads and Partners"
+    "link": "https://leetcode.com/problems/daily-leads-and-partners/"
   },
   "1694": {
+    "id": 1694,
     "category": "Array & Hashing",
+    "title": "Reformat Phone Number",
     "difficulty": "Easy",
-    "id": 1694,
-    "link": "https://leetcode.com/problems/reformat-phone-number/",
-    "title": "Reformat Phone Number"
+    "link": "https://leetcode.com/problems/reformat-phone-number/"
   },
   "1695": {
+    "id": 1695,
     "category": "Sliding Window",
+    "title": "Maximum Erasure Value",
     "difficulty": "Medium",
-    "id": 1695,
-    "link": "https://leetcode.com/problems/maximum-erasure-value/",
-    "title": "Maximum Erasure Value"
+    "link": "https://leetcode.com/problems/maximum-erasure-value/"
   },
   "1696": {
+    "id": 1696,
     "category": "Dynamic Programming",
+    "title": "Jump Game VI",
     "difficulty": "Medium",
-    "id": 1696,
-    "link": "https://leetcode.com/problems/jump-game-vi/",
-    "title": "Jump Game VI"
+    "link": "https://leetcode.com/problems/jump-game-vi/"
   },
   "1697": {
+    "id": 1697,
     "category": "Graph Traversal",
+    "title": "Checking Existence of Edge Length Limited Paths",
     "difficulty": "Hard",
-    "id": 1697,
-    "link": "https://leetcode.com/problems/checking-existence-of-edge-length-limited-paths/",
-    "title": "Checking Existence of Edge Length Limited Paths"
+    "link": "https://leetcode.com/problems/checking-existence-of-edge-length-limited-paths/"
   },
   "1698": {
+    "id": 1698,
     "category": "Trie",
+    "title": "Number of Distinct Substrings in a String",
     "difficulty": "Medium",
-    "id": 1698,
-    "link": "https://leetcode.com/problems/number-of-distinct-substrings-in-a-string/",
-    "title": "Number of Distinct Substrings in a String"
+    "link": "https://leetcode.com/problems/number-of-distinct-substrings-in-a-string/"
   },
   "1699": {
+    "id": 1699,
     "category": "Database",
+    "title": "Number of Calls Between Two Persons",
     "difficulty": "Medium",
-    "id": 1699,
-    "link": "https://leetcode.com/problems/number-of-calls-between-two-persons/",
-    "title": "Number of Calls Between Two Persons"
+    "link": "https://leetcode.com/problems/number-of-calls-between-two-persons/"
   },
   "1700": {
+    "id": 1700,
     "category": "Stack",
+    "title": "Number of Students Unable to Eat Lunch",
     "difficulty": "Easy",
-    "id": 1700,
-    "link": "https://leetcode.com/problems/number-of-students-unable-to-eat-lunch/",
-    "title": "Number of Students Unable to Eat Lunch"
+    "link": "https://leetcode.com/problems/number-of-students-unable-to-eat-lunch/"
   },
   "1701": {
+    "id": 1701,
     "category": "Array & Hashing",
+    "title": "Average Waiting Time",
     "difficulty": "Medium",
-    "id": 1701,
-    "link": "https://leetcode.com/problems/average-waiting-time/",
-    "title": "Average Waiting Time"
+    "link": "https://leetcode.com/problems/average-waiting-time/"
   },
   "1702": {
+    "id": 1702,
     "category": "Greedy",
+    "title": "Maximum Binary String After Change",
     "difficulty": "Medium",
-    "id": 1702,
-    "link": "https://leetcode.com/problems/maximum-binary-string-after-change/",
-    "title": "Maximum Binary String After Change"
+    "link": "https://leetcode.com/problems/maximum-binary-string-after-change/"
   },
   "1703": {
+    "id": 1703,
     "category": "Sliding Window",
+    "title": "Minimum Adjacent Swaps for K Consecutive Ones",
     "difficulty": "Hard",
-    "id": 1703,
-    "link": "https://leetcode.com/problems/minimum-adjacent-swaps-for-k-consecutive-ones/",
-    "title": "Minimum Adjacent Swaps for K Consecutive Ones"
+    "link": "https://leetcode.com/problems/minimum-adjacent-swaps-for-k-consecutive-ones/"
   },
   "1704": {
+    "id": 1704,
     "category": "Array & Hashing",
+    "title": "Determine if String Halves Are Alike",
     "difficulty": "Easy",
-    "id": 1704,
-    "link": "https://leetcode.com/problems/determine-if-string-halves-are-alike/",
-    "title": "Determine if String Halves Are Alike"
+    "link": "https://leetcode.com/problems/determine-if-string-halves-are-alike/"
   },
   "1705": {
+    "id": 1705,
     "category": "Heap (Priority Queue)",
+    "title": "Maximum Number of Eaten Apples",
     "difficulty": "Medium",
-    "id": 1705,
-    "link": "https://leetcode.com/problems/maximum-number-of-eaten-apples/",
-    "title": "Maximum Number of Eaten Apples"
+    "link": "https://leetcode.com/problems/maximum-number-of-eaten-apples/"
   },
   "1706": {
+    "id": 1706,
     "category": "Array & Hashing",
+    "title": "Where Will the Ball Fall",
     "difficulty": "Medium",
-    "id": 1706,
-    "link": "https://leetcode.com/problems/where-will-the-ball-fall/",
-    "title": "Where Will the Ball Fall"
+    "link": "https://leetcode.com/problems/where-will-the-ball-fall/"
   },
   "1707": {
+    "id": 1707,
     "category": "Trie",
+    "title": "Maximum XOR With an Element From Array",
     "difficulty": "Hard",
-    "id": 1707,
-    "link": "https://leetcode.com/problems/maximum-xor-with-an-element-from-array/",
-    "title": "Maximum XOR With an Element From Array"
+    "link": "https://leetcode.com/problems/maximum-xor-with-an-element-from-array/"
   },
   "1708": {
+    "id": 1708,
     "category": "Greedy",
+    "title": "Largest Subarray Length K",
     "difficulty": "Easy",
-    "id": 1708,
-    "link": "https://leetcode.com/problems/largest-subarray-length-k/",
-    "title": "Largest Subarray Length K"
+    "link": "https://leetcode.com/problems/largest-subarray-length-k/"
   },
   "1709": {
+    "id": 1709,
     "category": "Database",
+    "title": "Biggest Window Between Visits",
     "difficulty": "Medium",
-    "id": 1709,
-    "link": "https://leetcode.com/problems/biggest-window-between-visits/",
-    "title": "Biggest Window Between Visits"
+    "link": "https://leetcode.com/problems/biggest-window-between-visits/"
   },
   "1710": {
+    "id": 1710,
     "category": "Greedy",
+    "title": "Maximum Units on a Truck",
     "difficulty": "Easy",
-    "id": 1710,
-    "link": "https://leetcode.com/problems/maximum-units-on-a-truck/",
-    "title": "Maximum Units on a Truck"
+    "link": "https://leetcode.com/problems/maximum-units-on-a-truck/"
   },
   "1711": {
+    "id": 1711,
     "category": "Array & Hashing",
+    "title": "Count Good Meals",
     "difficulty": "Medium",
-    "id": 1711,
-    "link": "https://leetcode.com/problems/count-good-meals/",
-    "title": "Count Good Meals"
+    "link": "https://leetcode.com/problems/count-good-meals/"
   },
   "1712": {
+    "id": 1712,
     "category": "Binary Search",
+    "title": "Ways to Split Array Into Three Subarrays",
     "difficulty": "Medium",
-    "id": 1712,
-    "link": "https://leetcode.com/problems/ways-to-split-array-into-three-subarrays/",
-    "title": "Ways to Split Array Into Three Subarrays"
+    "link": "https://leetcode.com/problems/ways-to-split-array-into-three-subarrays/"
   },
   "1713": {
+    "id": 1713,
     "category": "Binary Search",
+    "title": "Minimum Operations to Make a Subsequence",
     "difficulty": "Hard",
-    "id": 1713,
-    "link": "https://leetcode.com/problems/minimum-operations-to-make-a-subsequence/",
-    "title": "Minimum Operations to Make a Subsequence"
+    "link": "https://leetcode.com/problems/minimum-operations-to-make-a-subsequence/"
   },
   "1714": {
+    "id": 1714,
     "category": "Dynamic Programming",
+    "title": "Sum Of Special Evenly-Spaced Elements In Array",
     "difficulty": "Hard",
-    "id": 1714,
-    "link": "https://leetcode.com/problems/sum-of-special-evenly-spaced-elements-in-array/",
-    "title": "Sum Of Special Evenly-Spaced Elements In Array"
+    "link": "https://leetcode.com/problems/sum-of-special-evenly-spaced-elements-in-array/"
   },
   "1715": {
+    "id": 1715,
     "category": "Database",
+    "title": "Count Apples and Oranges",
     "difficulty": "Medium",
-    "id": 1715,
-    "link": "https://leetcode.com/problems/count-apples-and-oranges/",
-    "title": "Count Apples and Oranges"
+    "link": "https://leetcode.com/problems/count-apples-and-oranges/"
   },
   "1716": {
+    "id": 1716,
     "category": "Math & Geometry",
+    "title": "Calculate Money in Leetcode Bank",
     "difficulty": "Easy",
-    "id": 1716,
-    "link": "https://leetcode.com/problems/calculate-money-in-leetcode-bank/",
-    "title": "Calculate Money in Leetcode Bank"
+    "link": "https://leetcode.com/problems/calculate-money-in-leetcode-bank/"
   },
   "1717": {
+    "id": 1717,
     "category": "Stack",
+    "title": "Maximum Score From Removing Substrings",
     "difficulty": "Medium",
-    "id": 1717,
-    "link": "https://leetcode.com/problems/maximum-score-from-removing-substrings/",
-    "title": "Maximum Score From Removing Substrings"
+    "link": "https://leetcode.com/problems/maximum-score-from-removing-substrings/"
   },
   "1718": {
+    "id": 1718,
     "category": "Backtracking",
+    "title": "Construct the Lexicographically Largest Valid Sequence",
     "difficulty": "Medium",
-    "id": 1718,
-    "link": "https://leetcode.com/problems/construct-the-lexicographically-largest-valid-sequence/",
-    "title": "Construct the Lexicographically Largest Valid Sequence"
+    "link": "https://leetcode.com/problems/construct-the-lexicographically-largest-valid-sequence/"
   },
   "1719": {
+    "id": 1719,
     "category": "Tree",
+    "title": "Number Of Ways To Reconstruct A Tree",
     "difficulty": "Hard",
-    "id": 1719,
-    "link": "https://leetcode.com/problems/number-of-ways-to-reconstruct-a-tree/",
-    "title": "Number Of Ways To Reconstruct A Tree"
+    "link": "https://leetcode.com/problems/number-of-ways-to-reconstruct-a-tree/"
   },
   "1720": {
+    "id": 1720,
     "category": "Bit Manipulation",
+    "title": "Decode XORed Array",
     "difficulty": "Easy",
-    "id": 1720,
-    "link": "https://leetcode.com/problems/decode-xored-array/",
-    "title": "Decode XORed Array"
+    "link": "https://leetcode.com/problems/decode-xored-array/"
   },
   "1721": {
+    "id": 1721,
     "category": "Linked List",
+    "title": "Swapping Nodes in a Linked List",
     "difficulty": "Medium",
-    "id": 1721,
-    "link": "https://leetcode.com/problems/swapping-nodes-in-a-linked-list/",
-    "title": "Swapping Nodes in a Linked List"
+    "link": "https://leetcode.com/problems/swapping-nodes-in-a-linked-list/"
   },
   "1722": {
+    "id": 1722,
     "category": "Graph Traversal",
+    "title": "Minimize Hamming Distance After Swap Operations",
     "difficulty": "Medium",
-    "id": 1722,
-    "link": "https://leetcode.com/problems/minimize-hamming-distance-after-swap-operations/",
-    "title": "Minimize Hamming Distance After Swap Operations"
+    "link": "https://leetcode.com/problems/minimize-hamming-distance-after-swap-operations/"
   },
   "1723": {
+    "id": 1723,
     "category": "Dynamic Programming",
+    "title": "Find Minimum Time to Finish All Jobs",
     "difficulty": "Hard",
-    "id": 1723,
-    "link": "https://leetcode.com/problems/find-minimum-time-to-finish-all-jobs/",
-    "title": "Find Minimum Time to Finish All Jobs"
+    "link": "https://leetcode.com/problems/find-minimum-time-to-finish-all-jobs/"
   },
   "1724": {
+    "id": 1724,
     "category": "Tree",
+    "title": "Checking Existence of Edge Length Limited Paths II",
     "difficulty": "Hard",
-    "id": 1724,
-    "link": "https://leetcode.com/problems/checking-existence-of-edge-length-limited-paths-ii/",
-    "title": "Checking Existence of Edge Length Limited Paths II"
+    "link": "https://leetcode.com/problems/checking-existence-of-edge-length-limited-paths-ii/"
   },
   "1725": {
+    "id": 1725,
     "category": "Array & Hashing",
+    "title": "Number Of Rectangles That Can Form The Largest Square",
     "difficulty": "Easy",
-    "id": 1725,
-    "link": "https://leetcode.com/problems/number-of-rectangles-that-can-form-the-largest-square/",
-    "title": "Number Of Rectangles That Can Form The Largest Square"
+    "link": "https://leetcode.com/problems/number-of-rectangles-that-can-form-the-largest-square/"
   },
   "1726": {
+    "id": 1726,
     "category": "Array & Hashing",
+    "title": "Tuple with Same Product",
     "difficulty": "Medium",
-    "id": 1726,
-    "link": "https://leetcode.com/problems/tuple-with-same-product/",
-    "title": "Tuple with Same Product"
+    "link": "https://leetcode.com/problems/tuple-with-same-product/"
   },
   "1727": {
+    "id": 1727,
     "category": "Greedy",
+    "title": "Largest Submatrix With Rearrangements",
     "difficulty": "Medium",
-    "id": 1727,
-    "link": "https://leetcode.com/problems/largest-submatrix-with-rearrangements/",
-    "title": "Largest Submatrix With Rearrangements"
+    "link": "https://leetcode.com/problems/largest-submatrix-with-rearrangements/"
   },
   "1728": {
+    "id": 1728,
     "category": "Graph Traversal",
+    "title": "Cat and Mouse II",
     "difficulty": "Hard",
-    "id": 1728,
-    "link": "https://leetcode.com/problems/cat-and-mouse-ii/",
-    "title": "Cat and Mouse II"
+    "link": "https://leetcode.com/problems/cat-and-mouse-ii/"
   },
   "1729": {
+    "id": 1729,
     "category": "Database",
+    "title": "Find Followers Count",
     "difficulty": "Easy",
-    "id": 1729,
-    "link": "https://leetcode.com/problems/find-followers-count/",
-    "title": "Find Followers Count"
+    "link": "https://leetcode.com/problems/find-followers-count/"
   },
   "1730": {
+    "id": 1730,
     "category": "Graph Traversal",
+    "title": "Shortest Path to Get Food",
     "difficulty": "Medium",
-    "id": 1730,
-    "link": "https://leetcode.com/problems/shortest-path-to-get-food/",
-    "title": "Shortest Path to Get Food"
+    "link": "https://leetcode.com/problems/shortest-path-to-get-food/"
   },
   "1731": {
+    "id": 1731,
     "category": "Database",
+    "title": "The Number of Employees Which Report to Each Employee",
     "difficulty": "Easy",
-    "id": 1731,
-    "link": "https://leetcode.com/problems/the-number-of-employees-which-report-to-each-employee/",
-    "title": "The Number of Employees Which Report to Each Employee"
+    "link": "https://leetcode.com/problems/the-number-of-employees-which-report-to-each-employee/"
   },
   "1732": {
+    "id": 1732,
     "category": "Array & Hashing",
+    "title": "Find the Highest Altitude",
     "difficulty": "Easy",
-    "id": 1732,
-    "link": "https://leetcode.com/problems/find-the-highest-altitude/",
-    "title": "Find the Highest Altitude"
+    "link": "https://leetcode.com/problems/find-the-highest-altitude/"
   },
   "1733": {
+    "id": 1733,
     "category": "Greedy",
+    "title": "Minimum Number of People to Teach",
     "difficulty": "Medium",
-    "id": 1733,
-    "link": "https://leetcode.com/problems/minimum-number-of-people-to-teach/",
-    "title": "Minimum Number of People to Teach"
+    "link": "https://leetcode.com/problems/minimum-number-of-people-to-teach/"
   },
   "1734": {
+    "id": 1734,
     "category": "Bit Manipulation",
+    "title": "Decode XORed Permutation",
     "difficulty": "Medium",
-    "id": 1734,
-    "link": "https://leetcode.com/problems/decode-xored-permutation/",
-    "title": "Decode XORed Permutation"
+    "link": "https://leetcode.com/problems/decode-xored-permutation/"
   },
   "1735": {
+    "id": 1735,
     "category": "Dynamic Programming",
+    "title": "Count Ways to Make Array With Product",
     "difficulty": "Hard",
-    "id": 1735,
-    "link": "https://leetcode.com/problems/count-ways-to-make-array-with-product/",
-    "title": "Count Ways to Make Array With Product"
+    "link": "https://leetcode.com/problems/count-ways-to-make-array-with-product/"
   },
   "1736": {
+    "id": 1736,
     "category": "Greedy",
+    "title": "Latest Time by Replacing Hidden Digits",
     "difficulty": "Easy",
-    "id": 1736,
-    "link": "https://leetcode.com/problems/latest-time-by-replacing-hidden-digits/",
-    "title": "Latest Time by Replacing Hidden Digits"
+    "link": "https://leetcode.com/problems/latest-time-by-replacing-hidden-digits/"
   },
   "1737": {
+    "id": 1737,
     "category": "Array & Hashing",
+    "title": "Change Minimum Characters to Satisfy One of Three Conditions",
     "difficulty": "Medium",
-    "id": 1737,
-    "link": "https://leetcode.com/problems/change-minimum-characters-to-satisfy-one-of-three-conditions/",
-    "title": "Change Minimum Characters to Satisfy One of Three Conditions"
+    "link": "https://leetcode.com/problems/change-minimum-characters-to-satisfy-one-of-three-conditions/"
   },
   "1738": {
+    "id": 1738,
     "category": "Heap (Priority Queue)",
+    "title": "Find Kth Largest XOR Coordinate Value",
     "difficulty": "Medium",
-    "id": 1738,
-    "link": "https://leetcode.com/problems/find-kth-largest-xor-coordinate-value/",
-    "title": "Find Kth Largest XOR Coordinate Value"
+    "link": "https://leetcode.com/problems/find-kth-largest-xor-coordinate-value/"
   },
   "1739": {
+    "id": 1739,
     "category": "Binary Search",
+    "title": "Building Boxes",
     "difficulty": "Hard",
-    "id": 1739,
-    "link": "https://leetcode.com/problems/building-boxes/",
-    "title": "Building Boxes"
+    "link": "https://leetcode.com/problems/building-boxes/"
   },
   "1740": {
+    "id": 1740,
     "category": "Tree",
+    "title": "Find Distance in a Binary Tree",
     "difficulty": "Medium",
-    "id": 1740,
-    "link": "https://leetcode.com/problems/find-distance-in-a-binary-tree/",
-    "title": "Find Distance in a Binary Tree"
+    "link": "https://leetcode.com/problems/find-distance-in-a-binary-tree/"
   },
   "1741": {
+    "id": 1741,
     "category": "Database",
+    "title": "Find Total Time Spent by Each Employee",
     "difficulty": "Easy",
-    "id": 1741,
-    "link": "https://leetcode.com/problems/find-total-time-spent-by-each-employee/",
-    "title": "Find Total Time Spent by Each Employee"
+    "link": "https://leetcode.com/problems/find-total-time-spent-by-each-employee/"
   },
   "1742": {
+    "id": 1742,
     "category": "Math & Geometry",
+    "title": "Maximum Number of Balls in a Box",
     "difficulty": "Easy",
-    "id": 1742,
-    "link": "https://leetcode.com/problems/maximum-number-of-balls-in-a-box/",
-    "title": "Maximum Number of Balls in a Box"
+    "link": "https://leetcode.com/problems/maximum-number-of-balls-in-a-box/"
   },
   "1743": {
+    "id": 1743,
     "category": "Graph Traversal",
+    "title": "Restore the Array From Adjacent Pairs",
     "difficulty": "Medium",
-    "id": 1743,
-    "link": "https://leetcode.com/problems/restore-the-array-from-adjacent-pairs/",
-    "title": "Restore the Array From Adjacent Pairs"
+    "link": "https://leetcode.com/problems/restore-the-array-from-adjacent-pairs/"
   },
   "1744": {
+    "id": 1744,
     "category": "Array & Hashing",
+    "title": "Can You Eat Your Favorite Candy on Your Favorite Day?",
     "difficulty": "Medium",
-    "id": 1744,
-    "link": "https://leetcode.com/problems/can-you-eat-your-favorite-candy-on-your-favorite-day/",
-    "title": "Can You Eat Your Favorite Candy on Your Favorite Day?"
+    "link": "https://leetcode.com/problems/can-you-eat-your-favorite-candy-on-your-favorite-day/"
   },
   "1745": {
+    "id": 1745,
     "category": "Dynamic Programming",
+    "title": "Palindrome Partitioning IV",
     "difficulty": "Hard",
-    "id": 1745,
-    "link": "https://leetcode.com/problems/palindrome-partitioning-iv/",
-    "title": "Palindrome Partitioning IV"
+    "link": "https://leetcode.com/problems/palindrome-partitioning-iv/"
   },
   "1746": {
+    "id": 1746,
     "category": "Dynamic Programming",
+    "title": "Maximum Subarray Sum After One Operation",
     "difficulty": "Medium",
-    "id": 1746,
-    "link": "https://leetcode.com/problems/maximum-subarray-sum-after-one-operation/",
-    "title": "Maximum Subarray Sum After One Operation"
+    "link": "https://leetcode.com/problems/maximum-subarray-sum-after-one-operation/"
   },
   "1747": {
+    "id": 1747,
     "category": "Database",
+    "title": "Leetflex Banned Accounts",
     "difficulty": "Medium",
-    "id": 1747,
-    "link": "https://leetcode.com/problems/leetflex-banned-accounts/",
-    "title": "Leetflex Banned Accounts"
+    "link": "https://leetcode.com/problems/leetflex-banned-accounts/"
   },
   "1748": {
+    "id": 1748,
     "category": "Array & Hashing",
+    "title": "Sum of Unique Elements",
     "difficulty": "Easy",
-    "id": 1748,
-    "link": "https://leetcode.com/problems/sum-of-unique-elements/",
-    "title": "Sum of Unique Elements"
+    "link": "https://leetcode.com/problems/sum-of-unique-elements/"
   },
   "1749": {
+    "id": 1749,
     "category": "Dynamic Programming",
+    "title": "Maximum Absolute Sum of Any Subarray",
     "difficulty": "Medium",
-    "id": 1749,
-    "link": "https://leetcode.com/problems/maximum-absolute-sum-of-any-subarray/",
-    "title": "Maximum Absolute Sum of Any Subarray"
+    "link": "https://leetcode.com/problems/maximum-absolute-sum-of-any-subarray/"
   },
   "1750": {
+    "id": 1750,
     "category": "Two Pointers",
+    "title": "Minimum Length of String After Deleting Similar Ends",
     "difficulty": "Medium",
-    "id": 1750,
-    "link": "https://leetcode.com/problems/minimum-length-of-string-after-deleting-similar-ends/",
-    "title": "Minimum Length of String After Deleting Similar Ends"
+    "link": "https://leetcode.com/problems/minimum-length-of-string-after-deleting-similar-ends/"
   },
   "1751": {
+    "id": 1751,
     "category": "Dynamic Programming",
+    "title": "Maximum Number of Events That Can Be Attended II",
     "difficulty": "Hard",
-    "id": 1751,
-    "link": "https://leetcode.com/problems/maximum-number-of-events-that-can-be-attended-ii/",
-    "title": "Maximum Number of Events That Can Be Attended II"
+    "link": "https://leetcode.com/problems/maximum-number-of-events-that-can-be-attended-ii/"
   },
   "1752": {
+    "id": 1752,
     "category": "Array & Hashing",
+    "title": "Check if Array Is Sorted and Rotated",
     "difficulty": "Easy",
-    "id": 1752,
-    "link": "https://leetcode.com/problems/check-if-array-is-sorted-and-rotated/",
-    "title": "Check if Array Is Sorted and Rotated"
+    "link": "https://leetcode.com/problems/check-if-array-is-sorted-and-rotated/"
   },
   "1753": {
+    "id": 1753,
     "category": "Heap (Priority Queue)",
+    "title": "Maximum Score From Removing Stones",
     "difficulty": "Medium",
-    "id": 1753,
-    "link": "https://leetcode.com/problems/maximum-score-from-removing-stones/",
-    "title": "Maximum Score From Removing Stones"
+    "link": "https://leetcode.com/problems/maximum-score-from-removing-stones/"
   },
   "1754": {
+    "id": 1754,
     "category": "Greedy",
+    "title": "Largest Merge Of Two Strings",
     "difficulty": "Medium",
-    "id": 1754,
-    "link": "https://leetcode.com/problems/largest-merge-of-two-strings/",
-    "title": "Largest Merge Of Two Strings"
+    "link": "https://leetcode.com/problems/largest-merge-of-two-strings/"
   },
   "1755": {
+    "id": 1755,
     "category": "Dynamic Programming",
+    "title": "Closest Subsequence Sum",
     "difficulty": "Hard",
-    "id": 1755,
-    "link": "https://leetcode.com/problems/closest-subsequence-sum/",
-    "title": "Closest Subsequence Sum"
+    "link": "https://leetcode.com/problems/closest-subsequence-sum/"
   },
   "1756": {
+    "id": 1756,
     "category": "Linked List",
+    "title": "Design Most Recently Used Queue",
     "difficulty": "Medium",
-    "id": 1756,
-    "link": "https://leetcode.com/problems/design-most-recently-used-queue/",
-    "title": "Design Most Recently Used Queue"
+    "link": "https://leetcode.com/problems/design-most-recently-used-queue/"
   },
   "1757": {
+    "id": 1757,
     "category": "Database",
+    "title": "Recyclable and Low Fat Products",
     "difficulty": "Easy",
-    "id": 1757,
-    "link": "https://leetcode.com/problems/recyclable-and-low-fat-products/",
-    "title": "Recyclable and Low Fat Products"
+    "link": "https://leetcode.com/problems/recyclable-and-low-fat-products/"
   },
   "1758": {
+    "id": 1758,
     "category": "Array & Hashing",
+    "title": "Minimum Changes To Make Alternating Binary String",
     "difficulty": "Easy",
-    "id": 1758,
-    "link": "https://leetcode.com/problems/minimum-changes-to-make-alternating-binary-string/",
-    "title": "Minimum Changes To Make Alternating Binary String"
+    "link": "https://leetcode.com/problems/minimum-changes-to-make-alternating-binary-string/"
   },
   "1759": {
+    "id": 1759,
     "category": "Math & Geometry",
+    "title": "Count Number of Homogenous Substrings",
     "difficulty": "Medium",
-    "id": 1759,
-    "link": "https://leetcode.com/problems/count-number-of-homogenous-substrings/",
-    "title": "Count Number of Homogenous Substrings"
+    "link": "https://leetcode.com/problems/count-number-of-homogenous-substrings/"
   },
   "1760": {
+    "id": 1760,
     "category": "Binary Search",
+    "title": "Minimum Limit of Balls in a Bag",
     "difficulty": "Medium",
-    "id": 1760,
-    "link": "https://leetcode.com/problems/minimum-limit-of-balls-in-a-bag/",
-    "title": "Minimum Limit of Balls in a Bag"
+    "link": "https://leetcode.com/problems/minimum-limit-of-balls-in-a-bag/"
   },
   "1761": {
+    "id": 1761,
     "category": "Graph Traversal",
+    "title": "Minimum Degree of a Connected Trio in a Graph",
     "difficulty": "Hard",
-    "id": 1761,
-    "link": "https://leetcode.com/problems/minimum-degree-of-a-connected-trio-in-a-graph/",
-    "title": "Minimum Degree of a Connected Trio in a Graph"
+    "link": "https://leetcode.com/problems/minimum-degree-of-a-connected-trio-in-a-graph/"
   },
   "1762": {
+    "id": 1762,
     "category": "Stack",
+    "title": "Buildings With an Ocean View",
     "difficulty": "Medium",
-    "id": 1762,
-    "link": "https://leetcode.com/problems/buildings-with-an-ocean-view/",
-    "title": "Buildings With an Ocean View"
+    "link": "https://leetcode.com/problems/buildings-with-an-ocean-view/"
   },
   "1763": {
+    "id": 1763,
     "category": "Sliding Window",
+    "title": "Longest Nice Substring",
     "difficulty": "Easy",
-    "id": 1763,
-    "link": "https://leetcode.com/problems/longest-nice-substring/",
-    "title": "Longest Nice Substring"
+    "link": "https://leetcode.com/problems/longest-nice-substring/"
   },
   "1764": {
+    "id": 1764,
     "category": "Greedy",
+    "title": "Form Array by Concatenating Subarrays of Another Array",
     "difficulty": "Medium",
-    "id": 1764,
-    "link": "https://leetcode.com/problems/form-array-by-concatenating-subarrays-of-another-array/",
-    "title": "Form Array by Concatenating Subarrays of Another Array"
+    "link": "https://leetcode.com/problems/form-array-by-concatenating-subarrays-of-another-array/"
   },
   "1765": {
+    "id": 1765,
     "category": "Graph Traversal",
+    "title": "Map of Highest Peak",
     "difficulty": "Medium",
-    "id": 1765,
-    "link": "https://leetcode.com/problems/map-of-highest-peak/",
-    "title": "Map of Highest Peak"
+    "link": "https://leetcode.com/problems/map-of-highest-peak/"
   },
   "1766": {
+    "id": 1766,
     "category": "Tree",
+    "title": "Tree of Coprimes",
     "difficulty": "Hard",
-    "id": 1766,
-    "link": "https://leetcode.com/problems/tree-of-coprimes/",
-    "title": "Tree of Coprimes"
+    "link": "https://leetcode.com/problems/tree-of-coprimes/"
   },
   "1767": {
+    "id": 1767,
     "category": "Database",
+    "title": "Find the Subtasks That Did Not Execute",
     "difficulty": "Hard",
-    "id": 1767,
-    "link": "https://leetcode.com/problems/find-the-subtasks-that-did-not-execute/",
-    "title": "Find the Subtasks That Did Not Execute"
+    "link": "https://leetcode.com/problems/find-the-subtasks-that-did-not-execute/"
   },
   "1768": {
+    "id": 1768,
     "category": "Two Pointers",
+    "title": "Merge Strings Alternately",
     "difficulty": "Easy",
-    "id": 1768,
-    "link": "https://leetcode.com/problems/merge-strings-alternately/",
-    "title": "Merge Strings Alternately"
+    "link": "https://leetcode.com/problems/merge-strings-alternately/"
   },
   "1769": {
+    "id": 1769,
     "category": "Array & Hashing",
+    "title": "Minimum Number of Operations to Move All Balls to Each Box",
     "difficulty": "Medium",
-    "id": 1769,
-    "link": "https://leetcode.com/problems/minimum-number-of-operations-to-move-all-balls-to-each-box/",
-    "title": "Minimum Number of Operations to Move All Balls to Each Box"
+    "link": "https://leetcode.com/problems/minimum-number-of-operations-to-move-all-balls-to-each-box/"
   },
   "1770": {
+    "id": 1770,
     "category": "Dynamic Programming",
+    "title": "Maximum Score from Performing Multiplication Operations",
     "difficulty": "Hard",
-    "id": 1770,
-    "link": "https://leetcode.com/problems/maximum-score-from-performing-multiplication-operations/",
-    "title": "Maximum Score from Performing Multiplication Operations"
+    "link": "https://leetcode.com/problems/maximum-score-from-performing-multiplication-operations/"
   },
   "1771": {
+    "id": 1771,
     "category": "Dynamic Programming",
+    "title": "Maximize Palindrome Length From Subsequences",
     "difficulty": "Hard",
-    "id": 1771,
-    "link": "https://leetcode.com/problems/maximize-palindrome-length-from-subsequences/",
-    "title": "Maximize Palindrome Length From Subsequences"
+    "link": "https://leetcode.com/problems/maximize-palindrome-length-from-subsequences/"
   },
   "1772": {
+    "id": 1772,
     "category": "Array & Hashing",
+    "title": "Sort Features by Popularity",
     "difficulty": "Medium",
-    "id": 1772,
-    "link": "https://leetcode.com/problems/sort-features-by-popularity/",
-    "title": "Sort Features by Popularity"
+    "link": "https://leetcode.com/problems/sort-features-by-popularity/"
   },
   "1773": {
+    "id": 1773,
     "category": "Array & Hashing",
+    "title": "Count Items Matching a Rule",
     "difficulty": "Easy",
-    "id": 1773,
-    "link": "https://leetcode.com/problems/count-items-matching-a-rule/",
-    "title": "Count Items Matching a Rule"
+    "link": "https://leetcode.com/problems/count-items-matching-a-rule/"
   },
   "1774": {
+    "id": 1774,
     "category": "Dynamic Programming",
+    "title": "Closest Dessert Cost",
     "difficulty": "Medium",
-    "id": 1774,
-    "link": "https://leetcode.com/problems/closest-dessert-cost/",
-    "title": "Closest Dessert Cost"
+    "link": "https://leetcode.com/problems/closest-dessert-cost/"
   },
   "1775": {
+    "id": 1775,
     "category": "Greedy",
+    "title": "Equal Sum Arrays With Minimum Number of Operations",
     "difficulty": "Medium",
-    "id": 1775,
-    "link": "https://leetcode.com/problems/equal-sum-arrays-with-minimum-number-of-operations/",
-    "title": "Equal Sum Arrays With Minimum Number of Operations"
+    "link": "https://leetcode.com/problems/equal-sum-arrays-with-minimum-number-of-operations/"
   },
   "1776": {
+    "id": 1776,
     "category": "Heap (Priority Queue)",
+    "title": "Car Fleet II",
     "difficulty": "Hard",
-    "id": 1776,
-    "link": "https://leetcode.com/problems/car-fleet-ii/",
-    "title": "Car Fleet II"
+    "link": "https://leetcode.com/problems/car-fleet-ii/"
   },
   "1777": {
+    "id": 1777,
     "category": "Database",
+    "title": "Product's Price for Each Store",
     "difficulty": "Easy",
-    "id": 1777,
-    "link": "https://leetcode.com/problems/products-price-for-each-store/",
-    "title": "Product's Price for Each Store"
+    "link": "https://leetcode.com/problems/products-price-for-each-store/"
   },
   "1778": {
+    "id": 1778,
     "category": "Graph Traversal",
+    "title": "Shortest Path in a Hidden Grid",
     "difficulty": "Medium",
-    "id": 1778,
-    "link": "https://leetcode.com/problems/shortest-path-in-a-hidden-grid/",
-    "title": "Shortest Path in a Hidden Grid"
+    "link": "https://leetcode.com/problems/shortest-path-in-a-hidden-grid/"
   },
   "1779": {
+    "id": 1779,
     "category": "Array & Hashing",
+    "title": "Find Nearest Point That Has the Same X or Y Coordinate",
     "difficulty": "Easy",
-    "id": 1779,
-    "link": "https://leetcode.com/problems/find-nearest-point-that-has-the-same-x-or-y-coordinate/",
-    "title": "Find Nearest Point That Has the Same X or Y Coordinate"
+    "link": "https://leetcode.com/problems/find-nearest-point-that-has-the-same-x-or-y-coordinate/"
   },
   "1780": {
+    "id": 1780,
     "category": "Math & Geometry",
+    "title": "Check if Number is a Sum of Powers of Three",
     "difficulty": "Medium",
-    "id": 1780,
-    "link": "https://leetcode.com/problems/check-if-number-is-a-sum-of-powers-of-three/",
-    "title": "Check if Number is a Sum of Powers of Three"
+    "link": "https://leetcode.com/problems/check-if-number-is-a-sum-of-powers-of-three/"
   },
   "1781": {
+    "id": 1781,
     "category": "Array & Hashing",
+    "title": "Sum of Beauty of All Substrings",
     "difficulty": "Medium",
-    "id": 1781,
-    "link": "https://leetcode.com/problems/sum-of-beauty-of-all-substrings/",
-    "title": "Sum of Beauty of All Substrings"
+    "link": "https://leetcode.com/problems/sum-of-beauty-of-all-substrings/"
   },
   "1782": {
+    "id": 1782,
     "category": "Graph Traversal",
+    "title": "Count Pairs Of Nodes",
     "difficulty": "Hard",
-    "id": 1782,
-    "link": "https://leetcode.com/problems/count-pairs-of-nodes/",
-    "title": "Count Pairs Of Nodes"
+    "link": "https://leetcode.com/problems/count-pairs-of-nodes/"
   },
   "1783": {
+    "id": 1783,
     "category": "Database",
+    "title": "Grand Slam Titles",
     "difficulty": "Medium",
-    "id": 1783,
-    "link": "https://leetcode.com/problems/grand-slam-titles/",
-    "title": "Grand Slam Titles"
+    "link": "https://leetcode.com/problems/grand-slam-titles/"
   },
   "1784": {
+    "id": 1784,
     "category": "Array & Hashing",
+    "title": "Check if Binary String Has at Most One Segment of Ones",
     "difficulty": "Easy",
-    "id": 1784,
-    "link": "https://leetcode.com/problems/check-if-binary-string-has-at-most-one-segment-of-ones/",
-    "title": "Check if Binary String Has at Most One Segment of Ones"
+    "link": "https://leetcode.com/problems/check-if-binary-string-has-at-most-one-segment-of-ones/"
   },
   "1785": {
+    "id": 1785,
     "category": "Greedy",
+    "title": "Minimum Elements to Add to Form a Given Sum",
     "difficulty": "Medium",
-    "id": 1785,
-    "link": "https://leetcode.com/problems/minimum-elements-to-add-to-form-a-given-sum/",
-    "title": "Minimum Elements to Add to Form a Given Sum"
+    "link": "https://leetcode.com/problems/minimum-elements-to-add-to-form-a-given-sum/"
   },
   "1786": {
+    "id": 1786,
     "category": "Graph Traversal",
+    "title": "Number of Restricted Paths From First to Last Node",
     "difficulty": "Medium",
-    "id": 1786,
-    "link": "https://leetcode.com/problems/number-of-restricted-paths-from-first-to-last-node/",
-    "title": "Number of Restricted Paths From First to Last Node"
+    "link": "https://leetcode.com/problems/number-of-restricted-paths-from-first-to-last-node/"
   },
   "1787": {
+    "id": 1787,
     "category": "Dynamic Programming",
+    "title": "Make the XOR of All Segments Equal to Zero",
     "difficulty": "Hard",
-    "id": 1787,
-    "link": "https://leetcode.com/problems/make-the-xor-of-all-segments-equal-to-zero/",
-    "title": "Make the XOR of All Segments Equal to Zero"
+    "link": "https://leetcode.com/problems/make-the-xor-of-all-segments-equal-to-zero/"
   },
   "1788": {
+    "id": 1788,
     "category": "Greedy",
+    "title": "Maximize the Beauty of the Garden",
     "difficulty": "Hard",
-    "id": 1788,
-    "link": "https://leetcode.com/problems/maximize-the-beauty-of-the-garden/",
-    "title": "Maximize the Beauty of the Garden"
+    "link": "https://leetcode.com/problems/maximize-the-beauty-of-the-garden/"
   },
   "1789": {
+    "id": 1789,
     "category": "Database",
+    "title": "Primary Department for Each Employee",
     "difficulty": "Easy",
-    "id": 1789,
-    "link": "https://leetcode.com/problems/primary-department-for-each-employee/",
-    "title": "Primary Department for Each Employee"
+    "link": "https://leetcode.com/problems/primary-department-for-each-employee/"
   },
   "1790": {
+    "id": 1790,
     "category": "Array & Hashing",
+    "title": "Check if One String Swap Can Make Strings Equal",
     "difficulty": "Easy",
-    "id": 1790,
-    "link": "https://leetcode.com/problems/check-if-one-string-swap-can-make-strings-equal/",
-    "title": "Check if One String Swap Can Make Strings Equal"
+    "link": "https://leetcode.com/problems/check-if-one-string-swap-can-make-strings-equal/"
   },
   "1791": {
+    "id": 1791,
     "category": "Graph Traversal",
+    "title": "Find Center of Star Graph",
     "difficulty": "Easy",
-    "id": 1791,
-    "link": "https://leetcode.com/problems/find-center-of-star-graph/",
-    "title": "Find Center of Star Graph"
+    "link": "https://leetcode.com/problems/find-center-of-star-graph/"
   },
   "1792": {
+    "id": 1792,
     "category": "Heap (Priority Queue)",
+    "title": "Maximum Average Pass Ratio",
     "difficulty": "Medium",
-    "id": 1792,
-    "link": "https://leetcode.com/problems/maximum-average-pass-ratio/",
-    "title": "Maximum Average Pass Ratio"
+    "link": "https://leetcode.com/problems/maximum-average-pass-ratio/"
   },
   "1793": {
+    "id": 1793,
     "category": "Binary Search",
+    "title": "Maximum Score of a Good Subarray",
     "difficulty": "Hard",
-    "id": 1793,
-    "link": "https://leetcode.com/problems/maximum-score-of-a-good-subarray/",
-    "title": "Maximum Score of a Good Subarray"
+    "link": "https://leetcode.com/problems/maximum-score-of-a-good-subarray/"
   },
   "1794": {
+    "id": 1794,
     "category": "Greedy",
+    "title": "Count Pairs of Equal Substrings With Minimum Difference",
     "difficulty": "Medium",
-    "id": 1794,
-    "link": "https://leetcode.com/problems/count-pairs-of-equal-substrings-with-minimum-difference/",
-    "title": "Count Pairs of Equal Substrings With Minimum Difference"
+    "link": "https://leetcode.com/problems/count-pairs-of-equal-substrings-with-minimum-difference/"
   },
   "1795": {
+    "id": 1795,
     "category": "Database",
+    "title": "Rearrange Products Table",
     "difficulty": "Easy",
-    "id": 1795,
-    "link": "https://leetcode.com/problems/rearrange-products-table/",
-    "title": "Rearrange Products Table"
+    "link": "https://leetcode.com/problems/rearrange-products-table/"
   },
   "1796": {
+    "id": 1796,
     "category": "Array & Hashing",
+    "title": "Second Largest Digit in a String",
     "difficulty": "Easy",
-    "id": 1796,
-    "link": "https://leetcode.com/problems/second-largest-digit-in-a-string/",
-    "title": "Second Largest Digit in a String"
+    "link": "https://leetcode.com/problems/second-largest-digit-in-a-string/"
   },
   "1797": {
+    "id": 1797,
     "category": "Linked List",
+    "title": "Design Authentication Manager",
     "difficulty": "Medium",
-    "id": 1797,
-    "link": "https://leetcode.com/problems/design-authentication-manager/",
-    "title": "Design Authentication Manager"
+    "link": "https://leetcode.com/problems/design-authentication-manager/"
   },
   "1798": {
+    "id": 1798,
     "category": "Greedy",
+    "title": "Maximum Number of Consecutive Values You Can Make",
     "difficulty": "Medium",
-    "id": 1798,
-    "link": "https://leetcode.com/problems/maximum-number-of-consecutive-values-you-can-make/",
-    "title": "Maximum Number of Consecutive Values You Can Make"
+    "link": "https://leetcode.com/problems/maximum-number-of-consecutive-values-you-can-make/"
   },
   "1799": {
+    "id": 1799,
     "category": "Dynamic Programming",
+    "title": "Maximize Score After N Operations",
     "difficulty": "Hard",
-    "id": 1799,
-    "link": "https://leetcode.com/problems/maximize-score-after-n-operations/",
-    "title": "Maximize Score After N Operations"
+    "link": "https://leetcode.com/problems/maximize-score-after-n-operations/"
   },
   "1800": {
+    "id": 1800,
     "category": "Array & Hashing",
+    "title": "Maximum Ascending Subarray Sum",
     "difficulty": "Easy",
-    "id": 1800,
-    "link": "https://leetcode.com/problems/maximum-ascending-subarray-sum/",
-    "title": "Maximum Ascending Subarray Sum"
+    "link": "https://leetcode.com/problems/maximum-ascending-subarray-sum/"
   },
   "1801": {
+    "id": 1801,
     "category": "Heap (Priority Queue)",
+    "title": "Number of Orders in the Backlog",
     "difficulty": "Medium",
-    "id": 1801,
-    "link": "https://leetcode.com/problems/number-of-orders-in-the-backlog/",
-    "title": "Number of Orders in the Backlog"
+    "link": "https://leetcode.com/problems/number-of-orders-in-the-backlog/"
   },
   "1802": {
+    "id": 1802,
     "category": "Binary Search",
+    "title": "Maximum Value at a Given Index in a Bounded Array",
     "difficulty": "Medium",
-    "id": 1802,
-    "link": "https://leetcode.com/problems/maximum-value-at-a-given-index-in-a-bounded-array/",
-    "title": "Maximum Value at a Given Index in a Bounded Array"
+    "link": "https://leetcode.com/problems/maximum-value-at-a-given-index-in-a-bounded-array/"
   },
   "1803": {
+    "id": 1803,
     "category": "Trie",
+    "title": "Count Pairs With XOR in a Range",
     "difficulty": "Hard",
-    "id": 1803,
-    "link": "https://leetcode.com/problems/count-pairs-with-xor-in-a-range/",
-    "title": "Count Pairs With XOR in a Range"
+    "link": "https://leetcode.com/problems/count-pairs-with-xor-in-a-range/"
   },
   "1804": {
+    "id": 1804,
     "category": "Trie",
+    "title": "Implement Trie II (Prefix Tree)",
     "difficulty": "Medium",
-    "id": 1804,
-    "link": "https://leetcode.com/problems/implement-trie-ii-prefix-tree/",
-    "title": "Implement Trie II (Prefix Tree)"
+    "link": "https://leetcode.com/problems/implement-trie-ii-prefix-tree/"
   },
   "1805": {
+    "id": 1805,
     "category": "Array & Hashing",
+    "title": "Number of Different Integers in a String",
     "difficulty": "Easy",
-    "id": 1805,
-    "link": "https://leetcode.com/problems/number-of-different-integers-in-a-string/",
-    "title": "Number of Different Integers in a String"
+    "link": "https://leetcode.com/problems/number-of-different-integers-in-a-string/"
   },
   "1806": {
+    "id": 1806,
     "category": "Math & Geometry",
+    "title": "Minimum Number of Operations to Reinitialize a Permutation",
     "difficulty": "Medium",
-    "id": 1806,
-    "link": "https://leetcode.com/problems/minimum-number-of-operations-to-reinitialize-a-permutation/",
-    "title": "Minimum Number of Operations to Reinitialize a Permutation"
+    "link": "https://leetcode.com/problems/minimum-number-of-operations-to-reinitialize-a-permutation/"
   },
   "1807": {
+    "id": 1807,
     "category": "Array & Hashing",
+    "title": "Evaluate the Bracket Pairs of a String",
     "difficulty": "Medium",
-    "id": 1807,
-    "link": "https://leetcode.com/problems/evaluate-the-bracket-pairs-of-a-string/",
-    "title": "Evaluate the Bracket Pairs of a String"
+    "link": "https://leetcode.com/problems/evaluate-the-bracket-pairs-of-a-string/"
   },
   "1808": {
+    "id": 1808,
     "category": "Math & Geometry",
+    "title": "Maximize Number of Nice Divisors",
     "difficulty": "Hard",
-    "id": 1808,
-    "link": "https://leetcode.com/problems/maximize-number-of-nice-divisors/",
-    "title": "Maximize Number of Nice Divisors"
+    "link": "https://leetcode.com/problems/maximize-number-of-nice-divisors/"
   },
   "1809": {
+    "id": 1809,
     "category": "Database",
+    "title": "Ad-Free Sessions",
     "difficulty": "Easy",
-    "id": 1809,
-    "link": "https://leetcode.com/problems/ad-free-sessions/",
-    "title": "Ad-Free Sessions"
+    "link": "https://leetcode.com/problems/ad-free-sessions/"
   },
   "1810": {
+    "id": 1810,
     "category": "Graph Traversal",
+    "title": "Minimum Path Cost in a Hidden Grid",
     "difficulty": "Medium",
-    "id": 1810,
-    "link": "https://leetcode.com/problems/minimum-path-cost-in-a-hidden-grid/",
-    "title": "Minimum Path Cost in a Hidden Grid"
+    "link": "https://leetcode.com/problems/minimum-path-cost-in-a-hidden-grid/"
   },
   "1811": {
+    "id": 1811,
     "category": "Database",
+    "title": "Find Interview Candidates",
     "difficulty": "Medium",
-    "id": 1811,
-    "link": "https://leetcode.com/problems/find-interview-candidates/",
-    "title": "Find Interview Candidates"
+    "link": "https://leetcode.com/problems/find-interview-candidates/"
   },
   "1812": {
+    "id": 1812,
     "category": "Math & Geometry",
+    "title": "Determine Color of a Chessboard Square",
     "difficulty": "Easy",
-    "id": 1812,
-    "link": "https://leetcode.com/problems/determine-color-of-a-chessboard-square/",
-    "title": "Determine Color of a Chessboard Square"
+    "link": "https://leetcode.com/problems/determine-color-of-a-chessboard-square/"
   },
   "1813": {
+    "id": 1813,
     "category": "Two Pointers",
+    "title": "Sentence Similarity III",
     "difficulty": "Medium",
-    "id": 1813,
-    "link": "https://leetcode.com/problems/sentence-similarity-iii/",
-    "title": "Sentence Similarity III"
+    "link": "https://leetcode.com/problems/sentence-similarity-iii/"
   },
   "1814": {
+    "id": 1814,
     "category": "Math & Geometry",
+    "title": "Count Nice Pairs in an Array",
     "difficulty": "Medium",
-    "id": 1814,
-    "link": "https://leetcode.com/problems/count-nice-pairs-in-an-array/",
-    "title": "Count Nice Pairs in an Array"
+    "link": "https://leetcode.com/problems/count-nice-pairs-in-an-array/"
   },
   "1815": {
+    "id": 1815,
     "category": "Dynamic Programming",
+    "title": "Maximum Number of Groups Getting Fresh Donuts",
     "difficulty": "Hard",
-    "id": 1815,
-    "link": "https://leetcode.com/problems/maximum-number-of-groups-getting-fresh-donuts/",
-    "title": "Maximum Number of Groups Getting Fresh Donuts"
+    "link": "https://leetcode.com/problems/maximum-number-of-groups-getting-fresh-donuts/"
   },
   "1816": {
+    "id": 1816,
     "category": "Array & Hashing",
+    "title": "Truncate Sentence",
     "difficulty": "Easy",
-    "id": 1816,
-    "link": "https://leetcode.com/problems/truncate-sentence/",
-    "title": "Truncate Sentence"
+    "link": "https://leetcode.com/problems/truncate-sentence/"
   },
   "1817": {
+    "id": 1817,
     "category": "Array & Hashing",
+    "title": "Finding the Users Active Minutes",
     "difficulty": "Medium",
-    "id": 1817,
-    "link": "https://leetcode.com/problems/finding-the-users-active-minutes/",
-    "title": "Finding the Users Active Minutes"
+    "link": "https://leetcode.com/problems/finding-the-users-active-minutes/"
   },
   "1818": {
+    "id": 1818,
     "category": "Binary Search",
+    "title": "Minimum Absolute Sum Difference",
     "difficulty": "Medium",
-    "id": 1818,
-    "link": "https://leetcode.com/problems/minimum-absolute-sum-difference/",
-    "title": "Minimum Absolute Sum Difference"
+    "link": "https://leetcode.com/problems/minimum-absolute-sum-difference/"
   },
   "1819": {
+    "id": 1819,
     "category": "Math & Geometry",
+    "title": "Number of Different Subsequences GCDs",
     "difficulty": "Hard",
-    "id": 1819,
-    "link": "https://leetcode.com/problems/number-of-different-subsequences-gcds/",
-    "title": "Number of Different Subsequences GCDs"
+    "link": "https://leetcode.com/problems/number-of-different-subsequences-gcds/"
   },
   "1820": {
+    "id": 1820,
     "category": "Graph Traversal",
+    "title": "Maximum Number of Accepted Invitations",
     "difficulty": "Medium",
-    "id": 1820,
-    "link": "https://leetcode.com/problems/maximum-number-of-accepted-invitations/",
-    "title": "Maximum Number of Accepted Invitations"
+    "link": "https://leetcode.com/problems/maximum-number-of-accepted-invitations/"
   },
   "1821": {
+    "id": 1821,
     "category": "Database",
+    "title": "Find Customers With Positive Revenue this Year",
     "difficulty": "Easy",
-    "id": 1821,
-    "link": "https://leetcode.com/problems/find-customers-with-positive-revenue-this-year/",
-    "title": "Find Customers With Positive Revenue this Year"
+    "link": "https://leetcode.com/problems/find-customers-with-positive-revenue-this-year/"
   },
   "1822": {
+    "id": 1822,
     "category": "Math & Geometry",
+    "title": "Sign of the Product of an Array",
     "difficulty": "Easy",
-    "id": 1822,
-    "link": "https://leetcode.com/problems/sign-of-the-product-of-an-array/",
-    "title": "Sign of the Product of an Array"
+    "link": "https://leetcode.com/problems/sign-of-the-product-of-an-array/"
   },
   "1823": {
+    "id": 1823,
     "category": "Math & Geometry",
+    "title": "Find the Winner of the Circular Game",
     "difficulty": "Medium",
-    "id": 1823,
-    "link": "https://leetcode.com/problems/find-the-winner-of-the-circular-game/",
-    "title": "Find the Winner of the Circular Game"
+    "link": "https://leetcode.com/problems/find-the-winner-of-the-circular-game/"
   },
   "1824": {
+    "id": 1824,
     "category": "Dynamic Programming",
+    "title": "Minimum Sideway Jumps",
     "difficulty": "Medium",
-    "id": 1824,
-    "link": "https://leetcode.com/problems/minimum-sideway-jumps/",
-    "title": "Minimum Sideway Jumps"
+    "link": "https://leetcode.com/problems/minimum-sideway-jumps/"
   },
   "1825": {
+    "id": 1825,
     "category": "Heap (Priority Queue)",
+    "title": "Finding MK Average",
     "difficulty": "Hard",
-    "id": 1825,
-    "link": "https://leetcode.com/problems/finding-mk-average/",
-    "title": "Finding MK Average"
+    "link": "https://leetcode.com/problems/finding-mk-average/"
   },
   "1826": {
+    "id": 1826,
     "category": "Two Pointers",
+    "title": "Faulty Sensor",
     "difficulty": "Easy",
-    "id": 1826,
-    "link": "https://leetcode.com/problems/faulty-sensor/",
-    "title": "Faulty Sensor"
+    "link": "https://leetcode.com/problems/faulty-sensor/"
   },
   "1827": {
+    "id": 1827,
     "category": "Greedy",
+    "title": "Minimum Operations to Make the Array Increasing",
     "difficulty": "Easy",
-    "id": 1827,
-    "link": "https://leetcode.com/problems/minimum-operations-to-make-the-array-increasing/",
-    "title": "Minimum Operations to Make the Array Increasing"
+    "link": "https://leetcode.com/problems/minimum-operations-to-make-the-array-increasing/"
   },
   "1828": {
+    "id": 1828,
     "category": "Math & Geometry",
+    "title": "Queries on Number of Points Inside a Circle",
     "difficulty": "Medium",
-    "id": 1828,
-    "link": "https://leetcode.com/problems/queries-on-number-of-points-inside-a-circle/",
-    "title": "Queries on Number of Points Inside a Circle"
+    "link": "https://leetcode.com/problems/queries-on-number-of-points-inside-a-circle/"
   },
   "1829": {
+    "id": 1829,
     "category": "Bit Manipulation",
+    "title": "Maximum XOR for Each Query",
     "difficulty": "Medium",
-    "id": 1829,
-    "link": "https://leetcode.com/problems/maximum-xor-for-each-query/",
-    "title": "Maximum XOR for Each Query"
+    "link": "https://leetcode.com/problems/maximum-xor-for-each-query/"
   },
   "1830": {
+    "id": 1830,
     "category": "Math & Geometry",
+    "title": "Minimum Number of Operations to Make String Sorted",
     "difficulty": "Hard",
-    "id": 1830,
-    "link": "https://leetcode.com/problems/minimum-number-of-operations-to-make-string-sorted/",
-    "title": "Minimum Number of Operations to Make String Sorted"
+    "link": "https://leetcode.com/problems/minimum-number-of-operations-to-make-string-sorted/"
   },
   "1831": {
+    "id": 1831,
     "category": "Database",
+    "title": "Maximum Transaction Each Day",
     "difficulty": "Medium",
-    "id": 1831,
-    "link": "https://leetcode.com/problems/maximum-transaction-each-day/",
-    "title": "Maximum Transaction Each Day"
+    "link": "https://leetcode.com/problems/maximum-transaction-each-day/"
   },
   "1832": {
+    "id": 1832,
     "category": "Array & Hashing",
+    "title": "Check if the Sentence Is Pangram",
     "difficulty": "Easy",
-    "id": 1832,
-    "link": "https://leetcode.com/problems/check-if-the-sentence-is-pangram/",
-    "title": "Check if the Sentence Is Pangram"
+    "link": "https://leetcode.com/problems/check-if-the-sentence-is-pangram/"
   },
   "1833": {
+    "id": 1833,
     "category": "Greedy",
+    "title": "Maximum Ice Cream Bars",
     "difficulty": "Medium",
-    "id": 1833,
-    "link": "https://leetcode.com/problems/maximum-ice-cream-bars/",
-    "title": "Maximum Ice Cream Bars"
+    "link": "https://leetcode.com/problems/maximum-ice-cream-bars/"
   },
   "1834": {
+    "id": 1834,
     "category": "Heap (Priority Queue)",
+    "title": "Single-Threaded CPU",
     "difficulty": "Medium",
-    "id": 1834,
-    "link": "https://leetcode.com/problems/single-threaded-cpu/",
-    "title": "Single-Threaded CPU"
+    "link": "https://leetcode.com/problems/single-threaded-cpu/"
   },
   "1835": {
+    "id": 1835,
     "category": "Bit Manipulation",
+    "title": "Find XOR Sum of All Pairs Bitwise AND",
     "difficulty": "Hard",
-    "id": 1835,
-    "link": "https://leetcode.com/problems/find-xor-sum-of-all-pairs-bitwise-and/",
-    "title": "Find XOR Sum of All Pairs Bitwise AND"
+    "link": "https://leetcode.com/problems/find-xor-sum-of-all-pairs-bitwise-and/"
   },
   "1836": {
+    "id": 1836,
     "category": "Linked List",
+    "title": "Remove Duplicates From an Unsorted Linked List",
     "difficulty": "Medium",
-    "id": 1836,
-    "link": "https://leetcode.com/problems/remove-duplicates-from-an-unsorted-linked-list/",
-    "title": "Remove Duplicates From an Unsorted Linked List"
+    "link": "https://leetcode.com/problems/remove-duplicates-from-an-unsorted-linked-list/"
   },
   "1837": {
+    "id": 1837,
     "category": "Math & Geometry",
+    "title": "Sum of Digits in Base K",
     "difficulty": "Easy",
-    "id": 1837,
-    "link": "https://leetcode.com/problems/sum-of-digits-in-base-k/",
-    "title": "Sum of Digits in Base K"
+    "link": "https://leetcode.com/problems/sum-of-digits-in-base-k/"
   },
   "1838": {
+    "id": 1838,
     "category": "Sliding Window",
+    "title": "Frequency of the Most Frequent Element",
     "difficulty": "Medium",
-    "id": 1838,
-    "link": "https://leetcode.com/problems/frequency-of-the-most-frequent-element/",
-    "title": "Frequency of the Most Frequent Element"
+    "link": "https://leetcode.com/problems/frequency-of-the-most-frequent-element/"
   },
   "1839": {
+    "id": 1839,
     "category": "Sliding Window",
+    "title": "Longest Substring Of All Vowels in Order",
     "difficulty": "Medium",
-    "id": 1839,
-    "link": "https://leetcode.com/problems/longest-substring-of-all-vowels-in-order/",
-    "title": "Longest Substring Of All Vowels in Order"
+    "link": "https://leetcode.com/problems/longest-substring-of-all-vowels-in-order/"
   },
   "1840": {
+    "id": 1840,
     "category": "Math & Geometry",
+    "title": "Maximum Building Height",
     "difficulty": "Hard",
-    "id": 1840,
-    "link": "https://leetcode.com/problems/maximum-building-height/",
-    "title": "Maximum Building Height"
+    "link": "https://leetcode.com/problems/maximum-building-height/"
   },
   "1841": {
+    "id": 1841,
     "category": "Database",
+    "title": "League Statistics",
     "difficulty": "Medium",
-    "id": 1841,
-    "link": "https://leetcode.com/problems/league-statistics/",
-    "title": "League Statistics"
+    "link": "https://leetcode.com/problems/league-statistics/"
   },
   "1842": {
+    "id": 1842,
     "category": "Two Pointers",
+    "title": "Next Palindrome Using Same Digits",
     "difficulty": "Hard",
-    "id": 1842,
-    "link": "https://leetcode.com/problems/next-palindrome-using-same-digits/",
-    "title": "Next Palindrome Using Same Digits"
+    "link": "https://leetcode.com/problems/next-palindrome-using-same-digits/"
   },
   "1843": {
+    "id": 1843,
     "category": "Database",
+    "title": "Suspicious Bank Accounts",
     "difficulty": "Medium",
-    "id": 1843,
-    "link": "https://leetcode.com/problems/suspicious-bank-accounts/",
-    "title": "Suspicious Bank Accounts"
+    "link": "https://leetcode.com/problems/suspicious-bank-accounts/"
   },
   "1844": {
+    "id": 1844,
     "category": "Array & Hashing",
+    "title": "Replace All Digits with Characters",
     "difficulty": "Easy",
-    "id": 1844,
-    "link": "https://leetcode.com/problems/replace-all-digits-with-characters/",
-    "title": "Replace All Digits with Characters"
+    "link": "https://leetcode.com/problems/replace-all-digits-with-characters/"
   },
   "1845": {
+    "id": 1845,
     "category": "Heap (Priority Queue)",
+    "title": "Seat Reservation Manager",
     "difficulty": "Medium",
-    "id": 1845,
-    "link": "https://leetcode.com/problems/seat-reservation-manager/",
-    "title": "Seat Reservation Manager"
+    "link": "https://leetcode.com/problems/seat-reservation-manager/"
   },
   "1846": {
+    "id": 1846,
     "category": "Greedy",
+    "title": "Maximum Element After Decreasing and Rearranging",
     "difficulty": "Medium",
-    "id": 1846,
-    "link": "https://leetcode.com/problems/maximum-element-after-decreasing-and-rearranging/",
-    "title": "Maximum Element After Decreasing and Rearranging"
+    "link": "https://leetcode.com/problems/maximum-element-after-decreasing-and-rearranging/"
   },
   "1847": {
+    "id": 1847,
     "category": "Binary Search",
+    "title": "Closest Room",
     "difficulty": "Hard",
-    "id": 1847,
-    "link": "https://leetcode.com/problems/closest-room/",
-    "title": "Closest Room"
+    "link": "https://leetcode.com/problems/closest-room/"
   },
   "1848": {
+    "id": 1848,
     "category": "Array & Hashing",
+    "title": "Minimum Distance to the Target Element",
     "difficulty": "Easy",
-    "id": 1848,
-    "link": "https://leetcode.com/problems/minimum-distance-to-the-target-element/",
-    "title": "Minimum Distance to the Target Element"
+    "link": "https://leetcode.com/problems/minimum-distance-to-the-target-element/"
   },
   "1849": {
+    "id": 1849,
     "category": "Backtracking",
+    "title": "Splitting a String Into Descending Consecutive Values",
     "difficulty": "Medium",
-    "id": 1849,
-    "link": "https://leetcode.com/problems/splitting-a-string-into-descending-consecutive-values/",
-    "title": "Splitting a String Into Descending Consecutive Values"
+    "link": "https://leetcode.com/problems/splitting-a-string-into-descending-consecutive-values/"
   },
   "1850": {
+    "id": 1850,
     "category": "Greedy",
+    "title": "Minimum Adjacent Swaps to Reach the Kth Smallest Number",
     "difficulty": "Medium",
-    "id": 1850,
-    "link": "https://leetcode.com/problems/minimum-adjacent-swaps-to-reach-the-kth-smallest-number/",
-    "title": "Minimum Adjacent Swaps to Reach the Kth Smallest Number"
+    "link": "https://leetcode.com/problems/minimum-adjacent-swaps-to-reach-the-kth-smallest-number/"
   },
   "1851": {
+    "id": 1851,
     "category": "Binary Search",
+    "title": "Minimum Interval to Include Each Query",
     "difficulty": "Hard",
-    "id": 1851,
-    "link": "https://leetcode.com/problems/minimum-interval-to-include-each-query/",
-    "title": "Minimum Interval to Include Each Query"
+    "link": "https://leetcode.com/problems/minimum-interval-to-include-each-query/"
   },
   "1852": {
+    "id": 1852,
     "category": "Sliding Window",
+    "title": "Distinct Numbers in Each Subarray",
     "difficulty": "Medium",
-    "id": 1852,
-    "link": "https://leetcode.com/problems/distinct-numbers-in-each-subarray/",
-    "title": "Distinct Numbers in Each Subarray"
+    "link": "https://leetcode.com/problems/distinct-numbers-in-each-subarray/"
   },
   "1853": {
+    "id": 1853,
     "category": "Database",
+    "title": "Convert Date Format",
     "difficulty": "Easy",
-    "id": 1853,
-    "link": "https://leetcode.com/problems/convert-date-format/",
-    "title": "Convert Date Format"
+    "link": "https://leetcode.com/problems/convert-date-format/"
   },
   "1854": {
+    "id": 1854,
     "category": "Array & Hashing",
+    "title": "Maximum Population Year",
     "difficulty": "Easy",
-    "id": 1854,
-    "link": "https://leetcode.com/problems/maximum-population-year/",
-    "title": "Maximum Population Year"
+    "link": "https://leetcode.com/problems/maximum-population-year/"
   },
   "1855": {
+    "id": 1855,
     "category": "Binary Search",
+    "title": "Maximum Distance Between a Pair of Values",
     "difficulty": "Medium",
-    "id": 1855,
-    "link": "https://leetcode.com/problems/maximum-distance-between-a-pair-of-values/",
-    "title": "Maximum Distance Between a Pair of Values"
+    "link": "https://leetcode.com/problems/maximum-distance-between-a-pair-of-values/"
   },
   "1856": {
+    "id": 1856,
     "category": "Stack",
+    "title": "Maximum Subarray Min-Product",
     "difficulty": "Medium",
-    "id": 1856,
-    "link": "https://leetcode.com/problems/maximum-subarray-min-product/",
-    "title": "Maximum Subarray Min-Product"
+    "link": "https://leetcode.com/problems/maximum-subarray-min-product/"
   },
   "1857": {
+    "id": 1857,
     "category": "Graph Traversal",
+    "title": "Largest Color Value in a Directed Graph",
     "difficulty": "Hard",
-    "id": 1857,
-    "link": "https://leetcode.com/problems/largest-color-value-in-a-directed-graph/",
-    "title": "Largest Color Value in a Directed Graph"
+    "link": "https://leetcode.com/problems/largest-color-value-in-a-directed-graph/"
   },
   "1858": {
+    "id": 1858,
     "category": "Graph Traversal",
+    "title": "Longest Word With All Prefixes",
     "difficulty": "Medium",
-    "id": 1858,
-    "link": "https://leetcode.com/problems/longest-word-with-all-prefixes/",
-    "title": "Longest Word With All Prefixes"
+    "link": "https://leetcode.com/problems/longest-word-with-all-prefixes/"
   },
   "1859": {
+    "id": 1859,
     "category": "Array & Hashing",
+    "title": "Sorting the Sentence",
     "difficulty": "Easy",
-    "id": 1859,
-    "link": "https://leetcode.com/problems/sorting-the-sentence/",
-    "title": "Sorting the Sentence"
+    "link": "https://leetcode.com/problems/sorting-the-sentence/"
   },
   "1860": {
+    "id": 1860,
     "category": "Math & Geometry",
+    "title": "Incremental Memory Leak",
     "difficulty": "Medium",
-    "id": 1860,
-    "link": "https://leetcode.com/problems/incremental-memory-leak/",
-    "title": "Incremental Memory Leak"
+    "link": "https://leetcode.com/problems/incremental-memory-leak/"
   },
   "1861": {
+    "id": 1861,
     "category": "Two Pointers",
+    "title": "Rotating the Box",
     "difficulty": "Medium",
-    "id": 1861,
-    "link": "https://leetcode.com/problems/rotating-the-box/",
-    "title": "Rotating the Box"
+    "link": "https://leetcode.com/problems/rotating-the-box/"
   },
   "1862": {
+    "id": 1862,
     "category": "Binary Search",
+    "title": "Sum of Floored Pairs",
     "difficulty": "Hard",
-    "id": 1862,
-    "link": "https://leetcode.com/problems/sum-of-floored-pairs/",
-    "title": "Sum of Floored Pairs"
+    "link": "https://leetcode.com/problems/sum-of-floored-pairs/"
   },
   "1863": {
+    "id": 1863,
     "category": "Backtracking",
+    "title": "Sum of All Subset XOR Totals",
     "difficulty": "Easy",
-    "id": 1863,
-    "link": "https://leetcode.com/problems/sum-of-all-subset-xor-totals/",
-    "title": "Sum of All Subset XOR Totals"
+    "link": "https://leetcode.com/problems/sum-of-all-subset-xor-totals/"
   },
   "1864": {
+    "id": 1864,
     "category": "Greedy",
+    "title": "Minimum Number of Swaps to Make the Binary String Alternating",
     "difficulty": "Medium",
-    "id": 1864,
-    "link": "https://leetcode.com/problems/minimum-number-of-swaps-to-make-the-binary-string-alternating/",
-    "title": "Minimum Number of Swaps to Make the Binary String Alternating"
+    "link": "https://leetcode.com/problems/minimum-number-of-swaps-to-make-the-binary-string-alternating/"
   },
   "1865": {
+    "id": 1865,
     "category": "Array & Hashing",
+    "title": "Finding Pairs With a Certain Sum",
     "difficulty": "Medium",
-    "id": 1865,
-    "link": "https://leetcode.com/problems/finding-pairs-with-a-certain-sum/",
-    "title": "Finding Pairs With a Certain Sum"
+    "link": "https://leetcode.com/problems/finding-pairs-with-a-certain-sum/"
   },
   "1866": {
+    "id": 1866,
     "category": "Dynamic Programming",
+    "title": "Number of Ways to Rearrange Sticks With K Sticks Visible",
     "difficulty": "Hard",
-    "id": 1866,
-    "link": "https://leetcode.com/problems/number-of-ways-to-rearrange-sticks-with-k-sticks-visible/",
-    "title": "Number of Ways to Rearrange Sticks With K Sticks Visible"
+    "link": "https://leetcode.com/problems/number-of-ways-to-rearrange-sticks-with-k-sticks-visible/"
   },
   "1867": {
+    "id": 1867,
     "category": "Database",
+    "title": "Orders With Maximum Quantity Above Average",
     "difficulty": "Medium",
-    "id": 1867,
-    "link": "https://leetcode.com/problems/orders-with-maximum-quantity-above-average/",
-    "title": "Orders With Maximum Quantity Above Average"
+    "link": "https://leetcode.com/problems/orders-with-maximum-quantity-above-average/"
   },
   "1868": {
+    "id": 1868,
     "category": "Two Pointers",
+    "title": "Product of Two Run-Length Encoded Arrays",
     "difficulty": "Medium",
-    "id": 1868,
-    "link": "https://leetcode.com/problems/product-of-two-run-length-encoded-arrays/",
-    "title": "Product of Two Run-Length Encoded Arrays"
+    "link": "https://leetcode.com/problems/product-of-two-run-length-encoded-arrays/"
   },
   "1869": {
+    "id": 1869,
     "category": "Array & Hashing",
+    "title": "Longer Contiguous Segments of Ones than Zeros",
     "difficulty": "Easy",
-    "id": 1869,
-    "link": "https://leetcode.com/problems/longer-contiguous-segments-of-ones-than-zeros/",
-    "title": "Longer Contiguous Segments of Ones than Zeros"
+    "link": "https://leetcode.com/problems/longer-contiguous-segments-of-ones-than-zeros/"
   },
   "1870": {
+    "id": 1870,
     "category": "Binary Search",
+    "title": "Minimum Speed to Arrive on Time",
     "difficulty": "Medium",
-    "id": 1870,
-    "link": "https://leetcode.com/problems/minimum-speed-to-arrive-on-time/",
-    "title": "Minimum Speed to Arrive on Time"
+    "link": "https://leetcode.com/problems/minimum-speed-to-arrive-on-time/"
   },
   "1871": {
+    "id": 1871,
     "category": "Dynamic Programming",
+    "title": "Jump Game VII",
     "difficulty": "Medium",
-    "id": 1871,
-    "link": "https://leetcode.com/problems/jump-game-vii/",
-    "title": "Jump Game VII"
+    "link": "https://leetcode.com/problems/jump-game-vii/"
   },
   "1872": {
+    "id": 1872,
     "category": "Dynamic Programming",
+    "title": "Stone Game VIII",
     "difficulty": "Hard",
-    "id": 1872,
-    "link": "https://leetcode.com/problems/stone-game-viii/",
-    "title": "Stone Game VIII"
+    "link": "https://leetcode.com/problems/stone-game-viii/"
   },
   "1873": {
+    "id": 1873,
     "category": "Database",
+    "title": "Calculate Special Bonus",
     "difficulty": "Easy",
-    "id": 1873,
-    "link": "https://leetcode.com/problems/calculate-special-bonus/",
-    "title": "Calculate Special Bonus"
+    "link": "https://leetcode.com/problems/calculate-special-bonus/"
   },
   "1874": {
+    "id": 1874,
     "category": "Greedy",
+    "title": "Minimize Product Sum of Two Arrays",
     "difficulty": "Medium",
-    "id": 1874,
-    "link": "https://leetcode.com/problems/minimize-product-sum-of-two-arrays/",
-    "title": "Minimize Product Sum of Two Arrays"
+    "link": "https://leetcode.com/problems/minimize-product-sum-of-two-arrays/"
   },
   "1875": {
+    "id": 1875,
     "category": "Database",
+    "title": "Group Employees of the Same Salary",
     "difficulty": "Medium",
-    "id": 1875,
-    "link": "https://leetcode.com/problems/group-employees-of-the-same-salary/",
-    "title": "Group Employees of the Same Salary"
+    "link": "https://leetcode.com/problems/group-employees-of-the-same-salary/"
   },
   "1876": {
+    "id": 1876,
     "category": "Sliding Window",
+    "title": "Substrings of Size Three with Distinct Characters",
     "difficulty": "Easy",
-    "id": 1876,
-    "link": "https://leetcode.com/problems/substrings-of-size-three-with-distinct-characters/",
-    "title": "Substrings of Size Three with Distinct Characters"
+    "link": "https://leetcode.com/problems/substrings-of-size-three-with-distinct-characters/"
   },
   "1877": {
+    "id": 1877,
     "category": "Greedy",
+    "title": "Minimize Maximum Pair Sum in Array",
     "difficulty": "Medium",
-    "id": 1877,
-    "link": "https://leetcode.com/problems/minimize-maximum-pair-sum-in-array/",
-    "title": "Minimize Maximum Pair Sum in Array"
+    "link": "https://leetcode.com/problems/minimize-maximum-pair-sum-in-array/"
   },
   "1878": {
+    "id": 1878,
     "category": "Heap (Priority Queue)",
+    "title": "Get Biggest Three Rhombus Sums in a Grid",
     "difficulty": "Medium",
-    "id": 1878,
-    "link": "https://leetcode.com/problems/get-biggest-three-rhombus-sums-in-a-grid/",
-    "title": "Get Biggest Three Rhombus Sums in a Grid"
+    "link": "https://leetcode.com/problems/get-biggest-three-rhombus-sums-in-a-grid/"
   },
   "1879": {
+    "id": 1879,
     "category": "Dynamic Programming",
+    "title": "Minimum XOR Sum of Two Arrays",
     "difficulty": "Hard",
-    "id": 1879,
-    "link": "https://leetcode.com/problems/minimum-xor-sum-of-two-arrays/",
-    "title": "Minimum XOR Sum of Two Arrays"
+    "link": "https://leetcode.com/problems/minimum-xor-sum-of-two-arrays/"
   },
   "1880": {
+    "id": 1880,
     "category": "Array & Hashing",
+    "title": "Check if Word Equals Summation of Two Words",
     "difficulty": "Easy",
-    "id": 1880,
-    "link": "https://leetcode.com/problems/check-if-word-equals-summation-of-two-words/",
-    "title": "Check if Word Equals Summation of Two Words"
+    "link": "https://leetcode.com/problems/check-if-word-equals-summation-of-two-words/"
   },
   "1881": {
+    "id": 1881,
     "category": "Greedy",
+    "title": "Maximum Value after Insertion",
     "difficulty": "Medium",
-    "id": 1881,
-    "link": "https://leetcode.com/problems/maximum-value-after-insertion/",
-    "title": "Maximum Value after Insertion"
+    "link": "https://leetcode.com/problems/maximum-value-after-insertion/"
   },
   "1882": {
+    "id": 1882,
     "category": "Heap (Priority Queue)",
+    "title": "Process Tasks Using Servers",
     "difficulty": "Medium",
-    "id": 1882,
-    "link": "https://leetcode.com/problems/process-tasks-using-servers/",
-    "title": "Process Tasks Using Servers"
+    "link": "https://leetcode.com/problems/process-tasks-using-servers/"
   },
   "1883": {
+    "id": 1883,
     "category": "Dynamic Programming",
+    "title": "Minimum Skips to Arrive at Meeting On Time",
     "difficulty": "Hard",
-    "id": 1883,
-    "link": "https://leetcode.com/problems/minimum-skips-to-arrive-at-meeting-on-time/",
-    "title": "Minimum Skips to Arrive at Meeting On Time"
+    "link": "https://leetcode.com/problems/minimum-skips-to-arrive-at-meeting-on-time/"
   },
   "1884": {
+    "id": 1884,
     "category": "Dynamic Programming",
+    "title": "Egg Drop With 2 Eggs and N Floors",
     "difficulty": "Medium",
-    "id": 1884,
-    "link": "https://leetcode.com/problems/egg-drop-with-2-eggs-and-n-floors/",
-    "title": "Egg Drop With 2 Eggs and N Floors"
+    "link": "https://leetcode.com/problems/egg-drop-with-2-eggs-and-n-floors/"
   },
   "1885": {
+    "id": 1885,
     "category": "Binary Search",
+    "title": "Count Pairs in Two Arrays",
     "difficulty": "Medium",
-    "id": 1885,
-    "link": "https://leetcode.com/problems/count-pairs-in-two-arrays/",
-    "title": "Count Pairs in Two Arrays"
+    "link": "https://leetcode.com/problems/count-pairs-in-two-arrays/"
   },
   "1886": {
+    "id": 1886,
     "category": "Array & Hashing",
+    "title": "Determine Whether Matrix Can Be Obtained By Rotation",
     "difficulty": "Easy",
-    "id": 1886,
-    "link": "https://leetcode.com/problems/determine-whether-matrix-can-be-obtained-by-rotation/",
-    "title": "Determine Whether Matrix Can Be Obtained By Rotation"
+    "link": "https://leetcode.com/problems/determine-whether-matrix-can-be-obtained-by-rotation/"
   },
   "1887": {
+    "id": 1887,
     "category": "Array & Hashing",
+    "title": "Reduction Operations to Make the Array Elements Equal",
     "difficulty": "Medium",
-    "id": 1887,
-    "link": "https://leetcode.com/problems/reduction-operations-to-make-the-array-elements-equal/",
-    "title": "Reduction Operations to Make the Array Elements Equal"
+    "link": "https://leetcode.com/problems/reduction-operations-to-make-the-array-elements-equal/"
   },
   "1888": {
+    "id": 1888,
     "category": "Dynamic Programming",
+    "title": "Minimum Number of Flips to Make the Binary String Alternating",
     "difficulty": "Medium",
-    "id": 1888,
-    "link": "https://leetcode.com/problems/minimum-number-of-flips-to-make-the-binary-string-alternating/",
-    "title": "Minimum Number of Flips to Make the Binary String Alternating"
+    "link": "https://leetcode.com/problems/minimum-number-of-flips-to-make-the-binary-string-alternating/"
   },
   "1889": {
+    "id": 1889,
     "category": "Binary Search",
+    "title": "Minimum Space Wasted From Packaging",
     "difficulty": "Hard",
-    "id": 1889,
-    "link": "https://leetcode.com/problems/minimum-space-wasted-from-packaging/",
-    "title": "Minimum Space Wasted From Packaging"
+    "link": "https://leetcode.com/problems/minimum-space-wasted-from-packaging/"
   },
   "1890": {
+    "id": 1890,
     "category": "Database",
+    "title": "The Latest Login in 2020",
     "difficulty": "Easy",
-    "id": 1890,
-    "link": "https://leetcode.com/problems/the-latest-login-in-2020/",
-    "title": "The Latest Login in 2020"
+    "link": "https://leetcode.com/problems/the-latest-login-in-2020/"
   },
   "1891": {
+    "id": 1891,
     "category": "Binary Search",
+    "title": "Cutting Ribbons",
     "difficulty": "Medium",
-    "id": 1891,
-    "link": "https://leetcode.com/problems/cutting-ribbons/",
-    "title": "Cutting Ribbons"
+    "link": "https://leetcode.com/problems/cutting-ribbons/"
   },
   "1892": {
+    "id": 1892,
     "category": "Database",
+    "title": "Page Recommendations II",
     "difficulty": "Hard",
-    "id": 1892,
-    "link": "https://leetcode.com/problems/page-recommendations-ii/",
-    "title": "Page Recommendations II"
+    "link": "https://leetcode.com/problems/page-recommendations-ii/"
   },
   "1893": {
+    "id": 1893,
     "category": "Array & Hashing",
+    "title": "Check if All the Integers in a Range Are Covered",
     "difficulty": "Easy",
-    "id": 1893,
-    "link": "https://leetcode.com/problems/check-if-all-the-integers-in-a-range-are-covered/",
-    "title": "Check if All the Integers in a Range Are Covered"
+    "link": "https://leetcode.com/problems/check-if-all-the-integers-in-a-range-are-covered/"
   },
   "1894": {
+    "id": 1894,
     "category": "Binary Search",
+    "title": "Find the Student that Will Replace the Chalk",
     "difficulty": "Medium",
-    "id": 1894,
-    "link": "https://leetcode.com/problems/find-the-student-that-will-replace-the-chalk/",
-    "title": "Find the Student that Will Replace the Chalk"
+    "link": "https://leetcode.com/problems/find-the-student-that-will-replace-the-chalk/"
   },
   "1895": {
+    "id": 1895,
     "category": "Array & Hashing",
+    "title": "Largest Magic Square",
     "difficulty": "Medium",
-    "id": 1895,
-    "link": "https://leetcode.com/problems/largest-magic-square/",
-    "title": "Largest Magic Square"
+    "link": "https://leetcode.com/problems/largest-magic-square/"
   },
   "1896": {
+    "id": 1896,
     "category": "Dynamic Programming",
+    "title": "Minimum Cost to Change the Final Value of Expression",
     "difficulty": "Hard",
-    "id": 1896,
-    "link": "https://leetcode.com/problems/minimum-cost-to-change-the-final-value-of-expression/",
-    "title": "Minimum Cost to Change the Final Value of Expression"
+    "link": "https://leetcode.com/problems/minimum-cost-to-change-the-final-value-of-expression/"
   },
   "1897": {
+    "id": 1897,
     "category": "Array & Hashing",
+    "title": "Redistribute Characters to Make All Strings Equal",
     "difficulty": "Easy",
-    "id": 1897,
-    "link": "https://leetcode.com/problems/redistribute-characters-to-make-all-strings-equal/",
-    "title": "Redistribute Characters to Make All Strings Equal"
+    "link": "https://leetcode.com/problems/redistribute-characters-to-make-all-strings-equal/"
   },
   "1898": {
+    "id": 1898,
     "category": "Binary Search",
+    "title": "Maximum Number of Removable Characters",
     "difficulty": "Medium",
-    "id": 1898,
-    "link": "https://leetcode.com/problems/maximum-number-of-removable-characters/",
-    "title": "Maximum Number of Removable Characters"
+    "link": "https://leetcode.com/problems/maximum-number-of-removable-characters/"
   },
   "1899": {
+    "id": 1899,
     "category": "Greedy",
+    "title": "Merge Triplets to Form Target Triplet",
     "difficulty": "Medium",
-    "id": 1899,
-    "link": "https://leetcode.com/problems/merge-triplets-to-form-target-triplet/",
-    "title": "Merge Triplets to Form Target Triplet"
+    "link": "https://leetcode.com/problems/merge-triplets-to-form-target-triplet/"
   },
   "1900": {
+    "id": 1900,
     "category": "Dynamic Programming",
+    "title": "The Earliest and Latest Rounds Where Players Compete",
     "difficulty": "Hard",
-    "id": 1900,
-    "link": "https://leetcode.com/problems/the-earliest-and-latest-rounds-where-players-compete/",
-    "title": "The Earliest and Latest Rounds Where Players Compete"
+    "link": "https://leetcode.com/problems/the-earliest-and-latest-rounds-where-players-compete/"
   },
   "1901": {
+    "id": 1901,
     "category": "Binary Search",
+    "title": "Find a Peak Element II",
     "difficulty": "Medium",
-    "id": 1901,
-    "link": "https://leetcode.com/problems/find-a-peak-element-ii/",
-    "title": "Find a Peak Element II"
+    "link": "https://leetcode.com/problems/find-a-peak-element-ii/"
   },
   "1902": {
+    "id": 1902,
     "category": "Tree",
+    "title": "Depth of BST Given Insertion Order",
     "difficulty": "Medium",
-    "id": 1902,
-    "link": "https://leetcode.com/problems/depth-of-bst-given-insertion-order/",
-    "title": "Depth of BST Given Insertion Order"
+    "link": "https://leetcode.com/problems/depth-of-bst-given-insertion-order/"
   },
   "1903": {
+    "id": 1903,
     "category": "Greedy",
+    "title": "Largest Odd Number in String",
     "difficulty": "Easy",
-    "id": 1903,
-    "link": "https://leetcode.com/problems/largest-odd-number-in-string/",
-    "title": "Largest Odd Number in String"
+    "link": "https://leetcode.com/problems/largest-odd-number-in-string/"
   },
   "1904": {
+    "id": 1904,
     "category": "Math & Geometry",
+    "title": "The Number of Full Rounds You Have Played",
     "difficulty": "Medium",
-    "id": 1904,
-    "link": "https://leetcode.com/problems/the-number-of-full-rounds-you-have-played/",
-    "title": "The Number of Full Rounds You Have Played"
+    "link": "https://leetcode.com/problems/the-number-of-full-rounds-you-have-played/"
   },
   "1905": {
+    "id": 1905,
     "category": "Graph Traversal",
+    "title": "Count Sub Islands",
     "difficulty": "Medium",
-    "id": 1905,
-    "link": "https://leetcode.com/problems/count-sub-islands/",
-    "title": "Count Sub Islands"
+    "link": "https://leetcode.com/problems/count-sub-islands/"
   },
   "1906": {
+    "id": 1906,
     "category": "Array & Hashing",
+    "title": "Minimum Absolute Difference Queries",
     "difficulty": "Medium",
-    "id": 1906,
-    "link": "https://leetcode.com/problems/minimum-absolute-difference-queries/",
-    "title": "Minimum Absolute Difference Queries"
+    "link": "https://leetcode.com/problems/minimum-absolute-difference-queries/"
   },
   "1907": {
+    "id": 1907,
     "category": "Database",
+    "title": "Count Salary Categories",
     "difficulty": "Medium",
-    "id": 1907,
-    "link": "https://leetcode.com/problems/count-salary-categories/",
-    "title": "Count Salary Categories"
+    "link": "https://leetcode.com/problems/count-salary-categories/"
   },
   "1908": {
+    "id": 1908,
     "category": "Dynamic Programming",
+    "title": "Game of Nim",
     "difficulty": "Medium",
-    "id": 1908,
-    "link": "https://leetcode.com/problems/game-of-nim/",
-    "title": "Game of Nim"
+    "link": "https://leetcode.com/problems/game-of-nim/"
   },
   "1909": {
+    "id": 1909,
     "category": "Array & Hashing",
+    "title": "Remove One Element to Make the Array Strictly Increasing",
     "difficulty": "Easy",
-    "id": 1909,
-    "link": "https://leetcode.com/problems/remove-one-element-to-make-the-array-strictly-increasing/",
-    "title": "Remove One Element to Make the Array Strictly Increasing"
+    "link": "https://leetcode.com/problems/remove-one-element-to-make-the-array-strictly-increasing/"
   },
   "1910": {
+    "id": 1910,
     "category": "Stack",
+    "title": "Remove All Occurrences of a Substring",
     "difficulty": "Medium",
-    "id": 1910,
-    "link": "https://leetcode.com/problems/remove-all-occurrences-of-a-substring/",
-    "title": "Remove All Occurrences of a Substring"
+    "link": "https://leetcode.com/problems/remove-all-occurrences-of-a-substring/"
   },
   "1911": {
+    "id": 1911,
     "category": "Dynamic Programming",
+    "title": "Maximum Alternating Subsequence Sum",
     "difficulty": "Medium",
-    "id": 1911,
-    "link": "https://leetcode.com/problems/maximum-alternating-subsequence-sum/",
-    "title": "Maximum Alternating Subsequence Sum"
+    "link": "https://leetcode.com/problems/maximum-alternating-subsequence-sum/"
   },
   "1912": {
+    "id": 1912,
     "category": "Heap (Priority Queue)",
+    "title": "Design Movie Rental System",
     "difficulty": "Hard",
-    "id": 1912,
-    "link": "https://leetcode.com/problems/design-movie-rental-system/",
-    "title": "Design Movie Rental System"
+    "link": "https://leetcode.com/problems/design-movie-rental-system/"
   },
   "1913": {
+    "id": 1913,
     "category": "Array & Hashing",
+    "title": "Maximum Product Difference Between Two Pairs",
     "difficulty": "Easy",
-    "id": 1913,
-    "link": "https://leetcode.com/problems/maximum-product-difference-between-two-pairs/",
-    "title": "Maximum Product Difference Between Two Pairs"
+    "link": "https://leetcode.com/problems/maximum-product-difference-between-two-pairs/"
   },
   "1914": {
+    "id": 1914,
     "category": "Array & Hashing",
+    "title": "Cyclically Rotating a Grid",
     "difficulty": "Medium",
-    "id": 1914,
-    "link": "https://leetcode.com/problems/cyclically-rotating-a-grid/",
-    "title": "Cyclically Rotating a Grid"
+    "link": "https://leetcode.com/problems/cyclically-rotating-a-grid/"
   },
   "1915": {
+    "id": 1915,
     "category": "Bit Manipulation",
+    "title": "Number of Wonderful Substrings",
     "difficulty": "Medium",
-    "id": 1915,
-    "link": "https://leetcode.com/problems/number-of-wonderful-substrings/",
-    "title": "Number of Wonderful Substrings"
+    "link": "https://leetcode.com/problems/number-of-wonderful-substrings/"
   },
   "1916": {
+    "id": 1916,
     "category": "Tree",
+    "title": "Count Ways to Build Rooms in an Ant Colony",
     "difficulty": "Hard",
-    "id": 1916,
-    "link": "https://leetcode.com/problems/count-ways-to-build-rooms-in-an-ant-colony/",
-    "title": "Count Ways to Build Rooms in an Ant Colony"
+    "link": "https://leetcode.com/problems/count-ways-to-build-rooms-in-an-ant-colony/"
   },
   "1917": {
+    "id": 1917,
     "category": "Database",
+    "title": "Leetcodify Friends Recommendations",
     "difficulty": "Hard",
-    "id": 1917,
-    "link": "https://leetcode.com/problems/leetcodify-friends-recommendations/",
-    "title": "Leetcodify Friends Recommendations"
+    "link": "https://leetcode.com/problems/leetcodify-friends-recommendations/"
   },
   "1918": {
+    "id": 1918,
     "category": "Sliding Window",
+    "title": "Kth Smallest Subarray Sum",
     "difficulty": "Medium",
-    "id": 1918,
-    "link": "https://leetcode.com/problems/kth-smallest-subarray-sum/",
-    "title": "Kth Smallest Subarray Sum"
+    "link": "https://leetcode.com/problems/kth-smallest-subarray-sum/"
   },
   "1919": {
+    "id": 1919,
     "category": "Database",
+    "title": "Leetcodify Similar Friends",
     "difficulty": "Hard",
-    "id": 1919,
-    "link": "https://leetcode.com/problems/leetcodify-similar-friends/",
-    "title": "Leetcodify Similar Friends"
+    "link": "https://leetcode.com/problems/leetcodify-similar-friends/"
   },
   "1920": {
+    "id": 1920,
     "category": "Array & Hashing",
+    "title": "Build Array from Permutation",
     "difficulty": "Easy",
-    "id": 1920,
-    "link": "https://leetcode.com/problems/build-array-from-permutation/",
-    "title": "Build Array from Permutation"
+    "link": "https://leetcode.com/problems/build-array-from-permutation/"
   },
   "1921": {
+    "id": 1921,
     "category": "Greedy",
+    "title": "Eliminate Maximum Number of Monsters",
     "difficulty": "Medium",
-    "id": 1921,
-    "link": "https://leetcode.com/problems/eliminate-maximum-number-of-monsters/",
-    "title": "Eliminate Maximum Number of Monsters"
+    "link": "https://leetcode.com/problems/eliminate-maximum-number-of-monsters/"
   },
   "1922": {
+    "id": 1922,
     "category": "Math & Geometry",
+    "title": "Count Good Numbers",
     "difficulty": "Medium",
-    "id": 1922,
-    "link": "https://leetcode.com/problems/count-good-numbers/",
-    "title": "Count Good Numbers"
+    "link": "https://leetcode.com/problems/count-good-numbers/"
   },
   "1923": {
+    "id": 1923,
     "category": "Binary Search",
+    "title": "Longest Common Subpath",
     "difficulty": "Hard",
-    "id": 1923,
-    "link": "https://leetcode.com/problems/longest-common-subpath/",
-    "title": "Longest Common Subpath"
+    "link": "https://leetcode.com/problems/longest-common-subpath/"
   },
   "1924": {
+    "id": 1924,
     "category": "Math & Geometry",
+    "title": "Erect the Fence II",
     "difficulty": "Hard",
-    "id": 1924,
-    "link": "https://leetcode.com/problems/erect-the-fence-ii/",
-    "title": "Erect the Fence II"
+    "link": "https://leetcode.com/problems/erect-the-fence-ii/"
   },
   "1925": {
+    "id": 1925,
     "category": "Math & Geometry",
+    "title": "Count Square Sum Triples",
     "difficulty": "Easy",
-    "id": 1925,
-    "link": "https://leetcode.com/problems/count-square-sum-triples/",
-    "title": "Count Square Sum Triples"
+    "link": "https://leetcode.com/problems/count-square-sum-triples/"
   },
   "1926": {
+    "id": 1926,
     "category": "Graph Traversal",
+    "title": "Nearest Exit from Entrance in Maze",
     "difficulty": "Medium",
-    "id": 1926,
-    "link": "https://leetcode.com/problems/nearest-exit-from-entrance-in-maze/",
-    "title": "Nearest Exit from Entrance in Maze"
+    "link": "https://leetcode.com/problems/nearest-exit-from-entrance-in-maze/"
+  },
+  "1927": {
+    "id": 1927,
+    "category": "Greedy",
+    "title": "Sum Game",
+    "difficulty": "Medium",
+    "link": "https://leetcode.com/problems/sum-game/"
   },
-  "1927": {"category": "Greedy", "difficulty": "Medium", "id": 1927, "link": "https://leetcode.com/problems/sum-game/", "title": "Sum Game"},
   "1928": {
+    "id": 1928,
     "category": "Graph Traversal",
+    "title": "Minimum Cost to Reach Destination in Time",
     "difficulty": "Hard",
-    "id": 1928,
-    "link": "https://leetcode.com/problems/minimum-cost-to-reach-destination-in-time/",
-    "title": "Minimum Cost to Reach Destination in Time"
+    "link": "https://leetcode.com/problems/minimum-cost-to-reach-destination-in-time/"
   },
   "1929": {
+    "id": 1929,
     "category": "Array & Hashing",
+    "title": "Concatenation of Array",
     "difficulty": "Easy",
-    "id": 1929,
-    "link": "https://leetcode.com/problems/concatenation-of-array/",
-    "title": "Concatenation of Array"
+    "link": "https://leetcode.com/problems/concatenation-of-array/"
   },
   "1930": {
+    "id": 1930,
     "category": "Bit Manipulation",
+    "title": "Unique Length-3 Palindromic Subsequences",
     "difficulty": "Medium",
-    "id": 1930,
-    "link": "https://leetcode.com/problems/unique-length-3-palindromic-subsequences/",
-    "title": "Unique Length-3 Palindromic Subsequences"
+    "link": "https://leetcode.com/problems/unique-length-3-palindromic-subsequences/"
   },
   "1931": {
+    "id": 1931,
     "category": "Dynamic Programming",
+    "title": "Painting a Grid With Three Different Colors",
     "difficulty": "Hard",
-    "id": 1931,
-    "link": "https://leetcode.com/problems/painting-a-grid-with-three-different-colors/",
-    "title": "Painting a Grid With Three Different Colors"
+    "link": "https://leetcode.com/problems/painting-a-grid-with-three-different-colors/"
   },
   "1932": {
+    "id": 1932,
     "category": "Tree",
+    "title": "Merge BSTs to Create Single BST",
     "difficulty": "Hard",
-    "id": 1932,
-    "link": "https://leetcode.com/problems/merge-bsts-to-create-single-bst/",
-    "title": "Merge BSTs to Create Single BST"
+    "link": "https://leetcode.com/problems/merge-bsts-to-create-single-bst/"
   },
   "1933": {
+    "id": 1933,
     "category": "Array & Hashing",
+    "title": "Check if String Is Decomposable Into Value-Equal Substrings",
     "difficulty": "Easy",
-    "id": 1933,
-    "link": "https://leetcode.com/problems/check-if-string-is-decomposable-into-value-equal-substrings/",
-    "title": "Check if String Is Decomposable Into Value-Equal Substrings"
+    "link": "https://leetcode.com/problems/check-if-string-is-decomposable-into-value-equal-substrings/"
   },
   "1934": {
+    "id": 1934,
     "category": "Database",
+    "title": "Confirmation Rate",
     "difficulty": "Medium",
-    "id": 1934,
-    "link": "https://leetcode.com/problems/confirmation-rate/",
-    "title": "Confirmation Rate"
+    "link": "https://leetcode.com/problems/confirmation-rate/"
   },
   "1935": {
+    "id": 1935,
     "category": "Array & Hashing",
+    "title": "Maximum Number of Words You Can Type",
     "difficulty": "Easy",
-    "id": 1935,
-    "link": "https://leetcode.com/problems/maximum-number-of-words-you-can-type/",
-    "title": "Maximum Number of Words You Can Type"
+    "link": "https://leetcode.com/problems/maximum-number-of-words-you-can-type/"
   },
   "1936": {
+    "id": 1936,
     "category": "Greedy",
+    "title": "Add Minimum Number of Rungs",
     "difficulty": "Medium",
-    "id": 1936,
-    "link": "https://leetcode.com/problems/add-minimum-number-of-rungs/",
-    "title": "Add Minimum Number of Rungs"
+    "link": "https://leetcode.com/problems/add-minimum-number-of-rungs/"
   },
   "1937": {
+    "id": 1937,
     "category": "Dynamic Programming",
+    "title": "Maximum Number of Points with Cost",
     "difficulty": "Medium",
-    "id": 1937,
-    "link": "https://leetcode.com/problems/maximum-number-of-points-with-cost/",
-    "title": "Maximum Number of Points with Cost"
+    "link": "https://leetcode.com/problems/maximum-number-of-points-with-cost/"
   },
   "1938": {
+    "id": 1938,
     "category": "Graph Traversal",
+    "title": "Maximum Genetic Difference Query",
     "difficulty": "Hard",
-    "id": 1938,
-    "link": "https://leetcode.com/problems/maximum-genetic-difference-query/",
-    "title": "Maximum Genetic Difference Query"
+    "link": "https://leetcode.com/problems/maximum-genetic-difference-query/"
   },
   "1939": {
+    "id": 1939,
     "category": "Database",
+    "title": "Users That Actively Request Confirmation Messages",
     "difficulty": "Easy",
-    "id": 1939,
-    "link": "https://leetcode.com/problems/users-that-actively-request-confirmation-messages/",
-    "title": "Users That Actively Request Confirmation Messages"
+    "link": "https://leetcode.com/problems/users-that-actively-request-confirmation-messages/"
   },
   "1940": {
+    "id": 1940,
     "category": "Array & Hashing",
+    "title": "Longest Common Subsequence Between Sorted Arrays",
     "difficulty": "Medium",
-    "id": 1940,
-    "link": "https://leetcode.com/problems/longest-common-subsequence-between-sorted-arrays/",
-    "title": "Longest Common Subsequence Between Sorted Arrays"
+    "link": "https://leetcode.com/problems/longest-common-subsequence-between-sorted-arrays/"
   },
   "1941": {
+    "id": 1941,
     "category": "Array & Hashing",
+    "title": "Check if All Characters Have Equal Number of Occurrences",
     "difficulty": "Easy",
-    "id": 1941,
-    "link": "https://leetcode.com/problems/check-if-all-characters-have-equal-number-of-occurrences/",
-    "title": "Check if All Characters Have Equal Number of Occurrences"
+    "link": "https://leetcode.com/problems/check-if-all-characters-have-equal-number-of-occurrences/"
   },
   "1942": {
+    "id": 1942,
     "category": "Heap (Priority Queue)",
+    "title": "The Number of the Smallest Unoccupied Chair",
     "difficulty": "Medium",
-    "id": 1942,
-    "link": "https://leetcode.com/problems/the-number-of-the-smallest-unoccupied-chair/",
-    "title": "The Number of the Smallest Unoccupied Chair"
+    "link": "https://leetcode.com/problems/the-number-of-the-smallest-unoccupied-chair/"
   },
   "1943": {
+    "id": 1943,
     "category": "Array & Hashing",
+    "title": "Describe the Painting",
     "difficulty": "Medium",
-    "id": 1943,
-    "link": "https://leetcode.com/problems/describe-the-painting/",
-    "title": "Describe the Painting"
+    "link": "https://leetcode.com/problems/describe-the-painting/"
   },
   "1944": {
+    "id": 1944,
     "category": "Stack",
+    "title": "Number of Visible People in a Queue",
     "difficulty": "Hard",
-    "id": 1944,
-    "link": "https://leetcode.com/problems/number-of-visible-people-in-a-queue/",
-    "title": "Number of Visible People in a Queue"
+    "link": "https://leetcode.com/problems/number-of-visible-people-in-a-queue/"
   },
   "1945": {
+    "id": 1945,
     "category": "Array & Hashing",
+    "title": "Sum of Digits of String After Convert",
     "difficulty": "Easy",
-    "id": 1945,
-    "link": "https://leetcode.com/problems/sum-of-digits-of-string-after-convert/",
-    "title": "Sum of Digits of String After Convert"
+    "link": "https://leetcode.com/problems/sum-of-digits-of-string-after-convert/"
   },
   "1946": {
+    "id": 1946,
     "category": "Greedy",
+    "title": "Largest Number After Mutating Substring",
     "difficulty": "Medium",
-    "id": 1946,
-    "link": "https://leetcode.com/problems/largest-number-after-mutating-substring/",
-    "title": "Largest Number After Mutating Substring"
+    "link": "https://leetcode.com/problems/largest-number-after-mutating-substring/"
   },
   "1947": {
+    "id": 1947,
     "category": "Dynamic Programming",
+    "title": "Maximum Compatibility Score Sum",
     "difficulty": "Medium",
-    "id": 1947,
-    "link": "https://leetcode.com/problems/maximum-compatibility-score-sum/",
-    "title": "Maximum Compatibility Score Sum"
+    "link": "https://leetcode.com/problems/maximum-compatibility-score-sum/"
   },
   "1948": {
+    "id": 1948,
     "category": "Trie",
+    "title": "Delete Duplicate Folders in System",
     "difficulty": "Hard",
-    "id": 1948,
-    "link": "https://leetcode.com/problems/delete-duplicate-folders-in-system/",
-    "title": "Delete Duplicate Folders in System"
+    "link": "https://leetcode.com/problems/delete-duplicate-folders-in-system/"
   },
   "1949": {
+    "id": 1949,
     "category": "Database",
+    "title": "Strong Friendship",
     "difficulty": "Medium",
-    "id": 1949,
-    "link": "https://leetcode.com/problems/strong-friendship/",
-    "title": "Strong Friendship"
+    "link": "https://leetcode.com/problems/strong-friendship/"
   },
   "1950": {
+    "id": 1950,
     "category": "Stack",
+    "title": "Maximum of Minimum Values in All Subarrays",
     "difficulty": "Medium",
-    "id": 1950,
-    "link": "https://leetcode.com/problems/maximum-of-minimum-values-in-all-subarrays/",
-    "title": "Maximum of Minimum Values in All Subarrays"
+    "link": "https://leetcode.com/problems/maximum-of-minimum-values-in-all-subarrays/"
   },
   "1951": {
+    "id": 1951,
     "category": "Database",
+    "title": "All the Pairs With the Maximum Number of Common Followers",
     "difficulty": "Medium",
-    "id": 1951,
-    "link": "https://leetcode.com/problems/all-the-pairs-with-the-maximum-number-of-common-followers/",
-    "title": "All the Pairs With the Maximum Number of Common Followers"
+    "link": "https://leetcode.com/problems/all-the-pairs-with-the-maximum-number-of-common-followers/"
   },
   "1952": {
+    "id": 1952,
     "category": "Math & Geometry",
+    "title": "Three Divisors",
     "difficulty": "Easy",
-    "id": 1952,
-    "link": "https://leetcode.com/problems/three-divisors/",
-    "title": "Three Divisors"
+    "link": "https://leetcode.com/problems/three-divisors/"
   },
   "1953": {
+    "id": 1953,
     "category": "Greedy",
+    "title": "Maximum Number of Weeks for Which You Can Work",
     "difficulty": "Medium",
-    "id": 1953,
-    "link": "https://leetcode.com/problems/maximum-number-of-weeks-for-which-you-can-work/",
-    "title": "Maximum Number of Weeks for Which You Can Work"
+    "link": "https://leetcode.com/problems/maximum-number-of-weeks-for-which-you-can-work/"
   },
   "1954": {
+    "id": 1954,
     "category": "Binary Search",
+    "title": "Minimum Garden Perimeter to Collect Enough Apples",
     "difficulty": "Medium",
-    "id": 1954,
-    "link": "https://leetcode.com/problems/minimum-garden-perimeter-to-collect-enough-apples/",
-    "title": "Minimum Garden Perimeter to Collect Enough Apples"
+    "link": "https://leetcode.com/problems/minimum-garden-perimeter-to-collect-enough-apples/"
   },
   "1955": {
+    "id": 1955,
     "category": "Dynamic Programming",
+    "title": "Count Number of Special Subsequences",
     "difficulty": "Hard",
-    "id": 1955,
-    "link": "https://leetcode.com/problems/count-number-of-special-subsequences/",
-    "title": "Count Number of Special Subsequences"
+    "link": "https://leetcode.com/problems/count-number-of-special-subsequences/"
   },
   "1956": {
+    "id": 1956,
     "category": "Binary Search",
+    "title": "Minimum Time For K Virus Variants to Spread",
     "difficulty": "Hard",
-    "id": 1956,
-    "link": "https://leetcode.com/problems/minimum-time-for-k-virus-variants-to-spread/",
-    "title": "Minimum Time For K Virus Variants to Spread"
+    "link": "https://leetcode.com/problems/minimum-time-for-k-virus-variants-to-spread/"
   },
   "1957": {
+    "id": 1957,
     "category": "Array & Hashing",
+    "title": "Delete Characters to Make Fancy String",
     "difficulty": "Easy",
-    "id": 1957,
-    "link": "https://leetcode.com/problems/delete-characters-to-make-fancy-string/",
-    "title": "Delete Characters to Make Fancy String"
+    "link": "https://leetcode.com/problems/delete-characters-to-make-fancy-string/"
   },
   "1958": {
+    "id": 1958,
     "category": "Array & Hashing",
+    "title": "Check if Move is Legal",
     "difficulty": "Medium",
-    "id": 1958,
-    "link": "https://leetcode.com/problems/check-if-move-is-legal/",
-    "title": "Check if Move is Legal"
+    "link": "https://leetcode.com/problems/check-if-move-is-legal/"
   },
   "1959": {
+    "id": 1959,
     "category": "Dynamic Programming",
+    "title": "Minimum Total Space Wasted With K Resizing Operations",
     "difficulty": "Medium",
-    "id": 1959,
-    "link": "https://leetcode.com/problems/minimum-total-space-wasted-with-k-resizing-operations/",
-    "title": "Minimum Total Space Wasted With K Resizing Operations"
+    "link": "https://leetcode.com/problems/minimum-total-space-wasted-with-k-resizing-operations/"
   },
   "1960": {
+    "id": 1960,
     "category": "Array & Hashing",
+    "title": "Maximum Product of the Length of Two Palindromic Substrings",
     "difficulty": "Hard",
-    "id": 1960,
-    "link": "https://leetcode.com/problems/maximum-product-of-the-length-of-two-palindromic-substrings/",
-    "title": "Maximum Product of the Length of Two Palindromic Substrings"
+    "link": "https://leetcode.com/problems/maximum-product-of-the-length-of-two-palindromic-substrings/"
   },
   "1961": {
+    "id": 1961,
     "category": "Two Pointers",
+    "title": "Check If String Is a Prefix of Array",
     "difficulty": "Easy",
-    "id": 1961,
-    "link": "https://leetcode.com/problems/check-if-string-is-a-prefix-of-array/",
-    "title": "Check If String Is a Prefix of Array"
+    "link": "https://leetcode.com/problems/check-if-string-is-a-prefix-of-array/"
   },
   "1962": {
+    "id": 1962,
     "category": "Heap (Priority Queue)",
+    "title": "Remove Stones to Minimize the Total",
     "difficulty": "Medium",
-    "id": 1962,
-    "link": "https://leetcode.com/problems/remove-stones-to-minimize-the-total/",
-    "title": "Remove Stones to Minimize the Total"
+    "link": "https://leetcode.com/problems/remove-stones-to-minimize-the-total/"
   },
   "1963": {
+    "id": 1963,
     "category": "Stack",
+    "title": "Minimum Number of Swaps to Make the String Balanced",
     "difficulty": "Medium",
-    "id": 1963,
-    "link": "https://leetcode.com/problems/minimum-number-of-swaps-to-make-the-string-balanced/",
-    "title": "Minimum Number of Swaps to Make the String Balanced"
+    "link": "https://leetcode.com/problems/minimum-number-of-swaps-to-make-the-string-balanced/"
   },
   "1964": {
+    "id": 1964,
     "category": "Tree",
+    "title": "Find the Longest Valid Obstacle Course at Each Position",
     "difficulty": "Hard",
-    "id": 1964,
-    "link": "https://leetcode.com/problems/find-the-longest-valid-obstacle-course-at-each-position/",
-    "title": "Find the Longest Valid Obstacle Course at Each Position"
+    "link": "https://leetcode.com/problems/find-the-longest-valid-obstacle-course-at-each-position/"
   },
   "1965": {
+    "id": 1965,
     "category": "Database",
+    "title": "Employees With Missing Information",
     "difficulty": "Easy",
-    "id": 1965,
-    "link": "https://leetcode.com/problems/employees-with-missing-information/",
-    "title": "Employees With Missing Information"
+    "link": "https://leetcode.com/problems/employees-with-missing-information/"
   },
   "1966": {
+    "id": 1966,
     "category": "Binary Search",
+    "title": "Binary Searchable Numbers in an Unsorted Array",
     "difficulty": "Medium",
-    "id": 1966,
-    "link": "https://leetcode.com/problems/binary-searchable-numbers-in-an-unsorted-array/",
-    "title": "Binary Searchable Numbers in an Unsorted Array"
+    "link": "https://leetcode.com/problems/binary-searchable-numbers-in-an-unsorted-array/"
   },
   "1967": {
+    "id": 1967,
     "category": "Array & Hashing",
+    "title": "Number of Strings That Appear as Substrings in Word",
     "difficulty": "Easy",
-    "id": 1967,
-    "link": "https://leetcode.com/problems/number-of-strings-that-appear-as-substrings-in-word/",
-    "title": "Number of Strings That Appear as Substrings in Word"
+    "link": "https://leetcode.com/problems/number-of-strings-that-appear-as-substrings-in-word/"
   },
   "1968": {
+    "id": 1968,
     "category": "Greedy",
+    "title": "Array With Elements Not Equal to Average of Neighbors",
     "difficulty": "Medium",
-    "id": 1968,
-    "link": "https://leetcode.com/problems/array-with-elements-not-equal-to-average-of-neighbors/",
-    "title": "Array With Elements Not Equal to Average of Neighbors"
+    "link": "https://leetcode.com/problems/array-with-elements-not-equal-to-average-of-neighbors/"
   },
   "1969": {
+    "id": 1969,
     "category": "Greedy",
+    "title": "Minimum Non-Zero Product of the Array Elements",
     "difficulty": "Medium",
-    "id": 1969,
-    "link": "https://leetcode.com/problems/minimum-non-zero-product-of-the-array-elements/",
-    "title": "Minimum Non-Zero Product of the Array Elements"
+    "link": "https://leetcode.com/problems/minimum-non-zero-product-of-the-array-elements/"
   },
   "1970": {
+    "id": 1970,
     "category": "Graph Traversal",
+    "title": "Last Day Where You Can Still Cross",
     "difficulty": "Hard",
-    "id": 1970,
-    "link": "https://leetcode.com/problems/last-day-where-you-can-still-cross/",
-    "title": "Last Day Where You Can Still Cross"
+    "link": "https://leetcode.com/problems/last-day-where-you-can-still-cross/"
   },
   "1971": {
+    "id": 1971,
     "category": "Graph Traversal",
+    "title": "Find if Path Exists in Graph",
     "difficulty": "Easy",
-    "id": 1971,
-    "link": "https://leetcode.com/problems/find-if-path-exists-in-graph/",
-    "title": "Find if Path Exists in Graph"
+    "link": "https://leetcode.com/problems/find-if-path-exists-in-graph/"
   },
   "1972": {
+    "id": 1972,
     "category": "Database",
+    "title": "First and Last Call On the Same Day",
     "difficulty": "Hard",
-    "id": 1972,
-    "link": "https://leetcode.com/problems/first-and-last-call-on-the-same-day/",
-    "title": "First and Last Call On the Same Day"
+    "link": "https://leetcode.com/problems/first-and-last-call-on-the-same-day/"
   },
   "1973": {
+    "id": 1973,
     "category": "Tree",
+    "title": "Count Nodes Equal to Sum of Descendants",
     "difficulty": "Medium",
-    "id": 1973,
-    "link": "https://leetcode.com/problems/count-nodes-equal-to-sum-of-descendants/",
-    "title": "Count Nodes Equal to Sum of Descendants"
+    "link": "https://leetcode.com/problems/count-nodes-equal-to-sum-of-descendants/"
   },
   "1974": {
+    "id": 1974,
     "category": "Greedy",
+    "title": "Minimum Time to Type Word Using Special Typewriter",
     "difficulty": "Easy",
-    "id": 1974,
-    "link": "https://leetcode.com/problems/minimum-time-to-type-word-using-special-typewriter/",
-    "title": "Minimum Time to Type Word Using Special Typewriter"
+    "link": "https://leetcode.com/problems/minimum-time-to-type-word-using-special-typewriter/"
   },
   "1975": {
+    "id": 1975,
     "category": "Greedy",
+    "title": "Maximum Matrix Sum",
     "difficulty": "Medium",
-    "id": 1975,
-    "link": "https://leetcode.com/problems/maximum-matrix-sum/",
-    "title": "Maximum Matrix Sum"
+    "link": "https://leetcode.com/problems/maximum-matrix-sum/"
   },
   "1976": {
+    "id": 1976,
     "category": "Graph Traversal",
+    "title": "Number of Ways to Arrive at Destination",
     "difficulty": "Medium",
-    "id": 1976,
-    "link": "https://leetcode.com/problems/number-of-ways-to-arrive-at-destination/",
-    "title": "Number of Ways to Arrive at Destination"
+    "link": "https://leetcode.com/problems/number-of-ways-to-arrive-at-destination/"
   },
   "1977": {
+    "id": 1977,
     "category": "Dynamic Programming",
+    "title": "Number of Ways to Separate Numbers",
     "difficulty": "Hard",
-    "id": 1977,
-    "link": "https://leetcode.com/problems/number-of-ways-to-separate-numbers/",
-    "title": "Number of Ways to Separate Numbers"
+    "link": "https://leetcode.com/problems/number-of-ways-to-separate-numbers/"
   },
   "1978": {
+    "id": 1978,
     "category": "Database",
+    "title": "Employees Whose Manager Left the Company",
     "difficulty": "Easy",
-    "id": 1978,
-    "link": "https://leetcode.com/problems/employees-whose-manager-left-the-company/",
-    "title": "Employees Whose Manager Left the Company"
+    "link": "https://leetcode.com/problems/employees-whose-manager-left-the-company/"
   },
   "1979": {
+    "id": 1979,
     "category": "Math & Geometry",
+    "title": "Find Greatest Common Divisor of Array",
     "difficulty": "Easy",
-    "id": 1979,
-    "link": "https://leetcode.com/problems/find-greatest-common-divisor-of-array/",
-    "title": "Find Greatest Common Divisor of Array"
+    "link": "https://leetcode.com/problems/find-greatest-common-divisor-of-array/"
   },
   "1980": {
+    "id": 1980,
     "category": "Backtracking",
+    "title": "Find Unique Binary String",
     "difficulty": "Medium",
-    "id": 1980,
-    "link": "https://leetcode.com/problems/find-unique-binary-string/",
-    "title": "Find Unique Binary String"
+    "link": "https://leetcode.com/problems/find-unique-binary-string/"
   },
   "1981": {
+    "id": 1981,
     "category": "Dynamic Programming",
+    "title": "Minimize the Difference Between Target and Chosen Elements",
     "difficulty": "Medium",
-    "id": 1981,
-    "link": "https://leetcode.com/problems/minimize-the-difference-between-target-and-chosen-elements/",
-    "title": "Minimize the Difference Between Target and Chosen Elements"
+    "link": "https://leetcode.com/problems/minimize-the-difference-between-target-and-chosen-elements/"
   },
   "1982": {
+    "id": 1982,
     "category": "Array & Hashing",
+    "title": "Find Array Given Subset Sums",
     "difficulty": "Hard",
-    "id": 1982,
-    "link": "https://leetcode.com/problems/find-array-given-subset-sums/",
-    "title": "Find Array Given Subset Sums"
+    "link": "https://leetcode.com/problems/find-array-given-subset-sums/"
   },
   "1983": {
+    "id": 1983,
     "category": "Array & Hashing",
+    "title": "Widest Pair of Indices With Equal Range Sum",
     "difficulty": "Medium",
-    "id": 1983,
-    "link": "https://leetcode.com/problems/widest-pair-of-indices-with-equal-range-sum/",
-    "title": "Widest Pair of Indices With Equal Range Sum"
+    "link": "https://leetcode.com/problems/widest-pair-of-indices-with-equal-range-sum/"
   },
   "1984": {
+    "id": 1984,
     "category": "Sliding Window",
+    "title": "Minimum Difference Between Highest and Lowest of K Scores",
     "difficulty": "Easy",
-    "id": 1984,
-    "link": "https://leetcode.com/problems/minimum-difference-between-highest-and-lowest-of-k-scores/",
-    "title": "Minimum Difference Between Highest and Lowest of K Scores"
+    "link": "https://leetcode.com/problems/minimum-difference-between-highest-and-lowest-of-k-scores/"
   },
   "1985": {
+    "id": 1985,
     "category": "Heap (Priority Queue)",
+    "title": "Find the Kth Largest Integer in the Array",
     "difficulty": "Medium",
-    "id": 1985,
-    "link": "https://leetcode.com/problems/find-the-kth-largest-integer-in-the-array/",
-    "title": "Find the Kth Largest Integer in the Array"
+    "link": "https://leetcode.com/problems/find-the-kth-largest-integer-in-the-array/"
   },
   "1986": {
+    "id": 1986,
     "category": "Dynamic Programming",
+    "title": "Minimum Number of Work Sessions to Finish the Tasks",
     "difficulty": "Medium",
-    "id": 1986,
-    "link": "https://leetcode.com/problems/minimum-number-of-work-sessions-to-finish-the-tasks/",
-    "title": "Minimum Number of Work Sessions to Finish the Tasks"
+    "link": "https://leetcode.com/problems/minimum-number-of-work-sessions-to-finish-the-tasks/"
   },
   "1987": {
+    "id": 1987,
     "category": "Dynamic Programming",
+    "title": "Number of Unique Good Subsequences",
     "difficulty": "Hard",
-    "id": 1987,
-    "link": "https://leetcode.com/problems/number-of-unique-good-subsequences/",
-    "title": "Number of Unique Good Subsequences"
+    "link": "https://leetcode.com/problems/number-of-unique-good-subsequences/"
   },
   "1988": {
+    "id": 1988,
     "category": "Database",
+    "title": "Find Cutoff Score for Each School",
     "difficulty": "Medium",
-    "id": 1988,
-    "link": "https://leetcode.com/problems/find-cutoff-score-for-each-school/",
-    "title": "Find Cutoff Score for Each School"
+    "link": "https://leetcode.com/problems/find-cutoff-score-for-each-school/"
   },
   "1989": {
+    "id": 1989,
     "category": "Greedy",
+    "title": "Maximum Number of People That Can Be Caught in Tag",
     "difficulty": "Medium",
-    "id": 1989,
-    "link": "https://leetcode.com/problems/maximum-number-of-people-that-can-be-caught-in-tag/",
-    "title": "Maximum Number of People That Can Be Caught in Tag"
+    "link": "https://leetcode.com/problems/maximum-number-of-people-that-can-be-caught-in-tag/"
   },
   "1990": {
+    "id": 1990,
     "category": "Database",
+    "title": "Count the Number of Experiments",
     "difficulty": "Medium",
-    "id": 1990,
-    "link": "https://leetcode.com/problems/count-the-number-of-experiments/",
-    "title": "Count the Number of Experiments"
+    "link": "https://leetcode.com/problems/count-the-number-of-experiments/"
   },
   "1991": {
+    "id": 1991,
     "category": "Array & Hashing",
+    "title": "Find the Middle Index in Array",
     "difficulty": "Easy",
-    "id": 1991,
-    "link": "https://leetcode.com/problems/find-the-middle-index-in-array/",
-    "title": "Find the Middle Index in Array"
+    "link": "https://leetcode.com/problems/find-the-middle-index-in-array/"
   },
   "1992": {
+    "id": 1992,
     "category": "Graph Traversal",
+    "title": "Find All Groups of Farmland",
     "difficulty": "Medium",
-    "id": 1992,
-    "link": "https://leetcode.com/problems/find-all-groups-of-farmland/",
-    "title": "Find All Groups of Farmland"
+    "link": "https://leetcode.com/problems/find-all-groups-of-farmland/"
   },
   "1993": {
+    "id": 1993,
     "category": "Tree",
+    "title": "Operations on Tree",
     "difficulty": "Medium",
-    "id": 1993,
-    "link": "https://leetcode.com/problems/operations-on-tree/",
-    "title": "Operations on Tree"
+    "link": "https://leetcode.com/problems/operations-on-tree/"
   },
   "1994": {
+    "id": 1994,
     "category": "Dynamic Programming",
+    "title": "The Number of Good Subsets",
     "difficulty": "Hard",
-    "id": 1994,
-    "link": "https://leetcode.com/problems/the-number-of-good-subsets/",
-    "title": "The Number of Good Subsets"
+    "link": "https://leetcode.com/problems/the-number-of-good-subsets/"
   },
   "1995": {
+    "id": 1995,
     "category": "Array & Hashing",
+    "title": "Count Special Quadruplets",
     "difficulty": "Easy",
-    "id": 1995,
-    "link": "https://leetcode.com/problems/count-special-quadruplets/",
-    "title": "Count Special Quadruplets"
+    "link": "https://leetcode.com/problems/count-special-quadruplets/"
   },
   "1996": {
+    "id": 1996,
     "category": "Stack",
+    "title": "The Number of Weak Characters in the Game",
     "difficulty": "Medium",
-    "id": 1996,
-    "link": "https://leetcode.com/problems/the-number-of-weak-characters-in-the-game/",
-    "title": "The Number of Weak Characters in the Game"
+    "link": "https://leetcode.com/problems/the-number-of-weak-characters-in-the-game/"
   },
   "1997": {
+    "id": 1997,
     "category": "Dynamic Programming",
+    "title": "First Day Where You Have Been in All the Rooms",
     "difficulty": "Medium",
-    "id": 1997,
-    "link": "https://leetcode.com/problems/first-day-where-you-have-been-in-all-the-rooms/",
-    "title": "First Day Where You Have Been in All the Rooms"
+    "link": "https://leetcode.com/problems/first-day-where-you-have-been-in-all-the-rooms/"
   },
   "1998": {
+    "id": 1998,
     "category": "Graph Traversal",
+    "title": "GCD Sort of an Array",
     "difficulty": "Hard",
-    "id": 1998,
-    "link": "https://leetcode.com/problems/gcd-sort-of-an-array/",
-    "title": "GCD Sort of an Array"
+    "link": "https://leetcode.com/problems/gcd-sort-of-an-array/"
   },
   "1999": {
+    "id": 1999,
     "category": "Math & Geometry",
+    "title": "Smallest Greater Multiple Made of Two Digits",
     "difficulty": "Medium",
-    "id": 1999,
-    "link": "https://leetcode.com/problems/smallest-greater-multiple-made-of-two-digits/",
-    "title": "Smallest Greater Multiple Made of Two Digits"
+    "link": "https://leetcode.com/problems/smallest-greater-multiple-made-of-two-digits/"
   },
   "2000": {
+    "id": 2000,
     "category": "Stack",
+    "title": "Reverse Prefix of Word",
     "difficulty": "Easy",
-    "id": 2000,
-    "link": "https://leetcode.com/problems/reverse-prefix-of-word/",
-    "title": "Reverse Prefix of Word"
+    "link": "https://leetcode.com/problems/reverse-prefix-of-word/"
   },
   "2001": {
+    "id": 2001,
     "category": "Math & Geometry",
+    "title": "Number of Pairs of Interchangeable Rectangles",
     "difficulty": "Medium",
-    "id": 2001,
-    "link": "https://leetcode.com/problems/number-of-pairs-of-interchangeable-rectangles/",
-    "title": "Number of Pairs of Interchangeable Rectangles"
+    "link": "https://leetcode.com/problems/number-of-pairs-of-interchangeable-rectangles/"
   },
   "2002": {
+    "id": 2002,
     "category": "Dynamic Programming",
+    "title": "Maximum Product of the Length of Two Palindromic Subsequences",
     "difficulty": "Medium",
-    "id": 2002,
-    "link": "https://leetcode.com/problems/maximum-product-of-the-length-of-two-palindromic-subsequences/",
-    "title": "Maximum Product of the Length of Two Palindromic Subsequences"
+    "link": "https://leetcode.com/problems/maximum-product-of-the-length-of-two-palindromic-subsequences/"
   },
   "2003": {
+    "id": 2003,
     "category": "Tree",
+    "title": "Smallest Missing Genetic Value in Each Subtree",
     "difficulty": "Hard",
-    "id": 2003,
-    "link": "https://leetcode.com/problems/smallest-missing-genetic-value-in-each-subtree/",
-    "title": "Smallest Missing Genetic Value in Each Subtree"
+    "link": "https://leetcode.com/problems/smallest-missing-genetic-value-in-each-subtree/"
   },
   "2004": {
+    "id": 2004,
     "category": "Database",
+    "title": "The Number of Seniors and Juniors to Join the Company",
     "difficulty": "Hard",
-    "id": 2004,
-    "link": "https://leetcode.com/problems/the-number-of-seniors-and-juniors-to-join-the-company/",
-    "title": "The Number of Seniors and Juniors to Join the Company"
+    "link": "https://leetcode.com/problems/the-number-of-seniors-and-juniors-to-join-the-company/"
   },
   "2005": {
+    "id": 2005,
     "category": "Tree",
+    "title": "Subtree Removal Game with Fibonacci Tree",
     "difficulty": "Hard",
-    "id": 2005,
-    "link": "https://leetcode.com/problems/subtree-removal-game-with-fibonacci-tree/",
-    "title": "Subtree Removal Game with Fibonacci Tree"
+    "link": "https://leetcode.com/problems/subtree-removal-game-with-fibonacci-tree/"
   },
   "2006": {
+    "id": 2006,
     "category": "Array & Hashing",
+    "title": "Count Number of Pairs With Absolute Difference K",
     "difficulty": "Easy",
-    "id": 2006,
-    "link": "https://leetcode.com/problems/count-number-of-pairs-with-absolute-difference-k/",
-    "title": "Count Number of Pairs With Absolute Difference K"
+    "link": "https://leetcode.com/problems/count-number-of-pairs-with-absolute-difference-k/"
   },
   "2007": {
+    "id": 2007,
     "category": "Greedy",
+    "title": "Find Original Array From Doubled Array",
     "difficulty": "Medium",
-    "id": 2007,
-    "link": "https://leetcode.com/problems/find-original-array-from-doubled-array/",
-    "title": "Find Original Array From Doubled Array"
+    "link": "https://leetcode.com/problems/find-original-array-from-doubled-array/"
   },
   "2008": {
+    "id": 2008,
     "category": "Dynamic Programming",
+    "title": "Maximum Earnings From Taxi",
     "difficulty": "Medium",
-    "id": 2008,
-    "link": "https://leetcode.com/problems/maximum-earnings-from-taxi/",
-    "title": "Maximum Earnings From Taxi"
+    "link": "https://leetcode.com/problems/maximum-earnings-from-taxi/"
   },
   "2009": {
+    "id": 2009,
     "category": "Sliding Window",
+    "title": "Minimum Number of Operations to Make Array Continuous",
     "difficulty": "Hard",
-    "id": 2009,
-    "link": "https://leetcode.com/problems/minimum-number-of-operations-to-make-array-continuous/",
-    "title": "Minimum Number of Operations to Make Array Continuous"
+    "link": "https://leetcode.com/problems/minimum-number-of-operations-to-make-array-continuous/"
   },
   "2010": {
+    "id": 2010,
     "category": "Database",
+    "title": "The Number of Seniors and Juniors to Join the Company II",
     "difficulty": "Hard",
-    "id": 2010,
-    "link": "https://leetcode.com/problems/the-number-of-seniors-and-juniors-to-join-the-company-ii/",
-    "title": "The Number of Seniors and Juniors to Join the Company II"
+    "link": "https://leetcode.com/problems/the-number-of-seniors-and-juniors-to-join-the-company-ii/"
   },
   "2011": {
+    "id": 2011,
     "category": "Array & Hashing",
+    "title": "Final Value of Variable After Performing Operations",
     "difficulty": "Easy",
-    "id": 2011,
-    "link": "https://leetcode.com/problems/final-value-of-variable-after-performing-operations/",
-    "title": "Final Value of Variable After Performing Operations"
+    "link": "https://leetcode.com/problems/final-value-of-variable-after-performing-operations/"
   },
   "2012": {
+    "id": 2012,
     "category": "Array & Hashing",
+    "title": "Sum of Beauty in the Array",
     "difficulty": "Medium",
-    "id": 2012,
-    "link": "https://leetcode.com/problems/sum-of-beauty-in-the-array/",
-    "title": "Sum of Beauty in the Array"
+    "link": "https://leetcode.com/problems/sum-of-beauty-in-the-array/"
   },
   "2013": {
+    "id": 2013,
     "category": "Array & Hashing",
+    "title": "Detect Squares",
     "difficulty": "Medium",
-    "id": 2013,
-    "link": "https://leetcode.com/problems/detect-squares/",
-    "title": "Detect Squares"
+    "link": "https://leetcode.com/problems/detect-squares/"
   },
   "2014": {
+    "id": 2014,
     "category": "Backtracking",
+    "title": "Longest Subsequence Repeated k Times",
     "difficulty": "Hard",
-    "id": 2014,
-    "link": "https://leetcode.com/problems/longest-subsequence-repeated-k-times/",
-    "title": "Longest Subsequence Repeated k Times"
+    "link": "https://leetcode.com/problems/longest-subsequence-repeated-k-times/"
   },
   "2015": {
+    "id": 2015,
     "category": "Heap (Priority Queue)",
+    "title": "Average Height of Buildings in Each Segment",
     "difficulty": "Medium",
-    "id": 2015,
-    "link": "https://leetcode.com/problems/average-height-of-buildings-in-each-segment/",
-    "title": "Average Height of Buildings in Each Segment"
+    "link": "https://leetcode.com/problems/average-height-of-buildings-in-each-segment/"
   },
   "2016": {
+    "id": 2016,
     "category": "Array & Hashing",
+    "title": "Maximum Difference Between Increasing Elements",
     "difficulty": "Easy",
-    "id": 2016,
-    "link": "https://leetcode.com/problems/maximum-difference-between-increasing-elements/",
-    "title": "Maximum Difference Between Increasing Elements"
+    "link": "https://leetcode.com/problems/maximum-difference-between-increasing-elements/"
   },
   "2017": {
+    "id": 2017,
     "category": "Array & Hashing",
+    "title": "Grid Game",
     "difficulty": "Medium",
-    "id": 2017,
-    "link": "https://leetcode.com/problems/grid-game/",
-    "title": "Grid Game"
+    "link": "https://leetcode.com/problems/grid-game/"
   },
   "2018": {
+    "id": 2018,
     "category": "Array & Hashing",
+    "title": "Check if Word Can Be Placed In Crossword",
     "difficulty": "Medium",
-    "id": 2018,
-    "link": "https://leetcode.com/problems/check-if-word-can-be-placed-in-crossword/",
-    "title": "Check if Word Can Be Placed In Crossword"
+    "link": "https://leetcode.com/problems/check-if-word-can-be-placed-in-crossword/"
   },
   "2019": {
+    "id": 2019,
     "category": "Dynamic Programming",
+    "title": "The Score of Students Solving Math Expression",
     "difficulty": "Hard",
-    "id": 2019,
-    "link": "https://leetcode.com/problems/the-score-of-students-solving-math-expression/",
-    "title": "The Score of Students Solving Math Expression"
+    "link": "https://leetcode.com/problems/the-score-of-students-solving-math-expression/"
   },
   "2020": {
+    "id": 2020,
     "category": "Database",
+    "title": "Number of Accounts That Did Not Stream",
     "difficulty": "Medium",
-    "id": 2020,
-    "link": "https://leetcode.com/problems/number-of-accounts-that-did-not-stream/",
-    "title": "Number of Accounts That Did Not Stream"
+    "link": "https://leetcode.com/problems/number-of-accounts-that-did-not-stream/"
   },
   "2021": {
+    "id": 2021,
     "category": "Array & Hashing",
+    "title": "Brightest Position on Street",
     "difficulty": "Medium",
-    "id": 2021,
-    "link": "https://leetcode.com/problems/brightest-position-on-street/",
-    "title": "Brightest Position on Street"
+    "link": "https://leetcode.com/problems/brightest-position-on-street/"
   },
   "2022": {
+    "id": 2022,
     "category": "Array & Hashing",
+    "title": "Convert 1D Array Into 2D Array",
     "difficulty": "Easy",
-    "id": 2022,
-    "link": "https://leetcode.com/problems/convert-1d-array-into-2d-array/",
-    "title": "Convert 1D Array Into 2D Array"
+    "link": "https://leetcode.com/problems/convert-1d-array-into-2d-array/"
   },
   "2023": {
+    "id": 2023,
     "category": "Array & Hashing",
+    "title": "Number of Pairs of Strings With Concatenation Equal to Target",
     "difficulty": "Medium",
-    "id": 2023,
-    "link": "https://leetcode.com/problems/number-of-pairs-of-strings-with-concatenation-equal-to-target/",
-    "title": "Number of Pairs of Strings With Concatenation Equal to Target"
+    "link": "https://leetcode.com/problems/number-of-pairs-of-strings-with-concatenation-equal-to-target/"
   },
   "2024": {
+    "id": 2024,
     "category": "Sliding Window",
+    "title": "Maximize the Confusion of an Exam",
     "difficulty": "Medium",
-    "id": 2024,
-    "link": "https://leetcode.com/problems/maximize-the-confusion-of-an-exam/",
-    "title": "Maximize the Confusion of an Exam"
+    "link": "https://leetcode.com/problems/maximize-the-confusion-of-an-exam/"
   },
   "2025": {
+    "id": 2025,
     "category": "Array & Hashing",
+    "title": "Maximum Number of Ways to Partition an Array",
     "difficulty": "Hard",
-    "id": 2025,
-    "link": "https://leetcode.com/problems/maximum-number-of-ways-to-partition-an-array/",
-    "title": "Maximum Number of Ways to Partition an Array"
+    "link": "https://leetcode.com/problems/maximum-number-of-ways-to-partition-an-array/"
   },
   "2026": {
+    "id": 2026,
     "category": "Database",
+    "title": "Low-Quality Problems",
     "difficulty": "Easy",
-    "id": 2026,
-    "link": "https://leetcode.com/problems/low-quality-problems/",
-    "title": "Low-Quality Problems"
+    "link": "https://leetcode.com/problems/low-quality-problems/"
   },
   "2027": {
+    "id": 2027,
     "category": "Greedy",
+    "title": "Minimum Moves to Convert String",
     "difficulty": "Easy",
-    "id": 2027,
-    "link": "https://leetcode.com/problems/minimum-moves-to-convert-string/",
-    "title": "Minimum Moves to Convert String"
+    "link": "https://leetcode.com/problems/minimum-moves-to-convert-string/"
   },
   "2028": {
+    "id": 2028,
     "category": "Math & Geometry",
+    "title": "Find Missing Observations",
     "difficulty": "Medium",
-    "id": 2028,
-    "link": "https://leetcode.com/problems/find-missing-observations/",
-    "title": "Find Missing Observations"
+    "link": "https://leetcode.com/problems/find-missing-observations/"
   },
   "2029": {
+    "id": 2029,
     "category": "Greedy",
+    "title": "Stone Game IX",
     "difficulty": "Medium",
-    "id": 2029,
-    "link": "https://leetcode.com/problems/stone-game-ix/",
-    "title": "Stone Game IX"
+    "link": "https://leetcode.com/problems/stone-game-ix/"
   },
   "2030": {
+    "id": 2030,
     "category": "Stack",
+    "title": "Smallest K-Length Subsequence With Occurrences of a Letter",
     "difficulty": "Hard",
-    "id": 2030,
-    "link": "https://leetcode.com/problems/smallest-k-length-subsequence-with-occurrences-of-a-letter/",
-    "title": "Smallest K-Length Subsequence With Occurrences of a Letter"
+    "link": "https://leetcode.com/problems/smallest-k-length-subsequence-with-occurrences-of-a-letter/"
   },
   "2031": {
+    "id": 2031,
     "category": "Tree",
+    "title": "Count Subarrays With More Ones Than Zeros",
     "difficulty": "Medium",
-    "id": 2031,
-    "link": "https://leetcode.com/problems/count-subarrays-with-more-ones-than-zeros/",
-    "title": "Count Subarrays With More Ones Than Zeros"
+    "link": "https://leetcode.com/problems/count-subarrays-with-more-ones-than-zeros/"
   },
   "2032": {
+    "id": 2032,
     "category": "Bit Manipulation",
+    "title": "Two Out of Three",
     "difficulty": "Easy",
-    "id": 2032,
-    "link": "https://leetcode.com/problems/two-out-of-three/",
-    "title": "Two Out of Three"
+    "link": "https://leetcode.com/problems/two-out-of-three/"
   },
   "2033": {
+    "id": 2033,
     "category": "Math & Geometry",
+    "title": "Minimum Operations to Make a Uni-Value Grid",
     "difficulty": "Medium",
-    "id": 2033,
-    "link": "https://leetcode.com/problems/minimum-operations-to-make-a-uni-value-grid/",
-    "title": "Minimum Operations to Make a Uni-Value Grid"
+    "link": "https://leetcode.com/problems/minimum-operations-to-make-a-uni-value-grid/"
   },
   "2034": {
+    "id": 2034,
     "category": "Heap (Priority Queue)",
+    "title": "Stock Price Fluctuation ",
     "difficulty": "Medium",
-    "id": 2034,
-    "link": "https://leetcode.com/problems/stock-price-fluctuation/",
-    "title": "Stock Price Fluctuation "
+    "link": "https://leetcode.com/problems/stock-price-fluctuation/"
   },
   "2035": {
+    "id": 2035,
     "category": "Dynamic Programming",
+    "title": "Partition Array Into Two Arrays to Minimize Sum Difference",
     "difficulty": "Hard",
-    "id": 2035,
-    "link": "https://leetcode.com/problems/partition-array-into-two-arrays-to-minimize-sum-difference/",
-    "title": "Partition Array Into Two Arrays to Minimize Sum Difference"
+    "link": "https://leetcode.com/problems/partition-array-into-two-arrays-to-minimize-sum-difference/"
   },
   "2036": {
+    "id": 2036,
     "category": "Dynamic Programming",
+    "title": "Maximum Alternating Subarray Sum",
     "difficulty": "Medium",
-    "id": 2036,
-    "link": "https://leetcode.com/problems/maximum-alternating-subarray-sum/",
-    "title": "Maximum Alternating Subarray Sum"
+    "link": "https://leetcode.com/problems/maximum-alternating-subarray-sum/"
   },
   "2037": {
+    "id": 2037,
     "category": "Greedy",
+    "title": "Minimum Number of Moves to Seat Everyone",
     "difficulty": "Easy",
-    "id": 2037,
-    "link": "https://leetcode.com/problems/minimum-number-of-moves-to-seat-everyone/",
-    "title": "Minimum Number of Moves to Seat Everyone"
+    "link": "https://leetcode.com/problems/minimum-number-of-moves-to-seat-everyone/"
   },
   "2038": {
+    "id": 2038,
     "category": "Greedy",
+    "title": "Remove Colored Pieces if Both Neighbors are the Same Color",
     "difficulty": "Medium",
-    "id": 2038,
-    "link": "https://leetcode.com/problems/remove-colored-pieces-if-both-neighbors-are-the-same-color/",
-    "title": "Remove Colored Pieces if Both Neighbors are the Same Color"
+    "link": "https://leetcode.com/problems/remove-colored-pieces-if-both-neighbors-are-the-same-color/"
   },
   "2039": {
+    "id": 2039,
     "category": "Graph Traversal",
+    "title": "The Time When the Network Becomes Idle",
     "difficulty": "Medium",
-    "id": 2039,
-    "link": "https://leetcode.com/problems/the-time-when-the-network-becomes-idle/",
-    "title": "The Time When the Network Becomes Idle"
+    "link": "https://leetcode.com/problems/the-time-when-the-network-becomes-idle/"
   },
   "2040": {
+    "id": 2040,
     "category": "Binary Search",
+    "title": "Kth Smallest Product of Two Sorted Arrays",
     "difficulty": "Hard",
-    "id": 2040,
-    "link": "https://leetcode.com/problems/kth-smallest-product-of-two-sorted-arrays/",
-    "title": "Kth Smallest Product of Two Sorted Arrays"
+    "link": "https://leetcode.com/problems/kth-smallest-product-of-two-sorted-arrays/"
   },
   "2041": {
+    "id": 2041,
     "category": "Database",
+    "title": "Accepted Candidates From the Interviews",
     "difficulty": "Medium",
-    "id": 2041,
-    "link": "https://leetcode.com/problems/accepted-candidates-from-the-interviews/",
-    "title": "Accepted Candidates From the Interviews"
+    "link": "https://leetcode.com/problems/accepted-candidates-from-the-interviews/"
   },
   "2042": {
+    "id": 2042,
     "category": "Array & Hashing",
+    "title": "Check if Numbers Are Ascending in a Sentence",
     "difficulty": "Easy",
-    "id": 2042,
-    "link": "https://leetcode.com/problems/check-if-numbers-are-ascending-in-a-sentence/",
-    "title": "Check if Numbers Are Ascending in a Sentence"
+    "link": "https://leetcode.com/problems/check-if-numbers-are-ascending-in-a-sentence/"
   },
   "2043": {
+    "id": 2043,
     "category": "Array & Hashing",
+    "title": "Simple Bank System",
     "difficulty": "Medium",
-    "id": 2043,
-    "link": "https://leetcode.com/problems/simple-bank-system/",
-    "title": "Simple Bank System"
+    "link": "https://leetcode.com/problems/simple-bank-system/"
   },
   "2044": {
+    "id": 2044,
     "category": "Backtracking",
+    "title": "Count Number of Maximum Bitwise-OR Subsets",
     "difficulty": "Medium",
-    "id": 2044,
-    "link": "https://leetcode.com/problems/count-number-of-maximum-bitwise-or-subsets/",
-    "title": "Count Number of Maximum Bitwise-OR Subsets"
+    "link": "https://leetcode.com/problems/count-number-of-maximum-bitwise-or-subsets/"
   },
   "2045": {
+    "id": 2045,
     "category": "Graph Traversal",
+    "title": "Second Minimum Time to Reach Destination",
     "difficulty": "Hard",
-    "id": 2045,
-    "link": "https://leetcode.com/problems/second-minimum-time-to-reach-destination/",
-    "title": "Second Minimum Time to Reach Destination"
+    "link": "https://leetcode.com/problems/second-minimum-time-to-reach-destination/"
   },
   "2046": {
+    "id": 2046,
     "category": "Linked List",
+    "title": "Sort Linked List Already Sorted Using Absolute Values",
     "difficulty": "Medium",
-    "id": 2046,
-    "link": "https://leetcode.com/problems/sort-linked-list-already-sorted-using-absolute-values/",
-    "title": "Sort Linked List Already Sorted Using Absolute Values"
+    "link": "https://leetcode.com/problems/sort-linked-list-already-sorted-using-absolute-values/"
   },
   "2047": {
+    "id": 2047,
     "category": "Array & Hashing",
+    "title": "Number of Valid Words in a Sentence",
     "difficulty": "Easy",
-    "id": 2047,
-    "link": "https://leetcode.com/problems/number-of-valid-words-in-a-sentence/",
-    "title": "Number of Valid Words in a Sentence"
+    "link": "https://leetcode.com/problems/number-of-valid-words-in-a-sentence/"
   },
   "2048": {
+    "id": 2048,
     "category": "Backtracking",
+    "title": "Next Greater Numerically Balanced Number",
     "difficulty": "Medium",
-    "id": 2048,
-    "link": "https://leetcode.com/problems/next-greater-numerically-balanced-number/",
-    "title": "Next Greater Numerically Balanced Number"
+    "link": "https://leetcode.com/problems/next-greater-numerically-balanced-number/"
   },
   "2049": {
+    "id": 2049,
     "category": "Tree",
+    "title": "Count Nodes With the Highest Score",
     "difficulty": "Medium",
-    "id": 2049,
-    "link": "https://leetcode.com/problems/count-nodes-with-the-highest-score/",
-    "title": "Count Nodes With the Highest Score"
+    "link": "https://leetcode.com/problems/count-nodes-with-the-highest-score/"
   },
   "2050": {
+    "id": 2050,
     "category": "Graph Traversal",
+    "title": "Parallel Courses III",
     "difficulty": "Hard",
-    "id": 2050,
-    "link": "https://leetcode.com/problems/parallel-courses-iii/",
-    "title": "Parallel Courses III"
+    "link": "https://leetcode.com/problems/parallel-courses-iii/"
   },
   "2051": {
+    "id": 2051,
     "category": "Database",
+    "title": "The Category of Each Member in the Store",
     "difficulty": "Medium",
-    "id": 2051,
-    "link": "https://leetcode.com/problems/the-category-of-each-member-in-the-store/",
-    "title": "The Category of Each Member in the Store"
+    "link": "https://leetcode.com/problems/the-category-of-each-member-in-the-store/"
   },
   "2052": {
+    "id": 2052,
     "category": "Dynamic Programming",
+    "title": "Minimum Cost to Separate Sentence Into Rows",
     "difficulty": "Medium",
-    "id": 2052,
-    "link": "https://leetcode.com/problems/minimum-cost-to-separate-sentence-into-rows/",
-    "title": "Minimum Cost to Separate Sentence Into Rows"
+    "link": "https://leetcode.com/problems/minimum-cost-to-separate-sentence-into-rows/"
   },
   "2053": {
+    "id": 2053,
     "category": "Array & Hashing",
+    "title": "Kth Distinct String in an Array",
     "difficulty": "Easy",
-    "id": 2053,
-    "link": "https://leetcode.com/problems/kth-distinct-string-in-an-array/",
-    "title": "Kth Distinct String in an Array"
+    "link": "https://leetcode.com/problems/kth-distinct-string-in-an-array/"
   },
   "2054": {
+    "id": 2054,
     "category": "Dynamic Programming",
+    "title": "Two Best Non-Overlapping Events",
     "difficulty": "Medium",
-    "id": 2054,
-    "link": "https://leetcode.com/problems/two-best-non-overlapping-events/",
-    "title": "Two Best Non-Overlapping Events"
+    "link": "https://leetcode.com/problems/two-best-non-overlapping-events/"
   },
   "2055": {
+    "id": 2055,
     "category": "Binary Search",
+    "title": "Plates Between Candles",
     "difficulty": "Medium",
-    "id": 2055,
-    "link": "https://leetcode.com/problems/plates-between-candles/",
-    "title": "Plates Between Candles"
+    "link": "https://leetcode.com/problems/plates-between-candles/"
   },
   "2056": {
+    "id": 2056,
     "category": "Backtracking",
+    "title": "Number of Valid Move Combinations On Chessboard",
     "difficulty": "Hard",
-    "id": 2056,
-    "link": "https://leetcode.com/problems/number-of-valid-move-combinations-on-chessboard/",
-    "title": "Number of Valid Move Combinations On Chessboard"
+    "link": "https://leetcode.com/problems/number-of-valid-move-combinations-on-chessboard/"
   },
   "2057": {
+    "id": 2057,
     "category": "Array & Hashing",
+    "title": "Smallest Index With Equal Value",
     "difficulty": "Easy",
-    "id": 2057,
-    "link": "https://leetcode.com/problems/smallest-index-with-equal-value/",
-    "title": "Smallest Index With Equal Value"
+    "link": "https://leetcode.com/problems/smallest-index-with-equal-value/"
   },
   "2058": {
+    "id": 2058,
     "category": "Linked List",
+    "title": "Find the Minimum and Maximum Number of Nodes Between Critical Points",
     "difficulty": "Medium",
-    "id": 2058,
-    "link": "https://leetcode.com/problems/find-the-minimum-and-maximum-number-of-nodes-between-critical-points/",
-    "title": "Find the Minimum and Maximum Number of Nodes Between Critical Points"
+    "link": "https://leetcode.com/problems/find-the-minimum-and-maximum-number-of-nodes-between-critical-points/"
   },
   "2059": {
+    "id": 2059,
     "category": "Graph Traversal",
+    "title": "Minimum Operations to Convert Number",
     "difficulty": "Medium",
-    "id": 2059,
-    "link": "https://leetcode.com/problems/minimum-operations-to-convert-number/",
-    "title": "Minimum Operations to Convert Number"
+    "link": "https://leetcode.com/problems/minimum-operations-to-convert-number/"
   },
   "2060": {
+    "id": 2060,
     "category": "Dynamic Programming",
+    "title": "Check if an Original String Exists Given Two Encoded Strings",
     "difficulty": "Hard",
-    "id": 2060,
-    "link": "https://leetcode.com/problems/check-if-an-original-string-exists-given-two-encoded-strings/",
-    "title": "Check if an Original String Exists Given Two Encoded Strings"
+    "link": "https://leetcode.com/problems/check-if-an-original-string-exists-given-two-encoded-strings/"
   },
   "2061": {
+    "id": 2061,
     "category": "Array & Hashing",
+    "title": "Number of Spaces Cleaning Robot Cleaned",
     "difficulty": "Medium",
-    "id": 2061,
-    "link": "https://leetcode.com/problems/number-of-spaces-cleaning-robot-cleaned/",
-    "title": "Number of Spaces Cleaning Robot Cleaned"
+    "link": "https://leetcode.com/problems/number-of-spaces-cleaning-robot-cleaned/"
   },
   "2062": {
+    "id": 2062,
     "category": "Array & Hashing",
+    "title": "Count Vowel Substrings of a String",
     "difficulty": "Easy",
-    "id": 2062,
-    "link": "https://leetcode.com/problems/count-vowel-substrings-of-a-string/",
-    "title": "Count Vowel Substrings of a String"
+    "link": "https://leetcode.com/problems/count-vowel-substrings-of-a-string/"
   },
   "2063": {
+    "id": 2063,
     "category": "Dynamic Programming",
+    "title": "Vowels of All Substrings",
     "difficulty": "Medium",
-    "id": 2063,
-    "link": "https://leetcode.com/problems/vowels-of-all-substrings/",
-    "title": "Vowels of All Substrings"
+    "link": "https://leetcode.com/problems/vowels-of-all-substrings/"
   },
   "2064": {
+    "id": 2064,
     "category": "Binary Search",
+    "title": "Minimized Maximum of Products Distributed to Any Store",
     "difficulty": "Medium",
-    "id": 2064,
-    "link": "https://leetcode.com/problems/minimized-maximum-of-products-distributed-to-any-store/",
-    "title": "Minimized Maximum of Products Distributed to Any Store"
+    "link": "https://leetcode.com/problems/minimized-maximum-of-products-distributed-to-any-store/"
   },
   "2065": {
+    "id": 2065,
     "category": "Graph Traversal",
+    "title": "Maximum Path Quality of a Graph",
     "difficulty": "Hard",
-    "id": 2065,
-    "link": "https://leetcode.com/problems/maximum-path-quality-of-a-graph/",
-    "title": "Maximum Path Quality of a Graph"
+    "link": "https://leetcode.com/problems/maximum-path-quality-of-a-graph/"
   },
   "2066": {
+    "id": 2066,
     "category": "Database",
+    "title": "Account Balance",
     "difficulty": "Medium",
-    "id": 2066,
-    "link": "https://leetcode.com/problems/account-balance/",
-    "title": "Account Balance"
+    "link": "https://leetcode.com/problems/account-balance/"
   },
   "2067": {
+    "id": 2067,
     "category": "Sliding Window",
+    "title": "Number of Equal Count Substrings",
     "difficulty": "Medium",
-    "id": 2067,
-    "link": "https://leetcode.com/problems/number-of-equal-count-substrings/",
-    "title": "Number of Equal Count Substrings"
+    "link": "https://leetcode.com/problems/number-of-equal-count-substrings/"
   },
   "2068": {
+    "id": 2068,
     "category": "Array & Hashing",
+    "title": "Check Whether Two Strings are Almost Equivalent",
     "difficulty": "Easy",
-    "id": 2068,
-    "link": "https://leetcode.com/problems/check-whether-two-strings-are-almost-equivalent/",
-    "title": "Check Whether Two Strings are Almost Equivalent"
+    "link": "https://leetcode.com/problems/check-whether-two-strings-are-almost-equivalent/"
   },
   "2069": {
+    "id": 2069,
     "category": "Array & Hashing",
+    "title": "Walking Robot Simulation II",
     "difficulty": "Medium",
-    "id": 2069,
-    "link": "https://leetcode.com/problems/walking-robot-simulation-ii/",
-    "title": "Walking Robot Simulation II"
+    "link": "https://leetcode.com/problems/walking-robot-simulation-ii/"
   },
   "2070": {
+    "id": 2070,
     "category": "Binary Search",
+    "title": "Most Beautiful Item for Each Query",
     "difficulty": "Medium",
-    "id": 2070,
-    "link": "https://leetcode.com/problems/most-beautiful-item-for-each-query/",
-    "title": "Most Beautiful Item for Each Query"
+    "link": "https://leetcode.com/problems/most-beautiful-item-for-each-query/"
   },
   "2071": {
+    "id": 2071,
     "category": "Binary Search",
+    "title": "Maximum Number of Tasks You Can Assign",
     "difficulty": "Hard",
-    "id": 2071,
-    "link": "https://leetcode.com/problems/maximum-number-of-tasks-you-can-assign/",
-    "title": "Maximum Number of Tasks You Can Assign"
+    "link": "https://leetcode.com/problems/maximum-number-of-tasks-you-can-assign/"
   },
   "2072": {
+    "id": 2072,
     "category": "Database",
+    "title": "The Winner University",
     "difficulty": "Easy",
-    "id": 2072,
-    "link": "https://leetcode.com/problems/the-winner-university/",
-    "title": "The Winner University"
+    "link": "https://leetcode.com/problems/the-winner-university/"
   },
   "2073": {
+    "id": 2073,
     "category": "Array & Hashing",
+    "title": "Time Needed to Buy Tickets",
     "difficulty": "Easy",
-    "id": 2073,
-    "link": "https://leetcode.com/problems/time-needed-to-buy-tickets/",
-    "title": "Time Needed to Buy Tickets"
+    "link": "https://leetcode.com/problems/time-needed-to-buy-tickets/"
   },
   "2074": {
+    "id": 2074,
     "category": "Linked List",
+    "title": "Reverse Nodes in Even Length Groups",
     "difficulty": "Medium",
-    "id": 2074,
-    "link": "https://leetcode.com/problems/reverse-nodes-in-even-length-groups/",
-    "title": "Reverse Nodes in Even Length Groups"
+    "link": "https://leetcode.com/problems/reverse-nodes-in-even-length-groups/"
   },
   "2075": {
+    "id": 2075,
     "category": "Array & Hashing",
+    "title": "Decode the Slanted Ciphertext",
     "difficulty": "Medium",
-    "id": 2075,
-    "link": "https://leetcode.com/problems/decode-the-slanted-ciphertext/",
-    "title": "Decode the Slanted Ciphertext"
+    "link": "https://leetcode.com/problems/decode-the-slanted-ciphertext/"
   },
   "2076": {
+    "id": 2076,
     "category": "Graph Traversal",
+    "title": "Process Restricted Friend Requests",
     "difficulty": "Hard",
-    "id": 2076,
-    "link": "https://leetcode.com/problems/process-restricted-friend-requests/",
-    "title": "Process Restricted Friend Requests"
+    "link": "https://leetcode.com/problems/process-restricted-friend-requests/"
   },
   "2077": {
+    "id": 2077,
     "category": "Graph Traversal",
+    "title": "Paths in Maze That Lead to Same Room",
     "difficulty": "Medium",
-    "id": 2077,
-    "link": "https://leetcode.com/problems/paths-in-maze-that-lead-to-same-room/",
-    "title": "Paths in Maze That Lead to Same Room"
+    "link": "https://leetcode.com/problems/paths-in-maze-that-lead-to-same-room/"
   },
   "2078": {
+    "id": 2078,
     "category": "Greedy",
+    "title": "Two Furthest Houses With Different Colors",
     "difficulty": "Easy",
-    "id": 2078,
-    "link": "https://leetcode.com/problems/two-furthest-houses-with-different-colors/",
-    "title": "Two Furthest Houses With Different Colors"
+    "link": "https://leetcode.com/problems/two-furthest-houses-with-different-colors/"
   },
   "2079": {
+    "id": 2079,
     "category": "Array & Hashing",
+    "title": "Watering Plants",
     "difficulty": "Medium",
-    "id": 2079,
-    "link": "https://leetcode.com/problems/watering-plants/",
-    "title": "Watering Plants"
+    "link": "https://leetcode.com/problems/watering-plants/"
   },
   "2080": {
+    "id": 2080,
     "category": "Tree",
+    "title": "Range Frequency Queries",
     "difficulty": "Medium",
-    "id": 2080,
-    "link": "https://leetcode.com/problems/range-frequency-queries/",
-    "title": "Range Frequency Queries"
+    "link": "https://leetcode.com/problems/range-frequency-queries/"
   },
   "2081": {
+    "id": 2081,
     "category": "Math & Geometry",
+    "title": "Sum of k-Mirror Numbers",
     "difficulty": "Hard",
-    "id": 2081,
-    "link": "https://leetcode.com/problems/sum-of-k-mirror-numbers/",
-    "title": "Sum of k-Mirror Numbers"
+    "link": "https://leetcode.com/problems/sum-of-k-mirror-numbers/"
   },
   "2082": {
+    "id": 2082,
     "category": "Database",
+    "title": "The Number of Rich Customers",
     "difficulty": "Easy",
-    "id": 2082,
-    "link": "https://leetcode.com/problems/the-number-of-rich-customers/",
-    "title": "The Number of Rich Customers"
+    "link": "https://leetcode.com/problems/the-number-of-rich-customers/"
   },
   "2083": {
+    "id": 2083,
     "category": "Math & Geometry",
+    "title": "Substrings That Begin and End With the Same Letter",
     "difficulty": "Medium",
-    "id": 2083,
-    "link": "https://leetcode.com/problems/substrings-that-begin-and-end-with-the-same-letter/",
-    "title": "Substrings That Begin and End With the Same Letter"
+    "link": "https://leetcode.com/problems/substrings-that-begin-and-end-with-the-same-letter/"
   },
   "2084": {
+    "id": 2084,
     "category": "Database",
+    "title": "Drop Type 1 Orders for Customers With Type 0 Orders",
     "difficulty": "Medium",
-    "id": 2084,
-    "link": "https://leetcode.com/problems/drop-type-1-orders-for-customers-with-type-0-orders/",
-    "title": "Drop Type 1 Orders for Customers With Type 0 Orders"
+    "link": "https://leetcode.com/problems/drop-type-1-orders-for-customers-with-type-0-orders/"
   },
   "2085": {
+    "id": 2085,
     "category": "Array & Hashing",
+    "title": "Count Common Words With One Occurrence",
     "difficulty": "Easy",
-    "id": 2085,
-    "link": "https://leetcode.com/problems/count-common-words-with-one-occurrence/",
-    "title": "Count Common Words With One Occurrence"
+    "link": "https://leetcode.com/problems/count-common-words-with-one-occurrence/"
   },
   "2086": {
+    "id": 2086,
     "category": "Dynamic Programming",
+    "title": "Minimum Number of Food Buckets to Feed the Hamsters",
     "difficulty": "Medium",
-    "id": 2086,
-    "link": "https://leetcode.com/problems/minimum-number-of-food-buckets-to-feed-the-hamsters/",
-    "title": "Minimum Number of Food Buckets to Feed the Hamsters"
+    "link": "https://leetcode.com/problems/minimum-number-of-food-buckets-to-feed-the-hamsters/"
   },
   "2087": {
+    "id": 2087,
     "category": "Greedy",
+    "title": "Minimum Cost Homecoming of a Robot in a Grid",
     "difficulty": "Medium",
-    "id": 2087,
-    "link": "https://leetcode.com/problems/minimum-cost-homecoming-of-a-robot-in-a-grid/",
-    "title": "Minimum Cost Homecoming of a Robot in a Grid"
+    "link": "https://leetcode.com/problems/minimum-cost-homecoming-of-a-robot-in-a-grid/"
   },
   "2088": {
+    "id": 2088,
     "category": "Dynamic Programming",
+    "title": "Count Fertile Pyramids in a Land",
     "difficulty": "Hard",
-    "id": 2088,
-    "link": "https://leetcode.com/problems/count-fertile-pyramids-in-a-land/",
-    "title": "Count Fertile Pyramids in a Land"
+    "link": "https://leetcode.com/problems/count-fertile-pyramids-in-a-land/"
   },
   "2089": {
+    "id": 2089,
     "category": "Binary Search",
+    "title": "Find Target Indices After Sorting Array",
     "difficulty": "Easy",
-    "id": 2089,
-    "link": "https://leetcode.com/problems/find-target-indices-after-sorting-array/",
-    "title": "Find Target Indices After Sorting Array"
+    "link": "https://leetcode.com/problems/find-target-indices-after-sorting-array/"
   },
   "2090": {
+    "id": 2090,
     "category": "Sliding Window",
+    "title": "K Radius Subarray Averages",
     "difficulty": "Medium",
-    "id": 2090,
-    "link": "https://leetcode.com/problems/k-radius-subarray-averages/",
-    "title": "K Radius Subarray Averages"
+    "link": "https://leetcode.com/problems/k-radius-subarray-averages/"
   },
   "2091": {
+    "id": 2091,
     "category": "Greedy",
+    "title": "Removing Minimum and Maximum From Array",
     "difficulty": "Medium",
-    "id": 2091,
-    "link": "https://leetcode.com/problems/removing-minimum-and-maximum-from-array/",
-    "title": "Removing Minimum and Maximum From Array"
+    "link": "https://leetcode.com/problems/removing-minimum-and-maximum-from-array/"
   },
   "2092": {
+    "id": 2092,
     "category": "Graph Traversal",
+    "title": "Find All People With Secret",
     "difficulty": "Hard",
-    "id": 2092,
-    "link": "https://leetcode.com/problems/find-all-people-with-secret/",
-    "title": "Find All People With Secret"
+    "link": "https://leetcode.com/problems/find-all-people-with-secret/"
   },
   "2093": {
+    "id": 2093,
     "category": "Graph Traversal",
+    "title": "Minimum Cost to Reach City With Discounts",
     "difficulty": "Medium",
-    "id": 2093,
-    "link": "https://leetcode.com/problems/minimum-cost-to-reach-city-with-discounts/",
-    "title": "Minimum Cost to Reach City With Discounts"
+    "link": "https://leetcode.com/problems/minimum-cost-to-reach-city-with-discounts/"
   },
   "2094": {
+    "id": 2094,
     "category": "Array & Hashing",
+    "title": "Finding 3-Digit Even Numbers",
     "difficulty": "Easy",
-    "id": 2094,
-    "link": "https://leetcode.com/problems/finding-3-digit-even-numbers/",
-    "title": "Finding 3-Digit Even Numbers"
+    "link": "https://leetcode.com/problems/finding-3-digit-even-numbers/"
   },
   "2095": {
+    "id": 2095,
     "category": "Linked List",
+    "title": "Delete the Middle Node of a Linked List",
     "difficulty": "Medium",
-    "id": 2095,
-    "link": "https://leetcode.com/problems/delete-the-middle-node-of-a-linked-list/",
-    "title": "Delete the Middle Node of a Linked List"
+    "link": "https://leetcode.com/problems/delete-the-middle-node-of-a-linked-list/"
   },
   "2096": {
+    "id": 2096,
     "category": "Tree",
+    "title": "Step-By-Step Directions From a Binary Tree Node to Another",
     "difficulty": "Medium",
-    "id": 2096,
-    "link": "https://leetcode.com/problems/step-by-step-directions-from-a-binary-tree-node-to-another/",
-    "title": "Step-By-Step Directions From a Binary Tree Node to Another"
+    "link": "https://leetcode.com/problems/step-by-step-directions-from-a-binary-tree-node-to-another/"
   },
   "2097": {
+    "id": 2097,
     "category": "Graph Traversal",
+    "title": "Valid Arrangement of Pairs",
     "difficulty": "Hard",
-    "id": 2097,
-    "link": "https://leetcode.com/problems/valid-arrangement-of-pairs/",
-    "title": "Valid Arrangement of Pairs"
+    "link": "https://leetcode.com/problems/valid-arrangement-of-pairs/"
   },
   "2098": {
+    "id": 2098,
     "category": "Greedy",
+    "title": "Subsequence of Size K With the Largest Even Sum",
     "difficulty": "Medium",
-    "id": 2098,
-    "link": "https://leetcode.com/problems/subsequence-of-size-k-with-the-largest-even-sum/",
-    "title": "Subsequence of Size K With the Largest Even Sum"
+    "link": "https://leetcode.com/problems/subsequence-of-size-k-with-the-largest-even-sum/"
   },
   "2099": {
+    "id": 2099,
     "category": "Heap (Priority Queue)",
+    "title": "Find Subsequence of Length K With the Largest Sum",
     "difficulty": "Easy",
-    "id": 2099,
-    "link": "https://leetcode.com/problems/find-subsequence-of-length-k-with-the-largest-sum/",
-    "title": "Find Subsequence of Length K With the Largest Sum"
+    "link": "https://leetcode.com/problems/find-subsequence-of-length-k-with-the-largest-sum/"
   },
   "2100": {
+    "id": 2100,
     "category": "Dynamic Programming",
+    "title": "Find Good Days to Rob the Bank",
     "difficulty": "Medium",
-    "id": 2100,
-    "link": "https://leetcode.com/problems/find-good-days-to-rob-the-bank/",
-    "title": "Find Good Days to Rob the Bank"
+    "link": "https://leetcode.com/problems/find-good-days-to-rob-the-bank/"
   },
   "2101": {
+    "id": 2101,
     "category": "Graph Traversal",
+    "title": "Detonate the Maximum Bombs",
     "difficulty": "Medium",
-    "id": 2101,
-    "link": "https://leetcode.com/problems/detonate-the-maximum-bombs/",
-    "title": "Detonate the Maximum Bombs"
+    "link": "https://leetcode.com/problems/detonate-the-maximum-bombs/"
   },
   "2102": {
+    "id": 2102,
     "category": "Heap (Priority Queue)",
+    "title": "Sequentially Ordinal Rank Tracker",
     "difficulty": "Hard",
-    "id": 2102,
-    "link": "https://leetcode.com/problems/sequentially-ordinal-rank-tracker/",
-    "title": "Sequentially Ordinal Rank Tracker"
+    "link": "https://leetcode.com/problems/sequentially-ordinal-rank-tracker/"
   },
   "2103": {
+    "id": 2103,
     "category": "Array & Hashing",
+    "title": "Rings and Rods",
     "difficulty": "Easy",
-    "id": 2103,
-    "link": "https://leetcode.com/problems/rings-and-rods/",
-    "title": "Rings and Rods"
+    "link": "https://leetcode.com/problems/rings-and-rods/"
   },
   "2104": {
+    "id": 2104,
     "category": "Stack",
+    "title": "Sum of Subarray Ranges",
     "difficulty": "Medium",
-    "id": 2104,
-    "link": "https://leetcode.com/problems/sum-of-subarray-ranges/",
-    "title": "Sum of Subarray Ranges"
+    "link": "https://leetcode.com/problems/sum-of-subarray-ranges/"
   },
   "2105": {
+    "id": 2105,
     "category": "Two Pointers",
+    "title": "Watering Plants II",
     "difficulty": "Medium",
-    "id": 2105,
-    "link": "https://leetcode.com/problems/watering-plants-ii/",
-    "title": "Watering Plants II"
+    "link": "https://leetcode.com/problems/watering-plants-ii/"
   },
   "2106": {
+    "id": 2106,
     "category": "Sliding Window",
+    "title": "Maximum Fruits Harvested After at Most K Steps",
     "difficulty": "Hard",
-    "id": 2106,
-    "link": "https://leetcode.com/problems/maximum-fruits-harvested-after-at-most-k-steps/",
-    "title": "Maximum Fruits Harvested After at Most K Steps"
+    "link": "https://leetcode.com/problems/maximum-fruits-harvested-after-at-most-k-steps/"
   },
   "2107": {
+    "id": 2107,
     "category": "Sliding Window",
+    "title": "Number of Unique Flavors After Sharing K Candies",
     "difficulty": "Medium",
-    "id": 2107,
-    "link": "https://leetcode.com/problems/number-of-unique-flavors-after-sharing-k-candies/",
-    "title": "Number of Unique Flavors After Sharing K Candies"
+    "link": "https://leetcode.com/problems/number-of-unique-flavors-after-sharing-k-candies/"
   },
   "2108": {
+    "id": 2108,
     "category": "Two Pointers",
+    "title": "Find First Palindromic String in the Array",
     "difficulty": "Easy",
-    "id": 2108,
-    "link": "https://leetcode.com/problems/find-first-palindromic-string-in-the-array/",
-    "title": "Find First Palindromic String in the Array"
+    "link": "https://leetcode.com/problems/find-first-palindromic-string-in-the-array/"
   },
   "2109": {
+    "id": 2109,
     "category": "Two Pointers",
+    "title": "Adding Spaces to a String",
     "difficulty": "Medium",
-    "id": 2109,
-    "link": "https://leetcode.com/problems/adding-spaces-to-a-string/",
-    "title": "Adding Spaces to a String"
+    "link": "https://leetcode.com/problems/adding-spaces-to-a-string/"
   },
   "2110": {
+    "id": 2110,
     "category": "Dynamic Programming",
+    "title": "Number of Smooth Descent Periods of a Stock",
     "difficulty": "Medium",
-    "id": 2110,
-    "link": "https://leetcode.com/problems/number-of-smooth-descent-periods-of-a-stock/",
-    "title": "Number of Smooth Descent Periods of a Stock"
+    "link": "https://leetcode.com/problems/number-of-smooth-descent-periods-of-a-stock/"
   },
   "2111": {
+    "id": 2111,
     "category": "Binary Search",
+    "title": "Minimum Operations to Make the Array K-Increasing",
     "difficulty": "Hard",
-    "id": 2111,
-    "link": "https://leetcode.com/problems/minimum-operations-to-make-the-array-k-increasing/",
-    "title": "Minimum Operations to Make the Array K-Increasing"
+    "link": "https://leetcode.com/problems/minimum-operations-to-make-the-array-k-increasing/"
   },
   "2112": {
+    "id": 2112,
     "category": "Database",
+    "title": "The Airport With the Most Traffic",
     "difficulty": "Medium",
-    "id": 2112,
-    "link": "https://leetcode.com/problems/the-airport-with-the-most-traffic/",
-    "title": "The Airport With the Most Traffic"
+    "link": "https://leetcode.com/problems/the-airport-with-the-most-traffic/"
   },
   "2113": {
+    "id": 2113,
     "category": "Array & Hashing",
+    "title": "Elements in Array After Removing and Replacing Elements",
     "difficulty": "Medium",
-    "id": 2113,
-    "link": "https://leetcode.com/problems/elements-in-array-after-removing-and-replacing-elements/",
-    "title": "Elements in Array After Removing and Replacing Elements"
+    "link": "https://leetcode.com/problems/elements-in-array-after-removing-and-replacing-elements/"
   },
   "2114": {
+    "id": 2114,
     "category": "Array & Hashing",
+    "title": "Maximum Number of Words Found in Sentences",
     "difficulty": "Easy",
-    "id": 2114,
-    "link": "https://leetcode.com/problems/maximum-number-of-words-found-in-sentences/",
-    "title": "Maximum Number of Words Found in Sentences"
+    "link": "https://leetcode.com/problems/maximum-number-of-words-found-in-sentences/"
   },
   "2115": {
+    "id": 2115,
     "category": "Graph Traversal",
+    "title": "Find All Possible Recipes from Given Supplies",
     "difficulty": "Medium",
-    "id": 2115,
-    "link": "https://leetcode.com/problems/find-all-possible-recipes-from-given-supplies/",
-    "title": "Find All Possible Recipes from Given Supplies"
+    "link": "https://leetcode.com/problems/find-all-possible-recipes-from-given-supplies/"
   },
   "2116": {
+    "id": 2116,
     "category": "Stack",
+    "title": "Check if a Parentheses String Can Be Valid",
     "difficulty": "Medium",
-    "id": 2116,
-    "link": "https://leetcode.com/problems/check-if-a-parentheses-string-can-be-valid/",
-    "title": "Check if a Parentheses String Can Be Valid"
+    "link": "https://leetcode.com/problems/check-if-a-parentheses-string-can-be-valid/"
   },
   "2117": {
+    "id": 2117,
     "category": "Math & Geometry",
+    "title": "Abbreviating the Product of a Range",
     "difficulty": "Hard",
-    "id": 2117,
-    "link": "https://leetcode.com/problems/abbreviating-the-product-of-a-range/",
-    "title": "Abbreviating the Product of a Range"
+    "link": "https://leetcode.com/problems/abbreviating-the-product-of-a-range/"
   },
   "2118": {
+    "id": 2118,
     "category": "Database",
+    "title": "Build the Equation",
     "difficulty": "Hard",
-    "id": 2118,
-    "link": "https://leetcode.com/problems/build-the-equation/",
-    "title": "Build the Equation"
+    "link": "https://leetcode.com/problems/build-the-equation/"
   },
   "2119": {
+    "id": 2119,
     "category": "Math & Geometry",
+    "title": "A Number After a Double Reversal",
     "difficulty": "Easy",
-    "id": 2119,
-    "link": "https://leetcode.com/problems/a-number-after-a-double-reversal/",
-    "title": "A Number After a Double Reversal"
+    "link": "https://leetcode.com/problems/a-number-after-a-double-reversal/"
   },
   "2120": {
+    "id": 2120,
     "category": "Array & Hashing",
+    "title": "Execution of All Suffix Instructions Staying in a Grid",
     "difficulty": "Medium",
-    "id": 2120,
-    "link": "https://leetcode.com/problems/execution-of-all-suffix-instructions-staying-in-a-grid/",
-    "title": "Execution of All Suffix Instructions Staying in a Grid"
+    "link": "https://leetcode.com/problems/execution-of-all-suffix-instructions-staying-in-a-grid/"
   },
   "2121": {
+    "id": 2121,
     "category": "Array & Hashing",
+    "title": "Intervals Between Identical Elements",
     "difficulty": "Medium",
-    "id": 2121,
-    "link": "https://leetcode.com/problems/intervals-between-identical-elements/",
-    "title": "Intervals Between Identical Elements"
+    "link": "https://leetcode.com/problems/intervals-between-identical-elements/"
   },
   "2122": {
+    "id": 2122,
     "category": "Two Pointers",
+    "title": "Recover the Original Array",
     "difficulty": "Hard",
-    "id": 2122,
-    "link": "https://leetcode.com/problems/recover-the-original-array/",
-    "title": "Recover the Original Array"
+    "link": "https://leetcode.com/problems/recover-the-original-array/"
   },
   "2123": {
+    "id": 2123,
     "category": "Graph Traversal",
+    "title": "Minimum Operations to Remove Adjacent Ones in Matrix",
     "difficulty": "Hard",
-    "id": 2123,
-    "link": "https://leetcode.com/problems/minimum-operations-to-remove-adjacent-ones-in-matrix/",
-    "title": "Minimum Operations to Remove Adjacent Ones in Matrix"
+    "link": "https://leetcode.com/problems/minimum-operations-to-remove-adjacent-ones-in-matrix/"
   },
   "2124": {
+    "id": 2124,
     "category": "Array & Hashing",
+    "title": "Check if All A's Appears Before All B's",
     "difficulty": "Easy",
-    "id": 2124,
-    "link": "https://leetcode.com/problems/check-if-all-as-appears-before-all-bs/",
-    "title": "Check if All A's Appears Before All B's"
+    "link": "https://leetcode.com/problems/check-if-all-as-appears-before-all-bs/"
   },
   "2125": {
+    "id": 2125,
     "category": "Math & Geometry",
+    "title": "Number of Laser Beams in a Bank",
     "difficulty": "Medium",
-    "id": 2125,
-    "link": "https://leetcode.com/problems/number-of-laser-beams-in-a-bank/",
-    "title": "Number of Laser Beams in a Bank"
+    "link": "https://leetcode.com/problems/number-of-laser-beams-in-a-bank/"
   },
   "2126": {
+    "id": 2126,
     "category": "Greedy",
+    "title": "Destroying Asteroids",
     "difficulty": "Medium",
-    "id": 2126,
-    "link": "https://leetcode.com/problems/destroying-asteroids/",
-    "title": "Destroying Asteroids"
+    "link": "https://leetcode.com/problems/destroying-asteroids/"
   },
   "2127": {
+    "id": 2127,
     "category": "Graph Traversal",
+    "title": "Maximum Employees to Be Invited to a Meeting",
     "difficulty": "Hard",
-    "id": 2127,
-    "link": "https://leetcode.com/problems/maximum-employees-to-be-invited-to-a-meeting/",
-    "title": "Maximum Employees to Be Invited to a Meeting"
+    "link": "https://leetcode.com/problems/maximum-employees-to-be-invited-to-a-meeting/"
   },
   "2128": {
+    "id": 2128,
     "category": "Bit Manipulation",
+    "title": "Remove All Ones With Row and Column Flips",
     "difficulty": "Medium",
-    "id": 2128,
-    "link": "https://leetcode.com/problems/remove-all-ones-with-row-and-column-flips/",
-    "title": "Remove All Ones With Row and Column Flips"
+    "link": "https://leetcode.com/problems/remove-all-ones-with-row-and-column-flips/"
   },
   "2129": {
+    "id": 2129,
     "category": "Array & Hashing",
+    "title": "Capitalize the Title",
     "difficulty": "Easy",
-    "id": 2129,
-    "link": "https://leetcode.com/problems/capitalize-the-title/",
-    "title": "Capitalize the Title"
+    "link": "https://leetcode.com/problems/capitalize-the-title/"
   },
   "2130": {
+    "id": 2130,
     "category": "Stack",
+    "title": "Maximum Twin Sum of a Linked List",
     "difficulty": "Medium",
-    "id": 2130,
-    "link": "https://leetcode.com/problems/maximum-twin-sum-of-a-linked-list/",
-    "title": "Maximum Twin Sum of a Linked List"
+    "link": "https://leetcode.com/problems/maximum-twin-sum-of-a-linked-list/"
   },
   "2131": {
+    "id": 2131,
     "category": "Greedy",
+    "title": "Longest Palindrome by Concatenating Two Letter Words",
     "difficulty": "Medium",
-    "id": 2131,
-    "link": "https://leetcode.com/problems/longest-palindrome-by-concatenating-two-letter-words/",
-    "title": "Longest Palindrome by Concatenating Two Letter Words"
+    "link": "https://leetcode.com/problems/longest-palindrome-by-concatenating-two-letter-words/"
   },
   "2132": {
+    "id": 2132,
     "category": "Greedy",
+    "title": "Stamping the Grid",
     "difficulty": "Hard",
-    "id": 2132,
-    "link": "https://leetcode.com/problems/stamping-the-grid/",
-    "title": "Stamping the Grid"
+    "link": "https://leetcode.com/problems/stamping-the-grid/"
   },
   "2133": {
+    "id": 2133,
     "category": "Array & Hashing",
+    "title": "Check if Every Row and Column Contains All Numbers",
     "difficulty": "Easy",
-    "id": 2133,
-    "link": "https://leetcode.com/problems/check-if-every-row-and-column-contains-all-numbers/",
-    "title": "Check if Every Row and Column Contains All Numbers"
+    "link": "https://leetcode.com/problems/check-if-every-row-and-column-contains-all-numbers/"
   },
   "2134": {
+    "id": 2134,
     "category": "Sliding Window",
+    "title": "Minimum Swaps to Group All 1's Together II",
     "difficulty": "Medium",
-    "id": 2134,
-    "link": "https://leetcode.com/problems/minimum-swaps-to-group-all-1s-together-ii/",
-    "title": "Minimum Swaps to Group All 1's Together II"
+    "link": "https://leetcode.com/problems/minimum-swaps-to-group-all-1s-together-ii/"
   },
   "2135": {
+    "id": 2135,
     "category": "Bit Manipulation",
+    "title": "Count Words Obtained After Adding a Letter",
     "difficulty": "Medium",
-    "id": 2135,
-    "link": "https://leetcode.com/problems/count-words-obtained-after-adding-a-letter/",
-    "title": "Count Words Obtained After Adding a Letter"
+    "link": "https://leetcode.com/problems/count-words-obtained-after-adding-a-letter/"
   },
   "2136": {
+    "id": 2136,
     "category": "Greedy",
+    "title": "Earliest Possible Day of Full Bloom",
     "difficulty": "Hard",
-    "id": 2136,
-    "link": "https://leetcode.com/problems/earliest-possible-day-of-full-bloom/",
-    "title": "Earliest Possible Day of Full Bloom"
+    "link": "https://leetcode.com/problems/earliest-possible-day-of-full-bloom/"
   },
   "2137": {
+    "id": 2137,
     "category": "Binary Search",
+    "title": "Pour Water Between Buckets to Make Water Levels Equal",
     "difficulty": "Medium",
-    "id": 2137,
-    "link": "https://leetcode.com/problems/pour-water-between-buckets-to-make-water-levels-equal/",
-    "title": "Pour Water Between Buckets to Make Water Levels Equal"
+    "link": "https://leetcode.com/problems/pour-water-between-buckets-to-make-water-levels-equal/"
   },
   "2138": {
+    "id": 2138,
     "category": "Array & Hashing",
+    "title": "Divide a String Into Groups of Size k",
     "difficulty": "Easy",
-    "id": 2138,
-    "link": "https://leetcode.com/problems/divide-a-string-into-groups-of-size-k/",
-    "title": "Divide a String Into Groups of Size k"
+    "link": "https://leetcode.com/problems/divide-a-string-into-groups-of-size-k/"
   },
   "2139": {
+    "id": 2139,
     "category": "Greedy",
+    "title": "Minimum Moves to Reach Target Score",
     "difficulty": "Medium",
-    "id": 2139,
-    "link": "https://leetcode.com/problems/minimum-moves-to-reach-target-score/",
-    "title": "Minimum Moves to Reach Target Score"
+    "link": "https://leetcode.com/problems/minimum-moves-to-reach-target-score/"
   },
   "2140": {
+    "id": 2140,
     "category": "Dynamic Programming",
+    "title": "Solving Questions With Brainpower",
     "difficulty": "Medium",
-    "id": 2140,
-    "link": "https://leetcode.com/problems/solving-questions-with-brainpower/",
-    "title": "Solving Questions With Brainpower"
+    "link": "https://leetcode.com/problems/solving-questions-with-brainpower/"
   },
   "2141": {
+    "id": 2141,
     "category": "Binary Search",
+    "title": "Maximum Running Time of N Computers",
     "difficulty": "Hard",
-    "id": 2141,
-    "link": "https://leetcode.com/problems/maximum-running-time-of-n-computers/",
-    "title": "Maximum Running Time of N Computers"
+    "link": "https://leetcode.com/problems/maximum-running-time-of-n-computers/"
   },
   "2142": {
+    "id": 2142,
     "category": "Database",
+    "title": "The Number of Passengers in Each Bus I",
     "difficulty": "Medium",
-    "id": 2142,
-    "link": "https://leetcode.com/problems/the-number-of-passengers-in-each-bus-i/",
-    "title": "The Number of Passengers in Each Bus I"
+    "link": "https://leetcode.com/problems/the-number-of-passengers-in-each-bus-i/"
   },
   "2143": {
+    "id": 2143,
     "category": "Dynamic Programming",
+    "title": "Choose Numbers From Two Arrays in Range",
     "difficulty": "Hard",
-    "id": 2143,
-    "link": "https://leetcode.com/problems/choose-numbers-from-two-arrays-in-range/",
-    "title": "Choose Numbers From Two Arrays in Range"
+    "link": "https://leetcode.com/problems/choose-numbers-from-two-arrays-in-range/"
   },
   "2144": {
+    "id": 2144,
     "category": "Greedy",
+    "title": "Minimum Cost of Buying Candies With Discount",
     "difficulty": "Easy",
-    "id": 2144,
-    "link": "https://leetcode.com/problems/minimum-cost-of-buying-candies-with-discount/",
-    "title": "Minimum Cost of Buying Candies With Discount"
+    "link": "https://leetcode.com/problems/minimum-cost-of-buying-candies-with-discount/"
   },
   "2145": {
+    "id": 2145,
     "category": "Array & Hashing",
+    "title": "Count the Hidden Sequences",
     "difficulty": "Medium",
-    "id": 2145,
-    "link": "https://leetcode.com/problems/count-the-hidden-sequences/",
-    "title": "Count the Hidden Sequences"
+    "link": "https://leetcode.com/problems/count-the-hidden-sequences/"
   },
   "2146": {
+    "id": 2146,
     "category": "Graph Traversal",
+    "title": "K Highest Ranked Items Within a Price Range",
     "difficulty": "Medium",
-    "id": 2146,
-    "link": "https://leetcode.com/problems/k-highest-ranked-items-within-a-price-range/",
-    "title": "K Highest Ranked Items Within a Price Range"
+    "link": "https://leetcode.com/problems/k-highest-ranked-items-within-a-price-range/"
   },
   "2147": {
+    "id": 2147,
     "category": "Dynamic Programming",
+    "title": "Number of Ways to Divide a Long Corridor",
     "difficulty": "Hard",
-    "id": 2147,
-    "link": "https://leetcode.com/problems/number-of-ways-to-divide-a-long-corridor/",
-    "title": "Number of Ways to Divide a Long Corridor"
+    "link": "https://leetcode.com/problems/number-of-ways-to-divide-a-long-corridor/"
   },
   "2148": {
+    "id": 2148,
     "category": "Array & Hashing",
+    "title": "Count Elements With Strictly Smaller and Greater Elements ",
     "difficulty": "Easy",
-    "id": 2148,
-    "link": "https://leetcode.com/problems/count-elements-with-strictly-smaller-and-greater-elements/",
-    "title": "Count Elements With Strictly Smaller and Greater Elements "
+    "link": "https://leetcode.com/problems/count-elements-with-strictly-smaller-and-greater-elements/"
   },
   "2149": {
+    "id": 2149,
     "category": "Two Pointers",
+    "title": "Rearrange Array Elements by Sign",
     "difficulty": "Medium",
-    "id": 2149,
-    "link": "https://leetcode.com/problems/rearrange-array-elements-by-sign/",
-    "title": "Rearrange Array Elements by Sign"
+    "link": "https://leetcode.com/problems/rearrange-array-elements-by-sign/"
   },
   "2150": {
+    "id": 2150,
     "category": "Array & Hashing",
+    "title": "Find All Lonely Numbers in the Array",
     "difficulty": "Medium",
-    "id": 2150,
-    "link": "https://leetcode.com/problems/find-all-lonely-numbers-in-the-array/",
-    "title": "Find All Lonely Numbers in the Array"
+    "link": "https://leetcode.com/problems/find-all-lonely-numbers-in-the-array/"
   },
   "2151": {
+    "id": 2151,
     "category": "Backtracking",
+    "title": "Maximum Good People Based on Statements",
     "difficulty": "Hard",
-    "id": 2151,
-    "link": "https://leetcode.com/problems/maximum-good-people-based-on-statements/",
-    "title": "Maximum Good People Based on Statements"
+    "link": "https://leetcode.com/problems/maximum-good-people-based-on-statements/"
   },
   "2152": {
+    "id": 2152,
     "category": "Dynamic Programming",
+    "title": "Minimum Number of Lines to Cover Points",
     "difficulty": "Medium",
-    "id": 2152,
-    "link": "https://leetcode.com/problems/minimum-number-of-lines-to-cover-points/",
-    "title": "Minimum Number of Lines to Cover Points"
+    "link": "https://leetcode.com/problems/minimum-number-of-lines-to-cover-points/"
   },
   "2153": {
+    "id": 2153,
     "category": "Database",
+    "title": "The Number of Passengers in Each Bus II",
     "difficulty": "Hard",
-    "id": 2153,
-    "link": "https://leetcode.com/problems/the-number-of-passengers-in-each-bus-ii/",
-    "title": "The Number of Passengers in Each Bus II"
+    "link": "https://leetcode.com/problems/the-number-of-passengers-in-each-bus-ii/"
   },
   "2154": {
+    "id": 2154,
     "category": "Array & Hashing",
+    "title": "Keep Multiplying Found Values by Two",
     "difficulty": "Easy",
-    "id": 2154,
-    "link": "https://leetcode.com/problems/keep-multiplying-found-values-by-two/",
-    "title": "Keep Multiplying Found Values by Two"
+    "link": "https://leetcode.com/problems/keep-multiplying-found-values-by-two/"
   },
   "2155": {
+    "id": 2155,
     "category": "Array & Hashing",
+    "title": "All Divisions With the Highest Score of a Binary Array",
     "difficulty": "Medium",
-    "id": 2155,
-    "link": "https://leetcode.com/problems/all-divisions-with-the-highest-score-of-a-binary-array/",
-    "title": "All Divisions With the Highest Score of a Binary Array"
+    "link": "https://leetcode.com/problems/all-divisions-with-the-highest-score-of-a-binary-array/"
   },
   "2156": {
+    "id": 2156,
     "category": "Sliding Window",
+    "title": "Find Substring With Given Hash Value",
     "difficulty": "Hard",
-    "id": 2156,
-    "link": "https://leetcode.com/problems/find-substring-with-given-hash-value/",
-    "title": "Find Substring With Given Hash Value"
+    "link": "https://leetcode.com/problems/find-substring-with-given-hash-value/"
   },
   "2157": {
+    "id": 2157,
     "category": "Graph Traversal",
+    "title": "Groups of Strings",
     "difficulty": "Hard",
-    "id": 2157,
-    "link": "https://leetcode.com/problems/groups-of-strings/",
-    "title": "Groups of Strings"
+    "link": "https://leetcode.com/problems/groups-of-strings/"
   },
   "2158": {
+    "id": 2158,
     "category": "Tree",
+    "title": "Amount of New Area Painted Each Day",
     "difficulty": "Hard",
-    "id": 2158,
-    "link": "https://leetcode.com/problems/amount-of-new-area-painted-each-day/",
-    "title": "Amount of New Area Painted Each Day"
+    "link": "https://leetcode.com/problems/amount-of-new-area-painted-each-day/"
   },
   "2159": {
+    "id": 2159,
     "category": "Database",
+    "title": "Order Two Columns Independently",
     "difficulty": "Medium",
-    "id": 2159,
-    "link": "https://leetcode.com/problems/order-two-columns-independently/",
-    "title": "Order Two Columns Independently"
+    "link": "https://leetcode.com/problems/order-two-columns-independently/"
   },
   "2160": {
+    "id": 2160,
     "category": "Greedy",
+    "title": "Minimum Sum of Four Digit Number After Splitting Digits",
     "difficulty": "Easy",
-    "id": 2160,
-    "link": "https://leetcode.com/problems/minimum-sum-of-four-digit-number-after-splitting-digits/",
-    "title": "Minimum Sum of Four Digit Number After Splitting Digits"
+    "link": "https://leetcode.com/problems/minimum-sum-of-four-digit-number-after-splitting-digits/"
   },
   "2161": {
+    "id": 2161,
     "category": "Two Pointers",
+    "title": "Partition Array According to Given Pivot",
     "difficulty": "Medium",
-    "id": 2161,
-    "link": "https://leetcode.com/problems/partition-array-according-to-given-pivot/",
-    "title": "Partition Array According to Given Pivot"
+    "link": "https://leetcode.com/problems/partition-array-according-to-given-pivot/"
   },
   "2162": {
+    "id": 2162,
     "category": "Math & Geometry",
+    "title": "Minimum Cost to Set Cooking Time",
     "difficulty": "Medium",
-    "id": 2162,
-    "link": "https://leetcode.com/problems/minimum-cost-to-set-cooking-time/",
-    "title": "Minimum Cost to Set Cooking Time"
+    "link": "https://leetcode.com/problems/minimum-cost-to-set-cooking-time/"
   },
   "2163": {
+    "id": 2163,
     "category": "Dynamic Programming",
+    "title": "Minimum Difference in Sums After Removal of Elements",
     "difficulty": "Hard",
-    "id": 2163,
-    "link": "https://leetcode.com/problems/minimum-difference-in-sums-after-removal-of-elements/",
-    "title": "Minimum Difference in Sums After Removal of Elements"
+    "link": "https://leetcode.com/problems/minimum-difference-in-sums-after-removal-of-elements/"
   },
   "2164": {
+    "id": 2164,
     "category": "Array & Hashing",
+    "title": "Sort Even and Odd Indices Independently",
     "difficulty": "Easy",
-    "id": 2164,
-    "link": "https://leetcode.com/problems/sort-even-and-odd-indices-independently/",
-    "title": "Sort Even and Odd Indices Independently"
+    "link": "https://leetcode.com/problems/sort-even-and-odd-indices-independently/"
   },
   "2165": {
+    "id": 2165,
     "category": "Math & Geometry",
+    "title": "Smallest Value of the Rearranged Number",
     "difficulty": "Medium",
-    "id": 2165,
-    "link": "https://leetcode.com/problems/smallest-value-of-the-rearranged-number/",
-    "title": "Smallest Value of the Rearranged Number"
+    "link": "https://leetcode.com/problems/smallest-value-of-the-rearranged-number/"
   },
   "2166": {
+    "id": 2166,
     "category": "Array & Hashing",
+    "title": "Design Bitset",
     "difficulty": "Medium",
-    "id": 2166,
-    "link": "https://leetcode.com/problems/design-bitset/",
-    "title": "Design Bitset"
+    "link": "https://leetcode.com/problems/design-bitset/"
   },
   "2167": {
+    "id": 2167,
     "category": "Dynamic Programming",
+    "title": "Minimum Time to Remove All Cars Containing Illegal Goods",
     "difficulty": "Hard",
-    "id": 2167,
-    "link": "https://leetcode.com/problems/minimum-time-to-remove-all-cars-containing-illegal-goods/",
-    "title": "Minimum Time to Remove All Cars Containing Illegal Goods"
+    "link": "https://leetcode.com/problems/minimum-time-to-remove-all-cars-containing-illegal-goods/"
   },
   "2168": {
+    "id": 2168,
     "category": "Array & Hashing",
+    "title": "Unique Substrings With Equal Digit Frequency",
     "difficulty": "Medium",
-    "id": 2168,
-    "link": "https://leetcode.com/problems/unique-substrings-with-equal-digit-frequency/",
-    "title": "Unique Substrings With Equal Digit Frequency"
+    "link": "https://leetcode.com/problems/unique-substrings-with-equal-digit-frequency/"
   },
   "2169": {
+    "id": 2169,
     "category": "Math & Geometry",
+    "title": "Count Operations to Obtain Zero",
     "difficulty": "Easy",
-    "id": 2169,
-    "link": "https://leetcode.com/problems/count-operations-to-obtain-zero/",
-    "title": "Count Operations to Obtain Zero"
+    "link": "https://leetcode.com/problems/count-operations-to-obtain-zero/"
   },
   "2170": {
+    "id": 2170,
     "category": "Greedy",
+    "title": "Minimum Operations to Make the Array Alternating",
     "difficulty": "Medium",
-    "id": 2170,
-    "link": "https://leetcode.com/problems/minimum-operations-to-make-the-array-alternating/",
-    "title": "Minimum Operations to Make the Array Alternating"
+    "link": "https://leetcode.com/problems/minimum-operations-to-make-the-array-alternating/"
   },
   "2171": {
+    "id": 2171,
     "category": "Greedy",
+    "title": "Removing Minimum Number of Magic Beans",
     "difficulty": "Medium",
-    "id": 2171,
-    "link": "https://leetcode.com/problems/removing-minimum-number-of-magic-beans/",
-    "title": "Removing Minimum Number of Magic Beans"
+    "link": "https://leetcode.com/problems/removing-minimum-number-of-magic-beans/"
   },
   "2172": {
+    "id": 2172,
     "category": "Dynamic Programming",
+    "title": "Maximum AND Sum of Array",
     "difficulty": "Hard",
-    "id": 2172,
-    "link": "https://leetcode.com/problems/maximum-and-sum-of-array/",
-    "title": "Maximum AND Sum of Array"
+    "link": "https://leetcode.com/problems/maximum-and-sum-of-array/"
   },
   "2173": {
+    "id": 2173,
     "category": "Database",
+    "title": "Longest Winning Streak",
     "difficulty": "Hard",
-    "id": 2173,
-    "link": "https://leetcode.com/problems/longest-winning-streak/",
-    "title": "Longest Winning Streak"
+    "link": "https://leetcode.com/problems/longest-winning-streak/"
   },
   "2174": {
+    "id": 2174,
     "category": "Graph Traversal",
+    "title": "Remove All Ones With Row and Column Flips II",
     "difficulty": "Medium",
-    "id": 2174,
-    "link": "https://leetcode.com/problems/remove-all-ones-with-row-and-column-flips-ii/",
-    "title": "Remove All Ones With Row and Column Flips II"
+    "link": "https://leetcode.com/problems/remove-all-ones-with-row-and-column-flips-ii/"
   },
   "2175": {
+    "id": 2175,
     "category": "Database",
+    "title": "The Change in Global Rankings",
     "difficulty": "Medium",
-    "id": 2175,
-    "link": "https://leetcode.com/problems/the-change-in-global-rankings/",
-    "title": "The Change in Global Rankings"
+    "link": "https://leetcode.com/problems/the-change-in-global-rankings/"
   },
   "2176": {
+    "id": 2176,
     "category": "Array & Hashing",
+    "title": "Count Equal and Divisible Pairs in an Array",
     "difficulty": "Easy",
-    "id": 2176,
-    "link": "https://leetcode.com/problems/count-equal-and-divisible-pairs-in-an-array/",
-    "title": "Count Equal and Divisible Pairs in an Array"
+    "link": "https://leetcode.com/problems/count-equal-and-divisible-pairs-in-an-array/"
   },
   "2177": {
+    "id": 2177,
     "category": "Math & Geometry",
+    "title": "Find Three Consecutive Integers That Sum to a Given Number",
     "difficulty": "Medium",
-    "id": 2177,
-    "link": "https://leetcode.com/problems/find-three-consecutive-integers-that-sum-to-a-given-number/",
-    "title": "Find Three Consecutive Integers That Sum to a Given Number"
+    "link": "https://leetcode.com/problems/find-three-consecutive-integers-that-sum-to-a-given-number/"
   },
   "2178": {
+    "id": 2178,
     "category": "Backtracking",
+    "title": "Maximum Split of Positive Even Integers",
     "difficulty": "Medium",
-    "id": 2178,
-    "link": "https://leetcode.com/problems/maximum-split-of-positive-even-integers/",
-    "title": "Maximum Split of Positive Even Integers"
+    "link": "https://leetcode.com/problems/maximum-split-of-positive-even-integers/"
   },
   "2179": {
+    "id": 2179,
     "category": "Tree",
+    "title": "Count Good Triplets in an Array",
     "difficulty": "Hard",
-    "id": 2179,
-    "link": "https://leetcode.com/problems/count-good-triplets-in-an-array/",
-    "title": "Count Good Triplets in an Array"
+    "link": "https://leetcode.com/problems/count-good-triplets-in-an-array/"
   },
   "2180": {
+    "id": 2180,
     "category": "Math & Geometry",
+    "title": "Count Integers With Even Digit Sum",
     "difficulty": "Easy",
-    "id": 2180,
-    "link": "https://leetcode.com/problems/count-integers-with-even-digit-sum/",
-    "title": "Count Integers With Even Digit Sum"
+    "link": "https://leetcode.com/problems/count-integers-with-even-digit-sum/"
   },
   "2181": {
+    "id": 2181,
     "category": "Linked List",
+    "title": "Merge Nodes in Between Zeros",
     "difficulty": "Medium",
-    "id": 2181,
-    "link": "https://leetcode.com/problems/merge-nodes-in-between-zeros/",
-    "title": "Merge Nodes in Between Zeros"
+    "link": "https://leetcode.com/problems/merge-nodes-in-between-zeros/"
   },
   "2182": {
+    "id": 2182,
     "category": "Heap (Priority Queue)",
+    "title": "Construct String With Repeat Limit",
     "difficulty": "Medium",
-    "id": 2182,
-    "link": "https://leetcode.com/problems/construct-string-with-repeat-limit/",
-    "title": "Construct String With Repeat Limit"
+    "link": "https://leetcode.com/problems/construct-string-with-repeat-limit/"
   },
   "2183": {
+    "id": 2183,
     "category": "Math & Geometry",
+    "title": "Count Array Pairs Divisible by K",
     "difficulty": "Hard",
-    "id": 2183,
-    "link": "https://leetcode.com/problems/count-array-pairs-divisible-by-k/",
-    "title": "Count Array Pairs Divisible by K"
+    "link": "https://leetcode.com/problems/count-array-pairs-divisible-by-k/"
   },
   "2184": {
+    "id": 2184,
     "category": "Dynamic Programming",
+    "title": "Number of Ways to Build Sturdy Brick Wall",
     "difficulty": "Medium",
-    "id": 2184,
-    "link": "https://leetcode.com/problems/number-of-ways-to-build-sturdy-brick-wall/",
-    "title": "Number of Ways to Build Sturdy Brick Wall"
+    "link": "https://leetcode.com/problems/number-of-ways-to-build-sturdy-brick-wall/"
   },
   "2185": {
+    "id": 2185,
     "category": "Array & Hashing",
+    "title": "Counting Words With a Given Prefix",
     "difficulty": "Easy",
-    "id": 2185,
-    "link": "https://leetcode.com/problems/counting-words-with-a-given-prefix/",
-    "title": "Counting Words With a Given Prefix"
+    "link": "https://leetcode.com/problems/counting-words-with-a-given-prefix/"
   },
   "2186": {
+    "id": 2186,
     "category": "Array & Hashing",
+    "title": "Minimum Number of Steps to Make Two Strings Anagram II",
     "difficulty": "Medium",
-    "id": 2186,
-    "link": "https://leetcode.com/problems/minimum-number-of-steps-to-make-two-strings-anagram-ii/",
-    "title": "Minimum Number of Steps to Make Two Strings Anagram II"
+    "link": "https://leetcode.com/problems/minimum-number-of-steps-to-make-two-strings-anagram-ii/"
   },
   "2187": {
+    "id": 2187,
     "category": "Binary Search",
+    "title": "Minimum Time to Complete Trips",
     "difficulty": "Medium",
-    "id": 2187,
-    "link": "https://leetcode.com/problems/minimum-time-to-complete-trips/",
-    "title": "Minimum Time to Complete Trips"
+    "link": "https://leetcode.com/problems/minimum-time-to-complete-trips/"
   },
   "2188": {
+    "id": 2188,
     "category": "Dynamic Programming",
+    "title": "Minimum Time to Finish the Race",
     "difficulty": "Hard",
-    "id": 2188,
-    "link": "https://leetcode.com/problems/minimum-time-to-finish-the-race/",
-    "title": "Minimum Time to Finish the Race"
+    "link": "https://leetcode.com/problems/minimum-time-to-finish-the-race/"
   },
   "2189": {
+    "id": 2189,
     "category": "Dynamic Programming",
+    "title": "Number of Ways to Build House of Cards",
     "difficulty": "Medium",
-    "id": 2189,
-    "link": "https://leetcode.com/problems/number-of-ways-to-build-house-of-cards/",
-    "title": "Number of Ways to Build House of Cards"
+    "link": "https://leetcode.com/problems/number-of-ways-to-build-house-of-cards/"
   },
   "2190": {
+    "id": 2190,
     "category": "Array & Hashing",
+    "title": "Most Frequent Number Following Key In an Array",
     "difficulty": "Easy",
-    "id": 2190,
-    "link": "https://leetcode.com/problems/most-frequent-number-following-key-in-an-array/",
-    "title": "Most Frequent Number Following Key In an Array"
+    "link": "https://leetcode.com/problems/most-frequent-number-following-key-in-an-array/"
   },
   "2191": {
+    "id": 2191,
     "category": "Array & Hashing",
+    "title": "Sort the Jumbled Numbers",
     "difficulty": "Medium",
-    "id": 2191,
-    "link": "https://leetcode.com/problems/sort-the-jumbled-numbers/",
-    "title": "Sort the Jumbled Numbers"
+    "link": "https://leetcode.com/problems/sort-the-jumbled-numbers/"
   },
   "2192": {
+    "id": 2192,
     "category": "Graph Traversal",
+    "title": "All Ancestors of a Node in a Directed Acyclic Graph",
     "difficulty": "Medium",
-    "id": 2192,
-    "link": "https://leetcode.com/problems/all-ancestors-of-a-node-in-a-directed-acyclic-graph/",
-    "title": "All Ancestors of a Node in a Directed Acyclic Graph"
+    "link": "https://leetcode.com/problems/all-ancestors-of-a-node-in-a-directed-acyclic-graph/"
   },
   "2193": {
+    "id": 2193,
     "category": "Tree",
+    "title": "Minimum Number of Moves to Make Palindrome",
     "difficulty": "Hard",
-    "id": 2193,
-    "link": "https://leetcode.com/problems/minimum-number-of-moves-to-make-palindrome/",
-    "title": "Minimum Number of Moves to Make Palindrome"
+    "link": "https://leetcode.com/problems/minimum-number-of-moves-to-make-palindrome/"
   },
   "2194": {
+    "id": 2194,
     "category": "Array & Hashing",
+    "title": "Cells in a Range on an Excel Sheet",
     "difficulty": "Easy",
-    "id": 2194,
-    "link": "https://leetcode.com/problems/cells-in-a-range-on-an-excel-sheet/",
-    "title": "Cells in a Range on an Excel Sheet"
+    "link": "https://leetcode.com/problems/cells-in-a-range-on-an-excel-sheet/"
   },
   "2195": {
+    "id": 2195,
     "category": "Greedy",
+    "title": "Append K Integers With Minimal Sum",
     "difficulty": "Medium",
-    "id": 2195,
-    "link": "https://leetcode.com/problems/append-k-integers-with-minimal-sum/",
-    "title": "Append K Integers With Minimal Sum"
+    "link": "https://leetcode.com/problems/append-k-integers-with-minimal-sum/"
   },
   "2196": {
+    "id": 2196,
     "category": "Tree",
+    "title": "Create Binary Tree From Descriptions",
     "difficulty": "Medium",
-    "id": 2196,
-    "link": "https://leetcode.com/problems/create-binary-tree-from-descriptions/",
-    "title": "Create Binary Tree From Descriptions"
+    "link": "https://leetcode.com/problems/create-binary-tree-from-descriptions/"
   },
   "2197": {
+    "id": 2197,
     "category": "Stack",
+    "title": "Replace Non-Coprime Numbers in Array",
     "difficulty": "Hard",
-    "id": 2197,
-    "link": "https://leetcode.com/problems/replace-non-coprime-numbers-in-array/",
-    "title": "Replace Non-Coprime Numbers in Array"
+    "link": "https://leetcode.com/problems/replace-non-coprime-numbers-in-array/"
   },
   "2198": {
+    "id": 2198,
     "category": "Math & Geometry",
+    "title": "Number of Single Divisor Triplets",
     "difficulty": "Medium",
-    "id": 2198,
-    "link": "https://leetcode.com/problems/number-of-single-divisor-triplets/",
-    "title": "Number of Single Divisor Triplets"
+    "link": "https://leetcode.com/problems/number-of-single-divisor-triplets/"
   },
   "2199": {
+    "id": 2199,
     "category": "Database",
+    "title": "Finding the Topic of Each Post",
     "difficulty": "Hard",
-    "id": 2199,
-    "link": "https://leetcode.com/problems/finding-the-topic-of-each-post/",
-    "title": "Finding the Topic of Each Post"
+    "link": "https://leetcode.com/problems/finding-the-topic-of-each-post/"
   },
   "2200": {
+    "id": 2200,
     "category": "Two Pointers",
+    "title": "Find All K-Distant Indices in an Array",
     "difficulty": "Easy",
-    "id": 2200,
-    "link": "https://leetcode.com/problems/find-all-k-distant-indices-in-an-array/",
-    "title": "Find All K-Distant Indices in an Array"
+    "link": "https://leetcode.com/problems/find-all-k-distant-indices-in-an-array/"
   },
   "2201": {
+    "id": 2201,
     "category": "Array & Hashing",
+    "title": "Count Artifacts That Can Be Extracted",
     "difficulty": "Medium",
-    "id": 2201,
-    "link": "https://leetcode.com/problems/count-artifacts-that-can-be-extracted/",
-    "title": "Count Artifacts That Can Be Extracted"
+    "link": "https://leetcode.com/problems/count-artifacts-that-can-be-extracted/"
   },
   "2202": {
+    "id": 2202,
     "category": "Greedy",
+    "title": "Maximize the Topmost Element After K Moves",
     "difficulty": "Medium",
-    "id": 2202,
-    "link": "https://leetcode.com/problems/maximize-the-topmost-element-after-k-moves/",
-    "title": "Maximize the Topmost Element After K Moves"
+    "link": "https://leetcode.com/problems/maximize-the-topmost-element-after-k-moves/"
   },
   "2203": {
+    "id": 2203,
     "category": "Graph Traversal",
+    "title": "Minimum Weighted Subgraph With the Required Paths",
     "difficulty": "Hard",
-    "id": 2203,
-    "link": "https://leetcode.com/problems/minimum-weighted-subgraph-with-the-required-paths/",
-    "title": "Minimum Weighted Subgraph With the Required Paths"
+    "link": "https://leetcode.com/problems/minimum-weighted-subgraph-with-the-required-paths/"
   },
   "2204": {
+    "id": 2204,
     "category": "Graph Traversal",
+    "title": "Distance to a Cycle in Undirected Graph",
     "difficulty": "Hard",
-    "id": 2204,
-    "link": "https://leetcode.com/problems/distance-to-a-cycle-in-undirected-graph/",
-    "title": "Distance to a Cycle in Undirected Graph"
+    "link": "https://leetcode.com/problems/distance-to-a-cycle-in-undirected-graph/"
   },
   "2205": {
+    "id": 2205,
     "category": "Database",
+    "title": "The Number of Users That Are Eligible for Discount",
     "difficulty": "Easy",
-    "id": 2205,
-    "link": "https://leetcode.com/problems/the-number-of-users-that-are-eligible-for-discount/",
-    "title": "The Number of Users That Are Eligible for Discount"
+    "link": "https://leetcode.com/problems/the-number-of-users-that-are-eligible-for-discount/"
   },
   "2206": {
+    "id": 2206,
     "category": "Bit Manipulation",
+    "title": "Divide Array Into Equal Pairs",
     "difficulty": "Easy",
-    "id": 2206,
-    "link": "https://leetcode.com/problems/divide-array-into-equal-pairs/",
-    "title": "Divide Array Into Equal Pairs"
+    "link": "https://leetcode.com/problems/divide-array-into-equal-pairs/"
   },
   "2207": {
+    "id": 2207,
     "category": "Greedy",
+    "title": "Maximize Number of Subsequences in a String",
     "difficulty": "Medium",
-    "id": 2207,
-    "link": "https://leetcode.com/problems/maximize-number-of-subsequences-in-a-string/",
-    "title": "Maximize Number of Subsequences in a String"
+    "link": "https://leetcode.com/problems/maximize-number-of-subsequences-in-a-string/"
   },
   "2208": {
+    "id": 2208,
     "category": "Heap (Priority Queue)",
+    "title": "Minimum Operations to Halve Array Sum",
     "difficulty": "Medium",
-    "id": 2208,
-    "link": "https://leetcode.com/problems/minimum-operations-to-halve-array-sum/",
-    "title": "Minimum Operations to Halve Array Sum"
+    "link": "https://leetcode.com/problems/minimum-operations-to-halve-array-sum/"
   },
   "2209": {
+    "id": 2209,
     "category": "Dynamic Programming",
+    "title": "Minimum White Tiles After Covering With Carpets",
     "difficulty": "Hard",
-    "id": 2209,
-    "link": "https://leetcode.com/problems/minimum-white-tiles-after-covering-with-carpets/",
-    "title": "Minimum White Tiles After Covering With Carpets"
+    "link": "https://leetcode.com/problems/minimum-white-tiles-after-covering-with-carpets/"
   },
   "2210": {
+    "id": 2210,
     "category": "Array & Hashing",
+    "title": "Count Hills and Valleys in an Array",
     "difficulty": "Easy",
-    "id": 2210,
-    "link": "https://leetcode.com/problems/count-hills-and-valleys-in-an-array/",
-    "title": "Count Hills and Valleys in an Array"
+    "link": "https://leetcode.com/problems/count-hills-and-valleys-in-an-array/"
   },
   "2211": {
+    "id": 2211,
     "category": "Stack",
+    "title": "Count Collisions on a Road",
     "difficulty": "Medium",
-    "id": 2211,
-    "link": "https://leetcode.com/problems/count-collisions-on-a-road/",
-    "title": "Count Collisions on a Road"
+    "link": "https://leetcode.com/problems/count-collisions-on-a-road/"
   },
   "2212": {
+    "id": 2212,
     "category": "Backtracking",
+    "title": "Maximum Points in an Archery Competition",
     "difficulty": "Medium",
-    "id": 2212,
-    "link": "https://leetcode.com/problems/maximum-points-in-an-archery-competition/",
-    "title": "Maximum Points in an Archery Competition"
+    "link": "https://leetcode.com/problems/maximum-points-in-an-archery-competition/"
   },
   "2213": {
+    "id": 2213,
     "category": "Tree",
+    "title": "Longest Substring of One Repeating Character",
     "difficulty": "Hard",
-    "id": 2213,
-    "link": "https://leetcode.com/problems/longest-substring-of-one-repeating-character/",
-    "title": "Longest Substring of One Repeating Character"
+    "link": "https://leetcode.com/problems/longest-substring-of-one-repeating-character/"
   },
   "2214": {
+    "id": 2214,
     "category": "Greedy",
+    "title": "Minimum Health to Beat Game",
     "difficulty": "Medium",
-    "id": 2214,
-    "link": "https://leetcode.com/problems/minimum-health-to-beat-game/",
-    "title": "Minimum Health to Beat Game"
+    "link": "https://leetcode.com/problems/minimum-health-to-beat-game/"
   },
   "2215": {
+    "id": 2215,
     "category": "Array & Hashing",
+    "title": "Find the Difference of Two Arrays",
     "difficulty": "Easy",
-    "id": 2215,
-    "link": "https://leetcode.com/problems/find-the-difference-of-two-arrays/",
-    "title": "Find the Difference of Two Arrays"
+    "link": "https://leetcode.com/problems/find-the-difference-of-two-arrays/"
   },
   "2216": {
+    "id": 2216,
     "category": "Stack",
+    "title": "Minimum Deletions to Make Array Beautiful",
     "difficulty": "Medium",
-    "id": 2216,
-    "link": "https://leetcode.com/problems/minimum-deletions-to-make-array-beautiful/",
-    "title": "Minimum Deletions to Make Array Beautiful"
+    "link": "https://leetcode.com/problems/minimum-deletions-to-make-array-beautiful/"
   },
   "2217": {
+    "id": 2217,
     "category": "Math & Geometry",
+    "title": "Find Palindrome With Fixed Length",
     "difficulty": "Medium",
-    "id": 2217,
-    "link": "https://leetcode.com/problems/find-palindrome-with-fixed-length/",
-    "title": "Find Palindrome With Fixed Length"
+    "link": "https://leetcode.com/problems/find-palindrome-with-fixed-length/"
   },
   "2218": {
+    "id": 2218,
     "category": "Dynamic Programming",
+    "title": "Maximum Value of K Coins From Piles",
     "difficulty": "Hard",
-    "id": 2218,
-    "link": "https://leetcode.com/problems/maximum-value-of-k-coins-from-piles/",
-    "title": "Maximum Value of K Coins From Piles"
+    "link": "https://leetcode.com/problems/maximum-value-of-k-coins-from-piles/"
   },
   "2219": {
+    "id": 2219,
     "category": "Array & Hashing",
+    "title": "Maximum Sum Score of Array",
     "difficulty": "Medium",
-    "id": 2219,
-    "link": "https://leetcode.com/problems/maximum-sum-score-of-array/",
-    "title": "Maximum Sum Score of Array"
+    "link": "https://leetcode.com/problems/maximum-sum-score-of-array/"
   },
   "2220": {
+    "id": 2220,
     "category": "Bit Manipulation",
+    "title": "Minimum Bit Flips to Convert Number",
     "difficulty": "Easy",
-    "id": 2220,
-    "link": "https://leetcode.com/problems/minimum-bit-flips-to-convert-number/",
-    "title": "Minimum Bit Flips to Convert Number"
+    "link": "https://leetcode.com/problems/minimum-bit-flips-to-convert-number/"
   },
   "2221": {
+    "id": 2221,
     "category": "Math & Geometry",
+    "title": "Find Triangular Sum of an Array",
     "difficulty": "Medium",
-    "id": 2221,
-    "link": "https://leetcode.com/problems/find-triangular-sum-of-an-array/",
-    "title": "Find Triangular Sum of an Array"
+    "link": "https://leetcode.com/problems/find-triangular-sum-of-an-array/"
   },
   "2222": {
+    "id": 2222,
     "category": "Dynamic Programming",
+    "title": "Number of Ways to Select Buildings",
     "difficulty": "Medium",
-    "id": 2222,
-    "link": "https://leetcode.com/problems/number-of-ways-to-select-buildings/",
-    "title": "Number of Ways to Select Buildings"
+    "link": "https://leetcode.com/problems/number-of-ways-to-select-buildings/"
   },
   "2223": {
+    "id": 2223,
     "category": "Binary Search",
+    "title": "Sum of Scores of Built Strings",
     "difficulty": "Hard",
-    "id": 2223,
-    "link": "https://leetcode.com/problems/sum-of-scores-of-built-strings/",
-    "title": "Sum of Scores of Built Strings"
+    "link": "https://leetcode.com/problems/sum-of-scores-of-built-strings/"
   },
   "2224": {
+    "id": 2224,
     "category": "Greedy",
+    "title": "Minimum Number of Operations to Convert Time",
     "difficulty": "Easy",
-    "id": 2224,
-    "link": "https://leetcode.com/problems/minimum-number-of-operations-to-convert-time/",
-    "title": "Minimum Number of Operations to Convert Time"
+    "link": "https://leetcode.com/problems/minimum-number-of-operations-to-convert-time/"
   },
   "2225": {
+    "id": 2225,
     "category": "Array & Hashing",
+    "title": "Find Players With Zero or One Losses",
     "difficulty": "Medium",
-    "id": 2225,
-    "link": "https://leetcode.com/problems/find-players-with-zero-or-one-losses/",
-    "title": "Find Players With Zero or One Losses"
+    "link": "https://leetcode.com/problems/find-players-with-zero-or-one-losses/"
   },
   "2226": {
+    "id": 2226,
     "category": "Binary Search",
+    "title": "Maximum Candies Allocated to K Children",
     "difficulty": "Medium",
-    "id": 2226,
-    "link": "https://leetcode.com/problems/maximum-candies-allocated-to-k-children/",
-    "title": "Maximum Candies Allocated to K Children"
+    "link": "https://leetcode.com/problems/maximum-candies-allocated-to-k-children/"
   },
   "2227": {
+    "id": 2227,
     "category": "Trie",
+    "title": "Encrypt and Decrypt Strings",
     "difficulty": "Hard",
-    "id": 2227,
-    "link": "https://leetcode.com/problems/encrypt-and-decrypt-strings/",
-    "title": "Encrypt and Decrypt Strings"
+    "link": "https://leetcode.com/problems/encrypt-and-decrypt-strings/"
   },
   "2228": {
+    "id": 2228,
     "category": "Database",
+    "title": "Users With Two Purchases Within Seven Days",
     "difficulty": "Medium",
-    "id": 2228,
-    "link": "https://leetcode.com/problems/users-with-two-purchases-within-seven-days/",
-    "title": "Users With Two Purchases Within Seven Days"
+    "link": "https://leetcode.com/problems/users-with-two-purchases-within-seven-days/"
   },
   "2229": {
+    "id": 2229,
     "category": "Array & Hashing",
+    "title": "Check if an Array Is Consecutive",
     "difficulty": "Easy",
-    "id": 2229,
-    "link": "https://leetcode.com/problems/check-if-an-array-is-consecutive/",
-    "title": "Check if an Array Is Consecutive"
+    "link": "https://leetcode.com/problems/check-if-an-array-is-consecutive/"
   },
   "2230": {
+    "id": 2230,
     "category": "Database",
+    "title": "The Users That Are Eligible for Discount",
     "difficulty": "Easy",
-    "id": 2230,
-    "link": "https://leetcode.com/problems/the-users-that-are-eligible-for-discount/",
-    "title": "The Users That Are Eligible for Discount"
+    "link": "https://leetcode.com/problems/the-users-that-are-eligible-for-discount/"
   },
   "2231": {
+    "id": 2231,
     "category": "Heap (Priority Queue)",
+    "title": "Largest Number After Digit Swaps by Parity",
     "difficulty": "Easy",
-    "id": 2231,
-    "link": "https://leetcode.com/problems/largest-number-after-digit-swaps-by-parity/",
-    "title": "Largest Number After Digit Swaps by Parity"
+    "link": "https://leetcode.com/problems/largest-number-after-digit-swaps-by-parity/"
   },
   "2232": {
+    "id": 2232,
     "category": "Array & Hashing",
+    "title": "Minimize Result by Adding Parentheses to Expression",
     "difficulty": "Medium",
-    "id": 2232,
-    "link": "https://leetcode.com/problems/minimize-result-by-adding-parentheses-to-expression/",
-    "title": "Minimize Result by Adding Parentheses to Expression"
+    "link": "https://leetcode.com/problems/minimize-result-by-adding-parentheses-to-expression/"
   },
   "2233": {
+    "id": 2233,
     "category": "Heap (Priority Queue)",
+    "title": "Maximum Product After K Increments",
     "difficulty": "Medium",
-    "id": 2233,
-    "link": "https://leetcode.com/problems/maximum-product-after-k-increments/",
-    "title": "Maximum Product After K Increments"
+    "link": "https://leetcode.com/problems/maximum-product-after-k-increments/"
   },
   "2234": {
+    "id": 2234,
     "category": "Binary Search",
+    "title": "Maximum Total Beauty of the Gardens",
     "difficulty": "Hard",
-    "id": 2234,
-    "link": "https://leetcode.com/problems/maximum-total-beauty-of-the-gardens/",
-    "title": "Maximum Total Beauty of the Gardens"
+    "link": "https://leetcode.com/problems/maximum-total-beauty-of-the-gardens/"
   },
   "2235": {
+    "id": 2235,
     "category": "Math & Geometry",
+    "title": "Add Two Integers",
     "difficulty": "Easy",
-    "id": 2235,
-    "link": "https://leetcode.com/problems/add-two-integers/",
-    "title": "Add Two Integers"
+    "link": "https://leetcode.com/problems/add-two-integers/"
   },
   "2236": {
+    "id": 2236,
     "category": "Tree",
+    "title": "Root Equals Sum of Children",
     "difficulty": "Easy",
-    "id": 2236,
-    "link": "https://leetcode.com/problems/root-equals-sum-of-children/",
-    "title": "Root Equals Sum of Children"
+    "link": "https://leetcode.com/problems/root-equals-sum-of-children/"
   },
   "2237": {
+    "id": 2237,
     "category": "Array & Hashing",
+    "title": "Count Positions on Street With Required Brightness",
     "difficulty": "Medium",
-    "id": 2237,
-    "link": "https://leetcode.com/problems/count-positions-on-street-with-required-brightness/",
-    "title": "Count Positions on Street With Required Brightness"
+    "link": "https://leetcode.com/problems/count-positions-on-street-with-required-brightness/"
   },
   "2238": {
+    "id": 2238,
     "category": "Database",
+    "title": "Number of Times a Driver Was a Passenger",
     "difficulty": "Medium",
-    "id": 2238,
-    "link": "https://leetcode.com/problems/number-of-times-a-driver-was-a-passenger/",
-    "title": "Number of Times a Driver Was a Passenger"
+    "link": "https://leetcode.com/problems/number-of-times-a-driver-was-a-passenger/"
   },
   "2239": {
+    "id": 2239,
     "category": "Array & Hashing",
+    "title": "Find Closest Number to Zero",
     "difficulty": "Easy",
-    "id": 2239,
-    "link": "https://leetcode.com/problems/find-closest-number-to-zero/",
-    "title": "Find Closest Number to Zero"
+    "link": "https://leetcode.com/problems/find-closest-number-to-zero/"
   },
   "2240": {
+    "id": 2240,
     "category": "Math & Geometry",
+    "title": "Number of Ways to Buy Pens and Pencils",
     "difficulty": "Medium",
-    "id": 2240,
-    "link": "https://leetcode.com/problems/number-of-ways-to-buy-pens-and-pencils/",
-    "title": "Number of Ways to Buy Pens and Pencils"
+    "link": "https://leetcode.com/problems/number-of-ways-to-buy-pens-and-pencils/"
   },
   "2241": {
+    "id": 2241,
     "category": "Greedy",
+    "title": "Design an ATM Machine",
     "difficulty": "Medium",
-    "id": 2241,
-    "link": "https://leetcode.com/problems/design-an-atm-machine/",
-    "title": "Design an ATM Machine"
+    "link": "https://leetcode.com/problems/design-an-atm-machine/"
   },
   "2242": {
+    "id": 2242,
     "category": "Graph Traversal",
+    "title": "Maximum Score of a Node Sequence",
     "difficulty": "Hard",
-    "id": 2242,
-    "link": "https://leetcode.com/problems/maximum-score-of-a-node-sequence/",
-    "title": "Maximum Score of a Node Sequence"
+    "link": "https://leetcode.com/problems/maximum-score-of-a-node-sequence/"
   },
   "2243": {
+    "id": 2243,
     "category": "Array & Hashing",
+    "title": "Calculate Digit Sum of a String",
     "difficulty": "Easy",
-    "id": 2243,
-    "link": "https://leetcode.com/problems/calculate-digit-sum-of-a-string/",
-    "title": "Calculate Digit Sum of a String"
+    "link": "https://leetcode.com/problems/calculate-digit-sum-of-a-string/"
   },
   "2244": {
+    "id": 2244,
     "category": "Greedy",
+    "title": "Minimum Rounds to Complete All Tasks",
     "difficulty": "Medium",
-    "id": 2244,
-    "link": "https://leetcode.com/problems/minimum-rounds-to-complete-all-tasks/",
-    "title": "Minimum Rounds to Complete All Tasks"
+    "link": "https://leetcode.com/problems/minimum-rounds-to-complete-all-tasks/"
   },
   "2245": {
+    "id": 2245,
     "category": "Array & Hashing",
+    "title": "Maximum Trailing Zeros in a Cornered Path",
     "difficulty": "Medium",
-    "id": 2245,
-    "link": "https://leetcode.com/problems/maximum-trailing-zeros-in-a-cornered-path/",
-    "title": "Maximum Trailing Zeros in a Cornered Path"
+    "link": "https://leetcode.com/problems/maximum-trailing-zeros-in-a-cornered-path/"
   },
   "2246": {
+    "id": 2246,
     "category": "Tree",
+    "title": "Longest Path With Different Adjacent Characters",
     "difficulty": "Hard",
-    "id": 2246,
-    "link": "https://leetcode.com/problems/longest-path-with-different-adjacent-characters/",
-    "title": "Longest Path With Different Adjacent Characters"
+    "link": "https://leetcode.com/problems/longest-path-with-different-adjacent-characters/"
   },
   "2247": {
+    "id": 2247,
     "category": "Graph Traversal",
+    "title": "Maximum Cost of Trip With K Highways",
     "difficulty": "Hard",
-    "id": 2247,
-    "link": "https://leetcode.com/problems/maximum-cost-of-trip-with-k-highways/",
-    "title": "Maximum Cost of Trip With K Highways"
+    "link": "https://leetcode.com/problems/maximum-cost-of-trip-with-k-highways/"
   },
   "2248": {
+    "id": 2248,
     "category": "Array & Hashing",
+    "title": "Intersection of Multiple Arrays",
     "difficulty": "Easy",
-    "id": 2248,
-    "link": "https://leetcode.com/problems/intersection-of-multiple-arrays/",
-    "title": "Intersection of Multiple Arrays"
+    "link": "https://leetcode.com/problems/intersection-of-multiple-arrays/"
   },
   "2249": {
+    "id": 2249,
     "category": "Math & Geometry",
+    "title": "Count Lattice Points Inside a Circle",
     "difficulty": "Medium",
-    "id": 2249,
-    "link": "https://leetcode.com/problems/count-lattice-points-inside-a-circle/",
-    "title": "Count Lattice Points Inside a Circle"
+    "link": "https://leetcode.com/problems/count-lattice-points-inside-a-circle/"
   },
   "2250": {
+    "id": 2250,
     "category": "Tree",
+    "title": "Count Number of Rectangles Containing Each Point",
     "difficulty": "Medium",
-    "id": 2250,
-    "link": "https://leetcode.com/problems/count-number-of-rectangles-containing-each-point/",
-    "title": "Count Number of Rectangles Containing Each Point"
+    "link": "https://leetcode.com/problems/count-number-of-rectangles-containing-each-point/"
   },
   "2251": {
+    "id": 2251,
     "category": "Binary Search",
+    "title": "Number of Flowers in Full Bloom",
     "difficulty": "Hard",
-    "id": 2251,
-    "link": "https://leetcode.com/problems/number-of-flowers-in-full-bloom/",
-    "title": "Number of Flowers in Full Bloom"
+    "link": "https://leetcode.com/problems/number-of-flowers-in-full-bloom/"
   },
   "2252": {
+    "id": 2252,
     "category": "Database",
+    "title": "Dynamic Pivoting of a Table",
     "difficulty": "Hard",
-    "id": 2252,
-    "link": "https://leetcode.com/problems/dynamic-pivoting-of-a-table/",
-    "title": "Dynamic Pivoting of a Table"
+    "link": "https://leetcode.com/problems/dynamic-pivoting-of-a-table/"
   },
   "2253": {
+    "id": 2253,
     "category": "Database",
+    "title": "Dynamic Unpivoting of a Table",
     "difficulty": "Hard",
-    "id": 2253,
-    "link": "https://leetcode.com/problems/dynamic-unpivoting-of-a-table/",
-    "title": "Dynamic Unpivoting of a Table"
+    "link": "https://leetcode.com/problems/dynamic-unpivoting-of-a-table/"
   },
   "2254": {
+    "id": 2254,
     "category": "Stack",
+    "title": "Design Video Sharing Platform",
     "difficulty": "Hard",
-    "id": 2254,
-    "link": "https://leetcode.com/problems/design-video-sharing-platform/",
-    "title": "Design Video Sharing Platform"
+    "link": "https://leetcode.com/problems/design-video-sharing-platform/"
   },
   "2255": {
+    "id": 2255,
     "category": "Array & Hashing",
+    "title": "Count Prefixes of a Given String",
     "difficulty": "Easy",
-    "id": 2255,
-    "link": "https://leetcode.com/problems/count-prefixes-of-a-given-string/",
-    "title": "Count Prefixes of a Given String"
+    "link": "https://leetcode.com/problems/count-prefixes-of-a-given-string/"
   },
   "2256": {
+    "id": 2256,
     "category": "Array & Hashing",
+    "title": "Minimum Average Difference",
     "difficulty": "Medium",
-    "id": 2256,
-    "link": "https://leetcode.com/problems/minimum-average-difference/",
-    "title": "Minimum Average Difference"
+    "link": "https://leetcode.com/problems/minimum-average-difference/"
   },
   "2257": {
+    "id": 2257,
     "category": "Array & Hashing",
+    "title": "Count Unguarded Cells in the Grid",
     "difficulty": "Medium",
-    "id": 2257,
-    "link": "https://leetcode.com/problems/count-unguarded-cells-in-the-grid/",
-    "title": "Count Unguarded Cells in the Grid"
+    "link": "https://leetcode.com/problems/count-unguarded-cells-in-the-grid/"
   },
   "2258": {
+    "id": 2258,
     "category": "Graph Traversal",
+    "title": "Escape the Spreading Fire",
     "difficulty": "Hard",
-    "id": 2258,
-    "link": "https://leetcode.com/problems/escape-the-spreading-fire/",
-    "title": "Escape the Spreading Fire"
+    "link": "https://leetcode.com/problems/escape-the-spreading-fire/"
   },
   "2259": {
+    "id": 2259,
     "category": "Greedy",
+    "title": "Remove Digit From Number to Maximize Result",
     "difficulty": "Easy",
-    "id": 2259,
-    "link": "https://leetcode.com/problems/remove-digit-from-number-to-maximize-result/",
-    "title": "Remove Digit From Number to Maximize Result"
+    "link": "https://leetcode.com/problems/remove-digit-from-number-to-maximize-result/"
   },
   "2260": {
+    "id": 2260,
     "category": "Sliding Window",
+    "title": "Minimum Consecutive Cards to Pick Up",
     "difficulty": "Medium",
-    "id": 2260,
-    "link": "https://leetcode.com/problems/minimum-consecutive-cards-to-pick-up/",
-    "title": "Minimum Consecutive Cards to Pick Up"
+    "link": "https://leetcode.com/problems/minimum-consecutive-cards-to-pick-up/"
   },
   "2261": {
+    "id": 2261,
     "category": "Trie",
+    "title": "K Divisible Elements Subarrays",
     "difficulty": "Medium",
-    "id": 2261,
-    "link": "https://leetcode.com/problems/k-divisible-elements-subarrays/",
-    "title": "K Divisible Elements Subarrays"
+    "link": "https://leetcode.com/problems/k-divisible-elements-subarrays/"
   },
   "2262": {
+    "id": 2262,
     "category": "Dynamic Programming",
+    "title": "Total Appeal of A String",
     "difficulty": "Hard",
-    "id": 2262,
-    "link": "https://leetcode.com/problems/total-appeal-of-a-string/",
-    "title": "Total Appeal of A String"
+    "link": "https://leetcode.com/problems/total-appeal-of-a-string/"
   },
   "2263": {
+    "id": 2263,
     "category": "Dynamic Programming",
+    "title": "Make Array Non-decreasing or Non-increasing",
     "difficulty": "Hard",
-    "id": 2263,
-    "link": "https://leetcode.com/problems/make-array-non-decreasing-or-non-increasing/",
-    "title": "Make Array Non-decreasing or Non-increasing"
+    "link": "https://leetcode.com/problems/make-array-non-decreasing-or-non-increasing/"
   },
   "2264": {
+    "id": 2264,
     "category": "Array & Hashing",
+    "title": "Largest 3-Same-Digit Number in String",
     "difficulty": "Easy",
-    "id": 2264,
-    "link": "https://leetcode.com/problems/largest-3-same-digit-number-in-string/",
-    "title": "Largest 3-Same-Digit Number in String"
+    "link": "https://leetcode.com/problems/largest-3-same-digit-number-in-string/"
   },
   "2265": {
+    "id": 2265,
     "category": "Tree",
+    "title": "Count Nodes Equal to Average of Subtree",
     "difficulty": "Medium",
-    "id": 2265,
-    "link": "https://leetcode.com/problems/count-nodes-equal-to-average-of-subtree/",
-    "title": "Count Nodes Equal to Average of Subtree"
+    "link": "https://leetcode.com/problems/count-nodes-equal-to-average-of-subtree/"
   },
   "2266": {
+    "id": 2266,
     "category": "Dynamic Programming",
+    "title": "Count Number of Texts",
     "difficulty": "Medium",
-    "id": 2266,
-    "link": "https://leetcode.com/problems/count-number-of-texts/",
-    "title": "Count Number of Texts"
+    "link": "https://leetcode.com/problems/count-number-of-texts/"
   },
   "2267": {
+    "id": 2267,
     "category": "Dynamic Programming",
+    "title": " Check if There Is a Valid Parentheses String Path",
     "difficulty": "Hard",
-    "id": 2267,
-    "link": "https://leetcode.com/problems/check-if-there-is-a-valid-parentheses-string-path/",
-    "title": " Check if There Is a Valid Parentheses String Path"
+    "link": "https://leetcode.com/problems/check-if-there-is-a-valid-parentheses-string-path/"
   },
   "2268": {
+    "id": 2268,
     "category": "Greedy",
+    "title": "Minimum Number of Keypresses",
     "difficulty": "Medium",
-    "id": 2268,
-    "link": "https://leetcode.com/problems/minimum-number-of-keypresses/",
-    "title": "Minimum Number of Keypresses"
+    "link": "https://leetcode.com/problems/minimum-number-of-keypresses/"
   },
   "2269": {
+    "id": 2269,
     "category": "Sliding Window",
+    "title": "Find the K-Beauty of a Number",
     "difficulty": "Easy",
-    "id": 2269,
-    "link": "https://leetcode.com/problems/find-the-k-beauty-of-a-number/",
-    "title": "Find the K-Beauty of a Number"
+    "link": "https://leetcode.com/problems/find-the-k-beauty-of-a-number/"
   },
   "2270": {
+    "id": 2270,
     "category": "Array & Hashing",
+    "title": "Number of Ways to Split Array",
     "difficulty": "Medium",
-    "id": 2270,
-    "link": "https://leetcode.com/problems/number-of-ways-to-split-array/",
-    "title": "Number of Ways to Split Array"
+    "link": "https://leetcode.com/problems/number-of-ways-to-split-array/"
   },
   "2271": {
+    "id": 2271,
     "category": "Sliding Window",
+    "title": "Maximum White Tiles Covered by a Carpet",
     "difficulty": "Medium",
-    "id": 2271,
-    "link": "https://leetcode.com/problems/maximum-white-tiles-covered-by-a-carpet/",
-    "title": "Maximum White Tiles Covered by a Carpet"
+    "link": "https://leetcode.com/problems/maximum-white-tiles-covered-by-a-carpet/"
   },
   "2272": {
+    "id": 2272,
     "category": "Dynamic Programming",
+    "title": "Substring With Largest Variance",
     "difficulty": "Hard",
-    "id": 2272,
-    "link": "https://leetcode.com/problems/substring-with-largest-variance/",
-    "title": "Substring With Largest Variance"
+    "link": "https://leetcode.com/problems/substring-with-largest-variance/"
   },
   "2273": {
+    "id": 2273,
     "category": "Array & Hashing",
+    "title": "Find Resultant Array After Removing Anagrams",
     "difficulty": "Easy",
-    "id": 2273,
-    "link": "https://leetcode.com/problems/find-resultant-array-after-removing-anagrams/",
-    "title": "Find Resultant Array After Removing Anagrams"
+    "link": "https://leetcode.com/problems/find-resultant-array-after-removing-anagrams/"
   },
   "2274": {
+    "id": 2274,
     "category": "Array & Hashing",
+    "title": "Maximum Consecutive Floors Without Special Floors",
     "difficulty": "Medium",
-    "id": 2274,
-    "link": "https://leetcode.com/problems/maximum-consecutive-floors-without-special-floors/",
-    "title": "Maximum Consecutive Floors Without Special Floors"
+    "link": "https://leetcode.com/problems/maximum-consecutive-floors-without-special-floors/"
   },
   "2275": {
+    "id": 2275,
     "category": "Bit Manipulation",
+    "title": "Largest Combination With Bitwise AND Greater Than Zero",
     "difficulty": "Medium",
-    "id": 2275,
-    "link": "https://leetcode.com/problems/largest-combination-with-bitwise-and-greater-than-zero/",
-    "title": "Largest Combination With Bitwise AND Greater Than Zero"
+    "link": "https://leetcode.com/problems/largest-combination-with-bitwise-and-greater-than-zero/"
   },
   "2276": {
+    "id": 2276,
     "category": "Tree",
+    "title": "Count Integers in Intervals",
     "difficulty": "Hard",
-    "id": 2276,
-    "link": "https://leetcode.com/problems/count-integers-in-intervals/",
-    "title": "Count Integers in Intervals"
+    "link": "https://leetcode.com/problems/count-integers-in-intervals/"
   },
   "2277": {
+    "id": 2277,
     "category": "Tree",
+    "title": "Closest Node to Path in Tree",
     "difficulty": "Hard",
-    "id": 2277,
-    "link": "https://leetcode.com/problems/closest-node-to-path-in-tree/",
-    "title": "Closest Node to Path in Tree"
+    "link": "https://leetcode.com/problems/closest-node-to-path-in-tree/"
   },
   "2278": {
+    "id": 2278,
     "category": "Array & Hashing",
+    "title": "Percentage of Letter in String",
     "difficulty": "Easy",
-    "id": 2278,
-    "link": "https://leetcode.com/problems/percentage-of-letter-in-string/",
-    "title": "Percentage of Letter in String"
+    "link": "https://leetcode.com/problems/percentage-of-letter-in-string/"
   },
   "2279": {
+    "id": 2279,
     "category": "Greedy",
+    "title": "Maximum Bags With Full Capacity of Rocks",
     "difficulty": "Medium",
-    "id": 2279,
-    "link": "https://leetcode.com/problems/maximum-bags-with-full-capacity-of-rocks/",
-    "title": "Maximum Bags With Full Capacity of Rocks"
+    "link": "https://leetcode.com/problems/maximum-bags-with-full-capacity-of-rocks/"
   },
   "2280": {
+    "id": 2280,
     "category": "Math & Geometry",
+    "title": "Minimum Lines to Represent a Line Chart",
     "difficulty": "Medium",
-    "id": 2280,
-    "link": "https://leetcode.com/problems/minimum-lines-to-represent-a-line-chart/",
-    "title": "Minimum Lines to Represent a Line Chart"
+    "link": "https://leetcode.com/problems/minimum-lines-to-represent-a-line-chart/"
   },
   "2281": {
+    "id": 2281,
     "category": "Stack",
+    "title": "Sum of Total Strength of Wizards",
     "difficulty": "Hard",
-    "id": 2281,
-    "link": "https://leetcode.com/problems/sum-of-total-strength-of-wizards/",
-    "title": "Sum of Total Strength of Wizards"
+    "link": "https://leetcode.com/problems/sum-of-total-strength-of-wizards/"
   },
   "2282": {
+    "id": 2282,
     "category": "Stack",
+    "title": "Number of People That Can Be Seen in a Grid",
     "difficulty": "Medium",
-    "id": 2282,
-    "link": "https://leetcode.com/problems/number-of-people-that-can-be-seen-in-a-grid/",
-    "title": "Number of People That Can Be Seen in a Grid"
+    "link": "https://leetcode.com/problems/number-of-people-that-can-be-seen-in-a-grid/"
   },
   "2283": {
+    "id": 2283,
     "category": "Array & Hashing",
+    "title": "Check if Number Has Equal Digit Count and Digit Value",
     "difficulty": "Easy",
-    "id": 2283,
-    "link": "https://leetcode.com/problems/check-if-number-has-equal-digit-count-and-digit-value/",
-    "title": "Check if Number Has Equal Digit Count and Digit Value"
+    "link": "https://leetcode.com/problems/check-if-number-has-equal-digit-count-and-digit-value/"
   },
   "2284": {
+    "id": 2284,
     "category": "Array & Hashing",
+    "title": "Sender With Largest Word Count",
     "difficulty": "Medium",
-    "id": 2284,
-    "link": "https://leetcode.com/problems/sender-with-largest-word-count/",
-    "title": "Sender With Largest Word Count"
+    "link": "https://leetcode.com/problems/sender-with-largest-word-count/"
   },
   "2285": {
+    "id": 2285,
     "category": "Graph Traversal",
+    "title": "Maximum Total Importance of Roads",
     "difficulty": "Medium",
-    "id": 2285,
-    "link": "https://leetcode.com/problems/maximum-total-importance-of-roads/",
-    "title": "Maximum Total Importance of Roads"
+    "link": "https://leetcode.com/problems/maximum-total-importance-of-roads/"
   },
   "2286": {
+    "id": 2286,
     "category": "Tree",
+    "title": "Booking Concert Tickets in Groups",
     "difficulty": "Hard",
-    "id": 2286,
-    "link": "https://leetcode.com/problems/booking-concert-tickets-in-groups/",
-    "title": "Booking Concert Tickets in Groups"
+    "link": "https://leetcode.com/problems/booking-concert-tickets-in-groups/"
   },
   "2287": {
+    "id": 2287,
     "category": "Array & Hashing",
+    "title": "Rearrange Characters to Make Target String",
     "difficulty": "Easy",
-    "id": 2287,
-    "link": "https://leetcode.com/problems/rearrange-characters-to-make-target-string/",
-    "title": "Rearrange Characters to Make Target String"
+    "link": "https://leetcode.com/problems/rearrange-characters-to-make-target-string/"
   },
   "2288": {
+    "id": 2288,
     "category": "Array & Hashing",
+    "title": "Apply Discount to Prices",
     "difficulty": "Medium",
-    "id": 2288,
-    "link": "https://leetcode.com/problems/apply-discount-to-prices/",
-    "title": "Apply Discount to Prices"
+    "link": "https://leetcode.com/problems/apply-discount-to-prices/"
   },
   "2289": {
+    "id": 2289,
     "category": "Stack",
+    "title": "Steps to Make Array Non-decreasing",
     "difficulty": "Medium",
-    "id": 2289,
-    "link": "https://leetcode.com/problems/steps-to-make-array-non-decreasing/",
-    "title": "Steps to Make Array Non-decreasing"
+    "link": "https://leetcode.com/problems/steps-to-make-array-non-decreasing/"
   },
   "2290": {
+    "id": 2290,
     "category": "Graph Traversal",
+    "title": "Minimum Obstacle Removal to Reach Corner",
     "difficulty": "Hard",
-    "id": 2290,
-    "link": "https://leetcode.com/problems/minimum-obstacle-removal-to-reach-corner/",
-    "title": "Minimum Obstacle Removal to Reach Corner"
+    "link": "https://leetcode.com/problems/minimum-obstacle-removal-to-reach-corner/"
   },
   "2291": {
+    "id": 2291,
     "category": "Dynamic Programming",
+    "title": "Maximum Profit From Trading Stocks",
     "difficulty": "Medium",
-    "id": 2291,
-    "link": "https://leetcode.com/problems/maximum-profit-from-trading-stocks/",
-    "title": "Maximum Profit From Trading Stocks"
+    "link": "https://leetcode.com/problems/maximum-profit-from-trading-stocks/"
   },
   "2292": {
+    "id": 2292,
     "category": "Database",
+    "title": "Products With Three or More Orders in Two Consecutive Years",
     "difficulty": "Medium",
-    "id": 2292,
-    "link": "https://leetcode.com/problems/products-with-three-or-more-orders-in-two-consecutive-years/",
-    "title": "Products With Three or More Orders in Two Consecutive Years"
+    "link": "https://leetcode.com/problems/products-with-three-or-more-orders-in-two-consecutive-years/"
   },
   "2293": {
+    "id": 2293,
     "category": "Array & Hashing",
+    "title": "Min Max Game",
     "difficulty": "Easy",
-    "id": 2293,
-    "link": "https://leetcode.com/problems/min-max-game/",
-    "title": "Min Max Game"
+    "link": "https://leetcode.com/problems/min-max-game/"
   },
   "2294": {
+    "id": 2294,
     "category": "Greedy",
+    "title": "Partition Array Such That Maximum Difference Is K",
     "difficulty": "Medium",
-    "id": 2294,
-    "link": "https://leetcode.com/problems/partition-array-such-that-maximum-difference-is-k/",
-    "title": "Partition Array Such That Maximum Difference Is K"
+    "link": "https://leetcode.com/problems/partition-array-such-that-maximum-difference-is-k/"
   },
   "2295": {
+    "id": 2295,
     "category": "Array & Hashing",
+    "title": "Replace Elements in an Array",
     "difficulty": "Medium",
-    "id": 2295,
-    "link": "https://leetcode.com/problems/replace-elements-in-an-array/",
-    "title": "Replace Elements in an Array"
+    "link": "https://leetcode.com/problems/replace-elements-in-an-array/"
   },
   "2296": {
+    "id": 2296,
     "category": "Stack",
+    "title": "Design a Text Editor",
     "difficulty": "Hard",
-    "id": 2296,
-    "link": "https://leetcode.com/problems/design-a-text-editor/",
-    "title": "Design a Text Editor"
+    "link": "https://leetcode.com/problems/design-a-text-editor/"
   },
   "2297": {
+    "id": 2297,
     "category": "Graph Traversal",
+    "title": "Jump Game VIII",
     "difficulty": "Medium",
-    "id": 2297,
-    "link": "https://leetcode.com/problems/jump-game-viii/",
-    "title": "Jump Game VIII"
+    "link": "https://leetcode.com/problems/jump-game-viii/"
   },
   "2298": {
+    "id": 2298,
     "category": "Database",
+    "title": "Tasks Count in the Weekend",
     "difficulty": "Medium",
-    "id": 2298,
-    "link": "https://leetcode.com/problems/tasks-count-in-the-weekend/",
-    "title": "Tasks Count in the Weekend"
+    "link": "https://leetcode.com/problems/tasks-count-in-the-weekend/"
   },
   "2299": {
+    "id": 2299,
     "category": "Array & Hashing",
+    "title": "Strong Password Checker II",
     "difficulty": "Easy",
-    "id": 2299,
-    "link": "https://leetcode.com/problems/strong-password-checker-ii/",
-    "title": "Strong Password Checker II"
+    "link": "https://leetcode.com/problems/strong-password-checker-ii/"
   },
   "2300": {
+    "id": 2300,
     "category": "Binary Search",
+    "title": "Successful Pairs of Spells and Potions",
     "difficulty": "Medium",
-    "id": 2300,
-    "link": "https://leetcode.com/problems/successful-pairs-of-spells-and-potions/",
-    "title": "Successful Pairs of Spells and Potions"
+    "link": "https://leetcode.com/problems/successful-pairs-of-spells-and-potions/"
   },
   "2301": {
+    "id": 2301,
     "category": "Array & Hashing",
+    "title": "Match Substring After Replacement",
     "difficulty": "Hard",
-    "id": 2301,
-    "link": "https://leetcode.com/problems/match-substring-after-replacement/",
-    "title": "Match Substring After Replacement"
+    "link": "https://leetcode.com/problems/match-substring-after-replacement/"
   },
   "2302": {
+    "id": 2302,
     "category": "Sliding Window",
+    "title": "Count Subarrays With Score Less Than K",
     "difficulty": "Hard",
-    "id": 2302,
-    "link": "https://leetcode.com/problems/count-subarrays-with-score-less-than-k/",
-    "title": "Count Subarrays With Score Less Than K"
+    "link": "https://leetcode.com/problems/count-subarrays-with-score-less-than-k/"
   },
   "2303": {
+    "id": 2303,
     "category": "Array & Hashing",
+    "title": "Calculate Amount Paid in Taxes",
     "difficulty": "Easy",
-    "id": 2303,
-    "link": "https://leetcode.com/problems/calculate-amount-paid-in-taxes/",
-    "title": "Calculate Amount Paid in Taxes"
+    "link": "https://leetcode.com/problems/calculate-amount-paid-in-taxes/"
   },
   "2304": {
+    "id": 2304,
     "category": "Dynamic Programming",
+    "title": "Minimum Path Cost in a Grid",
     "difficulty": "Medium",
-    "id": 2304,
-    "link": "https://leetcode.com/problems/minimum-path-cost-in-a-grid/",
-    "title": "Minimum Path Cost in a Grid"
+    "link": "https://leetcode.com/problems/minimum-path-cost-in-a-grid/"
   },
   "2305": {
+    "id": 2305,
     "category": "Dynamic Programming",
+    "title": "Fair Distribution of Cookies",
     "difficulty": "Medium",
-    "id": 2305,
-    "link": "https://leetcode.com/problems/fair-distribution-of-cookies/",
-    "title": "Fair Distribution of Cookies"
+    "link": "https://leetcode.com/problems/fair-distribution-of-cookies/"
   },
   "2306": {
+    "id": 2306,
     "category": "Bit Manipulation",
+    "title": "Naming a Company",
     "difficulty": "Hard",
-    "id": 2306,
-    "link": "https://leetcode.com/problems/naming-a-company/",
-    "title": "Naming a Company"
+    "link": "https://leetcode.com/problems/naming-a-company/"
   },
   "2307": {
+    "id": 2307,
     "category": "Graph Traversal",
+    "title": "Check for Contradictions in Equations",
     "difficulty": "Hard",
-    "id": 2307,
-    "link": "https://leetcode.com/problems/check-for-contradictions-in-equations/",
-    "title": "Check for Contradictions in Equations"
+    "link": "https://leetcode.com/problems/check-for-contradictions-in-equations/"
   },
   "2308": {
+    "id": 2308,
     "category": "Database",
+    "title": "Arrange Table by Gender",
     "difficulty": "Medium",
-    "id": 2308,
-    "link": "https://leetcode.com/problems/arrange-table-by-gender/",
-    "title": "Arrange Table by Gender"
+    "link": "https://leetcode.com/problems/arrange-table-by-gender/"
   },
   "2309": {
+    "id": 2309,
     "category": "Array & Hashing",
+    "title": "Greatest English Letter in Upper and Lower Case",
     "difficulty": "Easy",
-    "id": 2309,
-    "link": "https://leetcode.com/problems/greatest-english-letter-in-upper-and-lower-case/",
-    "title": "Greatest English Letter in Upper and Lower Case"
+    "link": "https://leetcode.com/problems/greatest-english-letter-in-upper-and-lower-case/"
   },
   "2310": {
+    "id": 2310,
     "category": "Dynamic Programming",
+    "title": "Sum of Numbers With Units Digit K",
     "difficulty": "Medium",
-    "id": 2310,
-    "link": "https://leetcode.com/problems/sum-of-numbers-with-units-digit-k/",
-    "title": "Sum of Numbers With Units Digit K"
+    "link": "https://leetcode.com/problems/sum-of-numbers-with-units-digit-k/"
   },
   "2311": {
+    "id": 2311,
     "category": "Dynamic Programming",
+    "title": "Longest Binary Subsequence Less Than or Equal to K",
     "difficulty": "Medium",
-    "id": 2311,
-    "link": "https://leetcode.com/problems/longest-binary-subsequence-less-than-or-equal-to-k/",
-    "title": "Longest Binary Subsequence Less Than or Equal to K"
+    "link": "https://leetcode.com/problems/longest-binary-subsequence-less-than-or-equal-to-k/"
   },
   "2312": {
+    "id": 2312,
     "category": "Dynamic Programming",
+    "title": "Selling Pieces of Wood",
     "difficulty": "Hard",
-    "id": 2312,
-    "link": "https://leetcode.com/problems/selling-pieces-of-wood/",
-    "title": "Selling Pieces of Wood"
+    "link": "https://leetcode.com/problems/selling-pieces-of-wood/"
   },
   "2313": {
+    "id": 2313,
     "category": "Tree",
+    "title": "Minimum Flips in Binary Tree to Get Result",
     "difficulty": "Hard",
-    "id": 2313,
-    "link": "https://leetcode.com/problems/minimum-flips-in-binary-tree-to-get-result/",
-    "title": "Minimum Flips in Binary Tree to Get Result"
+    "link": "https://leetcode.com/problems/minimum-flips-in-binary-tree-to-get-result/"
   },
   "2314": {
+    "id": 2314,
     "category": "Database",
+    "title": "The First Day of the Maximum Recorded Degree in Each City",
     "difficulty": "Medium",
-    "id": 2314,
-    "link": "https://leetcode.com/problems/the-first-day-of-the-maximum-recorded-degree-in-each-city/",
-    "title": "The First Day of the Maximum Recorded Degree in Each City"
+    "link": "https://leetcode.com/problems/the-first-day-of-the-maximum-recorded-degree-in-each-city/"
   },
   "2315": {
+    "id": 2315,
     "category": "Array & Hashing",
+    "title": "Count Asterisks",
     "difficulty": "Easy",
-    "id": 2315,
-    "link": "https://leetcode.com/problems/count-asterisks/",
-    "title": "Count Asterisks"
+    "link": "https://leetcode.com/problems/count-asterisks/"
   },
   "2316": {
+    "id": 2316,
     "category": "Graph Traversal",
+    "title": "Count Unreachable Pairs of Nodes in an Undirected Graph",
     "difficulty": "Medium",
-    "id": 2316,
-    "link": "https://leetcode.com/problems/count-unreachable-pairs-of-nodes-in-an-undirected-graph/",
-    "title": "Count Unreachable Pairs of Nodes in an Undirected Graph"
+    "link": "https://leetcode.com/problems/count-unreachable-pairs-of-nodes-in-an-undirected-graph/"
   },
   "2317": {
+    "id": 2317,
     "category": "Bit Manipulation",
+    "title": "Maximum XOR After Operations ",
     "difficulty": "Medium",
-    "id": 2317,
-    "link": "https://leetcode.com/problems/maximum-xor-after-operations/",
-    "title": "Maximum XOR After Operations "
+    "link": "https://leetcode.com/problems/maximum-xor-after-operations/"
   },
   "2318": {
+    "id": 2318,
     "category": "Dynamic Programming",
+    "title": "Number of Distinct Roll Sequences",
     "difficulty": "Hard",
-    "id": 2318,
-    "link": "https://leetcode.com/problems/number-of-distinct-roll-sequences/",
-    "title": "Number of Distinct Roll Sequences"
+    "link": "https://leetcode.com/problems/number-of-distinct-roll-sequences/"
   },
   "2319": {
+    "id": 2319,
     "category": "Array & Hashing",
+    "title": "Check if Matrix Is X-Matrix",
     "difficulty": "Easy",
-    "id": 2319,
-    "link": "https://leetcode.com/problems/check-if-matrix-is-x-matrix/",
-    "title": "Check if Matrix Is X-Matrix"
+    "link": "https://leetcode.com/problems/check-if-matrix-is-x-matrix/"
   },
   "2320": {
+    "id": 2320,
     "category": "Dynamic Programming",
+    "title": "Count Number of Ways to Place Houses",
     "difficulty": "Medium",
-    "id": 2320,
-    "link": "https://leetcode.com/problems/count-number-of-ways-to-place-houses/",
-    "title": "Count Number of Ways to Place Houses"
+    "link": "https://leetcode.com/problems/count-number-of-ways-to-place-houses/"
   },
   "2321": {
+    "id": 2321,
     "category": "Dynamic Programming",
+    "title": "Maximum Score Of Spliced Array",
     "difficulty": "Hard",
-    "id": 2321,
-    "link": "https://leetcode.com/problems/maximum-score-of-spliced-array/",
-    "title": "Maximum Score Of Spliced Array"
+    "link": "https://leetcode.com/problems/maximum-score-of-spliced-array/"
   },
   "2322": {
+    "id": 2322,
     "category": "Tree",
+    "title": "Minimum Score After Removals on a Tree",
     "difficulty": "Hard",
-    "id": 2322,
-    "link": "https://leetcode.com/problems/minimum-score-after-removals-on-a-tree/",
-    "title": "Minimum Score After Removals on a Tree"
+    "link": "https://leetcode.com/problems/minimum-score-after-removals-on-a-tree/"
   },
   "2323": {
+    "id": 2323,
     "category": "Greedy",
+    "title": "Find Minimum Time to Finish All Jobs II",
     "difficulty": "Medium",
-    "id": 2323,
-    "link": "https://leetcode.com/problems/find-minimum-time-to-finish-all-jobs-ii/",
-    "title": "Find Minimum Time to Finish All Jobs II"
+    "link": "https://leetcode.com/problems/find-minimum-time-to-finish-all-jobs-ii/"
   },
   "2324": {
+    "id": 2324,
     "category": "Database",
+    "title": "Product Sales Analysis IV",
     "difficulty": "Medium",
-    "id": 2324,
-    "link": "https://leetcode.com/problems/product-sales-analysis-iv/",
-    "title": "Product Sales Analysis IV"
+    "link": "https://leetcode.com/problems/product-sales-analysis-iv/"
   },
   "2325": {
+    "id": 2325,
     "category": "Array & Hashing",
+    "title": "Decode the Message",
     "difficulty": "Easy",
-    "id": 2325,
-    "link": "https://leetcode.com/problems/decode-the-message/",
-    "title": "Decode the Message"
+    "link": "https://leetcode.com/problems/decode-the-message/"
   },
   "2326": {
+    "id": 2326,
     "category": "Linked List",
+    "title": "Spiral Matrix IV",
     "difficulty": "Medium",
-    "id": 2326,
-    "link": "https://leetcode.com/problems/spiral-matrix-iv/",
-    "title": "Spiral Matrix IV"
+    "link": "https://leetcode.com/problems/spiral-matrix-iv/"
   },
   "2327": {
+    "id": 2327,
     "category": "Dynamic Programming",
+    "title": "Number of People Aware of a Secret",
     "difficulty": "Medium",
-    "id": 2327,
-    "link": "https://leetcode.com/problems/number-of-people-aware-of-a-secret/",
-    "title": "Number of People Aware of a Secret"
+    "link": "https://leetcode.com/problems/number-of-people-aware-of-a-secret/"
   },
   "2328": {
+    "id": 2328,
     "category": "Graph Traversal",
+    "title": "Number of Increasing Paths in a Grid",
     "difficulty": "Hard",
-    "id": 2328,
-    "link": "https://leetcode.com/problems/number-of-increasing-paths-in-a-grid/",
-    "title": "Number of Increasing Paths in a Grid"
+    "link": "https://leetcode.com/problems/number-of-increasing-paths-in-a-grid/"
   },
   "2329": {
+    "id": 2329,
     "category": "Database",
+    "title": "Product Sales Analysis V",
     "difficulty": "Easy",
-    "id": 2329,
-    "link": "https://leetcode.com/problems/product-sales-analysis-v/",
-    "title": "Product Sales Analysis V"
+    "link": "https://leetcode.com/problems/product-sales-analysis-v/"
   },
   "2330": {
+    "id": 2330,
     "category": "Two Pointers",
+    "title": "Valid Palindrome IV",
     "difficulty": "Medium",
-    "id": 2330,
-    "link": "https://leetcode.com/problems/valid-palindrome-iv/",
-    "title": "Valid Palindrome IV"
+    "link": "https://leetcode.com/problems/valid-palindrome-iv/"
   },
   "2331": {
+    "id": 2331,
     "category": "Tree",
+    "title": "Evaluate Boolean Binary Tree",
     "difficulty": "Easy",
-    "id": 2331,
-    "link": "https://leetcode.com/problems/evaluate-boolean-binary-tree/",
-    "title": "Evaluate Boolean Binary Tree"
+    "link": "https://leetcode.com/problems/evaluate-boolean-binary-tree/"
   },
   "2332": {
+    "id": 2332,
     "category": "Binary Search",
+    "title": "The Latest Time to Catch a Bus",
     "difficulty": "Medium",
-    "id": 2332,
-    "link": "https://leetcode.com/problems/the-latest-time-to-catch-a-bus/",
-    "title": "The Latest Time to Catch a Bus"
+    "link": "https://leetcode.com/problems/the-latest-time-to-catch-a-bus/"
   },
   "2333": {
+    "id": 2333,
     "category": "Binary Search",
+    "title": "Minimum Sum of Squared Difference",
     "difficulty": "Medium",
-    "id": 2333,
-    "link": "https://leetcode.com/problems/minimum-sum-of-squared-difference/",
-    "title": "Minimum Sum of Squared Difference"
+    "link": "https://leetcode.com/problems/minimum-sum-of-squared-difference/"
   },
   "2334": {
+    "id": 2334,
     "category": "Graph Traversal",
+    "title": "Subarray With Elements Greater Than Varying Threshold",
     "difficulty": "Hard",
-    "id": 2334,
-    "link": "https://leetcode.com/problems/subarray-with-elements-greater-than-varying-threshold/",
-    "title": "Subarray With Elements Greater Than Varying Threshold"
+    "link": "https://leetcode.com/problems/subarray-with-elements-greater-than-varying-threshold/"
   },
   "2335": {
+    "id": 2335,
     "category": "Heap (Priority Queue)",
+    "title": "Minimum Amount of Time to Fill Cups",
     "difficulty": "Easy",
-    "id": 2335,
-    "link": "https://leetcode.com/problems/minimum-amount-of-time-to-fill-cups/",
-    "title": "Minimum Amount of Time to Fill Cups"
+    "link": "https://leetcode.com/problems/minimum-amount-of-time-to-fill-cups/"
   },
   "2336": {
+    "id": 2336,
     "category": "Heap (Priority Queue)",
+    "title": "Smallest Number in Infinite Set",
     "difficulty": "Medium",
-    "id": 2336,
-    "link": "https://leetcode.com/problems/smallest-number-in-infinite-set/",
-    "title": "Smallest Number in Infinite Set"
+    "link": "https://leetcode.com/problems/smallest-number-in-infinite-set/"
   },
   "2337": {
+    "id": 2337,
     "category": "Two Pointers",
+    "title": "Move Pieces to Obtain a String",
     "difficulty": "Medium",
-    "id": 2337,
-    "link": "https://leetcode.com/problems/move-pieces-to-obtain-a-string/",
-    "title": "Move Pieces to Obtain a String"
+    "link": "https://leetcode.com/problems/move-pieces-to-obtain-a-string/"
   },
   "2338": {
+    "id": 2338,
     "category": "Dynamic Programming",
+    "title": "Count the Number of Ideal Arrays",
     "difficulty": "Hard",
-    "id": 2338,
-    "link": "https://leetcode.com/problems/count-the-number-of-ideal-arrays/",
-    "title": "Count the Number of Ideal Arrays"
+    "link": "https://leetcode.com/problems/count-the-number-of-ideal-arrays/"
   },
   "2339": {
+    "id": 2339,
     "category": "Database",
+    "title": "All the Matches of the League",
     "difficulty": "Easy",
-    "id": 2339,
-    "link": "https://leetcode.com/problems/all-the-matches-of-the-league/",
-    "title": "All the Matches of the League"
+    "link": "https://leetcode.com/problems/all-the-matches-of-the-league/"
   },
   "2340": {
+    "id": 2340,
     "category": "Greedy",
+    "title": "Minimum Adjacent Swaps to Make a Valid Array",
     "difficulty": "Medium",
-    "id": 2340,
-    "link": "https://leetcode.com/problems/minimum-adjacent-swaps-to-make-a-valid-array/",
-    "title": "Minimum Adjacent Swaps to Make a Valid Array"
+    "link": "https://leetcode.com/problems/minimum-adjacent-swaps-to-make-a-valid-array/"
   },
   "2341": {
+    "id": 2341,
     "category": "Array & Hashing",
+    "title": "Maximum Number of Pairs in Array",
     "difficulty": "Easy",
-    "id": 2341,
-    "link": "https://leetcode.com/problems/maximum-number-of-pairs-in-array/",
-    "title": "Maximum Number of Pairs in Array"
+    "link": "https://leetcode.com/problems/maximum-number-of-pairs-in-array/"
   },
   "2342": {
+    "id": 2342,
     "category": "Heap (Priority Queue)",
+    "title": "Max Sum of a Pair With Equal Sum of Digits",
     "difficulty": "Medium",
-    "id": 2342,
-    "link": "https://leetcode.com/problems/max-sum-of-a-pair-with-equal-sum-of-digits/",
-    "title": "Max Sum of a Pair With Equal Sum of Digits"
+    "link": "https://leetcode.com/problems/max-sum-of-a-pair-with-equal-sum-of-digits/"
   },
   "2343": {
+    "id": 2343,
     "category": "Heap (Priority Queue)",
+    "title": "Query Kth Smallest Trimmed Number",
     "difficulty": "Medium",
-    "id": 2343,
-    "link": "https://leetcode.com/problems/query-kth-smallest-trimmed-number/",
-    "title": "Query Kth Smallest Trimmed Number"
+    "link": "https://leetcode.com/problems/query-kth-smallest-trimmed-number/"
   },
   "2344": {
+    "id": 2344,
     "category": "Heap (Priority Queue)",
+    "title": "Minimum Deletions to Make Array Divisible",
     "difficulty": "Hard",
-    "id": 2344,
-    "link": "https://leetcode.com/problems/minimum-deletions-to-make-array-divisible/",
-    "title": "Minimum Deletions to Make Array Divisible"
+    "link": "https://leetcode.com/problems/minimum-deletions-to-make-array-divisible/"
   },
   "2345": {
+    "id": 2345,
     "category": "Stack",
+    "title": "Finding the Number of Visible Mountains",
     "difficulty": "Medium",
-    "id": 2345,
-    "link": "https://leetcode.com/problems/finding-the-number-of-visible-mountains/",
-    "title": "Finding the Number of Visible Mountains"
+    "link": "https://leetcode.com/problems/finding-the-number-of-visible-mountains/"
   },
   "2346": {
+    "id": 2346,
     "category": "Database",
+    "title": "Compute the Rank as a Percentage",
     "difficulty": "Medium",
-    "id": 2346,
-    "link": "https://leetcode.com/problems/compute-the-rank-as-a-percentage/",
-    "title": "Compute the Rank as a Percentage"
+    "link": "https://leetcode.com/problems/compute-the-rank-as-a-percentage/"
   },
   "2347": {
+    "id": 2347,
     "category": "Array & Hashing",
+    "title": "Best Poker Hand",
     "difficulty": "Easy",
-    "id": 2347,
-    "link": "https://leetcode.com/problems/best-poker-hand/",
-    "title": "Best Poker Hand"
+    "link": "https://leetcode.com/problems/best-poker-hand/"
   },
   "2348": {
+    "id": 2348,
     "category": "Math & Geometry",
+    "title": "Number of Zero-Filled Subarrays",
     "difficulty": "Medium",
-    "id": 2348,
-    "link": "https://leetcode.com/problems/number-of-zero-filled-subarrays/",
-    "title": "Number of Zero-Filled Subarrays"
+    "link": "https://leetcode.com/problems/number-of-zero-filled-subarrays/"
   },
   "2349": {
+    "id": 2349,
     "category": "Heap (Priority Queue)",
+    "title": "Design a Number Container System",
     "difficulty": "Medium",
-    "id": 2349,
-    "link": "https://leetcode.com/problems/design-a-number-container-system/",
-    "title": "Design a Number Container System"
+    "link": "https://leetcode.com/problems/design-a-number-container-system/"
   },
   "2350": {
+    "id": 2350,
     "category": "Greedy",
+    "title": "Shortest Impossible Sequence of Rolls",
     "difficulty": "Hard",
-    "id": 2350,
-    "link": "https://leetcode.com/problems/shortest-impossible-sequence-of-rolls/",
-    "title": "Shortest Impossible Sequence of Rolls"
+    "link": "https://leetcode.com/problems/shortest-impossible-sequence-of-rolls/"
   },
   "2351": {
+    "id": 2351,
     "category": "Bit Manipulation",
+    "title": "First Letter to Appear Twice",
     "difficulty": "Easy",
-    "id": 2351,
-    "link": "https://leetcode.com/problems/first-letter-to-appear-twice/",
-    "title": "First Letter to Appear Twice"
+    "link": "https://leetcode.com/problems/first-letter-to-appear-twice/"
   },
   "2352": {
+    "id": 2352,
     "category": "Array & Hashing",
+    "title": "Equal Row and Column Pairs",
     "difficulty": "Medium",
-    "id": 2352,
-    "link": "https://leetcode.com/problems/equal-row-and-column-pairs/",
-    "title": "Equal Row and Column Pairs"
+    "link": "https://leetcode.com/problems/equal-row-and-column-pairs/"
   },
   "2353": {
+    "id": 2353,
     "category": "Heap (Priority Queue)",
+    "title": "Design a Food Rating System",
     "difficulty": "Medium",
-    "id": 2353,
-    "link": "https://leetcode.com/problems/design-a-food-rating-system/",
-    "title": "Design a Food Rating System"
+    "link": "https://leetcode.com/problems/design-a-food-rating-system/"
   },
   "2354": {
+    "id": 2354,
     "category": "Binary Search",
+    "title": "Number of Excellent Pairs",
     "difficulty": "Hard",
-    "id": 2354,
-    "link": "https://leetcode.com/problems/number-of-excellent-pairs/",
-    "title": "Number of Excellent Pairs"
+    "link": "https://leetcode.com/problems/number-of-excellent-pairs/"
   },
   "2355": {
+    "id": 2355,
     "category": "Dynamic Programming",
+    "title": "Maximum Number of Books You Can Take",
     "difficulty": "Hard",
-    "id": 2355,
-    "link": "https://leetcode.com/problems/maximum-number-of-books-you-can-take/",
-    "title": "Maximum Number of Books You Can Take"
+    "link": "https://leetcode.com/problems/maximum-number-of-books-you-can-take/"
   },
   "2356": {
+    "id": 2356,
     "category": "Database",
+    "title": "Number of Unique Subjects Taught by Each Teacher",
     "difficulty": "Easy",
-    "id": 2356,
-    "link": "https://leetcode.com/problems/number-of-unique-subjects-taught-by-each-teacher/",
-    "title": "Number of Unique Subjects Taught by Each Teacher"
+    "link": "https://leetcode.com/problems/number-of-unique-subjects-taught-by-each-teacher/"
   },
   "2357": {
+    "id": 2357,
     "category": "Heap (Priority Queue)",
+    "title": "Make Array Zero by Subtracting Equal Amounts",
     "difficulty": "Easy",
-    "id": 2357,
-    "link": "https://leetcode.com/problems/make-array-zero-by-subtracting-equal-amounts/",
-    "title": "Make Array Zero by Subtracting Equal Amounts"
+    "link": "https://leetcode.com/problems/make-array-zero-by-subtracting-equal-amounts/"
   },
   "2358": {
+    "id": 2358,
     "category": "Binary Search",
+    "title": "Maximum Number of Groups Entering a Competition",
     "difficulty": "Medium",
-    "id": 2358,
-    "link": "https://leetcode.com/problems/maximum-number-of-groups-entering-a-competition/",
-    "title": "Maximum Number of Groups Entering a Competition"
+    "link": "https://leetcode.com/problems/maximum-number-of-groups-entering-a-competition/"
   },
   "2359": {
+    "id": 2359,
     "category": "Graph Traversal",
+    "title": "Find Closest Node to Given Two Nodes",
     "difficulty": "Medium",
-    "id": 2359,
-    "link": "https://leetcode.com/problems/find-closest-node-to-given-two-nodes/",
-    "title": "Find Closest Node to Given Two Nodes"
+    "link": "https://leetcode.com/problems/find-closest-node-to-given-two-nodes/"
   },
   "2360": {
+    "id": 2360,
     "category": "Graph Traversal",
+    "title": "Longest Cycle in a Graph",
     "difficulty": "Hard",
-    "id": 2360,
-    "link": "https://leetcode.com/problems/longest-cycle-in-a-graph/",
-    "title": "Longest Cycle in a Graph"
+    "link": "https://leetcode.com/problems/longest-cycle-in-a-graph/"
   },
   "2361": {
+    "id": 2361,
     "category": "Dynamic Programming",
+    "title": "Minimum Costs Using the Train Line",
     "difficulty": "Hard",
-    "id": 2361,
-    "link": "https://leetcode.com/problems/minimum-costs-using-the-train-line/",
-    "title": "Minimum Costs Using the Train Line"
+    "link": "https://leetcode.com/problems/minimum-costs-using-the-train-line/"
   },
   "2362": {
+    "id": 2362,
     "category": "Database",
+    "title": "Generate the Invoice",
     "difficulty": "Hard",
-    "id": 2362,
-    "link": "https://leetcode.com/problems/generate-the-invoice/",
-    "title": "Generate the Invoice"
+    "link": "https://leetcode.com/problems/generate-the-invoice/"
   },
   "2363": {
+    "id": 2363,
     "category": "Array & Hashing",
+    "title": "Merge Similar Items",
     "difficulty": "Easy",
-    "id": 2363,
-    "link": "https://leetcode.com/problems/merge-similar-items/",
-    "title": "Merge Similar Items"
+    "link": "https://leetcode.com/problems/merge-similar-items/"
   },
   "2364": {
+    "id": 2364,
     "category": "Math & Geometry",
+    "title": "Count Number of Bad Pairs",
     "difficulty": "Medium",
-    "id": 2364,
-    "link": "https://leetcode.com/problems/count-number-of-bad-pairs/",
-    "title": "Count Number of Bad Pairs"
+    "link": "https://leetcode.com/problems/count-number-of-bad-pairs/"
   },
   "2365": {
+    "id": 2365,
     "category": "Array & Hashing",
+    "title": "Task Scheduler II",
     "difficulty": "Medium",
-    "id": 2365,
-    "link": "https://leetcode.com/problems/task-scheduler-ii/",
-    "title": "Task Scheduler II"
+    "link": "https://leetcode.com/problems/task-scheduler-ii/"
   },
   "2366": {
+    "id": 2366,
     "category": "Greedy",
+    "title": "Minimum Replacements to Sort the Array",
     "difficulty": "Hard",
-    "id": 2366,
-    "link": "https://leetcode.com/problems/minimum-replacements-to-sort-the-array/",
-    "title": "Minimum Replacements to Sort the Array"
+    "link": "https://leetcode.com/problems/minimum-replacements-to-sort-the-array/"
   },
   "2367": {
+    "id": 2367,
     "category": "Two Pointers",
+    "title": "Number of Arithmetic Triplets",
     "difficulty": "Easy",
-    "id": 2367,
-    "link": "https://leetcode.com/problems/number-of-arithmetic-triplets/",
-    "title": "Number of Arithmetic Triplets"
+    "link": "https://leetcode.com/problems/number-of-arithmetic-triplets/"
   },
   "2368": {
+    "id": 2368,
     "category": "Tree",
+    "title": "Reachable Nodes With Restrictions",
     "difficulty": "Medium",
-    "id": 2368,
-    "link": "https://leetcode.com/problems/reachable-nodes-with-restrictions/",
-    "title": "Reachable Nodes With Restrictions"
+    "link": "https://leetcode.com/problems/reachable-nodes-with-restrictions/"
   },
   "2369": {
+    "id": 2369,
     "category": "Dynamic Programming",
+    "title": "Check if There is a Valid Partition For The Array",
     "difficulty": "Medium",
-    "id": 2369,
-    "link": "https://leetcode.com/problems/check-if-there-is-a-valid-partition-for-the-array/",
-    "title": "Check if There is a Valid Partition For The Array"
+    "link": "https://leetcode.com/problems/check-if-there-is-a-valid-partition-for-the-array/"
   },
   "2370": {
+    "id": 2370,
     "category": "Dynamic Programming",
+    "title": "Longest Ideal Subsequence",
     "difficulty": "Medium",
-    "id": 2370,
-    "link": "https://leetcode.com/problems/longest-ideal-subsequence/",
-    "title": "Longest Ideal Subsequence"
+    "link": "https://leetcode.com/problems/longest-ideal-subsequence/"
   },
   "2371": {
+    "id": 2371,
     "category": "Graph Traversal",
+    "title": "Minimize Maximum Value in a Grid",
     "difficulty": "Hard",
-    "id": 2371,
-    "link": "https://leetcode.com/problems/minimize-maximum-value-in-a-grid/",
-    "title": "Minimize Maximum Value in a Grid"
+    "link": "https://leetcode.com/problems/minimize-maximum-value-in-a-grid/"
   },
   "2372": {
+    "id": 2372,
     "category": "Database",
+    "title": "Calculate the Influence of Each Salesperson",
     "difficulty": "Medium",
-    "id": 2372,
-    "link": "https://leetcode.com/problems/calculate-the-influence-of-each-salesperson/",
-    "title": "Calculate the Influence of Each Salesperson"
+    "link": "https://leetcode.com/problems/calculate-the-influence-of-each-salesperson/"
   },
   "2373": {
+    "id": 2373,
     "category": "Array & Hashing",
+    "title": "Largest Local Values in a Matrix",
     "difficulty": "Easy",
-    "id": 2373,
-    "link": "https://leetcode.com/problems/largest-local-values-in-a-matrix/",
-    "title": "Largest Local Values in a Matrix"
+    "link": "https://leetcode.com/problems/largest-local-values-in-a-matrix/"
   },
   "2374": {
+    "id": 2374,
     "category": "Graph Traversal",
+    "title": "Node With Highest Edge Score",
     "difficulty": "Medium",
-    "id": 2374,
-    "link": "https://leetcode.com/problems/node-with-highest-edge-score/",
-    "title": "Node With Highest Edge Score"
+    "link": "https://leetcode.com/problems/node-with-highest-edge-score/"
   },
   "2375": {
+    "id": 2375,
     "category": "Backtracking",
+    "title": "Construct Smallest Number From DI String",
     "difficulty": "Medium",
-    "id": 2375,
-    "link": "https://leetcode.com/problems/construct-smallest-number-from-di-string/",
-    "title": "Construct Smallest Number From DI String"
+    "link": "https://leetcode.com/problems/construct-smallest-number-from-di-string/"
   },
   "2376": {
+    "id": 2376,
     "category": "Dynamic Programming",
+    "title": "Count Special Integers",
     "difficulty": "Hard",
-    "id": 2376,
-    "link": "https://leetcode.com/problems/count-special-integers/",
-    "title": "Count Special Integers"
+    "link": "https://leetcode.com/problems/count-special-integers/"
   },
   "2377": {
+    "id": 2377,
     "category": "Database",
+    "title": "Sort the Olympic Table",
     "difficulty": "Easy",
-    "id": 2377,
-    "link": "https://leetcode.com/problems/sort-the-olympic-table/",
-    "title": "Sort the Olympic Table"
+    "link": "https://leetcode.com/problems/sort-the-olympic-table/"
   },
   "2378": {
+    "id": 2378,
     "category": "Tree",
+    "title": "Choose Edges to Maximize Score in a Tree",
     "difficulty": "Medium",
-    "id": 2378,
-    "link": "https://leetcode.com/problems/choose-edges-to-maximize-score-in-a-tree/",
-    "title": "Choose Edges to Maximize Score in a Tree"
+    "link": "https://leetcode.com/problems/choose-edges-to-maximize-score-in-a-tree/"
   },
   "2379": {
+    "id": 2379,
     "category": "Sliding Window",
+    "title": "Minimum Recolors to Get K Consecutive Black Blocks",
     "difficulty": "Easy",
-    "id": 2379,
-    "link": "https://leetcode.com/problems/minimum-recolors-to-get-k-consecutive-black-blocks/",
-    "title": "Minimum Recolors to Get K Consecutive Black Blocks"
+    "link": "https://leetcode.com/problems/minimum-recolors-to-get-k-consecutive-black-blocks/"
   },
   "2380": {
+    "id": 2380,
     "category": "Dynamic Programming",
+    "title": "Time Needed to Rearrange a Binary String",
     "difficulty": "Medium",
-    "id": 2380,
-    "link": "https://leetcode.com/problems/time-needed-to-rearrange-a-binary-string/",
-    "title": "Time Needed to Rearrange a Binary String"
+    "link": "https://leetcode.com/problems/time-needed-to-rearrange-a-binary-string/"
   },
   "2381": {
+    "id": 2381,
     "category": "Array & Hashing",
+    "title": "Shifting Letters II",
     "difficulty": "Medium",
-    "id": 2381,
-    "link": "https://leetcode.com/problems/shifting-letters-ii/",
-    "title": "Shifting Letters II"
+    "link": "https://leetcode.com/problems/shifting-letters-ii/"
   },
   "2382": {
+    "id": 2382,
     "category": "Graph Traversal",
+    "title": "Maximum Segment Sum After Removals",
     "difficulty": "Hard",
-    "id": 2382,
-    "link": "https://leetcode.com/problems/maximum-segment-sum-after-removals/",
-    "title": "Maximum Segment Sum After Removals"
+    "link": "https://leetcode.com/problems/maximum-segment-sum-after-removals/"
   },
   "2383": {
+    "id": 2383,
     "category": "Greedy",
+    "title": "Minimum Hours of Training to Win a Competition",
     "difficulty": "Easy",
-    "id": 2383,
-    "link": "https://leetcode.com/problems/minimum-hours-of-training-to-win-a-competition/",
-    "title": "Minimum Hours of Training to Win a Competition"
+    "link": "https://leetcode.com/problems/minimum-hours-of-training-to-win-a-competition/"
   },
   "2384": {
+    "id": 2384,
     "category": "Greedy",
+    "title": "Largest Palindromic Number",
     "difficulty": "Medium",
-    "id": 2384,
-    "link": "https://leetcode.com/problems/largest-palindromic-number/",
-    "title": "Largest Palindromic Number"
+    "link": "https://leetcode.com/problems/largest-palindromic-number/"
   },
   "2385": {
+    "id": 2385,
     "category": "Tree",
+    "title": "Amount of Time for Binary Tree to Be Infected",
     "difficulty": "Medium",
-    "id": 2385,
-    "link": "https://leetcode.com/problems/amount-of-time-for-binary-tree-to-be-infected/",
-    "title": "Amount of Time for Binary Tree to Be Infected"
+    "link": "https://leetcode.com/problems/amount-of-time-for-binary-tree-to-be-infected/"
   },
   "2386": {
+    "id": 2386,
     "category": "Heap (Priority Queue)",
+    "title": "Find the K-Sum of an Array",
     "difficulty": "Hard",
-    "id": 2386,
-    "link": "https://leetcode.com/problems/find-the-k-sum-of-an-array/",
-    "title": "Find the K-Sum of an Array"
+    "link": "https://leetcode.com/problems/find-the-k-sum-of-an-array/"
   },
   "2387": {
+    "id": 2387,
     "category": "Binary Search",
+    "title": "Median of a Row Wise Sorted Matrix",
     "difficulty": "Medium",
-    "id": 2387,
-    "link": "https://leetcode.com/problems/median-of-a-row-wise-sorted-matrix/",
-    "title": "Median of a Row Wise Sorted Matrix"
+    "link": "https://leetcode.com/problems/median-of-a-row-wise-sorted-matrix/"
   },
   "2388": {
+    "id": 2388,
     "category": "Database",
+    "title": "Change Null Values in a Table to the Previous Value",
     "difficulty": "Medium",
-    "id": 2388,
-    "link": "https://leetcode.com/problems/change-null-values-in-a-table-to-the-previous-value/",
-    "title": "Change Null Values in a Table to the Previous Value"
+    "link": "https://leetcode.com/problems/change-null-values-in-a-table-to-the-previous-value/"
   },
   "2389": {
+    "id": 2389,
     "category": "Binary Search",
+    "title": "Longest Subsequence With Limited Sum",
     "difficulty": "Easy",
-    "id": 2389,
-    "link": "https://leetcode.com/problems/longest-subsequence-with-limited-sum/",
-    "title": "Longest Subsequence With Limited Sum"
+    "link": "https://leetcode.com/problems/longest-subsequence-with-limited-sum/"
   },
   "2390": {
+    "id": 2390,
     "category": "Stack",
+    "title": "Removing Stars From a String",
     "difficulty": "Medium",
-    "id": 2390,
-    "link": "https://leetcode.com/problems/removing-stars-from-a-string/",
-    "title": "Removing Stars From a String"
+    "link": "https://leetcode.com/problems/removing-stars-from-a-string/"
   },
   "2391": {
+    "id": 2391,
     "category": "Array & Hashing",
+    "title": "Minimum Amount of Time to Collect Garbage",
     "difficulty": "Medium",
-    "id": 2391,
-    "link": "https://leetcode.com/problems/minimum-amount-of-time-to-collect-garbage/",
-    "title": "Minimum Amount of Time to Collect Garbage"
+    "link": "https://leetcode.com/problems/minimum-amount-of-time-to-collect-garbage/"
   },
   "2392": {
+    "id": 2392,
     "category": "Graph Traversal",
+    "title": "Build a Matrix With Conditions",
     "difficulty": "Hard",
-    "id": 2392,
-    "link": "https://leetcode.com/problems/build-a-matrix-with-conditions/",
-    "title": "Build a Matrix With Conditions"
+    "link": "https://leetcode.com/problems/build-a-matrix-with-conditions/"
   },
   "2393": {
+    "id": 2393,
     "category": "Dynamic Programming",
+    "title": "Count Strictly Increasing Subarrays",
     "difficulty": "Medium",
-    "id": 2393,
-    "link": "https://leetcode.com/problems/count-strictly-increasing-subarrays/",
-    "title": "Count Strictly Increasing Subarrays"
+    "link": "https://leetcode.com/problems/count-strictly-increasing-subarrays/"
   },
   "2394": {
+    "id": 2394,
     "category": "Database",
+    "title": "Employees With Deductions",
     "difficulty": "Medium",
-    "id": 2394,
-    "link": "https://leetcode.com/problems/employees-with-deductions/",
-    "title": "Employees With Deductions"
+    "link": "https://leetcode.com/problems/employees-with-deductions/"
   },
   "2395": {
+    "id": 2395,
     "category": "Array & Hashing",
+    "title": "Find Subarrays With Equal Sum",
     "difficulty": "Easy",
-    "id": 2395,
-    "link": "https://leetcode.com/problems/find-subarrays-with-equal-sum/",
-    "title": "Find Subarrays With Equal Sum"
+    "link": "https://leetcode.com/problems/find-subarrays-with-equal-sum/"
   },
   "2396": {
+    "id": 2396,
     "category": "Math & Geometry",
+    "title": "Strictly Palindromic Number",
     "difficulty": "Medium",
-    "id": 2396,
-    "link": "https://leetcode.com/problems/strictly-palindromic-number/",
-    "title": "Strictly Palindromic Number"
+    "link": "https://leetcode.com/problems/strictly-palindromic-number/"
   },
   "2397": {
+    "id": 2397,
     "category": "Backtracking",
+    "title": "Maximum Rows Covered by Columns",
     "difficulty": "Medium",
-    "id": 2397,
-    "link": "https://leetcode.com/problems/maximum-rows-covered-by-columns/",
-    "title": "Maximum Rows Covered by Columns"
+    "link": "https://leetcode.com/problems/maximum-rows-covered-by-columns/"
   },
   "2398": {
+    "id": 2398,
     "category": "Sliding Window",
+    "title": "Maximum Number of Robots Within Budget",
     "difficulty": "Hard",
-    "id": 2398,
-    "link": "https://leetcode.com/problems/maximum-number-of-robots-within-budget/",
-    "title": "Maximum Number of Robots Within Budget"
+    "link": "https://leetcode.com/problems/maximum-number-of-robots-within-budget/"
   },
   "2399": {
+    "id": 2399,
     "category": "Array & Hashing",
+    "title": "Check Distances Between Same Letters",
     "difficulty": "Easy",
-    "id": 2399,
-    "link": "https://leetcode.com/problems/check-distances-between-same-letters/",
-    "title": "Check Distances Between Same Letters"
+    "link": "https://leetcode.com/problems/check-distances-between-same-letters/"
   },
   "2400": {
+    "id": 2400,
     "category": "Dynamic Programming",
+    "title": "Number of Ways to Reach a Position After Exactly k Steps",
     "difficulty": "Medium",
-    "id": 2400,
-    "link": "https://leetcode.com/problems/number-of-ways-to-reach-a-position-after-exactly-k-steps/",
-    "title": "Number of Ways to Reach a Position After Exactly k Steps"
+    "link": "https://leetcode.com/problems/number-of-ways-to-reach-a-position-after-exactly-k-steps/"
   },
   "2401": {
+    "id": 2401,
     "category": "Sliding Window",
+    "title": "Longest Nice Subarray",
     "difficulty": "Medium",
-    "id": 2401,
-    "link": "https://leetcode.com/problems/longest-nice-subarray/",
-    "title": "Longest Nice Subarray"
+    "link": "https://leetcode.com/problems/longest-nice-subarray/"
   },
   "2402": {
+    "id": 2402,
     "category": "Heap (Priority Queue)",
+    "title": "Meeting Rooms III",
     "difficulty": "Hard",
-    "id": 2402,
-    "link": "https://leetcode.com/problems/meeting-rooms-iii/",
-    "title": "Meeting Rooms III"
+    "link": "https://leetcode.com/problems/meeting-rooms-iii/"
   },
   "2403": {
+    "id": 2403,
     "category": "Dynamic Programming",
+    "title": "Minimum Time to Kill All Monsters",
     "difficulty": "Hard",
-    "id": 2403,
-    "link": "https://leetcode.com/problems/minimum-time-to-kill-all-monsters/",
-    "title": "Minimum Time to Kill All Monsters"
+    "link": "https://leetcode.com/problems/minimum-time-to-kill-all-monsters/"
   },
   "2404": {
+    "id": 2404,
     "category": "Array & Hashing",
+    "title": "Most Frequent Even Element",
     "difficulty": "Easy",
-    "id": 2404,
-    "link": "https://leetcode.com/problems/most-frequent-even-element/",
-    "title": "Most Frequent Even Element"
+    "link": "https://leetcode.com/problems/most-frequent-even-element/"
   },
   "2405": {
+    "id": 2405,
     "category": "Greedy",
+    "title": "Optimal Partition of String",
     "difficulty": "Medium",
-    "id": 2405,
-    "link": "https://leetcode.com/problems/optimal-partition-of-string/",
-    "title": "Optimal Partition of String"
+    "link": "https://leetcode.com/problems/optimal-partition-of-string/"
   },
   "2406": {
+    "id": 2406,
     "category": "Heap (Priority Queue)",
+    "title": "Divide Intervals Into Minimum Number of Groups",
     "difficulty": "Medium",
-    "id": 2406,
-    "link": "https://leetcode.com/problems/divide-intervals-into-minimum-number-of-groups/",
-    "title": "Divide Intervals Into Minimum Number of Groups"
+    "link": "https://leetcode.com/problems/divide-intervals-into-minimum-number-of-groups/"
   },
   "2407": {
+    "id": 2407,
     "category": "Tree",
+    "title": "Longest Increasing Subsequence II",
     "difficulty": "Hard",
-    "id": 2407,
-    "link": "https://leetcode.com/problems/longest-increasing-subsequence-ii/",
-    "title": "Longest Increasing Subsequence II"
+    "link": "https://leetcode.com/problems/longest-increasing-subsequence-ii/"
   },
   "2408": {
+    "id": 2408,
     "category": "Array & Hashing",
+    "title": "Design SQL",
     "difficulty": "Medium",
-    "id": 2408,
-    "link": "https://leetcode.com/problems/design-sql/",
-    "title": "Design SQL"
+    "link": "https://leetcode.com/problems/design-sql/"
   },
   "2409": {
+    "id": 2409,
     "category": "Math & Geometry",
+    "title": "Count Days Spent Together",
     "difficulty": "Easy",
-    "id": 2409,
-    "link": "https://leetcode.com/problems/count-days-spent-together/",
-    "title": "Count Days Spent Together"
+    "link": "https://leetcode.com/problems/count-days-spent-together/"
   },
   "2410": {
+    "id": 2410,
     "category": "Greedy",
+    "title": "Maximum Matching of Players With Trainers",
     "difficulty": "Medium",
-    "id": 2410,
-    "link": "https://leetcode.com/problems/maximum-matching-of-players-with-trainers/",
-    "title": "Maximum Matching of Players With Trainers"
+    "link": "https://leetcode.com/problems/maximum-matching-of-players-with-trainers/"
   },
   "2411": {
+    "id": 2411,
     "category": "Sliding Window",
+    "title": "Smallest Subarrays With Maximum Bitwise OR",
     "difficulty": "Medium",
-    "id": 2411,
-    "link": "https://leetcode.com/problems/smallest-subarrays-with-maximum-bitwise-or/",
-    "title": "Smallest Subarrays With Maximum Bitwise OR"
+    "link": "https://leetcode.com/problems/smallest-subarrays-with-maximum-bitwise-or/"
   },
   "2412": {
+    "id": 2412,
     "category": "Greedy",
+    "title": "Minimum Money Required Before Transactions",
     "difficulty": "Hard",
-    "id": 2412,
-    "link": "https://leetcode.com/problems/minimum-money-required-before-transactions/",
-    "title": "Minimum Money Required Before Transactions"
+    "link": "https://leetcode.com/problems/minimum-money-required-before-transactions/"
   },
   "2413": {
+    "id": 2413,
     "category": "Math & Geometry",
+    "title": "Smallest Even Multiple",
     "difficulty": "Easy",
-    "id": 2413,
-    "link": "https://leetcode.com/problems/smallest-even-multiple/",
-    "title": "Smallest Even Multiple"
+    "link": "https://leetcode.com/problems/smallest-even-multiple/"
   },
   "2414": {
+    "id": 2414,
     "category": "Array & Hashing",
+    "title": "Length of the Longest Alphabetical Continuous Substring",
     "difficulty": "Medium",
-    "id": 2414,
-    "link": "https://leetcode.com/problems/length-of-the-longest-alphabetical-continuous-substring/",
-    "title": "Length of the Longest Alphabetical Continuous Substring"
+    "link": "https://leetcode.com/problems/length-of-the-longest-alphabetical-continuous-substring/"
   },
   "2415": {
+    "id": 2415,
     "category": "Tree",
+    "title": "Reverse Odd Levels of Binary Tree",
     "difficulty": "Medium",
-    "id": 2415,
-    "link": "https://leetcode.com/problems/reverse-odd-levels-of-binary-tree/",
-    "title": "Reverse Odd Levels of Binary Tree"
+    "link": "https://leetcode.com/problems/reverse-odd-levels-of-binary-tree/"
   },
   "2416": {
+    "id": 2416,
     "category": "Trie",
+    "title": "Sum of Prefix Scores of Strings",
     "difficulty": "Hard",
-    "id": 2416,
-    "link": "https://leetcode.com/problems/sum-of-prefix-scores-of-strings/",
-    "title": "Sum of Prefix Scores of Strings"
+    "link": "https://leetcode.com/problems/sum-of-prefix-scores-of-strings/"
   },
   "2417": {
+    "id": 2417,
     "category": "Math & Geometry",
+    "title": "Closest Fair Integer",
     "difficulty": "Medium",
-    "id": 2417,
-    "link": "https://leetcode.com/problems/closest-fair-integer/",
-    "title": "Closest Fair Integer"
+    "link": "https://leetcode.com/problems/closest-fair-integer/"
   },
   "2418": {
+    "id": 2418,
     "category": "Array & Hashing",
+    "title": "Sort the People",
     "difficulty": "Easy",
-    "id": 2418,
-    "link": "https://leetcode.com/problems/sort-the-people/",
-    "title": "Sort the People"
+    "link": "https://leetcode.com/problems/sort-the-people/"
   },
   "2419": {
+    "id": 2419,
     "category": "Bit Manipulation",
+    "title": "Longest Subarray With Maximum Bitwise AND",
     "difficulty": "Medium",
-    "id": 2419,
-    "link": "https://leetcode.com/problems/longest-subarray-with-maximum-bitwise-and/",
-    "title": "Longest Subarray With Maximum Bitwise AND"
+    "link": "https://leetcode.com/problems/longest-subarray-with-maximum-bitwise-and/"
   },
   "2420": {
+    "id": 2420,
     "category": "Dynamic Programming",
+    "title": "Find All Good Indices",
     "difficulty": "Medium",
-    "id": 2420,
-    "link": "https://leetcode.com/problems/find-all-good-indices/",
-    "title": "Find All Good Indices"
+    "link": "https://leetcode.com/problems/find-all-good-indices/"
   },
   "2421": {
+    "id": 2421,
     "category": "Tree",
+    "title": "Number of Good Paths",
     "difficulty": "Hard",
-    "id": 2421,
-    "link": "https://leetcode.com/problems/number-of-good-paths/",
-    "title": "Number of Good Paths"
+    "link": "https://leetcode.com/problems/number-of-good-paths/"
   },
   "2422": {
+    "id": 2422,
     "category": "Greedy",
+    "title": "Merge Operations to Turn Array Into a Palindrome",
     "difficulty": "Medium",
-    "id": 2422,
-    "link": "https://leetcode.com/problems/merge-operations-to-turn-array-into-a-palindrome/",
-    "title": "Merge Operations to Turn Array Into a Palindrome"
+    "link": "https://leetcode.com/problems/merge-operations-to-turn-array-into-a-palindrome/"
   },
   "2423": {
+    "id": 2423,
     "category": "Array & Hashing",
+    "title": "Remove Letter To Equalize Frequency",
     "difficulty": "Easy",
-    "id": 2423,
-    "link": "https://leetcode.com/problems/remove-letter-to-equalize-frequency/",
-    "title": "Remove Letter To Equalize Frequency"
+    "link": "https://leetcode.com/problems/remove-letter-to-equalize-frequency/"
   },
   "2424": {
+    "id": 2424,
     "category": "Tree",
+    "title": "Longest Uploaded Prefix",
     "difficulty": "Medium",
-    "id": 2424,
-    "link": "https://leetcode.com/problems/longest-uploaded-prefix/",
-    "title": "Longest Uploaded Prefix"
+    "link": "https://leetcode.com/problems/longest-uploaded-prefix/"
   },
   "2425": {
+    "id": 2425,
     "category": "Bit Manipulation",
+    "title": "Bitwise XOR of All Pairings",
     "difficulty": "Medium",
-    "id": 2425,
-    "link": "https://leetcode.com/problems/bitwise-xor-of-all-pairings/",
-    "title": "Bitwise XOR of All Pairings"
+    "link": "https://leetcode.com/problems/bitwise-xor-of-all-pairings/"
   },
   "2426": {
+    "id": 2426,
     "category": "Tree",
+    "title": "Number of Pairs Satisfying Inequality",
     "difficulty": "Hard",
-    "id": 2426,
-    "link": "https://leetcode.com/problems/number-of-pairs-satisfying-inequality/",
-    "title": "Number of Pairs Satisfying Inequality"
+    "link": "https://leetcode.com/problems/number-of-pairs-satisfying-inequality/"
   },
   "2427": {
+    "id": 2427,
     "category": "Math & Geometry",
+    "title": "Number of Common Factors",
     "difficulty": "Easy",
-    "id": 2427,
-    "link": "https://leetcode.com/problems/number-of-common-factors/",
-    "title": "Number of Common Factors"
+    "link": "https://leetcode.com/problems/number-of-common-factors/"
   },
   "2428": {
+    "id": 2428,
     "category": "Array & Hashing",
+    "title": "Maximum Sum of an Hourglass",
     "difficulty": "Medium",
-    "id": 2428,
-    "link": "https://leetcode.com/problems/maximum-sum-of-an-hourglass/",
-    "title": "Maximum Sum of an Hourglass"
+    "link": "https://leetcode.com/problems/maximum-sum-of-an-hourglass/"
   },
   "2429": {
+    "id": 2429,
     "category": "Bit Manipulation",
+    "title": "Minimize XOR",
     "difficulty": "Medium",
-    "id": 2429,
-    "link": "https://leetcode.com/problems/minimize-xor/",
-    "title": "Minimize XOR"
+    "link": "https://leetcode.com/problems/minimize-xor/"
   },
   "2430": {
+    "id": 2430,
     "category": "Dynamic Programming",
+    "title": "Maximum Deletions on a String",
     "difficulty": "Hard",
-    "id": 2430,
-    "link": "https://leetcode.com/problems/maximum-deletions-on-a-string/",
-    "title": "Maximum Deletions on a String"
+    "link": "https://leetcode.com/problems/maximum-deletions-on-a-string/"
   },
   "2431": {
+    "id": 2431,
     "category": "Dynamic Programming",
+    "title": "Maximize Total Tastiness of Purchased Fruits",
     "difficulty": "Medium",
-    "id": 2431,
-    "link": "https://leetcode.com/problems/maximize-total-tastiness-of-purchased-fruits/",
-    "title": "Maximize Total Tastiness of Purchased Fruits"
+    "link": "https://leetcode.com/problems/maximize-total-tastiness-of-purchased-fruits/"
   },
   "2432": {
+    "id": 2432,
     "category": "Array & Hashing",
+    "title": "The Employee That Worked on the Longest Task",
     "difficulty": "Easy",
-    "id": 2432,
-    "link": "https://leetcode.com/problems/the-employee-that-worked-on-the-longest-task/",
-    "title": "The Employee That Worked on the Longest Task"
+    "link": "https://leetcode.com/problems/the-employee-that-worked-on-the-longest-task/"
   },
   "2433": {
+    "id": 2433,
     "category": "Bit Manipulation",
+    "title": "Find The Original Array of Prefix Xor",
     "difficulty": "Medium",
-    "id": 2433,
-    "link": "https://leetcode.com/problems/find-the-original-array-of-prefix-xor/",
-    "title": "Find The Original Array of Prefix Xor"
+    "link": "https://leetcode.com/problems/find-the-original-array-of-prefix-xor/"
   },
   "2434": {
+    "id": 2434,
     "category": "Stack",
+    "title": "Using a Robot to Print the Lexicographically Smallest String",
     "difficulty": "Medium",
-    "id": 2434,
-    "link": "https://leetcode.com/problems/using-a-robot-to-print-the-lexicographically-smallest-string/",
-    "title": "Using a Robot to Print the Lexicographically Smallest String"
+    "link": "https://leetcode.com/problems/using-a-robot-to-print-the-lexicographically-smallest-string/"
   },
   "2435": {
+    "id": 2435,
     "category": "Dynamic Programming",
+    "title": "Paths in Matrix Whose Sum Is Divisible by K",
     "difficulty": "Hard",
-    "id": 2435,
-    "link": "https://leetcode.com/problems/paths-in-matrix-whose-sum-is-divisible-by-k/",
-    "title": "Paths in Matrix Whose Sum Is Divisible by K"
+    "link": "https://leetcode.com/problems/paths-in-matrix-whose-sum-is-divisible-by-k/"
   },
   "2436": {
+    "id": 2436,
     "category": "Dynamic Programming",
+    "title": "Minimum Split Into Subarrays With GCD Greater Than One",
     "difficulty": "Medium",
-    "id": 2436,
-    "link": "https://leetcode.com/problems/minimum-split-into-subarrays-with-gcd-greater-than-one/",
-    "title": "Minimum Split Into Subarrays With GCD Greater Than One"
+    "link": "https://leetcode.com/problems/minimum-split-into-subarrays-with-gcd-greater-than-one/"
   },
   "2437": {
+    "id": 2437,
     "category": "Array & Hashing",
+    "title": "Number of Valid Clock Times",
     "difficulty": "Easy",
-    "id": 2437,
-    "link": "https://leetcode.com/problems/number-of-valid-clock-times/",
-    "title": "Number of Valid Clock Times"
+    "link": "https://leetcode.com/problems/number-of-valid-clock-times/"
   },
   "2438": {
+    "id": 2438,
     "category": "Bit Manipulation",
+    "title": "Range Product Queries of Powers",
     "difficulty": "Medium",
-    "id": 2438,
-    "link": "https://leetcode.com/problems/range-product-queries-of-powers/",
-    "title": "Range Product Queries of Powers"
+    "link": "https://leetcode.com/problems/range-product-queries-of-powers/"
   },
   "2439": {
+    "id": 2439,
     "category": "Dynamic Programming",
+    "title": "Minimize Maximum of Array",
     "difficulty": "Medium",
-    "id": 2439,
-    "link": "https://leetcode.com/problems/minimize-maximum-of-array/",
-    "title": "Minimize Maximum of Array"
+    "link": "https://leetcode.com/problems/minimize-maximum-of-array/"
   },
   "2440": {
+    "id": 2440,
     "category": "Tree",
+    "title": "Create Components With Same Value",
     "difficulty": "Hard",
-    "id": 2440,
-    "link": "https://leetcode.com/problems/create-components-with-same-value/",
-    "title": "Create Components With Same Value"
+    "link": "https://leetcode.com/problems/create-components-with-same-value/"
   },
   "2441": {
+    "id": 2441,
     "category": "Two Pointers",
+    "title": "Largest Positive Integer That Exists With Its Negative",
     "difficulty": "Easy",
-    "id": 2441,
-    "link": "https://leetcode.com/problems/largest-positive-integer-that-exists-with-its-negative/",
-    "title": "Largest Positive Integer That Exists With Its Negative"
+    "link": "https://leetcode.com/problems/largest-positive-integer-that-exists-with-its-negative/"
   },
   "2442": {
+    "id": 2442,
     "category": "Math & Geometry",
+    "title": "Count Number of Distinct Integers After Reverse Operations",
     "difficulty": "Medium",
-    "id": 2442,
-    "link": "https://leetcode.com/problems/count-number-of-distinct-integers-after-reverse-operations/",
-    "title": "Count Number of Distinct Integers After Reverse Operations"
+    "link": "https://leetcode.com/problems/count-number-of-distinct-integers-after-reverse-operations/"
   },
   "2443": {
+    "id": 2443,
     "category": "Math & Geometry",
+    "title": "Sum of Number and Its Reverse",
     "difficulty": "Medium",
-    "id": 2443,
-    "link": "https://leetcode.com/problems/sum-of-number-and-its-reverse/",
-    "title": "Sum of Number and Its Reverse"
+    "link": "https://leetcode.com/problems/sum-of-number-and-its-reverse/"
   },
   "2444": {
+    "id": 2444,
     "category": "Sliding Window",
+    "title": "Count Subarrays With Fixed Bounds",
     "difficulty": "Hard",
-    "id": 2444,
-    "link": "https://leetcode.com/problems/count-subarrays-with-fixed-bounds/",
-    "title": "Count Subarrays With Fixed Bounds"
+    "link": "https://leetcode.com/problems/count-subarrays-with-fixed-bounds/"
   },
   "2445": {
+    "id": 2445,
     "category": "Tree",
+    "title": "Number of Nodes With Value One",
     "difficulty": "Medium",
-    "id": 2445,
-    "link": "https://leetcode.com/problems/number-of-nodes-with-value-one/",
-    "title": "Number of Nodes With Value One"
+    "link": "https://leetcode.com/problems/number-of-nodes-with-value-one/"
   },
   "2446": {
+    "id": 2446,
     "category": "Array & Hashing",
+    "title": "Determine if Two Events Have Conflict",
     "difficulty": "Easy",
-    "id": 2446,
-    "link": "https://leetcode.com/problems/determine-if-two-events-have-conflict/",
-    "title": "Determine if Two Events Have Conflict"
+    "link": "https://leetcode.com/problems/determine-if-two-events-have-conflict/"
   },
   "2447": {
+    "id": 2447,
     "category": "Math & Geometry",
+    "title": "Number of Subarrays With GCD Equal to K",
     "difficulty": "Medium",
-    "id": 2447,
-    "link": "https://leetcode.com/problems/number-of-subarrays-with-gcd-equal-to-k/",
-    "title": "Number of Subarrays With GCD Equal to K"
+    "link": "https://leetcode.com/problems/number-of-subarrays-with-gcd-equal-to-k/"
   },
   "2448": {
+    "id": 2448,
     "category": "Binary Search",
+    "title": "Minimum Cost to Make Array Equal",
     "difficulty": "Hard",
-    "id": 2448,
-    "link": "https://leetcode.com/problems/minimum-cost-to-make-array-equal/",
-    "title": "Minimum Cost to Make Array Equal"
+    "link": "https://leetcode.com/problems/minimum-cost-to-make-array-equal/"
   },
   "2449": {
+    "id": 2449,
     "category": "Greedy",
+    "title": "Minimum Number of Operations to Make Arrays Similar",
     "difficulty": "Hard",
-    "id": 2449,
-    "link": "https://leetcode.com/problems/minimum-number-of-operations-to-make-arrays-similar/",
-    "title": "Minimum Number of Operations to Make Arrays Similar"
+    "link": "https://leetcode.com/problems/minimum-number-of-operations-to-make-arrays-similar/"
   },
   "2450": {
+    "id": 2450,
     "category": "Math & Geometry",
+    "title": "Number of Distinct Binary Strings After Applying Operations",
     "difficulty": "Medium",
-    "id": 2450,
-    "link": "https://leetcode.com/problems/number-of-distinct-binary-strings-after-applying-operations/",
-    "title": "Number of Distinct Binary Strings After Applying Operations"
+    "link": "https://leetcode.com/problems/number-of-distinct-binary-strings-after-applying-operations/"
   },
   "2451": {
+    "id": 2451,
     "category": "Array & Hashing",
+    "title": "Odd String Difference",
     "difficulty": "Easy",
-    "id": 2451,
-    "link": "https://leetcode.com/problems/odd-string-difference/",
-    "title": "Odd String Difference"
+    "link": "https://leetcode.com/problems/odd-string-difference/"
   },
   "2452": {
+    "id": 2452,
     "category": "Trie",
+    "title": "Words Within Two Edits of Dictionary",
     "difficulty": "Medium",
-    "id": 2452,
-    "link": "https://leetcode.com/problems/words-within-two-edits-of-dictionary/",
-    "title": "Words Within Two Edits of Dictionary"
+    "link": "https://leetcode.com/problems/words-within-two-edits-of-dictionary/"
   },
   "2453": {
+    "id": 2453,
     "category": "Array & Hashing",
+    "title": "Destroy Sequential Targets",
     "difficulty": "Medium",
-    "id": 2453,
-    "link": "https://leetcode.com/problems/destroy-sequential-targets/",
-    "title": "Destroy Sequential Targets"
+    "link": "https://leetcode.com/problems/destroy-sequential-targets/"
   },
   "2454": {
+    "id": 2454,
     "category": "Binary Search",
+    "title": "Next Greater Element IV",
     "difficulty": "Hard",
-    "id": 2454,
-    "link": "https://leetcode.com/problems/next-greater-element-iv/",
-    "title": "Next Greater Element IV"
+    "link": "https://leetcode.com/problems/next-greater-element-iv/"
   },
   "2455": {
+    "id": 2455,
     "category": "Math & Geometry",
+    "title": "Average Value of Even Numbers That Are Divisible by Three",
     "difficulty": "Easy",
-    "id": 2455,
-    "link": "https://leetcode.com/problems/average-value-of-even-numbers-that-are-divisible-by-three/",
-    "title": "Average Value of Even Numbers That Are Divisible by Three"
+    "link": "https://leetcode.com/problems/average-value-of-even-numbers-that-are-divisible-by-three/"
   },
   "2456": {
+    "id": 2456,
     "category": "Heap (Priority Queue)",
+    "title": "Most Popular Video Creator",
     "difficulty": "Medium",
-    "id": 2456,
-    "link": "https://leetcode.com/problems/most-popular-video-creator/",
-    "title": "Most Popular Video Creator"
+    "link": "https://leetcode.com/problems/most-popular-video-creator/"
   },
   "2457": {
+    "id": 2457,
     "category": "Greedy",
+    "title": "Minimum Addition to Make Integer Beautiful",
     "difficulty": "Medium",
-    "id": 2457,
-    "link": "https://leetcode.com/problems/minimum-addition-to-make-integer-beautiful/",
-    "title": "Minimum Addition to Make Integer Beautiful"
+    "link": "https://leetcode.com/problems/minimum-addition-to-make-integer-beautiful/"
   },
   "2458": {
+    "id": 2458,
     "category": "Tree",
+    "title": "Height of Binary Tree After Subtree Removal Queries",
     "difficulty": "Hard",
-    "id": 2458,
-    "link": "https://leetcode.com/problems/height-of-binary-tree-after-subtree-removal-queries/",
-    "title": "Height of Binary Tree After Subtree Removal Queries"
+    "link": "https://leetcode.com/problems/height-of-binary-tree-after-subtree-removal-queries/"
   },
   "2459": {
+    "id": 2459,
     "category": "Greedy",
+    "title": "Sort Array by Moving Items to Empty Space",
     "difficulty": "Hard",
-    "id": 2459,
-    "link": "https://leetcode.com/problems/sort-array-by-moving-items-to-empty-space/",
-    "title": "Sort Array by Moving Items to Empty Space"
+    "link": "https://leetcode.com/problems/sort-array-by-moving-items-to-empty-space/"
   },
   "2460": {
+    "id": 2460,
     "category": "Two Pointers",
+    "title": "Apply Operations to an Array",
     "difficulty": "Easy",
-    "id": 2460,
-    "link": "https://leetcode.com/problems/apply-operations-to-an-array/",
-    "title": "Apply Operations to an Array"
+    "link": "https://leetcode.com/problems/apply-operations-to-an-array/"
   },
   "2461": {
+    "id": 2461,
     "category": "Sliding Window",
+    "title": "Maximum Sum of Distinct Subarrays With Length K",
     "difficulty": "Medium",
-    "id": 2461,
-    "link": "https://leetcode.com/problems/maximum-sum-of-distinct-subarrays-with-length-k/",
-    "title": "Maximum Sum of Distinct Subarrays With Length K"
+    "link": "https://leetcode.com/problems/maximum-sum-of-distinct-subarrays-with-length-k/"
   },
   "2462": {
+    "id": 2462,
     "category": "Heap (Priority Queue)",
+    "title": "Total Cost to Hire K Workers",
     "difficulty": "Medium",
-    "id": 2462,
-    "link": "https://leetcode.com/problems/total-cost-to-hire-k-workers/",
-    "title": "Total Cost to Hire K Workers"
+    "link": "https://leetcode.com/problems/total-cost-to-hire-k-workers/"
   },
   "2463": {
+    "id": 2463,
     "category": "Dynamic Programming",
+    "title": "Minimum Total Distance Traveled",
     "difficulty": "Hard",
-    "id": 2463,
-    "link": "https://leetcode.com/problems/minimum-total-distance-traveled/",
-    "title": "Minimum Total Distance Traveled"
+    "link": "https://leetcode.com/problems/minimum-total-distance-traveled/"
   },
   "2464": {
+    "id": 2464,
     "category": "Dynamic Programming",
+    "title": "Minimum Subarrays in a Valid Split",
     "difficulty": "Medium",
-    "id": 2464,
-    "link": "https://leetcode.com/problems/minimum-subarrays-in-a-valid-split/",
-    "title": "Minimum Subarrays in a Valid Split"
+    "link": "https://leetcode.com/problems/minimum-subarrays-in-a-valid-split/"
   },
   "2465": {
+    "id": 2465,
     "category": "Two Pointers",
+    "title": "Number of Distinct Averages",
     "difficulty": "Easy",
-    "id": 2465,
-    "link": "https://leetcode.com/problems/number-of-distinct-averages/",
-    "title": "Number of Distinct Averages"
+    "link": "https://leetcode.com/problems/number-of-distinct-averages/"
   },
   "2466": {
+    "id": 2466,
     "category": "Dynamic Programming",
+    "title": "Count Ways To Build Good Strings",
     "difficulty": "Medium",
-    "id": 2466,
-    "link": "https://leetcode.com/problems/count-ways-to-build-good-strings/",
-    "title": "Count Ways To Build Good Strings"
+    "link": "https://leetcode.com/problems/count-ways-to-build-good-strings/"
   },
   "2467": {
+    "id": 2467,
     "category": "Tree",
+    "title": "Most Profitable Path in a Tree",
     "difficulty": "Medium",
-    "id": 2467,
-    "link": "https://leetcode.com/problems/most-profitable-path-in-a-tree/",
-    "title": "Most Profitable Path in a Tree"
+    "link": "https://leetcode.com/problems/most-profitable-path-in-a-tree/"
   },
   "2468": {
+    "id": 2468,
     "category": "Binary Search",
+    "title": "Split Message Based on Limit",
     "difficulty": "Hard",
-    "id": 2468,
-    "link": "https://leetcode.com/problems/split-message-based-on-limit/",
-    "title": "Split Message Based on Limit"
+    "link": "https://leetcode.com/problems/split-message-based-on-limit/"
   },
   "2469": {
+    "id": 2469,
     "category": "Math & Geometry",
+    "title": "Convert the Temperature",
     "difficulty": "Easy",
-    "id": 2469,
-    "link": "https://leetcode.com/problems/convert-the-temperature/",
-    "title": "Convert the Temperature"
+    "link": "https://leetcode.com/problems/convert-the-temperature/"
   },
   "2470": {
+    "id": 2470,
     "category": "Math & Geometry",
+    "title": "Number of Subarrays With LCM Equal to K",
     "difficulty": "Medium",
-    "id": 2470,
-    "link": "https://leetcode.com/problems/number-of-subarrays-with-lcm-equal-to-k/",
-    "title": "Number of Subarrays With LCM Equal to K"
+    "link": "https://leetcode.com/problems/number-of-subarrays-with-lcm-equal-to-k/"
   },
   "2471": {
+    "id": 2471,
     "category": "Tree",
+    "title": "Minimum Number of Operations to Sort a Binary Tree by Level",
     "difficulty": "Medium",
-    "id": 2471,
-    "link": "https://leetcode.com/problems/minimum-number-of-operations-to-sort-a-binary-tree-by-level/",
-    "title": "Minimum Number of Operations to Sort a Binary Tree by Level"
+    "link": "https://leetcode.com/problems/minimum-number-of-operations-to-sort-a-binary-tree-by-level/"
   },
   "2472": {
+    "id": 2472,
     "category": "Dynamic Programming",
+    "title": "Maximum Number of Non-overlapping Palindrome Substrings",
     "difficulty": "Hard",
-    "id": 2472,
-    "link": "https://leetcode.com/problems/maximum-number-of-non-overlapping-palindrome-substrings/",
-    "title": "Maximum Number of Non-overlapping Palindrome Substrings"
+    "link": "https://leetcode.com/problems/maximum-number-of-non-overlapping-palindrome-substrings/"
   },
   "2473": {
+    "id": 2473,
     "category": "Graph Traversal",
+    "title": "Minimum Cost to Buy Apples",
     "difficulty": "Medium",
-    "id": 2473,
-    "link": "https://leetcode.com/problems/minimum-cost-to-buy-apples/",
-    "title": "Minimum Cost to Buy Apples"
+    "link": "https://leetcode.com/problems/minimum-cost-to-buy-apples/"
   },
   "2474": {
+    "id": 2474,
     "category": "Database",
+    "title": "Customers With Strictly Increasing Purchases",
     "difficulty": "Hard",
-    "id": 2474,
-    "link": "https://leetcode.com/problems/customers-with-strictly-increasing-purchases/",
-    "title": "Customers With Strictly Increasing Purchases"
+    "link": "https://leetcode.com/problems/customers-with-strictly-increasing-purchases/"
   },
   "2475": {
+    "id": 2475,
     "category": "Array & Hashing",
+    "title": "Number of Unequal Triplets in Array",
     "difficulty": "Easy",
-    "id": 2475,
-    "link": "https://leetcode.com/problems/number-of-unequal-triplets-in-array/",
-    "title": "Number of Unequal Triplets in Array"
+    "link": "https://leetcode.com/problems/number-of-unequal-triplets-in-array/"
   },
   "2476": {
+    "id": 2476,
     "category": "Tree",
+    "title": "Closest Nodes Queries in a Binary Search Tree",
     "difficulty": "Medium",
-    "id": 2476,
-    "link": "https://leetcode.com/problems/closest-nodes-queries-in-a-binary-search-tree/",
-    "title": "Closest Nodes Queries in a Binary Search Tree"
+    "link": "https://leetcode.com/problems/closest-nodes-queries-in-a-binary-search-tree/"
   },
   "2477": {
+    "id": 2477,
     "category": "Tree",
+    "title": "Minimum Fuel Cost to Report to the Capital",
     "difficulty": "Medium",
-    "id": 2477,
-    "link": "https://leetcode.com/problems/minimum-fuel-cost-to-report-to-the-capital/",
-    "title": "Minimum Fuel Cost to Report to the Capital"
+    "link": "https://leetcode.com/problems/minimum-fuel-cost-to-report-to-the-capital/"
   },
   "2478": {
+    "id": 2478,
     "category": "Dynamic Programming",
+    "title": "Number of Beautiful Partitions",
     "difficulty": "Hard",
-    "id": 2478,
-    "link": "https://leetcode.com/problems/number-of-beautiful-partitions/",
-    "title": "Number of Beautiful Partitions"
+    "link": "https://leetcode.com/problems/number-of-beautiful-partitions/"
   },
   "2479": {
+    "id": 2479,
     "category": "Tree",
+    "title": "Maximum XOR of Two Non-Overlapping Subtrees",
     "difficulty": "Hard",
-    "id": 2479,
-    "link": "https://leetcode.com/problems/maximum-xor-of-two-non-overlapping-subtrees/",
-    "title": "Maximum XOR of Two Non-Overlapping Subtrees"
+    "link": "https://leetcode.com/problems/maximum-xor-of-two-non-overlapping-subtrees/"
   },
   "2480": {
+    "id": 2480,
     "category": "Database",
+    "title": "Form a Chemical Bond",
     "difficulty": "Easy",
-    "id": 2480,
-    "link": "https://leetcode.com/problems/form-a-chemical-bond/",
-    "title": "Form a Chemical Bond"
+    "link": "https://leetcode.com/problems/form-a-chemical-bond/"
   },
   "2481": {
+    "id": 2481,
     "category": "Math & Geometry",
+    "title": "Minimum Cuts to Divide a Circle",
     "difficulty": "Easy",
-    "id": 2481,
-    "link": "https://leetcode.com/problems/minimum-cuts-to-divide-a-circle/",
-    "title": "Minimum Cuts to Divide a Circle"
+    "link": "https://leetcode.com/problems/minimum-cuts-to-divide-a-circle/"
   },
   "2482": {
+    "id": 2482,
     "category": "Array & Hashing",
+    "title": "Difference Between Ones and Zeros in Row and Column",
     "difficulty": "Medium",
-    "id": 2482,
-    "link": "https://leetcode.com/problems/difference-between-ones-and-zeros-in-row-and-column/",
-    "title": "Difference Between Ones and Zeros in Row and Column"
+    "link": "https://leetcode.com/problems/difference-between-ones-and-zeros-in-row-and-column/"
   },
   "2483": {
+    "id": 2483,
     "category": "Array & Hashing",
+    "title": "Minimum Penalty for a Shop",
     "difficulty": "Medium",
-    "id": 2483,
-    "link": "https://leetcode.com/problems/minimum-penalty-for-a-shop/",
-    "title": "Minimum Penalty for a Shop"
+    "link": "https://leetcode.com/problems/minimum-penalty-for-a-shop/"
   },
   "2484": {
+    "id": 2484,
     "category": "Dynamic Programming",
+    "title": "Count Palindromic Subsequences",
     "difficulty": "Hard",
-    "id": 2484,
-    "link": "https://leetcode.com/problems/count-palindromic-subsequences/",
-    "title": "Count Palindromic Subsequences"
+    "link": "https://leetcode.com/problems/count-palindromic-subsequences/"
   },
   "2485": {
+    "id": 2485,
     "category": "Math & Geometry",
+    "title": "Find the Pivot Integer",
     "difficulty": "Easy",
-    "id": 2485,
-    "link": "https://leetcode.com/problems/find-the-pivot-integer/",
-    "title": "Find the Pivot Integer"
+    "link": "https://leetcode.com/problems/find-the-pivot-integer/"
   },
   "2486": {
+    "id": 2486,
     "category": "Greedy",
+    "title": "Append Characters to String to Make Subsequence",
     "difficulty": "Medium",
-    "id": 2486,
-    "link": "https://leetcode.com/problems/append-characters-to-string-to-make-subsequence/",
-    "title": "Append Characters to String to Make Subsequence"
+    "link": "https://leetcode.com/problems/append-characters-to-string-to-make-subsequence/"
   },
   "2487": {
+    "id": 2487,
     "category": "Stack",
+    "title": "Remove Nodes From Linked List",
     "difficulty": "Medium",
-    "id": 2487,
-    "link": "https://leetcode.com/problems/remove-nodes-from-linked-list/",
-    "title": "Remove Nodes From Linked List"
+    "link": "https://leetcode.com/problems/remove-nodes-from-linked-list/"
   },
   "2488": {
+    "id": 2488,
     "category": "Array & Hashing",
+    "title": "Count Subarrays With Median K",
     "difficulty": "Hard",
-    "id": 2488,
-    "link": "https://leetcode.com/problems/count-subarrays-with-median-k/",
-    "title": "Count Subarrays With Median K"
+    "link": "https://leetcode.com/problems/count-subarrays-with-median-k/"
   },
   "2489": {
+    "id": 2489,
     "category": "Math & Geometry",
+    "title": "Number of Substrings With Fixed Ratio",
     "difficulty": "Medium",
-    "id": 2489,
-    "link": "https://leetcode.com/problems/number-of-substrings-with-fixed-ratio/",
-    "title": "Number of Substrings With Fixed Ratio"
+    "link": "https://leetcode.com/problems/number-of-substrings-with-fixed-ratio/"
   },
   "2490": {
+    "id": 2490,
     "category": "Array & Hashing",
+    "title": "Circular Sentence",
     "difficulty": "Easy",
-    "id": 2490,
-    "link": "https://leetcode.com/problems/circular-sentence/",
-    "title": "Circular Sentence"
+    "link": "https://leetcode.com/problems/circular-sentence/"
   },
   "2491": {
+    "id": 2491,
     "category": "Two Pointers",
+    "title": "Divide Players Into Teams of Equal Skill",
     "difficulty": "Medium",
-    "id": 2491,
-    "link": "https://leetcode.com/problems/divide-players-into-teams-of-equal-skill/",
-    "title": "Divide Players Into Teams of Equal Skill"
+    "link": "https://leetcode.com/problems/divide-players-into-teams-of-equal-skill/"
   },
   "2492": {
+    "id": 2492,
     "category": "Graph Traversal",
+    "title": "Minimum Score of a Path Between Two Cities",
     "difficulty": "Medium",
-    "id": 2492,
-    "link": "https://leetcode.com/problems/minimum-score-of-a-path-between-two-cities/",
-    "title": "Minimum Score of a Path Between Two Cities"
+    "link": "https://leetcode.com/problems/minimum-score-of-a-path-between-two-cities/"
   },
   "2493": {
+    "id": 2493,
     "category": "Graph Traversal",
+    "title": "Divide Nodes Into the Maximum Number of Groups",
     "difficulty": "Hard",
-    "id": 2493,
-    "link": "https://leetcode.com/problems/divide-nodes-into-the-maximum-number-of-groups/",
-    "title": "Divide Nodes Into the Maximum Number of Groups"
+    "link": "https://leetcode.com/problems/divide-nodes-into-the-maximum-number-of-groups/"
   },
   "2494": {
+    "id": 2494,
     "category": "Database",
+    "title": "Merge Overlapping Events in the Same Hall",
     "difficulty": "Hard",
-    "id": 2494,
-    "link": "https://leetcode.com/problems/merge-overlapping-events-in-the-same-hall/",
-    "title": "Merge Overlapping Events in the Same Hall"
+    "link": "https://leetcode.com/problems/merge-overlapping-events-in-the-same-hall/"
   },
   "2495": {
+    "id": 2495,
     "category": "Dynamic Programming",
+    "title": "Number of Subarrays Having Even Product",
     "difficulty": "Medium",
-    "id": 2495,
-    "link": "https://leetcode.com/problems/number-of-subarrays-having-even-product/",
-    "title": "Number of Subarrays Having Even Product"
+    "link": "https://leetcode.com/problems/number-of-subarrays-having-even-product/"
   },
   "2496": {
+    "id": 2496,
     "category": "Array & Hashing",
+    "title": "Maximum Value of a String in an Array",
     "difficulty": "Easy",
-    "id": 2496,
-    "link": "https://leetcode.com/problems/maximum-value-of-a-string-in-an-array/",
-    "title": "Maximum Value of a String in an Array"
+    "link": "https://leetcode.com/problems/maximum-value-of-a-string-in-an-array/"
   },
   "2497": {
+    "id": 2497,
     "category": "Graph Traversal",
+    "title": "Maximum Star Sum of a Graph",
     "difficulty": "Medium",
-    "id": 2497,
-    "link": "https://leetcode.com/problems/maximum-star-sum-of-a-graph/",
-    "title": "Maximum Star Sum of a Graph"
+    "link": "https://leetcode.com/problems/maximum-star-sum-of-a-graph/"
   },
   "2498": {
+    "id": 2498,
     "category": "Binary Search",
+    "title": "Frog Jump II",
     "difficulty": "Medium",
-    "id": 2498,
-    "link": "https://leetcode.com/problems/frog-jump-ii/",
-    "title": "Frog Jump II"
+    "link": "https://leetcode.com/problems/frog-jump-ii/"
   },
   "2499": {
+    "id": 2499,
     "category": "Greedy",
+    "title": "Minimum Total Cost to Make Arrays Unequal",
     "difficulty": "Hard",
-    "id": 2499,
-    "link": "https://leetcode.com/problems/minimum-total-cost-to-make-arrays-unequal/",
-    "title": "Minimum Total Cost to Make Arrays Unequal"
+    "link": "https://leetcode.com/problems/minimum-total-cost-to-make-arrays-unequal/"
   },
   "2500": {
+    "id": 2500,
     "category": "Heap (Priority Queue)",
+    "title": "Delete Greatest Value in Each Row",
     "difficulty": "Easy",
-    "id": 2500,
-    "link": "https://leetcode.com/problems/delete-greatest-value-in-each-row/",
-    "title": "Delete Greatest Value in Each Row"
+    "link": "https://leetcode.com/problems/delete-greatest-value-in-each-row/"
   },
   "2501": {
+    "id": 2501,
     "category": "Dynamic Programming",
+    "title": "Longest Square Streak in an Array",
     "difficulty": "Medium",
-    "id": 2501,
-    "link": "https://leetcode.com/problems/longest-square-streak-in-an-array/",
-    "title": "Longest Square Streak in an Array"
+    "link": "https://leetcode.com/problems/longest-square-streak-in-an-array/"
   },
   "2502": {
+    "id": 2502,
     "category": "Array & Hashing",
+    "title": "Design Memory Allocator",
     "difficulty": "Medium",
-    "id": 2502,
-    "link": "https://leetcode.com/problems/design-memory-allocator/",
-    "title": "Design Memory Allocator"
+    "link": "https://leetcode.com/problems/design-memory-allocator/"
   },
   "2503": {
+    "id": 2503,
     "category": "Graph Traversal",
+    "title": "Maximum Number of Points From Grid Queries",
     "difficulty": "Hard",
-    "id": 2503,
-    "link": "https://leetcode.com/problems/maximum-number-of-points-from-grid-queries/",
-    "title": "Maximum Number of Points From Grid Queries"
+    "link": "https://leetcode.com/problems/maximum-number-of-points-from-grid-queries/"
   },
   "2504": {
+    "id": 2504,
     "category": "Database",
+    "title": "Concatenate the Name and the Profession",
     "difficulty": "Easy",
-    "id": 2504,
-    "link": "https://leetcode.com/problems/concatenate-the-name-and-the-profession/",
-    "title": "Concatenate the Name and the Profession"
+    "link": "https://leetcode.com/problems/concatenate-the-name-and-the-profession/"
   },
   "2505": {
+    "id": 2505,
     "category": "Bit Manipulation",
+    "title": "Bitwise OR of All Subsequence Sums",
     "difficulty": "Medium",
-    "id": 2505,
-    "link": "https://leetcode.com/problems/bitwise-or-of-all-subsequence-sums/",
-    "title": "Bitwise OR of All Subsequence Sums"
+    "link": "https://leetcode.com/problems/bitwise-or-of-all-subsequence-sums/"
   },
   "2506": {
+    "id": 2506,
     "category": "Bit Manipulation",
+    "title": "Count Pairs Of Similar Strings",
     "difficulty": "Easy",
-    "id": 2506,
-    "link": "https://leetcode.com/problems/count-pairs-of-similar-strings/",
-    "title": "Count Pairs Of Similar Strings"
+    "link": "https://leetcode.com/problems/count-pairs-of-similar-strings/"
   },
   "2507": {
+    "id": 2507,
     "category": "Math & Geometry",
+    "title": "Smallest Value After Replacing With Sum of Prime Factors",
     "difficulty": "Medium",
-    "id": 2507,
-    "link": "https://leetcode.com/problems/smallest-value-after-replacing-with-sum-of-prime-factors/",
-    "title": "Smallest Value After Replacing With Sum of Prime Factors"
+    "link": "https://leetcode.com/problems/smallest-value-after-replacing-with-sum-of-prime-factors/"
   },
   "2508": {
+    "id": 2508,
     "category": "Graph Traversal",
+    "title": "Add Edges to Make Degrees of All Nodes Even",
     "difficulty": "Hard",
-    "id": 2508,
-    "link": "https://leetcode.com/problems/add-edges-to-make-degrees-of-all-nodes-even/",
-    "title": "Add Edges to Make Degrees of All Nodes Even"
+    "link": "https://leetcode.com/problems/add-edges-to-make-degrees-of-all-nodes-even/"
   },
   "2509": {
+    "id": 2509,
     "category": "Tree",
+    "title": "Cycle Length Queries in a Tree",
     "difficulty": "Hard",
-    "id": 2509,
-    "link": "https://leetcode.com/problems/cycle-length-queries-in-a-tree/",
-    "title": "Cycle Length Queries in a Tree"
+    "link": "https://leetcode.com/problems/cycle-length-queries-in-a-tree/"
   },
   "2510": {
+    "id": 2510,
     "category": "Dynamic Programming",
+    "title": "Check if There is a Path With Equal Number of 0's And 1's",
     "difficulty": "Medium",
-    "id": 2510,
-    "link": "https://leetcode.com/problems/check-if-there-is-a-path-with-equal-number-of-0s-and-1s/",
-    "title": "Check if There is a Path With Equal Number of 0's And 1's"
+    "link": "https://leetcode.com/problems/check-if-there-is-a-path-with-equal-number-of-0s-and-1s/"
   },
   "2511": {
+    "id": 2511,
     "category": "Two Pointers",
+    "title": "Maximum Enemy Forts That Can Be Captured",
     "difficulty": "Easy",
-    "id": 2511,
-    "link": "https://leetcode.com/problems/maximum-enemy-forts-that-can-be-captured/",
-    "title": "Maximum Enemy Forts That Can Be Captured"
+    "link": "https://leetcode.com/problems/maximum-enemy-forts-that-can-be-captured/"
   },
   "2512": {
+    "id": 2512,
     "category": "Heap (Priority Queue)",
+    "title": "Reward Top K Students",
     "difficulty": "Medium",
-    "id": 2512,
-    "link": "https://leetcode.com/problems/reward-top-k-students/",
-    "title": "Reward Top K Students"
+    "link": "https://leetcode.com/problems/reward-top-k-students/"
   },
   "2513": {
+    "id": 2513,
     "category": "Binary Search",
+    "title": "Minimize the Maximum of Two Arrays",
     "difficulty": "Medium",
-    "id": 2513,
-    "link": "https://leetcode.com/problems/minimize-the-maximum-of-two-arrays/",
-    "title": "Minimize the Maximum of Two Arrays"
+    "link": "https://leetcode.com/problems/minimize-the-maximum-of-two-arrays/"
   },
   "2514": {
+    "id": 2514,
     "category": "Math & Geometry",
+    "title": "Count Anagrams",
     "difficulty": "Hard",
-    "id": 2514,
-    "link": "https://leetcode.com/problems/count-anagrams/",
-    "title": "Count Anagrams"
+    "link": "https://leetcode.com/problems/count-anagrams/"
   },
   "2515": {
+    "id": 2515,
     "category": "Array & Hashing",
+    "title": "Shortest Distance to Target String in a Circular Array",
     "difficulty": "Easy",
-    "id": 2515,
-    "link": "https://leetcode.com/problems/shortest-distance-to-target-string-in-a-circular-array/",
-    "title": "Shortest Distance to Target String in a Circular Array"
+    "link": "https://leetcode.com/problems/shortest-distance-to-target-string-in-a-circular-array/"
   },
   "2516": {
+    "id": 2516,
     "category": "Sliding Window",
+    "title": "Take K of Each Character From Left and Right",
     "difficulty": "Medium",
-    "id": 2516,
-    "link": "https://leetcode.com/problems/take-k-of-each-character-from-left-and-right/",
-    "title": "Take K of Each Character From Left and Right"
+    "link": "https://leetcode.com/problems/take-k-of-each-character-from-left-and-right/"
   },
   "2517": {
+    "id": 2517,
     "category": "Binary Search",
+    "title": "Maximum Tastiness of Candy Basket",
     "difficulty": "Medium",
-    "id": 2517,
-    "link": "https://leetcode.com/problems/maximum-tastiness-of-candy-basket/",
-    "title": "Maximum Tastiness of Candy Basket"
+    "link": "https://leetcode.com/problems/maximum-tastiness-of-candy-basket/"
   },
   "2518": {
+    "id": 2518,
     "category": "Dynamic Programming",
+    "title": "Number of Great Partitions",
     "difficulty": "Hard",
-    "id": 2518,
-    "link": "https://leetcode.com/problems/number-of-great-partitions/",
-    "title": "Number of Great Partitions"
+    "link": "https://leetcode.com/problems/number-of-great-partitions/"
   },
   "2519": {
+    "id": 2519,
     "category": "Tree",
+    "title": "Count the Number of K-Big Indices",
     "difficulty": "Hard",
-    "id": 2519,
-    "link": "https://leetcode.com/problems/count-the-number-of-k-big-indices/",
-    "title": "Count the Number of K-Big Indices"
+    "link": "https://leetcode.com/problems/count-the-number-of-k-big-indices/"
   },
   "2520": {
+    "id": 2520,
     "category": "Math & Geometry",
+    "title": "Count the Digits That Divide a Number",
     "difficulty": "Easy",
-    "id": 2520,
-    "link": "https://leetcode.com/problems/count-the-digits-that-divide-a-number/",
-    "title": "Count the Digits That Divide a Number"
+    "link": "https://leetcode.com/problems/count-the-digits-that-divide-a-number/"
   },
   "2521": {
+    "id": 2521,
     "category": "Math & Geometry",
+    "title": "Distinct Prime Factors of Product of Array",
     "difficulty": "Medium",
-    "id": 2521,
-    "link": "https://leetcode.com/problems/distinct-prime-factors-of-product-of-array/",
-    "title": "Distinct Prime Factors of Product of Array"
+    "link": "https://leetcode.com/problems/distinct-prime-factors-of-product-of-array/"
   },
   "2522": {
+    "id": 2522,
     "category": "Dynamic Programming",
+    "title": "Partition String Into Substrings With Values at Most K",
     "difficulty": "Medium",
-    "id": 2522,
-    "link": "https://leetcode.com/problems/partition-string-into-substrings-with-values-at-most-k/",
-    "title": "Partition String Into Substrings With Values at Most K"
+    "link": "https://leetcode.com/problems/partition-string-into-substrings-with-values-at-most-k/"
   },
   "2523": {
+    "id": 2523,
     "category": "Math & Geometry",
+    "title": "Closest Prime Numbers in Range",
     "difficulty": "Medium",
-    "id": 2523,
-    "link": "https://leetcode.com/problems/closest-prime-numbers-in-range/",
-    "title": "Closest Prime Numbers in Range"
+    "link": "https://leetcode.com/problems/closest-prime-numbers-in-range/"
   },
   "2524": {
+    "id": 2524,
     "category": "Sliding Window",
+    "title": "Maximum Frequency Score of a Subarray",
     "difficulty": "Hard",
-    "id": 2524,
-    "link": "https://leetcode.com/problems/maximum-frequency-score-of-a-subarray/",
-    "title": "Maximum Frequency Score of a Subarray"
+    "link": "https://leetcode.com/problems/maximum-frequency-score-of-a-subarray/"
   },
   "2525": {
+    "id": 2525,
     "category": "Math & Geometry",
+    "title": "Categorize Box According to Criteria",
     "difficulty": "Easy",
-    "id": 2525,
-    "link": "https://leetcode.com/problems/categorize-box-according-to-criteria/",
-    "title": "Categorize Box According to Criteria"
+    "link": "https://leetcode.com/problems/categorize-box-according-to-criteria/"
   },
   "2526": {
+    "id": 2526,
     "category": "Array & Hashing",
+    "title": "Find Consecutive Integers from a Data Stream",
     "difficulty": "Medium",
-    "id": 2526,
-    "link": "https://leetcode.com/problems/find-consecutive-integers-from-a-data-stream/",
-    "title": "Find Consecutive Integers from a Data Stream"
+    "link": "https://leetcode.com/problems/find-consecutive-integers-from-a-data-stream/"
   },
   "2527": {
+    "id": 2527,
     "category": "Bit Manipulation",
+    "title": "Find Xor-Beauty of Array",
     "difficulty": "Medium",
-    "id": 2527,
-    "link": "https://leetcode.com/problems/find-xor-beauty-of-array/",
-    "title": "Find Xor-Beauty of Array"
+    "link": "https://leetcode.com/problems/find-xor-beauty-of-array/"
   },
   "2528": {
+    "id": 2528,
     "category": "Sliding Window",
+    "title": "Maximize the Minimum Powered City",
     "difficulty": "Hard",
-    "id": 2528,
-    "link": "https://leetcode.com/problems/maximize-the-minimum-powered-city/",
-    "title": "Maximize the Minimum Powered City"
+    "link": "https://leetcode.com/problems/maximize-the-minimum-powered-city/"
   },
   "2529": {
+    "id": 2529,
     "category": "Binary Search",
+    "title": "Maximum Count of Positive Integer and Negative Integer",
     "difficulty": "Easy",
-    "id": 2529,
-    "link": "https://leetcode.com/problems/maximum-count-of-positive-integer-and-negative-integer/",
-    "title": "Maximum Count of Positive Integer and Negative Integer"
+    "link": "https://leetcode.com/problems/maximum-count-of-positive-integer-and-negative-integer/"
   },
   "2530": {
+    "id": 2530,
     "category": "Heap (Priority Queue)",
+    "title": "Maximal Score After Applying K Operations",
     "difficulty": "Medium",
-    "id": 2530,
-    "link": "https://leetcode.com/problems/maximal-score-after-applying-k-operations/",
-    "title": "Maximal Score After Applying K Operations"
+    "link": "https://leetcode.com/problems/maximal-score-after-applying-k-operations/"
   },
   "2531": {
+    "id": 2531,
     "category": "Array & Hashing",
+    "title": "Make Number of Distinct Characters Equal",
     "difficulty": "Medium",
-    "id": 2531,
-    "link": "https://leetcode.com/problems/make-number-of-distinct-characters-equal/",
-    "title": "Make Number of Distinct Characters Equal"
+    "link": "https://leetcode.com/problems/make-number-of-distinct-characters-equal/"
   },
   "2532": {
+    "id": 2532,
     "category": "Heap (Priority Queue)",
+    "title": "Time to Cross a Bridge",
     "difficulty": "Hard",
-    "id": 2532,
-    "link": "https://leetcode.com/problems/time-to-cross-a-bridge/",
-    "title": "Time to Cross a Bridge"
+    "link": "https://leetcode.com/problems/time-to-cross-a-bridge/"
   },
   "2533": {
+    "id": 2533,
     "category": "Dynamic Programming",
+    "title": "Number of Good Binary Strings",
     "difficulty": "Medium",
-    "id": 2533,
-    "link": "https://leetcode.com/problems/number-of-good-binary-strings/",
-    "title": "Number of Good Binary Strings"
+    "link": "https://leetcode.com/problems/number-of-good-binary-strings/"
   },
   "2534": {
+    "id": 2534,
     "category": "Array & Hashing",
+    "title": "Time Taken to Cross the Door",
     "difficulty": "Hard",
-    "id": 2534,
-    "link": "https://leetcode.com/problems/time-taken-to-cross-the-door/",
-    "title": "Time Taken to Cross the Door"
+    "link": "https://leetcode.com/problems/time-taken-to-cross-the-door/"
   },
   "2535": {
+    "id": 2535,
     "category": "Math & Geometry",
+    "title": "Difference Between Element Sum and Digit Sum of an Array",
     "difficulty": "Easy",
-    "id": 2535,
-    "link": "https://leetcode.com/problems/difference-between-element-sum-and-digit-sum-of-an-array/",
-    "title": "Difference Between Element Sum and Digit Sum of an Array"
+    "link": "https://leetcode.com/problems/difference-between-element-sum-and-digit-sum-of-an-array/"
   },
   "2536": {
+    "id": 2536,
     "category": "Array & Hashing",
+    "title": "Increment Submatrices by One",
     "difficulty": "Medium",
-    "id": 2536,
-    "link": "https://leetcode.com/problems/increment-submatrices-by-one/",
-    "title": "Increment Submatrices by One"
+    "link": "https://leetcode.com/problems/increment-submatrices-by-one/"
   },
   "2537": {
+    "id": 2537,
     "category": "Sliding Window",
+    "title": "Count the Number of Good Subarrays",
     "difficulty": "Medium",
-    "id": 2537,
-    "link": "https://leetcode.com/problems/count-the-number-of-good-subarrays/",
-    "title": "Count the Number of Good Subarrays"
+    "link": "https://leetcode.com/problems/count-the-number-of-good-subarrays/"
   },
   "2538": {
+    "id": 2538,
     "category": "Tree",
+    "title": "Difference Between Maximum and Minimum Price Sum",
     "difficulty": "Hard",
-    "id": 2538,
-    "link": "https://leetcode.com/problems/difference-between-maximum-and-minimum-price-sum/",
-    "title": "Difference Between Maximum and Minimum Price Sum"
+    "link": "https://leetcode.com/problems/difference-between-maximum-and-minimum-price-sum/"
   },
   "2539": {
+    "id": 2539,
     "category": "Math & Geometry",
+    "title": "Count the Number of Good Subsequences",
     "difficulty": "Medium",
-    "id": 2539,
-    "link": "https://leetcode.com/problems/count-the-number-of-good-subsequences/",
-    "title": "Count the Number of Good Subsequences"
+    "link": "https://leetcode.com/problems/count-the-number-of-good-subsequences/"
   },
   "2540": {
+    "id": 2540,
     "category": "Binary Search",
+    "title": "Minimum Common Value",
     "difficulty": "Easy",
-    "id": 2540,
-    "link": "https://leetcode.com/problems/minimum-common-value/",
-    "title": "Minimum Common Value"
+    "link": "https://leetcode.com/problems/minimum-common-value/"
   },
   "2541": {
+    "id": 2541,
     "category": "Greedy",
+    "title": "Minimum Operations to Make Array Equal II",
     "difficulty": "Medium",
-    "id": 2541,
-    "link": "https://leetcode.com/problems/minimum-operations-to-make-array-equal-ii/",
-    "title": "Minimum Operations to Make Array Equal II"
+    "link": "https://leetcode.com/problems/minimum-operations-to-make-array-equal-ii/"
   },
   "2542": {
+    "id": 2542,
     "category": "Heap (Priority Queue)",
+    "title": "Maximum Subsequence Score",
     "difficulty": "Medium",
-    "id": 2542,
-    "link": "https://leetcode.com/problems/maximum-subsequence-score/",
-    "title": "Maximum Subsequence Score"
+    "link": "https://leetcode.com/problems/maximum-subsequence-score/"
   },
   "2543": {
+    "id": 2543,
     "category": "Math & Geometry",
+    "title": "Check if Point Is Reachable",
     "difficulty": "Hard",
-    "id": 2543,
-    "link": "https://leetcode.com/problems/check-if-point-is-reachable/",
-    "title": "Check if Point Is Reachable"
+    "link": "https://leetcode.com/problems/check-if-point-is-reachable/"
   },
   "2544": {
+    "id": 2544,
     "category": "Math & Geometry",
+    "title": "Alternating Digit Sum",
     "difficulty": "Easy",
-    "id": 2544,
-    "link": "https://leetcode.com/problems/alternating-digit-sum/",
-    "title": "Alternating Digit Sum"
+    "link": "https://leetcode.com/problems/alternating-digit-sum/"
   },
   "2545": {
+    "id": 2545,
     "category": "Array & Hashing",
+    "title": "Sort the Students by Their Kth Score",
     "difficulty": "Medium",
-    "id": 2545,
-    "link": "https://leetcode.com/problems/sort-the-students-by-their-kth-score/",
-    "title": "Sort the Students by Their Kth Score"
+    "link": "https://leetcode.com/problems/sort-the-students-by-their-kth-score/"
   },
   "2546": {
+    "id": 2546,
     "category": "Bit Manipulation",
+    "title": "Apply Bitwise Operations to Make Strings Equal",
     "difficulty": "Medium",
-    "id": 2546,
-    "link": "https://leetcode.com/problems/apply-bitwise-operations-to-make-strings-equal/",
-    "title": "Apply Bitwise Operations to Make Strings Equal"
+    "link": "https://leetcode.com/problems/apply-bitwise-operations-to-make-strings-equal/"
   },
   "2547": {
+    "id": 2547,
     "category": "Dynamic Programming",
+    "title": "Minimum Cost to Split an Array",
     "difficulty": "Hard",
-    "id": 2547,
-    "link": "https://leetcode.com/problems/minimum-cost-to-split-an-array/",
-    "title": "Minimum Cost to Split an Array"
+    "link": "https://leetcode.com/problems/minimum-cost-to-split-an-array/"
   },
   "2548": {
+    "id": 2548,
     "category": "Greedy",
+    "title": "Maximum Price to Fill a Bag",
     "difficulty": "Medium",
-    "id": 2548,
-    "link": "https://leetcode.com/problems/maximum-price-to-fill-a-bag/",
-    "title": "Maximum Price to Fill a Bag"
+    "link": "https://leetcode.com/problems/maximum-price-to-fill-a-bag/"
   },
   "2549": {
+    "id": 2549,
     "category": "Math & Geometry",
+    "title": "Count Distinct Numbers on Board",
     "difficulty": "Easy",
-    "id": 2549,
-    "link": "https://leetcode.com/problems/count-distinct-numbers-on-board/",
-    "title": "Count Distinct Numbers on Board"
+    "link": "https://leetcode.com/problems/count-distinct-numbers-on-board/"
   },
   "2550": {
+    "id": 2550,
     "category": "Math & Geometry",
+    "title": "Count Collisions of Monkeys on a Polygon",
     "difficulty": "Medium",
-    "id": 2550,
-    "link": "https://leetcode.com/problems/count-collisions-of-monkeys-on-a-polygon/",
-    "title": "Count Collisions of Monkeys on a Polygon"
+    "link": "https://leetcode.com/problems/count-collisions-of-monkeys-on-a-polygon/"
   },
   "2551": {
+    "id": 2551,
     "category": "Heap (Priority Queue)",
+    "title": "Put Marbles in Bags",
     "difficulty": "Hard",
-    "id": 2551,
-    "link": "https://leetcode.com/problems/put-marbles-in-bags/",
-    "title": "Put Marbles in Bags"
+    "link": "https://leetcode.com/problems/put-marbles-in-bags/"
   },
   "2552": {
+    "id": 2552,
     "category": "Tree",
+    "title": "Count Increasing Quadruplets",
     "difficulty": "Hard",
-    "id": 2552,
-    "link": "https://leetcode.com/problems/count-increasing-quadruplets/",
-    "title": "Count Increasing Quadruplets"
+    "link": "https://leetcode.com/problems/count-increasing-quadruplets/"
   },
   "2553": {
+    "id": 2553,
     "category": "Array & Hashing",
+    "title": "Separate the Digits in an Array",
     "difficulty": "Easy",
-    "id": 2553,
-    "link": "https://leetcode.com/problems/separate-the-digits-in-an-array/",
-    "title": "Separate the Digits in an Array"
+    "link": "https://leetcode.com/problems/separate-the-digits-in-an-array/"
   },
   "2554": {
+    "id": 2554,
     "category": "Binary Search",
+    "title": "Maximum Number of Integers to Choose From a Range I",
     "difficulty": "Medium",
-    "id": 2554,
-    "link": "https://leetcode.com/problems/maximum-number-of-integers-to-choose-from-a-range-i/",
-    "title": "Maximum Number of Integers to Choose From a Range I"
+    "link": "https://leetcode.com/problems/maximum-number-of-integers-to-choose-from-a-range-i/"
   },
   "2555": {
+    "id": 2555,
     "category": "Sliding Window",
+    "title": "Maximize Win From Two Segments",
     "difficulty": "Medium",
-    "id": 2555,
-    "link": "https://leetcode.com/problems/maximize-win-from-two-segments/",
-    "title": "Maximize Win From Two Segments"
+    "link": "https://leetcode.com/problems/maximize-win-from-two-segments/"
   },
   "2556": {
+    "id": 2556,
     "category": "Graph Traversal",
+    "title": "Disconnect Path in a Binary Matrix by at Most One Flip",
     "difficulty": "Medium",
-    "id": 2556,
-    "link": "https://leetcode.com/problems/disconnect-path-in-a-binary-matrix-by-at-most-one-flip/",
-    "title": "Disconnect Path in a Binary Matrix by at Most One Flip"
+    "link": "https://leetcode.com/problems/disconnect-path-in-a-binary-matrix-by-at-most-one-flip/"
   },
   "2557": {
+    "id": 2557,
     "category": "Binary Search",
+    "title": "Maximum Number of Integers to Choose From a Range II",
     "difficulty": "Medium",
-    "id": 2557,
-    "link": "https://leetcode.com/problems/maximum-number-of-integers-to-choose-from-a-range-ii/",
-    "title": "Maximum Number of Integers to Choose From a Range II"
+    "link": "https://leetcode.com/problems/maximum-number-of-integers-to-choose-from-a-range-ii/"
   },
   "2558": {
+    "id": 2558,
     "category": "Heap (Priority Queue)",
+    "title": "Take Gifts From the Richest Pile",
     "difficulty": "Easy",
-    "id": 2558,
-    "link": "https://leetcode.com/problems/take-gifts-from-the-richest-pile/",
-    "title": "Take Gifts From the Richest Pile"
+    "link": "https://leetcode.com/problems/take-gifts-from-the-richest-pile/"
   },
   "2559": {
+    "id": 2559,
     "category": "Array & Hashing",
+    "title": "Count Vowel Strings in Ranges",
     "difficulty": "Medium",
-    "id": 2559,
-    "link": "https://leetcode.com/problems/count-vowel-strings-in-ranges/",
-    "title": "Count Vowel Strings in Ranges"
+    "link": "https://leetcode.com/problems/count-vowel-strings-in-ranges/"
   },
   "2560": {
+    "id": 2560,
     "category": "Dynamic Programming",
+    "title": "House Robber IV",
     "difficulty": "Medium",
-    "id": 2560,
-    "link": "https://leetcode.com/problems/house-robber-iv/",
-    "title": "House Robber IV"
+    "link": "https://leetcode.com/problems/house-robber-iv/"
   },
   "2561": {
+    "id": 2561,
     "category": "Greedy",
+    "title": "Rearranging Fruits",
     "difficulty": "Hard",
-    "id": 2561,
-    "link": "https://leetcode.com/problems/rearranging-fruits/",
-    "title": "Rearranging Fruits"
+    "link": "https://leetcode.com/problems/rearranging-fruits/"
   },
   "2562": {
+    "id": 2562,
     "category": "Two Pointers",
+    "title": "Find the Array Concatenation Value",
     "difficulty": "Easy",
-    "id": 2562,
-    "link": "https://leetcode.com/problems/find-the-array-concatenation-value/",
-    "title": "Find the Array Concatenation Value"
+    "link": "https://leetcode.com/problems/find-the-array-concatenation-value/"
   },
   "2563": {
+    "id": 2563,
     "category": "Binary Search",
+    "title": "Count the Number of Fair Pairs",
     "difficulty": "Medium",
-    "id": 2563,
-    "link": "https://leetcode.com/problems/count-the-number-of-fair-pairs/",
-    "title": "Count the Number of Fair Pairs"
+    "link": "https://leetcode.com/problems/count-the-number-of-fair-pairs/"
   },
   "2564": {
+    "id": 2564,
     "category": "Bit Manipulation",
+    "title": "Substring XOR Queries",
     "difficulty": "Medium",
-    "id": 2564,
-    "link": "https://leetcode.com/problems/substring-xor-queries/",
-    "title": "Substring XOR Queries"
+    "link": "https://leetcode.com/problems/substring-xor-queries/"
   },
   "2565": {
+    "id": 2565,
     "category": "Binary Search",
+    "title": "Subsequence With the Minimum Score",
     "difficulty": "Hard",
-    "id": 2565,
-    "link": "https://leetcode.com/problems/subsequence-with-the-minimum-score/",
-    "title": "Subsequence With the Minimum Score"
+    "link": "https://leetcode.com/problems/subsequence-with-the-minimum-score/"
   },
   "2566": {
+    "id": 2566,
     "category": "Greedy",
+    "title": "Maximum Difference by Remapping a Digit",
     "difficulty": "Easy",
-    "id": 2566,
-    "link": "https://leetcode.com/problems/maximum-difference-by-remapping-a-digit/",
-    "title": "Maximum Difference by Remapping a Digit"
+    "link": "https://leetcode.com/problems/maximum-difference-by-remapping-a-digit/"
   },
   "2567": {
+    "id": 2567,
     "category": "Greedy",
+    "title": "Minimum Score by Changing Two Elements",
     "difficulty": "Medium",
-    "id": 2567,
-    "link": "https://leetcode.com/problems/minimum-score-by-changing-two-elements/",
-    "title": "Minimum Score by Changing Two Elements"
+    "link": "https://leetcode.com/problems/minimum-score-by-changing-two-elements/"
   },
   "2568": {
+    "id": 2568,
     "category": "Bit Manipulation",
+    "title": "Minimum Impossible OR",
     "difficulty": "Medium",
-    "id": 2568,
-    "link": "https://leetcode.com/problems/minimum-impossible-or/",
-    "title": "Minimum Impossible OR"
+    "link": "https://leetcode.com/problems/minimum-impossible-or/"
   },
   "2569": {
+    "id": 2569,
     "category": "Tree",
+    "title": "Handling Sum Queries After Update",
     "difficulty": "Hard",
-    "id": 2569,
-    "link": "https://leetcode.com/problems/handling-sum-queries-after-update/",
-    "title": "Handling Sum Queries After Update"
+    "link": "https://leetcode.com/problems/handling-sum-queries-after-update/"
   },
   "2570": {
+    "id": 2570,
     "category": "Two Pointers",
+    "title": "Merge Two 2D Arrays by Summing Values",
     "difficulty": "Easy",
-    "id": 2570,
-    "link": "https://leetcode.com/problems/merge-two-2d-arrays-by-summing-values/",
-    "title": "Merge Two 2D Arrays by Summing Values"
+    "link": "https://leetcode.com/problems/merge-two-2d-arrays-by-summing-values/"
   },
   "2571": {
+    "id": 2571,
     "category": "Dynamic Programming",
+    "title": "Minimum Operations to Reduce an Integer to 0",
     "difficulty": "Medium",
-    "id": 2571,
-    "link": "https://leetcode.com/problems/minimum-operations-to-reduce-an-integer-to-0/",
-    "title": "Minimum Operations to Reduce an Integer to 0"
+    "link": "https://leetcode.com/problems/minimum-operations-to-reduce-an-integer-to-0/"
   },
   "2572": {
+    "id": 2572,
     "category": "Dynamic Programming",
+    "title": "Count the Number of Square-Free Subsets",
     "difficulty": "Medium",
-    "id": 2572,
-    "link": "https://leetcode.com/problems/count-the-number-of-square-free-subsets/",
-    "title": "Count the Number of Square-Free Subsets"
+    "link": "https://leetcode.com/problems/count-the-number-of-square-free-subsets/"
   },
   "2573": {
+    "id": 2573,
     "category": "Graph Traversal",
+    "title": "Find the String with LCP",
     "difficulty": "Hard",
-    "id": 2573,
-    "link": "https://leetcode.com/problems/find-the-string-with-lcp/",
-    "title": "Find the String with LCP"
+    "link": "https://leetcode.com/problems/find-the-string-with-lcp/"
   },
   "2574": {
+    "id": 2574,
     "category": "Array & Hashing",
+    "title": "Left and Right Sum Differences",
     "difficulty": "Easy",
-    "id": 2574,
-    "link": "https://leetcode.com/problems/left-and-right-sum-differences/",
-    "title": "Left and Right Sum Differences"
+    "link": "https://leetcode.com/problems/left-and-right-sum-differences/"
   },
   "2575": {
+    "id": 2575,
     "category": "Math & Geometry",
+    "title": "Find the Divisibility Array of a String",
     "difficulty": "Medium",
-    "id": 2575,
-    "link": "https://leetcode.com/problems/find-the-divisibility-array-of-a-string/",
-    "title": "Find the Divisibility Array of a String"
+    "link": "https://leetcode.com/problems/find-the-divisibility-array-of-a-string/"
   },
   "2576": {
+    "id": 2576,
     "category": "Binary Search",
+    "title": "Find the Maximum Number of Marked Indices",
     "difficulty": "Medium",
-    "id": 2576,
-    "link": "https://leetcode.com/problems/find-the-maximum-number-of-marked-indices/",
-    "title": "Find the Maximum Number of Marked Indices"
+    "link": "https://leetcode.com/problems/find-the-maximum-number-of-marked-indices/"
   },
   "2577": {
+    "id": 2577,
     "category": "Graph Traversal",
+    "title": "Minimum Time to Visit a Cell In a Grid",
     "difficulty": "Hard",
-    "id": 2577,
-    "link": "https://leetcode.com/problems/minimum-time-to-visit-a-cell-in-a-grid/",
-    "title": "Minimum Time to Visit a Cell In a Grid"
+    "link": "https://leetcode.com/problems/minimum-time-to-visit-a-cell-in-a-grid/"
   },
   "2578": {
+    "id": 2578,
     "category": "Greedy",
+    "title": "Split With Minimum Sum",
     "difficulty": "Easy",
-    "id": 2578,
-    "link": "https://leetcode.com/problems/split-with-minimum-sum/",
-    "title": "Split With Minimum Sum"
+    "link": "https://leetcode.com/problems/split-with-minimum-sum/"
   },
   "2579": {
+    "id": 2579,
     "category": "Math & Geometry",
+    "title": "Count Total Number of Colored Cells",
     "difficulty": "Medium",
-    "id": 2579,
-    "link": "https://leetcode.com/problems/count-total-number-of-colored-cells/",
-    "title": "Count Total Number of Colored Cells"
+    "link": "https://leetcode.com/problems/count-total-number-of-colored-cells/"
   },
   "2580": {
+    "id": 2580,
     "category": "Array & Hashing",
+    "title": "Count Ways to Group Overlapping Ranges",
     "difficulty": "Medium",
-    "id": 2580,
-    "link": "https://leetcode.com/problems/count-ways-to-group-overlapping-ranges/",
-    "title": "Count Ways to Group Overlapping Ranges"
+    "link": "https://leetcode.com/problems/count-ways-to-group-overlapping-ranges/"
   },
   "2581": {
+    "id": 2581,
     "category": "Tree",
+    "title": "Count Number of Possible Root Nodes",
     "difficulty": "Hard",
-    "id": 2581,
-    "link": "https://leetcode.com/problems/count-number-of-possible-root-nodes/",
-    "title": "Count Number of Possible Root Nodes"
+    "link": "https://leetcode.com/problems/count-number-of-possible-root-nodes/"
   },
   "2582": {
+    "id": 2582,
     "category": "Math & Geometry",
+    "title": "Pass the Pillow",
     "difficulty": "Easy",
-    "id": 2582,
-    "link": "https://leetcode.com/problems/pass-the-pillow/",
-    "title": "Pass the Pillow"
+    "link": "https://leetcode.com/problems/pass-the-pillow/"
   },
   "2583": {
+    "id": 2583,
     "category": "Tree",
+    "title": "Kth Largest Sum in a Binary Tree",
     "difficulty": "Medium",
-    "id": 2583,
-    "link": "https://leetcode.com/problems/kth-largest-sum-in-a-binary-tree/",
-    "title": "Kth Largest Sum in a Binary Tree"
+    "link": "https://leetcode.com/problems/kth-largest-sum-in-a-binary-tree/"
   },
   "2584": {
+    "id": 2584,
     "category": "Math & Geometry",
+    "title": "Split the Array to Make Coprime Products",
     "difficulty": "Hard",
-    "id": 2584,
-    "link": "https://leetcode.com/problems/split-the-array-to-make-coprime-products/",
-    "title": "Split the Array to Make Coprime Products"
+    "link": "https://leetcode.com/problems/split-the-array-to-make-coprime-products/"
   },
   "2585": {
+    "id": 2585,
     "category": "Dynamic Programming",
+    "title": "Number of Ways to Earn Points",
     "difficulty": "Hard",
-    "id": 2585,
-    "link": "https://leetcode.com/problems/number-of-ways-to-earn-points/",
-    "title": "Number of Ways to Earn Points"
+    "link": "https://leetcode.com/problems/number-of-ways-to-earn-points/"
   },
   "2586": {
+    "id": 2586,
     "category": "Array & Hashing",
+    "title": "Count the Number of Vowel Strings in Range",
     "difficulty": "Easy",
-    "id": 2586,
-    "link": "https://leetcode.com/problems/count-the-number-of-vowel-strings-in-range/",
-    "title": "Count the Number of Vowel Strings in Range"
+    "link": "https://leetcode.com/problems/count-the-number-of-vowel-strings-in-range/"
   },
   "2587": {
+    "id": 2587,
     "category": "Greedy",
+    "title": "Rearrange Array to Maximize Prefix Score",
     "difficulty": "Medium",
-    "id": 2587,
-    "link": "https://leetcode.com/problems/rearrange-array-to-maximize-prefix-score/",
-    "title": "Rearrange Array to Maximize Prefix Score"
+    "link": "https://leetcode.com/problems/rearrange-array-to-maximize-prefix-score/"
   },
   "2588": {
+    "id": 2588,
     "category": "Bit Manipulation",
+    "title": "Count the Number of Beautiful Subarrays",
     "difficulty": "Medium",
-    "id": 2588,
-    "link": "https://leetcode.com/problems/count-the-number-of-beautiful-subarrays/",
-    "title": "Count the Number of Beautiful Subarrays"
+    "link": "https://leetcode.com/problems/count-the-number-of-beautiful-subarrays/"
   },
   "2589": {
+    "id": 2589,
     "category": "Binary Search",
+    "title": "Minimum Time to Complete All Tasks",
     "difficulty": "Hard",
-    "id": 2589,
-    "link": "https://leetcode.com/problems/minimum-time-to-complete-all-tasks/",
-    "title": "Minimum Time to Complete All Tasks"
+    "link": "https://leetcode.com/problems/minimum-time-to-complete-all-tasks/"
   },
   "2590": {
+    "id": 2590,
     "category": "Array & Hashing",
+    "title": "Design a Todo List",
     "difficulty": "Medium",
-    "id": 2590,
-    "link": "https://leetcode.com/problems/design-a-todo-list/",
-    "title": "Design a Todo List"
+    "link": "https://leetcode.com/problems/design-a-todo-list/"
   },
   "2591": {
+    "id": 2591,
     "category": "Greedy",
+    "title": "Distribute Money to Maximum Children",
     "difficulty": "Easy",
-    "id": 2591,
-    "link": "https://leetcode.com/problems/distribute-money-to-maximum-children/",
-    "title": "Distribute Money to Maximum Children"
+    "link": "https://leetcode.com/problems/distribute-money-to-maximum-children/"
   },
   "2592": {
+    "id": 2592,
     "category": "Greedy",
+    "title": "Maximize Greatness of an Array",
     "difficulty": "Medium",
-    "id": 2592,
-    "link": "https://leetcode.com/problems/maximize-greatness-of-an-array/",
-    "title": "Maximize Greatness of an Array"
+    "link": "https://leetcode.com/problems/maximize-greatness-of-an-array/"
   },
   "2593": {
+    "id": 2593,
     "category": "Heap (Priority Queue)",
+    "title": "Find Score of an Array After Marking All Elements",
     "difficulty": "Medium",
-    "id": 2593,
-    "link": "https://leetcode.com/problems/find-score-of-an-array-after-marking-all-elements/",
-    "title": "Find Score of an Array After Marking All Elements"
+    "link": "https://leetcode.com/problems/find-score-of-an-array-after-marking-all-elements/"
   },
   "2594": {
+    "id": 2594,
     "category": "Binary Search",
+    "title": "Minimum Time to Repair Cars",
     "difficulty": "Medium",
-    "id": 2594,
-    "link": "https://leetcode.com/problems/minimum-time-to-repair-cars/",
-    "title": "Minimum Time to Repair Cars"
+    "link": "https://leetcode.com/problems/minimum-time-to-repair-cars/"
   },
   "2595": {
+    "id": 2595,
     "category": "Bit Manipulation",
+    "title": "Number of Even and Odd Bits",
     "difficulty": "Easy",
-    "id": 2595,
-    "link": "https://leetcode.com/problems/number-of-even-and-odd-bits/",
-    "title": "Number of Even and Odd Bits"
+    "link": "https://leetcode.com/problems/number-of-even-and-odd-bits/"
   },
   "2596": {
+    "id": 2596,
     "category": "Graph Traversal",
+    "title": "Check Knight Tour Configuration",
     "difficulty": "Medium",
-    "id": 2596,
-    "link": "https://leetcode.com/problems/check-knight-tour-configuration/",
-    "title": "Check Knight Tour Configuration"
+    "link": "https://leetcode.com/problems/check-knight-tour-configuration/"
   },
   "2597": {
+    "id": 2597,
     "category": "Dynamic Programming",
+    "title": "The Number of Beautiful Subsets",
     "difficulty": "Medium",
-    "id": 2597,
-    "link": "https://leetcode.com/problems/the-number-of-beautiful-subsets/",
-    "title": "The Number of Beautiful Subsets"
+    "link": "https://leetcode.com/problems/the-number-of-beautiful-subsets/"
   },
   "2598": {
+    "id": 2598,
     "category": "Greedy",
+    "title": "Smallest Missing Non-negative Integer After Operations",
     "difficulty": "Medium",
-    "id": 2598,
-    "link": "https://leetcode.com/problems/smallest-missing-non-negative-integer-after-operations/",
-    "title": "Smallest Missing Non-negative Integer After Operations"
+    "link": "https://leetcode.com/problems/smallest-missing-non-negative-integer-after-operations/"
   },
   "2599": {
+    "id": 2599,
     "category": "Heap (Priority Queue)",
+    "title": "Make the Prefix Sum Non-negative",
     "difficulty": "Medium",
-    "id": 2599,
-    "link": "https://leetcode.com/problems/make-the-prefix-sum-non-negative/",
-    "title": "Make the Prefix Sum Non-negative"
+    "link": "https://leetcode.com/problems/make-the-prefix-sum-non-negative/"
   },
   "2600": {
+    "id": 2600,
     "category": "Greedy",
+    "title": "K Items With the Maximum Sum",
     "difficulty": "Easy",
-    "id": 2600,
-    "link": "https://leetcode.com/problems/k-items-with-the-maximum-sum/",
-    "title": "K Items With the Maximum Sum"
+    "link": "https://leetcode.com/problems/k-items-with-the-maximum-sum/"
   },
   "2601": {
+    "id": 2601,
     "category": "Binary Search",
+    "title": "Prime Subtraction Operation",
     "difficulty": "Medium",
-    "id": 2601,
-    "link": "https://leetcode.com/problems/prime-subtraction-operation/",
-    "title": "Prime Subtraction Operation"
+    "link": "https://leetcode.com/problems/prime-subtraction-operation/"
   },
   "2602": {
+    "id": 2602,
     "category": "Binary Search",
+    "title": "Minimum Operations to Make All Array Elements Equal",
     "difficulty": "Medium",
-    "id": 2602,
-    "link": "https://leetcode.com/problems/minimum-operations-to-make-all-array-elements-equal/",
-    "title": "Minimum Operations to Make All Array Elements Equal"
+    "link": "https://leetcode.com/problems/minimum-operations-to-make-all-array-elements-equal/"
   },
   "2603": {
+    "id": 2603,
     "category": "Tree",
+    "title": "Collect Coins in a Tree",
     "difficulty": "Hard",
-    "id": 2603,
-    "link": "https://leetcode.com/problems/collect-coins-in-a-tree/",
-    "title": "Collect Coins in a Tree"
+    "link": "https://leetcode.com/problems/collect-coins-in-a-tree/"
   },
   "2604": {
+    "id": 2604,
     "category": "Binary Search",
+    "title": "Minimum Time to Eat All Grains",
     "difficulty": "Hard",
-    "id": 2604,
-    "link": "https://leetcode.com/problems/minimum-time-to-eat-all-grains/",
-    "title": "Minimum Time to Eat All Grains"
+    "link": "https://leetcode.com/problems/minimum-time-to-eat-all-grains/"
   },
   "2605": {
+    "id": 2605,
     "category": "Array & Hashing",
+    "title": "Form Smallest Number From Two Digit Arrays",
     "difficulty": "Easy",
-    "id": 2605,
-    "link": "https://leetcode.com/problems/form-smallest-number-from-two-digit-arrays/",
-    "title": "Form Smallest Number From Two Digit Arrays"
+    "link": "https://leetcode.com/problems/form-smallest-number-from-two-digit-arrays/"
   },
   "2606": {
+    "id": 2606,
     "category": "Dynamic Programming",
+    "title": "Find the Substring With Maximum Cost",
     "difficulty": "Medium",
-    "id": 2606,
-    "link": "https://leetcode.com/problems/find-the-substring-with-maximum-cost/",
-    "title": "Find the Substring With Maximum Cost"
+    "link": "https://leetcode.com/problems/find-the-substring-with-maximum-cost/"
   },
   "2607": {
+    "id": 2607,
     "category": "Greedy",
+    "title": "Make K-Subarray Sums Equal",
     "difficulty": "Medium",
-    "id": 2607,
-    "link": "https://leetcode.com/problems/make-k-subarray-sums-equal/",
-    "title": "Make K-Subarray Sums Equal"
+    "link": "https://leetcode.com/problems/make-k-subarray-sums-equal/"
   },
   "2608": {
+    "id": 2608,
     "category": "Graph Traversal",
+    "title": "Shortest Cycle in a Graph",
     "difficulty": "Hard",
-    "id": 2608,
-    "link": "https://leetcode.com/problems/shortest-cycle-in-a-graph/",
-    "title": "Shortest Cycle in a Graph"
+    "link": "https://leetcode.com/problems/shortest-cycle-in-a-graph/"
   },
   "2609": {
+    "id": 2609,
     "category": "Array & Hashing",
+    "title": "Find the Longest Balanced Substring of a Binary String",
     "difficulty": "Easy",
-    "id": 2609,
-    "link": "https://leetcode.com/problems/find-the-longest-balanced-substring-of-a-binary-string/",
-    "title": "Find the Longest Balanced Substring of a Binary String"
+    "link": "https://leetcode.com/problems/find-the-longest-balanced-substring-of-a-binary-string/"
   },
   "2610": {
+    "id": 2610,
     "category": "Array & Hashing",
+    "title": "Convert an Array Into a 2D Array With Conditions",
     "difficulty": "Medium",
-    "id": 2610,
-    "link": "https://leetcode.com/problems/convert-an-array-into-a-2d-array-with-conditions/",
-    "title": "Convert an Array Into a 2D Array With Conditions"
+    "link": "https://leetcode.com/problems/convert-an-array-into-a-2d-array-with-conditions/"
   },
   "2611": {
+    "id": 2611,
     "category": "Heap (Priority Queue)",
+    "title": "Mice and Cheese",
     "difficulty": "Medium",
-    "id": 2611,
-    "link": "https://leetcode.com/problems/mice-and-cheese/",
-    "title": "Mice and Cheese"
+    "link": "https://leetcode.com/problems/mice-and-cheese/"
   },
   "2612": {
+    "id": 2612,
     "category": "Graph Traversal",
+    "title": "Minimum Reverse Operations",
     "difficulty": "Hard",
-    "id": 2612,
-    "link": "https://leetcode.com/problems/minimum-reverse-operations/",
-    "title": "Minimum Reverse Operations"
+    "link": "https://leetcode.com/problems/minimum-reverse-operations/"
   },
   "2613": {
+    "id": 2613,
     "category": "Math & Geometry",
+    "title": "Beautiful Pairs",
     "difficulty": "Hard",
-    "id": 2613,
-    "link": "https://leetcode.com/problems/beautiful-pairs/",
-    "title": "Beautiful Pairs"
+    "link": "https://leetcode.com/problems/beautiful-pairs/"
   },
   "2614": {
+    "id": 2614,
     "category": "Math & Geometry",
+    "title": "Prime In Diagonal",
     "difficulty": "Easy",
-    "id": 2614,
-    "link": "https://leetcode.com/problems/prime-in-diagonal/",
-    "title": "Prime In Diagonal"
+    "link": "https://leetcode.com/problems/prime-in-diagonal/"
   },
   "2615": {
+    "id": 2615,
     "category": "Array & Hashing",
+    "title": "Sum of Distances",
     "difficulty": "Medium",
-    "id": 2615,
-    "link": "https://leetcode.com/problems/sum-of-distances/",
-    "title": "Sum of Distances"
+    "link": "https://leetcode.com/problems/sum-of-distances/"
   },
   "2616": {
+    "id": 2616,
     "category": "Dynamic Programming",
+    "title": "Minimize the Maximum Difference of Pairs",
     "difficulty": "Medium",
-    "id": 2616,
-    "link": "https://leetcode.com/problems/minimize-the-maximum-difference-of-pairs/",
-    "title": "Minimize the Maximum Difference of Pairs"
+    "link": "https://leetcode.com/problems/minimize-the-maximum-difference-of-pairs/"
   },
   "2617": {
+    "id": 2617,
     "category": "Graph Traversal",
+    "title": "Minimum Number of Visited Cells in a Grid",
     "difficulty": "Hard",
-    "id": 2617,
-    "link": "https://leetcode.com/problems/minimum-number-of-visited-cells-in-a-grid/",
-    "title": "Minimum Number of Visited Cells in a Grid"
+    "link": "https://leetcode.com/problems/minimum-number-of-visited-cells-in-a-grid/"
   },
   "2618": {
+    "id": 2618,
     "category": "Array & Hashing",
+    "title": "Check if Object Instance of Class",
     "difficulty": "Medium",
-    "id": 2618,
-    "link": "https://leetcode.com/problems/check-if-object-instance-of-class/",
-    "title": "Check if Object Instance of Class"
+    "link": "https://leetcode.com/problems/check-if-object-instance-of-class/"
   },
   "2619": {
+    "id": 2619,
     "category": "Array & Hashing",
+    "title": "Array Prototype Last",
     "difficulty": "Easy",
-    "id": 2619,
-    "link": "https://leetcode.com/problems/array-prototype-last/",
-    "title": "Array Prototype Last"
+    "link": "https://leetcode.com/problems/array-prototype-last/"
+  },
+  "2620": {
+    "id": 2620,
+    "category": "Array & Hashing",
+    "title": "Counter",
+    "difficulty": "Easy",
+    "link": "https://leetcode.com/problems/counter/"
+  },
+  "2621": {
+    "id": 2621,
+    "category": "Array & Hashing",
+    "title": "Sleep",
+    "difficulty": "Easy",
+    "link": "https://leetcode.com/problems/sleep/"
   },
-  "2620": {"category": "Array & Hashing", "difficulty": "Easy", "id": 2620, "link": "https://leetcode.com/problems/counter/", "title": "Counter"},
-  "2621": {"category": "Array & Hashing", "difficulty": "Easy", "id": 2621, "link": "https://leetcode.com/problems/sleep/", "title": "Sleep"},
   "2622": {
+    "id": 2622,
     "category": "Array & Hashing",
+    "title": "Cache With Time Limit",
     "difficulty": "Medium",
-    "id": 2622,
-    "link": "https://leetcode.com/problems/cache-with-time-limit/",
-    "title": "Cache With Time Limit"
+    "link": "https://leetcode.com/problems/cache-with-time-limit/"
   },
-  "2623": {"category": "Array & Hashing", "difficulty": "Medium", "id": 2623, "link": "https://leetcode.com/problems/memoize/", "title": "Memoize"},
-  "2624": {
+  "2623": {
+    "id": 2623,
     "category": "Array & Hashing",
+    "title": "Memoize",
     "difficulty": "Medium",
+    "link": "https://leetcode.com/problems/memoize/"
+  },
+  "2624": {
     "id": 2624,
-    "link": "https://leetcode.com/problems/snail-traversal/",
-    "title": "Snail Traversal"
+    "category": "Array & Hashing",
+    "title": "Snail Traversal",
+    "difficulty": "Medium",
+    "link": "https://leetcode.com/problems/snail-traversal/"
   },
   "2625": {
+    "id": 2625,
     "category": "Array & Hashing",
+    "title": "Flatten Deeply Nested Array",
     "difficulty": "Medium",
-    "id": 2625,
-    "link": "https://leetcode.com/problems/flatten-deeply-nested-array/",
-    "title": "Flatten Deeply Nested Array"
+    "link": "https://leetcode.com/problems/flatten-deeply-nested-array/"
   },
   "2626": {
+    "id": 2626,
     "category": "Array & Hashing",
+    "title": "Array Reduce Transformation",
     "difficulty": "Easy",
-    "id": 2626,
-    "link": "https://leetcode.com/problems/array-reduce-transformation/",
-    "title": "Array Reduce Transformation"
+    "link": "https://leetcode.com/problems/array-reduce-transformation/"
   },
-  "2627": {"category": "Array & Hashing", "difficulty": "Medium", "id": 2627, "link": "https://leetcode.com/problems/debounce/", "title": "Debounce"},
-  "2628": {
+  "2627": {
+    "id": 2627,
     "category": "Array & Hashing",
+    "title": "Debounce",
     "difficulty": "Medium",
+    "link": "https://leetcode.com/problems/debounce/"
+  },
+  "2628": {
     "id": 2628,
-    "link": "https://leetcode.com/problems/json-deep-equal/",
-    "title": "JSON Deep Equal"
+    "category": "Array & Hashing",
+    "title": "JSON Deep Equal",
+    "difficulty": "Medium",
+    "link": "https://leetcode.com/problems/json-deep-equal/"
   },
   "2629": {
+    "id": 2629,
     "category": "Array & Hashing",
+    "title": "Function Composition",
     "difficulty": "Easy",
-    "id": 2629,
-    "link": "https://leetcode.com/problems/function-composition/",
-    "title": "Function Composition"
+    "link": "https://leetcode.com/problems/function-composition/"
   },
   "2630": {
+    "id": 2630,
     "category": "Array & Hashing",
+    "title": "Memoize II",
     "difficulty": "Hard",
-    "id": 2630,
-    "link": "https://leetcode.com/problems/memoize-ii/",
-    "title": "Memoize II"
+    "link": "https://leetcode.com/problems/memoize-ii/"
   },
-  "2631": {"category": "Array & Hashing", "difficulty": "Medium", "id": 2631, "link": "https://leetcode.com/problems/group-by/", "title": "Group By"},
-  "2632": {"category": "Array & Hashing", "difficulty": "Medium", "id": 2632, "link": "https://leetcode.com/problems/curry/", "title": "Curry"},
-  "2633": {
+  "2631": {
+    "id": 2631,
     "category": "Array & Hashing",
+    "title": "Group By",
     "difficulty": "Medium",
+    "link": "https://leetcode.com/problems/group-by/"
+  },
+  "2632": {
+    "id": 2632,
+    "category": "Array & Hashing",
+    "title": "Curry",
+    "difficulty": "Medium",
+    "link": "https://leetcode.com/problems/curry/"
+  },
+  "2633": {
     "id": 2633,
-    "link": "https://leetcode.com/problems/convert-object-to-json-string/",
-    "title": "Convert Object to JSON String"
+    "category": "Array & Hashing",
+    "title": "Convert Object to JSON String",
+    "difficulty": "Medium",
+    "link": "https://leetcode.com/problems/convert-object-to-json-string/"
   },
   "2634": {
+    "id": 2634,
     "category": "Array & Hashing",
+    "title": "Filter Elements from Array",
     "difficulty": "Easy",
-    "id": 2634,
-    "link": "https://leetcode.com/problems/filter-elements-from-array/",
-    "title": "Filter Elements from Array"
+    "link": "https://leetcode.com/problems/filter-elements-from-array/"
   },
   "2635": {
+    "id": 2635,
     "category": "Array & Hashing",
+    "title": "Apply Transform Over Each Element in Array",
     "difficulty": "Easy",
-    "id": 2635,
-    "link": "https://leetcode.com/problems/apply-transform-over-each-element-in-array/",
-    "title": "Apply Transform Over Each Element in Array"
+    "link": "https://leetcode.com/problems/apply-transform-over-each-element-in-array/"
   },
   "2636": {
+    "id": 2636,
     "category": "Array & Hashing",
+    "title": "Promise Pool",
     "difficulty": "Medium",
-    "id": 2636,
-    "link": "https://leetcode.com/problems/promise-pool/",
-    "title": "Promise Pool"
+    "link": "https://leetcode.com/problems/promise-pool/"
   },
   "2637": {
+    "id": 2637,
     "category": "Array & Hashing",
+    "title": "Promise Time Limit",
     "difficulty": "Medium",
-    "id": 2637,
-    "link": "https://leetcode.com/problems/promise-time-limit/",
-    "title": "Promise Time Limit"
+    "link": "https://leetcode.com/problems/promise-time-limit/"
   },
   "2638": {
+    "id": 2638,
     "category": "Dynamic Programming",
+    "title": "Count the Number of K-Free Subsets",
     "difficulty": "Medium",
-    "id": 2638,
-    "link": "https://leetcode.com/problems/count-the-number-of-k-free-subsets/",
-    "title": "Count the Number of K-Free Subsets"
+    "link": "https://leetcode.com/problems/count-the-number-of-k-free-subsets/"
   },
   "2639": {
+    "id": 2639,
     "category": "Array & Hashing",
+    "title": "Find the Width of Columns of a Grid",
     "difficulty": "Easy",
-    "id": 2639,
-    "link": "https://leetcode.com/problems/find-the-width-of-columns-of-a-grid/",
-    "title": "Find the Width of Columns of a Grid"
+    "link": "https://leetcode.com/problems/find-the-width-of-columns-of-a-grid/"
   },
   "2640": {
+    "id": 2640,
     "category": "Array & Hashing",
+    "title": "Find the Score of All Prefixes of an Array",
     "difficulty": "Medium",
-    "id": 2640,
-    "link": "https://leetcode.com/problems/find-the-score-of-all-prefixes-of-an-array/",
-    "title": "Find the Score of All Prefixes of an Array"
+    "link": "https://leetcode.com/problems/find-the-score-of-all-prefixes-of-an-array/"
   },
   "2641": {
+    "id": 2641,
     "category": "Tree",
+    "title": "Cousins in Binary Tree II",
     "difficulty": "Medium",
-    "id": 2641,
-    "link": "https://leetcode.com/problems/cousins-in-binary-tree-ii/",
-    "title": "Cousins in Binary Tree II"
+    "link": "https://leetcode.com/problems/cousins-in-binary-tree-ii/"
   },
   "2642": {
+    "id": 2642,
     "category": "Graph Traversal",
+    "title": "Design Graph With Shortest Path Calculator",
     "difficulty": "Hard",
-    "id": 2642,
-    "link": "https://leetcode.com/problems/design-graph-with-shortest-path-calculator/",
-    "title": "Design Graph With Shortest Path Calculator"
+    "link": "https://leetcode.com/problems/design-graph-with-shortest-path-calculator/"
   },
   "2643": {
+    "id": 2643,
     "category": "Array & Hashing",
+    "title": "Row With Maximum Ones",
     "difficulty": "Easy",
-    "id": 2643,
-    "link": "https://leetcode.com/problems/row-with-maximum-ones/",
-    "title": "Row With Maximum Ones"
+    "link": "https://leetcode.com/problems/row-with-maximum-ones/"
   },
   "2644": {
+    "id": 2644,
     "category": "Array & Hashing",
+    "title": "Find the Maximum Divisibility Score",
     "difficulty": "Easy",
-    "id": 2644,
-    "link": "https://leetcode.com/problems/find-the-maximum-divisibility-score/",
-    "title": "Find the Maximum Divisibility Score"
+    "link": "https://leetcode.com/problems/find-the-maximum-divisibility-score/"
   },
   "2645": {
+    "id": 2645,
     "category": "Dynamic Programming",
+    "title": "Minimum Additions to Make Valid String",
     "difficulty": "Medium",
-    "id": 2645,
-    "link": "https://leetcode.com/problems/minimum-additions-to-make-valid-string/",
-    "title": "Minimum Additions to Make Valid String"
+    "link": "https://leetcode.com/problems/minimum-additions-to-make-valid-string/"
   },
   "2646": {
+    "id": 2646,
     "category": "Tree",
+    "title": "Minimize the Total Price of the Trips",
     "difficulty": "Hard",
-    "id": 2646,
-    "link": "https://leetcode.com/problems/minimize-the-total-price-of-the-trips/",
-    "title": "Minimize the Total Price of the Trips"
+    "link": "https://leetcode.com/problems/minimize-the-total-price-of-the-trips/"
   },
   "2647": {
+    "id": 2647,
     "category": "Math & Geometry",
+    "title": "Color the Triangle Red",
     "difficulty": "Hard",
-    "id": 2647,
-    "link": "https://leetcode.com/problems/color-the-triangle-red/",
-    "title": "Color the Triangle Red"
+    "link": "https://leetcode.com/problems/color-the-triangle-red/"
   },
   "2648": {
+    "id": 2648,
     "category": "Array & Hashing",
+    "title": "Generate Fibonacci Sequence",
     "difficulty": "Easy",
-    "id": 2648,
-    "link": "https://leetcode.com/problems/generate-fibonacci-sequence/",
-    "title": "Generate Fibonacci Sequence"
+    "link": "https://leetcode.com/problems/generate-fibonacci-sequence/"
   },
   "2649": {
+    "id": 2649,
     "category": "Array & Hashing",
+    "title": "Nested Array Generator",
     "difficulty": "Medium",
-    "id": 2649,
-    "link": "https://leetcode.com/problems/nested-array-generator/",
-    "title": "Nested Array Generator"
+    "link": "https://leetcode.com/problems/nested-array-generator/"
   },
   "2650": {
+    "id": 2650,
     "category": "Array & Hashing",
+    "title": "Design Cancellable Function",
     "difficulty": "Hard",
-    "id": 2650,
-    "link": "https://leetcode.com/problems/design-cancellable-function/",
-    "title": "Design Cancellable Function"
+    "link": "https://leetcode.com/problems/design-cancellable-function/"
   },
   "2651": {
+    "id": 2651,
     "category": "Math & Geometry",
+    "title": "Calculate Delayed Arrival Time",
     "difficulty": "Easy",
-    "id": 2651,
-    "link": "https://leetcode.com/problems/calculate-delayed-arrival-time/",
-    "title": "Calculate Delayed Arrival Time"
+    "link": "https://leetcode.com/problems/calculate-delayed-arrival-time/"
   },
   "2652": {
+    "id": 2652,
     "category": "Math & Geometry",
+    "title": "Sum Multiples",
     "difficulty": "Easy",
-    "id": 2652,
-    "link": "https://leetcode.com/problems/sum-multiples/",
-    "title": "Sum Multiples"
+    "link": "https://leetcode.com/problems/sum-multiples/"
   },
   "2653": {
+    "id": 2653,
     "category": "Sliding Window",
+    "title": "Sliding Subarray Beauty",
     "difficulty": "Medium",
-    "id": 2653,
-    "link": "https://leetcode.com/problems/sliding-subarray-beauty/",
-    "title": "Sliding Subarray Beauty"
+    "link": "https://leetcode.com/problems/sliding-subarray-beauty/"
   },
   "2654": {
+    "id": 2654,
     "category": "Math & Geometry",
+    "title": "Minimum Number of Operations to Make All Array Elements Equal to 1",
     "difficulty": "Medium",
-    "id": 2654,
-    "link": "https://leetcode.com/problems/minimum-number-of-operations-to-make-all-array-elements-equal-to-1/",
-    "title": "Minimum Number of Operations to Make All Array Elements Equal to 1"
+    "link": "https://leetcode.com/problems/minimum-number-of-operations-to-make-all-array-elements-equal-to-1/"
   },
   "2655": {
+    "id": 2655,
     "category": "Array & Hashing",
+    "title": "Find Maximal Uncovered Ranges",
     "difficulty": "Medium",
-    "id": 2655,
-    "link": "https://leetcode.com/problems/find-maximal-uncovered-ranges/",
-    "title": "Find Maximal Uncovered Ranges"
+    "link": "https://leetcode.com/problems/find-maximal-uncovered-ranges/"
   },
   "2656": {
+    "id": 2656,
     "category": "Greedy",
+    "title": "Maximum Sum With Exactly K Elements ",
     "difficulty": "Easy",
-    "id": 2656,
-    "link": "https://leetcode.com/problems/maximum-sum-with-exactly-k-elements/",
-    "title": "Maximum Sum With Exactly K Elements "
+    "link": "https://leetcode.com/problems/maximum-sum-with-exactly-k-elements/"
   },
   "2657": {
+    "id": 2657,
     "category": "Bit Manipulation",
+    "title": "Find the Prefix Common Array of Two Arrays",
     "difficulty": "Medium",
-    "id": 2657,
-    "link": "https://leetcode.com/problems/find-the-prefix-common-array-of-two-arrays/",
-    "title": "Find the Prefix Common Array of Two Arrays"
+    "link": "https://leetcode.com/problems/find-the-prefix-common-array-of-two-arrays/"
   },
   "2658": {
+    "id": 2658,
     "category": "Graph Traversal",
+    "title": "Maximum Number of Fish in a Grid",
     "difficulty": "Medium",
-    "id": 2658,
-    "link": "https://leetcode.com/problems/maximum-number-of-fish-in-a-grid/",
-    "title": "Maximum Number of Fish in a Grid"
+    "link": "https://leetcode.com/problems/maximum-number-of-fish-in-a-grid/"
   },
   "2659": {
+    "id": 2659,
     "category": "Tree",
+    "title": "Make Array Empty",
     "difficulty": "Hard",
-    "id": 2659,
-    "link": "https://leetcode.com/problems/make-array-empty/",
-    "title": "Make Array Empty"
+    "link": "https://leetcode.com/problems/make-array-empty/"
   },
   "2660": {
+    "id": 2660,
     "category": "Array & Hashing",
+    "title": "Determine the Winner of a Bowling Game",
     "difficulty": "Easy",
-    "id": 2660,
-    "link": "https://leetcode.com/problems/determine-the-winner-of-a-bowling-game/",
-    "title": "Determine the Winner of a Bowling Game"
+    "link": "https://leetcode.com/problems/determine-the-winner-of-a-bowling-game/"
   },
   "2661": {
+    "id": 2661,
     "category": "Array & Hashing",
+    "title": "First Completely Painted Row or Column",
     "difficulty": "Medium",
-    "id": 2661,
-    "link": "https://leetcode.com/problems/first-completely-painted-row-or-column/",
-    "title": "First Completely Painted Row or Column"
+    "link": "https://leetcode.com/problems/first-completely-painted-row-or-column/"
   },
   "2662": {
+    "id": 2662,
     "category": "Graph Traversal",
+    "title": "Minimum Cost of a Path With Special Roads",
     "difficulty": "Medium",
-    "id": 2662,
-    "link": "https://leetcode.com/problems/minimum-cost-of-a-path-with-special-roads/",
-    "title": "Minimum Cost of a Path With Special Roads"
+    "link": "https://leetcode.com/problems/minimum-cost-of-a-path-with-special-roads/"
   },
   "2663": {
+    "id": 2663,
     "category": "Greedy",
+    "title": "Lexicographically Smallest Beautiful String",
     "difficulty": "Hard",
-    "id": 2663,
-    "link": "https://leetcode.com/problems/lexicographically-smallest-beautiful-string/",
-    "title": "Lexicographically Smallest Beautiful String"
+    "link": "https://leetcode.com/problems/lexicographically-smallest-beautiful-string/"
   },
   "2664": {
+    "id": 2664,
     "category": "Backtracking",
+    "title": "The Knight’s Tour",
     "difficulty": "Medium",
-    "id": 2664,
-    "link": "https://leetcode.com/problems/the-knights-tour/",
-    "title": "The Knight’s Tour"
+    "link": "https://leetcode.com/problems/the-knights-tour/"
   },
   "2665": {
+    "id": 2665,
     "category": "Array & Hashing",
+    "title": "Counter II",
     "difficulty": "Easy",
-    "id": 2665,
-    "link": "https://leetcode.com/problems/counter-ii/",
-    "title": "Counter II"
+    "link": "https://leetcode.com/problems/counter-ii/"
   },
   "2666": {
+    "id": 2666,
     "category": "Array & Hashing",
+    "title": "Allow One Function Call",
     "difficulty": "Easy",
-    "id": 2666,
-    "link": "https://leetcode.com/problems/allow-one-function-call/",
-    "title": "Allow One Function Call"
+    "link": "https://leetcode.com/problems/allow-one-function-call/"
   },
   "2667": {
+    "id": 2667,
     "category": "Array & Hashing",
+    "title": "Create Hello World Function",
     "difficulty": "Easy",
-    "id": 2667,
-    "link": "https://leetcode.com/problems/create-hello-world-function/",
-    "title": "Create Hello World Function"
+    "link": "https://leetcode.com/problems/create-hello-world-function/"
   },
   "2668": {
+    "id": 2668,
     "category": "Database",
+    "title": "Find Latest Salaries",
     "difficulty": "Easy",
-    "id": 2668,
-    "link": "https://leetcode.com/problems/find-latest-salaries/",
-    "title": "Find Latest Salaries"
+    "link": "https://leetcode.com/problems/find-latest-salaries/"
   },
   "2669": {
+    "id": 2669,
     "category": "Database",
+    "title": "Count Artist Occurrences On Spotify Ranking List",
     "difficulty": "Easy",
-    "id": 2669,
-    "link": "https://leetcode.com/problems/count-artist-occurrences-on-spotify-ranking-list/",
-    "title": "Count Artist Occurrences On Spotify Ranking List"
+    "link": "https://leetcode.com/problems/count-artist-occurrences-on-spotify-ranking-list/"
   },
   "2670": {
+    "id": 2670,
     "category": "Array & Hashing",
+    "title": "Find the Distinct Difference Array",
     "difficulty": "Easy",
-    "id": 2670,
-    "link": "https://leetcode.com/problems/find-the-distinct-difference-array/",
-    "title": "Find the Distinct Difference Array"
+    "link": "https://leetcode.com/problems/find-the-distinct-difference-array/"
   },
   "2671": {
+    "id": 2671,
     "category": "Array & Hashing",
+    "title": "Frequency Tracker",
     "difficulty": "Medium",
-    "id": 2671,
-    "link": "https://leetcode.com/problems/frequency-tracker/",
-    "title": "Frequency Tracker"
+    "link": "https://leetcode.com/problems/frequency-tracker/"
   },
   "2672": {
+    "id": 2672,
     "category": "Array & Hashing",
+    "title": "Number of Adjacent Elements With the Same Color",
     "difficulty": "Medium",
-    "id": 2672,
-    "link": "https://leetcode.com/problems/number-of-adjacent-elements-with-the-same-color/",
-    "title": "Number of Adjacent Elements With the Same Color"
+    "link": "https://leetcode.com/problems/number-of-adjacent-elements-with-the-same-color/"
   },
   "2673": {
+    "id": 2673,
     "category": "Tree",
+    "title": "Make Costs of Paths Equal in a Binary Tree",
     "difficulty": "Medium",
-    "id": 2673,
-    "link": "https://leetcode.com/problems/make-costs-of-paths-equal-in-a-binary-tree/",
-    "title": "Make Costs of Paths Equal in a Binary Tree"
+    "link": "https://leetcode.com/problems/make-costs-of-paths-equal-in-a-binary-tree/"
   },
   "2674": {
+    "id": 2674,
     "category": "Linked List",
+    "title": "Split a Circular Linked List",
     "difficulty": "Medium",
-    "id": 2674,
-    "link": "https://leetcode.com/problems/split-a-circular-linked-list/",
-    "title": "Split a Circular Linked List"
+    "link": "https://leetcode.com/problems/split-a-circular-linked-list/"
   },
   "2675": {
+    "id": 2675,
     "category": "Array & Hashing",
+    "title": "Array of Objects to Matrix",
     "difficulty": "Hard",
-    "id": 2675,
-    "link": "https://leetcode.com/problems/array-of-objects-to-matrix/",
-    "title": "Array of Objects to Matrix"
+    "link": "https://leetcode.com/problems/array-of-objects-to-matrix/"
+  },
+  "2676": {
+    "id": 2676,
+    "category": "Array & Hashing",
+    "title": "Throttle",
+    "difficulty": "Medium",
+    "link": "https://leetcode.com/problems/throttle/"
   },
-  "2676": {"category": "Array & Hashing", "difficulty": "Medium", "id": 2676, "link": "https://leetcode.com/problems/throttle/", "title": "Throttle"},
   "2677": {
+    "id": 2677,
     "category": "Array & Hashing",
+    "title": "Chunk Array",
     "difficulty": "Easy",
-    "id": 2677,
-    "link": "https://leetcode.com/problems/chunk-array/",
-    "title": "Chunk Array"
+    "link": "https://leetcode.com/problems/chunk-array/"
   },
   "2678": {
+    "id": 2678,
     "category": "Array & Hashing",
+    "title": "Number of Senior Citizens",
     "difficulty": "Easy",
-    "id": 2678,
-    "link": "https://leetcode.com/problems/number-of-senior-citizens/",
-    "title": "Number of Senior Citizens"
+    "link": "https://leetcode.com/problems/number-of-senior-citizens/"
   },
   "2679": {
+    "id": 2679,
     "category": "Heap (Priority Queue)",
+    "title": "Sum in a Matrix",
     "difficulty": "Medium",
-    "id": 2679,
-    "link": "https://leetcode.com/problems/sum-in-a-matrix/",
-    "title": "Sum in a Matrix"
+    "link": "https://leetcode.com/problems/sum-in-a-matrix/"
   },
   "2680": {
+    "id": 2680,
     "category": "Bit Manipulation",
+    "title": "Maximum OR",
     "difficulty": "Medium",
-    "id": 2680,
-    "link": "https://leetcode.com/problems/maximum-or/",
-    "title": "Maximum OR"
+    "link": "https://leetcode.com/problems/maximum-or/"
   },
   "2681": {
+    "id": 2681,
     "category": "Dynamic Programming",
+    "title": "Power of Heroes",
     "difficulty": "Hard",
-    "id": 2681,
-    "link": "https://leetcode.com/problems/power-of-heroes/",
-    "title": "Power of Heroes"
+    "link": "https://leetcode.com/problems/power-of-heroes/"
   },
   "2682": {
+    "id": 2682,
     "category": "Array & Hashing",
+    "title": "Find the Losers of the Circular Game",
     "difficulty": "Easy",
-    "id": 2682,
-    "link": "https://leetcode.com/problems/find-the-losers-of-the-circular-game/",
-    "title": "Find the Losers of the Circular Game"
+    "link": "https://leetcode.com/problems/find-the-losers-of-the-circular-game/"
   },
   "2683": {
+    "id": 2683,
     "category": "Bit Manipulation",
+    "title": "Neighboring Bitwise XOR",
     "difficulty": "Medium",
-    "id": 2683,
-    "link": "https://leetcode.com/problems/neighboring-bitwise-xor/",
-    "title": "Neighboring Bitwise XOR"
+    "link": "https://leetcode.com/problems/neighboring-bitwise-xor/"
   },
   "2684": {
+    "id": 2684,
     "category": "Dynamic Programming",
+    "title": "Maximum Number of Moves in a Grid",
     "difficulty": "Medium",
-    "id": 2684,
-    "link": "https://leetcode.com/problems/maximum-number-of-moves-in-a-grid/",
-    "title": "Maximum Number of Moves in a Grid"
+    "link": "https://leetcode.com/problems/maximum-number-of-moves-in-a-grid/"
   },
   "2685": {
+    "id": 2685,
     "category": "Graph Traversal",
+    "title": "Count the Number of Complete Components",
     "difficulty": "Medium",
-    "id": 2685,
-    "link": "https://leetcode.com/problems/count-the-number-of-complete-components/",
-    "title": "Count the Number of Complete Components"
+    "link": "https://leetcode.com/problems/count-the-number-of-complete-components/"
   },
   "2686": {
+    "id": 2686,
     "category": "Database",
+    "title": "Immediate Food Delivery III",
     "difficulty": "Medium",
-    "id": 2686,
-    "link": "https://leetcode.com/problems/immediate-food-delivery-iii/",
-    "title": "Immediate Food Delivery III"
+    "link": "https://leetcode.com/problems/immediate-food-delivery-iii/"
   },
   "2687": {
+    "id": 2687,
     "category": "Database",
+    "title": "Bikes Last Time Used ",
     "difficulty": "Easy",
-    "id": 2687,
-    "link": "https://leetcode.com/problems/bikes-last-time-used/",
-    "title": "Bikes Last Time Used "
+    "link": "https://leetcode.com/problems/bikes-last-time-used/"
   },
   "2688": {
+    "id": 2688,
     "category": "Database",
+    "title": "Find Active Users",
     "difficulty": "Medium",
-    "id": 2688,
-    "link": "https://leetcode.com/problems/find-active-users/",
-    "title": "Find Active Users"
+    "link": "https://leetcode.com/problems/find-active-users/"
   },
   "2689": {
+    "id": 2689,
     "category": "Tree",
+    "title": "Extract Kth Character From The Rope Tree",
     "difficulty": "Easy",
-    "id": 2689,
-    "link": "https://leetcode.com/problems/extract-kth-character-from-the-rope-tree/",
-    "title": "Extract Kth Character From The Rope Tree"
+    "link": "https://leetcode.com/problems/extract-kth-character-from-the-rope-tree/"
   },
   "2690": {
+    "id": 2690,
     "category": "Array & Hashing",
+    "title": "Infinite Method Object",
     "difficulty": "Easy",
-    "id": 2690,
-    "link": "https://leetcode.com/problems/infinite-method-object/",
-    "title": "Infinite Method Object"
+    "link": "https://leetcode.com/problems/infinite-method-object/"
   },
   "2691": {
+    "id": 2691,
     "category": "Array & Hashing",
+    "title": "Immutability Helper",
     "difficulty": "Hard",
-    "id": 2691,
-    "link": "https://leetcode.com/problems/immutability-helper/",
-    "title": "Immutability Helper"
+    "link": "https://leetcode.com/problems/immutability-helper/"
   },
   "2692": {
+    "id": 2692,
     "category": "Array & Hashing",
+    "title": "Make Object Immutable",
     "difficulty": "Medium",
-    "id": 2692,
-    "link": "https://leetcode.com/problems/make-object-immutable/",
-    "title": "Make Object Immutable"
+    "link": "https://leetcode.com/problems/make-object-immutable/"
   },
   "2693": {
+    "id": 2693,
     "category": "Array & Hashing",
+    "title": "Call Function with Custom Context",
     "difficulty": "Medium",
-    "id": 2693,
-    "link": "https://leetcode.com/problems/call-function-with-custom-context/",
-    "title": "Call Function with Custom Context"
+    "link": "https://leetcode.com/problems/call-function-with-custom-context/"
   },
   "2694": {
+    "id": 2694,
     "category": "Array & Hashing",
+    "title": "Event Emitter",
     "difficulty": "Medium",
-    "id": 2694,
-    "link": "https://leetcode.com/problems/event-emitter/",
-    "title": "Event Emitter"
+    "link": "https://leetcode.com/problems/event-emitter/"
   },
   "2695": {
+    "id": 2695,
     "category": "Array & Hashing",
+    "title": "Array Wrapper",
     "difficulty": "Easy",
-    "id": 2695,
-    "link": "https://leetcode.com/problems/array-wrapper/",
-    "title": "Array Wrapper"
+    "link": "https://leetcode.com/problems/array-wrapper/"
   },
   "2696": {
+    "id": 2696,
     "category": "Stack",
+    "title": "Minimum String Length After Removing Substrings",
     "difficulty": "Easy",
-    "id": 2696,
-    "link": "https://leetcode.com/problems/minimum-string-length-after-removing-substrings/",
-    "title": "Minimum String Length After Removing Substrings"
+    "link": "https://leetcode.com/problems/minimum-string-length-after-removing-substrings/"
   },
   "2697": {
+    "id": 2697,
     "category": "Greedy",
+    "title": "Lexicographically Smallest Palindrome",
     "difficulty": "Easy",
-    "id": 2697,
-    "link": "https://leetcode.com/problems/lexicographically-smallest-palindrome/",
-    "title": "Lexicographically Smallest Palindrome"
+    "link": "https://leetcode.com/problems/lexicographically-smallest-palindrome/"
   },
   "2698": {
+    "id": 2698,
     "category": "Backtracking",
+    "title": "Find the Punishment Number of an Integer",
     "difficulty": "Medium",
-    "id": 2698,
-    "link": "https://leetcode.com/problems/find-the-punishment-number-of-an-integer/",
-    "title": "Find the Punishment Number of an Integer"
+    "link": "https://leetcode.com/problems/find-the-punishment-number-of-an-integer/"
   },
   "2699": {
+    "id": 2699,
     "category": "Graph Traversal",
+    "title": "Modify Graph Edge Weights",
     "difficulty": "Hard",
-    "id": 2699,
-    "link": "https://leetcode.com/problems/modify-graph-edge-weights/",
-    "title": "Modify Graph Edge Weights"
+    "link": "https://leetcode.com/problems/modify-graph-edge-weights/"
   },
   "2700": {
+    "id": 2700,
     "category": "Array & Hashing",
+    "title": "Differences Between Two Objects",
     "difficulty": "Medium",
-    "id": 2700,
-    "link": "https://leetcode.com/problems/differences-between-two-objects/",
-    "title": "Differences Between Two Objects"
+    "link": "https://leetcode.com/problems/differences-between-two-objects/"
   },
   "2701": {
+    "id": 2701,
     "category": "Database",
+    "title": "Consecutive Transactions with Increasing Amounts",
     "difficulty": "Hard",
-    "id": 2701,
-    "link": "https://leetcode.com/problems/consecutive-transactions-with-increasing-amounts/",
-    "title": "Consecutive Transactions with Increasing Amounts"
+    "link": "https://leetcode.com/problems/consecutive-transactions-with-increasing-amounts/"
   },
   "2702": {
+    "id": 2702,
     "category": "Binary Search",
+    "title": "Minimum Operations to Make Numbers Non-positive",
     "difficulty": "Hard",
-    "id": 2702,
-    "link": "https://leetcode.com/problems/minimum-operations-to-make-numbers-non-positive/",
-    "title": "Minimum Operations to Make Numbers Non-positive"
+    "link": "https://leetcode.com/problems/minimum-operations-to-make-numbers-non-positive/"
   },
   "2703": {
+    "id": 2703,
     "category": "Array & Hashing",
+    "title": "Return Length of Arguments Passed",
     "difficulty": "Easy",
-    "id": 2703,
-    "link": "https://leetcode.com/problems/return-length-of-arguments-passed/",
-    "title": "Return Length of Arguments Passed"
+    "link": "https://leetcode.com/problems/return-length-of-arguments-passed/"
   },
   "2704": {
+    "id": 2704,
     "category": "Array & Hashing",
+    "title": "To Be Or Not To Be",
     "difficulty": "Easy",
-    "id": 2704,
-    "link": "https://leetcode.com/problems/to-be-or-not-to-be/",
-    "title": "To Be Or Not To Be"
+    "link": "https://leetcode.com/problems/to-be-or-not-to-be/"
   },
   "2705": {
+    "id": 2705,
     "category": "Array & Hashing",
+    "title": "Compact Object",
     "difficulty": "Medium",
-    "id": 2705,
-    "link": "https://leetcode.com/problems/compact-object/",
-    "title": "Compact Object"
+    "link": "https://leetcode.com/problems/compact-object/"
   },
   "2706": {
+    "id": 2706,
     "category": "Greedy",
+    "title": "Buy Two Chocolates",
     "difficulty": "Easy",
-    "id": 2706,
-    "link": "https://leetcode.com/problems/buy-two-chocolates/",
-    "title": "Buy Two Chocolates"
+    "link": "https://leetcode.com/problems/buy-two-chocolates/"
   },
   "2707": {
+    "id": 2707,
     "category": "Dynamic Programming",
+    "title": "Extra Characters in a String",
     "difficulty": "Medium",
-    "id": 2707,
-    "link": "https://leetcode.com/problems/extra-characters-in-a-string/",
-    "title": "Extra Characters in a String"
+    "link": "https://leetcode.com/problems/extra-characters-in-a-string/"
   },
   "2708": {
+    "id": 2708,
     "category": "Dynamic Programming",
+    "title": "Maximum Strength of a Group",
     "difficulty": "Medium",
-    "id": 2708,
-    "link": "https://leetcode.com/problems/maximum-strength-of-a-group/",
-    "title": "Maximum Strength of a Group"
+    "link": "https://leetcode.com/problems/maximum-strength-of-a-group/"
   },
   "2709": {
+    "id": 2709,
     "category": "Graph Traversal",
+    "title": "Greatest Common Divisor Traversal",
     "difficulty": "Hard",
-    "id": 2709,
-    "link": "https://leetcode.com/problems/greatest-common-divisor-traversal/",
-    "title": "Greatest Common Divisor Traversal"
+    "link": "https://leetcode.com/problems/greatest-common-divisor-traversal/"
   },
   "2710": {
+    "id": 2710,
     "category": "Array & Hashing",
+    "title": "Remove Trailing Zeros From a String",
     "difficulty": "Easy",
-    "id": 2710,
-    "link": "https://leetcode.com/problems/remove-trailing-zeros-from-a-string/",
-    "title": "Remove Trailing Zeros From a String"
+    "link": "https://leetcode.com/problems/remove-trailing-zeros-from-a-string/"
   },
   "2711": {
+    "id": 2711,
     "category": "Array & Hashing",
+    "title": "Difference of Number of Distinct Values on Diagonals",
     "difficulty": "Medium",
-    "id": 2711,
-    "link": "https://leetcode.com/problems/difference-of-number-of-distinct-values-on-diagonals/",
-    "title": "Difference of Number of Distinct Values on Diagonals"
+    "link": "https://leetcode.com/problems/difference-of-number-of-distinct-values-on-diagonals/"
   },
   "2712": {
+    "id": 2712,
     "category": "Dynamic Programming",
+    "title": "Minimum Cost to Make All Characters Equal",
     "difficulty": "Medium",
-    "id": 2712,
-    "link": "https://leetcode.com/problems/minimum-cost-to-make-all-characters-equal/",
-    "title": "Minimum Cost to Make All Characters Equal"
+    "link": "https://leetcode.com/problems/minimum-cost-to-make-all-characters-equal/"
   },
   "2713": {
+    "id": 2713,
     "category": "Dynamic Programming",
+    "title": "Maximum Strictly Increasing Cells in a Matrix",
     "difficulty": "Hard",
-    "id": 2713,
-    "link": "https://leetcode.com/problems/maximum-strictly-increasing-cells-in-a-matrix/",
-    "title": "Maximum Strictly Increasing Cells in a Matrix"
+    "link": "https://leetcode.com/problems/maximum-strictly-increasing-cells-in-a-matrix/"
   },
   "2714": {
+    "id": 2714,
     "category": "Graph Traversal",
+    "title": "Find Shortest Path with K Hops",
     "difficulty": "Hard",
-    "id": 2714,
-    "link": "https://leetcode.com/problems/find-shortest-path-with-k-hops/",
-    "title": "Find Shortest Path with K Hops"
+    "link": "https://leetcode.com/problems/find-shortest-path-with-k-hops/"
   },
   "2715": {
+    "id": 2715,
     "category": "Array & Hashing",
+    "title": "Timeout Cancellation",
     "difficulty": "Easy",
-    "id": 2715,
-    "link": "https://leetcode.com/problems/timeout-cancellation/",
-    "title": "Timeout Cancellation"
+    "link": "https://leetcode.com/problems/timeout-cancellation/"
   },
   "2716": {
+    "id": 2716,
     "category": "Array & Hashing",
+    "title": "Minimize String Length",
     "difficulty": "Easy",
-    "id": 2716,
-    "link": "https://leetcode.com/problems/minimize-string-length/",
-    "title": "Minimize String Length"
+    "link": "https://leetcode.com/problems/minimize-string-length/"
   },
   "2717": {
+    "id": 2717,
     "category": "Array & Hashing",
+    "title": "Semi-Ordered Permutation",
     "difficulty": "Easy",
-    "id": 2717,
-    "link": "https://leetcode.com/problems/semi-ordered-permutation/",
-    "title": "Semi-Ordered Permutation"
+    "link": "https://leetcode.com/problems/semi-ordered-permutation/"
   },
   "2718": {
+    "id": 2718,
     "category": "Array & Hashing",
+    "title": "Sum of Matrix After Queries",
     "difficulty": "Medium",
-    "id": 2718,
-    "link": "https://leetcode.com/problems/sum-of-matrix-after-queries/",
-    "title": "Sum of Matrix After Queries"
+    "link": "https://leetcode.com/problems/sum-of-matrix-after-queries/"
   },
   "2719": {
+    "id": 2719,
     "category": "Dynamic Programming",
+    "title": "Count of Integers",
     "difficulty": "Hard",
-    "id": 2719,
-    "link": "https://leetcode.com/problems/count-of-integers/",
-    "title": "Count of Integers"
+    "link": "https://leetcode.com/problems/count-of-integers/"
   },
   "2720": {
+    "id": 2720,
     "category": "Database",
+    "title": "Popularity Percentage",
     "difficulty": "Hard",
-    "id": 2720,
-    "link": "https://leetcode.com/problems/popularity-percentage/",
-    "title": "Popularity Percentage"
+    "link": "https://leetcode.com/problems/popularity-percentage/"
   },
   "2721": {
+    "id": 2721,
     "category": "Array & Hashing",
+    "title": "Execute Asynchronous Functions in Parallel",
     "difficulty": "Medium",
-    "id": 2721,
-    "link": "https://leetcode.com/problems/execute-asynchronous-functions-in-parallel/",
-    "title": "Execute Asynchronous Functions in Parallel"
+    "link": "https://leetcode.com/problems/execute-asynchronous-functions-in-parallel/"
   },
   "2722": {
+    "id": 2722,
     "category": "Array & Hashing",
+    "title": "Join Two Arrays by ID",
     "difficulty": "Medium",
-    "id": 2722,
-    "link": "https://leetcode.com/problems/join-two-arrays-by-id/",
-    "title": "Join Two Arrays by ID"
+    "link": "https://leetcode.com/problems/join-two-arrays-by-id/"
   },
   "2723": {
+    "id": 2723,
     "category": "Array & Hashing",
+    "title": "Add Two Promises",
     "difficulty": "Easy",
-    "id": 2723,
-    "link": "https://leetcode.com/problems/add-two-promises/",
-    "title": "Add Two Promises"
+    "link": "https://leetcode.com/problems/add-two-promises/"
   },
-  "2724": {"category": "Array & Hashing", "difficulty": "Easy", "id": 2724, "link": "https://leetcode.com/problems/sort-by/", "title": "Sort By"},
-  "2725": {
+  "2724": {
+    "id": 2724,
     "category": "Array & Hashing",
+    "title": "Sort By",
     "difficulty": "Easy",
+    "link": "https://leetcode.com/problems/sort-by/"
+  },
+  "2725": {
     "id": 2725,
-    "link": "https://leetcode.com/problems/interval-cancellation/",
-    "title": "Interval Cancellation"
+    "category": "Array & Hashing",
+    "title": "Interval Cancellation",
+    "difficulty": "Easy",
+    "link": "https://leetcode.com/problems/interval-cancellation/"
   },
   "2726": {
+    "id": 2726,
     "category": "Array & Hashing",
+    "title": "Calculator with Method Chaining",
     "difficulty": "Easy",
-    "id": 2726,
-    "link": "https://leetcode.com/problems/calculator-with-method-chaining/",
-    "title": "Calculator with Method Chaining"
+    "link": "https://leetcode.com/problems/calculator-with-method-chaining/"
   },
   "2727": {
+    "id": 2727,
     "category": "Array & Hashing",
+    "title": "Is Object Empty",
     "difficulty": "Easy",
-    "id": 2727,
-    "link": "https://leetcode.com/problems/is-object-empty/",
-    "title": "Is Object Empty"
+    "link": "https://leetcode.com/problems/is-object-empty/"
   },
   "2728": {
+    "id": 2728,
     "category": "Array & Hashing",
+    "title": "Count Houses in a Circular Street",
     "difficulty": "Easy",
-    "id": 2728,
-    "link": "https://leetcode.com/problems/count-houses-in-a-circular-street/",
-    "title": "Count Houses in a Circular Street"
+    "link": "https://leetcode.com/problems/count-houses-in-a-circular-street/"
   },
   "2729": {
+    "id": 2729,
     "category": "Math & Geometry",
+    "title": "Check if The Number is Fascinating",
     "difficulty": "Easy",
-    "id": 2729,
-    "link": "https://leetcode.com/problems/check-if-the-number-is-fascinating/",
-    "title": "Check if The Number is Fascinating"
+    "link": "https://leetcode.com/problems/check-if-the-number-is-fascinating/"
   },
   "2730": {
+    "id": 2730,
     "category": "Sliding Window",
+    "title": "Find the Longest Semi-Repetitive Substring",
     "difficulty": "Medium",
-    "id": 2730,
-    "link": "https://leetcode.com/problems/find-the-longest-semi-repetitive-substring/",
-    "title": "Find the Longest Semi-Repetitive Substring"
+    "link": "https://leetcode.com/problems/find-the-longest-semi-repetitive-substring/"
   },
   "2731": {
+    "id": 2731,
     "category": "Array & Hashing",
+    "title": "Movement of Robots",
     "difficulty": "Medium",
-    "id": 2731,
-    "link": "https://leetcode.com/problems/movement-of-robots/",
-    "title": "Movement of Robots"
+    "link": "https://leetcode.com/problems/movement-of-robots/"
   },
   "2732": {
+    "id": 2732,
     "category": "Bit Manipulation",
+    "title": "Find a Good Subset of the Matrix",
     "difficulty": "Hard",
-    "id": 2732,
-    "link": "https://leetcode.com/problems/find-a-good-subset-of-the-matrix/",
-    "title": "Find a Good Subset of the Matrix"
+    "link": "https://leetcode.com/problems/find-a-good-subset-of-the-matrix/"
   },
   "2733": {
+    "id": 2733,
     "category": "Array & Hashing",
+    "title": "Neither Minimum nor Maximum",
     "difficulty": "Easy",
-    "id": 2733,
-    "link": "https://leetcode.com/problems/neither-minimum-nor-maximum/",
-    "title": "Neither Minimum nor Maximum"
+    "link": "https://leetcode.com/problems/neither-minimum-nor-maximum/"
   },
   "2734": {
+    "id": 2734,
     "category": "Greedy",
+    "title": "Lexicographically Smallest String After Substring Operation",
     "difficulty": "Medium",
-    "id": 2734,
-    "link": "https://leetcode.com/problems/lexicographically-smallest-string-after-substring-operation/",
-    "title": "Lexicographically Smallest String After Substring Operation"
+    "link": "https://leetcode.com/problems/lexicographically-smallest-string-after-substring-operation/"
   },
   "2735": {
+    "id": 2735,
     "category": "Array & Hashing",
+    "title": "Collecting Chocolates",
     "difficulty": "Medium",
-    "id": 2735,
-    "link": "https://leetcode.com/problems/collecting-chocolates/",
-    "title": "Collecting Chocolates"
+    "link": "https://leetcode.com/problems/collecting-chocolates/"
   },
   "2736": {
+    "id": 2736,
     "category": "Tree",
+    "title": "Maximum Sum Queries",
     "difficulty": "Hard",
-    "id": 2736,
-    "link": "https://leetcode.com/problems/maximum-sum-queries/",
-    "title": "Maximum Sum Queries"
+    "link": "https://leetcode.com/problems/maximum-sum-queries/"
   },
   "2737": {
+    "id": 2737,
     "category": "Graph Traversal",
+    "title": "Find the Closest Marked Node",
     "difficulty": "Medium",
-    "id": 2737,
-    "link": "https://leetcode.com/problems/find-the-closest-marked-node/",
-    "title": "Find the Closest Marked Node"
+    "link": "https://leetcode.com/problems/find-the-closest-marked-node/"
   },
   "2738": {
+    "id": 2738,
     "category": "Database",
+    "title": "Count Occurrences in Text",
     "difficulty": "Medium",
-    "id": 2738,
-    "link": "https://leetcode.com/problems/count-occurrences-in-text/",
-    "title": "Count Occurrences in Text"
+    "link": "https://leetcode.com/problems/count-occurrences-in-text/"
   },
   "2739": {
+    "id": 2739,
     "category": "Math & Geometry",
+    "title": "Total Distance Traveled",
     "difficulty": "Easy",
-    "id": 2739,
-    "link": "https://leetcode.com/problems/total-distance-traveled/",
-    "title": "Total Distance Traveled"
+    "link": "https://leetcode.com/problems/total-distance-traveled/"
   },
   "2740": {
+    "id": 2740,
     "category": "Array & Hashing",
+    "title": "Find the Value of the Partition",
     "difficulty": "Medium",
-    "id": 2740,
-    "link": "https://leetcode.com/problems/find-the-value-of-the-partition/",
-    "title": "Find the Value of the Partition"
+    "link": "https://leetcode.com/problems/find-the-value-of-the-partition/"
   },
   "2741": {
+    "id": 2741,
     "category": "Dynamic Programming",
+    "title": "Special Permutations",
     "difficulty": "Medium",
-    "id": 2741,
-    "link": "https://leetcode.com/problems/special-permutations/",
-    "title": "Special Permutations"
+    "link": "https://leetcode.com/problems/special-permutations/"
   },
   "2742": {
+    "id": 2742,
     "category": "Dynamic Programming",
+    "title": "Painting the Walls",
     "difficulty": "Hard",
-    "id": 2742,
-    "link": "https://leetcode.com/problems/painting-the-walls/",
-    "title": "Painting the Walls"
+    "link": "https://leetcode.com/problems/painting-the-walls/"
   },
   "2743": {
+    "id": 2743,
     "category": "Sliding Window",
+    "title": "Count Substrings Without Repeating Character",
     "difficulty": "Medium",
-    "id": 2743,
-    "link": "https://leetcode.com/problems/count-substrings-without-repeating-character/",
-    "title": "Count Substrings Without Repeating Character"
+    "link": "https://leetcode.com/problems/count-substrings-without-repeating-character/"
   },
   "2744": {
+    "id": 2744,
     "category": "Array & Hashing",
+    "title": "Find Maximum Number of String Pairs",
     "difficulty": "Easy",
-    "id": 2744,
-    "link": "https://leetcode.com/problems/find-maximum-number-of-string-pairs/",
-    "title": "Find Maximum Number of String Pairs"
+    "link": "https://leetcode.com/problems/find-maximum-number-of-string-pairs/"
   },
   "2745": {
+    "id": 2745,
     "category": "Dynamic Programming",
+    "title": "Construct the Longest New String",
     "difficulty": "Medium",
-    "id": 2745,
-    "link": "https://leetcode.com/problems/construct-the-longest-new-string/",
-    "title": "Construct the Longest New String"
+    "link": "https://leetcode.com/problems/construct-the-longest-new-string/"
   },
   "2746": {
+    "id": 2746,
     "category": "Dynamic Programming",
+    "title": "Decremental String Concatenation",
     "difficulty": "Medium",
-    "id": 2746,
-    "link": "https://leetcode.com/problems/decremental-string-concatenation/",
-    "title": "Decremental String Concatenation"
+    "link": "https://leetcode.com/problems/decremental-string-concatenation/"
   },
   "2747": {
+    "id": 2747,
     "category": "Sliding Window",
+    "title": "Count Zero Request Servers",
     "difficulty": "Medium",
-    "id": 2747,
-    "link": "https://leetcode.com/problems/count-zero-request-servers/",
-    "title": "Count Zero Request Servers"
+    "link": "https://leetcode.com/problems/count-zero-request-servers/"
   },
   "2748": {
+    "id": 2748,
     "category": "Math & Geometry",
+    "title": "Number of Beautiful Pairs",
     "difficulty": "Easy",
-    "id": 2748,
-    "link": "https://leetcode.com/problems/number-of-beautiful-pairs/",
-    "title": "Number of Beautiful Pairs"
+    "link": "https://leetcode.com/problems/number-of-beautiful-pairs/"
   },
   "2749": {
+    "id": 2749,
     "category": "Bit Manipulation",
+    "title": "Minimum Operations to Make the Integer Zero",
     "difficulty": "Medium",
-    "id": 2749,
-    "link": "https://leetcode.com/problems/minimum-operations-to-make-the-integer-zero/",
-    "title": "Minimum Operations to Make the Integer Zero"
+    "link": "https://leetcode.com/problems/minimum-operations-to-make-the-integer-zero/"
   },
   "2750": {
+    "id": 2750,
     "category": "Dynamic Programming",
+    "title": "Ways to Split Array Into Good Subarrays",
     "difficulty": "Medium",
-    "id": 2750,
-    "link": "https://leetcode.com/problems/ways-to-split-array-into-good-subarrays/",
-    "title": "Ways to Split Array Into Good Subarrays"
+    "link": "https://leetcode.com/problems/ways-to-split-array-into-good-subarrays/"
   },
   "2751": {
+    "id": 2751,
     "category": "Stack",
+    "title": "Robot Collisions",
     "difficulty": "Hard",
-    "id": 2751,
-    "link": "https://leetcode.com/problems/robot-collisions/",
-    "title": "Robot Collisions"
+    "link": "https://leetcode.com/problems/robot-collisions/"
   },
   "2752": {
+    "id": 2752,
     "category": "Database",
+    "title": "Customers with Maximum Number of Transactions on Consecutive Days",
     "difficulty": "Hard",
-    "id": 2752,
-    "link": "https://leetcode.com/problems/customers-with-maximum-number-of-transactions-on-consecutive-days/",
-    "title": "Customers with Maximum Number of Transactions on Consecutive Days"
+    "link": "https://leetcode.com/problems/customers-with-maximum-number-of-transactions-on-consecutive-days/"
   },
   "2753": {
+    "id": 2753,
     "category": "Array & Hashing",
+    "title": "Count Houses in a Circular Street II",
     "difficulty": "Hard",
-    "id": 2753,
-    "link": "https://leetcode.com/problems/count-houses-in-a-circular-street-ii/",
-    "title": "Count Houses in a Circular Street II"
+    "link": "https://leetcode.com/problems/count-houses-in-a-circular-street-ii/"
   },
   "2754": {
+    "id": 2754,
     "category": "Array & Hashing",
+    "title": "Bind Function to Context",
     "difficulty": "Medium",
-    "id": 2754,
-    "link": "https://leetcode.com/problems/bind-function-to-context/",
-    "title": "Bind Function to Context"
+    "link": "https://leetcode.com/problems/bind-function-to-context/"
   },
   "2755": {
+    "id": 2755,
     "category": "Array & Hashing",
+    "title": "Deep Merge of Two Objects",
     "difficulty": "Medium",
-    "id": 2755,
-    "link": "https://leetcode.com/problems/deep-merge-of-two-objects/",
-    "title": "Deep Merge of Two Objects"
+    "link": "https://leetcode.com/problems/deep-merge-of-two-objects/"
   },
   "2756": {
+    "id": 2756,
     "category": "Array & Hashing",
+    "title": "Query Batching",
     "difficulty": "Hard",
-    "id": 2756,
-    "link": "https://leetcode.com/problems/query-batching/",
-    "title": "Query Batching"
+    "link": "https://leetcode.com/problems/query-batching/"
   },
   "2757": {
+    "id": 2757,
     "category": "Array & Hashing",
+    "title": "Generate Circular Array Values",
     "difficulty": "Medium",
-    "id": 2757,
-    "link": "https://leetcode.com/problems/generate-circular-array-values/",
-    "title": "Generate Circular Array Values"
+    "link": "https://leetcode.com/problems/generate-circular-array-values/"
+  },
+  "2758": {
+    "id": 2758,
+    "category": "Array & Hashing",
+    "title": "Next Day",
+    "difficulty": "Easy",
+    "link": "https://leetcode.com/problems/next-day/"
   },
-  "2758": {"category": "Array & Hashing", "difficulty": "Easy", "id": 2758, "link": "https://leetcode.com/problems/next-day/", "title": "Next Day"},
   "2759": {
+    "id": 2759,
     "category": "Array & Hashing",
+    "title": "Convert JSON String to Object",
     "difficulty": "Hard",
-    "id": 2759,
-    "link": "https://leetcode.com/problems/convert-json-string-to-object/",
-    "title": "Convert JSON String to Object"
+    "link": "https://leetcode.com/problems/convert-json-string-to-object/"
   },
   "2760": {
+    "id": 2760,
     "category": "Sliding Window",
+    "title": "Longest Even Odd Subarray With Threshold",
     "difficulty": "Easy",
-    "id": 2760,
-    "link": "https://leetcode.com/problems/longest-even-odd-subarray-with-threshold/",
-    "title": "Longest Even Odd Subarray With Threshold"
+    "link": "https://leetcode.com/problems/longest-even-odd-subarray-with-threshold/"
   },
   "2761": {
+    "id": 2761,
     "category": "Math & Geometry",
+    "title": "Prime Pairs With Target Sum",
     "difficulty": "Medium",
-    "id": 2761,
-    "link": "https://leetcode.com/problems/prime-pairs-with-target-sum/",
-    "title": "Prime Pairs With Target Sum"
+    "link": "https://leetcode.com/problems/prime-pairs-with-target-sum/"
   },
   "2762": {
+    "id": 2762,
     "category": "Sliding Window",
+    "title": "Continuous Subarrays",
     "difficulty": "Medium",
-    "id": 2762,
-    "link": "https://leetcode.com/problems/continuous-subarrays/",
-    "title": "Continuous Subarrays"
+    "link": "https://leetcode.com/problems/continuous-subarrays/"
   },
   "2763": {
+    "id": 2763,
     "category": "Array & Hashing",
+    "title": "Sum of Imbalance Numbers of All Subarrays",
     "difficulty": "Hard",
-    "id": 2763,
-    "link": "https://leetcode.com/problems/sum-of-imbalance-numbers-of-all-subarrays/",
-    "title": "Sum of Imbalance Numbers of All Subarrays"
+    "link": "https://leetcode.com/problems/sum-of-imbalance-numbers-of-all-subarrays/"
   },
   "2764": {
+    "id": 2764,
     "category": "Tree",
+    "title": "Is Array a Preorder of Some ‌Binary Tree",
     "difficulty": "Medium",
-    "id": 2764,
-    "link": "https://leetcode.com/problems/is-array-a-preorder-of-some-binary-tree/",
-    "title": "Is Array a Preorder of Some ‌Binary Tree"
+    "link": "https://leetcode.com/problems/is-array-a-preorder-of-some-binary-tree/"
   },
   "2765": {
+    "id": 2765,
     "category": "Array & Hashing",
+    "title": "Longest Alternating Subarray",
     "difficulty": "Easy",
-    "id": 2765,
-    "link": "https://leetcode.com/problems/longest-alternating-subarray/",
-    "title": "Longest Alternating Subarray"
+    "link": "https://leetcode.com/problems/longest-alternating-subarray/"
   },
   "2766": {
+    "id": 2766,
     "category": "Array & Hashing",
+    "title": "Relocate Marbles",
     "difficulty": "Medium",
-    "id": 2766,
-    "link": "https://leetcode.com/problems/relocate-marbles/",
-    "title": "Relocate Marbles"
+    "link": "https://leetcode.com/problems/relocate-marbles/"
   },
   "2767": {
+    "id": 2767,
     "category": "Dynamic Programming",
+    "title": "Partition String Into Minimum Beautiful Substrings",
     "difficulty": "Medium",
-    "id": 2767,
-    "link": "https://leetcode.com/problems/partition-string-into-minimum-beautiful-substrings/",
-    "title": "Partition String Into Minimum Beautiful Substrings"
+    "link": "https://leetcode.com/problems/partition-string-into-minimum-beautiful-substrings/"
   },
   "2768": {
+    "id": 2768,
     "category": "Array & Hashing",
+    "title": "Number of Black Blocks",
     "difficulty": "Medium",
-    "id": 2768,
-    "link": "https://leetcode.com/problems/number-of-black-blocks/",
-    "title": "Number of Black Blocks"
+    "link": "https://leetcode.com/problems/number-of-black-blocks/"
   },
   "2769": {
+    "id": 2769,
     "category": "Math & Geometry",
+    "title": "Find the Maximum Achievable Number",
     "difficulty": "Easy",
-    "id": 2769,
-    "link": "https://leetcode.com/problems/find-the-maximum-achievable-number/",
-    "title": "Find the Maximum Achievable Number"
+    "link": "https://leetcode.com/problems/find-the-maximum-achievable-number/"
   },
   "2770": {
+    "id": 2770,
     "category": "Dynamic Programming",
+    "title": "Maximum Number of Jumps to Reach the Last Index",
     "difficulty": "Medium",
-    "id": 2770,
-    "link": "https://leetcode.com/problems/maximum-number-of-jumps-to-reach-the-last-index/",
-    "title": "Maximum Number of Jumps to Reach the Last Index"
+    "link": "https://leetcode.com/problems/maximum-number-of-jumps-to-reach-the-last-index/"
   },
   "2771": {
+    "id": 2771,
     "category": "Dynamic Programming",
+    "title": "Longest Non-decreasing Subarray From Two Arrays",
     "difficulty": "Medium",
-    "id": 2771,
-    "link": "https://leetcode.com/problems/longest-non-decreasing-subarray-from-two-arrays/",
-    "title": "Longest Non-decreasing Subarray From Two Arrays"
+    "link": "https://leetcode.com/problems/longest-non-decreasing-subarray-from-two-arrays/"
   },
   "2772": {
+    "id": 2772,
     "category": "Array & Hashing",
+    "title": "Apply Operations to Make All Array Elements Equal to Zero",
     "difficulty": "Medium",
-    "id": 2772,
-    "link": "https://leetcode.com/problems/apply-operations-to-make-all-array-elements-equal-to-zero/",
-    "title": "Apply Operations to Make All Array Elements Equal to Zero"
+    "link": "https://leetcode.com/problems/apply-operations-to-make-all-array-elements-equal-to-zero/"
   },
   "2773": {
+    "id": 2773,
     "category": "Tree",
+    "title": "Height of Special Binary Tree",
     "difficulty": "Medium",
-    "id": 2773,
-    "link": "https://leetcode.com/problems/height-of-special-binary-tree/",
-    "title": "Height of Special Binary Tree"
+    "link": "https://leetcode.com/problems/height-of-special-binary-tree/"
   },
   "2774": {
+    "id": 2774,
     "category": "Array & Hashing",
+    "title": "Array Upper Bound",
     "difficulty": "Easy",
-    "id": 2774,
-    "link": "https://leetcode.com/problems/array-upper-bound/",
-    "title": "Array Upper Bound"
+    "link": "https://leetcode.com/problems/array-upper-bound/"
   },
   "2775": {
+    "id": 2775,
     "category": "Array & Hashing",
+    "title": "Undefined to Null",
     "difficulty": "Medium",
-    "id": 2775,
-    "link": "https://leetcode.com/problems/undefined-to-null/",
-    "title": "Undefined to Null"
+    "link": "https://leetcode.com/problems/undefined-to-null/"
   },
   "2776": {
+    "id": 2776,
     "category": "Array & Hashing",
+    "title": "Convert Callback Based Function to Promise Based Function",
     "difficulty": "Medium",
-    "id": 2776,
-    "link": "https://leetcode.com/problems/convert-callback-based-function-to-promise-based-function/",
-    "title": "Convert Callback Based Function to Promise Based Function"
+    "link": "https://leetcode.com/problems/convert-callback-based-function-to-promise-based-function/"
   },
   "2777": {
+    "id": 2777,
     "category": "Array & Hashing",
+    "title": "Date Range Generator",
     "difficulty": "Medium",
-    "id": 2777,
-    "link": "https://leetcode.com/problems/date-range-generator/",
-    "title": "Date Range Generator"
+    "link": "https://leetcode.com/problems/date-range-generator/"
   },
   "2778": {
+    "id": 2778,
     "category": "Array & Hashing",
+    "title": "Sum of Squares of Special Elements ",
     "difficulty": "Easy",
-    "id": 2778,
-    "link": "https://leetcode.com/problems/sum-of-squares-of-special-elements/",
-    "title": "Sum of Squares of Special Elements "
+    "link": "https://leetcode.com/problems/sum-of-squares-of-special-elements/"
   },
   "2779": {
+    "id": 2779,
     "category": "Sliding Window",
+    "title": "Maximum Beauty of an Array After Applying Operation",
     "difficulty": "Medium",
-    "id": 2779,
-    "link": "https://leetcode.com/problems/maximum-beauty-of-an-array-after-applying-operation/",
-    "title": "Maximum Beauty of an Array After Applying Operation"
+    "link": "https://leetcode.com/problems/maximum-beauty-of-an-array-after-applying-operation/"
   },
   "2780": {
+    "id": 2780,
     "category": "Array & Hashing",
+    "title": "Minimum Index of a Valid Split",
     "difficulty": "Medium",
-    "id": 2780,
-    "link": "https://leetcode.com/problems/minimum-index-of-a-valid-split/",
-    "title": "Minimum Index of a Valid Split"
+    "link": "https://leetcode.com/problems/minimum-index-of-a-valid-split/"
   },
   "2781": {
+    "id": 2781,
     "category": "Sliding Window",
+    "title": "Length of the Longest Valid Substring",
     "difficulty": "Hard",
-    "id": 2781,
-    "link": "https://leetcode.com/problems/length-of-the-longest-valid-substring/",
-    "title": "Length of the Longest Valid Substring"
+    "link": "https://leetcode.com/problems/length-of-the-longest-valid-substring/"
   },
   "2782": {
+    "id": 2782,
     "category": "Graph Traversal",
+    "title": "Number of Unique Categories",
     "difficulty": "Medium",
-    "id": 2782,
-    "link": "https://leetcode.com/problems/number-of-unique-categories/",
-    "title": "Number of Unique Categories"
+    "link": "https://leetcode.com/problems/number-of-unique-categories/"
   },
   "2783": {
+    "id": 2783,
     "category": "Database",
+    "title": "Flight Occupancy and Waitlist Analysis",
     "difficulty": "Medium",
-    "id": 2783,
-    "link": "https://leetcode.com/problems/flight-occupancy-and-waitlist-analysis/",
-    "title": "Flight Occupancy and Waitlist Analysis"
+    "link": "https://leetcode.com/problems/flight-occupancy-and-waitlist-analysis/"
   },
   "2784": {
+    "id": 2784,
     "category": "Array & Hashing",
+    "title": "Check if Array is Good",
     "difficulty": "Easy",
-    "id": 2784,
-    "link": "https://leetcode.com/problems/check-if-array-is-good/",
-    "title": "Check if Array is Good"
+    "link": "https://leetcode.com/problems/check-if-array-is-good/"
   },
   "2785": {
+    "id": 2785,
     "category": "Array & Hashing",
+    "title": "Sort Vowels in a String",
     "difficulty": "Medium",
-    "id": 2785,
-    "link": "https://leetcode.com/problems/sort-vowels-in-a-string/",
-    "title": "Sort Vowels in a String"
+    "link": "https://leetcode.com/problems/sort-vowels-in-a-string/"
   },
   "2786": {
+    "id": 2786,
     "category": "Dynamic Programming",
+    "title": "Visit Array Positions to Maximize Score",
     "difficulty": "Medium",
-    "id": 2786,
-    "link": "https://leetcode.com/problems/visit-array-positions-to-maximize-score/",
-    "title": "Visit Array Positions to Maximize Score"
+    "link": "https://leetcode.com/problems/visit-array-positions-to-maximize-score/"
   },
   "2787": {
+    "id": 2787,
     "category": "Dynamic Programming",
+    "title": "Ways to Express an Integer as Sum of Powers",
     "difficulty": "Medium",
-    "id": 2787,
-    "link": "https://leetcode.com/problems/ways-to-express-an-integer-as-sum-of-powers/",
-    "title": "Ways to Express an Integer as Sum of Powers"
+    "link": "https://leetcode.com/problems/ways-to-express-an-integer-as-sum-of-powers/"
   },
   "2788": {
+    "id": 2788,
     "category": "Array & Hashing",
+    "title": "Split Strings by Separator",
     "difficulty": "Easy",
-    "id": 2788,
-    "link": "https://leetcode.com/problems/split-strings-by-separator/",
-    "title": "Split Strings by Separator"
+    "link": "https://leetcode.com/problems/split-strings-by-separator/"
   },
   "2789": {
+    "id": 2789,
     "category": "Greedy",
+    "title": "Largest Element in an Array after Merge Operations",
     "difficulty": "Medium",
-    "id": 2789,
-    "link": "https://leetcode.com/problems/largest-element-in-an-array-after-merge-operations/",
-    "title": "Largest Element in an Array after Merge Operations"
+    "link": "https://leetcode.com/problems/largest-element-in-an-array-after-merge-operations/"
   },
   "2790": {
+    "id": 2790,
     "category": "Binary Search",
+    "title": "Maximum Number of Groups With Increasing Length",
     "difficulty": "Hard",
-    "id": 2790,
-    "link": "https://leetcode.com/problems/maximum-number-of-groups-with-increasing-length/",
-    "title": "Maximum Number of Groups With Increasing Length"
+    "link": "https://leetcode.com/problems/maximum-number-of-groups-with-increasing-length/"
   },
   "2791": {
+    "id": 2791,
     "category": "Tree",
+    "title": "Count Paths That Can Form a Palindrome in a Tree",
     "difficulty": "Hard",
-    "id": 2791,
-    "link": "https://leetcode.com/problems/count-paths-that-can-form-a-palindrome-in-a-tree/",
-    "title": "Count Paths That Can Form a Palindrome in a Tree"
+    "link": "https://leetcode.com/problems/count-paths-that-can-form-a-palindrome-in-a-tree/"
   },
   "2792": {
+    "id": 2792,
     "category": "Tree",
+    "title": "Count Nodes That Are Great Enough",
     "difficulty": "Hard",
-    "id": 2792,
-    "link": "https://leetcode.com/problems/count-nodes-that-are-great-enough/",
-    "title": "Count Nodes That Are Great Enough"
+    "link": "https://leetcode.com/problems/count-nodes-that-are-great-enough/"
   },
   "2793": {
+    "id": 2793,
     "category": "Array & Hashing",
+    "title": "Status of Flight Tickets",
     "difficulty": "Hard",
-    "id": 2793,
-    "link": "https://leetcode.com/problems/status-of-flight-tickets/",
-    "title": "Status of Flight Tickets"
+    "link": "https://leetcode.com/problems/status-of-flight-tickets/"
   },
   "2794": {
+    "id": 2794,
     "category": "Array & Hashing",
+    "title": "Create Object from Two Arrays",
     "difficulty": "Easy",
-    "id": 2794,
-    "link": "https://leetcode.com/problems/create-object-from-two-arrays/",
-    "title": "Create Object from Two Arrays"
+    "link": "https://leetcode.com/problems/create-object-from-two-arrays/"
   },
   "2795": {
+    "id": 2795,
     "category": "Array & Hashing",
+    "title": "Parallel Execution of Promises for Individual Results Retrieval",
     "difficulty": "Medium",
-    "id": 2795,
-    "link": "https://leetcode.com/problems/parallel-execution-of-promises-for-individual-results-retrieval/",
-    "title": "Parallel Execution of Promises for Individual Results Retrieval"
+    "link": "https://leetcode.com/problems/parallel-execution-of-promises-for-individual-results-retrieval/"
   },
   "2796": {
+    "id": 2796,
     "category": "Array & Hashing",
+    "title": "Repeat String",
     "difficulty": "Easy",
-    "id": 2796,
-    "link": "https://leetcode.com/problems/repeat-string/",
-    "title": "Repeat String"
+    "link": "https://leetcode.com/problems/repeat-string/"
   },
   "2797": {
+    "id": 2797,
     "category": "Array & Hashing",
+    "title": "Partial Function with Placeholders",
     "difficulty": "Easy",
-    "id": 2797,
-    "link": "https://leetcode.com/problems/partial-function-with-placeholders/",
-    "title": "Partial Function with Placeholders"
+    "link": "https://leetcode.com/problems/partial-function-with-placeholders/"
   },
   "2798": {
+    "id": 2798,
     "category": "Array & Hashing",
+    "title": "Number of Employees Who Met the Target",
     "difficulty": "Easy",
-    "id": 2798,
-    "link": "https://leetcode.com/problems/number-of-employees-who-met-the-target/",
-    "title": "Number of Employees Who Met the Target"
+    "link": "https://leetcode.com/problems/number-of-employees-who-met-the-target/"
   },
   "2799": {
+    "id": 2799,
     "category": "Sliding Window",
+    "title": "Count Complete Subarrays in an Array",
     "difficulty": "Medium",
-    "id": 2799,
-    "link": "https://leetcode.com/problems/count-complete-subarrays-in-an-array/",
-    "title": "Count Complete Subarrays in an Array"
+    "link": "https://leetcode.com/problems/count-complete-subarrays-in-an-array/"
   },
   "2800": {
+    "id": 2800,
     "category": "Greedy",
+    "title": "Shortest String That Contains Three Strings",
     "difficulty": "Medium",
-    "id": 2800,
-    "link": "https://leetcode.com/problems/shortest-string-that-contains-three-strings/",
-    "title": "Shortest String That Contains Three Strings"
+    "link": "https://leetcode.com/problems/shortest-string-that-contains-three-strings/"
   },
   "2801": {
+    "id": 2801,
     "category": "Dynamic Programming",
+    "title": "Count Stepping Numbers in Range",
     "difficulty": "Hard",
-    "id": 2801,
-    "link": "https://leetcode.com/problems/count-stepping-numbers-in-range/",
-    "title": "Count Stepping Numbers in Range"
+    "link": "https://leetcode.com/problems/count-stepping-numbers-in-range/"
   },
   "2802": {
+    "id": 2802,
     "category": "Bit Manipulation",
+    "title": "Find The K-th Lucky Number",
     "difficulty": "Medium",
-    "id": 2802,
-    "link": "https://leetcode.com/problems/find-the-k-th-lucky-number/",
-    "title": "Find The K-th Lucky Number"
+    "link": "https://leetcode.com/problems/find-the-k-th-lucky-number/"
   },
   "2803": {
+    "id": 2803,
     "category": "Array & Hashing",
+    "title": "Factorial Generator",
     "difficulty": "Easy",
-    "id": 2803,
-    "link": "https://leetcode.com/problems/factorial-generator/",
-    "title": "Factorial Generator"
+    "link": "https://leetcode.com/problems/factorial-generator/"
   },
   "2804": {
+    "id": 2804,
     "category": "Array & Hashing",
+    "title": "Array Prototype ForEach",
     "difficulty": "Easy",
-    "id": 2804,
-    "link": "https://leetcode.com/problems/array-prototype-foreach/",
-    "title": "Array Prototype ForEach"
+    "link": "https://leetcode.com/problems/array-prototype-foreach/"
   },
   "2805": {
+    "id": 2805,
     "category": "Array & Hashing",
+    "title": "Custom Interval",
     "difficulty": "Medium",
-    "id": 2805,
-    "link": "https://leetcode.com/problems/custom-interval/",
-    "title": "Custom Interval"
+    "link": "https://leetcode.com/problems/custom-interval/"
   },
   "2806": {
+    "id": 2806,
     "category": "Math & Geometry",
+    "title": "Account Balance After Rounded Purchase",
     "difficulty": "Easy",
-    "id": 2806,
-    "link": "https://leetcode.com/problems/account-balance-after-rounded-purchase/",
-    "title": "Account Balance After Rounded Purchase"
+    "link": "https://leetcode.com/problems/account-balance-after-rounded-purchase/"
   },
   "2807": {
+    "id": 2807,
     "category": "Linked List",
+    "title": "Insert Greatest Common Divisors in Linked List",
     "difficulty": "Medium",
-    "id": 2807,
-    "link": "https://leetcode.com/problems/insert-greatest-common-divisors-in-linked-list/",
-    "title": "Insert Greatest Common Divisors in Linked List"
+    "link": "https://leetcode.com/problems/insert-greatest-common-divisors-in-linked-list/"
   },
   "2808": {
+    "id": 2808,
     "category": "Array & Hashing",
+    "title": "Minimum Seconds to Equalize a Circular Array",
     "difficulty": "Medium",
-    "id": 2808,
-    "link": "https://leetcode.com/problems/minimum-seconds-to-equalize-a-circular-array/",
-    "title": "Minimum Seconds to Equalize a Circular Array"
+    "link": "https://leetcode.com/problems/minimum-seconds-to-equalize-a-circular-array/"
   },
   "2809": {
+    "id": 2809,
     "category": "Dynamic Programming",
+    "title": "Minimum Time to Make Array Sum At Most x",
     "difficulty": "Hard",
-    "id": 2809,
-    "link": "https://leetcode.com/problems/minimum-time-to-make-array-sum-at-most-x/",
-    "title": "Minimum Time to Make Array Sum At Most x"
+    "link": "https://leetcode.com/problems/minimum-time-to-make-array-sum-at-most-x/"
   },
   "2810": {
+    "id": 2810,
     "category": "Array & Hashing",
+    "title": "Faulty Keyboard",
     "difficulty": "Easy",
-    "id": 2810,
-    "link": "https://leetcode.com/problems/faulty-keyboard/",
-    "title": "Faulty Keyboard"
+    "link": "https://leetcode.com/problems/faulty-keyboard/"
   },
   "2811": {
+    "id": 2811,
     "category": "Dynamic Programming",
+    "title": "Check if it is Possible to Split Array",
     "difficulty": "Medium",
-    "id": 2811,
-    "link": "https://leetcode.com/problems/check-if-it-is-possible-to-split-array/",
-    "title": "Check if it is Possible to Split Array"
+    "link": "https://leetcode.com/problems/check-if-it-is-possible-to-split-array/"
   },
   "2812": {
+    "id": 2812,
     "category": "Graph Traversal",
+    "title": "Find the Safest Path in a Grid",
     "difficulty": "Medium",
-    "id": 2812,
-    "link": "https://leetcode.com/problems/find-the-safest-path-in-a-grid/",
-    "title": "Find the Safest Path in a Grid"
+    "link": "https://leetcode.com/problems/find-the-safest-path-in-a-grid/"
   },
   "2813": {
+    "id": 2813,
     "category": "Heap (Priority Queue)",
+    "title": "Maximum Elegance of a K-Length Subsequence",
     "difficulty": "Hard",
-    "id": 2813,
-    "link": "https://leetcode.com/problems/maximum-elegance-of-a-k-length-subsequence/",
-    "title": "Maximum Elegance of a K-Length Subsequence"
+    "link": "https://leetcode.com/problems/maximum-elegance-of-a-k-length-subsequence/"
   },
   "2814": {
+    "id": 2814,
     "category": "Graph Traversal",
+    "title": "Minimum Time Takes to Reach Destination Without Drowning",
     "difficulty": "Hard",
-    "id": 2814,
-    "link": "https://leetcode.com/problems/minimum-time-takes-to-reach-destination-without-drowning/",
-    "title": "Minimum Time Takes to Reach Destination Without Drowning"
+    "link": "https://leetcode.com/problems/minimum-time-takes-to-reach-destination-without-drowning/"
   },
   "2815": {
+    "id": 2815,
     "category": "Array & Hashing",
+    "title": "Max Pair Sum in an Array",
     "difficulty": "Easy",
-    "id": 2815,
-    "link": "https://leetcode.com/problems/max-pair-sum-in-an-array/",
-    "title": "Max Pair Sum in an Array"
+    "link": "https://leetcode.com/problems/max-pair-sum-in-an-array/"
   },
   "2816": {
+    "id": 2816,
     "category": "Stack",
+    "title": "Double a Number Represented as a Linked List",
     "difficulty": "Medium",
-    "id": 2816,
-    "link": "https://leetcode.com/problems/double-a-number-represented-as-a-linked-list/",
-    "title": "Double a Number Represented as a Linked List"
+    "link": "https://leetcode.com/problems/double-a-number-represented-as-a-linked-list/"
   },
   "2817": {
+    "id": 2817,
     "category": "Binary Search",
+    "title": "Minimum Absolute Difference Between Elements With Constraint",
     "difficulty": "Medium",
-    "id": 2817,
-    "link": "https://leetcode.com/problems/minimum-absolute-difference-between-elements-with-constraint/",
-    "title": "Minimum Absolute Difference Between Elements With Constraint"
+    "link": "https://leetcode.com/problems/minimum-absolute-difference-between-elements-with-constraint/"
   },
   "2818": {
+    "id": 2818,
     "category": "Stack",
+    "title": "Apply Operations to Maximize Score",
     "difficulty": "Hard",
-    "id": 2818,
-    "link": "https://leetcode.com/problems/apply-operations-to-maximize-score/",
-    "title": "Apply Operations to Maximize Score"
+    "link": "https://leetcode.com/problems/apply-operations-to-maximize-score/"
   },
   "2819": {
+    "id": 2819,
     "category": "Binary Search",
+    "title": "Minimum Relative Loss After Buying Chocolates",
     "difficulty": "Hard",
-    "id": 2819,
-    "link": "https://leetcode.com/problems/minimum-relative-loss-after-buying-chocolates/",
-    "title": "Minimum Relative Loss After Buying Chocolates"
+    "link": "https://leetcode.com/problems/minimum-relative-loss-after-buying-chocolates/"
   },
   "2820": {
+    "id": 2820,
     "category": "Array & Hashing",
+    "title": "Election Results",
     "difficulty": "Medium",
-    "id": 2820,
-    "link": "https://leetcode.com/problems/election-results/",
-    "title": "Election Results"
+    "link": "https://leetcode.com/problems/election-results/"
   },
   "2821": {
+    "id": 2821,
     "category": "Array & Hashing",
+    "title": "Delay the Resolution of Each Promise",
     "difficulty": "Medium",
-    "id": 2821,
-    "link": "https://leetcode.com/problems/delay-the-resolution-of-each-promise/",
-    "title": "Delay the Resolution of Each Promise"
+    "link": "https://leetcode.com/problems/delay-the-resolution-of-each-promise/"
   },
   "2822": {
+    "id": 2822,
     "category": "Array & Hashing",
+    "title": "Inversion of Object",
     "difficulty": "Easy",
-    "id": 2822,
-    "link": "https://leetcode.com/problems/inversion-of-object/",
-    "title": "Inversion of Object"
+    "link": "https://leetcode.com/problems/inversion-of-object/"
   },
   "2823": {
+    "id": 2823,
     "category": "Array & Hashing",
+    "title": "Deep Object Filter",
     "difficulty": "Medium",
-    "id": 2823,
-    "link": "https://leetcode.com/problems/deep-object-filter/",
-    "title": "Deep Object Filter"
+    "link": "https://leetcode.com/problems/deep-object-filter/"
   },
   "2824": {
+    "id": 2824,
     "category": "Binary Search",
+    "title": "Count Pairs Whose Sum is Less than Target",
     "difficulty": "Easy",
-    "id": 2824,
-    "link": "https://leetcode.com/problems/count-pairs-whose-sum-is-less-than-target/",
-    "title": "Count Pairs Whose Sum is Less than Target"
+    "link": "https://leetcode.com/problems/count-pairs-whose-sum-is-less-than-target/"
   },
   "2825": {
+    "id": 2825,
     "category": "Two Pointers",
+    "title": "Make String a Subsequence Using Cyclic Increments",
     "difficulty": "Medium",
-    "id": 2825,
-    "link": "https://leetcode.com/problems/make-string-a-subsequence-using-cyclic-increments/",
-    "title": "Make String a Subsequence Using Cyclic Increments"
+    "link": "https://leetcode.com/problems/make-string-a-subsequence-using-cyclic-increments/"
   },
   "2826": {
+    "id": 2826,
     "category": "Dynamic Programming",
+    "title": "Sorting Three Groups",
     "difficulty": "Medium",
-    "id": 2826,
-    "link": "https://leetcode.com/problems/sorting-three-groups/",
-    "title": "Sorting Three Groups"
+    "link": "https://leetcode.com/problems/sorting-three-groups/"
   },
   "2827": {
+    "id": 2827,
     "category": "Dynamic Programming",
+    "title": "Number of Beautiful Integers in the Range",
     "difficulty": "Hard",
-    "id": 2827,
-    "link": "https://leetcode.com/problems/number-of-beautiful-integers-in-the-range/",
-    "title": "Number of Beautiful Integers in the Range"
+    "link": "https://leetcode.com/problems/number-of-beautiful-integers-in-the-range/"
   },
   "2828": {
+    "id": 2828,
     "category": "Array & Hashing",
+    "title": "Check if a String Is an Acronym of Words",
     "difficulty": "Easy",
-    "id": 2828,
-    "link": "https://leetcode.com/problems/check-if-a-string-is-an-acronym-of-words/",
-    "title": "Check if a String Is an Acronym of Words"
+    "link": "https://leetcode.com/problems/check-if-a-string-is-an-acronym-of-words/"
   },
   "2829": {
+    "id": 2829,
     "category": "Greedy",
+    "title": "Determine the Minimum Sum of a k-avoiding Array",
     "difficulty": "Medium",
-    "id": 2829,
-    "link": "https://leetcode.com/problems/determine-the-minimum-sum-of-a-k-avoiding-array/",
-    "title": "Determine the Minimum Sum of a k-avoiding Array"
+    "link": "https://leetcode.com/problems/determine-the-minimum-sum-of-a-k-avoiding-array/"
   },
   "2830": {
+    "id": 2830,
     "category": "Dynamic Programming",
+    "title": "Maximize the Profit as the Salesman",
     "difficulty": "Medium",
-    "id": 2830,
-    "link": "https://leetcode.com/problems/maximize-the-profit-as-the-salesman/",
-    "title": "Maximize the Profit as the Salesman"
+    "link": "https://leetcode.com/problems/maximize-the-profit-as-the-salesman/"
   },
   "2831": {
+    "id": 2831,
     "category": "Sliding Window",
+    "title": "Find the Longest Equal Subarray",
     "difficulty": "Medium",
-    "id": 2831,
-    "link": "https://leetcode.com/problems/find-the-longest-equal-subarray/",
-    "title": "Find the Longest Equal Subarray"
+    "link": "https://leetcode.com/problems/find-the-longest-equal-subarray/"
   },
   "2832": {
+    "id": 2832,
     "category": "Stack",
+    "title": "Maximal Range That Each Element Is Maximum in It",
     "difficulty": "Medium",
-    "id": 2832,
-    "link": "https://leetcode.com/problems/maximal-range-that-each-element-is-maximum-in-it/",
-    "title": "Maximal Range That Each Element Is Maximum in It"
+    "link": "https://leetcode.com/problems/maximal-range-that-each-element-is-maximum-in-it/"
   },
   "2833": {
+    "id": 2833,
     "category": "Array & Hashing",
+    "title": "Furthest Point From Origin",
     "difficulty": "Easy",
-    "id": 2833,
-    "link": "https://leetcode.com/problems/furthest-point-from-origin/",
-    "title": "Furthest Point From Origin"
+    "link": "https://leetcode.com/problems/furthest-point-from-origin/"
   },
   "2834": {
+    "id": 2834,
     "category": "Greedy",
+    "title": "Find the Minimum Possible Sum of a Beautiful Array",
     "difficulty": "Medium",
-    "id": 2834,
-    "link": "https://leetcode.com/problems/find-the-minimum-possible-sum-of-a-beautiful-array/",
-    "title": "Find the Minimum Possible Sum of a Beautiful Array"
+    "link": "https://leetcode.com/problems/find-the-minimum-possible-sum-of-a-beautiful-array/"
   },
   "2835": {
+    "id": 2835,
     "category": "Bit Manipulation",
+    "title": "Minimum Operations to Form Subsequence With Target Sum",
     "difficulty": "Hard",
-    "id": 2835,
-    "link": "https://leetcode.com/problems/minimum-operations-to-form-subsequence-with-target-sum/",
-    "title": "Minimum Operations to Form Subsequence With Target Sum"
+    "link": "https://leetcode.com/problems/minimum-operations-to-form-subsequence-with-target-sum/"
   },
   "2836": {
+    "id": 2836,
     "category": "Dynamic Programming",
+    "title": "Maximize Value of Function in a Ball Passing Game",
     "difficulty": "Hard",
-    "id": 2836,
-    "link": "https://leetcode.com/problems/maximize-value-of-function-in-a-ball-passing-game/",
-    "title": "Maximize Value of Function in a Ball Passing Game"
+    "link": "https://leetcode.com/problems/maximize-value-of-function-in-a-ball-passing-game/"
   },
   "2837": {
+    "id": 2837,
     "category": "Database",
+    "title": "Total Traveled Distance",
     "difficulty": "Easy",
-    "id": 2837,
-    "link": "https://leetcode.com/problems/total-traveled-distance/",
-    "title": "Total Traveled Distance"
+    "link": "https://leetcode.com/problems/total-traveled-distance/"
   },
   "2838": {
+    "id": 2838,
     "category": "Binary Search",
+    "title": "Maximum Coins Heroes Can Collect",
     "difficulty": "Medium",
-    "id": 2838,
-    "link": "https://leetcode.com/problems/maximum-coins-heroes-can-collect/",
-    "title": "Maximum Coins Heroes Can Collect"
+    "link": "https://leetcode.com/problems/maximum-coins-heroes-can-collect/"
   },
   "2839": {
+    "id": 2839,
     "category": "Array & Hashing",
+    "title": "Check if Strings Can be Made Equal With Operations I",
     "difficulty": "Easy",
-    "id": 2839,
-    "link": "https://leetcode.com/problems/check-if-strings-can-be-made-equal-with-operations-i/",
-    "title": "Check if Strings Can be Made Equal With Operations I"
+    "link": "https://leetcode.com/problems/check-if-strings-can-be-made-equal-with-operations-i/"
   },
   "2840": {
+    "id": 2840,
     "category": "Array & Hashing",
+    "title": "Check if Strings Can be Made Equal With Operations II",
     "difficulty": "Medium",
-    "id": 2840,
-    "link": "https://leetcode.com/problems/check-if-strings-can-be-made-equal-with-operations-ii/",
-    "title": "Check if Strings Can be Made Equal With Operations II"
+    "link": "https://leetcode.com/problems/check-if-strings-can-be-made-equal-with-operations-ii/"
   },
   "2841": {
+    "id": 2841,
     "category": "Sliding Window",
+    "title": "Maximum Sum of Almost Unique Subarray",
     "difficulty": "Medium",
-    "id": 2841,
-    "link": "https://leetcode.com/problems/maximum-sum-of-almost-unique-subarray/",
-    "title": "Maximum Sum of Almost Unique Subarray"
+    "link": "https://leetcode.com/problems/maximum-sum-of-almost-unique-subarray/"
   },
   "2842": {
+    "id": 2842,
     "category": "Greedy",
+    "title": "Count K-Subsequences of a String With Maximum Beauty",
     "difficulty": "Hard",
-    "id": 2842,
-    "link": "https://leetcode.com/problems/count-k-subsequences-of-a-string-with-maximum-beauty/",
-    "title": "Count K-Subsequences of a String With Maximum Beauty"
+    "link": "https://leetcode.com/problems/count-k-subsequences-of-a-string-with-maximum-beauty/"
   },
   "2843": {
+    "id": 2843,
     "category": "Math & Geometry",
+    "title": "  Count Symmetric Integers",
     "difficulty": "Easy",
-    "id": 2843,
-    "link": "https://leetcode.com/problems/count-symmetric-integers/",
-    "title": "  Count Symmetric Integers"
+    "link": "https://leetcode.com/problems/count-symmetric-integers/"
   },
   "2844": {
+    "id": 2844,
     "category": "Greedy",
+    "title": "Minimum Operations to Make a Special Number",
     "difficulty": "Medium",
-    "id": 2844,
-    "link": "https://leetcode.com/problems/minimum-operations-to-make-a-special-number/",
-    "title": "Minimum Operations to Make a Special Number"
+    "link": "https://leetcode.com/problems/minimum-operations-to-make-a-special-number/"
   },
   "2845": {
+    "id": 2845,
     "category": "Array & Hashing",
+    "title": "Count of Interesting Subarrays",
     "difficulty": "Medium",
-    "id": 2845,
-    "link": "https://leetcode.com/problems/count-of-interesting-subarrays/",
-    "title": "Count of Interesting Subarrays"
+    "link": "https://leetcode.com/problems/count-of-interesting-subarrays/"
   },
   "2846": {
+    "id": 2846,
     "category": "Tree",
+    "title": "Minimum Edge Weight Equilibrium Queries in a Tree",
     "difficulty": "Hard",
-    "id": 2846,
-    "link": "https://leetcode.com/problems/minimum-edge-weight-equilibrium-queries-in-a-tree/",
-    "title": "Minimum Edge Weight Equilibrium Queries in a Tree"
+    "link": "https://leetcode.com/problems/minimum-edge-weight-equilibrium-queries-in-a-tree/"
   },
   "2847": {
+    "id": 2847,
     "category": "Greedy",
+    "title": "Smallest Number With Given Digit Product",
     "difficulty": "Medium",
-    "id": 2847,
-    "link": "https://leetcode.com/problems/smallest-number-with-given-digit-product/",
-    "title": "Smallest Number With Given Digit Product"
+    "link": "https://leetcode.com/problems/smallest-number-with-given-digit-product/"
   },
   "2848": {
+    "id": 2848,
     "category": "Array & Hashing",
+    "title": "Points That Intersect With Cars",
     "difficulty": "Easy",
-    "id": 2848,
-    "link": "https://leetcode.com/problems/points-that-intersect-with-cars/",
-    "title": "Points That Intersect With Cars"
+    "link": "https://leetcode.com/problems/points-that-intersect-with-cars/"
   },
   "2849": {
+    "id": 2849,
     "category": "Math & Geometry",
+    "title": "Determine if a Cell Is Reachable at a Given Time",
     "difficulty": "Medium",
-    "id": 2849,
-    "link": "https://leetcode.com/problems/determine-if-a-cell-is-reachable-at-a-given-time/",
-    "title": "Determine if a Cell Is Reachable at a Given Time"
+    "link": "https://leetcode.com/problems/determine-if-a-cell-is-reachable-at-a-given-time/"
   },
   "2850": {
+    "id": 2850,
     "category": "Graph Traversal",
+    "title": "Minimum Moves to Spread Stones Over Grid",
     "difficulty": "Medium",
-    "id": 2850,
-    "link": "https://leetcode.com/problems/minimum-moves-to-spread-stones-over-grid/",
-    "title": "Minimum Moves to Spread Stones Over Grid"
+    "link": "https://leetcode.com/problems/minimum-moves-to-spread-stones-over-grid/"
   },
   "2851": {
+    "id": 2851,
     "category": "Dynamic Programming",
+    "title": "String Transformation",
     "difficulty": "Hard",
-    "id": 2851,
-    "link": "https://leetcode.com/problems/string-transformation/",
-    "title": "String Transformation"
+    "link": "https://leetcode.com/problems/string-transformation/"
   },
   "2852": {
+    "id": 2852,
     "category": "Graph Traversal",
+    "title": "Sum of Remoteness of All Cells",
     "difficulty": "Medium",
-    "id": 2852,
-    "link": "https://leetcode.com/problems/sum-of-remoteness-of-all-cells/",
-    "title": "Sum of Remoteness of All Cells"
+    "link": "https://leetcode.com/problems/sum-of-remoteness-of-all-cells/"
   },
   "2853": {
+    "id": 2853,
     "category": "Database",
+    "title": "Highest Salaries Difference",
     "difficulty": "Easy",
-    "id": 2853,
-    "link": "https://leetcode.com/problems/highest-salaries-difference/",
-    "title": "Highest Salaries Difference"
+    "link": "https://leetcode.com/problems/highest-salaries-difference/"
   },
   "2854": {
+    "id": 2854,
     "category": "Database",
+    "title": "Rolling Average Steps",
     "difficulty": "Medium",
-    "id": 2854,
-    "link": "https://leetcode.com/problems/rolling-average-steps/",
-    "title": "Rolling Average Steps"
+    "link": "https://leetcode.com/problems/rolling-average-steps/"
   },
   "2855": {
+    "id": 2855,
     "category": "Array & Hashing",
+    "title": "Minimum Right Shifts to Sort the Array",
     "difficulty": "Easy",
-    "id": 2855,
-    "link": "https://leetcode.com/problems/minimum-right-shifts-to-sort-the-array/",
-    "title": "Minimum Right Shifts to Sort the Array"
+    "link": "https://leetcode.com/problems/minimum-right-shifts-to-sort-the-array/"
   },
   "2856": {
+    "id": 2856,
     "category": "Binary Search",
+    "title": "Minimum Array Length After Pair Removals",
     "difficulty": "Medium",
-    "id": 2856,
-    "link": "https://leetcode.com/problems/minimum-array-length-after-pair-removals/",
-    "title": "Minimum Array Length After Pair Removals"
+    "link": "https://leetcode.com/problems/minimum-array-length-after-pair-removals/"
   },
   "2857": {
+    "id": 2857,
     "category": "Bit Manipulation",
+    "title": "Count Pairs of Points With Distance k",
     "difficulty": "Medium",
-    "id": 2857,
-    "link": "https://leetcode.com/problems/count-pairs-of-points-with-distance-k/",
-    "title": "Count Pairs of Points With Distance k"
+    "link": "https://leetcode.com/problems/count-pairs-of-points-with-distance-k/"
   },
   "2858": {
+    "id": 2858,
     "category": "Graph Traversal",
+    "title": "Minimum Edge Reversals So Every Node Is Reachable",
     "difficulty": "Hard",
-    "id": 2858,
-    "link": "https://leetcode.com/problems/minimum-edge-reversals-so-every-node-is-reachable/",
-    "title": "Minimum Edge Reversals So Every Node Is Reachable"
+    "link": "https://leetcode.com/problems/minimum-edge-reversals-so-every-node-is-reachable/"
   },
   "2859": {
+    "id": 2859,
     "category": "Bit Manipulation",
+    "title": "Sum of Values at Indices With K Set Bits",
     "difficulty": "Easy",
-    "id": 2859,
-    "link": "https://leetcode.com/problems/sum-of-values-at-indices-with-k-set-bits/",
-    "title": "Sum of Values at Indices With K Set Bits"
+    "link": "https://leetcode.com/problems/sum-of-values-at-indices-with-k-set-bits/"
   },
   "2860": {
+    "id": 2860,
     "category": "Array & Hashing",
+    "title": "Happy Students",
     "difficulty": "Medium",
-    "id": 2860,
-    "link": "https://leetcode.com/problems/happy-students/",
-    "title": "Happy Students"
+    "link": "https://leetcode.com/problems/happy-students/"
   },
   "2861": {
+    "id": 2861,
     "category": "Binary Search",
+    "title": "Maximum Number of Alloys",
     "difficulty": "Medium",
-    "id": 2861,
-    "link": "https://leetcode.com/problems/maximum-number-of-alloys/",
-    "title": "Maximum Number of Alloys"
+    "link": "https://leetcode.com/problems/maximum-number-of-alloys/"
   },
   "2862": {
+    "id": 2862,
     "category": "Math & Geometry",
+    "title": "Maximum Element-Sum of a Complete Subset of Indices",
     "difficulty": "Hard",
-    "id": 2862,
-    "link": "https://leetcode.com/problems/maximum-element-sum-of-a-complete-subset-of-indices/",
-    "title": "Maximum Element-Sum of a Complete Subset of Indices"
+    "link": "https://leetcode.com/problems/maximum-element-sum-of-a-complete-subset-of-indices/"
   },
   "2863": {
+    "id": 2863,
     "category": "Stack",
+    "title": "Maximum Length of Semi-Decreasing Subarrays",
     "difficulty": "Medium",
-    "id": 2863,
-    "link": "https://leetcode.com/problems/maximum-length-of-semi-decreasing-subarrays/",
-    "title": "Maximum Length of Semi-Decreasing Subarrays"
+    "link": "https://leetcode.com/problems/maximum-length-of-semi-decreasing-subarrays/"
   },
   "2864": {
+    "id": 2864,
     "category": "Greedy",
+    "title": "Maximum Odd Binary Number",
     "difficulty": "Easy",
-    "id": 2864,
-    "link": "https://leetcode.com/problems/maximum-odd-binary-number/",
-    "title": "Maximum Odd Binary Number"
+    "link": "https://leetcode.com/problems/maximum-odd-binary-number/"
   },
   "2865": {
+    "id": 2865,
     "category": "Stack",
+    "title": "Beautiful Towers I",
     "difficulty": "Medium",
-    "id": 2865,
-    "link": "https://leetcode.com/problems/beautiful-towers-i/",
-    "title": "Beautiful Towers I"
+    "link": "https://leetcode.com/problems/beautiful-towers-i/"
   },
   "2866": {
+    "id": 2866,
     "category": "Stack",
+    "title": "Beautiful Towers II",
     "difficulty": "Medium",
-    "id": 2866,
-    "link": "https://leetcode.com/problems/beautiful-towers-ii/",
-    "title": "Beautiful Towers II"
+    "link": "https://leetcode.com/problems/beautiful-towers-ii/"
   },
   "2867": {
+    "id": 2867,
     "category": "Tree",
+    "title": "Count Valid Paths in a Tree",
     "difficulty": "Hard",
-    "id": 2867,
-    "link": "https://leetcode.com/problems/count-valid-paths-in-a-tree/",
-    "title": "Count Valid Paths in a Tree"
+    "link": "https://leetcode.com/problems/count-valid-paths-in-a-tree/"
   },
   "2868": {
+    "id": 2868,
     "category": "Greedy",
+    "title": "The Wording Game",
     "difficulty": "Hard",
-    "id": 2868,
-    "link": "https://leetcode.com/problems/the-wording-game/",
-    "title": "The Wording Game"
+    "link": "https://leetcode.com/problems/the-wording-game/"
   },
   "2869": {
+    "id": 2869,
     "category": "Bit Manipulation",
+    "title": "Minimum Operations to Collect Elements",
     "difficulty": "Easy",
-    "id": 2869,
-    "link": "https://leetcode.com/problems/minimum-operations-to-collect-elements/",
-    "title": "Minimum Operations to Collect Elements"
+    "link": "https://leetcode.com/problems/minimum-operations-to-collect-elements/"
   },
   "2870": {
+    "id": 2870,
     "category": "Greedy",
+    "title": "Minimum Number of Operations to Make Array Empty",
     "difficulty": "Medium",
-    "id": 2870,
-    "link": "https://leetcode.com/problems/minimum-number-of-operations-to-make-array-empty/",
-    "title": "Minimum Number of Operations to Make Array Empty"
+    "link": "https://leetcode.com/problems/minimum-number-of-operations-to-make-array-empty/"
   },
   "2871": {
+    "id": 2871,
     "category": "Bit Manipulation",
+    "title": "Split Array Into Maximum Number of Subarrays",
     "difficulty": "Medium",
-    "id": 2871,
-    "link": "https://leetcode.com/problems/split-array-into-maximum-number-of-subarrays/",
-    "title": "Split Array Into Maximum Number of Subarrays"
+    "link": "https://leetcode.com/problems/split-array-into-maximum-number-of-subarrays/"
   },
   "2872": {
+    "id": 2872,
     "category": "Tree",
+    "title": "Maximum Number of K-Divisible Components",
     "difficulty": "Hard",
-    "id": 2872,
-    "link": "https://leetcode.com/problems/maximum-number-of-k-divisible-components/",
-    "title": "Maximum Number of K-Divisible Components"
+    "link": "https://leetcode.com/problems/maximum-number-of-k-divisible-components/"
   },
   "2873": {
+    "id": 2873,
     "category": "Array & Hashing",
+    "title": "Maximum Value of an Ordered Triplet I",
     "difficulty": "Easy",
-    "id": 2873,
-    "link": "https://leetcode.com/problems/maximum-value-of-an-ordered-triplet-i/",
-    "title": "Maximum Value of an Ordered Triplet I"
+    "link": "https://leetcode.com/problems/maximum-value-of-an-ordered-triplet-i/"
   },
   "2874": {
+    "id": 2874,
     "category": "Array & Hashing",
+    "title": "Maximum Value of an Ordered Triplet II",
     "difficulty": "Medium",
-    "id": 2874,
-    "link": "https://leetcode.com/problems/maximum-value-of-an-ordered-triplet-ii/",
-    "title": "Maximum Value of an Ordered Triplet II"
+    "link": "https://leetcode.com/problems/maximum-value-of-an-ordered-triplet-ii/"
   },
   "2875": {
+    "id": 2875,
     "category": "Sliding Window",
+    "title": "Minimum Size Subarray in Infinite Array",
     "difficulty": "Medium",
-    "id": 2875,
-    "link": "https://leetcode.com/problems/minimum-size-subarray-in-infinite-array/",
-    "title": "Minimum Size Subarray in Infinite Array"
+    "link": "https://leetcode.com/problems/minimum-size-subarray-in-infinite-array/"
   },
   "2876": {
+    "id": 2876,
     "category": "Graph Traversal",
+    "title": "Count Visited Nodes in a Directed Graph",
     "difficulty": "Hard",
-    "id": 2876,
-    "link": "https://leetcode.com/problems/count-visited-nodes-in-a-directed-graph/",
-    "title": "Count Visited Nodes in a Directed Graph"
+    "link": "https://leetcode.com/problems/count-visited-nodes-in-a-directed-graph/"
   },
   "2877": {
+    "id": 2877,
     "category": "Array & Hashing",
+    "title": "Create a DataFrame from List",
     "difficulty": "Easy",
-    "id": 2877,
-    "link": "https://leetcode.com/problems/create-a-dataframe-from-list/",
-    "title": "Create a DataFrame from List"
+    "link": "https://leetcode.com/problems/create-a-dataframe-from-list/"
   },
   "2878": {
+    "id": 2878,
     "category": "Array & Hashing",
+    "title": "Get the Size of a DataFrame",
     "difficulty": "Easy",
-    "id": 2878,
-    "link": "https://leetcode.com/problems/get-the-size-of-a-dataframe/",
-    "title": "Get the Size of a DataFrame"
+    "link": "https://leetcode.com/problems/get-the-size-of-a-dataframe/"
   },
   "2879": {
+    "id": 2879,
     "category": "Array & Hashing",
+    "title": "Display the First Three Rows",
     "difficulty": "Easy",
-    "id": 2879,
-    "link": "https://leetcode.com/problems/display-the-first-three-rows/",
-    "title": "Display the First Three Rows"
+    "link": "https://leetcode.com/problems/display-the-first-three-rows/"
   },
   "2880": {
+    "id": 2880,
     "category": "Array & Hashing",
+    "title": "Select Data",
     "difficulty": "Easy",
-    "id": 2880,
-    "link": "https://leetcode.com/problems/select-data/",
-    "title": "Select Data"
+    "link": "https://leetcode.com/problems/select-data/"
   },
   "2881": {
+    "id": 2881,
     "category": "Array & Hashing",
+    "title": "Create a New Column",
     "difficulty": "Easy",
-    "id": 2881,
-    "link": "https://leetcode.com/problems/create-a-new-column/",
-    "title": "Create a New Column"
+    "link": "https://leetcode.com/problems/create-a-new-column/"
   },
   "2882": {
+    "id": 2882,
     "category": "Array & Hashing",
+    "title": "Drop Duplicate Rows",
     "difficulty": "Easy",
-    "id": 2882,
-    "link": "https://leetcode.com/problems/drop-duplicate-rows/",
-    "title": "Drop Duplicate Rows"
+    "link": "https://leetcode.com/problems/drop-duplicate-rows/"
   },
   "2883": {
+    "id": 2883,
     "category": "Array & Hashing",
+    "title": "Drop Missing Data",
     "difficulty": "Easy",
-    "id": 2883,
-    "link": "https://leetcode.com/problems/drop-missing-data/",
-    "title": "Drop Missing Data"
+    "link": "https://leetcode.com/problems/drop-missing-data/"
   },
   "2884": {
+    "id": 2884,
     "category": "Array & Hashing",
+    "title": "Modify Columns",
     "difficulty": "Easy",
-    "id": 2884,
-    "link": "https://leetcode.com/problems/modify-columns/",
-    "title": "Modify Columns"
+    "link": "https://leetcode.com/problems/modify-columns/"
   },
   "2885": {
+    "id": 2885,
     "category": "Array & Hashing",
+    "title": "Rename Columns",
     "difficulty": "Easy",
-    "id": 2885,
-    "link": "https://leetcode.com/problems/rename-columns/",
-    "title": "Rename Columns"
+    "link": "https://leetcode.com/problems/rename-columns/"
   },
   "2886": {
+    "id": 2886,
     "category": "Array & Hashing",
+    "title": "Change Data Type",
     "difficulty": "Easy",
-    "id": 2886,
-    "link": "https://leetcode.com/problems/change-data-type/",
-    "title": "Change Data Type"
+    "link": "https://leetcode.com/problems/change-data-type/"
   },
   "2887": {
+    "id": 2887,
     "category": "Array & Hashing",
+    "title": "Fill Missing Data",
     "difficulty": "Easy",
-    "id": 2887,
-    "link": "https://leetcode.com/problems/fill-missing-data/",
-    "title": "Fill Missing Data"
+    "link": "https://leetcode.com/problems/fill-missing-data/"
   },
   "2888": {
+    "id": 2888,
     "category": "Array & Hashing",
+    "title": "Reshape Data: Concatenate",
     "difficulty": "Easy",
-    "id": 2888,
-    "link": "https://leetcode.com/problems/reshape-data-concatenate/",
-    "title": "Reshape Data: Concatenate"
+    "link": "https://leetcode.com/problems/reshape-data-concatenate/"
   },
   "2889": {
+    "id": 2889,
     "category": "Array & Hashing",
+    "title": "Reshape Data: Pivot",
     "difficulty": "Easy",
-    "id": 2889,
-    "link": "https://leetcode.com/problems/reshape-data-pivot/",
-    "title": "Reshape Data: Pivot"
+    "link": "https://leetcode.com/problems/reshape-data-pivot/"
   },
   "2890": {
+    "id": 2890,
     "category": "Array & Hashing",
+    "title": "Reshape Data: Melt",
     "difficulty": "Easy",
-    "id": 2890,
-    "link": "https://leetcode.com/problems/reshape-data-melt/",
-    "title": "Reshape Data: Melt"
+    "link": "https://leetcode.com/problems/reshape-data-melt/"
   },
   "2891": {
+    "id": 2891,
     "category": "Array & Hashing",
+    "title": "Method Chaining",
     "difficulty": "Easy",
-    "id": 2891,
-    "link": "https://leetcode.com/problems/method-chaining/",
-    "title": "Method Chaining"
+    "link": "https://leetcode.com/problems/method-chaining/"
   },
   "2892": {
+    "id": 2892,
     "category": "Dynamic Programming",
+    "title": "Minimizing Array After Replacing Pairs With Their Product",
     "difficulty": "Medium",
-    "id": 2892,
-    "link": "https://leetcode.com/problems/minimizing-array-after-replacing-pairs-with-their-product/",
-    "title": "Minimizing Array After Replacing Pairs With Their Product"
+    "link": "https://leetcode.com/problems/minimizing-array-after-replacing-pairs-with-their-product/"
   },
   "2893": {
+    "id": 2893,
     "category": "Database",
+    "title": "Calculate Orders Within Each Interval",
     "difficulty": "Medium",
-    "id": 2893,
-    "link": "https://leetcode.com/problems/calculate-orders-within-each-interval/",
-    "title": "Calculate Orders Within Each Interval"
+    "link": "https://leetcode.com/problems/calculate-orders-within-each-interval/"
   },
   "2894": {
+    "id": 2894,
     "category": "Math & Geometry",
+    "title": "Divisible and Non-divisible Sums Difference",
     "difficulty": "Easy",
-    "id": 2894,
-    "link": "https://leetcode.com/problems/divisible-and-non-divisible-sums-difference/",
-    "title": "Divisible and Non-divisible Sums Difference"
+    "link": "https://leetcode.com/problems/divisible-and-non-divisible-sums-difference/"
   },
   "2895": {
+    "id": 2895,
     "category": "Greedy",
+    "title": "Minimum Processing Time",
     "difficulty": "Medium",
-    "id": 2895,
-    "link": "https://leetcode.com/problems/minimum-processing-time/",
-    "title": "Minimum Processing Time"
+    "link": "https://leetcode.com/problems/minimum-processing-time/"
   },
   "2896": {
+    "id": 2896,
     "category": "Dynamic Programming",
+    "title": "Apply Operations to Make Two Strings Equal",
     "difficulty": "Medium",
-    "id": 2896,
-    "link": "https://leetcode.com/problems/apply-operations-to-make-two-strings-equal/",
-    "title": "Apply Operations to Make Two Strings Equal"
+    "link": "https://leetcode.com/problems/apply-operations-to-make-two-strings-equal/"
   },
   "2897": {
+    "id": 2897,
     "category": "Bit Manipulation",
+    "title": "Apply Operations on Array to Maximize Sum of Squares",
     "difficulty": "Hard",
-    "id": 2897,
-    "link": "https://leetcode.com/problems/apply-operations-on-array-to-maximize-sum-of-squares/",
-    "title": "Apply Operations on Array to Maximize Sum of Squares"
+    "link": "https://leetcode.com/problems/apply-operations-on-array-to-maximize-sum-of-squares/"
   },
   "2898": {
+    "id": 2898,
     "category": "Array & Hashing",
+    "title": "Maximum Linear Stock Score",
     "difficulty": "Medium",
-    "id": 2898,
-    "link": "https://leetcode.com/problems/maximum-linear-stock-score/",
-    "title": "Maximum Linear Stock Score"
+    "link": "https://leetcode.com/problems/maximum-linear-stock-score/"
   },
   "2899": {
+    "id": 2899,
     "category": "Array & Hashing",
+    "title": "Last Visited Integers",
     "difficulty": "Easy",
-    "id": 2899,
-    "link": "https://leetcode.com/problems/last-visited-integers/",
-    "title": "Last Visited Integers"
+    "link": "https://leetcode.com/problems/last-visited-integers/"
   },
   "2900": {
+    "id": 2900,
     "category": "Dynamic Programming",
+    "title": "Longest Unequal Adjacent Groups Subsequence I",
     "difficulty": "Easy",
-    "id": 2900,
-    "link": "https://leetcode.com/problems/longest-unequal-adjacent-groups-subsequence-i/",
-    "title": "Longest Unequal Adjacent Groups Subsequence I"
+    "link": "https://leetcode.com/problems/longest-unequal-adjacent-groups-subsequence-i/"
   },
   "2901": {
+    "id": 2901,
     "category": "Dynamic Programming",
+    "title": "Longest Unequal Adjacent Groups Subsequence II",
     "difficulty": "Medium",
-    "id": 2901,
-    "link": "https://leetcode.com/problems/longest-unequal-adjacent-groups-subsequence-ii/",
-    "title": "Longest Unequal Adjacent Groups Subsequence II"
+    "link": "https://leetcode.com/problems/longest-unequal-adjacent-groups-subsequence-ii/"
   },
   "2902": {
+    "id": 2902,
     "category": "Dynamic Programming",
+    "title": "Count of Sub-Multisets With Bounded Sum",
     "difficulty": "Hard",
-    "id": 2902,
-    "link": "https://leetcode.com/problems/count-of-sub-multisets-with-bounded-sum/",
-    "title": "Count of Sub-Multisets With Bounded Sum"
+    "link": "https://leetcode.com/problems/count-of-sub-multisets-with-bounded-sum/"
   },
   "2903": {
+    "id": 2903,
     "category": "Two Pointers",
+    "title": "Find Indices With Index and Value Difference I",
     "difficulty": "Easy",
-    "id": 2903,
-    "link": "https://leetcode.com/problems/find-indices-with-index-and-value-difference-i/",
-    "title": "Find Indices With Index and Value Difference I"
+    "link": "https://leetcode.com/problems/find-indices-with-index-and-value-difference-i/"
   },
   "2904": {
+    "id": 2904,
     "category": "Sliding Window",
+    "title": "Shortest and Lexicographically Smallest Beautiful String",
     "difficulty": "Medium",
-    "id": 2904,
-    "link": "https://leetcode.com/problems/shortest-and-lexicographically-smallest-beautiful-string/",
-    "title": "Shortest and Lexicographically Smallest Beautiful String"
+    "link": "https://leetcode.com/problems/shortest-and-lexicographically-smallest-beautiful-string/"
   },
   "2905": {
+    "id": 2905,
     "category": "Two Pointers",
+    "title": "Find Indices With Index and Value Difference II",
     "difficulty": "Medium",
-    "id": 2905,
-    "link": "https://leetcode.com/problems/find-indices-with-index-and-value-difference-ii/",
-    "title": "Find Indices With Index and Value Difference II"
+    "link": "https://leetcode.com/problems/find-indices-with-index-and-value-difference-ii/"
   },
   "2906": {
+    "id": 2906,
     "category": "Array & Hashing",
+    "title": "Construct Product Matrix",
     "difficulty": "Medium",
-    "id": 2906,
-    "link": "https://leetcode.com/problems/construct-product-matrix/",
-    "title": "Construct Product Matrix"
+    "link": "https://leetcode.com/problems/construct-product-matrix/"
   },
   "2907": {
+    "id": 2907,
     "category": "Tree",
+    "title": "Maximum Profitable Triplets With Increasing Prices I",
     "difficulty": "Medium",
-    "id": 2907,
-    "link": "https://leetcode.com/problems/maximum-profitable-triplets-with-increasing-prices-i/",
-    "title": "Maximum Profitable Triplets With Increasing Prices I"
+    "link": "https://leetcode.com/problems/maximum-profitable-triplets-with-increasing-prices-i/"
   },
   "2908": {
+    "id": 2908,
     "category": "Array & Hashing",
+    "title": "Minimum Sum of Mountain Triplets I",
     "difficulty": "Easy",
-    "id": 2908,
-    "link": "https://leetcode.com/problems/minimum-sum-of-mountain-triplets-i/",
-    "title": "Minimum Sum of Mountain Triplets I"
+    "link": "https://leetcode.com/problems/minimum-sum-of-mountain-triplets-i/"
   },
   "2909": {
+    "id": 2909,
     "category": "Array & Hashing",
+    "title": "Minimum Sum of Mountain Triplets II",
     "difficulty": "Medium",
-    "id": 2909,
-    "link": "https://leetcode.com/problems/minimum-sum-of-mountain-triplets-ii/",
-    "title": "Minimum Sum of Mountain Triplets II"
+    "link": "https://leetcode.com/problems/minimum-sum-of-mountain-triplets-ii/"
   },
   "2910": {
+    "id": 2910,
     "category": "Greedy",
+    "title": "Minimum Number of Groups to Create a Valid Assignment",
     "difficulty": "Medium",
-    "id": 2910,
-    "link": "https://leetcode.com/problems/minimum-number-of-groups-to-create-a-valid-assignment/",
-    "title": "Minimum Number of Groups to Create a Valid Assignment"
+    "link": "https://leetcode.com/problems/minimum-number-of-groups-to-create-a-valid-assignment/"
   },
   "2911": {
+    "id": 2911,
     "category": "Dynamic Programming",
+    "title": "Minimum Changes to Make K Semi-palindromes",
     "difficulty": "Hard",
-    "id": 2911,
-    "link": "https://leetcode.com/problems/minimum-changes-to-make-k-semi-palindromes/",
-    "title": "Minimum Changes to Make K Semi-palindromes"
+    "link": "https://leetcode.com/problems/minimum-changes-to-make-k-semi-palindromes/"
   },
   "2912": {
+    "id": 2912,
     "category": "Dynamic Programming",
+    "title": "Number of Ways to Reach Destination in the Grid",
     "difficulty": "Hard",
-    "id": 2912,
-    "link": "https://leetcode.com/problems/number-of-ways-to-reach-destination-in-the-grid/",
-    "title": "Number of Ways to Reach Destination in the Grid"
+    "link": "https://leetcode.com/problems/number-of-ways-to-reach-destination-in-the-grid/"
   },
   "2913": {
+    "id": 2913,
     "category": "Array & Hashing",
+    "title": "Subarrays Distinct Element Sum of Squares I",
     "difficulty": "Easy",
-    "id": 2913,
-    "link": "https://leetcode.com/problems/subarrays-distinct-element-sum-of-squares-i/",
-    "title": "Subarrays Distinct Element Sum of Squares I"
+    "link": "https://leetcode.com/problems/subarrays-distinct-element-sum-of-squares-i/"
   },
   "2914": {
+    "id": 2914,
     "category": "Array & Hashing",
+    "title": "Minimum Number of Changes to Make Binary String Beautiful",
     "difficulty": "Medium",
-    "id": 2914,
-    "link": "https://leetcode.com/problems/minimum-number-of-changes-to-make-binary-string-beautiful/",
-    "title": "Minimum Number of Changes to Make Binary String Beautiful"
+    "link": "https://leetcode.com/problems/minimum-number-of-changes-to-make-binary-string-beautiful/"
   },
   "2915": {
+    "id": 2915,
     "category": "Dynamic Programming",
+    "title": "Length of the Longest Subsequence That Sums to Target",
     "difficulty": "Medium",
-    "id": 2915,
-    "link": "https://leetcode.com/problems/length-of-the-longest-subsequence-that-sums-to-target/",
-    "title": "Length of the Longest Subsequence That Sums to Target"
+    "link": "https://leetcode.com/problems/length-of-the-longest-subsequence-that-sums-to-target/"
   },
   "2916": {
+    "id": 2916,
     "category": "Tree",
+    "title": "Subarrays Distinct Element Sum of Squares II",
     "difficulty": "Hard",
-    "id": 2916,
-    "link": "https://leetcode.com/problems/subarrays-distinct-element-sum-of-squares-ii/",
-    "title": "Subarrays Distinct Element Sum of Squares II"
+    "link": "https://leetcode.com/problems/subarrays-distinct-element-sum-of-squares-ii/"
   },
   "2917": {
+    "id": 2917,
     "category": "Bit Manipulation",
+    "title": "Find the K-or of an Array",
     "difficulty": "Easy",
-    "id": 2917,
-    "link": "https://leetcode.com/problems/find-the-k-or-of-an-array/",
-    "title": "Find the K-or of an Array"
+    "link": "https://leetcode.com/problems/find-the-k-or-of-an-array/"
   },
   "2918": {
+    "id": 2918,
     "category": "Greedy",
+    "title": "Minimum Equal Sum of Two Arrays After Replacing Zeros",
     "difficulty": "Medium",
-    "id": 2918,
-    "link": "https://leetcode.com/problems/minimum-equal-sum-of-two-arrays-after-replacing-zeros/",
-    "title": "Minimum Equal Sum of Two Arrays After Replacing Zeros"
+    "link": "https://leetcode.com/problems/minimum-equal-sum-of-two-arrays-after-replacing-zeros/"
   },
   "2919": {
+    "id": 2919,
     "category": "Dynamic Programming",
+    "title": "Minimum Increment Operations to Make Array Beautiful",
     "difficulty": "Medium",
-    "id": 2919,
-    "link": "https://leetcode.com/problems/minimum-increment-operations-to-make-array-beautiful/",
-    "title": "Minimum Increment Operations to Make Array Beautiful"
+    "link": "https://leetcode.com/problems/minimum-increment-operations-to-make-array-beautiful/"
   },
   "2920": {
+    "id": 2920,
     "category": "Tree",
+    "title": "Maximum Points After Collecting Coins From All Nodes",
     "difficulty": "Hard",
-    "id": 2920,
-    "link": "https://leetcode.com/problems/maximum-points-after-collecting-coins-from-all-nodes/",
-    "title": "Maximum Points After Collecting Coins From All Nodes"
+    "link": "https://leetcode.com/problems/maximum-points-after-collecting-coins-from-all-nodes/"
   },
   "2921": {
+    "id": 2921,
     "category": "Tree",
+    "title": "Maximum Profitable Triplets With Increasing Prices II",
     "difficulty": "Hard",
-    "id": 2921,
-    "link": "https://leetcode.com/problems/maximum-profitable-triplets-with-increasing-prices-ii/",
-    "title": "Maximum Profitable Triplets With Increasing Prices II"
+    "link": "https://leetcode.com/problems/maximum-profitable-triplets-with-increasing-prices-ii/"
   },
   "2922": {
+    "id": 2922,
     "category": "Database",
+    "title": "Market Analysis III",
     "difficulty": "Medium",
-    "id": 2922,
-    "link": "https://leetcode.com/problems/market-analysis-iii/",
-    "title": "Market Analysis III"
+    "link": "https://leetcode.com/problems/market-analysis-iii/"
   },
   "2923": {
+    "id": 2923,
     "category": "Array & Hashing",
+    "title": "Find Champion I",
     "difficulty": "Easy",
-    "id": 2923,
-    "link": "https://leetcode.com/problems/find-champion-i/",
-    "title": "Find Champion I"
+    "link": "https://leetcode.com/problems/find-champion-i/"
   },
   "2924": {
+    "id": 2924,
     "category": "Graph Traversal",
+    "title": "Find Champion II",
     "difficulty": "Medium",
-    "id": 2924,
-    "link": "https://leetcode.com/problems/find-champion-ii/",
-    "title": "Find Champion II"
+    "link": "https://leetcode.com/problems/find-champion-ii/"
   },
   "2925": {
+    "id": 2925,
     "category": "Tree",
+    "title": "Maximum Score After Applying Operations on a Tree",
     "difficulty": "Medium",
-    "id": 2925,
-    "link": "https://leetcode.com/problems/maximum-score-after-applying-operations-on-a-tree/",
-    "title": "Maximum Score After Applying Operations on a Tree"
+    "link": "https://leetcode.com/problems/maximum-score-after-applying-operations-on-a-tree/"
   },
   "2926": {
+    "id": 2926,
     "category": "Tree",
+    "title": "Maximum Balanced Subsequence Sum",
     "difficulty": "Hard",
-    "id": 2926,
-    "link": "https://leetcode.com/problems/maximum-balanced-subsequence-sum/",
-    "title": "Maximum Balanced Subsequence Sum"
+    "link": "https://leetcode.com/problems/maximum-balanced-subsequence-sum/"
   },
   "2927": {
+    "id": 2927,
     "category": "Math & Geometry",
+    "title": "Distribute Candies Among Children III",
     "difficulty": "Hard",
-    "id": 2927,
-    "link": "https://leetcode.com/problems/distribute-candies-among-children-iii/",
-    "title": "Distribute Candies Among Children III"
+    "link": "https://leetcode.com/problems/distribute-candies-among-children-iii/"
   },
   "2928": {
+    "id": 2928,
     "category": "Math & Geometry",
+    "title": "Distribute Candies Among Children I",
     "difficulty": "Easy",
-    "id": 2928,
-    "link": "https://leetcode.com/problems/distribute-candies-among-children-i/",
-    "title": "Distribute Candies Among Children I"
+    "link": "https://leetcode.com/problems/distribute-candies-among-children-i/"
   },
   "2929": {
+    "id": 2929,
     "category": "Math & Geometry",
+    "title": "Distribute Candies Among Children II",
     "difficulty": "Medium",
-    "id": 2929,
-    "link": "https://leetcode.com/problems/distribute-candies-among-children-ii/",
-    "title": "Distribute Candies Among Children II"
+    "link": "https://leetcode.com/problems/distribute-candies-among-children-ii/"
   },
   "2930": {
+    "id": 2930,
     "category": "Dynamic Programming",
+    "title": "Number of Strings Which Can Be Rearranged to Contain Substring",
     "difficulty": "Medium",
-    "id": 2930,
-    "link": "https://leetcode.com/problems/number-of-strings-which-can-be-rearranged-to-contain-substring/",
-    "title": "Number of Strings Which Can Be Rearranged to Contain Substring"
+    "link": "https://leetcode.com/problems/number-of-strings-which-can-be-rearranged-to-contain-substring/"
   },
   "2931": {
+    "id": 2931,
     "category": "Heap (Priority Queue)",
+    "title": "Maximum Spending After Buying Items",
     "difficulty": "Hard",
-    "id": 2931,
-    "link": "https://leetcode.com/problems/maximum-spending-after-buying-items/",
-    "title": "Maximum Spending After Buying Items"
+    "link": "https://leetcode.com/problems/maximum-spending-after-buying-items/"
   },
   "2932": {
+    "id": 2932,
     "category": "Sliding Window",
+    "title": "Maximum Strong Pair XOR I",
     "difficulty": "Easy",
-    "id": 2932,
-    "link": "https://leetcode.com/problems/maximum-strong-pair-xor-i/",
-    "title": "Maximum Strong Pair XOR I"
+    "link": "https://leetcode.com/problems/maximum-strong-pair-xor-i/"
   },
   "2933": {
+    "id": 2933,
     "category": "Array & Hashing",
+    "title": "High-Access Employees",
     "difficulty": "Medium",
-    "id": 2933,
-    "link": "https://leetcode.com/problems/high-access-employees/",
-    "title": "High-Access Employees"
+    "link": "https://leetcode.com/problems/high-access-employees/"
   },
   "2934": {
+    "id": 2934,
     "category": "Array & Hashing",
+    "title": "Minimum Operations to Maximize Last Elements in Arrays",
     "difficulty": "Medium",
-    "id": 2934,
-    "link": "https://leetcode.com/problems/minimum-operations-to-maximize-last-elements-in-arrays/",
-    "title": "Minimum Operations to Maximize Last Elements in Arrays"
+    "link": "https://leetcode.com/problems/minimum-operations-to-maximize-last-elements-in-arrays/"
   },
   "2935": {
+    "id": 2935,
     "category": "Sliding Window",
+    "title": "Maximum Strong Pair XOR II",
     "difficulty": "Hard",
-    "id": 2935,
-    "link": "https://leetcode.com/problems/maximum-strong-pair-xor-ii/",
-    "title": "Maximum Strong Pair XOR II"
+    "link": "https://leetcode.com/problems/maximum-strong-pair-xor-ii/"
   },
   "2936": {
+    "id": 2936,
     "category": "Binary Search",
+    "title": "Number of Equal Numbers Blocks",
     "difficulty": "Medium",
-    "id": 2936,
-    "link": "https://leetcode.com/problems/number-of-equal-numbers-blocks/",
-    "title": "Number of Equal Numbers Blocks"
+    "link": "https://leetcode.com/problems/number-of-equal-numbers-blocks/"
   },
   "2937": {
+    "id": 2937,
     "category": "Array & Hashing",
+    "title": "Make Three Strings Equal",
     "difficulty": "Easy",
-    "id": 2937,
-    "link": "https://leetcode.com/problems/make-three-strings-equal/",
-    "title": "Make Three Strings Equal"
+    "link": "https://leetcode.com/problems/make-three-strings-equal/"
   },
   "2938": {
+    "id": 2938,
     "category": "Greedy",
+    "title": "Separate Black and White Balls",
     "difficulty": "Medium",
-    "id": 2938,
-    "link": "https://leetcode.com/problems/separate-black-and-white-balls/",
-    "title": "Separate Black and White Balls"
+    "link": "https://leetcode.com/problems/separate-black-and-white-balls/"
   },
   "2939": {
+    "id": 2939,
     "category": "Bit Manipulation",
+    "title": "Maximum Xor Product",
     "difficulty": "Medium",
-    "id": 2939,
-    "link": "https://leetcode.com/problems/maximum-xor-product/",
-    "title": "Maximum Xor Product"
+    "link": "https://leetcode.com/problems/maximum-xor-product/"
   },
   "2940": {
+    "id": 2940,
     "category": "Tree",
+    "title": "Find Building Where Alice and Bob Can Meet",
     "difficulty": "Hard",
-    "id": 2940,
-    "link": "https://leetcode.com/problems/find-building-where-alice-and-bob-can-meet/",
-    "title": "Find Building Where Alice and Bob Can Meet"
+    "link": "https://leetcode.com/problems/find-building-where-alice-and-bob-can-meet/"
   },
   "2941": {
+    "id": 2941,
     "category": "Binary Search",
+    "title": "Maximum GCD-Sum of a Subarray",
     "difficulty": "Hard",
-    "id": 2941,
-    "link": "https://leetcode.com/problems/maximum-gcd-sum-of-a-subarray/",
-    "title": "Maximum GCD-Sum of a Subarray"
+    "link": "https://leetcode.com/problems/maximum-gcd-sum-of-a-subarray/"
   },
   "2942": {
+    "id": 2942,
     "category": "Array & Hashing",
+    "title": "Find Words Containing Character",
     "difficulty": "Easy",
-    "id": 2942,
-    "link": "https://leetcode.com/problems/find-words-containing-character/",
-    "title": "Find Words Containing Character"
+    "link": "https://leetcode.com/problems/find-words-containing-character/"
   },
   "2943": {
+    "id": 2943,
     "category": "Array & Hashing",
+    "title": "Maximize Area of Square Hole in Grid",
     "difficulty": "Medium",
-    "id": 2943,
-    "link": "https://leetcode.com/problems/maximize-area-of-square-hole-in-grid/",
-    "title": "Maximize Area of Square Hole in Grid"
+    "link": "https://leetcode.com/problems/maximize-area-of-square-hole-in-grid/"
   },
   "2944": {
+    "id": 2944,
     "category": "Dynamic Programming",
+    "title": "Minimum Number of Coins for Fruits",
     "difficulty": "Medium",
-    "id": 2944,
-    "link": "https://leetcode.com/problems/minimum-number-of-coins-for-fruits/",
-    "title": "Minimum Number of Coins for Fruits"
+    "link": "https://leetcode.com/problems/minimum-number-of-coins-for-fruits/"
   },
   "2945": {
+    "id": 2945,
     "category": "Dynamic Programming",
+    "title": "Find Maximum Non-decreasing Array Length",
     "difficulty": "Hard",
-    "id": 2945,
-    "link": "https://leetcode.com/problems/find-maximum-non-decreasing-array-length/",
-    "title": "Find Maximum Non-decreasing Array Length"
+    "link": "https://leetcode.com/problems/find-maximum-non-decreasing-array-length/"
   },
   "2946": {
+    "id": 2946,
     "category": "Math & Geometry",
+    "title": "Matrix Similarity After Cyclic Shifts",
     "difficulty": "Easy",
-    "id": 2946,
-    "link": "https://leetcode.com/problems/matrix-similarity-after-cyclic-shifts/",
-    "title": "Matrix Similarity After Cyclic Shifts"
+    "link": "https://leetcode.com/problems/matrix-similarity-after-cyclic-shifts/"
   },
   "2947": {
+    "id": 2947,
     "category": "Math & Geometry",
+    "title": "Count Beautiful Substrings I",
     "difficulty": "Medium",
-    "id": 2947,
-    "link": "https://leetcode.com/problems/count-beautiful-substrings-i/",
-    "title": "Count Beautiful Substrings I"
+    "link": "https://leetcode.com/problems/count-beautiful-substrings-i/"
   },
   "2948": {
+    "id": 2948,
     "category": "Graph Traversal",
+    "title": "Make Lexicographically Smallest Array by Swapping Elements",
     "difficulty": "Medium",
-    "id": 2948,
-    "link": "https://leetcode.com/problems/make-lexicographically-smallest-array-by-swapping-elements/",
-    "title": "Make Lexicographically Smallest Array by Swapping Elements"
+    "link": "https://leetcode.com/problems/make-lexicographically-smallest-array-by-swapping-elements/"
   },
   "2949": {
+    "id": 2949,
     "category": "Math & Geometry",
+    "title": "Count Beautiful Substrings II",
     "difficulty": "Hard",
-    "id": 2949,
-    "link": "https://leetcode.com/problems/count-beautiful-substrings-ii/",
-    "title": "Count Beautiful Substrings II"
+    "link": "https://leetcode.com/problems/count-beautiful-substrings-ii/"
   },
   "2950": {
+    "id": 2950,
     "category": "Array & Hashing",
+    "title": "Number of Divisible Substrings",
     "difficulty": "Medium",
-    "id": 2950,
-    "link": "https://leetcode.com/problems/number-of-divisible-substrings/",
-    "title": "Number of Divisible Substrings"
+    "link": "https://leetcode.com/problems/number-of-divisible-substrings/"
   },
   "2951": {
+    "id": 2951,
     "category": "Array & Hashing",
+    "title": "Find the Peaks",
     "difficulty": "Easy",
-    "id": 2951,
-    "link": "https://leetcode.com/problems/find-the-peaks/",
-    "title": "Find the Peaks"
+    "link": "https://leetcode.com/problems/find-the-peaks/"
   },
   "2952": {
+    "id": 2952,
     "category": "Greedy",
+    "title": "Minimum Number of Coins to be Added",
     "difficulty": "Medium",
-    "id": 2952,
-    "link": "https://leetcode.com/problems/minimum-number-of-coins-to-be-added/",
-    "title": "Minimum Number of Coins to be Added"
+    "link": "https://leetcode.com/problems/minimum-number-of-coins-to-be-added/"
   },
   "2953": {
+    "id": 2953,
     "category": "Sliding Window",
+    "title": "Count Complete Substrings",
     "difficulty": "Hard",
-    "id": 2953,
-    "link": "https://leetcode.com/problems/count-complete-substrings/",
-    "title": "Count Complete Substrings"
+    "link": "https://leetcode.com/problems/count-complete-substrings/"
   },
   "2954": {
+    "id": 2954,
     "category": "Math & Geometry",
+    "title": "Count the Number of Infection Sequences",
     "difficulty": "Hard",
-    "id": 2954,
-    "link": "https://leetcode.com/problems/count-the-number-of-infection-sequences/",
-    "title": "Count the Number of Infection Sequences"
+    "link": "https://leetcode.com/problems/count-the-number-of-infection-sequences/"
   },
   "2955": {
+    "id": 2955,
     "category": "Array & Hashing",
+    "title": "Number of Same-End Substrings",
     "difficulty": "Medium",
-    "id": 2955,
-    "link": "https://leetcode.com/problems/number-of-same-end-substrings/",
-    "title": "Number of Same-End Substrings"
+    "link": "https://leetcode.com/problems/number-of-same-end-substrings/"
   },
   "2956": {
+    "id": 2956,
     "category": "Array & Hashing",
+    "title": "Find Common Elements Between Two Arrays",
     "difficulty": "Easy",
-    "id": 2956,
-    "link": "https://leetcode.com/problems/find-common-elements-between-two-arrays/",
-    "title": "Find Common Elements Between Two Arrays"
+    "link": "https://leetcode.com/problems/find-common-elements-between-two-arrays/"
   },
   "2957": {
+    "id": 2957,
     "category": "Dynamic Programming",
+    "title": "Remove Adjacent Almost-Equal Characters",
     "difficulty": "Medium",
-    "id": 2957,
-    "link": "https://leetcode.com/problems/remove-adjacent-almost-equal-characters/",
-    "title": "Remove Adjacent Almost-Equal Characters"
+    "link": "https://leetcode.com/problems/remove-adjacent-almost-equal-characters/"
   },
   "2958": {
+    "id": 2958,
     "category": "Sliding Window",
+    "title": "Length of Longest Subarray With at Most K Frequency",
     "difficulty": "Medium",
-    "id": 2958,
-    "link": "https://leetcode.com/problems/length-of-longest-subarray-with-at-most-k-frequency/",
-    "title": "Length of Longest Subarray With at Most K Frequency"
+    "link": "https://leetcode.com/problems/length-of-longest-subarray-with-at-most-k-frequency/"
   },
   "2959": {
+    "id": 2959,
     "category": "Graph Traversal",
+    "title": "Number of Possible Sets of Closing Branches",
     "difficulty": "Hard",
-    "id": 2959,
-    "link": "https://leetcode.com/problems/number-of-possible-sets-of-closing-branches/",
-    "title": "Number of Possible Sets of Closing Branches"
+    "link": "https://leetcode.com/problems/number-of-possible-sets-of-closing-branches/"
   },
   "2960": {
+    "id": 2960,
     "category": "Array & Hashing",
+    "title": "Count Tested Devices After Test Operations",
     "difficulty": "Easy",
-    "id": 2960,
-    "link": "https://leetcode.com/problems/count-tested-devices-after-test-operations/",
-    "title": "Count Tested Devices After Test Operations"
+    "link": "https://leetcode.com/problems/count-tested-devices-after-test-operations/"
   },
   "2961": {
+    "id": 2961,
     "category": "Math & Geometry",
+    "title": "Double Modular Exponentiation",
     "difficulty": "Medium",
-    "id": 2961,
-    "link": "https://leetcode.com/problems/double-modular-exponentiation/",
-    "title": "Double Modular Exponentiation"
+    "link": "https://leetcode.com/problems/double-modular-exponentiation/"
   },
   "2962": {
+    "id": 2962,
     "category": "Sliding Window",
+    "title": "Count Subarrays Where Max Element Appears at Least K Times",
     "difficulty": "Medium",
-    "id": 2962,
-    "link": "https://leetcode.com/problems/count-subarrays-where-max-element-appears-at-least-k-times/",
-    "title": "Count Subarrays Where Max Element Appears at Least K Times"
+    "link": "https://leetcode.com/problems/count-subarrays-where-max-element-appears-at-least-k-times/"
   },
   "2963": {
+    "id": 2963,
     "category": "Math & Geometry",
+    "title": "Count the Number of Good Partitions",
     "difficulty": "Hard",
-    "id": 2963,
-    "link": "https://leetcode.com/problems/count-the-number-of-good-partitions/",
-    "title": "Count the Number of Good Partitions"
+    "link": "https://leetcode.com/problems/count-the-number-of-good-partitions/"
   },
   "2964": {
+    "id": 2964,
     "category": "Array & Hashing",
+    "title": "Number of Divisible Triplet Sums",
     "difficulty": "Medium",
-    "id": 2964,
-    "link": "https://leetcode.com/problems/number-of-divisible-triplet-sums/",
-    "title": "Number of Divisible Triplet Sums"
+    "link": "https://leetcode.com/problems/number-of-divisible-triplet-sums/"
   },
   "2965": {
+    "id": 2965,
     "category": "Math & Geometry",
+    "title": "Find Missing and Repeated Values",
     "difficulty": "Easy",
-    "id": 2965,
-    "link": "https://leetcode.com/problems/find-missing-and-repeated-values/",
-    "title": "Find Missing and Repeated Values"
+    "link": "https://leetcode.com/problems/find-missing-and-repeated-values/"
   },
   "2966": {
+    "id": 2966,
     "category": "Greedy",
+    "title": "Divide Array Into Arrays With Max Difference",
     "difficulty": "Medium",
-    "id": 2966,
-    "link": "https://leetcode.com/problems/divide-array-into-arrays-with-max-difference/",
-    "title": "Divide Array Into Arrays With Max Difference"
+    "link": "https://leetcode.com/problems/divide-array-into-arrays-with-max-difference/"
   },
   "2967": {
+    "id": 2967,
     "category": "Binary Search",
+    "title": "Minimum Cost to Make Array Equalindromic",
     "difficulty": "Medium",
-    "id": 2967,
-    "link": "https://leetcode.com/problems/minimum-cost-to-make-array-equalindromic/",
-    "title": "Minimum Cost to Make Array Equalindromic"
+    "link": "https://leetcode.com/problems/minimum-cost-to-make-array-equalindromic/"
   },
   "2968": {
+    "id": 2968,
     "category": "Sliding Window",
+    "title": "Apply Operations to Maximize Frequency Score",
     "difficulty": "Hard",
-    "id": 2968,
-    "link": "https://leetcode.com/problems/apply-operations-to-maximize-frequency-score/",
-    "title": "Apply Operations to Maximize Frequency Score"
+    "link": "https://leetcode.com/problems/apply-operations-to-maximize-frequency-score/"
   },
   "2969": {
+    "id": 2969,
     "category": "Dynamic Programming",
+    "title": "Minimum Number of Coins for Fruits II",
     "difficulty": "Hard",
-    "id": 2969,
-    "link": "https://leetcode.com/problems/minimum-number-of-coins-for-fruits-ii/",
-    "title": "Minimum Number of Coins for Fruits II"
+    "link": "https://leetcode.com/problems/minimum-number-of-coins-for-fruits-ii/"
   },
   "2970": {
+    "id": 2970,
     "category": "Binary Search",
+    "title": "Count the Number of Incremovable Subarrays I",
     "difficulty": "Easy",
-    "id": 2970,
-    "link": "https://leetcode.com/problems/count-the-number-of-incremovable-subarrays-i/",
-    "title": "Count the Number of Incremovable Subarrays I"
+    "link": "https://leetcode.com/problems/count-the-number-of-incremovable-subarrays-i/"
   },
   "2971": {
+    "id": 2971,
     "category": "Greedy",
+    "title": "Find Polygon With the Largest Perimeter",
     "difficulty": "Medium",
-    "id": 2971,
-    "link": "https://leetcode.com/problems/find-polygon-with-the-largest-perimeter/",
-    "title": "Find Polygon With the Largest Perimeter"
+    "link": "https://leetcode.com/problems/find-polygon-with-the-largest-perimeter/"
   },
   "2972": {
+    "id": 2972,
     "category": "Binary Search",
+    "title": "Count the Number of Incremovable Subarrays II",
     "difficulty": "Hard",
-    "id": 2972,
-    "link": "https://leetcode.com/problems/count-the-number-of-incremovable-subarrays-ii/",
-    "title": "Count the Number of Incremovable Subarrays II"
+    "link": "https://leetcode.com/problems/count-the-number-of-incremovable-subarrays-ii/"
   },
   "2973": {
+    "id": 2973,
     "category": "Tree",
+    "title": "Find Number of Coins to Place in Tree Nodes",
     "difficulty": "Hard",
-    "id": 2973,
-    "link": "https://leetcode.com/problems/find-number-of-coins-to-place-in-tree-nodes/",
-    "title": "Find Number of Coins to Place in Tree Nodes"
+    "link": "https://leetcode.com/problems/find-number-of-coins-to-place-in-tree-nodes/"
   },
   "2974": {
+    "id": 2974,
     "category": "Heap (Priority Queue)",
+    "title": "Minimum Number Game",
     "difficulty": "Easy",
-    "id": 2974,
-    "link": "https://leetcode.com/problems/minimum-number-game/",
-    "title": "Minimum Number Game"
+    "link": "https://leetcode.com/problems/minimum-number-game/"
   },
   "2975": {
+    "id": 2975,
     "category": "Array & Hashing",
+    "title": "Maximum Square Area by Removing Fences From a Field",
     "difficulty": "Medium",
-    "id": 2975,
-    "link": "https://leetcode.com/problems/maximum-square-area-by-removing-fences-from-a-field/",
-    "title": "Maximum Square Area by Removing Fences From a Field"
+    "link": "https://leetcode.com/problems/maximum-square-area-by-removing-fences-from-a-field/"
   },
   "2976": {
+    "id": 2976,
     "category": "Graph Traversal",
+    "title": "Minimum Cost to Convert String I",
     "difficulty": "Medium",
-    "id": 2976,
-    "link": "https://leetcode.com/problems/minimum-cost-to-convert-string-i/",
-    "title": "Minimum Cost to Convert String I"
+    "link": "https://leetcode.com/problems/minimum-cost-to-convert-string-i/"
   },
   "2977": {
+    "id": 2977,
     "category": "Graph Traversal",
+    "title": "Minimum Cost to Convert String II",
     "difficulty": "Hard",
-    "id": 2977,
-    "link": "https://leetcode.com/problems/minimum-cost-to-convert-string-ii/",
-    "title": "Minimum Cost to Convert String II"
+    "link": "https://leetcode.com/problems/minimum-cost-to-convert-string-ii/"
   },
   "2978": {
+    "id": 2978,
     "category": "Database",
+    "title": "Symmetric Coordinates",
     "difficulty": "Medium",
-    "id": 2978,
-    "link": "https://leetcode.com/problems/symmetric-coordinates/",
-    "title": "Symmetric Coordinates"
+    "link": "https://leetcode.com/problems/symmetric-coordinates/"
   },
   "2979": {
+    "id": 2979,
     "category": "Dynamic Programming",
+    "title": "Most Expensive Item That Can Not Be Bought",
     "difficulty": "Medium",
-    "id": 2979,
-    "link": "https://leetcode.com/problems/most-expensive-item-that-can-not-be-bought/",
-    "title": "Most Expensive Item That Can Not Be Bought"
+    "link": "https://leetcode.com/problems/most-expensive-item-that-can-not-be-bought/"
   },
   "2980": {
+    "id": 2980,
     "category": "Bit Manipulation",
+    "title": "Check if Bitwise OR Has Trailing Zeros",
     "difficulty": "Easy",
-    "id": 2980,
-    "link": "https://leetcode.com/problems/check-if-bitwise-or-has-trailing-zeros/",
-    "title": "Check if Bitwise OR Has Trailing Zeros"
+    "link": "https://leetcode.com/problems/check-if-bitwise-or-has-trailing-zeros/"
   },
   "2981": {
+    "id": 2981,
     "category": "Sliding Window",
+    "title": "Find Longest Special Substring That Occurs Thrice I",
     "difficulty": "Medium",
-    "id": 2981,
-    "link": "https://leetcode.com/problems/find-longest-special-substring-that-occurs-thrice-i/",
-    "title": "Find Longest Special Substring That Occurs Thrice I"
+    "link": "https://leetcode.com/problems/find-longest-special-substring-that-occurs-thrice-i/"
   },
   "2982": {
+    "id": 2982,
     "category": "Sliding Window",
+    "title": "Find Longest Special Substring That Occurs Thrice II",
     "difficulty": "Medium",
-    "id": 2982,
-    "link": "https://leetcode.com/problems/find-longest-special-substring-that-occurs-thrice-ii/",
-    "title": "Find Longest Special Substring That Occurs Thrice II"
+    "link": "https://leetcode.com/problems/find-longest-special-substring-that-occurs-thrice-ii/"
   },
   "2983": {
+    "id": 2983,
     "category": "Array & Hashing",
+    "title": "Palindrome Rearrangement Queries",
     "difficulty": "Hard",
-    "id": 2983,
-    "link": "https://leetcode.com/problems/palindrome-rearrangement-queries/",
-    "title": "Palindrome Rearrangement Queries"
+    "link": "https://leetcode.com/problems/palindrome-rearrangement-queries/"
   },
   "2984": {
+    "id": 2984,
     "category": "Database",
+    "title": "Find Peak Calling Hours for Each City",
     "difficulty": "Medium",
-    "id": 2984,
-    "link": "https://leetcode.com/problems/find-peak-calling-hours-for-each-city/",
-    "title": "Find Peak Calling Hours for Each City"
+    "link": "https://leetcode.com/problems/find-peak-calling-hours-for-each-city/"
   },
   "2985": {
+    "id": 2985,
     "category": "Database",
+    "title": "Calculate Compressed Mean",
     "difficulty": "Easy",
-    "id": 2985,
-    "link": "https://leetcode.com/problems/calculate-compressed-mean/",
-    "title": "Calculate Compressed Mean"
+    "link": "https://leetcode.com/problems/calculate-compressed-mean/"
   },
   "2986": {
+    "id": 2986,
     "category": "Database",
+    "title": "Find Third Transaction",
     "difficulty": "Medium",
-    "id": 2986,
-    "link": "https://leetcode.com/problems/find-third-transaction/",
-    "title": "Find Third Transaction"
+    "link": "https://leetcode.com/problems/find-third-transaction/"
   },
   "2987": {
+    "id": 2987,
     "category": "Database",
+    "title": "Find Expensive Cities",
     "difficulty": "Easy",
-    "id": 2987,
-    "link": "https://leetcode.com/problems/find-expensive-cities/",
-    "title": "Find Expensive Cities"
+    "link": "https://leetcode.com/problems/find-expensive-cities/"
   },
   "2988": {
+    "id": 2988,
     "category": "Database",
+    "title": "Manager of the Largest Department",
     "difficulty": "Medium",
-    "id": 2988,
-    "link": "https://leetcode.com/problems/manager-of-the-largest-department/",
-    "title": "Manager of the Largest Department"
+    "link": "https://leetcode.com/problems/manager-of-the-largest-department/"
   },
   "2989": {
+    "id": 2989,
     "category": "Database",
+    "title": "Class Performance",
     "difficulty": "Medium",
-    "id": 2989,
-    "link": "https://leetcode.com/problems/class-performance/",
-    "title": "Class Performance"
+    "link": "https://leetcode.com/problems/class-performance/"
+  },
+  "2990": {
+    "id": 2990,
+    "category": "Database",
+    "title": "Loan Types",
+    "difficulty": "Easy",
+    "link": "https://leetcode.com/problems/loan-types/"
   },
-  "2990": {"category": "Database", "difficulty": "Easy", "id": 2990, "link": "https://leetcode.com/problems/loan-types/", "title": "Loan Types"},
   "2991": {
+    "id": 2991,
     "category": "Database",
+    "title": "Top Three Wineries ",
     "difficulty": "Hard",
-    "id": 2991,
-    "link": "https://leetcode.com/problems/top-three-wineries/",
-    "title": "Top Three Wineries "
+    "link": "https://leetcode.com/problems/top-three-wineries/"
   },
   "2992": {
+    "id": 2992,
     "category": "Dynamic Programming",
+    "title": "Number of Self-Divisible Permutations",
     "difficulty": "Medium",
-    "id": 2992,
-    "link": "https://leetcode.com/problems/number-of-self-divisible-permutations/",
-    "title": "Number of Self-Divisible Permutations"
+    "link": "https://leetcode.com/problems/number-of-self-divisible-permutations/"
   },
   "2993": {
+    "id": 2993,
     "category": "Database",
+    "title": "Friday Purchases I",
     "difficulty": "Medium",
-    "id": 2993,
-    "link": "https://leetcode.com/problems/friday-purchases-i/",
-    "title": "Friday Purchases I"
+    "link": "https://leetcode.com/problems/friday-purchases-i/"
   },
   "2994": {
+    "id": 2994,
     "category": "Database",
+    "title": "Friday Purchases II ",
     "difficulty": "Hard",
-    "id": 2994,
-    "link": "https://leetcode.com/problems/friday-purchases-ii/",
-    "title": "Friday Purchases II "
+    "link": "https://leetcode.com/problems/friday-purchases-ii/"
   },
   "2995": {
+    "id": 2995,
     "category": "Database",
+    "title": "Viewers Turned Streamers",
     "difficulty": "Hard",
-    "id": 2995,
-    "link": "https://leetcode.com/problems/viewers-turned-streamers/",
-    "title": "Viewers Turned Streamers"
+    "link": "https://leetcode.com/problems/viewers-turned-streamers/"
   },
   "2996": {
+    "id": 2996,
     "category": "Array & Hashing",
+    "title": "Smallest Missing Integer Greater Than Sequential Prefix Sum",
     "difficulty": "Easy",
-    "id": 2996,
-    "link": "https://leetcode.com/problems/smallest-missing-integer-greater-than-sequential-prefix-sum/",
-    "title": "Smallest Missing Integer Greater Than Sequential Prefix Sum"
+    "link": "https://leetcode.com/problems/smallest-missing-integer-greater-than-sequential-prefix-sum/"
   },
   "2997": {
+    "id": 2997,
     "category": "Bit Manipulation",
+    "title": "Minimum Number of Operations to Make Array XOR Equal to K",
     "difficulty": "Medium",
-    "id": 2997,
-    "link": "https://leetcode.com/problems/minimum-number-of-operations-to-make-array-xor-equal-to-k/",
-    "title": "Minimum Number of Operations to Make Array XOR Equal to K"
+    "link": "https://leetcode.com/problems/minimum-number-of-operations-to-make-array-xor-equal-to-k/"
   },
   "2998": {
+    "id": 2998,
     "category": "Graph Traversal",
+    "title": "Minimum Number of Operations to Make X and Y Equal",
     "difficulty": "Medium",
-    "id": 2998,
-    "link": "https://leetcode.com/problems/minimum-number-of-operations-to-make-x-and-y-equal/",
-    "title": "Minimum Number of Operations to Make X and Y Equal"
+    "link": "https://leetcode.com/problems/minimum-number-of-operations-to-make-x-and-y-equal/"
   },
   "2999": {
+    "id": 2999,
     "category": "Dynamic Programming",
+    "title": "Count the Number of Powerful Integers",
     "difficulty": "Hard",
-    "id": 2999,
-    "link": "https://leetcode.com/problems/count-the-number-of-powerful-integers/",
-    "title": "Count the Number of Powerful Integers"
+    "link": "https://leetcode.com/problems/count-the-number-of-powerful-integers/"
   },
   "3000": {
+    "id": 3000,
     "category": "Array & Hashing",
+    "title": "Maximum Area of Longest Diagonal Rectangle",
     "difficulty": "Easy",
-    "id": 3000,
-    "link": "https://leetcode.com/problems/maximum-area-of-longest-diagonal-rectangle/",
-    "title": "Maximum Area of Longest Diagonal Rectangle"
+    "link": "https://leetcode.com/problems/maximum-area-of-longest-diagonal-rectangle/"
   },
   "3001": {
+    "id": 3001,
     "category": "Math & Geometry",
+    "title": "Minimum Moves to Capture The Queen",
     "difficulty": "Medium",
-    "id": 3001,
-    "link": "https://leetcode.com/problems/minimum-moves-to-capture-the-queen/",
-    "title": "Minimum Moves to Capture The Queen"
+    "link": "https://leetcode.com/problems/minimum-moves-to-capture-the-queen/"
   },
   "3002": {
+    "id": 3002,
     "category": "Greedy",
+    "title": "Maximum Size of a Set After Removals",
     "difficulty": "Medium",
-    "id": 3002,
-    "link": "https://leetcode.com/problems/maximum-size-of-a-set-after-removals/",
-    "title": "Maximum Size of a Set After Removals"
+    "link": "https://leetcode.com/problems/maximum-size-of-a-set-after-removals/"
   },
   "3003": {
+    "id": 3003,
     "category": "Dynamic Programming",
+    "title": "Maximize the Number of Partitions After Operations",
     "difficulty": "Hard",
-    "id": 3003,
-    "link": "https://leetcode.com/problems/maximize-the-number-of-partitions-after-operations/",
-    "title": "Maximize the Number of Partitions After Operations"
+    "link": "https://leetcode.com/problems/maximize-the-number-of-partitions-after-operations/"
   },
   "3004": {
+    "id": 3004,
     "category": "Tree",
+    "title": "Maximum Subtree of the Same Color",
     "difficulty": "Medium",
-    "id": 3004,
-    "link": "https://leetcode.com/problems/maximum-subtree-of-the-same-color/",
-    "title": "Maximum Subtree of the Same Color"
+    "link": "https://leetcode.com/problems/maximum-subtree-of-the-same-color/"
   },
   "3005": {
+    "id": 3005,
     "category": "Array & Hashing",
+    "title": "Count Elements With Maximum Frequency",
     "difficulty": "Easy",
-    "id": 3005,
-    "link": "https://leetcode.com/problems/count-elements-with-maximum-frequency/",
-    "title": "Count Elements With Maximum Frequency"
+    "link": "https://leetcode.com/problems/count-elements-with-maximum-frequency/"
   },
   "3006": {
+    "id": 3006,
     "category": "Binary Search",
+    "title": "Find Beautiful Indices in the Given Array I",
     "difficulty": "Medium",
-    "id": 3006,
-    "link": "https://leetcode.com/problems/find-beautiful-indices-in-the-given-array-i/",
-    "title": "Find Beautiful Indices in the Given Array I"
+    "link": "https://leetcode.com/problems/find-beautiful-indices-in-the-given-array-i/"
   },
   "3007": {
+    "id": 3007,
     "category": "Dynamic Programming",
+    "title": "Maximum Number That Sum of the Prices Is Less Than or Equal to K",
     "difficulty": "Medium",
-    "id": 3007,
-    "link": "https://leetcode.com/problems/maximum-number-that-sum-of-the-prices-is-less-than-or-equal-to-k/",
-    "title": "Maximum Number That Sum of the Prices Is Less Than or Equal to K"
+    "link": "https://leetcode.com/problems/maximum-number-that-sum-of-the-prices-is-less-than-or-equal-to-k/"
   },
   "3008": {
+    "id": 3008,
     "category": "Binary Search",
+    "title": "Find Beautiful Indices in the Given Array II",
     "difficulty": "Hard",
-    "id": 3008,
-    "link": "https://leetcode.com/problems/find-beautiful-indices-in-the-given-array-ii/",
-    "title": "Find Beautiful Indices in the Given Array II"
+    "link": "https://leetcode.com/problems/find-beautiful-indices-in-the-given-array-ii/"
   },
   "3009": {
+    "id": 3009,
     "category": "Tree",
+    "title": "Maximum Number of Intersections on the Chart",
     "difficulty": "Hard",
-    "id": 3009,
-    "link": "https://leetcode.com/problems/maximum-number-of-intersections-on-the-chart/",
-    "title": "Maximum Number of Intersections on the Chart"
+    "link": "https://leetcode.com/problems/maximum-number-of-intersections-on-the-chart/"
   },
   "3010": {
+    "id": 3010,
     "category": "Array & Hashing",
+    "title": "Divide an Array Into Subarrays With Minimum Cost I",
     "difficulty": "Easy",
-    "id": 3010,
-    "link": "https://leetcode.com/problems/divide-an-array-into-subarrays-with-minimum-cost-i/",
-    "title": "Divide an Array Into Subarrays With Minimum Cost I"
+    "link": "https://leetcode.com/problems/divide-an-array-into-subarrays-with-minimum-cost-i/"
   },
   "3011": {
+    "id": 3011,
     "category": "Bit Manipulation",
+    "title": "Find if Array Can Be Sorted",
     "difficulty": "Medium",
-    "id": 3011,
-    "link": "https://leetcode.com/problems/find-if-array-can-be-sorted/",
-    "title": "Find if Array Can Be Sorted"
+    "link": "https://leetcode.com/problems/find-if-array-can-be-sorted/"
   },
   "3012": {
+    "id": 3012,
     "category": "Greedy",
+    "title": "Minimize Length of Array Using Operations",
     "difficulty": "Medium",
-    "id": 3012,
-    "link": "https://leetcode.com/problems/minimize-length-of-array-using-operations/",
-    "title": "Minimize Length of Array Using Operations"
+    "link": "https://leetcode.com/problems/minimize-length-of-array-using-operations/"
   },
   "3013": {
+    "id": 3013,
     "category": "Sliding Window",
+    "title": "Divide an Array Into Subarrays With Minimum Cost II",
     "difficulty": "Hard",
-    "id": 3013,
-    "link": "https://leetcode.com/problems/divide-an-array-into-subarrays-with-minimum-cost-ii/",
-    "title": "Divide an Array Into Subarrays With Minimum Cost II"
+    "link": "https://leetcode.com/problems/divide-an-array-into-subarrays-with-minimum-cost-ii/"
   },
   "3014": {
+    "id": 3014,
     "category": "Greedy",
+    "title": "Minimum Number of Pushes to Type Word I",
     "difficulty": "Easy",
-    "id": 3014,
-    "link": "https://leetcode.com/problems/minimum-number-of-pushes-to-type-word-i/",
-    "title": "Minimum Number of Pushes to Type Word I"
+    "link": "https://leetcode.com/problems/minimum-number-of-pushes-to-type-word-i/"
   },
   "3015": {
+    "id": 3015,
     "category": "Graph Traversal",
+    "title": "Count the Number of Houses at a Certain Distance I",
     "difficulty": "Medium",
-    "id": 3015,
-    "link": "https://leetcode.com/problems/count-the-number-of-houses-at-a-certain-distance-i/",
-    "title": "Count the Number of Houses at a Certain Distance I"
+    "link": "https://leetcode.com/problems/count-the-number-of-houses-at-a-certain-distance-i/"
   },
   "3016": {
+    "id": 3016,
     "category": "Greedy",
+    "title": "Minimum Number of Pushes to Type Word II",
     "difficulty": "Medium",
-    "id": 3016,
-    "link": "https://leetcode.com/problems/minimum-number-of-pushes-to-type-word-ii/",
-    "title": "Minimum Number of Pushes to Type Word II"
+    "link": "https://leetcode.com/problems/minimum-number-of-pushes-to-type-word-ii/"
   },
   "3017": {
+    "id": 3017,
     "category": "Graph Traversal",
+    "title": "Count the Number of Houses at a Certain Distance II",
     "difficulty": "Hard",
-    "id": 3017,
-    "link": "https://leetcode.com/problems/count-the-number-of-houses-at-a-certain-distance-ii/",
-    "title": "Count the Number of Houses at a Certain Distance II"
+    "link": "https://leetcode.com/problems/count-the-number-of-houses-at-a-certain-distance-ii/"
   },
   "3018": {
+    "id": 3018,
     "category": "Dynamic Programming",
+    "title": "Maximum Number of Removal Queries That Can Be Processed I",
     "difficulty": "Hard",
-    "id": 3018,
-    "link": "https://leetcode.com/problems/maximum-number-of-removal-queries-that-can-be-processed-i/",
-    "title": "Maximum Number of Removal Queries That Can Be Processed I"
+    "link": "https://leetcode.com/problems/maximum-number-of-removal-queries-that-can-be-processed-i/"
   },
   "3019": {
+    "id": 3019,
     "category": "Array & Hashing",
+    "title": "Number of Changing Keys",
     "difficulty": "Easy",
-    "id": 3019,
-    "link": "https://leetcode.com/problems/number-of-changing-keys/",
-    "title": "Number of Changing Keys"
+    "link": "https://leetcode.com/problems/number-of-changing-keys/"
   },
   "3020": {
+    "id": 3020,
     "category": "Array & Hashing",
+    "title": "Find the Maximum Number of Elements in Subset",
     "difficulty": "Medium",
-    "id": 3020,
-    "link": "https://leetcode.com/problems/find-the-maximum-number-of-elements-in-subset/",
-    "title": "Find the Maximum Number of Elements in Subset"
+    "link": "https://leetcode.com/problems/find-the-maximum-number-of-elements-in-subset/"
   },
   "3021": {
+    "id": 3021,
     "category": "Math & Geometry",
+    "title": "Alice and Bob Playing Flower Game",
     "difficulty": "Medium",
-    "id": 3021,
-    "link": "https://leetcode.com/problems/alice-and-bob-playing-flower-game/",
-    "title": "Alice and Bob Playing Flower Game"
+    "link": "https://leetcode.com/problems/alice-and-bob-playing-flower-game/"
   },
   "3022": {
+    "id": 3022,
     "category": "Bit Manipulation",
+    "title": "Minimize OR of Remaining Elements Using Operations",
     "difficulty": "Hard",
-    "id": 3022,
-    "link": "https://leetcode.com/problems/minimize-or-of-remaining-elements-using-operations/",
-    "title": "Minimize OR of Remaining Elements Using Operations"
+    "link": "https://leetcode.com/problems/minimize-or-of-remaining-elements-using-operations/"
   },
   "3023": {
+    "id": 3023,
     "category": "Sliding Window",
+    "title": "Find Pattern in Infinite Stream I",
     "difficulty": "Medium",
-    "id": 3023,
-    "link": "https://leetcode.com/problems/find-pattern-in-infinite-stream-i/",
-    "title": "Find Pattern in Infinite Stream I"
+    "link": "https://leetcode.com/problems/find-pattern-in-infinite-stream-i/"
   },
   "3024": {
+    "id": 3024,
     "category": "Math & Geometry",
+    "title": "Type of Triangle",
     "difficulty": "Easy",
-    "id": 3024,
-    "link": "https://leetcode.com/problems/type-of-triangle/",
-    "title": "Type of Triangle"
+    "link": "https://leetcode.com/problems/type-of-triangle/"
   },
   "3025": {
+    "id": 3025,
     "category": "Math & Geometry",
+    "title": "Find the Number of Ways to Place People I",
     "difficulty": "Medium",
-    "id": 3025,
-    "link": "https://leetcode.com/problems/find-the-number-of-ways-to-place-people-i/",
-    "title": "Find the Number of Ways to Place People I"
+    "link": "https://leetcode.com/problems/find-the-number-of-ways-to-place-people-i/"
   },
   "3026": {
+    "id": 3026,
     "category": "Array & Hashing",
+    "title": "Maximum Good Subarray Sum",
     "difficulty": "Medium",
-    "id": 3026,
-    "link": "https://leetcode.com/problems/maximum-good-subarray-sum/",
-    "title": "Maximum Good Subarray Sum"
+    "link": "https://leetcode.com/problems/maximum-good-subarray-sum/"
   },
   "3027": {
+    "id": 3027,
     "category": "Math & Geometry",
+    "title": "Find the Number of Ways to Place People II",
     "difficulty": "Hard",
-    "id": 3027,
-    "link": "https://leetcode.com/problems/find-the-number-of-ways-to-place-people-ii/",
-    "title": "Find the Number of Ways to Place People II"
+    "link": "https://leetcode.com/problems/find-the-number-of-ways-to-place-people-ii/"
   },
   "3028": {
+    "id": 3028,
     "category": "Array & Hashing",
+    "title": "Ant on the Boundary",
     "difficulty": "Easy",
-    "id": 3028,
-    "link": "https://leetcode.com/problems/ant-on-the-boundary/",
-    "title": "Ant on the Boundary"
+    "link": "https://leetcode.com/problems/ant-on-the-boundary/"
   },
   "3029": {
+    "id": 3029,
     "category": "Array & Hashing",
+    "title": "Minimum Time to Revert Word to Initial State I",
     "difficulty": "Medium",
-    "id": 3029,
-    "link": "https://leetcode.com/problems/minimum-time-to-revert-word-to-initial-state-i/",
-    "title": "Minimum Time to Revert Word to Initial State I"
+    "link": "https://leetcode.com/problems/minimum-time-to-revert-word-to-initial-state-i/"
   },
   "3030": {
+    "id": 3030,
     "category": "Array & Hashing",
+    "title": "Find the Grid of Region Average",
     "difficulty": "Medium",
-    "id": 3030,
-    "link": "https://leetcode.com/problems/find-the-grid-of-region-average/",
-    "title": "Find the Grid of Region Average"
+    "link": "https://leetcode.com/problems/find-the-grid-of-region-average/"
   },
   "3031": {
+    "id": 3031,
     "category": "Array & Hashing",
+    "title": "Minimum Time to Revert Word to Initial State II",
     "difficulty": "Hard",
-    "id": 3031,
-    "link": "https://leetcode.com/problems/minimum-time-to-revert-word-to-initial-state-ii/",
-    "title": "Minimum Time to Revert Word to Initial State II"
+    "link": "https://leetcode.com/problems/minimum-time-to-revert-word-to-initial-state-ii/"
   },
   "3032": {
+    "id": 3032,
     "category": "Dynamic Programming",
+    "title": "Count Numbers With Unique Digits II",
     "difficulty": "Easy",
-    "id": 3032,
-    "link": "https://leetcode.com/problems/count-numbers-with-unique-digits-ii/",
-    "title": "Count Numbers With Unique Digits II"
+    "link": "https://leetcode.com/problems/count-numbers-with-unique-digits-ii/"
   },
   "3033": {
+    "id": 3033,
     "category": "Array & Hashing",
+    "title": "Modify the Matrix",
     "difficulty": "Easy",
-    "id": 3033,
-    "link": "https://leetcode.com/problems/modify-the-matrix/",
-    "title": "Modify the Matrix"
+    "link": "https://leetcode.com/problems/modify-the-matrix/"
   },
   "3034": {
+    "id": 3034,
     "category": "Array & Hashing",
+    "title": "Number of Subarrays That Match a Pattern I",
     "difficulty": "Medium",
-    "id": 3034,
-    "link": "https://leetcode.com/problems/number-of-subarrays-that-match-a-pattern-i/",
-    "title": "Number of Subarrays That Match a Pattern I"
+    "link": "https://leetcode.com/problems/number-of-subarrays-that-match-a-pattern-i/"
   },
   "3035": {
+    "id": 3035,
     "category": "Greedy",
+    "title": "Maximum Palindromes After Operations",
     "difficulty": "Medium",
-    "id": 3035,
-    "link": "https://leetcode.com/problems/maximum-palindromes-after-operations/",
-    "title": "Maximum Palindromes After Operations"
+    "link": "https://leetcode.com/problems/maximum-palindromes-after-operations/"
   },
   "3036": {
+    "id": 3036,
     "category": "Array & Hashing",
+    "title": "Number of Subarrays That Match a Pattern II",
     "difficulty": "Hard",
-    "id": 3036,
-    "link": "https://leetcode.com/problems/number-of-subarrays-that-match-a-pattern-ii/",
-    "title": "Number of Subarrays That Match a Pattern II"
+    "link": "https://leetcode.com/problems/number-of-subarrays-that-match-a-pattern-ii/"
   },
   "3037": {
+    "id": 3037,
     "category": "Sliding Window",
+    "title": "Find Pattern in Infinite Stream II",
     "difficulty": "Hard",
-    "id": 3037,
-    "link": "https://leetcode.com/problems/find-pattern-in-infinite-stream-ii/",
-    "title": "Find Pattern in Infinite Stream II"
+    "link": "https://leetcode.com/problems/find-pattern-in-infinite-stream-ii/"
   },
   "3038": {
+    "id": 3038,
     "category": "Array & Hashing",
+    "title": "Maximum Number of Operations With the Same Score I",
     "difficulty": "Easy",
-    "id": 3038,
-    "link": "https://leetcode.com/problems/maximum-number-of-operations-with-the-same-score-i/",
-    "title": "Maximum Number of Operations With the Same Score I"
+    "link": "https://leetcode.com/problems/maximum-number-of-operations-with-the-same-score-i/"
   },
   "3039": {
+    "id": 3039,
     "category": "Array & Hashing",
+    "title": "Apply Operations to Make String Empty",
     "difficulty": "Medium",
-    "id": 3039,
-    "link": "https://leetcode.com/problems/apply-operations-to-make-string-empty/",
-    "title": "Apply Operations to Make String Empty"
+    "link": "https://leetcode.com/problems/apply-operations-to-make-string-empty/"
   },
   "3040": {
+    "id": 3040,
     "category": "Dynamic Programming",
+    "title": "Maximum Number of Operations With the Same Score II",
     "difficulty": "Medium",
-    "id": 3040,
-    "link": "https://leetcode.com/problems/maximum-number-of-operations-with-the-same-score-ii/",
-    "title": "Maximum Number of Operations With the Same Score II"
+    "link": "https://leetcode.com/problems/maximum-number-of-operations-with-the-same-score-ii/"
   },
   "3041": {
+    "id": 3041,
     "category": "Dynamic Programming",
+    "title": "Maximize Consecutive Elements in an Array After Modification",
     "difficulty": "Hard",
-    "id": 3041,
-    "link": "https://leetcode.com/problems/maximize-consecutive-elements-in-an-array-after-modification/",
-    "title": "Maximize Consecutive Elements in an Array After Modification"
+    "link": "https://leetcode.com/problems/maximize-consecutive-elements-in-an-array-after-modification/"
   },
   "3042": {
+    "id": 3042,
     "category": "Trie",
+    "title": "Count Prefix and Suffix Pairs I",
     "difficulty": "Easy",
-    "id": 3042,
-    "link": "https://leetcode.com/problems/count-prefix-and-suffix-pairs-i/",
-    "title": "Count Prefix and Suffix Pairs I"
+    "link": "https://leetcode.com/problems/count-prefix-and-suffix-pairs-i/"
   },
   "3043": {
+    "id": 3043,
     "category": "Trie",
+    "title": "Find the Length of the Longest Common Prefix",
     "difficulty": "Medium",
-    "id": 3043,
-    "link": "https://leetcode.com/problems/find-the-length-of-the-longest-common-prefix/",
-    "title": "Find the Length of the Longest Common Prefix"
+    "link": "https://leetcode.com/problems/find-the-length-of-the-longest-common-prefix/"
   },
   "3044": {
+    "id": 3044,
     "category": "Math & Geometry",
+    "title": "Most Frequent Prime",
     "difficulty": "Medium",
-    "id": 3044,
-    "link": "https://leetcode.com/problems/most-frequent-prime/",
-    "title": "Most Frequent Prime"
+    "link": "https://leetcode.com/problems/most-frequent-prime/"
   },
   "3045": {
+    "id": 3045,
     "category": "Trie",
+    "title": "Count Prefix and Suffix Pairs II",
     "difficulty": "Hard",
-    "id": 3045,
-    "link": "https://leetcode.com/problems/count-prefix-and-suffix-pairs-ii/",
-    "title": "Count Prefix and Suffix Pairs II"
+    "link": "https://leetcode.com/problems/count-prefix-and-suffix-pairs-ii/"
   },
   "3046": {
+    "id": 3046,
     "category": "Array & Hashing",
+    "title": "Split the Array",
     "difficulty": "Easy",
-    "id": 3046,
-    "link": "https://leetcode.com/problems/split-the-array/",
-    "title": "Split the Array"
+    "link": "https://leetcode.com/problems/split-the-array/"
   },
   "3047": {
+    "id": 3047,
     "category": "Math & Geometry",
+    "title": "Find the Largest Area of Square Inside Two Rectangles",
     "difficulty": "Medium",
-    "id": 3047,
-    "link": "https://leetcode.com/problems/find-the-largest-area-of-square-inside-two-rectangles/",
-    "title": "Find the Largest Area of Square Inside Two Rectangles"
+    "link": "https://leetcode.com/problems/find-the-largest-area-of-square-inside-two-rectangles/"
   },
   "3048": {
+    "id": 3048,
     "category": "Binary Search",
+    "title": "Earliest Second to Mark Indices I",
     "difficulty": "Medium",
-    "id": 3048,
-    "link": "https://leetcode.com/problems/earliest-second-to-mark-indices-i/",
-    "title": "Earliest Second to Mark Indices I"
+    "link": "https://leetcode.com/problems/earliest-second-to-mark-indices-i/"
   },
   "3049": {
+    "id": 3049,
     "category": "Binary Search",
+    "title": "Earliest Second to Mark Indices II",
     "difficulty": "Hard",
-    "id": 3049,
-    "link": "https://leetcode.com/problems/earliest-second-to-mark-indices-ii/",
-    "title": "Earliest Second to Mark Indices II"
+    "link": "https://leetcode.com/problems/earliest-second-to-mark-indices-ii/"
   },
   "3050": {
+    "id": 3050,
     "category": "Database",
+    "title": "Pizza Toppings Cost Analysis",
     "difficulty": "Medium",
-    "id": 3050,
-    "link": "https://leetcode.com/problems/pizza-toppings-cost-analysis/",
-    "title": "Pizza Toppings Cost Analysis"
+    "link": "https://leetcode.com/problems/pizza-toppings-cost-analysis/"
   },
   "3051": {
+    "id": 3051,
     "category": "Database",
+    "title": "Find Candidates for Data Scientist Position",
     "difficulty": "Easy",
-    "id": 3051,
-    "link": "https://leetcode.com/problems/find-candidates-for-data-scientist-position/",
-    "title": "Find Candidates for Data Scientist Position"
+    "link": "https://leetcode.com/problems/find-candidates-for-data-scientist-position/"
   },
   "3052": {
+    "id": 3052,
     "category": "Database",
+    "title": "Maximize Items",
     "difficulty": "Hard",
-    "id": 3052,
-    "link": "https://leetcode.com/problems/maximize-items/",
-    "title": "Maximize Items"
+    "link": "https://leetcode.com/problems/maximize-items/"
   },
   "3053": {
+    "id": 3053,
     "category": "Database",
+    "title": "Classifying Triangles by Lengths",
     "difficulty": "Easy",
-    "id": 3053,
-    "link": "https://leetcode.com/problems/classifying-triangles-by-lengths/",
-    "title": "Classifying Triangles by Lengths"
+    "link": "https://leetcode.com/problems/classifying-triangles-by-lengths/"
   },
   "3054": {
+    "id": 3054,
     "category": "Database",
+    "title": "Binary Tree Nodes",
     "difficulty": "Medium",
-    "id": 3054,
-    "link": "https://leetcode.com/problems/binary-tree-nodes/",
-    "title": "Binary Tree Nodes"
+    "link": "https://leetcode.com/problems/binary-tree-nodes/"
   },
   "3055": {
+    "id": 3055,
     "category": "Database",
+    "title": "Top Percentile Fraud",
     "difficulty": "Medium",
-    "id": 3055,
-    "link": "https://leetcode.com/problems/top-percentile-fraud/",
-    "title": "Top Percentile Fraud"
+    "link": "https://leetcode.com/problems/top-percentile-fraud/"
   },
   "3056": {
+    "id": 3056,
     "category": "Database",
+    "title": "Snaps Analysis",
     "difficulty": "Medium",
-    "id": 3056,
-    "link": "https://leetcode.com/problems/snaps-analysis/",
-    "title": "Snaps Analysis"
+    "link": "https://leetcode.com/problems/snaps-analysis/"
   },
   "3057": {
+    "id": 3057,
     "category": "Database",
+    "title": "Employees Project Allocation",
     "difficulty": "Hard",
-    "id": 3057,
-    "link": "https://leetcode.com/problems/employees-project-allocation/",
-    "title": "Employees Project Allocation"
+    "link": "https://leetcode.com/problems/employees-project-allocation/"
   },
   "3058": {
+    "id": 3058,
     "category": "Database",
+    "title": "Friends With No Mutual Friends",
     "difficulty": "Medium",
-    "id": 3058,
-    "link": "https://leetcode.com/problems/friends-with-no-mutual-friends/",
-    "title": "Friends With No Mutual Friends"
+    "link": "https://leetcode.com/problems/friends-with-no-mutual-friends/"
   },
   "3059": {
+    "id": 3059,
     "category": "Database",
+    "title": "Find All Unique Email Domains",
     "difficulty": "Easy",
-    "id": 3059,
-    "link": "https://leetcode.com/problems/find-all-unique-email-domains/",
-    "title": "Find All Unique Email Domains"
+    "link": "https://leetcode.com/problems/find-all-unique-email-domains/"
   },
   "3060": {
+    "id": 3060,
     "category": "Database",
+    "title": "User Activities within Time Bounds",
     "difficulty": "Hard",
-    "id": 3060,
-    "link": "https://leetcode.com/problems/user-activities-within-time-bounds/",
-    "title": "User Activities within Time Bounds"
+    "link": "https://leetcode.com/problems/user-activities-within-time-bounds/"
   },
   "3061": {
+    "id": 3061,
     "category": "Database",
+    "title": "Calculate Trapping Rain Water",
     "difficulty": "Hard",
-    "id": 3061,
-    "link": "https://leetcode.com/problems/calculate-trapping-rain-water/",
-    "title": "Calculate Trapping Rain Water"
+    "link": "https://leetcode.com/problems/calculate-trapping-rain-water/"
   },
   "3062": {
+    "id": 3062,
     "category": "Linked List",
+    "title": "Winner of the Linked List Game",
     "difficulty": "Easy",
-    "id": 3062,
-    "link": "https://leetcode.com/problems/winner-of-the-linked-list-game/",
-    "title": "Winner of the Linked List Game"
+    "link": "https://leetcode.com/problems/winner-of-the-linked-list-game/"
   },
   "3063": {
+    "id": 3063,
     "category": "Linked List",
+    "title": "Linked List Frequency",
     "difficulty": "Easy",
-    "id": 3063,
-    "link": "https://leetcode.com/problems/linked-list-frequency/",
-    "title": "Linked List Frequency"
+    "link": "https://leetcode.com/problems/linked-list-frequency/"
   },
   "3064": {
+    "id": 3064,
     "category": "Bit Manipulation",
+    "title": "Guess the Number Using Bitwise Questions I",
     "difficulty": "Medium",
-    "id": 3064,
-    "link": "https://leetcode.com/problems/guess-the-number-using-bitwise-questions-i/",
-    "title": "Guess the Number Using Bitwise Questions I"
+    "link": "https://leetcode.com/problems/guess-the-number-using-bitwise-questions-i/"
   },
   "3065": {
+    "id": 3065,
     "category": "Array & Hashing",
+    "title": "Minimum Operations to Exceed Threshold Value I",
     "difficulty": "Easy",
-    "id": 3065,
-    "link": "https://leetcode.com/problems/minimum-operations-to-exceed-threshold-value-i/",
-    "title": "Minimum Operations to Exceed Threshold Value I"
+    "link": "https://leetcode.com/problems/minimum-operations-to-exceed-threshold-value-i/"
   },
   "3066": {
+    "id": 3066,
     "category": "Heap (Priority Queue)",
+    "title": "Minimum Operations to Exceed Threshold Value II",
     "difficulty": "Medium",
-    "id": 3066,
-    "link": "https://leetcode.com/problems/minimum-operations-to-exceed-threshold-value-ii/",
-    "title": "Minimum Operations to Exceed Threshold Value II"
+    "link": "https://leetcode.com/problems/minimum-operations-to-exceed-threshold-value-ii/"
   },
   "3067": {
+    "id": 3067,
     "category": "Tree",
+    "title": "Count Pairs of Connectable Servers in a Weighted Tree Network",
     "difficulty": "Medium",
-    "id": 3067,
-    "link": "https://leetcode.com/problems/count-pairs-of-connectable-servers-in-a-weighted-tree-network/",
-    "title": "Count Pairs of Connectable Servers in a Weighted Tree Network"
+    "link": "https://leetcode.com/problems/count-pairs-of-connectable-servers-in-a-weighted-tree-network/"
   },
   "3068": {
+    "id": 3068,
     "category": "Tree",
+    "title": "Find the Maximum Sum of Node Values",
     "difficulty": "Hard",
-    "id": 3068,
-    "link": "https://leetcode.com/problems/find-the-maximum-sum-of-node-values/",
-    "title": "Find the Maximum Sum of Node Values"
+    "link": "https://leetcode.com/problems/find-the-maximum-sum-of-node-values/"
   },
   "3069": {
+    "id": 3069,
     "category": "Array & Hashing",
+    "title": "Distribute Elements Into Two Arrays I",
     "difficulty": "Easy",
-    "id": 3069,
-    "link": "https://leetcode.com/problems/distribute-elements-into-two-arrays-i/",
-    "title": "Distribute Elements Into Two Arrays I"
+    "link": "https://leetcode.com/problems/distribute-elements-into-two-arrays-i/"
   },
   "3070": {
+    "id": 3070,
     "category": "Array & Hashing",
+    "title": "Count Submatrices with Top-Left Element and Sum Less Than k",
     "difficulty": "Medium",
-    "id": 3070,
-    "link": "https://leetcode.com/problems/count-submatrices-with-top-left-element-and-sum-less-than-k/",
-    "title": "Count Submatrices with Top-Left Element and Sum Less Than k"
+    "link": "https://leetcode.com/problems/count-submatrices-with-top-left-element-and-sum-less-than-k/"
   },
   "3071": {
+    "id": 3071,
     "category": "Array & Hashing",
+    "title": "Minimum Operations to Write the Letter Y on a Grid",
     "difficulty": "Medium",
-    "id": 3071,
-    "link": "https://leetcode.com/problems/minimum-operations-to-write-the-letter-y-on-a-grid/",
-    "title": "Minimum Operations to Write the Letter Y on a Grid"
+    "link": "https://leetcode.com/problems/minimum-operations-to-write-the-letter-y-on-a-grid/"
   },
   "3072": {
+    "id": 3072,
     "category": "Tree",
+    "title": "Distribute Elements Into Two Arrays II",
     "difficulty": "Hard",
-    "id": 3072,
-    "link": "https://leetcode.com/problems/distribute-elements-into-two-arrays-ii/",
-    "title": "Distribute Elements Into Two Arrays II"
+    "link": "https://leetcode.com/problems/distribute-elements-into-two-arrays-ii/"
   },
   "3073": {
+    "id": 3073,
     "category": "Array & Hashing",
+    "title": "Maximum Increasing Triplet Value",
     "difficulty": "Medium",
-    "id": 3073,
-    "link": "https://leetcode.com/problems/maximum-increasing-triplet-value/",
-    "title": "Maximum Increasing Triplet Value"
+    "link": "https://leetcode.com/problems/maximum-increasing-triplet-value/"
   },
   "3074": {
+    "id": 3074,
     "category": "Greedy",
+    "title": "Apple Redistribution into Boxes",
     "difficulty": "Easy",
-    "id": 3074,
-    "link": "https://leetcode.com/problems/apple-redistribution-into-boxes/",
-    "title": "Apple Redistribution into Boxes"
+    "link": "https://leetcode.com/problems/apple-redistribution-into-boxes/"
   },
   "3075": {
+    "id": 3075,
     "category": "Greedy",
+    "title": "Maximize Happiness of Selected Children",
     "difficulty": "Medium",
-    "id": 3075,
-    "link": "https://leetcode.com/problems/maximize-happiness-of-selected-children/",
-    "title": "Maximize Happiness of Selected Children"
+    "link": "https://leetcode.com/problems/maximize-happiness-of-selected-children/"
   },
   "3076": {
+    "id": 3076,
     "category": "Trie",
+    "title": "Shortest Uncommon Substring in an Array",
     "difficulty": "Medium",
-    "id": 3076,
-    "link": "https://leetcode.com/problems/shortest-uncommon-substring-in-an-array/",
-    "title": "Shortest Uncommon Substring in an Array"
+    "link": "https://leetcode.com/problems/shortest-uncommon-substring-in-an-array/"
   },
   "3077": {
+    "id": 3077,
     "category": "Dynamic Programming",
+    "title": "Maximum Strength of K Disjoint Subarrays",
     "difficulty": "Hard",
-    "id": 3077,
-    "link": "https://leetcode.com/problems/maximum-strength-of-k-disjoint-subarrays/",
-    "title": "Maximum Strength of K Disjoint Subarrays"
+    "link": "https://leetcode.com/problems/maximum-strength-of-k-disjoint-subarrays/"
   },
   "3078": {
+    "id": 3078,
     "category": "Array & Hashing",
+    "title": "Match Alphanumerical Pattern in Matrix I",
     "difficulty": "Medium",
-    "id": 3078,
-    "link": "https://leetcode.com/problems/match-alphanumerical-pattern-in-matrix-i/",
-    "title": "Match Alphanumerical Pattern in Matrix I"
+    "link": "https://leetcode.com/problems/match-alphanumerical-pattern-in-matrix-i/"
   },
   "3079": {
+    "id": 3079,
     "category": "Math & Geometry",
+    "title": "Find the Sum of Encrypted Integers",
     "difficulty": "Easy",
-    "id": 3079,
-    "link": "https://leetcode.com/problems/find-the-sum-of-encrypted-integers/",
-    "title": "Find the Sum of Encrypted Integers"
+    "link": "https://leetcode.com/problems/find-the-sum-of-encrypted-integers/"
   },
   "3080": {
+    "id": 3080,
     "category": "Heap (Priority Queue)",
+    "title": "Mark Elements on Array by Performing Queries",
     "difficulty": "Medium",
-    "id": 3080,
-    "link": "https://leetcode.com/problems/mark-elements-on-array-by-performing-queries/",
-    "title": "Mark Elements on Array by Performing Queries"
+    "link": "https://leetcode.com/problems/mark-elements-on-array-by-performing-queries/"
   },
   "3081": {
+    "id": 3081,
     "category": "Heap (Priority Queue)",
+    "title": "Replace Question Marks in String to Minimize Its Value",
     "difficulty": "Medium",
-    "id": 3081,
-    "link": "https://leetcode.com/problems/replace-question-marks-in-string-to-minimize-its-value/",
-    "title": "Replace Question Marks in String to Minimize Its Value"
+    "link": "https://leetcode.com/problems/replace-question-marks-in-string-to-minimize-its-value/"
   },
   "3082": {
+    "id": 3082,
     "category": "Dynamic Programming",
+    "title": "Find the Sum of the Power of All Subsequences",
     "difficulty": "Hard",
-    "id": 3082,
-    "link": "https://leetcode.com/problems/find-the-sum-of-the-power-of-all-subsequences/",
-    "title": "Find the Sum of the Power of All Subsequences"
+    "link": "https://leetcode.com/problems/find-the-sum-of-the-power-of-all-subsequences/"
   },
   "3083": {
+    "id": 3083,
     "category": "Array & Hashing",
+    "title": "Existence of a Substring in a String and Its Reverse",
     "difficulty": "Easy",
-    "id": 3083,
-    "link": "https://leetcode.com/problems/existence-of-a-substring-in-a-string-and-its-reverse/",
-    "title": "Existence of a Substring in a String and Its Reverse"
+    "link": "https://leetcode.com/problems/existence-of-a-substring-in-a-string-and-its-reverse/"
   },
   "3084": {
+    "id": 3084,
     "category": "Math & Geometry",
+    "title": "Count Substrings Starting and Ending with Given Character",
     "difficulty": "Medium",
-    "id": 3084,
-    "link": "https://leetcode.com/problems/count-substrings-starting-and-ending-with-given-character/",
-    "title": "Count Substrings Starting and Ending with Given Character"
+    "link": "https://leetcode.com/problems/count-substrings-starting-and-ending-with-given-character/"
   },
   "3085": {
+    "id": 3085,
     "category": "Greedy",
+    "title": "Minimum Deletions to Make String K-Special",
     "difficulty": "Medium",
-    "id": 3085,
-    "link": "https://leetcode.com/problems/minimum-deletions-to-make-string-k-special/",
-    "title": "Minimum Deletions to Make String K-Special"
+    "link": "https://leetcode.com/problems/minimum-deletions-to-make-string-k-special/"
   },
   "3086": {
+    "id": 3086,
     "category": "Sliding Window",
+    "title": "Minimum Moves to Pick K Ones",
     "difficulty": "Hard",
-    "id": 3086,
-    "link": "https://leetcode.com/problems/minimum-moves-to-pick-k-ones/",
-    "title": "Minimum Moves to Pick K Ones"
+    "link": "https://leetcode.com/problems/minimum-moves-to-pick-k-ones/"
   },
   "3087": {
+    "id": 3087,
     "category": "Database",
+    "title": "Find Trending Hashtags",
     "difficulty": "Medium",
-    "id": 3087,
-    "link": "https://leetcode.com/problems/find-trending-hashtags/",
-    "title": "Find Trending Hashtags"
+    "link": "https://leetcode.com/problems/find-trending-hashtags/"
   },
   "3088": {
+    "id": 3088,
     "category": "Greedy",
+    "title": "Make String Anti-palindrome",
     "difficulty": "Hard",
-    "id": 3088,
-    "link": "https://leetcode.com/problems/make-string-anti-palindrome/",
-    "title": "Make String Anti-palindrome"
+    "link": "https://leetcode.com/problems/make-string-anti-palindrome/"
   },
   "3089": {
+    "id": 3089,
     "category": "Database",
+    "title": "Find Bursty Behavior",
     "difficulty": "Medium",
-    "id": 3089,
-    "link": "https://leetcode.com/problems/find-bursty-behavior/",
-    "title": "Find Bursty Behavior"
+    "link": "https://leetcode.com/problems/find-bursty-behavior/"
   },
   "3090": {
+    "id": 3090,
     "category": "Sliding Window",
+    "title": "Maximum Length Substring With Two Occurrences",
     "difficulty": "Easy",
-    "id": 3090,
-    "link": "https://leetcode.com/problems/maximum-length-substring-with-two-occurrences/",
-    "title": "Maximum Length Substring With Two Occurrences"
+    "link": "https://leetcode.com/problems/maximum-length-substring-with-two-occurrences/"
   },
   "3091": {
+    "id": 3091,
     "category": "Greedy",
+    "title": "Apply Operations to Make Sum of Array Greater Than or Equal to k",
     "difficulty": "Medium",
-    "id": 3091,
-    "link": "https://leetcode.com/problems/apply-operations-to-make-sum-of-array-greater-than-or-equal-to-k/",
-    "title": "Apply Operations to Make Sum of Array Greater Than or Equal to k"
+    "link": "https://leetcode.com/problems/apply-operations-to-make-sum-of-array-greater-than-or-equal-to-k/"
   },
   "3092": {
+    "id": 3092,
     "category": "Heap (Priority Queue)",
+    "title": "Most Frequent IDs",
     "difficulty": "Medium",
-    "id": 3092,
-    "link": "https://leetcode.com/problems/most-frequent-ids/",
-    "title": "Most Frequent IDs"
+    "link": "https://leetcode.com/problems/most-frequent-ids/"
   },
   "3093": {
+    "id": 3093,
     "category": "Trie",
+    "title": "Longest Common Suffix Queries",
     "difficulty": "Hard",
-    "id": 3093,
-    "link": "https://leetcode.com/problems/longest-common-suffix-queries/",
-    "title": "Longest Common Suffix Queries"
+    "link": "https://leetcode.com/problems/longest-common-suffix-queries/"
   },
   "3094": {
+    "id": 3094,
     "category": "Bit Manipulation",
+    "title": "Guess the Number Using Bitwise Questions II",
     "difficulty": "Medium",
-    "id": 3094,
-    "link": "https://leetcode.com/problems/guess-the-number-using-bitwise-questions-ii/",
-    "title": "Guess the Number Using Bitwise Questions II"
+    "link": "https://leetcode.com/problems/guess-the-number-using-bitwise-questions-ii/"
   },
   "3095": {
+    "id": 3095,
     "category": "Sliding Window",
+    "title": "Shortest Subarray With OR at Least K I",
     "difficulty": "Easy",
-    "id": 3095,
-    "link": "https://leetcode.com/problems/shortest-subarray-with-or-at-least-k-i/",
-    "title": "Shortest Subarray With OR at Least K I"
+    "link": "https://leetcode.com/problems/shortest-subarray-with-or-at-least-k-i/"
   },
   "3096": {
+    "id": 3096,
     "category": "Array & Hashing",
+    "title": "Minimum Levels to Gain More Points",
     "difficulty": "Medium",
-    "id": 3096,
-    "link": "https://leetcode.com/problems/minimum-levels-to-gain-more-points/",
-    "title": "Minimum Levels to Gain More Points"
+    "link": "https://leetcode.com/problems/minimum-levels-to-gain-more-points/"
   },
   "3097": {
+    "id": 3097,
     "category": "Sliding Window",
+    "title": "Shortest Subarray With OR at Least K II",
     "difficulty": "Medium",
-    "id": 3097,
-    "link": "https://leetcode.com/problems/shortest-subarray-with-or-at-least-k-ii/",
-    "title": "Shortest Subarray With OR at Least K II"
+    "link": "https://leetcode.com/problems/shortest-subarray-with-or-at-least-k-ii/"
   },
   "3098": {
+    "id": 3098,
     "category": "Dynamic Programming",
+    "title": "Find the Sum of Subsequence Powers",
     "difficulty": "Hard",
-    "id": 3098,
-    "link": "https://leetcode.com/problems/find-the-sum-of-subsequence-powers/",
-    "title": "Find the Sum of Subsequence Powers"
+    "link": "https://leetcode.com/problems/find-the-sum-of-subsequence-powers/"
   },
   "3099": {
+    "id": 3099,
     "category": "Math & Geometry",
+    "title": "Harshad Number",
     "difficulty": "Easy",
-    "id": 3099,
-    "link": "https://leetcode.com/problems/harshad-number/",
-    "title": "Harshad Number"
+    "link": "https://leetcode.com/problems/harshad-number/"
   },
   "3100": {
+    "id": 3100,
     "category": "Math & Geometry",
+    "title": "Water Bottles II",
     "difficulty": "Medium",
-    "id": 3100,
-    "link": "https://leetcode.com/problems/water-bottles-ii/",
-    "title": "Water Bottles II"
+    "link": "https://leetcode.com/problems/water-bottles-ii/"
   },
   "3101": {
+    "id": 3101,
     "category": "Math & Geometry",
+    "title": "Count Alternating Subarrays",
     "difficulty": "Medium",
-    "id": 3101,
-    "link": "https://leetcode.com/problems/count-alternating-subarrays/",
-    "title": "Count Alternating Subarrays"
+    "link": "https://leetcode.com/problems/count-alternating-subarrays/"
   },
   "3102": {
+    "id": 3102,
     "category": "Math & Geometry",
+    "title": "Minimize Manhattan Distances",
     "difficulty": "Hard",
-    "id": 3102,
-    "link": "https://leetcode.com/problems/minimize-manhattan-distances/",
-    "title": "Minimize Manhattan Distances"
+    "link": "https://leetcode.com/problems/minimize-manhattan-distances/"
   },
   "3103": {
+    "id": 3103,
     "category": "Database",
+    "title": "Find Trending Hashtags II ",
     "difficulty": "Hard",
-    "id": 3103,
-    "link": "https://leetcode.com/problems/find-trending-hashtags-ii/",
-    "title": "Find Trending Hashtags II "
+    "link": "https://leetcode.com/problems/find-trending-hashtags-ii/"
   },
   "3104": {
+    "id": 3104,
     "category": "Binary Search",
+    "title": "Find Longest Self-Contained Substring",
     "difficulty": "Hard",
-    "id": 3104,
-    "link": "https://leetcode.com/problems/find-longest-self-contained-substring/",
-    "title": "Find Longest Self-Contained Substring"
+    "link": "https://leetcode.com/problems/find-longest-self-contained-substring/"
   },
   "3105": {
+    "id": 3105,
     "category": "Array & Hashing",
+    "title": "Longest Strictly Increasing or Strictly Decreasing Subarray",
     "difficulty": "Easy",
-    "id": 3105,
-    "link": "https://leetcode.com/problems/longest-strictly-increasing-or-strictly-decreasing-subarray/",
-    "title": "Longest Strictly Increasing or Strictly Decreasing Subarray"
+    "link": "https://leetcode.com/problems/longest-strictly-increasing-or-strictly-decreasing-subarray/"
   },
   "3106": {
+    "id": 3106,
     "category": "Greedy",
+    "title": "Lexicographically Smallest String After Operations With Constraint",
     "difficulty": "Medium",
-    "id": 3106,
-    "link": "https://leetcode.com/problems/lexicographically-smallest-string-after-operations-with-constraint/",
-    "title": "Lexicographically Smallest String After Operations With Constraint"
+    "link": "https://leetcode.com/problems/lexicographically-smallest-string-after-operations-with-constraint/"
   },
   "3107": {
+    "id": 3107,
     "category": "Greedy",
+    "title": "Minimum Operations to Make Median of Array Equal to K",
     "difficulty": "Medium",
-    "id": 3107,
-    "link": "https://leetcode.com/problems/minimum-operations-to-make-median-of-array-equal-to-k/",
-    "title": "Minimum Operations to Make Median of Array Equal to K"
+    "link": "https://leetcode.com/problems/minimum-operations-to-make-median-of-array-equal-to-k/"
   },
   "3108": {
+    "id": 3108,
     "category": "Graph Traversal",
+    "title": "Minimum Cost Walk in Weighted Graph",
     "difficulty": "Hard",
-    "id": 3108,
-    "link": "https://leetcode.com/problems/minimum-cost-walk-in-weighted-graph/",
-    "title": "Minimum Cost Walk in Weighted Graph"
+    "link": "https://leetcode.com/problems/minimum-cost-walk-in-weighted-graph/"
   },
   "3109": {
+    "id": 3109,
     "category": "Tree",
+    "title": "Find the Index of Permutation",
     "difficulty": "Medium",
-    "id": 3109,
-    "link": "https://leetcode.com/problems/find-the-index-of-permutation/",
-    "title": "Find the Index of Permutation"
+    "link": "https://leetcode.com/problems/find-the-index-of-permutation/"
   },
   "3110": {
+    "id": 3110,
     "category": "Array & Hashing",
+    "title": "Score of a String",
     "difficulty": "Easy",
-    "id": 3110,
-    "link": "https://leetcode.com/problems/score-of-a-string/",
-    "title": "Score of a String"
+    "link": "https://leetcode.com/problems/score-of-a-string/"
   },
   "3111": {
+    "id": 3111,
     "category": "Greedy",
+    "title": "Minimum Rectangles to Cover Points",
     "difficulty": "Medium",
-    "id": 3111,
-    "link": "https://leetcode.com/problems/minimum-rectangles-to-cover-points/",
-    "title": "Minimum Rectangles to Cover Points"
+    "link": "https://leetcode.com/problems/minimum-rectangles-to-cover-points/"
   },
   "3112": {
+    "id": 3112,
     "category": "Graph Traversal",
+    "title": "Minimum Time to Visit Disappearing Nodes",
     "difficulty": "Medium",
-    "id": 3112,
-    "link": "https://leetcode.com/problems/minimum-time-to-visit-disappearing-nodes/",
-    "title": "Minimum Time to Visit Disappearing Nodes"
+    "link": "https://leetcode.com/problems/minimum-time-to-visit-disappearing-nodes/"
   },
   "3113": {
+    "id": 3113,
     "category": "Binary Search",
+    "title": "Find the Number of Subarrays Where Boundary Elements Are Maximum",
     "difficulty": "Hard",
-    "id": 3113,
-    "link": "https://leetcode.com/problems/find-the-number-of-subarrays-where-boundary-elements-are-maximum/",
-    "title": "Find the Number of Subarrays Where Boundary Elements Are Maximum"
+    "link": "https://leetcode.com/problems/find-the-number-of-subarrays-where-boundary-elements-are-maximum/"
   },
   "3114": {
+    "id": 3114,
     "category": "Array & Hashing",
+    "title": "Latest Time You Can Obtain After Replacing Characters",
     "difficulty": "Easy",
-    "id": 3114,
-    "link": "https://leetcode.com/problems/latest-time-you-can-obtain-after-replacing-characters/",
-    "title": "Latest Time You Can Obtain After Replacing Characters"
+    "link": "https://leetcode.com/problems/latest-time-you-can-obtain-after-replacing-characters/"
   },
   "3115": {
+    "id": 3115,
     "category": "Math & Geometry",
+    "title": "Maximum Prime Difference",
     "difficulty": "Medium",
-    "id": 3115,
-    "link": "https://leetcode.com/problems/maximum-prime-difference/",
-    "title": "Maximum Prime Difference"
+    "link": "https://leetcode.com/problems/maximum-prime-difference/"
   },
   "3116": {
+    "id": 3116,
     "category": "Binary Search",
+    "title": "Kth Smallest Amount With Single Denomination Combination",
     "difficulty": "Hard",
-    "id": 3116,
-    "link": "https://leetcode.com/problems/kth-smallest-amount-with-single-denomination-combination/",
-    "title": "Kth Smallest Amount With Single Denomination Combination"
+    "link": "https://leetcode.com/problems/kth-smallest-amount-with-single-denomination-combination/"
   },
   "3117": {
+    "id": 3117,
     "category": "Tree",
+    "title": "Minimum Sum of Values by Dividing Array",
     "difficulty": "Hard",
-    "id": 3117,
-    "link": "https://leetcode.com/problems/minimum-sum-of-values-by-dividing-array/",
-    "title": "Minimum Sum of Values by Dividing Array"
+    "link": "https://leetcode.com/problems/minimum-sum-of-values-by-dividing-array/"
   },
   "3118": {
+    "id": 3118,
     "category": "Database",
+    "title": "Friday Purchase III ",
     "difficulty": "Medium",
-    "id": 3118,
-    "link": "https://leetcode.com/problems/friday-purchase-iii/",
-    "title": "Friday Purchase III "
+    "link": "https://leetcode.com/problems/friday-purchase-iii/"
   },
   "3119": {
+    "id": 3119,
     "category": "Greedy",
+    "title": "Maximum Number of Potholes That Can Be Fixed",
     "difficulty": "Medium",
-    "id": 3119,
-    "link": "https://leetcode.com/problems/maximum-number-of-potholes-that-can-be-fixed/",
-    "title": "Maximum Number of Potholes That Can Be Fixed"
+    "link": "https://leetcode.com/problems/maximum-number-of-potholes-that-can-be-fixed/"
   },
   "3120": {
+    "id": 3120,
     "category": "Array & Hashing",
+    "title": "Count the Number of Special Characters I",
     "difficulty": "Easy",
-    "id": 3120,
-    "link": "https://leetcode.com/problems/count-the-number-of-special-characters-i/",
-    "title": "Count the Number of Special Characters I"
+    "link": "https://leetcode.com/problems/count-the-number-of-special-characters-i/"
   },
   "3121": {
+    "id": 3121,
     "category": "Array & Hashing",
+    "title": "Count the Number of Special Characters II",
     "difficulty": "Medium",
-    "id": 3121,
-    "link": "https://leetcode.com/problems/count-the-number-of-special-characters-ii/",
-    "title": "Count the Number of Special Characters II"
+    "link": "https://leetcode.com/problems/count-the-number-of-special-characters-ii/"
   },
   "3122": {
+    "id": 3122,
     "category": "Dynamic Programming",
+    "title": "Minimum Number of Operations to Satisfy Conditions",
     "difficulty": "Medium",
-    "id": 3122,
-    "link": "https://leetcode.com/problems/minimum-number-of-operations-to-satisfy-conditions/",
-    "title": "Minimum Number of Operations to Satisfy Conditions"
+    "link": "https://leetcode.com/problems/minimum-number-of-operations-to-satisfy-conditions/"
   },
   "3123": {
+    "id": 3123,
     "category": "Graph Traversal",
+    "title": "Find Edges in Shortest Paths",
     "difficulty": "Hard",
-    "id": 3123,
-    "link": "https://leetcode.com/problems/find-edges-in-shortest-paths/",
-    "title": "Find Edges in Shortest Paths"
+    "link": "https://leetcode.com/problems/find-edges-in-shortest-paths/"
   },
   "3124": {
+    "id": 3124,
     "category": "Database",
+    "title": "Find Longest Calls",
     "difficulty": "Medium",
-    "id": 3124,
-    "link": "https://leetcode.com/problems/find-longest-calls/",
-    "title": "Find Longest Calls"
+    "link": "https://leetcode.com/problems/find-longest-calls/"
   },
   "3125": {
+    "id": 3125,
     "category": "Greedy",
+    "title": "Maximum Number That Makes Result of Bitwise AND Zero",
     "difficulty": "Medium",
-    "id": 3125,
-    "link": "https://leetcode.com/problems/maximum-number-that-makes-result-of-bitwise-and-zero/",
-    "title": "Maximum Number That Makes Result of Bitwise AND Zero"
+    "link": "https://leetcode.com/problems/maximum-number-that-makes-result-of-bitwise-and-zero/"
   },
   "3126": {
+    "id": 3126,
     "category": "Database",
+    "title": "Server Utilization Time",
     "difficulty": "Medium",
-    "id": 3126,
-    "link": "https://leetcode.com/problems/server-utilization-time/",
-    "title": "Server Utilization Time"
+    "link": "https://leetcode.com/problems/server-utilization-time/"
   },
   "3127": {
+    "id": 3127,
     "category": "Array & Hashing",
+    "title": "Make a Square with the Same Color",
     "difficulty": "Easy",
-    "id": 3127,
-    "link": "https://leetcode.com/problems/make-a-square-with-the-same-color/",
-    "title": "Make a Square with the Same Color"
+    "link": "https://leetcode.com/problems/make-a-square-with-the-same-color/"
   },
   "3128": {
+    "id": 3128,
     "category": "Math & Geometry",
+    "title": "Right Triangles",
     "difficulty": "Medium",
-    "id": 3128,
-    "link": "https://leetcode.com/problems/right-triangles/",
-    "title": "Right Triangles"
+    "link": "https://leetcode.com/problems/right-triangles/"
   },
   "3129": {
+    "id": 3129,
     "category": "Dynamic Programming",
+    "title": "Find All Possible Stable Binary Arrays I",
     "difficulty": "Medium",
-    "id": 3129,
-    "link": "https://leetcode.com/problems/find-all-possible-stable-binary-arrays-i/",
-    "title": "Find All Possible Stable Binary Arrays I"
+    "link": "https://leetcode.com/problems/find-all-possible-stable-binary-arrays-i/"
   },
   "3130": {
+    "id": 3130,
     "category": "Dynamic Programming",
+    "title": "Find All Possible Stable Binary Arrays II",
     "difficulty": "Hard",
-    "id": 3130,
-    "link": "https://leetcode.com/problems/find-all-possible-stable-binary-arrays-ii/",
-    "title": "Find All Possible Stable Binary Arrays II"
+    "link": "https://leetcode.com/problems/find-all-possible-stable-binary-arrays-ii/"
   },
   "3131": {
+    "id": 3131,
     "category": "Array & Hashing",
+    "title": "Find the Integer Added to Array I",
     "difficulty": "Easy",
-    "id": 3131,
-    "link": "https://leetcode.com/problems/find-the-integer-added-to-array-i/",
-    "title": "Find the Integer Added to Array I"
+    "link": "https://leetcode.com/problems/find-the-integer-added-to-array-i/"
   },
   "3132": {
+    "id": 3132,
     "category": "Two Pointers",
+    "title": "Find the Integer Added to Array II",
     "difficulty": "Medium",
-    "id": 3132,
-    "link": "https://leetcode.com/problems/find-the-integer-added-to-array-ii/",
-    "title": "Find the Integer Added to Array II"
+    "link": "https://leetcode.com/problems/find-the-integer-added-to-array-ii/"
   },
   "3133": {
+    "id": 3133,
     "category": "Bit Manipulation",
+    "title": "Minimum Array End",
     "difficulty": "Medium",
-    "id": 3133,
-    "link": "https://leetcode.com/problems/minimum-array-end/",
-    "title": "Minimum Array End"
+    "link": "https://leetcode.com/problems/minimum-array-end/"
   },
   "3134": {
+    "id": 3134,
     "category": "Sliding Window",
+    "title": "Find the Median of the Uniqueness Array",
     "difficulty": "Hard",
-    "id": 3134,
-    "link": "https://leetcode.com/problems/find-the-median-of-the-uniqueness-array/",
-    "title": "Find the Median of the Uniqueness Array"
+    "link": "https://leetcode.com/problems/find-the-median-of-the-uniqueness-array/"
   },
   "3135": {
+    "id": 3135,
     "category": "Dynamic Programming",
+    "title": "Equalize Strings by Adding or Removing Characters at Ends",
     "difficulty": "Medium",
-    "id": 3135,
-    "link": "https://leetcode.com/problems/equalize-strings-by-adding-or-removing-characters-at-ends/",
-    "title": "Equalize Strings by Adding or Removing Characters at Ends"
+    "link": "https://leetcode.com/problems/equalize-strings-by-adding-or-removing-characters-at-ends/"
   },
   "3136": {
+    "id": 3136,
     "category": "Array & Hashing",
+    "title": "Valid Word",
     "difficulty": "Easy",
-    "id": 3136,
-    "link": "https://leetcode.com/problems/valid-word/",
-    "title": "Valid Word"
+    "link": "https://leetcode.com/problems/valid-word/"
   },
   "3137": {
+    "id": 3137,
     "category": "Array & Hashing",
+    "title": "Minimum Number of Operations to Make Word K-Periodic",
     "difficulty": "Medium",
-    "id": 3137,
-    "link": "https://leetcode.com/problems/minimum-number-of-operations-to-make-word-k-periodic/",
-    "title": "Minimum Number of Operations to Make Word K-Periodic"
+    "link": "https://leetcode.com/problems/minimum-number-of-operations-to-make-word-k-periodic/"
   },
   "3138": {
+    "id": 3138,
     "category": "Array & Hashing",
+    "title": "Minimum Length of Anagram Concatenation",
     "difficulty": "Medium",
-    "id": 3138,
-    "link": "https://leetcode.com/problems/minimum-length-of-anagram-concatenation/",
-    "title": "Minimum Length of Anagram Concatenation"
+    "link": "https://leetcode.com/problems/minimum-length-of-anagram-concatenation/"
   },
   "3139": {
+    "id": 3139,
     "category": "Greedy",
+    "title": "Minimum Cost to Equalize Array",
     "difficulty": "Hard",
-    "id": 3139,
-    "link": "https://leetcode.com/problems/minimum-cost-to-equalize-array/",
-    "title": "Minimum Cost to Equalize Array"
+    "link": "https://leetcode.com/problems/minimum-cost-to-equalize-array/"
   },
   "3140": {
+    "id": 3140,
     "category": "Database",
+    "title": "Consecutive Available Seats II",
     "difficulty": "Medium",
-    "id": 3140,
-    "link": "https://leetcode.com/problems/consecutive-available-seats-ii/",
-    "title": "Consecutive Available Seats II"
+    "link": "https://leetcode.com/problems/consecutive-available-seats-ii/"
   },
   "3141": {
+    "id": 3141,
     "category": "Graph Traversal",
+    "title": "Maximum Hamming Distances",
     "difficulty": "Hard",
-    "id": 3141,
-    "link": "https://leetcode.com/problems/maximum-hamming-distances/",
-    "title": "Maximum Hamming Distances"
+    "link": "https://leetcode.com/problems/maximum-hamming-distances/"
   },
   "3142": {
+    "id": 3142,
     "category": "Array & Hashing",
+    "title": "Check if Grid Satisfies Conditions",
     "difficulty": "Easy",
-    "id": 3142,
-    "link": "https://leetcode.com/problems/check-if-grid-satisfies-conditions/",
-    "title": "Check if Grid Satisfies Conditions"
+    "link": "https://leetcode.com/problems/check-if-grid-satisfies-conditions/"
   },
   "3143": {
+    "id": 3143,
     "category": "Binary Search",
+    "title": "Maximum Points Inside the Square",
     "difficulty": "Medium",
-    "id": 3143,
-    "link": "https://leetcode.com/problems/maximum-points-inside-the-square/",
-    "title": "Maximum Points Inside the Square"
+    "link": "https://leetcode.com/problems/maximum-points-inside-the-square/"
   },
   "3144": {
+    "id": 3144,
     "category": "Dynamic Programming",
+    "title": "Minimum Substring Partition of Equal Character Frequency",
     "difficulty": "Medium",
-    "id": 3144,
-    "link": "https://leetcode.com/problems/minimum-substring-partition-of-equal-character-frequency/",
-    "title": "Minimum Substring Partition of Equal Character Frequency"
+    "link": "https://leetcode.com/problems/minimum-substring-partition-of-equal-character-frequency/"
   },
   "3145": {
+    "id": 3145,
     "category": "Binary Search",
+    "title": "Find Products of Elements of Big Array",
     "difficulty": "Hard",
-    "id": 3145,
-    "link": "https://leetcode.com/problems/find-products-of-elements-of-big-array/",
-    "title": "Find Products of Elements of Big Array"
+    "link": "https://leetcode.com/problems/find-products-of-elements-of-big-array/"
   },
   "3146": {
+    "id": 3146,
     "category": "Array & Hashing",
+    "title": "Permutation Difference between Two Strings",
     "difficulty": "Easy",
-    "id": 3146,
-    "link": "https://leetcode.com/problems/permutation-difference-between-two-strings/",
-    "title": "Permutation Difference between Two Strings"
+    "link": "https://leetcode.com/problems/permutation-difference-between-two-strings/"
   },
   "3147": {
+    "id": 3147,
     "category": "Array & Hashing",
+    "title": "Taking Maximum Energy From the Mystic Dungeon",
     "difficulty": "Medium",
-    "id": 3147,
-    "link": "https://leetcode.com/problems/taking-maximum-energy-from-the-mystic-dungeon/",
-    "title": "Taking Maximum Energy From the Mystic Dungeon"
+    "link": "https://leetcode.com/problems/taking-maximum-energy-from-the-mystic-dungeon/"
   },
   "3148": {
+    "id": 3148,
     "category": "Dynamic Programming",
+    "title": "Maximum Difference Score in a Grid",
     "difficulty": "Medium",
-    "id": 3148,
-    "link": "https://leetcode.com/problems/maximum-difference-score-in-a-grid/",
-    "title": "Maximum Difference Score in a Grid"
+    "link": "https://leetcode.com/problems/maximum-difference-score-in-a-grid/"
   },
   "3149": {
+    "id": 3149,
     "category": "Dynamic Programming",
+    "title": "Find the Minimum Cost Array Permutation",
     "difficulty": "Hard",
-    "id": 3149,
-    "link": "https://leetcode.com/problems/find-the-minimum-cost-array-permutation/",
-    "title": "Find the Minimum Cost Array Permutation"
+    "link": "https://leetcode.com/problems/find-the-minimum-cost-array-permutation/"
   },
   "3150": {
+    "id": 3150,
     "category": "Database",
+    "title": "Invalid Tweets II",
     "difficulty": "Easy",
-    "id": 3150,
-    "link": "https://leetcode.com/problems/invalid-tweets-ii/",
-    "title": "Invalid Tweets II"
+    "link": "https://leetcode.com/problems/invalid-tweets-ii/"
   },
   "3151": {
+    "id": 3151,
     "category": "Array & Hashing",
+    "title": "Special Array I",
     "difficulty": "Easy",
-    "id": 3151,
-    "link": "https://leetcode.com/problems/special-array-i/",
-    "title": "Special Array I"
+    "link": "https://leetcode.com/problems/special-array-i/"
   },
   "3152": {
+    "id": 3152,
     "category": "Binary Search",
+    "title": "Special Array II",
     "difficulty": "Medium",
-    "id": 3152,
-    "link": "https://leetcode.com/problems/special-array-ii/",
-    "title": "Special Array II"
+    "link": "https://leetcode.com/problems/special-array-ii/"
   },
   "3153": {
+    "id": 3153,
     "category": "Math & Geometry",
+    "title": "Sum of Digit Differences of All Pairs",
     "difficulty": "Medium",
-    "id": 3153,
-    "link": "https://leetcode.com/problems/sum-of-digit-differences-of-all-pairs/",
-    "title": "Sum of Digit Differences of All Pairs"
+    "link": "https://leetcode.com/problems/sum-of-digit-differences-of-all-pairs/"
   },
   "3154": {
+    "id": 3154,
     "category": "Dynamic Programming",
+    "title": "Find Number of Ways to Reach the K-th Stair",
     "difficulty": "Hard",
-    "id": 3154,
-    "link": "https://leetcode.com/problems/find-number-of-ways-to-reach-the-k-th-stair/",
-    "title": "Find Number of Ways to Reach the K-th Stair"
+    "link": "https://leetcode.com/problems/find-number-of-ways-to-reach-the-k-th-stair/"
   },
   "3155": {
+    "id": 3155,
     "category": "Binary Search",
+    "title": "Maximum Number of Upgradable Servers",
     "difficulty": "Medium",
-    "id": 3155,
-    "link": "https://leetcode.com/problems/maximum-number-of-upgradable-servers/",
-    "title": "Maximum Number of Upgradable Servers"
+    "link": "https://leetcode.com/problems/maximum-number-of-upgradable-servers/"
   },
   "3156": {
+    "id": 3156,
     "category": "Database",
+    "title": "Employee Task Duration and Concurrent Tasks",
     "difficulty": "Hard",
-    "id": 3156,
-    "link": "https://leetcode.com/problems/employee-task-duration-and-concurrent-tasks/",
-    "title": "Employee Task Duration and Concurrent Tasks"
+    "link": "https://leetcode.com/problems/employee-task-duration-and-concurrent-tasks/"
   },
   "3157": {
+    "id": 3157,
     "category": "Tree",
+    "title": "Find the Level of Tree with Minimum Sum",
     "difficulty": "Medium",
-    "id": 3157,
-    "link": "https://leetcode.com/problems/find-the-level-of-tree-with-minimum-sum/",
-    "title": "Find the Level of Tree with Minimum Sum"
+    "link": "https://leetcode.com/problems/find-the-level-of-tree-with-minimum-sum/"
   },
   "3158": {
+    "id": 3158,
     "category": "Bit Manipulation",
+    "title": "Find the XOR of Numbers Which Appear Twice",
     "difficulty": "Easy",
-    "id": 3158,
-    "link": "https://leetcode.com/problems/find-the-xor-of-numbers-which-appear-twice/",
-    "title": "Find the XOR of Numbers Which Appear Twice"
+    "link": "https://leetcode.com/problems/find-the-xor-of-numbers-which-appear-twice/"
   },
   "3159": {
+    "id": 3159,
     "category": "Array & Hashing",
+    "title": "Find Occurrences of an Element in an Array",
     "difficulty": "Medium",
-    "id": 3159,
-    "link": "https://leetcode.com/problems/find-occurrences-of-an-element-in-an-array/",
-    "title": "Find Occurrences of an Element in an Array"
+    "link": "https://leetcode.com/problems/find-occurrences-of-an-element-in-an-array/"
   },
   "3160": {
+    "id": 3160,
     "category": "Array & Hashing",
+    "title": "Find the Number of Distinct Colors Among the Balls",
     "difficulty": "Medium",
-    "id": 3160,
-    "link": "https://leetcode.com/problems/find-the-number-of-distinct-colors-among-the-balls/",
-    "title": "Find the Number of Distinct Colors Among the Balls"
+    "link": "https://leetcode.com/problems/find-the-number-of-distinct-colors-among-the-balls/"
   },
   "3161": {
+    "id": 3161,
     "category": "Tree",
+    "title": "Block Placement Queries",
     "difficulty": "Hard",
-    "id": 3161,
-    "link": "https://leetcode.com/problems/block-placement-queries/",
-    "title": "Block Placement Queries"
+    "link": "https://leetcode.com/problems/block-placement-queries/"
   },
   "3162": {
+    "id": 3162,
     "category": "Array & Hashing",
+    "title": "Find the Number of Good Pairs I",
     "difficulty": "Easy",
-    "id": 3162,
-    "link": "https://leetcode.com/problems/find-the-number-of-good-pairs-i/",
-    "title": "Find the Number of Good Pairs I"
+    "link": "https://leetcode.com/problems/find-the-number-of-good-pairs-i/"
   },
   "3163": {
+    "id": 3163,
     "category": "Array & Hashing",
+    "title": "String Compression III",
     "difficulty": "Medium",
-    "id": 3163,
-    "link": "https://leetcode.com/problems/string-compression-iii/",
-    "title": "String Compression III"
+    "link": "https://leetcode.com/problems/string-compression-iii/"
   },
   "3164": {
+    "id": 3164,
     "category": "Array & Hashing",
+    "title": "Find the Number of Good Pairs II",
     "difficulty": "Medium",
-    "id": 3164,
-    "link": "https://leetcode.com/problems/find-the-number-of-good-pairs-ii/",
-    "title": "Find the Number of Good Pairs II"
+    "link": "https://leetcode.com/problems/find-the-number-of-good-pairs-ii/"
   },
   "3165": {
+    "id": 3165,
     "category": "Tree",
+    "title": "Maximum Sum of Subsequence With Non-adjacent Elements",
     "difficulty": "Hard",
-    "id": 3165,
-    "link": "https://leetcode.com/problems/maximum-sum-of-subsequence-with-non-adjacent-elements/",
-    "title": "Maximum Sum of Subsequence With Non-adjacent Elements"
+    "link": "https://leetcode.com/problems/maximum-sum-of-subsequence-with-non-adjacent-elements/"
   },
   "3166": {
+    "id": 3166,
     "category": "Database",
+    "title": "Calculate Parking Fees and Duration",
     "difficulty": "Medium",
-    "id": 3166,
-    "link": "https://leetcode.com/problems/calculate-parking-fees-and-duration/",
-    "title": "Calculate Parking Fees and Duration"
+    "link": "https://leetcode.com/problems/calculate-parking-fees-and-duration/"
   },
   "3167": {
+    "id": 3167,
     "category": "Array & Hashing",
+    "title": "Better Compression of String",
     "difficulty": "Medium",
-    "id": 3167,
-    "link": "https://leetcode.com/problems/better-compression-of-string/",
-    "title": "Better Compression of String"
+    "link": "https://leetcode.com/problems/better-compression-of-string/"
   },
   "3168": {
+    "id": 3168,
     "category": "Array & Hashing",
+    "title": "Minimum Number of Chairs in a Waiting Room",
     "difficulty": "Easy",
-    "id": 3168,
-    "link": "https://leetcode.com/problems/minimum-number-of-chairs-in-a-waiting-room/",
-    "title": "Minimum Number of Chairs in a Waiting Room"
+    "link": "https://leetcode.com/problems/minimum-number-of-chairs-in-a-waiting-room/"
   },
   "3169": {
+    "id": 3169,
     "category": "Array & Hashing",
+    "title": "Count Days Without Meetings",
     "difficulty": "Medium",
-    "id": 3169,
-    "link": "https://leetcode.com/problems/count-days-without-meetings/",
-    "title": "Count Days Without Meetings"
+    "link": "https://leetcode.com/problems/count-days-without-meetings/"
   },
   "3170": {
+    "id": 3170,
     "category": "Heap (Priority Queue)",
+    "title": "Lexicographically Minimum String After Removing Stars",
     "difficulty": "Medium",
-    "id": 3170,
-    "link": "https://leetcode.com/problems/lexicographically-minimum-string-after-removing-stars/",
-    "title": "Lexicographically Minimum String After Removing Stars"
+    "link": "https://leetcode.com/problems/lexicographically-minimum-string-after-removing-stars/"
   },
   "3171": {
+    "id": 3171,
     "category": "Tree",
+    "title": "Find Subarray With Bitwise OR Closest to K",
     "difficulty": "Hard",
-    "id": 3171,
-    "link": "https://leetcode.com/problems/find-subarray-with-bitwise-or-closest-to-k/",
-    "title": "Find Subarray With Bitwise OR Closest to K"
+    "link": "https://leetcode.com/problems/find-subarray-with-bitwise-or-closest-to-k/"
   },
   "3172": {
+    "id": 3172,
     "category": "Database",
+    "title": "Second Day Verification",
     "difficulty": "Easy",
-    "id": 3172,
-    "link": "https://leetcode.com/problems/second-day-verification/",
-    "title": "Second Day Verification"
+    "link": "https://leetcode.com/problems/second-day-verification/"
   },
   "3173": {
+    "id": 3173,
     "category": "Bit Manipulation",
+    "title": "Bitwise OR of Adjacent Elements",
     "difficulty": "Easy",
-    "id": 3173,
-    "link": "https://leetcode.com/problems/bitwise-or-of-adjacent-elements/",
-    "title": "Bitwise OR of Adjacent Elements"
+    "link": "https://leetcode.com/problems/bitwise-or-of-adjacent-elements/"
+  },
+  "3174": {
+    "id": 3174,
+    "category": "Stack",
+    "title": "Clear Digits",
+    "difficulty": "Easy",
+    "link": "https://leetcode.com/problems/clear-digits/"
   },
-  "3174": {"category": "Stack", "difficulty": "Easy", "id": 3174, "link": "https://leetcode.com/problems/clear-digits/", "title": "Clear Digits"},
   "3175": {
+    "id": 3175,
     "category": "Array & Hashing",
+    "title": "Find The First Player to win K Games in a Row",
     "difficulty": "Medium",
-    "id": 3175,
-    "link": "https://leetcode.com/problems/find-the-first-player-to-win-k-games-in-a-row/",
-    "title": "Find The First Player to win K Games in a Row"
+    "link": "https://leetcode.com/problems/find-the-first-player-to-win-k-games-in-a-row/"
   },
   "3176": {
+    "id": 3176,
     "category": "Dynamic Programming",
+    "title": "Find the Maximum Length of a Good Subsequence I",
     "difficulty": "Medium",
-    "id": 3176,
-    "link": "https://leetcode.com/problems/find-the-maximum-length-of-a-good-subsequence-i/",
-    "title": "Find the Maximum Length of a Good Subsequence I"
+    "link": "https://leetcode.com/problems/find-the-maximum-length-of-a-good-subsequence-i/"
   },
   "3177": {
+    "id": 3177,
     "category": "Dynamic Programming",
+    "title": "Find the Maximum Length of a Good Subsequence II",
     "difficulty": "Hard",
-    "id": 3177,
-    "link": "https://leetcode.com/problems/find-the-maximum-length-of-a-good-subsequence-ii/",
-    "title": "Find the Maximum Length of a Good Subsequence II"
+    "link": "https://leetcode.com/problems/find-the-maximum-length-of-a-good-subsequence-ii/"
   },
   "3178": {
+    "id": 3178,
     "category": "Math & Geometry",
+    "title": "Find the Child Who Has the Ball After K Seconds",
     "difficulty": "Easy",
-    "id": 3178,
-    "link": "https://leetcode.com/problems/find-the-child-who-has-the-ball-after-k-seconds/",
-    "title": "Find the Child Who Has the Ball After K Seconds"
+    "link": "https://leetcode.com/problems/find-the-child-who-has-the-ball-after-k-seconds/"
   },
   "3179": {
+    "id": 3179,
     "category": "Math & Geometry",
+    "title": "Find the N-th Value After K Seconds",
     "difficulty": "Medium",
-    "id": 3179,
-    "link": "https://leetcode.com/problems/find-the-n-th-value-after-k-seconds/",
-    "title": "Find the N-th Value After K Seconds"
+    "link": "https://leetcode.com/problems/find-the-n-th-value-after-k-seconds/"
   },
   "3180": {
+    "id": 3180,
     "category": "Dynamic Programming",
+    "title": "Maximum Total Reward Using Operations I",
     "difficulty": "Medium",
-    "id": 3180,
-    "link": "https://leetcode.com/problems/maximum-total-reward-using-operations-i/",
-    "title": "Maximum Total Reward Using Operations I"
+    "link": "https://leetcode.com/problems/maximum-total-reward-using-operations-i/"
   },
   "3181": {
+    "id": 3181,
     "category": "Dynamic Programming",
+    "title": "Maximum Total Reward Using Operations II",
     "difficulty": "Hard",
-    "id": 3181,
-    "link": "https://leetcode.com/problems/maximum-total-reward-using-operations-ii/",
-    "title": "Maximum Total Reward Using Operations II"
+    "link": "https://leetcode.com/problems/maximum-total-reward-using-operations-ii/"
   },
   "3182": {
+    "id": 3182,
     "category": "Database",
+    "title": "Find Top Scoring Students",
     "difficulty": "Medium",
-    "id": 3182,
-    "link": "https://leetcode.com/problems/find-top-scoring-students/",
-    "title": "Find Top Scoring Students"
+    "link": "https://leetcode.com/problems/find-top-scoring-students/"
   },
   "3183": {
+    "id": 3183,
     "category": "Dynamic Programming",
+    "title": "The Number of Ways to Make the Sum",
     "difficulty": "Medium",
-    "id": 3183,
-    "link": "https://leetcode.com/problems/the-number-of-ways-to-make-the-sum/",
-    "title": "The Number of Ways to Make the Sum"
+    "link": "https://leetcode.com/problems/the-number-of-ways-to-make-the-sum/"
   },
   "3184": {
+    "id": 3184,
     "category": "Array & Hashing",
+    "title": "Count Pairs That Form a Complete Day I",
     "difficulty": "Easy",
-    "id": 3184,
-    "link": "https://leetcode.com/problems/count-pairs-that-form-a-complete-day-i/",
-    "title": "Count Pairs That Form a Complete Day I"
+    "link": "https://leetcode.com/problems/count-pairs-that-form-a-complete-day-i/"
   },
   "3185": {
+    "id": 3185,
     "category": "Array & Hashing",
+    "title": "Count Pairs That Form a Complete Day II",
     "difficulty": "Medium",
-    "id": 3185,
-    "link": "https://leetcode.com/problems/count-pairs-that-form-a-complete-day-ii/",
-    "title": "Count Pairs That Form a Complete Day II"
+    "link": "https://leetcode.com/problems/count-pairs-that-form-a-complete-day-ii/"
   },
   "3186": {
+    "id": 3186,
     "category": "Dynamic Programming",
+    "title": "Maximum Total Damage With Spell Casting",
     "difficulty": "Medium",
-    "id": 3186,
-    "link": "https://leetcode.com/problems/maximum-total-damage-with-spell-casting/",
-    "title": "Maximum Total Damage With Spell Casting"
+    "link": "https://leetcode.com/problems/maximum-total-damage-with-spell-casting/"
+  },
+  "3187": {
+    "id": 3187,
+    "category": "Tree",
+    "title": "Peaks in Array",
+    "difficulty": "Hard",
+    "link": "https://leetcode.com/problems/peaks-in-array/"
   },
-  "3187": {"category": "Tree", "difficulty": "Hard", "id": 3187, "link": "https://leetcode.com/problems/peaks-in-array/", "title": "Peaks in Array"},
   "3188": {
+    "id": 3188,
     "category": "Database",
+    "title": "Find Top Scoring Students II",
     "difficulty": "Hard",
-    "id": 3188,
-    "link": "https://leetcode.com/problems/find-top-scoring-students-ii/",
-    "title": "Find Top Scoring Students II"
+    "link": "https://leetcode.com/problems/find-top-scoring-students-ii/"
   },
   "3189": {
+    "id": 3189,
     "category": "Greedy",
+    "title": "Minimum Moves to Get a Peaceful Board",
     "difficulty": "Medium",
-    "id": 3189,
-    "link": "https://leetcode.com/problems/minimum-moves-to-get-a-peaceful-board/",
-    "title": "Minimum Moves to Get a Peaceful Board"
+    "link": "https://leetcode.com/problems/minimum-moves-to-get-a-peaceful-board/"
   },
   "3190": {
+    "id": 3190,
     "category": "Math & Geometry",
+    "title": "Find Minimum Operations to Make All Elements Divisible by Three",
     "difficulty": "Easy",
-    "id": 3190,
-    "link": "https://leetcode.com/problems/find-minimum-operations-to-make-all-elements-divisible-by-three/",
-    "title": "Find Minimum Operations to Make All Elements Divisible by Three"
+    "link": "https://leetcode.com/problems/find-minimum-operations-to-make-all-elements-divisible-by-three/"
   },
   "3191": {
+    "id": 3191,
     "category": "Sliding Window",
+    "title": "Minimum Operations to Make Binary Array Elements Equal to One I",
     "difficulty": "Medium",
-    "id": 3191,
-    "link": "https://leetcode.com/problems/minimum-operations-to-make-binary-array-elements-equal-to-one-i/",
-    "title": "Minimum Operations to Make Binary Array Elements Equal to One I"
+    "link": "https://leetcode.com/problems/minimum-operations-to-make-binary-array-elements-equal-to-one-i/"
   },
   "3192": {
+    "id": 3192,
     "category": "Dynamic Programming",
+    "title": "Minimum Operations to Make Binary Array Elements Equal to One II",
     "difficulty": "Medium",
-    "id": 3192,
-    "link": "https://leetcode.com/problems/minimum-operations-to-make-binary-array-elements-equal-to-one-ii/",
-    "title": "Minimum Operations to Make Binary Array Elements Equal to One II"
+    "link": "https://leetcode.com/problems/minimum-operations-to-make-binary-array-elements-equal-to-one-ii/"
   },
   "3193": {
+    "id": 3193,
     "category": "Dynamic Programming",
+    "title": "Count the Number of Inversions",
     "difficulty": "Hard",
-    "id": 3193,
-    "link": "https://leetcode.com/problems/count-the-number-of-inversions/",
-    "title": "Count the Number of Inversions"
+    "link": "https://leetcode.com/problems/count-the-number-of-inversions/"
   },
   "3194": {
+    "id": 3194,
     "category": "Two Pointers",
+    "title": "Minimum Average of Smallest and Largest Elements",
     "difficulty": "Easy",
-    "id": 3194,
-    "link": "https://leetcode.com/problems/minimum-average-of-smallest-and-largest-elements/",
-    "title": "Minimum Average of Smallest and Largest Elements"
+    "link": "https://leetcode.com/problems/minimum-average-of-smallest-and-largest-elements/"
   },
   "3195": {
+    "id": 3195,
     "category": "Array & Hashing",
+    "title": "Find the Minimum Area to Cover All Ones I",
     "difficulty": "Medium",
-    "id": 3195,
-    "link": "https://leetcode.com/problems/find-the-minimum-area-to-cover-all-ones-i/",
-    "title": "Find the Minimum Area to Cover All Ones I"
+    "link": "https://leetcode.com/problems/find-the-minimum-area-to-cover-all-ones-i/"
   },
   "3196": {
+    "id": 3196,
     "category": "Dynamic Programming",
+    "title": "Maximize Total Cost of Alternating Subarrays",
     "difficulty": "Medium",
-    "id": 3196,
-    "link": "https://leetcode.com/problems/maximize-total-cost-of-alternating-subarrays/",
-    "title": "Maximize Total Cost of Alternating Subarrays"
+    "link": "https://leetcode.com/problems/maximize-total-cost-of-alternating-subarrays/"
   },
   "3197": {
+    "id": 3197,
     "category": "Array & Hashing",
+    "title": "Find the Minimum Area to Cover All Ones II",
     "difficulty": "Hard",
-    "id": 3197,
-    "link": "https://leetcode.com/problems/find-the-minimum-area-to-cover-all-ones-ii/",
-    "title": "Find the Minimum Area to Cover All Ones II"
+    "link": "https://leetcode.com/problems/find-the-minimum-area-to-cover-all-ones-ii/"
   },
   "3198": {
+    "id": 3198,
     "category": "Database",
+    "title": "Find Cities in Each State",
     "difficulty": "Easy",
-    "id": 3198,
-    "link": "https://leetcode.com/problems/find-cities-in-each-state/",
-    "title": "Find Cities in Each State"
+    "link": "https://leetcode.com/problems/find-cities-in-each-state/"
   },
   "3199": {
+    "id": 3199,
     "category": "Bit Manipulation",
+    "title": "Count Triplets with Even XOR Set Bits I",
     "difficulty": "Easy",
-    "id": 3199,
-    "link": "https://leetcode.com/problems/count-triplets-with-even-xor-set-bits-i/",
-    "title": "Count Triplets with Even XOR Set Bits I"
+    "link": "https://leetcode.com/problems/count-triplets-with-even-xor-set-bits-i/"
   },
   "3200": {
+    "id": 3200,
     "category": "Array & Hashing",
+    "title": "Maximum Height of a Triangle",
     "difficulty": "Easy",
-    "id": 3200,
-    "link": "https://leetcode.com/problems/maximum-height-of-a-triangle/",
-    "title": "Maximum Height of a Triangle"
+    "link": "https://leetcode.com/problems/maximum-height-of-a-triangle/"
   },
   "3201": {
+    "id": 3201,
     "category": "Dynamic Programming",
+    "title": "Find the Maximum Length of Valid Subsequence I",
     "difficulty": "Medium",
-    "id": 3201,
-    "link": "https://leetcode.com/problems/find-the-maximum-length-of-valid-subsequence-i/",
-    "title": "Find the Maximum Length of Valid Subsequence I"
+    "link": "https://leetcode.com/problems/find-the-maximum-length-of-valid-subsequence-i/"
   },
   "3202": {
+    "id": 3202,
     "category": "Dynamic Programming",
+    "title": "Find the Maximum Length of Valid Subsequence II",
     "difficulty": "Medium",
-    "id": 3202,
-    "link": "https://leetcode.com/problems/find-the-maximum-length-of-valid-subsequence-ii/",
-    "title": "Find the Maximum Length of Valid Subsequence II"
+    "link": "https://leetcode.com/problems/find-the-maximum-length-of-valid-subsequence-ii/"
   },
   "3203": {
+    "id": 3203,
     "category": "Tree",
+    "title": "Find Minimum Diameter After Merging Two Trees",
     "difficulty": "Hard",
-    "id": 3203,
-    "link": "https://leetcode.com/problems/find-minimum-diameter-after-merging-two-trees/",
-    "title": "Find Minimum Diameter After Merging Two Trees"
+    "link": "https://leetcode.com/problems/find-minimum-diameter-after-merging-two-trees/"
   },
   "3204": {
+    "id": 3204,
     "category": "Database",
+    "title": "Bitwise User Permissions Analysis",
     "difficulty": "Medium",
-    "id": 3204,
-    "link": "https://leetcode.com/problems/bitwise-user-permissions-analysis/",
-    "title": "Bitwise User Permissions Analysis"
+    "link": "https://leetcode.com/problems/bitwise-user-permissions-analysis/"
   },
   "3205": {
+    "id": 3205,
     "category": "Dynamic Programming",
+    "title": "Maximum Array Hopping Score I",
     "difficulty": "Medium",
-    "id": 3205,
-    "link": "https://leetcode.com/problems/maximum-array-hopping-score-i/",
-    "title": "Maximum Array Hopping Score I"
+    "link": "https://leetcode.com/problems/maximum-array-hopping-score-i/"
   },
   "3206": {
+    "id": 3206,
     "category": "Sliding Window",
+    "title": "Alternating Groups I",
     "difficulty": "Easy",
-    "id": 3206,
-    "link": "https://leetcode.com/problems/alternating-groups-i/",
-    "title": "Alternating Groups I"
+    "link": "https://leetcode.com/problems/alternating-groups-i/"
   },
   "3207": {
+    "id": 3207,
     "category": "Greedy",
+    "title": "Maximum Points After Enemy Battles",
     "difficulty": "Medium",
-    "id": 3207,
-    "link": "https://leetcode.com/problems/maximum-points-after-enemy-battles/",
-    "title": "Maximum Points After Enemy Battles"
+    "link": "https://leetcode.com/problems/maximum-points-after-enemy-battles/"
   },
   "3208": {
+    "id": 3208,
     "category": "Sliding Window",
+    "title": "Alternating Groups II",
     "difficulty": "Medium",
-    "id": 3208,
-    "link": "https://leetcode.com/problems/alternating-groups-ii/",
-    "title": "Alternating Groups II"
+    "link": "https://leetcode.com/problems/alternating-groups-ii/"
   },
   "3209": {
+    "id": 3209,
     "category": "Tree",
+    "title": "Number of Subarrays With AND Value of K",
     "difficulty": "Hard",
-    "id": 3209,
-    "link": "https://leetcode.com/problems/number-of-subarrays-with-and-value-of-k/",
-    "title": "Number of Subarrays With AND Value of K"
+    "link": "https://leetcode.com/problems/number-of-subarrays-with-and-value-of-k/"
   },
   "3210": {
+    "id": 3210,
     "category": "Array & Hashing",
+    "title": "Find the Encrypted String",
     "difficulty": "Easy",
-    "id": 3210,
-    "link": "https://leetcode.com/problems/find-the-encrypted-string/",
-    "title": "Find the Encrypted String"
+    "link": "https://leetcode.com/problems/find-the-encrypted-string/"
   },
   "3211": {
+    "id": 3211,
     "category": "Backtracking",
+    "title": "Generate Binary Strings Without Adjacent Zeros",
     "difficulty": "Medium",
-    "id": 3211,
-    "link": "https://leetcode.com/problems/generate-binary-strings-without-adjacent-zeros/",
-    "title": "Generate Binary Strings Without Adjacent Zeros"
+    "link": "https://leetcode.com/problems/generate-binary-strings-without-adjacent-zeros/"
   },
   "3212": {
+    "id": 3212,
     "category": "Array & Hashing",
+    "title": "Count Submatrices With Equal Frequency of X and Y",
     "difficulty": "Medium",
-    "id": 3212,
-    "link": "https://leetcode.com/problems/count-submatrices-with-equal-frequency-of-x-and-y/",
-    "title": "Count Submatrices With Equal Frequency of X and Y"
+    "link": "https://leetcode.com/problems/count-submatrices-with-equal-frequency-of-x-and-y/"
   },
   "3213": {
+    "id": 3213,
     "category": "Dynamic Programming",
+    "title": "Construct String with Minimum Cost",
     "difficulty": "Hard",
-    "id": 3213,
-    "link": "https://leetcode.com/problems/construct-string-with-minimum-cost/",
-    "title": "Construct String with Minimum Cost"
+    "link": "https://leetcode.com/problems/construct-string-with-minimum-cost/"
   },
   "3214": {
+    "id": 3214,
     "category": "Database",
+    "title": "Year on Year Growth Rate",
     "difficulty": "Hard",
-    "id": 3214,
-    "link": "https://leetcode.com/problems/year-on-year-growth-rate/",
-    "title": "Year on Year Growth Rate"
+    "link": "https://leetcode.com/problems/year-on-year-growth-rate/"
   },
   "3215": {
+    "id": 3215,
     "category": "Bit Manipulation",
+    "title": "Count Triplets with Even XOR Set Bits II",
     "difficulty": "Medium",
-    "id": 3215,
-    "link": "https://leetcode.com/problems/count-triplets-with-even-xor-set-bits-ii/",
-    "title": "Count Triplets with Even XOR Set Bits II"
+    "link": "https://leetcode.com/problems/count-triplets-with-even-xor-set-bits-ii/"
   },
   "3216": {
+    "id": 3216,
     "category": "Greedy",
+    "title": "Lexicographically Smallest String After a Swap",
     "difficulty": "Easy",
-    "id": 3216,
-    "link": "https://leetcode.com/problems/lexicographically-smallest-string-after-a-swap/",
-    "title": "Lexicographically Smallest String After a Swap"
+    "link": "https://leetcode.com/problems/lexicographically-smallest-string-after-a-swap/"
   },
   "3217": {
+    "id": 3217,
     "category": "Linked List",
+    "title": "Delete Nodes From Linked List Present in Array",
     "difficulty": "Medium",
-    "id": 3217,
-    "link": "https://leetcode.com/problems/delete-nodes-from-linked-list-present-in-array/",
-    "title": "Delete Nodes From Linked List Present in Array"
+    "link": "https://leetcode.com/problems/delete-nodes-from-linked-list-present-in-array/"
   },
   "3218": {
+    "id": 3218,
     "category": "Dynamic Programming",
+    "title": "Minimum Cost for Cutting Cake I",
     "difficulty": "Medium",
-    "id": 3218,
-    "link": "https://leetcode.com/problems/minimum-cost-for-cutting-cake-i/",
-    "title": "Minimum Cost for Cutting Cake I"
+    "link": "https://leetcode.com/problems/minimum-cost-for-cutting-cake-i/"
   },
   "3219": {
+    "id": 3219,
     "category": "Greedy",
+    "title": "Minimum Cost for Cutting Cake II",
     "difficulty": "Hard",
-    "id": 3219,
-    "link": "https://leetcode.com/problems/minimum-cost-for-cutting-cake-ii/",
-    "title": "Minimum Cost for Cutting Cake II"
+    "link": "https://leetcode.com/problems/minimum-cost-for-cutting-cake-ii/"
   },
   "3220": {
+    "id": 3220,
     "category": "Database",
+    "title": "Odd and Even Transactions",
     "difficulty": "Medium",
-    "id": 3220,
-    "link": "https://leetcode.com/problems/odd-and-even-transactions/",
-    "title": "Odd and Even Transactions"
+    "link": "https://leetcode.com/problems/odd-and-even-transactions/"
   },
   "3221": {
+    "id": 3221,
     "category": "Stack",
+    "title": "Maximum Array Hopping Score II",
     "difficulty": "Medium",
-    "id": 3221,
-    "link": "https://leetcode.com/problems/maximum-array-hopping-score-ii/",
-    "title": "Maximum Array Hopping Score II"
+    "link": "https://leetcode.com/problems/maximum-array-hopping-score-ii/"
   },
   "3222": {
+    "id": 3222,
     "category": "Math & Geometry",
+    "title": "Find the Winning Player in Coin Game",
     "difficulty": "Easy",
-    "id": 3222,
-    "link": "https://leetcode.com/problems/find-the-winning-player-in-coin-game/",
-    "title": "Find the Winning Player in Coin Game"
+    "link": "https://leetcode.com/problems/find-the-winning-player-in-coin-game/"
   },
   "3223": {
+    "id": 3223,
     "category": "Array & Hashing",
+    "title": "Minimum Length of String After Operations",
     "difficulty": "Medium",
-    "id": 3223,
-    "link": "https://leetcode.com/problems/minimum-length-of-string-after-operations/",
-    "title": "Minimum Length of String After Operations"
+    "link": "https://leetcode.com/problems/minimum-length-of-string-after-operations/"
   },
   "3224": {
+    "id": 3224,
     "category": "Array & Hashing",
+    "title": "Minimum Array Changes to Make Differences Equal",
     "difficulty": "Medium",
-    "id": 3224,
-    "link": "https://leetcode.com/problems/minimum-array-changes-to-make-differences-equal/",
-    "title": "Minimum Array Changes to Make Differences Equal"
+    "link": "https://leetcode.com/problems/minimum-array-changes-to-make-differences-equal/"
   },
   "3225": {
+    "id": 3225,
     "category": "Dynamic Programming",
+    "title": "Maximum Score From Grid Operations",
     "difficulty": "Hard",
-    "id": 3225,
-    "link": "https://leetcode.com/problems/maximum-score-from-grid-operations/",
-    "title": "Maximum Score From Grid Operations"
+    "link": "https://leetcode.com/problems/maximum-score-from-grid-operations/"
   },
   "3226": {
+    "id": 3226,
     "category": "Bit Manipulation",
+    "title": "Number of Bit Changes to Make Two Integers Equal",
     "difficulty": "Easy",
-    "id": 3226,
-    "link": "https://leetcode.com/problems/number-of-bit-changes-to-make-two-integers-equal/",
-    "title": "Number of Bit Changes to Make Two Integers Equal"
+    "link": "https://leetcode.com/problems/number-of-bit-changes-to-make-two-integers-equal/"
   },
   "3227": {
+    "id": 3227,
     "category": "Math & Geometry",
+    "title": "Vowels Game in a String",
     "difficulty": "Medium",
-    "id": 3227,
-    "link": "https://leetcode.com/problems/vowels-game-in-a-string/",
-    "title": "Vowels Game in a String"
+    "link": "https://leetcode.com/problems/vowels-game-in-a-string/"
   },
   "3228": {
+    "id": 3228,
     "category": "Greedy",
+    "title": "Maximum Number of Operations to Move Ones to the End",
     "difficulty": "Medium",
-    "id": 3228,
-    "link": "https://leetcode.com/problems/maximum-number-of-operations-to-move-ones-to-the-end/",
-    "title": "Maximum Number of Operations to Move Ones to the End"
+    "link": "https://leetcode.com/problems/maximum-number-of-operations-to-move-ones-to-the-end/"
   },
   "3229": {
+    "id": 3229,
     "category": "Dynamic Programming",
+    "title": "Minimum Operations to Make Array Equal to Target",
     "difficulty": "Hard",
-    "id": 3229,
-    "link": "https://leetcode.com/problems/minimum-operations-to-make-array-equal-to-target/",
-    "title": "Minimum Operations to Make Array Equal to Target"
+    "link": "https://leetcode.com/problems/minimum-operations-to-make-array-equal-to-target/"
   },
   "3230": {
+    "id": 3230,
     "category": "Database",
+    "title": "Customer Purchasing Behavior Analysis",
     "difficulty": "Medium",
-    "id": 3230,
-    "link": "https://leetcode.com/problems/customer-purchasing-behavior-analysis/",
-    "title": "Customer Purchasing Behavior Analysis"
+    "link": "https://leetcode.com/problems/customer-purchasing-behavior-analysis/"
   },
   "3231": {
+    "id": 3231,
     "category": "Binary Search",
+    "title": "Minimum Number of Increasing Subsequence to Be Removed",
     "difficulty": "Hard",
-    "id": 3231,
-    "link": "https://leetcode.com/problems/minimum-number-of-increasing-subsequence-to-be-removed/",
-    "title": "Minimum Number of Increasing Subsequence to Be Removed"
+    "link": "https://leetcode.com/problems/minimum-number-of-increasing-subsequence-to-be-removed/"
   },
   "3232": {
+    "id": 3232,
     "category": "Math & Geometry",
+    "title": "Find if Digit Game Can Be Won",
     "difficulty": "Easy",
-    "id": 3232,
-    "link": "https://leetcode.com/problems/find-if-digit-game-can-be-won/",
-    "title": "Find if Digit Game Can Be Won"
+    "link": "https://leetcode.com/problems/find-if-digit-game-can-be-won/"
   },
   "3233": {
+    "id": 3233,
     "category": "Math & Geometry",
+    "title": "Find the Count of Numbers Which Are Not Special",
     "difficulty": "Medium",
-    "id": 3233,
-    "link": "https://leetcode.com/problems/find-the-count-of-numbers-which-are-not-special/",
-    "title": "Find the Count of Numbers Which Are Not Special"
+    "link": "https://leetcode.com/problems/find-the-count-of-numbers-which-are-not-special/"
   },
   "3234": {
+    "id": 3234,
     "category": "Array & Hashing",
+    "title": "Count the Number of Substrings With Dominant Ones",
     "difficulty": "Medium",
-    "id": 3234,
-    "link": "https://leetcode.com/problems/count-the-number-of-substrings-with-dominant-ones/",
-    "title": "Count the Number of Substrings With Dominant Ones"
+    "link": "https://leetcode.com/problems/count-the-number-of-substrings-with-dominant-ones/"
   },
   "3235": {
+    "id": 3235,
     "category": "Graph Traversal",
+    "title": "Check if the Rectangle Corner Is Reachable",
     "difficulty": "Hard",
-    "id": 3235,
-    "link": "https://leetcode.com/problems/check-if-the-rectangle-corner-is-reachable/",
-    "title": "Check if the Rectangle Corner Is Reachable"
+    "link": "https://leetcode.com/problems/check-if-the-rectangle-corner-is-reachable/"
   },
   "3236": {
+    "id": 3236,
     "category": "Database",
+    "title": "CEO Subordinate Hierarchy",
     "difficulty": "Hard",
-    "id": 3236,
-    "link": "https://leetcode.com/problems/ceo-subordinate-hierarchy/",
-    "title": "CEO Subordinate Hierarchy"
+    "link": "https://leetcode.com/problems/ceo-subordinate-hierarchy/"
   },
   "3237": {
+    "id": 3237,
     "category": "Array & Hashing",
+    "title": "Alt and Tab Simulation",
     "difficulty": "Medium",
-    "id": 3237,
-    "link": "https://leetcode.com/problems/alt-and-tab-simulation/",
-    "title": "Alt and Tab Simulation"
+    "link": "https://leetcode.com/problems/alt-and-tab-simulation/"
   },
   "3238": {
+    "id": 3238,
     "category": "Array & Hashing",
+    "title": "Find the Number of Winning Players",
     "difficulty": "Easy",
-    "id": 3238,
-    "link": "https://leetcode.com/problems/find-the-number-of-winning-players/",
-    "title": "Find the Number of Winning Players"
+    "link": "https://leetcode.com/problems/find-the-number-of-winning-players/"
   },
   "3239": {
+    "id": 3239,
     "category": "Two Pointers",
+    "title": "Minimum Number of Flips to Make Binary Grid Palindromic I",
     "difficulty": "Medium",
-    "id": 3239,
-    "link": "https://leetcode.com/problems/minimum-number-of-flips-to-make-binary-grid-palindromic-i/",
-    "title": "Minimum Number of Flips to Make Binary Grid Palindromic I"
+    "link": "https://leetcode.com/problems/minimum-number-of-flips-to-make-binary-grid-palindromic-i/"
   },
   "3240": {
+    "id": 3240,
     "category": "Two Pointers",
+    "title": "Minimum Number of Flips to Make Binary Grid Palindromic II",
     "difficulty": "Medium",
-    "id": 3240,
-    "link": "https://leetcode.com/problems/minimum-number-of-flips-to-make-binary-grid-palindromic-ii/",
-    "title": "Minimum Number of Flips to Make Binary Grid Palindromic II"
+    "link": "https://leetcode.com/problems/minimum-number-of-flips-to-make-binary-grid-palindromic-ii/"
   },
   "3241": {
+    "id": 3241,
     "category": "Tree",
+    "title": "Time Taken to Mark All Nodes",
     "difficulty": "Hard",
-    "id": 3241,
-    "link": "https://leetcode.com/problems/time-taken-to-mark-all-nodes/",
-    "title": "Time Taken to Mark All Nodes"
+    "link": "https://leetcode.com/problems/time-taken-to-mark-all-nodes/"
   },
   "3242": {
+    "id": 3242,
     "category": "Array & Hashing",
+    "title": "Design Neighbor Sum Service",
     "difficulty": "Easy",
-    "id": 3242,
-    "link": "https://leetcode.com/problems/design-neighbor-sum-service/",
-    "title": "Design Neighbor Sum Service"
+    "link": "https://leetcode.com/problems/design-neighbor-sum-service/"
   },
   "3243": {
+    "id": 3243,
     "category": "Graph Traversal",
+    "title": "Shortest Distance After Road Addition Queries I",
     "difficulty": "Medium",
-    "id": 3243,
-    "link": "https://leetcode.com/problems/shortest-distance-after-road-addition-queries-i/",
-    "title": "Shortest Distance After Road Addition Queries I"
+    "link": "https://leetcode.com/problems/shortest-distance-after-road-addition-queries-i/"
   },
   "3244": {
+    "id": 3244,
     "category": "Graph Traversal",
+    "title": "Shortest Distance After Road Addition Queries II",
     "difficulty": "Hard",
-    "id": 3244,
-    "link": "https://leetcode.com/problems/shortest-distance-after-road-addition-queries-ii/",
-    "title": "Shortest Distance After Road Addition Queries II"
+    "link": "https://leetcode.com/problems/shortest-distance-after-road-addition-queries-ii/"
   },
   "3245": {
+    "id": 3245,
     "category": "Tree",
+    "title": "Alternating Groups III",
     "difficulty": "Hard",
-    "id": 3245,
-    "link": "https://leetcode.com/problems/alternating-groups-iii/",
-    "title": "Alternating Groups III"
+    "link": "https://leetcode.com/problems/alternating-groups-iii/"
   },
   "3246": {
+    "id": 3246,
     "category": "Database",
+    "title": "Premier League Table Ranking",
     "difficulty": "Easy",
-    "id": 3246,
-    "link": "https://leetcode.com/problems/premier-league-table-ranking/",
-    "title": "Premier League Table Ranking"
+    "link": "https://leetcode.com/problems/premier-league-table-ranking/"
   },
   "3247": {
+    "id": 3247,
     "category": "Dynamic Programming",
+    "title": "Number of Subsequences with Odd Sum",
     "difficulty": "Medium",
-    "id": 3247,
-    "link": "https://leetcode.com/problems/number-of-subsequences-with-odd-sum/",
-    "title": "Number of Subsequences with Odd Sum"
+    "link": "https://leetcode.com/problems/number-of-subsequences-with-odd-sum/"
   },
   "3248": {
+    "id": 3248,
     "category": "Array & Hashing",
+    "title": "Snake in Matrix",
     "difficulty": "Easy",
-    "id": 3248,
-    "link": "https://leetcode.com/problems/snake-in-matrix/",
-    "title": "Snake in Matrix"
+    "link": "https://leetcode.com/problems/snake-in-matrix/"
   },
   "3249": {
+    "id": 3249,
     "category": "Tree",
+    "title": "Count the Number of Good Nodes",
     "difficulty": "Medium",
-    "id": 3249,
-    "link": "https://leetcode.com/problems/count-the-number-of-good-nodes/",
-    "title": "Count the Number of Good Nodes"
+    "link": "https://leetcode.com/problems/count-the-number-of-good-nodes/"
   },
   "3250": {
+    "id": 3250,
     "category": "Dynamic Programming",
+    "title": "Find the Count of Monotonic Pairs I",
     "difficulty": "Hard",
-    "id": 3250,
-    "link": "https://leetcode.com/problems/find-the-count-of-monotonic-pairs-i/",
-    "title": "Find the Count of Monotonic Pairs I"
+    "link": "https://leetcode.com/problems/find-the-count-of-monotonic-pairs-i/"
   },
   "3251": {
+    "id": 3251,
     "category": "Dynamic Programming",
+    "title": "Find the Count of Monotonic Pairs II",
     "difficulty": "Hard",
-    "id": 3251,
-    "link": "https://leetcode.com/problems/find-the-count-of-monotonic-pairs-ii/",
-    "title": "Find the Count of Monotonic Pairs II"
+    "link": "https://leetcode.com/problems/find-the-count-of-monotonic-pairs-ii/"
   },
   "3252": {
+    "id": 3252,
     "category": "Database",
+    "title": "Premier League Table Ranking II",
     "difficulty": "Medium",
-    "id": 3252,
-    "link": "https://leetcode.com/problems/premier-league-table-ranking-ii/",
-    "title": "Premier League Table Ranking II"
+    "link": "https://leetcode.com/problems/premier-league-table-ranking-ii/"
   },
   "3253": {
+    "id": 3253,
     "category": "Array & Hashing",
+    "title": "Construct String with Minimum Cost (Easy)",
     "difficulty": "Medium",
-    "id": 3253,
-    "link": "https://leetcode.com/problems/construct-string-with-minimum-cost-easy/",
-    "title": "Construct String with Minimum Cost (Easy)"
+    "link": "https://leetcode.com/problems/construct-string-with-minimum-cost-easy/"
   },
   "3254": {
+    "id": 3254,
     "category": "Sliding Window",
+    "title": "Find the Power of K-Size Subarrays I",
     "difficulty": "Medium",
-    "id": 3254,
-    "link": "https://leetcode.com/problems/find-the-power-of-k-size-subarrays-i/",
-    "title": "Find the Power of K-Size Subarrays I"
+    "link": "https://leetcode.com/problems/find-the-power-of-k-size-subarrays-i/"
   },
   "3255": {
+    "id": 3255,
     "category": "Sliding Window",
+    "title": "Find the Power of K-Size Subarrays II",
     "difficulty": "Medium",
-    "id": 3255,
-    "link": "https://leetcode.com/problems/find-the-power-of-k-size-subarrays-ii/",
-    "title": "Find the Power of K-Size Subarrays II"
+    "link": "https://leetcode.com/problems/find-the-power-of-k-size-subarrays-ii/"
   },
   "3256": {
+    "id": 3256,
     "category": "Dynamic Programming",
+    "title": "Maximum Value Sum by Placing Three Rooks I",
     "difficulty": "Hard",
-    "id": 3256,
-    "link": "https://leetcode.com/problems/maximum-value-sum-by-placing-three-rooks-i/",
-    "title": "Maximum Value Sum by Placing Three Rooks I"
+    "link": "https://leetcode.com/problems/maximum-value-sum-by-placing-three-rooks-i/"
   },
   "3257": {
+    "id": 3257,
     "category": "Dynamic Programming",
+    "title": "Maximum Value Sum by Placing Three Rooks II",
     "difficulty": "Hard",
-    "id": 3257,
-    "link": "https://leetcode.com/problems/maximum-value-sum-by-placing-three-rooks-ii/",
-    "title": "Maximum Value Sum by Placing Three Rooks II"
+    "link": "https://leetcode.com/problems/maximum-value-sum-by-placing-three-rooks-ii/"
   },
   "3258": {
+    "id": 3258,
     "category": "Sliding Window",
+    "title": "Count Substrings That Satisfy K-Constraint I",
     "difficulty": "Easy",
-    "id": 3258,
-    "link": "https://leetcode.com/problems/count-substrings-that-satisfy-k-constraint-i/",
-    "title": "Count Substrings That Satisfy K-Constraint I"
+    "link": "https://leetcode.com/problems/count-substrings-that-satisfy-k-constraint-i/"
   },
   "3259": {
+    "id": 3259,
     "category": "Dynamic Programming",
+    "title": "Maximum Energy Boost From Two Drinks",
     "difficulty": "Medium",
-    "id": 3259,
-    "link": "https://leetcode.com/problems/maximum-energy-boost-from-two-drinks/",
-    "title": "Maximum Energy Boost From Two Drinks"
+    "link": "https://leetcode.com/problems/maximum-energy-boost-from-two-drinks/"
   },
   "3260": {
+    "id": 3260,
     "category": "Dynamic Programming",
+    "title": "Find the Largest Palindrome Divisible by K",
     "difficulty": "Hard",
-    "id": 3260,
-    "link": "https://leetcode.com/problems/find-the-largest-palindrome-divisible-by-k/",
-    "title": "Find the Largest Palindrome Divisible by K"
+    "link": "https://leetcode.com/problems/find-the-largest-palindrome-divisible-by-k/"
   },
   "3261": {
+    "id": 3261,
     "category": "Sliding Window",
+    "title": "Count Substrings That Satisfy K-Constraint II",
     "difficulty": "Hard",
-    "id": 3261,
-    "link": "https://leetcode.com/problems/count-substrings-that-satisfy-k-constraint-ii/",
-    "title": "Count Substrings That Satisfy K-Constraint II"
+    "link": "https://leetcode.com/problems/count-substrings-that-satisfy-k-constraint-ii/"
   },
   "3262": {
+    "id": 3262,
     "category": "Database",
+    "title": "Find Overlapping Shifts",
     "difficulty": "Medium",
-    "id": 3262,
-    "link": "https://leetcode.com/problems/find-overlapping-shifts/",
-    "title": "Find Overlapping Shifts"
+    "link": "https://leetcode.com/problems/find-overlapping-shifts/"
   },
   "3263": {
+    "id": 3263,
     "category": "Linked List",
+    "title": "Convert Doubly Linked List to Array I",
     "difficulty": "Easy",
-    "id": 3263,
-    "link": "https://leetcode.com/problems/convert-doubly-linked-list-to-array-i/",
-    "title": "Convert Doubly Linked List to Array I"
+    "link": "https://leetcode.com/problems/convert-doubly-linked-list-to-array-i/"
   },
   "3264": {
+    "id": 3264,
     "category": "Heap (Priority Queue)",
+    "title": "Final Array State After K Multiplication Operations I",
     "difficulty": "Easy",
-    "id": 3264,
-    "link": "https://leetcode.com/problems/final-array-state-after-k-multiplication-operations-i/",
-    "title": "Final Array State After K Multiplication Operations I"
+    "link": "https://leetcode.com/problems/final-array-state-after-k-multiplication-operations-i/"
   },
   "3265": {
+    "id": 3265,
     "category": "Array & Hashing",
+    "title": "Count Almost Equal Pairs I",
     "difficulty": "Medium",
-    "id": 3265,
-    "link": "https://leetcode.com/problems/count-almost-equal-pairs-i/",
-    "title": "Count Almost Equal Pairs I"
+    "link": "https://leetcode.com/problems/count-almost-equal-pairs-i/"
   },
   "3266": {
+    "id": 3266,
     "category": "Heap (Priority Queue)",
+    "title": "Final Array State After K Multiplication Operations II",
     "difficulty": "Hard",
-    "id": 3266,
-    "link": "https://leetcode.com/problems/final-array-state-after-k-multiplication-operations-ii/",
-    "title": "Final Array State After K Multiplication Operations II"
+    "link": "https://leetcode.com/problems/final-array-state-after-k-multiplication-operations-ii/"
   },
   "3267": {
+    "id": 3267,
     "category": "Array & Hashing",
+    "title": "Count Almost Equal Pairs II",
     "difficulty": "Hard",
-    "id": 3267,
-    "link": "https://leetcode.com/problems/count-almost-equal-pairs-ii/",
-    "title": "Count Almost Equal Pairs II"
+    "link": "https://leetcode.com/problems/count-almost-equal-pairs-ii/"
   },
   "3268": {
+    "id": 3268,
     "category": "Database",
+    "title": "Find Overlapping Shifts II",
     "difficulty": "Hard",
-    "id": 3268,
-    "link": "https://leetcode.com/problems/find-overlapping-shifts-ii/",
-    "title": "Find Overlapping Shifts II"
+    "link": "https://leetcode.com/problems/find-overlapping-shifts-ii/"
   },
   "3269": {
+    "id": 3269,
     "category": "Dynamic Programming",
+    "title": "Constructing Two Increasing Arrays",
     "difficulty": "Hard",
-    "id": 3269,
-    "link": "https://leetcode.com/problems/constructing-two-increasing-arrays/",
-    "title": "Constructing Two Increasing Arrays"
+    "link": "https://leetcode.com/problems/constructing-two-increasing-arrays/"
   },
   "3270": {
+    "id": 3270,
     "category": "Math & Geometry",
+    "title": "Find the Key of the Numbers",
     "difficulty": "Easy",
-    "id": 3270,
-    "link": "https://leetcode.com/problems/find-the-key-of-the-numbers/",
-    "title": "Find the Key of the Numbers"
+    "link": "https://leetcode.com/problems/find-the-key-of-the-numbers/"
   },
   "3271": {
+    "id": 3271,
     "category": "Array & Hashing",
+    "title": "Hash Divided String",
     "difficulty": "Medium",
-    "id": 3271,
-    "link": "https://leetcode.com/problems/hash-divided-string/",
-    "title": "Hash Divided String"
+    "link": "https://leetcode.com/problems/hash-divided-string/"
   },
   "3272": {
+    "id": 3272,
     "category": "Math & Geometry",
+    "title": "Find the Count of Good Integers",
     "difficulty": "Hard",
-    "id": 3272,
-    "link": "https://leetcode.com/problems/find-the-count-of-good-integers/",
-    "title": "Find the Count of Good Integers"
+    "link": "https://leetcode.com/problems/find-the-count-of-good-integers/"
   },
   "3273": {
+    "id": 3273,
     "category": "Greedy",
+    "title": "Minimum Amount of Damage Dealt to Bob",
     "difficulty": "Hard",
-    "id": 3273,
-    "link": "https://leetcode.com/problems/minimum-amount-of-damage-dealt-to-bob/",
-    "title": "Minimum Amount of Damage Dealt to Bob"
+    "link": "https://leetcode.com/problems/minimum-amount-of-damage-dealt-to-bob/"
   },
   "3274": {
+    "id": 3274,
     "category": "Math & Geometry",
+    "title": "Check if Two Chessboard Squares Have the Same Color",
     "difficulty": "Easy",
-    "id": 3274,
-    "link": "https://leetcode.com/problems/check-if-two-chessboard-squares-have-the-same-color/",
-    "title": "Check if Two Chessboard Squares Have the Same Color"
+    "link": "https://leetcode.com/problems/check-if-two-chessboard-squares-have-the-same-color/"
   },
   "3275": {
+    "id": 3275,
     "category": "Heap (Priority Queue)",
+    "title": "K-th Nearest Obstacle Queries",
     "difficulty": "Medium",
-    "id": 3275,
-    "link": "https://leetcode.com/problems/k-th-nearest-obstacle-queries/",
-    "title": "K-th Nearest Obstacle Queries"
+    "link": "https://leetcode.com/problems/k-th-nearest-obstacle-queries/"
   },
   "3276": {
+    "id": 3276,
     "category": "Dynamic Programming",
+    "title": "Select Cells in Grid With Maximum Score",
     "difficulty": "Hard",
-    "id": 3276,
-    "link": "https://leetcode.com/problems/select-cells-in-grid-with-maximum-score/",
-    "title": "Select Cells in Grid With Maximum Score"
+    "link": "https://leetcode.com/problems/select-cells-in-grid-with-maximum-score/"
   },
   "3277": {
+    "id": 3277,
     "category": "Dynamic Programming",
+    "title": "Maximum XOR Score Subarray Queries",
     "difficulty": "Hard",
-    "id": 3277,
-    "link": "https://leetcode.com/problems/maximum-xor-score-subarray-queries/",
-    "title": "Maximum XOR Score Subarray Queries"
+    "link": "https://leetcode.com/problems/maximum-xor-score-subarray-queries/"
   },
   "3278": {
+    "id": 3278,
     "category": "Database",
+    "title": "Find Candidates for Data Scientist Position II",
     "difficulty": "Medium",
-    "id": 3278,
-    "link": "https://leetcode.com/problems/find-candidates-for-data-scientist-position-ii/",
-    "title": "Find Candidates for Data Scientist Position II"
+    "link": "https://leetcode.com/problems/find-candidates-for-data-scientist-position-ii/"
   },
   "3279": {
+    "id": 3279,
     "category": "Array & Hashing",
+    "title": "Maximum Total Area Occupied by Pistons",
     "difficulty": "Hard",
-    "id": 3279,
-    "link": "https://leetcode.com/problems/maximum-total-area-occupied-by-pistons/",
-    "title": "Maximum Total Area Occupied by Pistons"
+    "link": "https://leetcode.com/problems/maximum-total-area-occupied-by-pistons/"
   },
   "3280": {
+    "id": 3280,
     "category": "Math & Geometry",
+    "title": "Convert Date to Binary",
     "difficulty": "Easy",
-    "id": 3280,
-    "link": "https://leetcode.com/problems/convert-date-to-binary/",
-    "title": "Convert Date to Binary"
+    "link": "https://leetcode.com/problems/convert-date-to-binary/"
   },
   "3281": {
+    "id": 3281,
     "category": "Binary Search",
+    "title": "Maximize Score of Numbers in Ranges",
     "difficulty": "Medium",
-    "id": 3281,
-    "link": "https://leetcode.com/problems/maximize-score-of-numbers-in-ranges/",
-    "title": "Maximize Score of Numbers in Ranges"
+    "link": "https://leetcode.com/problems/maximize-score-of-numbers-in-ranges/"
   },
   "3282": {
+    "id": 3282,
     "category": "Greedy",
+    "title": "Reach End of Array With Max Score",
     "difficulty": "Medium",
-    "id": 3282,
-    "link": "https://leetcode.com/problems/reach-end-of-array-with-max-score/",
-    "title": "Reach End of Array With Max Score"
+    "link": "https://leetcode.com/problems/reach-end-of-array-with-max-score/"
   },
   "3283": {
+    "id": 3283,
     "category": "Graph Traversal",
+    "title": "Maximum Number of Moves to Kill All Pawns",
     "difficulty": "Hard",
-    "id": 3283,
-    "link": "https://leetcode.com/problems/maximum-number-of-moves-to-kill-all-pawns/",
-    "title": "Maximum Number of Moves to Kill All Pawns"
+    "link": "https://leetcode.com/problems/maximum-number-of-moves-to-kill-all-pawns/"
   },
   "3284": {
+    "id": 3284,
     "category": "Dynamic Programming",
+    "title": "Sum of Consecutive Subarrays",
     "difficulty": "Medium",
-    "id": 3284,
-    "link": "https://leetcode.com/problems/sum-of-consecutive-subarrays/",
-    "title": "Sum of Consecutive Subarrays"
+    "link": "https://leetcode.com/problems/sum-of-consecutive-subarrays/"
   },
   "3285": {
+    "id": 3285,
     "category": "Array & Hashing",
+    "title": "Find Indices of Stable Mountains",
     "difficulty": "Easy",
-    "id": 3285,
-    "link": "https://leetcode.com/problems/find-indices-of-stable-mountains/",
-    "title": "Find Indices of Stable Mountains"
+    "link": "https://leetcode.com/problems/find-indices-of-stable-mountains/"
   },
   "3286": {
+    "id": 3286,
     "category": "Graph Traversal",
+    "title": "Find a Safe Walk Through a Grid",
     "difficulty": "Medium",
-    "id": 3286,
-    "link": "https://leetcode.com/problems/find-a-safe-walk-through-a-grid/",
-    "title": "Find a Safe Walk Through a Grid"
+    "link": "https://leetcode.com/problems/find-a-safe-walk-through-a-grid/"
   },
   "3287": {
+    "id": 3287,
     "category": "Dynamic Programming",
+    "title": "Find the Maximum Sequence Value of Array",
     "difficulty": "Hard",
-    "id": 3287,
-    "link": "https://leetcode.com/problems/find-the-maximum-sequence-value-of-array/",
-    "title": "Find the Maximum Sequence Value of Array"
+    "link": "https://leetcode.com/problems/find-the-maximum-sequence-value-of-array/"
   },
   "3288": {
+    "id": 3288,
     "category": "Binary Search",
+    "title": "Length of the Longest Increasing Path",
     "difficulty": "Hard",
-    "id": 3288,
-    "link": "https://leetcode.com/problems/length-of-the-longest-increasing-path/",
-    "title": "Length of the Longest Increasing Path"
+    "link": "https://leetcode.com/problems/length-of-the-longest-increasing-path/"
   },
   "3289": {
+    "id": 3289,
     "category": "Math & Geometry",
+    "title": "The Two Sneaky Numbers of Digitville",
     "difficulty": "Easy",
-    "id": 3289,
-    "link": "https://leetcode.com/problems/the-two-sneaky-numbers-of-digitville/",
-    "title": "The Two Sneaky Numbers of Digitville"
+    "link": "https://leetcode.com/problems/the-two-sneaky-numbers-of-digitville/"
   },
   "3290": {
+    "id": 3290,
     "category": "Dynamic Programming",
+    "title": "Maximum Multiplication Score",
     "difficulty": "Medium",
-    "id": 3290,
-    "link": "https://leetcode.com/problems/maximum-multiplication-score/",
-    "title": "Maximum Multiplication Score"
+    "link": "https://leetcode.com/problems/maximum-multiplication-score/"
   },
   "3291": {
+    "id": 3291,
     "category": "Tree",
+    "title": "Minimum Number of Valid Strings to Form Target I",
     "difficulty": "Medium",
-    "id": 3291,
-    "link": "https://leetcode.com/problems/minimum-number-of-valid-strings-to-form-target-i/",
-    "title": "Minimum Number of Valid Strings to Form Target I"
+    "link": "https://leetcode.com/problems/minimum-number-of-valid-strings-to-form-target-i/"
   },
   "3292": {
+    "id": 3292,
     "category": "Tree",
+    "title": "Minimum Number of Valid Strings to Form Target II",
     "difficulty": "Hard",
-    "id": 3292,
-    "link": "https://leetcode.com/problems/minimum-number-of-valid-strings-to-form-target-ii/",
-    "title": "Minimum Number of Valid Strings to Form Target II"
+    "link": "https://leetcode.com/problems/minimum-number-of-valid-strings-to-form-target-ii/"
   },
   "3293": {
+    "id": 3293,
     "category": "Database",
+    "title": "Calculate Product Final Price",
     "difficulty": "Medium",
-    "id": 3293,
-    "link": "https://leetcode.com/problems/calculate-product-final-price/",
-    "title": "Calculate Product Final Price"
+    "link": "https://leetcode.com/problems/calculate-product-final-price/"
   },
   "3294": {
+    "id": 3294,
     "category": "Linked List",
+    "title": "Convert Doubly Linked List to Array II",
     "difficulty": "Medium",
-    "id": 3294,
-    "link": "https://leetcode.com/problems/convert-doubly-linked-list-to-array-ii/",
-    "title": "Convert Doubly Linked List to Array II"
+    "link": "https://leetcode.com/problems/convert-doubly-linked-list-to-array-ii/"
   },
   "3295": {
+    "id": 3295,
     "category": "Array & Hashing",
+    "title": "Report Spam Message",
     "difficulty": "Medium",
-    "id": 3295,
-    "link": "https://leetcode.com/problems/report-spam-message/",
-    "title": "Report Spam Message"
+    "link": "https://leetcode.com/problems/report-spam-message/"
   },
   "3296": {
+    "id": 3296,
     "category": "Binary Search",
+    "title": "Minimum Number of Seconds to Make Mountain Height Zero",
     "difficulty": "Medium",
-    "id": 3296,
-    "link": "https://leetcode.com/problems/minimum-number-of-seconds-to-make-mountain-height-zero/",
-    "title": "Minimum Number of Seconds to Make Mountain Height Zero"
+    "link": "https://leetcode.com/problems/minimum-number-of-seconds-to-make-mountain-height-zero/"
   },
   "3297": {
+    "id": 3297,
     "category": "Sliding Window",
+    "title": "Count Substrings That Can Be Rearranged to Contain a String I",
     "difficulty": "Medium",
-    "id": 3297,
-    "link": "https://leetcode.com/problems/count-substrings-that-can-be-rearranged-to-contain-a-string-i/",
-    "title": "Count Substrings That Can Be Rearranged to Contain a String I"
+    "link": "https://leetcode.com/problems/count-substrings-that-can-be-rearranged-to-contain-a-string-i/"
   },
   "3298": {
+    "id": 3298,
     "category": "Sliding Window",
+    "title": "Count Substrings That Can Be Rearranged to Contain a String II",
     "difficulty": "Hard",
-    "id": 3298,
-    "link": "https://leetcode.com/problems/count-substrings-that-can-be-rearranged-to-contain-a-string-ii/",
-    "title": "Count Substrings That Can Be Rearranged to Contain a String II"
+    "link": "https://leetcode.com/problems/count-substrings-that-can-be-rearranged-to-contain-a-string-ii/"
   },
   "3299": {
+    "id": 3299,
     "category": "Dynamic Programming",
+    "title": "Sum of Consecutive Subsequences",
     "difficulty": "Hard",
-    "id": 3299,
-    "link": "https://leetcode.com/problems/sum-of-consecutive-subsequences/",
-    "title": "Sum of Consecutive Subsequences"
+    "link": "https://leetcode.com/problems/sum-of-consecutive-subsequences/"
   },
   "3300": {
+    "id": 3300,
     "category": "Math & Geometry",
+    "title": "Minimum Element After Replacement With Digit Sum",
     "difficulty": "Easy",
-    "id": 3300,
-    "link": "https://leetcode.com/problems/minimum-element-after-replacement-with-digit-sum/",
-    "title": "Minimum Element After Replacement With Digit Sum"
+    "link": "https://leetcode.com/problems/minimum-element-after-replacement-with-digit-sum/"
   },
   "3301": {
+    "id": 3301,
     "category": "Greedy",
+    "title": "Maximize the Total Height of Unique Towers",
     "difficulty": "Medium",
-    "id": 3301,
-    "link": "https://leetcode.com/problems/maximize-the-total-height-of-unique-towers/",
-    "title": "Maximize the Total Height of Unique Towers"
+    "link": "https://leetcode.com/problems/maximize-the-total-height-of-unique-towers/"
   },
   "3302": {
+    "id": 3302,
     "category": "Dynamic Programming",
+    "title": "Find the Lexicographically Smallest Valid Sequence",
     "difficulty": "Medium",
-    "id": 3302,
-    "link": "https://leetcode.com/problems/find-the-lexicographically-smallest-valid-sequence/",
-    "title": "Find the Lexicographically Smallest Valid Sequence"
+    "link": "https://leetcode.com/problems/find-the-lexicographically-smallest-valid-sequence/"
   },
   "3303": {
+    "id": 3303,
     "category": "Array & Hashing",
+    "title": "Find the Occurrence of First Almost Equal Substring",
     "difficulty": "Hard",
-    "id": 3303,
-    "link": "https://leetcode.com/problems/find-the-occurrence-of-first-almost-equal-substring/",
-    "title": "Find the Occurrence of First Almost Equal Substring"
+    "link": "https://leetcode.com/problems/find-the-occurrence-of-first-almost-equal-substring/"
   },
   "3304": {
+    "id": 3304,
     "category": "Bit Manipulation",
+    "title": "Find the K-th Character in String Game I",
     "difficulty": "Easy",
-    "id": 3304,
-    "link": "https://leetcode.com/problems/find-the-k-th-character-in-string-game-i/",
-    "title": "Find the K-th Character in String Game I"
+    "link": "https://leetcode.com/problems/find-the-k-th-character-in-string-game-i/"
   },
   "3305": {
+    "id": 3305,
     "category": "Sliding Window",
+    "title": "Count of Substrings Containing Every Vowel and K Consonants I",
     "difficulty": "Medium",
-    "id": 3305,
-    "link": "https://leetcode.com/problems/count-of-substrings-containing-every-vowel-and-k-consonants-i/",
-    "title": "Count of Substrings Containing Every Vowel and K Consonants I"
+    "link": "https://leetcode.com/problems/count-of-substrings-containing-every-vowel-and-k-consonants-i/"
   },
   "3306": {
+    "id": 3306,
     "category": "Sliding Window",
+    "title": "Count of Substrings Containing Every Vowel and K Consonants II",
     "difficulty": "Medium",
-    "id": 3306,
-    "link": "https://leetcode.com/problems/count-of-substrings-containing-every-vowel-and-k-consonants-ii/",
-    "title": "Count of Substrings Containing Every Vowel and K Consonants II"
+    "link": "https://leetcode.com/problems/count-of-substrings-containing-every-vowel-and-k-consonants-ii/"
   },
   "3307": {
+    "id": 3307,
     "category": "Bit Manipulation",
+    "title": "Find the K-th Character in String Game II",
     "difficulty": "Hard",
-    "id": 3307,
-    "link": "https://leetcode.com/problems/find-the-k-th-character-in-string-game-ii/",
-    "title": "Find the K-th Character in String Game II"
+    "link": "https://leetcode.com/problems/find-the-k-th-character-in-string-game-ii/"
   },
   "3308": {
+    "id": 3308,
     "category": "Database",
+    "title": "Find Top Performing Driver",
     "difficulty": "Medium",
-    "id": 3308,
-    "link": "https://leetcode.com/problems/find-top-performing-driver/",
-    "title": "Find Top Performing Driver"
+    "link": "https://leetcode.com/problems/find-top-performing-driver/"
   },
   "3309": {
+    "id": 3309,
     "category": "Bit Manipulation",
+    "title": "Maximum Possible Number by Binary Concatenation",
     "difficulty": "Medium",
-    "id": 3309,
-    "link": "https://leetcode.com/problems/maximum-possible-number-by-binary-concatenation/",
-    "title": "Maximum Possible Number by Binary Concatenation"
+    "link": "https://leetcode.com/problems/maximum-possible-number-by-binary-concatenation/"
   },
   "3310": {
+    "id": 3310,
     "category": "Graph Traversal",
+    "title": "Remove Methods From Project",
     "difficulty": "Medium",
-    "id": 3310,
-    "link": "https://leetcode.com/problems/remove-methods-from-project/",
-    "title": "Remove Methods From Project"
+    "link": "https://leetcode.com/problems/remove-methods-from-project/"
   },
   "3311": {
+    "id": 3311,
     "category": "Graph Traversal",
+    "title": "Construct 2D Grid Matching Graph Layout",
     "difficulty": "Hard",
-    "id": 3311,
-    "link": "https://leetcode.com/problems/construct-2d-grid-matching-graph-layout/",
-    "title": "Construct 2D Grid Matching Graph Layout"
+    "link": "https://leetcode.com/problems/construct-2d-grid-matching-graph-layout/"
   },
   "3312": {
+    "id": 3312,
     "category": "Binary Search",
+    "title": "Sorted GCD Pair Queries",
     "difficulty": "Hard",
-    "id": 3312,
-    "link": "https://leetcode.com/problems/sorted-gcd-pair-queries/",
-    "title": "Sorted GCD Pair Queries"
+    "link": "https://leetcode.com/problems/sorted-gcd-pair-queries/"
   },
   "3313": {
+    "id": 3313,
     "category": "Tree",
+    "title": "Find the Last Marked Nodes in Tree",
     "difficulty": "Hard",
-    "id": 3313,
-    "link": "https://leetcode.com/problems/find-the-last-marked-nodes-in-tree/",
-    "title": "Find the Last Marked Nodes in Tree"
+    "link": "https://leetcode.com/problems/find-the-last-marked-nodes-in-tree/"
   },
   "3314": {
+    "id": 3314,
     "category": "Bit Manipulation",
+    "title": "Construct the Minimum Bitwise Array I",
     "difficulty": "Easy",
-    "id": 3314,
-    "link": "https://leetcode.com/problems/construct-the-minimum-bitwise-array-i/",
-    "title": "Construct the Minimum Bitwise Array I"
+    "link": "https://leetcode.com/problems/construct-the-minimum-bitwise-array-i/"
   },
   "3315": {
+    "id": 3315,
     "category": "Bit Manipulation",
+    "title": "Construct the Minimum Bitwise Array II",
     "difficulty": "Medium",
-    "id": 3315,
-    "link": "https://leetcode.com/problems/construct-the-minimum-bitwise-array-ii/",
-    "title": "Construct the Minimum Bitwise Array II"
+    "link": "https://leetcode.com/problems/construct-the-minimum-bitwise-array-ii/"
   },
   "3316": {
+    "id": 3316,
     "category": "Dynamic Programming",
+    "title": "Find Maximum Removals From Source String",
     "difficulty": "Medium",
-    "id": 3316,
-    "link": "https://leetcode.com/problems/find-maximum-removals-from-source-string/",
-    "title": "Find Maximum Removals From Source String"
+    "link": "https://leetcode.com/problems/find-maximum-removals-from-source-string/"
   },
   "3317": {
+    "id": 3317,
     "category": "Dynamic Programming",
+    "title": "Find the Number of Possible Ways for an Event",
     "difficulty": "Hard",
-    "id": 3317,
-    "link": "https://leetcode.com/problems/find-the-number-of-possible-ways-for-an-event/",
-    "title": "Find the Number of Possible Ways for an Event"
+    "link": "https://leetcode.com/problems/find-the-number-of-possible-ways-for-an-event/"
   },
   "3318": {
+    "id": 3318,
     "category": "Sliding Window",
+    "title": "Find X-Sum of All K-Long Subarrays I",
     "difficulty": "Easy",
-    "id": 3318,
-    "link": "https://leetcode.com/problems/find-x-sum-of-all-k-long-subarrays-i/",
-    "title": "Find X-Sum of All K-Long Subarrays I"
+    "link": "https://leetcode.com/problems/find-x-sum-of-all-k-long-subarrays-i/"
   },
   "3319": {
+    "id": 3319,
     "category": "Tree",
+    "title": "K-th Largest Perfect Subtree Size in Binary Tree",
     "difficulty": "Medium",
-    "id": 3319,
-    "link": "https://leetcode.com/problems/k-th-largest-perfect-subtree-size-in-binary-tree/",
-    "title": "K-th Largest Perfect Subtree Size in Binary Tree"
+    "link": "https://leetcode.com/problems/k-th-largest-perfect-subtree-size-in-binary-tree/"
   },
   "3320": {
+    "id": 3320,
     "category": "Dynamic Programming",
+    "title": "Count The Number of Winning Sequences",
     "difficulty": "Hard",
-    "id": 3320,
-    "link": "https://leetcode.com/problems/count-the-number-of-winning-sequences/",
-    "title": "Count The Number of Winning Sequences"
+    "link": "https://leetcode.com/problems/count-the-number-of-winning-sequences/"
   },
   "3321": {
+    "id": 3321,
     "category": "Sliding Window",
+    "title": "Find X-Sum of All K-Long Subarrays II",
     "difficulty": "Hard",
-    "id": 3321,
-    "link": "https://leetcode.com/problems/find-x-sum-of-all-k-long-subarrays-ii/",
-    "title": "Find X-Sum of All K-Long Subarrays II"
+    "link": "https://leetcode.com/problems/find-x-sum-of-all-k-long-subarrays-ii/"
   },
   "3322": {
+    "id": 3322,
     "category": "Database",
+    "title": "Premier League Table Ranking III",
     "difficulty": "Medium",
-    "id": 3322,
-    "link": "https://leetcode.com/problems/premier-league-table-ranking-iii/",
-    "title": "Premier League Table Ranking III"
+    "link": "https://leetcode.com/problems/premier-league-table-ranking-iii/"
   },
   "3323": {
+    "id": 3323,
     "category": "Sliding Window",
+    "title": "Minimize Connected Groups by Inserting Interval",
     "difficulty": "Medium",
-    "id": 3323,
-    "link": "https://leetcode.com/problems/minimize-connected-groups-by-inserting-interval/",
-    "title": "Minimize Connected Groups by Inserting Interval"
+    "link": "https://leetcode.com/problems/minimize-connected-groups-by-inserting-interval/"
   },
   "3324": {
+    "id": 3324,
     "category": "Array & Hashing",
+    "title": "Find the Sequence of Strings Appeared on the Screen",
     "difficulty": "Medium",
-    "id": 3324,
-    "link": "https://leetcode.com/problems/find-the-sequence-of-strings-appeared-on-the-screen/",
-    "title": "Find the Sequence of Strings Appeared on the Screen"
+    "link": "https://leetcode.com/problems/find-the-sequence-of-strings-appeared-on-the-screen/"
   },
   "3325": {
+    "id": 3325,
     "category": "Sliding Window",
+    "title": "Count Substrings With K-Frequency Characters I",
     "difficulty": "Medium",
-    "id": 3325,
-    "link": "https://leetcode.com/problems/count-substrings-with-k-frequency-characters-i/",
-    "title": "Count Substrings With K-Frequency Characters I"
+    "link": "https://leetcode.com/problems/count-substrings-with-k-frequency-characters-i/"
   },
   "3326": {
+    "id": 3326,
     "category": "Greedy",
+    "title": "Minimum Division Operations to Make Array Non Decreasing",
     "difficulty": "Medium",
-    "id": 3326,
-    "link": "https://leetcode.com/problems/minimum-division-operations-to-make-array-non-decreasing/",
-    "title": "Minimum Division Operations to Make Array Non Decreasing"
+    "link": "https://leetcode.com/problems/minimum-division-operations-to-make-array-non-decreasing/"
   },
   "3327": {
+    "id": 3327,
     "category": "Tree",
+    "title": "Check if DFS Strings Are Palindromes",
     "difficulty": "Hard",
-    "id": 3327,
-    "link": "https://leetcode.com/problems/check-if-dfs-strings-are-palindromes/",
-    "title": "Check if DFS Strings Are Palindromes"
+    "link": "https://leetcode.com/problems/check-if-dfs-strings-are-palindromes/"
   },
   "3328": {
+    "id": 3328,
     "category": "Database",
+    "title": "Find Cities in Each State II",
     "difficulty": "Medium",
-    "id": 3328,
-    "link": "https://leetcode.com/problems/find-cities-in-each-state-ii/",
-    "title": "Find Cities in Each State II"
+    "link": "https://leetcode.com/problems/find-cities-in-each-state-ii/"
   },
   "3329": {
+    "id": 3329,
     "category": "Sliding Window",
+    "title": "Count Substrings With K-Frequency Characters II",
     "difficulty": "Hard",
-    "id": 3329,
-    "link": "https://leetcode.com/problems/count-substrings-with-k-frequency-characters-ii/",
-    "title": "Count Substrings With K-Frequency Characters II"
+    "link": "https://leetcode.com/problems/count-substrings-with-k-frequency-characters-ii/"
   },
   "3330": {
+    "id": 3330,
     "category": "Array & Hashing",
+    "title": "Find the Original Typed String I",
     "difficulty": "Easy",
-    "id": 3330,
-    "link": "https://leetcode.com/problems/find-the-original-typed-string-i/",
-    "title": "Find the Original Typed String I"
+    "link": "https://leetcode.com/problems/find-the-original-typed-string-i/"
   },
   "3331": {
+    "id": 3331,
     "category": "Tree",
+    "title": "Find Subtree Sizes After Changes",
     "difficulty": "Medium",
-    "id": 3331,
-    "link": "https://leetcode.com/problems/find-subtree-sizes-after-changes/",
-    "title": "Find Subtree Sizes After Changes"
+    "link": "https://leetcode.com/problems/find-subtree-sizes-after-changes/"
   },
   "3332": {
+    "id": 3332,
     "category": "Dynamic Programming",
+    "title": "Maximum Points Tourist Can Earn",
     "difficulty": "Medium",
-    "id": 3332,
-    "link": "https://leetcode.com/problems/maximum-points-tourist-can-earn/",
-    "title": "Maximum Points Tourist Can Earn"
+    "link": "https://leetcode.com/problems/maximum-points-tourist-can-earn/"
   },
   "3333": {
+    "id": 3333,
     "category": "Dynamic Programming",
+    "title": "Find the Original Typed String II",
     "difficulty": "Hard",
-    "id": 3333,
-    "link": "https://leetcode.com/problems/find-the-original-typed-string-ii/",
-    "title": "Find the Original Typed String II"
+    "link": "https://leetcode.com/problems/find-the-original-typed-string-ii/"
   },
   "3334": {
+    "id": 3334,
     "category": "Math & Geometry",
+    "title": "Find the Maximum Factor Score of Array",
     "difficulty": "Medium",
-    "id": 3334,
-    "link": "https://leetcode.com/problems/find-the-maximum-factor-score-of-array/",
-    "title": "Find the Maximum Factor Score of Array"
+    "link": "https://leetcode.com/problems/find-the-maximum-factor-score-of-array/"
   },
   "3335": {
+    "id": 3335,
     "category": "Dynamic Programming",
+    "title": "Total Characters in String After Transformations I",
     "difficulty": "Medium",
-    "id": 3335,
-    "link": "https://leetcode.com/problems/total-characters-in-string-after-transformations-i/",
-    "title": "Total Characters in String After Transformations I"
+    "link": "https://leetcode.com/problems/total-characters-in-string-after-transformations-i/"
   },
   "3336": {
+    "id": 3336,
     "category": "Dynamic Programming",
+    "title": "Find the Number of Subsequences With Equal GCD",
     "difficulty": "Hard",
-    "id": 3336,
-    "link": "https://leetcode.com/problems/find-the-number-of-subsequences-with-equal-gcd/",
-    "title": "Find the Number of Subsequences With Equal GCD"
+    "link": "https://leetcode.com/problems/find-the-number-of-subsequences-with-equal-gcd/"
   },
   "3337": {
+    "id": 3337,
     "category": "Dynamic Programming",
+    "title": "Total Characters in String After Transformations II",
     "difficulty": "Hard",
-    "id": 3337,
-    "link": "https://leetcode.com/problems/total-characters-in-string-after-transformations-ii/",
-    "title": "Total Characters in String After Transformations II"
+    "link": "https://leetcode.com/problems/total-characters-in-string-after-transformations-ii/"
   },
   "3338": {
+    "id": 3338,
     "category": "Database",
+    "title": "Second Highest Salary II",
     "difficulty": "Medium",
-    "id": 3338,
-    "link": "https://leetcode.com/problems/second-highest-salary-ii/",
-    "title": "Second Highest Salary II"
+    "link": "https://leetcode.com/problems/second-highest-salary-ii/"
   },
   "3339": {
+    "id": 3339,
     "category": "Dynamic Programming",
+    "title": "Find the Number of K-Even Arrays",
     "difficulty": "Medium",
-    "id": 3339,
-    "link": "https://leetcode.com/problems/find-the-number-of-k-even-arrays/",
-    "title": "Find the Number of K-Even Arrays"
+    "link": "https://leetcode.com/problems/find-the-number-of-k-even-arrays/"
   },
   "3340": {
+    "id": 3340,
     "category": "Array & Hashing",
+    "title": "Check Balanced String",
     "difficulty": "Easy",
-    "id": 3340,
-    "link": "https://leetcode.com/problems/check-balanced-string/",
-    "title": "Check Balanced String"
+    "link": "https://leetcode.com/problems/check-balanced-string/"
   },
   "3341": {
+    "id": 3341,
     "category": "Graph Traversal",
+    "title": "Find Minimum Time to Reach Last Room I",
     "difficulty": "Medium",
-    "id": 3341,
-    "link": "https://leetcode.com/problems/find-minimum-time-to-reach-last-room-i/",
-    "title": "Find Minimum Time to Reach Last Room I"
+    "link": "https://leetcode.com/problems/find-minimum-time-to-reach-last-room-i/"
   },
   "3342": {
+    "id": 3342,
     "category": "Graph Traversal",
+    "title": "Find Minimum Time to Reach Last Room II",
     "difficulty": "Medium",
-    "id": 3342,
-    "link": "https://leetcode.com/problems/find-minimum-time-to-reach-last-room-ii/",
-    "title": "Find Minimum Time to Reach Last Room II"
+    "link": "https://leetcode.com/problems/find-minimum-time-to-reach-last-room-ii/"
   },
   "3343": {
+    "id": 3343,
     "category": "Dynamic Programming",
+    "title": "Count Number of Balanced Permutations",
     "difficulty": "Hard",
-    "id": 3343,
-    "link": "https://leetcode.com/problems/count-number-of-balanced-permutations/",
-    "title": "Count Number of Balanced Permutations"
+    "link": "https://leetcode.com/problems/count-number-of-balanced-permutations/"
   },
   "3344": {
+    "id": 3344,
     "category": "Binary Search",
+    "title": "Maximum Sized Array",
     "difficulty": "Medium",
-    "id": 3344,
-    "link": "https://leetcode.com/problems/maximum-sized-array/",
-    "title": "Maximum Sized Array"
+    "link": "https://leetcode.com/problems/maximum-sized-array/"
   },
   "3345": {
+    "id": 3345,
     "category": "Math & Geometry",
+    "title": "Smallest Divisible Digit Product I",
     "difficulty": "Easy",
-    "id": 3345,
-    "link": "https://leetcode.com/problems/smallest-divisible-digit-product-i/",
-    "title": "Smallest Divisible Digit Product I"
+    "link": "https://leetcode.com/problems/smallest-divisible-digit-product-i/"
   },
   "3346": {
+    "id": 3346,
     "category": "Sliding Window",
+    "title": "Maximum Frequency of an Element After Performing Operations I",
     "difficulty": "Medium",
-    "id": 3346,
-    "link": "https://leetcode.com/problems/maximum-frequency-of-an-element-after-performing-operations-i/",
-    "title": "Maximum Frequency of an Element After Performing Operations I"
+    "link": "https://leetcode.com/problems/maximum-frequency-of-an-element-after-performing-operations-i/"
   },
   "3347": {
+    "id": 3347,
     "category": "Sliding Window",
+    "title": "Maximum Frequency of an Element After Performing Operations II",
     "difficulty": "Hard",
-    "id": 3347,
-    "link": "https://leetcode.com/problems/maximum-frequency-of-an-element-after-performing-operations-ii/",
-    "title": "Maximum Frequency of an Element After Performing Operations II"
+    "link": "https://leetcode.com/problems/maximum-frequency-of-an-element-after-performing-operations-ii/"
   },
   "3348": {
+    "id": 3348,
     "category": "Backtracking",
+    "title": "Smallest Divisible Digit Product II",
     "difficulty": "Hard",
-    "id": 3348,
-    "link": "https://leetcode.com/problems/smallest-divisible-digit-product-ii/",
-    "title": "Smallest Divisible Digit Product II"
+    "link": "https://leetcode.com/problems/smallest-divisible-digit-product-ii/"
   },
   "3349": {
+    "id": 3349,
     "category": "Array & Hashing",
+    "title": "Adjacent Increasing Subarrays Detection I",
     "difficulty": "Easy",
-    "id": 3349,
-    "link": "https://leetcode.com/problems/adjacent-increasing-subarrays-detection-i/",
-    "title": "Adjacent Increasing Subarrays Detection I"
+    "link": "https://leetcode.com/problems/adjacent-increasing-subarrays-detection-i/"
   },
   "3350": {
+    "id": 3350,
     "category": "Binary Search",
+    "title": "Adjacent Increasing Subarrays Detection II",
     "difficulty": "Medium",
-    "id": 3350,
-    "link": "https://leetcode.com/problems/adjacent-increasing-subarrays-detection-ii/",
-    "title": "Adjacent Increasing Subarrays Detection II"
+    "link": "https://leetcode.com/problems/adjacent-increasing-subarrays-detection-ii/"
   },
   "3351": {
+    "id": 3351,
     "category": "Dynamic Programming",
+    "title": "Sum of Good Subsequences",
     "difficulty": "Hard",
-    "id": 3351,
-    "link": "https://leetcode.com/problems/sum-of-good-subsequences/",
-    "title": "Sum of Good Subsequences"
+    "link": "https://leetcode.com/problems/sum-of-good-subsequences/"
   },
   "3352": {
+    "id": 3352,
     "category": "Dynamic Programming",
+    "title": "Count K-Reducible Numbers Less Than N",
     "difficulty": "Hard",
-    "id": 3352,
-    "link": "https://leetcode.com/problems/count-k-reducible-numbers-less-than-n/",
-    "title": "Count K-Reducible Numbers Less Than N"
+    "link": "https://leetcode.com/problems/count-k-reducible-numbers-less-than-n/"
   },
   "3353": {
+    "id": 3353,
     "category": "Array & Hashing",
+    "title": "Minimum Total Operations",
     "difficulty": "Easy",
-    "id": 3353,
-    "link": "https://leetcode.com/problems/minimum-total-operations/",
-    "title": "Minimum Total Operations"
+    "link": "https://leetcode.com/problems/minimum-total-operations/"
   },
   "3354": {
+    "id": 3354,
     "category": "Array & Hashing",
+    "title": "Make Array Elements Equal to Zero",
     "difficulty": "Easy",
-    "id": 3354,
-    "link": "https://leetcode.com/problems/make-array-elements-equal-to-zero/",
-    "title": "Make Array Elements Equal to Zero"
+    "link": "https://leetcode.com/problems/make-array-elements-equal-to-zero/"
   },
   "3355": {
+    "id": 3355,
     "category": "Array & Hashing",
+    "title": "Zero Array Transformation I",
     "difficulty": "Medium",
-    "id": 3355,
-    "link": "https://leetcode.com/problems/zero-array-transformation-i/",
-    "title": "Zero Array Transformation I"
+    "link": "https://leetcode.com/problems/zero-array-transformation-i/"
   },
   "3356": {
+    "id": 3356,
     "category": "Binary Search",
+    "title": "Zero Array Transformation II",
     "difficulty": "Medium",
-    "id": 3356,
-    "link": "https://leetcode.com/problems/zero-array-transformation-ii/",
-    "title": "Zero Array Transformation II"
+    "link": "https://leetcode.com/problems/zero-array-transformation-ii/"
   },
   "3357": {
+    "id": 3357,
     "category": "Binary Search",
+    "title": "Minimize the Maximum Adjacent Element Difference",
     "difficulty": "Hard",
-    "id": 3357,
-    "link": "https://leetcode.com/problems/minimize-the-maximum-adjacent-element-difference/",
-    "title": "Minimize the Maximum Adjacent Element Difference"
+    "link": "https://leetcode.com/problems/minimize-the-maximum-adjacent-element-difference/"
   },
   "3358": {
+    "id": 3358,
     "category": "Database",
+    "title": "Books with NULL Ratings",
     "difficulty": "Easy",
-    "id": 3358,
-    "link": "https://leetcode.com/problems/books-with-null-ratings/",
-    "title": "Books with NULL Ratings"
+    "link": "https://leetcode.com/problems/books-with-null-ratings/"
   },
   "3359": {
+    "id": 3359,
     "category": "Stack",
+    "title": "Find Sorted Submatrices With Maximum Element at Most K",
     "difficulty": "Hard",
-    "id": 3359,
-    "link": "https://leetcode.com/problems/find-sorted-submatrices-with-maximum-element-at-most-k/",
-    "title": "Find Sorted Submatrices With Maximum Element at Most K"
+    "link": "https://leetcode.com/problems/find-sorted-submatrices-with-maximum-element-at-most-k/"
   },
   "3360": {
+    "id": 3360,
     "category": "Math & Geometry",
+    "title": "Stone Removal Game",
     "difficulty": "Easy",
-    "id": 3360,
-    "link": "https://leetcode.com/problems/stone-removal-game/",
-    "title": "Stone Removal Game"
+    "link": "https://leetcode.com/problems/stone-removal-game/"
   },
   "3361": {
+    "id": 3361,
     "category": "Array & Hashing",
+    "title": "Shift Distance Between Two Strings",
     "difficulty": "Medium",
-    "id": 3361,
-    "link": "https://leetcode.com/problems/shift-distance-between-two-strings/",
-    "title": "Shift Distance Between Two Strings"
+    "link": "https://leetcode.com/problems/shift-distance-between-two-strings/"
   },
   "3362": {
+    "id": 3362,
     "category": "Heap (Priority Queue)",
+    "title": "Zero Array Transformation III",
     "difficulty": "Medium",
-    "id": 3362,
-    "link": "https://leetcode.com/problems/zero-array-transformation-iii/",
-    "title": "Zero Array Transformation III"
+    "link": "https://leetcode.com/problems/zero-array-transformation-iii/"
   },
   "3363": {
+    "id": 3363,
     "category": "Dynamic Programming",
+    "title": "Find the Maximum Number of Fruits Collected",
     "difficulty": "Hard",
-    "id": 3363,
-    "link": "https://leetcode.com/problems/find-the-maximum-number-of-fruits-collected/",
-    "title": "Find the Maximum Number of Fruits Collected"
+    "link": "https://leetcode.com/problems/find-the-maximum-number-of-fruits-collected/"
   },
   "3364": {
+    "id": 3364,
     "category": "Sliding Window",
+    "title": "Minimum Positive Sum Subarray ",
     "difficulty": "Easy",
-    "id": 3364,
-    "link": "https://leetcode.com/problems/minimum-positive-sum-subarray/",
-    "title": "Minimum Positive Sum Subarray "
+    "link": "https://leetcode.com/problems/minimum-positive-sum-subarray/"
   },
   "3365": {
+    "id": 3365,
     "category": "Array & Hashing",
+    "title": "Rearrange K Substrings to Form Target String",
     "difficulty": "Medium",
-    "id": 3365,
-    "link": "https://leetcode.com/problems/rearrange-k-substrings-to-form-target-string/",
-    "title": "Rearrange K Substrings to Form Target String"
+    "link": "https://leetcode.com/problems/rearrange-k-substrings-to-form-target-string/"
   },
   "3366": {
+    "id": 3366,
     "category": "Dynamic Programming",
+    "title": "Minimum Array Sum",
     "difficulty": "Medium",
-    "id": 3366,
-    "link": "https://leetcode.com/problems/minimum-array-sum/",
-    "title": "Minimum Array Sum"
+    "link": "https://leetcode.com/problems/minimum-array-sum/"
   },
   "3367": {
+    "id": 3367,
     "category": "Tree",
+    "title": "Maximize Sum of Weights after Edge Removals",
     "difficulty": "Hard",
-    "id": 3367,
-    "link": "https://leetcode.com/problems/maximize-sum-of-weights-after-edge-removals/",
-    "title": "Maximize Sum of Weights after Edge Removals"
+    "link": "https://leetcode.com/problems/maximize-sum-of-weights-after-edge-removals/"
   },
   "3368": {
+    "id": 3368,
     "category": "Database",
+    "title": "First Letter Capitalization",
     "difficulty": "Hard",
-    "id": 3368,
-    "link": "https://leetcode.com/problems/first-letter-capitalization/",
-    "title": "First Letter Capitalization"
+    "link": "https://leetcode.com/problems/first-letter-capitalization/"
   },
   "3369": {
+    "id": 3369,
     "category": "Binary Search",
+    "title": "Design an Array Statistics Tracker ",
     "difficulty": "Hard",
-    "id": 3369,
-    "link": "https://leetcode.com/problems/design-an-array-statistics-tracker/",
-    "title": "Design an Array Statistics Tracker "
+    "link": "https://leetcode.com/problems/design-an-array-statistics-tracker/"
   },
   "3370": {
+    "id": 3370,
     "category": "Bit Manipulation",
+    "title": "Smallest Number With All Set Bits",
     "difficulty": "Easy",
-    "id": 3370,
-    "link": "https://leetcode.com/problems/smallest-number-with-all-set-bits/",
-    "title": "Smallest Number With All Set Bits"
+    "link": "https://leetcode.com/problems/smallest-number-with-all-set-bits/"
   },
   "3371": {
+    "id": 3371,
     "category": "Array & Hashing",
+    "title": "Identify the Largest Outlier in an Array",
     "difficulty": "Medium",
-    "id": 3371,
-    "link": "https://leetcode.com/problems/identify-the-largest-outlier-in-an-array/",
-    "title": "Identify the Largest Outlier in an Array"
+    "link": "https://leetcode.com/problems/identify-the-largest-outlier-in-an-array/"
   },
   "3372": {
+    "id": 3372,
     "category": "Tree",
+    "title": "Maximize the Number of Target Nodes After Connecting Trees I",
     "difficulty": "Medium",
-    "id": 3372,
-    "link": "https://leetcode.com/problems/maximize-the-number-of-target-nodes-after-connecting-trees-i/",
-    "title": "Maximize the Number of Target Nodes After Connecting Trees I"
+    "link": "https://leetcode.com/problems/maximize-the-number-of-target-nodes-after-connecting-trees-i/"
   },
   "3373": {
+    "id": 3373,
     "category": "Tree",
+    "title": "Maximize the Number of Target Nodes After Connecting Trees II",
     "difficulty": "Hard",
-    "id": 3373,
-    "link": "https://leetcode.com/problems/maximize-the-number-of-target-nodes-after-connecting-trees-ii/",
-    "title": "Maximize the Number of Target Nodes After Connecting Trees II"
+    "link": "https://leetcode.com/problems/maximize-the-number-of-target-nodes-after-connecting-trees-ii/"
   },
   "3374": {
+    "id": 3374,
     "category": "Database",
+    "title": "First Letter Capitalization II",
     "difficulty": "Hard",
-    "id": 3374,
-    "link": "https://leetcode.com/problems/first-letter-capitalization-ii/",
-    "title": "First Letter Capitalization II"
+    "link": "https://leetcode.com/problems/first-letter-capitalization-ii/"
   },
   "3375": {
+    "id": 3375,
     "category": "Array & Hashing",
+    "title": "Minimum Operations to Make Array Values Equal to K",
     "difficulty": "Easy",
-    "id": 3375,
-    "link": "https://leetcode.com/problems/minimum-operations-to-make-array-values-equal-to-k/",
-    "title": "Minimum Operations to Make Array Values Equal to K"
+    "link": "https://leetcode.com/problems/minimum-operations-to-make-array-values-equal-to-k/"
   },
   "3376": {
+    "id": 3376,
     "category": "Graph Traversal",
+    "title": "Minimum Time to Break Locks I",
     "difficulty": "Medium",
-    "id": 3376,
-    "link": "https://leetcode.com/problems/minimum-time-to-break-locks-i/",
-    "title": "Minimum Time to Break Locks I"
+    "link": "https://leetcode.com/problems/minimum-time-to-break-locks-i/"
   },
   "3377": {
+    "id": 3377,
     "category": "Graph Traversal",
+    "title": "Digit Operations to Make Two Integers Equal",
     "difficulty": "Medium",
-    "id": 3377,
-    "link": "https://leetcode.com/problems/digit-operations-to-make-two-integers-equal/",
-    "title": "Digit Operations to Make Two Integers Equal"
+    "link": "https://leetcode.com/problems/digit-operations-to-make-two-integers-equal/"
   },
   "3378": {
+    "id": 3378,
     "category": "Graph Traversal",
+    "title": "Count Connected Components in LCM Graph",
     "difficulty": "Hard",
-    "id": 3378,
-    "link": "https://leetcode.com/problems/count-connected-components-in-lcm-graph/",
-    "title": "Count Connected Components in LCM Graph"
+    "link": "https://leetcode.com/problems/count-connected-components-in-lcm-graph/"
   },
   "3379": {
+    "id": 3379,
     "category": "Array & Hashing",
+    "title": "Transformed Array",
     "difficulty": "Easy",
-    "id": 3379,
-    "link": "https://leetcode.com/problems/transformed-array/",
-    "title": "Transformed Array"
+    "link": "https://leetcode.com/problems/transformed-array/"
   },
   "3380": {
+    "id": 3380,
     "category": "Tree",
+    "title": "Maximum Area Rectangle With Point Constraints I",
     "difficulty": "Medium",
-    "id": 3380,
-    "link": "https://leetcode.com/problems/maximum-area-rectangle-with-point-constraints-i/",
-    "title": "Maximum Area Rectangle With Point Constraints I"
+    "link": "https://leetcode.com/problems/maximum-area-rectangle-with-point-constraints-i/"
   },
   "3381": {
+    "id": 3381,
     "category": "Array & Hashing",
+    "title": "Maximum Subarray Sum With Length Divisible by K",
     "difficulty": "Medium",
-    "id": 3381,
-    "link": "https://leetcode.com/problems/maximum-subarray-sum-with-length-divisible-by-k/",
-    "title": "Maximum Subarray Sum With Length Divisible by K"
+    "link": "https://leetcode.com/problems/maximum-subarray-sum-with-length-divisible-by-k/"
   },
   "3382": {
+    "id": 3382,
     "category": "Tree",
+    "title": "Maximum Area Rectangle With Point Constraints II",
     "difficulty": "Hard",
-    "id": 3382,
-    "link": "https://leetcode.com/problems/maximum-area-rectangle-with-point-constraints-ii/",
-    "title": "Maximum Area Rectangle With Point Constraints II"
+    "link": "https://leetcode.com/problems/maximum-area-rectangle-with-point-constraints-ii/"
   },
   "3383": {
+    "id": 3383,
     "category": "Graph Traversal",
+    "title": "Minimum Runes to Add to Cast Spell",
     "difficulty": "Hard",
-    "id": 3383,
-    "link": "https://leetcode.com/problems/minimum-runes-to-add-to-cast-spell/",
-    "title": "Minimum Runes to Add to Cast Spell"
+    "link": "https://leetcode.com/problems/minimum-runes-to-add-to-cast-spell/"
   },
   "3384": {
+    "id": 3384,
     "category": "Database",
+    "title": "Team Dominance by Pass Success",
     "difficulty": "Hard",
-    "id": 3384,
-    "link": "https://leetcode.com/problems/team-dominance-by-pass-success/",
-    "title": "Team Dominance by Pass Success"
+    "link": "https://leetcode.com/problems/team-dominance-by-pass-success/"
   },
   "3385": {
+    "id": 3385,
     "category": "Graph Traversal",
+    "title": "Minimum Time to Break Locks II",
     "difficulty": "Hard",
-    "id": 3385,
-    "link": "https://leetcode.com/problems/minimum-time-to-break-locks-ii/",
-    "title": "Minimum Time to Break Locks II"
+    "link": "https://leetcode.com/problems/minimum-time-to-break-locks-ii/"
   },
   "3386": {
+    "id": 3386,
     "category": "Array & Hashing",
+    "title": "Button with Longest Push Time",
     "difficulty": "Easy",
-    "id": 3386,
-    "link": "https://leetcode.com/problems/button-with-longest-push-time/",
-    "title": "Button with Longest Push Time"
+    "link": "https://leetcode.com/problems/button-with-longest-push-time/"
   },
   "3387": {
+    "id": 3387,
     "category": "Graph Traversal",
+    "title": "Maximize Amount After Two Days of Conversions",
     "difficulty": "Medium",
-    "id": 3387,
-    "link": "https://leetcode.com/problems/maximize-amount-after-two-days-of-conversions/",
-    "title": "Maximize Amount After Two Days of Conversions"
+    "link": "https://leetcode.com/problems/maximize-amount-after-two-days-of-conversions/"
   },
   "3388": {
+    "id": 3388,
     "category": "Dynamic Programming",
+    "title": "Count Beautiful Splits in an Array",
     "difficulty": "Medium",
-    "id": 3388,
-    "link": "https://leetcode.com/problems/count-beautiful-splits-in-an-array/",
-    "title": "Count Beautiful Splits in an Array"
+    "link": "https://leetcode.com/problems/count-beautiful-splits-in-an-array/"
   },
   "3389": {
+    "id": 3389,
     "category": "Dynamic Programming",
+    "title": "Minimum Operations to Make Character Frequencies Equal",
     "difficulty": "Hard",
-    "id": 3389,
-    "link": "https://leetcode.com/problems/minimum-operations-to-make-character-frequencies-equal/",
-    "title": "Minimum Operations to Make Character Frequencies Equal"
+    "link": "https://leetcode.com/problems/minimum-operations-to-make-character-frequencies-equal/"
   },
   "3390": {
+    "id": 3390,
     "category": "Database",
+    "title": "Longest Team Pass Streak",
     "difficulty": "Hard",
-    "id": 3390,
-    "link": "https://leetcode.com/problems/longest-team-pass-streak/",
-    "title": "Longest Team Pass Streak"
+    "link": "https://leetcode.com/problems/longest-team-pass-streak/"
   },
   "3391": {
+    "id": 3391,
     "category": "Heap (Priority Queue)",
+    "title": "Design a 3D Binary Matrix with Efficient Layer Tracking",
     "difficulty": "Medium",
-    "id": 3391,
-    "link": "https://leetcode.com/problems/design-a-3d-binary-matrix-with-efficient-layer-tracking/",
-    "title": "Design a 3D Binary Matrix with Efficient Layer Tracking"
+    "link": "https://leetcode.com/problems/design-a-3d-binary-matrix-with-efficient-layer-tracking/"
   },
   "3392": {
+    "id": 3392,
     "category": "Array & Hashing",
+    "title": "Count Subarrays of Length Three With a Condition",
     "difficulty": "Easy",
-    "id": 3392,
-    "link": "https://leetcode.com/problems/count-subarrays-of-length-three-with-a-condition/",
-    "title": "Count Subarrays of Length Three With a Condition"
+    "link": "https://leetcode.com/problems/count-subarrays-of-length-three-with-a-condition/"
   },
   "3393": {
+    "id": 3393,
     "category": "Dynamic Programming",
+    "title": "Count Paths With the Given XOR Value",
     "difficulty": "Medium",
-    "id": 3393,
-    "link": "https://leetcode.com/problems/count-paths-with-the-given-xor-value/",
-    "title": "Count Paths With the Given XOR Value"
+    "link": "https://leetcode.com/problems/count-paths-with-the-given-xor-value/"
   },
   "3394": {
+    "id": 3394,
     "category": "Array & Hashing",
+    "title": "Check if Grid can be Cut into Sections",
     "difficulty": "Medium",
-    "id": 3394,
-    "link": "https://leetcode.com/problems/check-if-grid-can-be-cut-into-sections/",
-    "title": "Check if Grid can be Cut into Sections"
+    "link": "https://leetcode.com/problems/check-if-grid-can-be-cut-into-sections/"
   },
   "3395": {
+    "id": 3395,
     "category": "Math & Geometry",
+    "title": "Subsequences with a Unique Middle Mode I",
     "difficulty": "Hard",
-    "id": 3395,
-    "link": "https://leetcode.com/problems/subsequences-with-a-unique-middle-mode-i/",
-    "title": "Subsequences with a Unique Middle Mode I"
+    "link": "https://leetcode.com/problems/subsequences-with-a-unique-middle-mode-i/"
   },
   "3396": {
+    "id": 3396,
     "category": "Array & Hashing",
+    "title": "Minimum Number of Operations to Make Elements in Array Distinct",
     "difficulty": "Easy",
-    "id": 3396,
-    "link": "https://leetcode.com/problems/minimum-number-of-operations-to-make-elements-in-array-distinct/",
-    "title": "Minimum Number of Operations to Make Elements in Array Distinct"
+    "link": "https://leetcode.com/problems/minimum-number-of-operations-to-make-elements-in-array-distinct/"
   },
   "3397": {
+    "id": 3397,
     "category": "Greedy",
+    "title": "Maximum Number of Distinct Elements After Operations",
     "difficulty": "Medium",
-    "id": 3397,
-    "link": "https://leetcode.com/problems/maximum-number-of-distinct-elements-after-operations/",
-    "title": "Maximum Number of Distinct Elements After Operations"
+    "link": "https://leetcode.com/problems/maximum-number-of-distinct-elements-after-operations/"
   },
   "3398": {
+    "id": 3398,
     "category": "Binary Search",
+    "title": "Smallest Substring With Identical Characters I",
     "difficulty": "Hard",
-    "id": 3398,
-    "link": "https://leetcode.com/problems/smallest-substring-with-identical-characters-i/",
-    "title": "Smallest Substring With Identical Characters I"
+    "link": "https://leetcode.com/problems/smallest-substring-with-identical-characters-i/"
   },
   "3399": {
+    "id": 3399,
     "category": "Binary Search",
+    "title": "Smallest Substring With Identical Characters II",
     "difficulty": "Hard",
-    "id": 3399,
-    "link": "https://leetcode.com/problems/smallest-substring-with-identical-characters-ii/",
-    "title": "Smallest Substring With Identical Characters II"
+    "link": "https://leetcode.com/problems/smallest-substring-with-identical-characters-ii/"
   },
   "3400": {
+    "id": 3400,
     "category": "Two Pointers",
+    "title": "Maximum Number of Matching Indices After Right Shifts",
     "difficulty": "Medium",
-    "id": 3400,
-    "link": "https://leetcode.com/problems/maximum-number-of-matching-indices-after-right-shifts/",
-    "title": "Maximum Number of Matching Indices After Right Shifts"
+    "link": "https://leetcode.com/problems/maximum-number-of-matching-indices-after-right-shifts/"
   },
   "3401": {
+    "id": 3401,
     "category": "Database",
+    "title": "Find Circular Gift Exchange Chains",
     "difficulty": "Hard",
-    "id": 3401,
-    "link": "https://leetcode.com/problems/find-circular-gift-exchange-chains/",
-    "title": "Find Circular Gift Exchange Chains"
+    "link": "https://leetcode.com/problems/find-circular-gift-exchange-chains/"
   },
   "3402": {
+    "id": 3402,
     "category": "Greedy",
+    "title": "Minimum Operations to Make Columns Strictly Increasing",
     "difficulty": "Easy",
-    "id": 3402,
-    "link": "https://leetcode.com/problems/minimum-operations-to-make-columns-strictly-increasing/",
-    "title": "Minimum Operations to Make Columns Strictly Increasing"
+    "link": "https://leetcode.com/problems/minimum-operations-to-make-columns-strictly-increasing/"
   },
   "3403": {
+    "id": 3403,
     "category": "Two Pointers",
+    "title": "Find the Lexicographically Largest String From the Box I",
     "difficulty": "Medium",
-    "id": 3403,
-    "link": "https://leetcode.com/problems/find-the-lexicographically-largest-string-from-the-box-i/",
-    "title": "Find the Lexicographically Largest String From the Box I"
+    "link": "https://leetcode.com/problems/find-the-lexicographically-largest-string-from-the-box-i/"
   },
   "3404": {
+    "id": 3404,
     "category": "Math & Geometry",
+    "title": "Count Special Subsequences",
     "difficulty": "Medium",
-    "id": 3404,
-    "link": "https://leetcode.com/problems/count-special-subsequences/",
-    "title": "Count Special Subsequences"
+    "link": "https://leetcode.com/problems/count-special-subsequences/"
   },
   "3405": {
+    "id": 3405,
     "category": "Math & Geometry",
+    "title": "Count the Number of Arrays with K Matching Adjacent Elements",
     "difficulty": "Hard",
-    "id": 3405,
-    "link": "https://leetcode.com/problems/count-the-number-of-arrays-with-k-matching-adjacent-elements/",
-    "title": "Count the Number of Arrays with K Matching Adjacent Elements"
+    "link": "https://leetcode.com/problems/count-the-number-of-arrays-with-k-matching-adjacent-elements/"
   },
   "3406": {
+    "id": 3406,
     "category": "Two Pointers",
+    "title": "Find the Lexicographically Largest String From the Box II",
     "difficulty": "Hard",
-    "id": 3406,
-    "link": "https://leetcode.com/problems/find-the-lexicographically-largest-string-from-the-box-ii/",
-    "title": "Find the Lexicographically Largest String From the Box II"
+    "link": "https://leetcode.com/problems/find-the-lexicographically-largest-string-from-the-box-ii/"
   },
   "3407": {
+    "id": 3407,
     "category": "Array & Hashing",
+    "title": "Substring Matching Pattern",
     "difficulty": "Easy",
-    "id": 3407,
-    "link": "https://leetcode.com/problems/substring-matching-pattern/",
-    "title": "Substring Matching Pattern"
+    "link": "https://leetcode.com/problems/substring-matching-pattern/"
   },
   "3408": {
+    "id": 3408,
     "category": "Heap (Priority Queue)",
+    "title": "Design Task Manager",
     "difficulty": "Medium",
-    "id": 3408,
-    "link": "https://leetcode.com/problems/design-task-manager/",
-    "title": "Design Task Manager"
+    "link": "https://leetcode.com/problems/design-task-manager/"
   },
   "3409": {
+    "id": 3409,
     "category": "Dynamic Programming",
+    "title": "Longest Subsequence With Decreasing Adjacent Difference",
     "difficulty": "Medium",
-    "id": 3409,
-    "link": "https://leetcode.com/problems/longest-subsequence-with-decreasing-adjacent-difference/",
-    "title": "Longest Subsequence With Decreasing Adjacent Difference"
+    "link": "https://leetcode.com/problems/longest-subsequence-with-decreasing-adjacent-difference/"
   },
   "3410": {
+    "id": 3410,
     "category": "Tree",
+    "title": "Maximize Subarray Sum After Removing All Occurrences of One Element",
     "difficulty": "Hard",
-    "id": 3410,
-    "link": "https://leetcode.com/problems/maximize-subarray-sum-after-removing-all-occurrences-of-one-element/",
-    "title": "Maximize Subarray Sum After Removing All Occurrences of One Element"
+    "link": "https://leetcode.com/problems/maximize-subarray-sum-after-removing-all-occurrences-of-one-element/"
   },
   "3411": {
+    "id": 3411,
     "category": "Sliding Window",
+    "title": "Maximum Subarray With Equal Products",
     "difficulty": "Easy",
-    "id": 3411,
-    "link": "https://leetcode.com/problems/maximum-subarray-with-equal-products/",
-    "title": "Maximum Subarray With Equal Products"
+    "link": "https://leetcode.com/problems/maximum-subarray-with-equal-products/"
   },
   "3412": {
+    "id": 3412,
     "category": "Stack",
+    "title": "Find Mirror Score of a String",
     "difficulty": "Medium",
-    "id": 3412,
-    "link": "https://leetcode.com/problems/find-mirror-score-of-a-string/",
-    "title": "Find Mirror Score of a String"
+    "link": "https://leetcode.com/problems/find-mirror-score-of-a-string/"
   },
   "3413": {
+    "id": 3413,
     "category": "Sliding Window",
+    "title": "Maximum Coins From K Consecutive Bags",
     "difficulty": "Medium",
-    "id": 3413,
-    "link": "https://leetcode.com/problems/maximum-coins-from-k-consecutive-bags/",
-    "title": "Maximum Coins From K Consecutive Bags"
+    "link": "https://leetcode.com/problems/maximum-coins-from-k-consecutive-bags/"
   },
   "3414": {
+    "id": 3414,
     "category": "Dynamic Programming",
+    "title": "Maximum Score of Non-overlapping Intervals",
     "difficulty": "Hard",
-    "id": 3414,
-    "link": "https://leetcode.com/problems/maximum-score-of-non-overlapping-intervals/",
-    "title": "Maximum Score of Non-overlapping Intervals"
+    "link": "https://leetcode.com/problems/maximum-score-of-non-overlapping-intervals/"
   },
   "3415": {
+    "id": 3415,
     "category": "Database",
+    "title": "Find Products with Three Consecutive Digits ",
     "difficulty": "Easy",
-    "id": 3415,
-    "link": "https://leetcode.com/problems/find-products-with-three-consecutive-digits/",
-    "title": "Find Products with Three Consecutive Digits "
+    "link": "https://leetcode.com/problems/find-products-with-three-consecutive-digits/"
   },
   "3416": {
+    "id": 3416,
     "category": "Math & Geometry",
+    "title": "Subsequences with a Unique Middle Mode II",
     "difficulty": "Hard",
-    "id": 3416,
-    "link": "https://leetcode.com/problems/subsequences-with-a-unique-middle-mode-ii/",
-    "title": "Subsequences with a Unique Middle Mode II"
+    "link": "https://leetcode.com/problems/subsequences-with-a-unique-middle-mode-ii/"
   },
   "3417": {
+    "id": 3417,
     "category": "Array & Hashing",
+    "title": "Zigzag Grid Traversal With Skip",
     "difficulty": "Easy",
-    "id": 3417,
-    "link": "https://leetcode.com/problems/zigzag-grid-traversal-with-skip/",
-    "title": "Zigzag Grid Traversal With Skip"
+    "link": "https://leetcode.com/problems/zigzag-grid-traversal-with-skip/"
   },
   "3418": {
+    "id": 3418,
     "category": "Dynamic Programming",
+    "title": "Maximum Amount of Money Robot Can Earn",
     "difficulty": "Medium",
-    "id": 3418,
-    "link": "https://leetcode.com/problems/maximum-amount-of-money-robot-can-earn/",
-    "title": "Maximum Amount of Money Robot Can Earn"
+    "link": "https://leetcode.com/problems/maximum-amount-of-money-robot-can-earn/"
   },
   "3419": {
+    "id": 3419,
     "category": "Graph Traversal",
+    "title": "Minimize the Maximum Edge Weight of Graph",
     "difficulty": "Medium",
-    "id": 3419,
-    "link": "https://leetcode.com/problems/minimize-the-maximum-edge-weight-of-graph/",
-    "title": "Minimize the Maximum Edge Weight of Graph"
+    "link": "https://leetcode.com/problems/minimize-the-maximum-edge-weight-of-graph/"
   },
   "3420": {
+    "id": 3420,
     "category": "Tree",
+    "title": "Count Non-Decreasing Subarrays After K Operations",
     "difficulty": "Hard",
-    "id": 3420,
-    "link": "https://leetcode.com/problems/count-non-decreasing-subarrays-after-k-operations/",
-    "title": "Count Non-Decreasing Subarrays After K Operations"
+    "link": "https://leetcode.com/problems/count-non-decreasing-subarrays-after-k-operations/"
   },
   "3421": {
+    "id": 3421,
     "category": "Database",
+    "title": "Find Students Who Improved",
     "difficulty": "Medium",
-    "id": 3421,
-    "link": "https://leetcode.com/problems/find-students-who-improved/",
-    "title": "Find Students Who Improved"
+    "link": "https://leetcode.com/problems/find-students-who-improved/"
   },
   "3422": {
+    "id": 3422,
     "category": "Sliding Window",
+    "title": "Minimum Operations to Make Subarray Elements Equal",
     "difficulty": "Medium",
-    "id": 3422,
-    "link": "https://leetcode.com/problems/minimum-operations-to-make-subarray-elements-equal/",
-    "title": "Minimum Operations to Make Subarray Elements Equal"
+    "link": "https://leetcode.com/problems/minimum-operations-to-make-subarray-elements-equal/"
   },
   "3423": {
+    "id": 3423,
     "category": "Array & Hashing",
+    "title": "Maximum Difference Between Adjacent Elements in a Circular Array",
     "difficulty": "Easy",
-    "id": 3423,
-    "link": "https://leetcode.com/problems/maximum-difference-between-adjacent-elements-in-a-circular-array/",
-    "title": "Maximum Difference Between Adjacent Elements in a Circular Array"
+    "link": "https://leetcode.com/problems/maximum-difference-between-adjacent-elements-in-a-circular-array/"
   },
   "3424": {
+    "id": 3424,
     "category": "Greedy",
+    "title": "Minimum Cost to Make Arrays Identical",
     "difficulty": "Medium",
-    "id": 3424,
-    "link": "https://leetcode.com/problems/minimum-cost-to-make-arrays-identical/",
-    "title": "Minimum Cost to Make Arrays Identical"
+    "link": "https://leetcode.com/problems/minimum-cost-to-make-arrays-identical/"
   },
   "3425": {
+    "id": 3425,
     "category": "Tree",
+    "title": "Longest Special Path",
     "difficulty": "Hard",
-    "id": 3425,
-    "link": "https://leetcode.com/problems/longest-special-path/",
-    "title": "Longest Special Path"
+    "link": "https://leetcode.com/problems/longest-special-path/"
   },
   "3426": {
+    "id": 3426,
     "category": "Math & Geometry",
+    "title": "Manhattan Distances of All Arrangements of Pieces",
     "difficulty": "Hard",
-    "id": 3426,
-    "link": "https://leetcode.com/problems/manhattan-distances-of-all-arrangements-of-pieces/",
-    "title": "Manhattan Distances of All Arrangements of Pieces"
+    "link": "https://leetcode.com/problems/manhattan-distances-of-all-arrangements-of-pieces/"
   },
   "3427": {
+    "id": 3427,
     "category": "Array & Hashing",
+    "title": "Sum of Variable Length Subarrays",
     "difficulty": "Easy",
-    "id": 3427,
-    "link": "https://leetcode.com/problems/sum-of-variable-length-subarrays/",
-    "title": "Sum of Variable Length Subarrays"
+    "link": "https://leetcode.com/problems/sum-of-variable-length-subarrays/"
   },
   "3428": {
+    "id": 3428,
     "category": "Dynamic Programming",
+    "title": "Maximum and Minimum Sums of at Most Size K Subsequences",
     "difficulty": "Medium",
-    "id": 3428,
-    "link": "https://leetcode.com/problems/maximum-and-minimum-sums-of-at-most-size-k-subsequences/",
-    "title": "Maximum and Minimum Sums of at Most Size K Subsequences"
+    "link": "https://leetcode.com/problems/maximum-and-minimum-sums-of-at-most-size-k-subsequences/"
   },
   "3429": {
+    "id": 3429,
     "category": "Dynamic Programming",
+    "title": "Paint House IV",
     "difficulty": "Medium",
-    "id": 3429,
-    "link": "https://leetcode.com/problems/paint-house-iv/",
-    "title": "Paint House IV"
+    "link": "https://leetcode.com/problems/paint-house-iv/"
   },
   "3430": {
+    "id": 3430,
     "category": "Stack",
+    "title": "Maximum and Minimum Sums of at Most Size K Subarrays",
     "difficulty": "Hard",
-    "id": 3430,
-    "link": "https://leetcode.com/problems/maximum-and-minimum-sums-of-at-most-size-k-subarrays/",
-    "title": "Maximum and Minimum Sums of at Most Size K Subarrays"
+    "link": "https://leetcode.com/problems/maximum-and-minimum-sums-of-at-most-size-k-subarrays/"
   },
   "3431": {
+    "id": 3431,
     "category": "Array & Hashing",
+    "title": "Minimum Unlocked Indices to Sort Nums",
     "difficulty": "Medium",
-    "id": 3431,
-    "link": "https://leetcode.com/problems/minimum-unlocked-indices-to-sort-nums/",
-    "title": "Minimum Unlocked Indices to Sort Nums"
+    "link": "https://leetcode.com/problems/minimum-unlocked-indices-to-sort-nums/"
   },
   "3432": {
-    "category": "Array & Hashing",
-    "difficulty": "Medium",
     "id": 3432,
-    "link": "https://leetcode.com/problems/find-the-power-of-k-size-subarrays-i/",
-    "tags": ["array", "sliding-window"],
-    "title": "Find the Power of K-Size Subarrays I"
+    "category": "Math & Geometry",
+    "title": "Count Partitions with Even Sum Difference",
+    "difficulty": "Easy",
+    "link": "https://leetcode.com/problems/count-partitions-with-even-sum-difference/"
   },
   "3433": {
+    "id": 3433,
     "category": "Math & Geometry",
+    "title": "Count Mentions Per User",
     "difficulty": "Medium",
-    "id": 3433,
-    "link": "https://leetcode.com/problems/count-mentions-per-user/",
-    "title": "Count Mentions Per User"
+    "link": "https://leetcode.com/problems/count-mentions-per-user/"
   },
   "3434": {
+    "id": 3434,
     "category": "Dynamic Programming",
+    "title": "Maximum Frequency After Subarray Operation",
     "difficulty": "Medium",
-    "id": 3434,
-    "link": "https://leetcode.com/problems/maximum-frequency-after-subarray-operation/",
-    "title": "Maximum Frequency After Subarray Operation"
+    "link": "https://leetcode.com/problems/maximum-frequency-after-subarray-operation/"
   },
   "3435": {
+    "id": 3435,
     "category": "Graph Traversal",
+    "title": "Frequencies of Shortest Supersequences",
     "difficulty": "Hard",
-    "id": 3435,
-    "link": "https://leetcode.com/problems/frequencies-of-shortest-supersequences/",
-    "title": "Frequencies of Shortest Supersequences"
+    "link": "https://leetcode.com/problems/frequencies-of-shortest-supersequences/"
   },
   "3436": {
+    "id": 3436,
     "category": "Database",
+    "title": "Find Valid Emails",
     "difficulty": "Easy",
-    "id": 3436,
-    "link": "https://leetcode.com/problems/find-valid-emails/",
-    "title": "Find Valid Emails"
+    "link": "https://leetcode.com/problems/find-valid-emails/"
   },
   "3437": {
+    "id": 3437,
     "category": "Backtracking",
+    "title": "Permutations III",
     "difficulty": "Medium",
-    "id": 3437,
-    "link": "https://leetcode.com/problems/permutations-iii/",
-    "title": "Permutations III"
+    "link": "https://leetcode.com/problems/permutations-iii/"
   },
   "3438": {
+    "id": 3438,
     "category": "Array & Hashing",
+    "title": "Find Valid Pair of Adjacent Digits in String",
     "difficulty": "Easy",
-    "id": 3438,
-    "link": "https://leetcode.com/problems/find-valid-pair-of-adjacent-digits-in-string/",
-    "title": "Find Valid Pair of Adjacent Digits in String"
+    "link": "https://leetcode.com/problems/find-valid-pair-of-adjacent-digits-in-string/"
   },
   "3439": {
+    "id": 3439,
     "category": "Sliding Window",
+    "title": "Reschedule Meetings for Maximum Free Time I",
     "difficulty": "Medium",
-    "id": 3439,
-    "link": "https://leetcode.com/problems/reschedule-meetings-for-maximum-free-time-i/",
-    "title": "Reschedule Meetings for Maximum Free Time I"
+    "link": "https://leetcode.com/problems/reschedule-meetings-for-maximum-free-time-i/"
   },
   "3440": {
+    "id": 3440,
     "category": "Greedy",
+    "title": "Reschedule Meetings for Maximum Free Time II",
     "difficulty": "Medium",
-    "id": 3440,
-    "link": "https://leetcode.com/problems/reschedule-meetings-for-maximum-free-time-ii/",
-    "title": "Reschedule Meetings for Maximum Free Time II"
+    "link": "https://leetcode.com/problems/reschedule-meetings-for-maximum-free-time-ii/"
   },
   "3441": {
+    "id": 3441,
     "category": "Dynamic Programming",
+    "title": "Minimum Cost Good Caption",
     "difficulty": "Hard",
-    "id": 3441,
-    "link": "https://leetcode.com/problems/minimum-cost-good-caption/",
-    "title": "Minimum Cost Good Caption"
+    "link": "https://leetcode.com/problems/minimum-cost-good-caption/"
   },
   "3442": {
+    "id": 3442,
     "category": "Array & Hashing",
+    "title": "Maximum Difference Between Even and Odd Frequency I",
     "difficulty": "Easy",
-    "id": 3442,
-    "link": "https://leetcode.com/problems/maximum-difference-between-even-and-odd-frequency-i/",
-    "title": "Maximum Difference Between Even and Odd Frequency I"
+    "link": "https://leetcode.com/problems/maximum-difference-between-even-and-odd-frequency-i/"
   },
   "3443": {
+    "id": 3443,
     "category": "Math & Geometry",
+    "title": "Maximum Manhattan Distance After K Changes",
     "difficulty": "Medium",
-    "id": 3443,
-    "link": "https://leetcode.com/problems/maximum-manhattan-distance-after-k-changes/",
-    "title": "Maximum Manhattan Distance After K Changes"
+    "link": "https://leetcode.com/problems/maximum-manhattan-distance-after-k-changes/"
   },
   "3444": {
+    "id": 3444,
     "category": "Dynamic Programming",
+    "title": "Minimum Increments for Target Multiples in an Array",
     "difficulty": "Hard",
-    "id": 3444,
-    "link": "https://leetcode.com/problems/minimum-increments-for-target-multiples-in-an-array/",
-    "title": "Minimum Increments for Target Multiples in an Array"
+    "link": "https://leetcode.com/problems/minimum-increments-for-target-multiples-in-an-array/"
   },
   "3445": {
+    "id": 3445,
     "category": "Sliding Window",
+    "title": "Maximum Difference Between Even and Odd Frequency II",
     "difficulty": "Hard",
-    "id": 3445,
-    "link": "https://leetcode.com/problems/maximum-difference-between-even-and-odd-frequency-ii/",
-    "title": "Maximum Difference Between Even and Odd Frequency II"
+    "link": "https://leetcode.com/problems/maximum-difference-between-even-and-odd-frequency-ii/"
   },
   "3446": {
+    "id": 3446,
     "category": "Array & Hashing",
+    "title": "Sort Matrix by Diagonals",
     "difficulty": "Medium",
-    "id": 3446,
-    "link": "https://leetcode.com/problems/sort-matrix-by-diagonals/",
-    "title": "Sort Matrix by Diagonals"
+    "link": "https://leetcode.com/problems/sort-matrix-by-diagonals/"
   },
   "3447": {
+    "id": 3447,
     "category": "Array & Hashing",
+    "title": "Assign Elements to Groups with Constraints",
     "difficulty": "Medium",
-    "id": 3447,
-    "link": "https://leetcode.com/problems/assign-elements-to-groups-with-constraints/",
-    "title": "Assign Elements to Groups with Constraints"
+    "link": "https://leetcode.com/problems/assign-elements-to-groups-with-constraints/"
   },
   "3448": {
+    "id": 3448,
     "category": "Dynamic Programming",
+    "title": "Count Substrings Divisible By Last Digit",
     "difficulty": "Hard",
-    "id": 3448,
-    "link": "https://leetcode.com/problems/count-substrings-divisible-by-last-digit/",
-    "title": "Count Substrings Divisible By Last Digit"
+    "link": "https://leetcode.com/problems/count-substrings-divisible-by-last-digit/"
   },
   "3449": {
+    "id": 3449,
     "category": "Binary Search",
+    "title": "Maximize the Minimum Game Score",
     "difficulty": "Hard",
-    "id": 3449,
-    "link": "https://leetcode.com/problems/maximize-the-minimum-game-score/",
-    "title": "Maximize the Minimum Game Score"
+    "link": "https://leetcode.com/problems/maximize-the-minimum-game-score/"
   },
   "3450": {
+    "id": 3450,
     "category": "Array & Hashing",
+    "title": "Maximum Students on a Single Bench",
     "difficulty": "Easy",
-    "id": 3450,
-    "link": "https://leetcode.com/problems/maximum-students-on-a-single-bench/",
-    "title": "Maximum Students on a Single Bench"
+    "link": "https://leetcode.com/problems/maximum-students-on-a-single-bench/"
   },
   "3451": {
+    "id": 3451,
     "category": "Database",
+    "title": "Find Invalid IP Addresses",
     "difficulty": "Hard",
-    "id": 3451,
-    "link": "https://leetcode.com/problems/find-invalid-ip-addresses/",
-    "title": "Find Invalid IP Addresses"
+    "link": "https://leetcode.com/problems/find-invalid-ip-addresses/"
   },
   "3452": {
+    "id": 3452,
     "category": "Array & Hashing",
+    "title": "Sum of Good Numbers",
     "difficulty": "Easy",
-    "id": 3452,
-    "link": "https://leetcode.com/problems/sum-of-good-numbers/",
-    "title": "Sum of Good Numbers"
+    "link": "https://leetcode.com/problems/sum-of-good-numbers/"
   },
   "3453": {
+    "id": 3453,
     "category": "Binary Search",
+    "title": "Separate Squares I",
     "difficulty": "Medium",
-    "id": 3453,
-    "link": "https://leetcode.com/problems/separate-squares-i/",
-    "title": "Separate Squares I"
+    "link": "https://leetcode.com/problems/separate-squares-i/"
   },
   "3454": {
+    "id": 3454,
     "category": "Tree",
+    "title": "Separate Squares II",
     "difficulty": "Hard",
-    "id": 3454,
-    "link": "https://leetcode.com/problems/separate-squares-ii/",
-    "title": "Separate Squares II"
+    "link": "https://leetcode.com/problems/separate-squares-ii/"
   },
   "3455": {
+    "id": 3455,
     "category": "Binary Search",
+    "title": "Shortest Matching Substring",
     "difficulty": "Hard",
-    "id": 3455,
-    "link": "https://leetcode.com/problems/shortest-matching-substring/",
-    "title": "Shortest Matching Substring"
+    "link": "https://leetcode.com/problems/shortest-matching-substring/"
   },
   "3456": {
+    "id": 3456,
     "category": "Array & Hashing",
+    "title": "Find Special Substring of Length K",
     "difficulty": "Easy",
-    "id": 3456,
-    "link": "https://leetcode.com/problems/find-special-substring-of-length-k/",
-    "title": "Find Special Substring of Length K"
+    "link": "https://leetcode.com/problems/find-special-substring-of-length-k/"
+  },
+  "3457": {
+    "id": 3457,
+    "category": "Greedy",
+    "title": "Eat Pizzas!",
+    "difficulty": "Medium",
+    "link": "https://leetcode.com/problems/eat-pizzas/"
   },
-  "3457": {"category": "Greedy", "difficulty": "Medium", "id": 3457, "link": "https://leetcode.com/problems/eat-pizzas/", "title": "Eat Pizzas!"},
   "3458": {
+    "id": 3458,
     "category": "Dynamic Programming",
+    "title": "Select K Disjoint Special Substrings",
     "difficulty": "Medium",
-    "id": 3458,
-    "link": "https://leetcode.com/problems/select-k-disjoint-special-substrings/",
-    "title": "Select K Disjoint Special Substrings"
+    "link": "https://leetcode.com/problems/select-k-disjoint-special-substrings/"
   },
   "3459": {
+    "id": 3459,
     "category": "Dynamic Programming",
+    "title": "Length of Longest V-Shaped Diagonal Segment",
     "difficulty": "Hard",
-    "id": 3459,
-    "link": "https://leetcode.com/problems/length-of-longest-v-shaped-diagonal-segment/",
-    "title": "Length of Longest V-Shaped Diagonal Segment"
+    "link": "https://leetcode.com/problems/length-of-longest-v-shaped-diagonal-segment/"
   },
   "3460": {
+    "id": 3460,
     "category": "Two Pointers",
+    "title": "Longest Common Prefix After at Most One Removal",
     "difficulty": "Medium",
-    "id": 3460,
-    "link": "https://leetcode.com/problems/longest-common-prefix-after-at-most-one-removal/",
-    "title": "Longest Common Prefix After at Most One Removal"
+    "link": "https://leetcode.com/problems/longest-common-prefix-after-at-most-one-removal/"
   },
   "3461": {
+    "id": 3461,
     "category": "Math & Geometry",
+    "title": "Check If Digits Are Equal in String After Operations I",
     "difficulty": "Easy",
-    "id": 3461,
-    "link": "https://leetcode.com/problems/check-if-digits-are-equal-in-string-after-operations-i/",
-    "title": "Check If Digits Are Equal in String After Operations I"
+    "link": "https://leetcode.com/problems/check-if-digits-are-equal-in-string-after-operations-i/"
   },
   "3462": {
+    "id": 3462,
     "category": "Heap (Priority Queue)",
+    "title": "Maximum Sum With at Most K Elements",
     "difficulty": "Medium",
-    "id": 3462,
-    "link": "https://leetcode.com/problems/maximum-sum-with-at-most-k-elements/",
-    "title": "Maximum Sum With at Most K Elements"
+    "link": "https://leetcode.com/problems/maximum-sum-with-at-most-k-elements/"
   },
   "3463": {
+    "id": 3463,
     "category": "Math & Geometry",
+    "title": "Check If Digits Are Equal in String After Operations II",
     "difficulty": "Hard",
-    "id": 3463,
-    "link": "https://leetcode.com/problems/check-if-digits-are-equal-in-string-after-operations-ii/",
-    "title": "Check If Digits Are Equal in String After Operations II"
+    "link": "https://leetcode.com/problems/check-if-digits-are-equal-in-string-after-operations-ii/"
   },
   "3464": {
+    "id": 3464,
     "category": "Binary Search",
+    "title": "Maximize the Distance Between Points on a Square",
     "difficulty": "Hard",
-    "id": 3464,
-    "link": "https://leetcode.com/problems/maximize-the-distance-between-points-on-a-square/",
-    "title": "Maximize the Distance Between Points on a Square"
+    "link": "https://leetcode.com/problems/maximize-the-distance-between-points-on-a-square/"
   },
   "3465": {
+    "id": 3465,
     "category": "Database",
+    "title": "Find Products with Valid Serial Numbers",
     "difficulty": "Easy",
-    "id": 3465,
-    "link": "https://leetcode.com/problems/find-products-with-valid-serial-numbers/",
-    "title": "Find Products with Valid Serial Numbers"
+    "link": "https://leetcode.com/problems/find-products-with-valid-serial-numbers/"
   },
   "3466": {
+    "id": 3466,
     "category": "Dynamic Programming",
+    "title": "Maximum Coin Collection ",
     "difficulty": "Medium",
-    "id": 3466,
-    "link": "https://leetcode.com/problems/maximum-coin-collection/",
-    "title": "Maximum Coin Collection "
+    "link": "https://leetcode.com/problems/maximum-coin-collection/"
   },
   "3467": {
+    "id": 3467,
     "category": "Array & Hashing",
+    "title": "Transform Array by Parity",
     "difficulty": "Easy",
-    "id": 3467,
-    "link": "https://leetcode.com/problems/transform-array-by-parity/",
-    "title": "Transform Array by Parity"
+    "link": "https://leetcode.com/problems/transform-array-by-parity/"
   },
   "3468": {
+    "id": 3468,
     "category": "Math & Geometry",
+    "title": "Find the Number of Copy Arrays",
     "difficulty": "Medium",
-    "id": 3468,
-    "link": "https://leetcode.com/problems/find-the-number-of-copy-arrays/",
-    "title": "Find the Number of Copy Arrays"
+    "link": "https://leetcode.com/problems/find-the-number-of-copy-arrays/"
   },
   "3469": {
+    "id": 3469,
     "category": "Dynamic Programming",
+    "title": "Find Minimum Cost to Remove Array Elements",
     "difficulty": "Medium",
-    "id": 3469,
-    "link": "https://leetcode.com/problems/find-minimum-cost-to-remove-array-elements/",
-    "title": "Find Minimum Cost to Remove Array Elements"
+    "link": "https://leetcode.com/problems/find-minimum-cost-to-remove-array-elements/"
   },
   "3470": {
+    "id": 3470,
     "category": "Math & Geometry",
+    "title": "Permutations IV",
     "difficulty": "Hard",
-    "id": 3470,
-    "link": "https://leetcode.com/problems/permutations-iv/",
-    "title": "Permutations IV"
+    "link": "https://leetcode.com/problems/permutations-iv/"
   },
   "3471": {
+    "id": 3471,
     "category": "Array & Hashing",
+    "title": "Find the Largest Almost Missing Integer",
     "difficulty": "Easy",
-    "id": 3471,
-    "link": "https://leetcode.com/problems/find-the-largest-almost-missing-integer/",
-    "title": "Find the Largest Almost Missing Integer"
+    "link": "https://leetcode.com/problems/find-the-largest-almost-missing-integer/"
   },
   "3472": {
+    "id": 3472,
     "category": "Dynamic Programming",
+    "title": "Longest Palindromic Subsequence After at Most K Operations",
     "difficulty": "Medium",
-    "id": 3472,
-    "link": "https://leetcode.com/problems/longest-palindromic-subsequence-after-at-most-k-operations/",
-    "title": "Longest Palindromic Subsequence After at Most K Operations"
+    "link": "https://leetcode.com/problems/longest-palindromic-subsequence-after-at-most-k-operations/"
   },
   "3473": {
+    "id": 3473,
     "category": "Dynamic Programming",
+    "title": "Sum of K Subarrays With Length at Least M",
     "difficulty": "Medium",
-    "id": 3473,
-    "link": "https://leetcode.com/problems/sum-of-k-subarrays-with-length-at-least-m/",
-    "title": "Sum of K Subarrays With Length at Least M"
+    "link": "https://leetcode.com/problems/sum-of-k-subarrays-with-length-at-least-m/"
   },
   "3474": {
+    "id": 3474,
     "category": "Greedy",
+    "title": "Lexicographically Smallest Generated String",
     "difficulty": "Hard",
-    "id": 3474,
-    "link": "https://leetcode.com/problems/lexicographically-smallest-generated-string/",
-    "title": "Lexicographically Smallest Generated String"
+    "link": "https://leetcode.com/problems/lexicographically-smallest-generated-string/"
   },
   "3475": {
+    "id": 3475,
     "category": "Database",
+    "title": "DNA Pattern Recognition ",
     "difficulty": "Medium",
-    "id": 3475,
-    "link": "https://leetcode.com/problems/dna-pattern-recognition/",
-    "title": "DNA Pattern Recognition "
+    "link": "https://leetcode.com/problems/dna-pattern-recognition/"
   },
   "3476": {
+    "id": 3476,
     "category": "Heap (Priority Queue)",
+    "title": "Maximize Profit from Task Assignment",
     "difficulty": "Medium",
-    "id": 3476,
-    "link": "https://leetcode.com/problems/maximize-profit-from-task-assignment/",
-    "title": "Maximize Profit from Task Assignment"
+    "link": "https://leetcode.com/problems/maximize-profit-from-task-assignment/"
   },
   "3477": {
+    "id": 3477,
     "category": "Tree",
+    "title": "Fruits Into Baskets II",
     "difficulty": "Easy",
-    "id": 3477,
-    "link": "https://leetcode.com/problems/fruits-into-baskets-ii/",
-    "title": "Fruits Into Baskets II"
+    "link": "https://leetcode.com/problems/fruits-into-baskets-ii/"
   },
   "3478": {
+    "id": 3478,
     "category": "Heap (Priority Queue)",
+    "title": "Choose K Elements With Maximum Sum",
     "difficulty": "Medium",
-    "id": 3478,
-    "link": "https://leetcode.com/problems/choose-k-elements-with-maximum-sum/",
-    "title": "Choose K Elements With Maximum Sum"
+    "link": "https://leetcode.com/problems/choose-k-elements-with-maximum-sum/"
   },
   "3479": {
+    "id": 3479,
     "category": "Tree",
+    "title": "Fruits Into Baskets III",
     "difficulty": "Medium",
-    "id": 3479,
-    "link": "https://leetcode.com/problems/fruits-into-baskets-iii/",
-    "title": "Fruits Into Baskets III"
+    "link": "https://leetcode.com/problems/fruits-into-baskets-iii/"
   },
   "3480": {
+    "id": 3480,
     "category": "Tree",
+    "title": "Maximize Subarrays After Removing One Conflicting Pair",
     "difficulty": "Hard",
-    "id": 3480,
-    "link": "https://leetcode.com/problems/maximize-subarrays-after-removing-one-conflicting-pair/",
-    "title": "Maximize Subarrays After Removing One Conflicting Pair"
+    "link": "https://leetcode.com/problems/maximize-subarrays-after-removing-one-conflicting-pair/"
   },
   "3481": {
+    "id": 3481,
     "category": "Graph Traversal",
+    "title": "Apply Substitutions",
     "difficulty": "Medium",
-    "id": 3481,
-    "link": "https://leetcode.com/problems/apply-substitutions/",
-    "title": "Apply Substitutions"
+    "link": "https://leetcode.com/problems/apply-substitutions/"
   },
   "3482": {
+    "id": 3482,
     "category": "Database",
+    "title": "Analyze Organization Hierarchy",
     "difficulty": "Hard",
-    "id": 3482,
-    "link": "https://leetcode.com/problems/analyze-organization-hierarchy/",
-    "title": "Analyze Organization Hierarchy"
+    "link": "https://leetcode.com/problems/analyze-organization-hierarchy/"
   },
   "3483": {
+    "id": 3483,
     "category": "Array & Hashing",
+    "title": "Unique 3-Digit Even Numbers",
     "difficulty": "Easy",
-    "id": 3483,
-    "link": "https://leetcode.com/problems/unique-3-digit-even-numbers/",
-    "title": "Unique 3-Digit Even Numbers"
+    "link": "https://leetcode.com/problems/unique-3-digit-even-numbers/"
   },
   "3484": {
+    "id": 3484,
     "category": "Array & Hashing",
+    "title": "Design Spreadsheet",
     "difficulty": "Medium",
-    "id": 3484,
-    "link": "https://leetcode.com/problems/design-spreadsheet/",
-    "title": "Design Spreadsheet"
+    "link": "https://leetcode.com/problems/design-spreadsheet/"
   },
   "3485": {
+    "id": 3485,
     "category": "Trie",
+    "title": "Longest Common Prefix of K Strings After Removal",
     "difficulty": "Hard",
-    "id": 3485,
-    "link": "https://leetcode.com/problems/longest-common-prefix-of-k-strings-after-removal/",
-    "title": "Longest Common Prefix of K Strings After Removal"
+    "link": "https://leetcode.com/problems/longest-common-prefix-of-k-strings-after-removal/"
   },
   "3486": {
+    "id": 3486,
     "category": "Tree",
+    "title": "Longest Special Path II",
     "difficulty": "Hard",
-    "id": 3486,
-    "link": "https://leetcode.com/problems/longest-special-path-ii/",
-    "title": "Longest Special Path II"
+    "link": "https://leetcode.com/problems/longest-special-path-ii/"
   },
   "3487": {
+    "id": 3487,
     "category": "Greedy",
+    "title": "Maximum Unique Subarray Sum After Deletion",
     "difficulty": "Easy",
-    "id": 3487,
-    "link": "https://leetcode.com/problems/maximum-unique-subarray-sum-after-deletion/",
-    "title": "Maximum Unique Subarray Sum After Deletion"
+    "link": "https://leetcode.com/problems/maximum-unique-subarray-sum-after-deletion/"
   },
   "3488": {
+    "id": 3488,
     "category": "Binary Search",
+    "title": "Closest Equal Element Queries",
     "difficulty": "Medium",
-    "id": 3488,
-    "link": "https://leetcode.com/problems/closest-equal-element-queries/",
-    "title": "Closest Equal Element Queries"
+    "link": "https://leetcode.com/problems/closest-equal-element-queries/"
   },
   "3489": {
+    "id": 3489,
     "category": "Dynamic Programming",
+    "title": "Zero Array Transformation IV",
     "difficulty": "Medium",
-    "id": 3489,
-    "link": "https://leetcode.com/problems/zero-array-transformation-iv/",
-    "title": "Zero Array Transformation IV"
+    "link": "https://leetcode.com/problems/zero-array-transformation-iv/"
   },
   "3490": {
+    "id": 3490,
     "category": "Dynamic Programming",
+    "title": "Count Beautiful Numbers",
     "difficulty": "Hard",
-    "id": 3490,
-    "link": "https://leetcode.com/problems/count-beautiful-numbers/",
-    "title": "Count Beautiful Numbers"
+    "link": "https://leetcode.com/problems/count-beautiful-numbers/"
   },
   "3491": {
+    "id": 3491,
     "category": "Trie",
+    "title": "Phone Number Prefix",
     "difficulty": "Easy",
-    "id": 3491,
-    "link": "https://leetcode.com/problems/phone-number-prefix/",
-    "title": "Phone Number Prefix"
+    "link": "https://leetcode.com/problems/phone-number-prefix/"
   },
   "3492": {
+    "id": 3492,
     "category": "Math & Geometry",
+    "title": "Maximum Containers on a Ship",
     "difficulty": "Easy",
-    "id": 3492,
-    "link": "https://leetcode.com/problems/maximum-containers-on-a-ship/",
-    "title": "Maximum Containers on a Ship"
+    "link": "https://leetcode.com/problems/maximum-containers-on-a-ship/"
   },
   "3493": {
+    "id": 3493,
     "category": "Graph Traversal",
+    "title": "Properties Graph",
     "difficulty": "Medium",
-    "id": 3493,
-    "link": "https://leetcode.com/problems/properties-graph/",
-    "title": "Properties Graph"
+    "link": "https://leetcode.com/problems/properties-graph/"
   },
   "3494": {
+    "id": 3494,
     "category": "Array & Hashing",
+    "title": "Find the Minimum Amount of Time to Brew Potions",
     "difficulty": "Medium",
-    "id": 3494,
-    "link": "https://leetcode.com/problems/find-the-minimum-amount-of-time-to-brew-potions/",
-    "title": "Find the Minimum Amount of Time to Brew Potions"
+    "link": "https://leetcode.com/problems/find-the-minimum-amount-of-time-to-brew-potions/"
   },
   "3495": {
+    "id": 3495,
     "category": "Bit Manipulation",
+    "title": "Minimum Operations to Make Array Elements Zero",
     "difficulty": "Hard",
-    "id": 3495,
-    "link": "https://leetcode.com/problems/minimum-operations-to-make-array-elements-zero/",
-    "title": "Minimum Operations to Make Array Elements Zero"
+    "link": "https://leetcode.com/problems/minimum-operations-to-make-array-elements-zero/"
   },
   "3496": {
+    "id": 3496,
     "category": "Greedy",
+    "title": "Maximize Score After Pair Deletions",
     "difficulty": "Medium",
-    "id": 3496,
-    "link": "https://leetcode.com/problems/maximize-score-after-pair-deletions/",
-    "title": "Maximize Score After Pair Deletions"
+    "link": "https://leetcode.com/problems/maximize-score-after-pair-deletions/"
   },
   "3497": {
+    "id": 3497,
     "category": "Database",
+    "title": "Analyze Subscription Conversion ",
     "difficulty": "Medium",
-    "id": 3497,
-    "link": "https://leetcode.com/problems/analyze-subscription-conversion/",
-    "title": "Analyze Subscription Conversion "
+    "link": "https://leetcode.com/problems/analyze-subscription-conversion/"
   },
   "3498": {
+    "id": 3498,
     "category": "Array & Hashing",
+    "title": "Reverse Degree of a String",
     "difficulty": "Easy",
-    "id": 3498,
-    "link": "https://leetcode.com/problems/reverse-degree-of-a-string/",
-    "title": "Reverse Degree of a String"
+    "link": "https://leetcode.com/problems/reverse-degree-of-a-string/"
   },
   "3499": {
+    "id": 3499,
     "category": "Array & Hashing",
+    "title": "Maximize Active Section with Trade I",
     "difficulty": "Medium",
-    "id": 3499,
-    "link": "https://leetcode.com/problems/maximize-active-section-with-trade-i/",
-    "title": "Maximize Active Section with Trade I"
+    "link": "https://leetcode.com/problems/maximize-active-section-with-trade-i/"
   },
   "3500": {
+    "id": 3500,
     "category": "Dynamic Programming",
+    "title": "Minimum Cost to Divide Array Into Subarrays",
     "difficulty": "Hard",
-    "id": 3500,
-    "link": "https://leetcode.com/problems/minimum-cost-to-divide-array-into-subarrays/",
-    "title": "Minimum Cost to Divide Array Into Subarrays"
+    "link": "https://leetcode.com/problems/minimum-cost-to-divide-array-into-subarrays/"
   },
   "3501": {
+    "id": 3501,
     "category": "Tree",
+    "title": "Maximize Active Section with Trade II",
     "difficulty": "Hard",
-    "id": 3501,
-    "link": "https://leetcode.com/problems/maximize-active-section-with-trade-ii/",
-    "title": "Maximize Active Section with Trade II"
+    "link": "https://leetcode.com/problems/maximize-active-section-with-trade-ii/"
   },
   "3502": {
+    "id": 3502,
     "category": "Array & Hashing",
+    "title": "Minimum Cost to Reach Every Position",
     "difficulty": "Easy",
-    "id": 3502,
-    "link": "https://leetcode.com/problems/minimum-cost-to-reach-every-position/",
-    "title": "Minimum Cost to Reach Every Position"
+    "link": "https://leetcode.com/problems/minimum-cost-to-reach-every-position/"
   },
   "3503": {
+    "id": 3503,
     "category": "Dynamic Programming",
+    "title": "Longest Palindrome After Substring Concatenation I",
     "difficulty": "Medium",
-    "id": 3503,
-    "link": "https://leetcode.com/problems/longest-palindrome-after-substring-concatenation-i/",
-    "title": "Longest Palindrome After Substring Concatenation I"
+    "link": "https://leetcode.com/problems/longest-palindrome-after-substring-concatenation-i/"
   },
   "3504": {
+    "id": 3504,
     "category": "Dynamic Programming",
+    "title": "Longest Palindrome After Substring Concatenation II",
     "difficulty": "Hard",
-    "id": 3504,
-    "link": "https://leetcode.com/problems/longest-palindrome-after-substring-concatenation-ii/",
-    "title": "Longest Palindrome After Substring Concatenation II"
+    "link": "https://leetcode.com/problems/longest-palindrome-after-substring-concatenation-ii/"
   },
   "3505": {
+    "id": 3505,
     "category": "Dynamic Programming",
+    "title": "Minimum Operations to Make Elements Within K Subarrays Equal",
     "difficulty": "Hard",
-    "id": 3505,
-    "link": "https://leetcode.com/problems/minimum-operations-to-make-elements-within-k-subarrays-equal/",
-    "title": "Minimum Operations to Make Elements Within K Subarrays Equal"
+    "link": "https://leetcode.com/problems/minimum-operations-to-make-elements-within-k-subarrays-equal/"
   },
   "3506": {
+    "id": 3506,
     "category": "Heap (Priority Queue)",
+    "title": "Find Time Required to Eliminate Bacterial Strains",
     "difficulty": "Hard",
-    "id": 3506,
-    "link": "https://leetcode.com/problems/find-time-required-to-eliminate-bacterial-strains/",
-    "title": "Find Time Required to Eliminate Bacterial Strains"
+    "link": "https://leetcode.com/problems/find-time-required-to-eliminate-bacterial-strains/"
   },
   "3507": {
+    "id": 3507,
     "category": "Heap (Priority Queue)",
+    "title": "Minimum Pair Removal to Sort Array I",
     "difficulty": "Easy",
-    "id": 3507,
-    "link": "https://leetcode.com/problems/minimum-pair-removal-to-sort-array-i/",
-    "title": "Minimum Pair Removal to Sort Array I"
+    "link": "https://leetcode.com/problems/minimum-pair-removal-to-sort-array-i/"
   },
   "3508": {
+    "id": 3508,
     "category": "Binary Search",
+    "title": "Implement Router",
     "difficulty": "Medium",
-    "id": 3508,
-    "link": "https://leetcode.com/problems/implement-router/",
-    "title": "Implement Router"
+    "link": "https://leetcode.com/problems/implement-router/"
   },
   "3509": {
+    "id": 3509,
     "category": "Dynamic Programming",
+    "title": "Maximum Product of Subsequences With an Alternating Sum Equal to K",
     "difficulty": "Hard",
-    "id": 3509,
-    "link": "https://leetcode.com/problems/maximum-product-of-subsequences-with-an-alternating-sum-equal-to-k/",
-    "title": "Maximum Product of Subsequences With an Alternating Sum Equal to K"
+    "link": "https://leetcode.com/problems/maximum-product-of-subsequences-with-an-alternating-sum-equal-to-k/"
   },
   "3510": {
+    "id": 3510,
     "category": "Heap (Priority Queue)",
+    "title": "Minimum Pair Removal to Sort Array II",
     "difficulty": "Hard",
-    "id": 3510,
-    "link": "https://leetcode.com/problems/minimum-pair-removal-to-sort-array-ii/",
-    "title": "Minimum Pair Removal to Sort Array II"
+    "link": "https://leetcode.com/problems/minimum-pair-removal-to-sort-array-ii/"
   },
   "3511": {
+    "id": 3511,
     "category": "Greedy",
+    "title": "Make a Positive Array",
     "difficulty": "Medium",
-    "id": 3511,
-    "link": "https://leetcode.com/problems/make-a-positive-array/",
-    "title": "Make a Positive Array"
+    "link": "https://leetcode.com/problems/make-a-positive-array/"
   },
   "3512": {
+    "id": 3512,
     "category": "Math & Geometry",
+    "title": "Minimum Operations to Make Array Sum Divisible by K",
     "difficulty": "Easy",
-    "id": 3512,
-    "link": "https://leetcode.com/problems/minimum-operations-to-make-array-sum-divisible-by-k/",
-    "title": "Minimum Operations to Make Array Sum Divisible by K"
+    "link": "https://leetcode.com/problems/minimum-operations-to-make-array-sum-divisible-by-k/"
   },
   "3513": {
+    "id": 3513,
     "category": "Bit Manipulation",
+    "title": "Number of Unique XOR Triplets I",
     "difficulty": "Medium",
-    "id": 3513,
-    "link": "https://leetcode.com/problems/number-of-unique-xor-triplets-i/",
-    "title": "Number of Unique XOR Triplets I"
+    "link": "https://leetcode.com/problems/number-of-unique-xor-triplets-i/"
   },
   "3514": {
+    "id": 3514,
     "category": "Bit Manipulation",
+    "title": "Number of Unique XOR Triplets II",
     "difficulty": "Medium",
-    "id": 3514,
-    "link": "https://leetcode.com/problems/number-of-unique-xor-triplets-ii/",
-    "title": "Number of Unique XOR Triplets II"
+    "link": "https://leetcode.com/problems/number-of-unique-xor-triplets-ii/"
   },
   "3515": {
+    "id": 3515,
     "category": "Tree",
+    "title": "Shortest Path in a Weighted Tree",
     "difficulty": "Hard",
-    "id": 3515,
-    "link": "https://leetcode.com/problems/shortest-path-in-a-weighted-tree/",
-    "title": "Shortest Path in a Weighted Tree"
+    "link": "https://leetcode.com/problems/shortest-path-in-a-weighted-tree/"
   },
   "3516": {
+    "id": 3516,
     "category": "Math & Geometry",
+    "title": "Find Closest Person",
     "difficulty": "Easy",
-    "id": 3516,
-    "link": "https://leetcode.com/problems/find-closest-person/",
-    "title": "Find Closest Person"
+    "link": "https://leetcode.com/problems/find-closest-person/"
   },
   "3517": {
+    "id": 3517,
     "category": "Array & Hashing",
+    "title": "Smallest Palindromic Rearrangement I",
     "difficulty": "Medium",
-    "id": 3517,
-    "link": "https://leetcode.com/problems/smallest-palindromic-rearrangement-i/",
-    "title": "Smallest Palindromic Rearrangement I"
+    "link": "https://leetcode.com/problems/smallest-palindromic-rearrangement-i/"
   },
   "3518": {
+    "id": 3518,
     "category": "Math & Geometry",
+    "title": "Smallest Palindromic Rearrangement II",
     "difficulty": "Hard",
-    "id": 3518,
-    "link": "https://leetcode.com/problems/smallest-palindromic-rearrangement-ii/",
-    "title": "Smallest Palindromic Rearrangement II"
+    "link": "https://leetcode.com/problems/smallest-palindromic-rearrangement-ii/"
   },
   "3519": {
+    "id": 3519,
     "category": "Dynamic Programming",
+    "title": "Count Numbers with Non-Decreasing Digits ",
     "difficulty": "Hard",
-    "id": 3519,
-    "link": "https://leetcode.com/problems/count-numbers-with-non-decreasing-digits/",
-    "title": "Count Numbers with Non-Decreasing Digits "
+    "link": "https://leetcode.com/problems/count-numbers-with-non-decreasing-digits/"
   },
   "3520": {
+    "id": 3520,
     "category": "Tree",
+    "title": "Minimum Threshold for Inversion Pairs Count",
     "difficulty": "Medium",
-    "id": 3520,
-    "link": "https://leetcode.com/problems/minimum-threshold-for-inversion-pairs-count/",
-    "title": "Minimum Threshold for Inversion Pairs Count"
+    "link": "https://leetcode.com/problems/minimum-threshold-for-inversion-pairs-count/"
   },
   "3521": {
+    "id": 3521,
     "category": "Database",
+    "title": "Find Product Recommendation Pairs",
     "difficulty": "Medium",
-    "id": 3521,
-    "link": "https://leetcode.com/problems/find-product-recommendation-pairs/",
-    "title": "Find Product Recommendation Pairs"
+    "link": "https://leetcode.com/problems/find-product-recommendation-pairs/"
   },
   "3522": {
+    "id": 3522,
     "category": "Array & Hashing",
+    "title": "Calculate Score After Performing Instructions",
     "difficulty": "Medium",
-    "id": 3522,
-    "link": "https://leetcode.com/problems/calculate-score-after-performing-instructions/",
-    "title": "Calculate Score After Performing Instructions"
+    "link": "https://leetcode.com/problems/calculate-score-after-performing-instructions/"
   },
   "3523": {
+    "id": 3523,
     "category": "Stack",
+    "title": "Make Array Non-decreasing",
     "difficulty": "Medium",
-    "id": 3523,
-    "link": "https://leetcode.com/problems/make-array-non-decreasing/",
-    "title": "Make Array Non-decreasing"
+    "link": "https://leetcode.com/problems/make-array-non-decreasing/"
   },
   "3524": {
+    "id": 3524,
     "category": "Dynamic Programming",
+    "title": "Find X Value of Array I",
     "difficulty": "Medium",
-    "id": 3524,
-    "link": "https://leetcode.com/problems/find-x-value-of-array-i/",
-    "title": "Find X Value of Array I"
+    "link": "https://leetcode.com/problems/find-x-value-of-array-i/"
   },
   "3525": {
+    "id": 3525,
     "category": "Tree",
+    "title": "Find X Value of Array II",
     "difficulty": "Hard",
-    "id": 3525,
-    "link": "https://leetcode.com/problems/find-x-value-of-array-ii/",
-    "title": "Find X Value of Array II"
+    "link": "https://leetcode.com/problems/find-x-value-of-array-ii/"
   },
   "3526": {
+    "id": 3526,
     "category": "Tree",
+    "title": "Range XOR Queries with Subarray Reversals",
     "difficulty": "Hard",
-    "id": 3526,
-    "link": "https://leetcode.com/problems/range-xor-queries-with-subarray-reversals/",
-    "title": "Range XOR Queries with Subarray Reversals"
+    "link": "https://leetcode.com/problems/range-xor-queries-with-subarray-reversals/"
   },
   "3527": {
+    "id": 3527,
     "category": "Array & Hashing",
+    "title": "Find the Most Common Response",
     "difficulty": "Medium",
-    "id": 3527,
-    "link": "https://leetcode.com/problems/find-the-most-common-response/",
-    "title": "Find the Most Common Response"
+    "link": "https://leetcode.com/problems/find-the-most-common-response/"
   },
   "3528": {
+    "id": 3528,
     "category": "Graph Traversal",
+    "title": "Unit Conversion I",
     "difficulty": "Medium",
-    "id": 3528,
-    "link": "https://leetcode.com/problems/unit-conversion-i/",
-    "title": "Unit Conversion I"
+    "link": "https://leetcode.com/problems/unit-conversion-i/"
   },
   "3529": {
+    "id": 3529,
     "category": "Array & Hashing",
+    "title": "Count Cells in Overlapping Horizontal and Vertical Substrings",
     "difficulty": "Medium",
-    "id": 3529,
-    "link": "https://leetcode.com/problems/count-cells-in-overlapping-horizontal-and-vertical-substrings/",
-    "title": "Count Cells in Overlapping Horizontal and Vertical Substrings"
+    "link": "https://leetcode.com/problems/count-cells-in-overlapping-horizontal-and-vertical-substrings/"
   },
   "3530": {
+    "id": 3530,
     "category": "Graph Traversal",
+    "title": "Maximum Profit from Valid Topological Order in DAG",
     "difficulty": "Hard",
-    "id": 3530,
-    "link": "https://leetcode.com/problems/maximum-profit-from-valid-topological-order-in-dag/",
-    "title": "Maximum Profit from Valid Topological Order in DAG"
+    "link": "https://leetcode.com/problems/maximum-profit-from-valid-topological-order-in-dag/"
   },
   "3531": {
+    "id": 3531,
     "category": "Array & Hashing",
+    "title": "Count Covered Buildings",
     "difficulty": "Medium",
-    "id": 3531,
-    "link": "https://leetcode.com/problems/count-covered-buildings/",
-    "title": "Count Covered Buildings"
+    "link": "https://leetcode.com/problems/count-covered-buildings/"
   },
   "3532": {
+    "id": 3532,
     "category": "Graph Traversal",
+    "title": "Path Existence Queries in a Graph I",
     "difficulty": "Medium",
-    "id": 3532,
-    "link": "https://leetcode.com/problems/path-existence-queries-in-a-graph-i/",
-    "title": "Path Existence Queries in a Graph I"
+    "link": "https://leetcode.com/problems/path-existence-queries-in-a-graph-i/"
   },
   "3533": {
+    "id": 3533,
     "category": "Dynamic Programming",
+    "title": "Concatenated Divisibility",
     "difficulty": "Hard",
-    "id": 3533,
-    "link": "https://leetcode.com/problems/concatenated-divisibility/",
-    "title": "Concatenated Divisibility"
+    "link": "https://leetcode.com/problems/concatenated-divisibility/"
   },
   "3534": {
+    "id": 3534,
     "category": "Graph Traversal",
+    "title": "Path Existence Queries in a Graph II",
     "difficulty": "Hard",
-    "id": 3534,
-    "link": "https://leetcode.com/problems/path-existence-queries-in-a-graph-ii/",
-    "title": "Path Existence Queries in a Graph II"
+    "link": "https://leetcode.com/problems/path-existence-queries-in-a-graph-ii/"
   },
   "3535": {
+    "id": 3535,
     "category": "Graph Traversal",
+    "title": "Unit Conversion II",
     "difficulty": "Medium",
-    "id": 3535,
-    "link": "https://leetcode.com/problems/unit-conversion-ii/",
-    "title": "Unit Conversion II"
+    "link": "https://leetcode.com/problems/unit-conversion-ii/"
   },
   "3536": {
+    "id": 3536,
     "category": "Math & Geometry",
+    "title": "Maximum Product of Two Digits",
     "difficulty": "Easy",
-    "id": 3536,
-    "link": "https://leetcode.com/problems/maximum-product-of-two-digits/",
-    "title": "Maximum Product of Two Digits"
+    "link": "https://leetcode.com/problems/maximum-product-of-two-digits/"
   },
   "3537": {
+    "id": 3537,
     "category": "Array & Hashing",
+    "title": "Fill a Special Grid",
     "difficulty": "Medium",
-    "id": 3537,
-    "link": "https://leetcode.com/problems/fill-a-special-grid/",
-    "title": "Fill a Special Grid"
+    "link": "https://leetcode.com/problems/fill-a-special-grid/"
   },
   "3538": {
+    "id": 3538,
     "category": "Dynamic Programming",
+    "title": "Merge Operations for Minimum Travel Time",
     "difficulty": "Hard",
-    "id": 3538,
-    "link": "https://leetcode.com/problems/merge-operations-for-minimum-travel-time/",
-    "title": "Merge Operations for Minimum Travel Time"
+    "link": "https://leetcode.com/problems/merge-operations-for-minimum-travel-time/"
   },
   "3539": {
+    "id": 3539,
     "category": "Dynamic Programming",
+    "title": "Find Sum of Array Product of Magical Sequences",
     "difficulty": "Hard",
-    "id": 3539,
-    "link": "https://leetcode.com/problems/find-sum-of-array-product-of-magical-sequences/",
-    "title": "Find Sum of Array Product of Magical Sequences"
+    "link": "https://leetcode.com/problems/find-sum-of-array-product-of-magical-sequences/"
   },
   "3540": {
+    "id": 3540,
     "category": "Array & Hashing",
+    "title": "Minimum Time to Visit All Houses",
     "difficulty": "Medium",
-    "id": 3540,
-    "link": "https://leetcode.com/problems/minimum-time-to-visit-all-houses/",
-    "title": "Minimum Time to Visit All Houses"
+    "link": "https://leetcode.com/problems/minimum-time-to-visit-all-houses/"
   },
   "3541": {
+    "id": 3541,
     "category": "Array & Hashing",
+    "title": "Find Most Frequent Vowel and Consonant",
     "difficulty": "Easy",
-    "id": 3541,
-    "link": "https://leetcode.com/problems/find-most-frequent-vowel-and-consonant/",
-    "title": "Find Most Frequent Vowel and Consonant"
+    "link": "https://leetcode.com/problems/find-most-frequent-vowel-and-consonant/"
   },
   "3542": {
+    "id": 3542,
     "category": "Stack",
+    "title": "Minimum Operations to Convert All Elements to Zero",
     "difficulty": "Medium",
-    "id": 3542,
-    "link": "https://leetcode.com/problems/minimum-operations-to-convert-all-elements-to-zero/",
-    "title": "Minimum Operations to Convert All Elements to Zero"
+    "link": "https://leetcode.com/problems/minimum-operations-to-convert-all-elements-to-zero/"
   },
   "3543": {
+    "id": 3543,
     "category": "Graph Traversal",
+    "title": "Maximum Weighted K-Edge Path",
     "difficulty": "Medium",
-    "id": 3543,
-    "link": "https://leetcode.com/problems/maximum-weighted-k-edge-path/",
-    "title": "Maximum Weighted K-Edge Path"
+    "link": "https://leetcode.com/problems/maximum-weighted-k-edge-path/"
   },
   "3544": {
+    "id": 3544,
     "category": "Tree",
+    "title": "Subtree Inversion Sum",
     "difficulty": "Hard",
-    "id": 3544,
-    "link": "https://leetcode.com/problems/subtree-inversion-sum/",
-    "title": "Subtree Inversion Sum"
+    "link": "https://leetcode.com/problems/subtree-inversion-sum/"
   },
   "3545": {
+    "id": 3545,
     "category": "Greedy",
+    "title": "Minimum Deletions for At Most K Distinct Characters",
     "difficulty": "Easy",
-    "id": 3545,
-    "link": "https://leetcode.com/problems/minimum-deletions-for-at-most-k-distinct-characters/",
-    "title": "Minimum Deletions for At Most K Distinct Characters"
+    "link": "https://leetcode.com/problems/minimum-deletions-for-at-most-k-distinct-characters/"
   },
   "3546": {
+    "id": 3546,
     "category": "Array & Hashing",
+    "title": "Equal Sum Grid Partition I",
     "difficulty": "Medium",
-    "id": 3546,
-    "link": "https://leetcode.com/problems/equal-sum-grid-partition-i/",
-    "title": "Equal Sum Grid Partition I"
+    "link": "https://leetcode.com/problems/equal-sum-grid-partition-i/"
   },
   "3547": {
+    "id": 3547,
     "category": "Graph Traversal",
+    "title": "Maximum Sum of Edge Values in a Graph",
     "difficulty": "Hard",
-    "id": 3547,
-    "link": "https://leetcode.com/problems/maximum-sum-of-edge-values-in-a-graph/",
-    "title": "Maximum Sum of Edge Values in a Graph"
+    "link": "https://leetcode.com/problems/maximum-sum-of-edge-values-in-a-graph/"
   },
   "3548": {
+    "id": 3548,
     "category": "Array & Hashing",
+    "title": "Equal Sum Grid Partition II",
     "difficulty": "Hard",
-    "id": 3548,
-    "link": "https://leetcode.com/problems/equal-sum-grid-partition-ii/",
-    "title": "Equal Sum Grid Partition II"
+    "link": "https://leetcode.com/problems/equal-sum-grid-partition-ii/"
   },
   "3549": {
+    "id": 3549,
     "category": "Math & Geometry",
+    "title": "Multiply Two Polynomials",
     "difficulty": "Hard",
-    "id": 3549,
-    "link": "https://leetcode.com/problems/multiply-two-polynomials/",
-    "title": "Multiply Two Polynomials"
+    "link": "https://leetcode.com/problems/multiply-two-polynomials/"
   },
   "3550": {
+    "id": 3550,
     "category": "Math & Geometry",
+    "title": "Smallest Index With Digit Sum Equal to Index",
     "difficulty": "Easy",
-    "id": 3550,
-    "link": "https://leetcode.com/problems/smallest-index-with-digit-sum-equal-to-index/",
-    "title": "Smallest Index With Digit Sum Equal to Index"
+    "link": "https://leetcode.com/problems/smallest-index-with-digit-sum-equal-to-index/"
   },
   "3551": {
+    "id": 3551,
     "category": "Array & Hashing",
+    "title": "Minimum Swaps to Sort by Digit Sum",
     "difficulty": "Medium",
-    "id": 3551,
-    "link": "https://leetcode.com/problems/minimum-swaps-to-sort-by-digit-sum/",
-    "title": "Minimum Swaps to Sort by Digit Sum"
+    "link": "https://leetcode.com/problems/minimum-swaps-to-sort-by-digit-sum/"
   },
   "3552": {
+    "id": 3552,
     "category": "Graph Traversal",
+    "title": "Grid Teleportation Traversal",
     "difficulty": "Medium",
-    "id": 3552,
-    "link": "https://leetcode.com/problems/grid-teleportation-traversal/",
-    "title": "Grid Teleportation Traversal"
+    "link": "https://leetcode.com/problems/grid-teleportation-traversal/"
   },
   "3553": {
+    "id": 3553,
     "category": "Tree",
+    "title": "Minimum Weighted Subgraph With the Required Paths II",
     "difficulty": "Hard",
-    "id": 3553,
-    "link": "https://leetcode.com/problems/minimum-weighted-subgraph-with-the-required-paths-ii/",
-    "title": "Minimum Weighted Subgraph With the Required Paths II"
+    "link": "https://leetcode.com/problems/minimum-weighted-subgraph-with-the-required-paths-ii/"
   },
   "3554": {
+    "id": 3554,
     "category": "Database",
+    "title": "Find Category Recommendation Pairs",
     "difficulty": "Hard",
-    "id": 3554,
-    "link": "https://leetcode.com/problems/find-category-recommendation-pairs/",
-    "title": "Find Category Recommendation Pairs"
+    "link": "https://leetcode.com/problems/find-category-recommendation-pairs/"
   },
   "3555": {
+    "id": 3555,
     "category": "Stack",
+    "title": "Smallest Subarray to Sort in Every Sliding Window",
     "difficulty": "Medium",
-    "id": 3555,
-    "link": "https://leetcode.com/problems/smallest-subarray-to-sort-in-every-sliding-window/",
-    "title": "Smallest Subarray to Sort in Every Sliding Window"
+    "link": "https://leetcode.com/problems/smallest-subarray-to-sort-in-every-sliding-window/"
   },
   "3556": {
+    "id": 3556,
     "category": "Math & Geometry",
+    "title": "Sum of Largest Prime Substrings",
     "difficulty": "Medium",
-    "id": 3556,
-    "link": "https://leetcode.com/problems/sum-of-largest-prime-substrings/",
-    "title": "Sum of Largest Prime Substrings"
+    "link": "https://leetcode.com/problems/sum-of-largest-prime-substrings/"
   },
   "3557": {
+    "id": 3557,
     "category": "Dynamic Programming",
+    "title": "Find Maximum Number of Non Intersecting Substrings",
     "difficulty": "Medium",
-    "id": 3557,
-    "link": "https://leetcode.com/problems/find-maximum-number-of-non-intersecting-substrings/",
-    "title": "Find Maximum Number of Non Intersecting Substrings"
+    "link": "https://leetcode.com/problems/find-maximum-number-of-non-intersecting-substrings/"
   },
   "3558": {
+    "id": 3558,
     "category": "Tree",
+    "title": "Number of Ways to Assign Edge Weights I",
     "difficulty": "Medium",
-    "id": 3558,
-    "link": "https://leetcode.com/problems/number-of-ways-to-assign-edge-weights-i/",
-    "title": "Number of Ways to Assign Edge Weights I"
+    "link": "https://leetcode.com/problems/number-of-ways-to-assign-edge-weights-i/"
   },
   "3559": {
+    "id": 3559,
     "category": "Tree",
+    "title": "Number of Ways to Assign Edge Weights II",
     "difficulty": "Hard",
-    "id": 3559,
-    "link": "https://leetcode.com/problems/number-of-ways-to-assign-edge-weights-ii/",
-    "title": "Number of Ways to Assign Edge Weights II"
+    "link": "https://leetcode.com/problems/number-of-ways-to-assign-edge-weights-ii/"
   },
   "3560": {
+    "id": 3560,
     "category": "Math & Geometry",
+    "title": "Find Minimum Log Transportation Cost",
     "difficulty": "Easy",
-    "id": 3560,
-    "link": "https://leetcode.com/problems/find-minimum-log-transportation-cost/",
-    "title": "Find Minimum Log Transportation Cost"
+    "link": "https://leetcode.com/problems/find-minimum-log-transportation-cost/"
   },
   "3561": {
+    "id": 3561,
     "category": "Stack",
+    "title": "Resulting String After Adjacent Removals",
     "difficulty": "Medium",
-    "id": 3561,
-    "link": "https://leetcode.com/problems/resulting-string-after-adjacent-removals/",
-    "title": "Resulting String After Adjacent Removals"
+    "link": "https://leetcode.com/problems/resulting-string-after-adjacent-removals/"
   },
   "3562": {
+    "id": 3562,
     "category": "Tree",
+    "title": "Maximum Profit from Trading Stocks with Discounts",
     "difficulty": "Hard",
-    "id": 3562,
-    "link": "https://leetcode.com/problems/maximum-profit-from-trading-stocks-with-discounts/",
-    "title": "Maximum Profit from Trading Stocks with Discounts"
+    "link": "https://leetcode.com/problems/maximum-profit-from-trading-stocks-with-discounts/"
   },
   "3563": {
+    "id": 3563,
     "category": "Dynamic Programming",
+    "title": "Lexicographically Smallest String After Adjacent Removals",
     "difficulty": "Hard",
-    "id": 3563,
-    "link": "https://leetcode.com/problems/lexicographically-smallest-string-after-adjacent-removals/",
-    "title": "Lexicographically Smallest String After Adjacent Removals"
+    "link": "https://leetcode.com/problems/lexicographically-smallest-string-after-adjacent-removals/"
   },
   "3564": {
+    "id": 3564,
     "category": "Database",
+    "title": "Seasonal Sales Analysis",
     "difficulty": "Medium",
-    "id": 3564,
-    "link": "https://leetcode.com/problems/seasonal-sales-analysis/",
-    "title": "Seasonal Sales Analysis"
+    "link": "https://leetcode.com/problems/seasonal-sales-analysis/"
   },
   "3565": {
+    "id": 3565,
     "category": "Array & Hashing",
+    "title": "Sequential Grid Path Cover",
     "difficulty": "Medium",
-    "id": 3565,
-    "link": "https://leetcode.com/problems/sequential-grid-path-cover/",
-    "title": "Sequential Grid Path Cover"
+    "link": "https://leetcode.com/problems/sequential-grid-path-cover/"
   },
   "3566": {
+    "id": 3566,
     "category": "Bit Manipulation",
+    "title": "Partition Array into Two Equal Product Subsets",
     "difficulty": "Medium",
-    "id": 3566,
-    "link": "https://leetcode.com/problems/partition-array-into-two-equal-product-subsets/",
-    "title": "Partition Array into Two Equal Product Subsets"
+    "link": "https://leetcode.com/problems/partition-array-into-two-equal-product-subsets/"
   },
   "3567": {
+    "id": 3567,
     "category": "Array & Hashing",
+    "title": "Minimum Absolute Difference in Sliding Submatrix",
     "difficulty": "Medium",
-    "id": 3567,
-    "link": "https://leetcode.com/problems/minimum-absolute-difference-in-sliding-submatrix/",
-    "title": "Minimum Absolute Difference in Sliding Submatrix"
+    "link": "https://leetcode.com/problems/minimum-absolute-difference-in-sliding-submatrix/"
   },
   "3568": {
+    "id": 3568,
     "category": "Graph Traversal",
+    "title": "Minimum Moves to Clean the Classroom",
     "difficulty": "Medium",
-    "id": 3568,
-    "link": "https://leetcode.com/problems/minimum-moves-to-clean-the-classroom/",
-    "title": "Minimum Moves to Clean the Classroom"
+    "link": "https://leetcode.com/problems/minimum-moves-to-clean-the-classroom/"
   },
   "3569": {
+    "id": 3569,
     "category": "Tree",
+    "title": "Maximize Count of Distinct Primes After Split",
     "difficulty": "Hard",
-    "id": 3569,
-    "link": "https://leetcode.com/problems/maximize-count-of-distinct-primes-after-split/",
-    "title": "Maximize Count of Distinct Primes After Split"
+    "link": "https://leetcode.com/problems/maximize-count-of-distinct-primes-after-split/"
   },
   "3570": {
+    "id": 3570,
     "category": "Database",
+    "title": "Find Books with No Available Copies",
     "difficulty": "Easy",
-    "id": 3570,
-    "link": "https://leetcode.com/problems/find-books-with-no-available-copies/",
-    "title": "Find Books with No Available Copies"
+    "link": "https://leetcode.com/problems/find-books-with-no-available-copies/"
   },
   "3571": {
+    "id": 3571,
     "category": "Array & Hashing",
+    "title": "Find the Shortest Superstring II",
     "difficulty": "Easy",
-    "id": 3571,
-    "link": "https://leetcode.com/problems/find-the-shortest-superstring-ii/",
-    "title": "Find the Shortest Superstring II"
+    "link": "https://leetcode.com/problems/find-the-shortest-superstring-ii/"
   },
   "3572": {
+    "id": 3572,
     "category": "Heap (Priority Queue)",
+    "title": "Maximize Y‑Sum by Picking a Triplet of Distinct X‑Values",
     "difficulty": "Medium",
-    "id": 3572,
-    "link": "https://leetcode.com/problems/maximize-ysum-by-picking-a-triplet-of-distinct-xvalues/",
-    "title": "Maximize Y‑Sum by Picking a Triplet of Distinct X‑Values"
+    "link": "https://leetcode.com/problems/maximize-ysum-by-picking-a-triplet-of-distinct-xvalues/"
   },
   "3573": {
+    "id": 3573,
     "category": "Dynamic Programming",
+    "title": "Best Time to Buy and Sell Stock V",
     "difficulty": "Medium",
-    "id": 3573,
-    "link": "https://leetcode.com/problems/best-time-to-buy-and-sell-stock-v/",
-    "title": "Best Time to Buy and Sell Stock V"
+    "link": "https://leetcode.com/problems/best-time-to-buy-and-sell-stock-v/"
   },
   "3574": {
+    "id": 3574,
     "category": "Math & Geometry",
+    "title": "Maximize Subarray GCD Score",
     "difficulty": "Hard",
-    "id": 3574,
-    "link": "https://leetcode.com/problems/maximize-subarray-gcd-score/",
-    "title": "Maximize Subarray GCD Score"
+    "link": "https://leetcode.com/problems/maximize-subarray-gcd-score/"
   },
   "3575": {
+    "id": 3575,
     "category": "Tree",
+    "title": "Maximum Good Subtree Score",
     "difficulty": "Hard",
-    "id": 3575,
-    "link": "https://leetcode.com/problems/maximum-good-subtree-score/",
-    "title": "Maximum Good Subtree Score"
+    "link": "https://leetcode.com/problems/maximum-good-subtree-score/"
   },
   "3576": {
+    "id": 3576,
     "category": "Greedy",
+    "title": "Transform Array to All Equal Elements",
     "difficulty": "Medium",
-    "id": 3576,
-    "link": "https://leetcode.com/problems/transform-array-to-all-equal-elements/",
-    "title": "Transform Array to All Equal Elements"
+    "link": "https://leetcode.com/problems/transform-array-to-all-equal-elements/"
   },
   "3577": {
+    "id": 3577,
     "category": "Math & Geometry",
+    "title": "Count the Number of Computer Unlocking Permutations",
     "difficulty": "Medium",
-    "id": 3577,
-    "link": "https://leetcode.com/problems/count-the-number-of-computer-unlocking-permutations/",
-    "title": "Count the Number of Computer Unlocking Permutations"
+    "link": "https://leetcode.com/problems/count-the-number-of-computer-unlocking-permutations/"
   },
   "3578": {
+    "id": 3578,
     "category": "Dynamic Programming",
+    "title": "Count Partitions With Max-Min Difference at Most K",
     "difficulty": "Medium",
-    "id": 3578,
-    "link": "https://leetcode.com/problems/count-partitions-with-max-min-difference-at-most-k/",
-    "title": "Count Partitions With Max-Min Difference at Most K"
+    "link": "https://leetcode.com/problems/count-partitions-with-max-min-difference-at-most-k/"
   },
   "3579": {
+    "id": 3579,
     "category": "Dynamic Programming",
+    "title": "Minimum Steps to Convert String with Operations",
     "difficulty": "Hard",
-    "id": 3579,
-    "link": "https://leetcode.com/problems/minimum-steps-to-convert-string-with-operations/",
-    "title": "Minimum Steps to Convert String with Operations"
+    "link": "https://leetcode.com/problems/minimum-steps-to-convert-string-with-operations/"
   },
   "3580": {
+    "id": 3580,
     "category": "Database",
+    "title": "Find Consistently Improving Employees",
     "difficulty": "Medium",
-    "id": 3580,
-    "link": "https://leetcode.com/problems/find-consistently-improving-employees/",
-    "title": "Find Consistently Improving Employees"
+    "link": "https://leetcode.com/problems/find-consistently-improving-employees/"
   },
   "3581": {
+    "id": 3581,
     "category": "Array & Hashing",
+    "title": "Count Odd Letters from Number",
     "difficulty": "Easy",
-    "id": 3581,
-    "link": "https://leetcode.com/problems/count-odd-letters-from-number/",
-    "title": "Count Odd Letters from Number"
+    "link": "https://leetcode.com/problems/count-odd-letters-from-number/"
   },
   "3582": {
+    "id": 3582,
     "category": "Array & Hashing",
+    "title": "Generate Tag for Video Caption",
     "difficulty": "Easy",
-    "id": 3582,
-    "link": "https://leetcode.com/problems/generate-tag-for-video-caption/",
-    "title": "Generate Tag for Video Caption"
+    "link": "https://leetcode.com/problems/generate-tag-for-video-caption/"
   },
   "3583": {
+    "id": 3583,
     "category": "Array & Hashing",
+    "title": "Count Special Triplets",
     "difficulty": "Medium",
-    "id": 3583,
-    "link": "https://leetcode.com/problems/count-special-triplets/",
-    "title": "Count Special Triplets"
+    "link": "https://leetcode.com/problems/count-special-triplets/"
   },
   "3584": {
+    "id": 3584,
     "category": "Two Pointers",
+    "title": "Maximum Product of First and Last Elements of a Subsequence",
     "difficulty": "Medium",
-    "id": 3584,
-    "link": "https://leetcode.com/problems/maximum-product-of-first-and-last-elements-of-a-subsequence/",
-    "title": "Maximum Product of First and Last Elements of a Subsequence"
+    "link": "https://leetcode.com/problems/maximum-product-of-first-and-last-elements-of-a-subsequence/"
   },
   "3585": {
+    "id": 3585,
     "category": "Tree",
+    "title": "Find Weighted Median Node in Tree",
     "difficulty": "Hard",
-    "id": 3585,
-    "link": "https://leetcode.com/problems/find-weighted-median-node-in-tree/",
-    "title": "Find Weighted Median Node in Tree"
+    "link": "https://leetcode.com/problems/find-weighted-median-node-in-tree/"
   },
   "3586": {
+    "id": 3586,
     "category": "Database",
+    "title": "Find COVID Recovery Patients",
     "difficulty": "Medium",
-    "id": 3586,
-    "link": "https://leetcode.com/problems/find-covid-recovery-patients/",
-    "title": "Find COVID Recovery Patients"
+    "link": "https://leetcode.com/problems/find-covid-recovery-patients/"
   },
   "3587": {
+    "id": 3587,
     "category": "Greedy",
+    "title": "Minimum Adjacent Swaps to Alternate Parity",
     "difficulty": "Medium",
-    "id": 3587,
-    "link": "https://leetcode.com/problems/minimum-adjacent-swaps-to-alternate-parity/",
-    "title": "Minimum Adjacent Swaps to Alternate Parity"
+    "link": "https://leetcode.com/problems/minimum-adjacent-swaps-to-alternate-parity/"
   },
   "3588": {
+    "id": 3588,
     "category": "Greedy",
+    "title": "Find Maximum Area of a Triangle",
     "difficulty": "Medium",
-    "id": 3588,
-    "link": "https://leetcode.com/problems/find-maximum-area-of-a-triangle/",
-    "title": "Find Maximum Area of a Triangle"
+    "link": "https://leetcode.com/problems/find-maximum-area-of-a-triangle/"
   },
   "3589": {
+    "id": 3589,
     "category": "Sliding Window",
+    "title": "Count Prime-Gap Balanced Subarrays",
     "difficulty": "Medium",
-    "id": 3589,
-    "link": "https://leetcode.com/problems/count-prime-gap-balanced-subarrays/",
-    "title": "Count Prime-Gap Balanced Subarrays"
+    "link": "https://leetcode.com/problems/count-prime-gap-balanced-subarrays/"
   },
   "3590": {
+    "id": 3590,
     "category": "Tree",
+    "title": "Kth Smallest Path XOR Sum",
     "difficulty": "Hard",
-    "id": 3590,
-    "link": "https://leetcode.com/problems/kth-smallest-path-xor-sum/",
-    "title": "Kth Smallest Path XOR Sum"
+    "link": "https://leetcode.com/problems/kth-smallest-path-xor-sum/"
   },
   "3591": {
+    "id": 3591,
     "category": "Math & Geometry",
+    "title": "Check if Any Element Has Prime Frequency",
     "difficulty": "Easy",
-    "id": 3591,
-    "link": "https://leetcode.com/problems/check-if-any-element-has-prime-frequency/",
-    "title": "Check if Any Element Has Prime Frequency"
+    "link": "https://leetcode.com/problems/check-if-any-element-has-prime-frequency/"
   },
   "3592": {
+    "id": 3592,
     "category": "Dynamic Programming",
+    "title": "Inverse Coin Change",
     "difficulty": "Medium",
-    "id": 3592,
-    "link": "https://leetcode.com/problems/inverse-coin-change/",
-    "title": "Inverse Coin Change"
+    "link": "https://leetcode.com/problems/inverse-coin-change/"
   },
   "3593": {
+    "id": 3593,
     "category": "Tree",
+    "title": "Minimum Increments to Equalize Leaf Paths",
     "difficulty": "Medium",
-    "id": 3593,
-    "link": "https://leetcode.com/problems/minimum-increments-to-equalize-leaf-paths/",
-    "title": "Minimum Increments to Equalize Leaf Paths"
+    "link": "https://leetcode.com/problems/minimum-increments-to-equalize-leaf-paths/"
   },
   "3594": {
+    "id": 3594,
     "category": "Graph Traversal",
+    "title": "Minimum Time to Transport All Individuals",
     "difficulty": "Hard",
-    "id": 3594,
-    "link": "https://leetcode.com/problems/minimum-time-to-transport-all-individuals/",
-    "title": "Minimum Time to Transport All Individuals"
+    "link": "https://leetcode.com/problems/minimum-time-to-transport-all-individuals/"
   },
   "3595": {
+    "id": 3595,
     "category": "Bit Manipulation",
+    "title": "Once Twice",
     "difficulty": "Medium",
-    "id": 3595,
-    "link": "https://leetcode.com/problems/once-twice/",
-    "title": "Once Twice"
+    "link": "https://leetcode.com/problems/once-twice/"
   },
   "3596": {
+    "id": 3596,
     "category": "Math & Geometry",
+    "title": "Minimum Cost Path with Alternating Directions I",
     "difficulty": "Medium",
-    "id": 3596,
-    "link": "https://leetcode.com/problems/minimum-cost-path-with-alternating-directions-i/",
-    "title": "Minimum Cost Path with Alternating Directions I"
+    "link": "https://leetcode.com/problems/minimum-cost-path-with-alternating-directions-i/"
   },
   "3597": {
+    "id": 3597,
     "category": "Trie",
+    "title": "Partition String ",
     "difficulty": "Medium",
-    "id": 3597,
-    "link": "https://leetcode.com/problems/partition-string/",
-    "title": "Partition String "
+    "link": "https://leetcode.com/problems/partition-string/"
   },
   "3598": {
+    "id": 3598,
     "category": "Array & Hashing",
+    "title": "Longest Common Prefix Between Adjacent Strings After Removals",
     "difficulty": "Medium",
-    "id": 3598,
-    "link": "https://leetcode.com/problems/longest-common-prefix-between-adjacent-strings-after-removals/",
-    "title": "Longest Common Prefix Between Adjacent Strings After Removals"
+    "link": "https://leetcode.com/problems/longest-common-prefix-between-adjacent-strings-after-removals/"
   },
   "3599": {
+    "id": 3599,
     "category": "Dynamic Programming",
+    "title": "Partition Array to Minimize XOR",
     "difficulty": "Medium",
-    "id": 3599,
-    "link": "https://leetcode.com/problems/partition-array-to-minimize-xor/",
-    "title": "Partition Array to Minimize XOR"
+    "link": "https://leetcode.com/problems/partition-array-to-minimize-xor/"
   },
   "3600": {
+    "id": 3600,
     "category": "Tree",
+    "title": "Maximize Spanning Tree Stability with Upgrades",
     "difficulty": "Hard",
-    "id": 3600,
-    "link": "https://leetcode.com/problems/maximize-spanning-tree-stability-with-upgrades/",
-    "title": "Maximize Spanning Tree Stability with Upgrades"
+    "link": "https://leetcode.com/problems/maximize-spanning-tree-stability-with-upgrades/"
   },
   "3601": {
+    "id": 3601,
     "category": "Database",
+    "title": "Find Drivers with Improved Fuel Efficiency",
     "difficulty": "Medium",
-    "id": 3601,
-    "link": "https://leetcode.com/problems/find-drivers-with-improved-fuel-efficiency/",
-    "title": "Find Drivers with Improved Fuel Efficiency"
+    "link": "https://leetcode.com/problems/find-drivers-with-improved-fuel-efficiency/"
   },
   "3602": {
+    "id": 3602,
     "category": "Math & Geometry",
+    "title": "Hexadecimal and Hexatrigesimal Conversion",
     "difficulty": "Easy",
-    "id": 3602,
-    "link": "https://leetcode.com/problems/hexadecimal-and-hexatrigesimal-conversion/",
-    "title": "Hexadecimal and Hexatrigesimal Conversion"
+    "link": "https://leetcode.com/problems/hexadecimal-and-hexatrigesimal-conversion/"
   },
   "3603": {
+    "id": 3603,
     "category": "Dynamic Programming",
+    "title": "Minimum Cost Path with Alternating Directions II",
     "difficulty": "Medium",
-    "id": 3603,
-    "link": "https://leetcode.com/problems/minimum-cost-path-with-alternating-directions-ii/",
-    "title": "Minimum Cost Path with Alternating Directions II"
+    "link": "https://leetcode.com/problems/minimum-cost-path-with-alternating-directions-ii/"
   },
   "3604": {
+    "id": 3604,
     "category": "Graph Traversal",
+    "title": "Minimum Time to Reach Destination in Directed Graph",
     "difficulty": "Medium",
-    "id": 3604,
-    "link": "https://leetcode.com/problems/minimum-time-to-reach-destination-in-directed-graph/",
-    "title": "Minimum Time to Reach Destination in Directed Graph"
+    "link": "https://leetcode.com/problems/minimum-time-to-reach-destination-in-directed-graph/"
   },
   "3605": {
+    "id": 3605,
     "category": "Tree",
+    "title": "Minimum Stability Factor of Array",
     "difficulty": "Hard",
-    "id": 3605,
-    "link": "https://leetcode.com/problems/minimum-stability-factor-of-array/",
-    "title": "Minimum Stability Factor of Array"
+    "link": "https://leetcode.com/problems/minimum-stability-factor-of-array/"
   },
   "3606": {
+    "id": 3606,
     "category": "Array & Hashing",
+    "title": "Coupon Code Validator",
     "difficulty": "Easy",
-    "id": 3606,
-    "link": "https://leetcode.com/problems/coupon-code-validator/",
-    "title": "Coupon Code Validator"
+    "link": "https://leetcode.com/problems/coupon-code-validator/"
   },
   "3607": {
+    "id": 3607,
     "category": "Graph Traversal",
+    "title": "Power Grid Maintenance",
     "difficulty": "Medium",
-    "id": 3607,
-    "link": "https://leetcode.com/problems/power-grid-maintenance/",
-    "title": "Power Grid Maintenance"
+    "link": "https://leetcode.com/problems/power-grid-maintenance/"
   },
   "3608": {
+    "id": 3608,
     "category": "Graph Traversal",
+    "title": "Minimum Time for K Connected Components",
     "difficulty": "Medium",
-    "id": 3608,
-    "link": "https://leetcode.com/problems/minimum-time-for-k-connected-components/",
-    "title": "Minimum Time for K Connected Components"
+    "link": "https://leetcode.com/problems/minimum-time-for-k-connected-components/"
   },
   "3609": {
+    "id": 3609,
     "category": "Math & Geometry",
+    "title": "Minimum Moves to Reach Target in Grid",
     "difficulty": "Hard",
-    "id": 3609,
-    "link": "https://leetcode.com/problems/minimum-moves-to-reach-target-in-grid/",
-    "title": "Minimum Moves to Reach Target in Grid"
+    "link": "https://leetcode.com/problems/minimum-moves-to-reach-target-in-grid/"
   },
   "3610": {
+    "id": 3610,
     "category": "Dynamic Programming",
+    "title": "Minimum Number of Primes to Sum to Target",
     "difficulty": "Medium",
-    "id": 3610,
-    "link": "https://leetcode.com/problems/minimum-number-of-primes-to-sum-to-target/",
-    "title": "Minimum Number of Primes to Sum to Target"
+    "link": "https://leetcode.com/problems/minimum-number-of-primes-to-sum-to-target/"
   },
   "3611": {
+    "id": 3611,
     "category": "Database",
+    "title": "Find Overbooked Employees",
     "difficulty": "Medium",
-    "id": 3611,
-    "link": "https://leetcode.com/problems/find-overbooked-employees/",
-    "title": "Find Overbooked Employees"
+    "link": "https://leetcode.com/problems/find-overbooked-employees/"
   },
   "3612": {
+    "id": 3612,
     "category": "Array & Hashing",
+    "title": "Process String with Special Operations I",
     "difficulty": "Medium",
-    "id": 3612,
-    "link": "https://leetcode.com/problems/process-string-with-special-operations-i/",
-    "title": "Process String with Special Operations I"
+    "link": "https://leetcode.com/problems/process-string-with-special-operations-i/"
   },
   "3613": {
+    "id": 3613,
     "category": "Graph Traversal",
+    "title": "Minimize Maximum Component Cost",
     "difficulty": "Medium",
-    "id": 3613,
-    "link": "https://leetcode.com/problems/minimize-maximum-component-cost/",
-    "title": "Minimize Maximum Component Cost"
+    "link": "https://leetcode.com/problems/minimize-maximum-component-cost/"
   },
   "3614": {
+    "id": 3614,
     "category": "Array & Hashing",
+    "title": "Process String with Special Operations II",
     "difficulty": "Hard",
-    "id": 3614,
-    "link": "https://leetcode.com/problems/process-string-with-special-operations-ii/",
-    "title": "Process String with Special Operations II"
+    "link": "https://leetcode.com/problems/process-string-with-special-operations-ii/"
   },
   "3615": {
+    "id": 3615,
     "category": "Graph Traversal",
+    "title": "Longest Palindromic Path in Graph",
     "difficulty": "Hard",
-    "id": 3615,
-    "link": "https://leetcode.com/problems/longest-palindromic-path-in-graph/",
-    "title": "Longest Palindromic Path in Graph"
+    "link": "https://leetcode.com/problems/longest-palindromic-path-in-graph/"
   },
   "3616": {
+    "id": 3616,
     "category": "Array & Hashing",
+    "title": "Number of Student Replacements",
     "difficulty": "Medium",
-    "id": 3616,
-    "link": "https://leetcode.com/problems/number-of-student-replacements/",
-    "title": "Number of Student Replacements"
+    "link": "https://leetcode.com/problems/number-of-student-replacements/"
   },
   "3617": {
+    "id": 3617,
     "category": "Array & Hashing",
+    "title": "Find Students with Study Spiral Pattern",
     "difficulty": "Hard",
-    "id": 3617,
-    "link": "https://leetcode.com/problems/find-students-with-study-spiral-pattern/",
-    "title": "Find Students with Study Spiral Pattern"
+    "link": "https://leetcode.com/problems/find-students-with-study-spiral-pattern/"
   },
   "3618": {
+    "id": 3618,
     "category": "Math & Geometry",
+    "title": "Split Array by Prime Indices",
     "difficulty": "Medium",
-    "id": 3618,
-    "link": "https://leetcode.com/problems/split-array-by-prime-indices/",
-    "title": "Split Array by Prime Indices"
+    "link": "https://leetcode.com/problems/split-array-by-prime-indices/"
   },
   "3619": {
+    "id": 3619,
     "category": "Graph Traversal",
+    "title": "Count Islands With Total Value Divisible by K",
     "difficulty": "Medium",
-    "id": 3619,
-    "link": "https://leetcode.com/problems/count-islands-with-total-value-divisible-by-k/",
-    "title": "Count Islands With Total Value Divisible by K"
+    "link": "https://leetcode.com/problems/count-islands-with-total-value-divisible-by-k/"
   },
   "3620": {
+    "id": 3620,
     "category": "Graph Traversal",
+    "title": "Network Recovery Pathways",
     "difficulty": "Hard",
-    "id": 3620,
-    "link": "https://leetcode.com/problems/network-recovery-pathways/",
-    "title": "Network Recovery Pathways"
+    "link": "https://leetcode.com/problems/network-recovery-pathways/"
   },
   "3621": {
+    "id": 3621,
     "category": "Dynamic Programming",
+    "title": "Number of Integers With Popcount-Depth Equal to K I",
     "difficulty": "Hard",
-    "id": 3621,
-    "link": "https://leetcode.com/problems/number-of-integers-with-popcount-depth-equal-to-k-i/",
-    "title": "Number of Integers With Popcount-Depth Equal to K I"
+    "link": "https://leetcode.com/problems/number-of-integers-with-popcount-depth-equal-to-k-i/"
   },
   "3622": {
+    "id": 3622,
     "category": "Math & Geometry",
+    "title": "Check Divisibility by Digit Sum and Product",
     "difficulty": "Easy",
-    "id": 3622,
-    "link": "https://leetcode.com/problems/check-divisibility-by-digit-sum-and-product/",
-    "title": "Check Divisibility by Digit Sum and Product"
+    "link": "https://leetcode.com/problems/check-divisibility-by-digit-sum-and-product/"
   },
   "3623": {
+    "id": 3623,
     "category": "Math & Geometry",
+    "title": "Count Number of Trapezoids I",
     "difficulty": "Medium",
-    "id": 3623,
-    "link": "https://leetcode.com/problems/count-number-of-trapezoids-i/",
-    "title": "Count Number of Trapezoids I"
+    "link": "https://leetcode.com/problems/count-number-of-trapezoids-i/"
   },
   "3624": {
+    "id": 3624,
     "category": "Tree",
+    "title": "Number of Integers With Popcount-Depth Equal to K II",
     "difficulty": "Hard",
-    "id": 3624,
-    "link": "https://leetcode.com/problems/number-of-integers-with-popcount-depth-equal-to-k-ii/",
-    "title": "Number of Integers With Popcount-Depth Equal to K II"
+    "link": "https://leetcode.com/problems/number-of-integers-with-popcount-depth-equal-to-k-ii/"
   },
   "3625": {
+    "id": 3625,
     "category": "Math & Geometry",
+    "title": "Count Number of Trapezoids II",
     "difficulty": "Hard",
-    "id": 3625,
-    "link": "https://leetcode.com/problems/count-number-of-trapezoids-ii/",
-    "title": "Count Number of Trapezoids II"
+    "link": "https://leetcode.com/problems/count-number-of-trapezoids-ii/"
   },
   "3626": {
+    "id": 3626,
     "category": "Array & Hashing",
+    "title": "Find Stores with Inventory Imbalance",
     "difficulty": "Medium",
-    "id": 3626,
-    "link": "https://leetcode.com/problems/find-stores-with-inventory-imbalance/",
-    "title": "Find Stores with Inventory Imbalance"
+    "link": "https://leetcode.com/problems/find-stores-with-inventory-imbalance/"
   },
   "3627": {
+    "id": 3627,
     "category": "Greedy",
+    "title": "Maximum Median Sum of Subsequences of Size 3",
     "difficulty": "Medium",
-    "id": 3627,
-    "link": "https://leetcode.com/problems/maximum-median-sum-of-subsequences-of-size-3/",
-    "title": "Maximum Median Sum of Subsequences of Size 3"
+    "link": "https://leetcode.com/problems/maximum-median-sum-of-subsequences-of-size-3/"
   },
   "3628": {
+    "id": 3628,
     "category": "Dynamic Programming",
+    "title": "Maximum Number of Subsequences After One Inserting",
     "difficulty": "Medium",
-    "id": 3628,
-    "link": "https://leetcode.com/problems/maximum-number-of-subsequences-after-one-inserting/",
-    "title": "Maximum Number of Subsequences After One Inserting"
+    "link": "https://leetcode.com/problems/maximum-number-of-subsequences-after-one-inserting/"
   },
   "3629": {
+    "id": 3629,
     "category": "Graph Traversal",
+    "title": "Minimum Jumps to Reach End via Prime Teleportation",
     "difficulty": "Medium",
-    "id": 3629,
-    "link": "https://leetcode.com/problems/minimum-jumps-to-reach-end-via-prime-teleportation/",
-    "title": "Minimum Jumps to Reach End via Prime Teleportation"
+    "link": "https://leetcode.com/problems/minimum-jumps-to-reach-end-via-prime-teleportation/"
   },
   "3630": {
+    "id": 3630,
     "category": "Bit Manipulation",
+    "title": "Partition Array for Maximum XOR and AND",
     "difficulty": "Hard",
-    "id": 3630,
-    "link": "https://leetcode.com/problems/partition-array-for-maximum-xor-and-and/",
-    "title": "Partition Array for Maximum XOR and AND"
+    "link": "https://leetcode.com/problems/partition-array-for-maximum-xor-and-and/"
   },
   "3631": {
+    "id": 3631,
     "category": "Array & Hashing",
+    "title": "Sort Threats by Severity and Exploitability",
     "difficulty": "Medium",
-    "id": 3631,
-    "link": "https://leetcode.com/problems/sort-threats-by-severity-and-exploitability/",
-    "title": "Sort Threats by Severity and Exploitability"
+    "link": "https://leetcode.com/problems/sort-threats-by-severity-and-exploitability/"
   },
   "3632": {
+    "id": 3632,
     "category": "Trie",
+    "title": "Subarrays with XOR at Least K",
     "difficulty": "Hard",
-    "id": 3632,
-    "link": "https://leetcode.com/problems/subarrays-with-xor-at-least-k/",
-    "title": "Subarrays with XOR at Least K"
+    "link": "https://leetcode.com/problems/subarrays-with-xor-at-least-k/"
   },
   "3633": {
+    "id": 3633,
     "category": "Binary Search",
+    "title": "Earliest Finish Time for Land and Water Rides I",
     "difficulty": "Easy",
-    "id": 3633,
-    "link": "https://leetcode.com/problems/earliest-finish-time-for-land-and-water-rides-i/",
-    "title": "Earliest Finish Time for Land and Water Rides I"
+    "link": "https://leetcode.com/problems/earliest-finish-time-for-land-and-water-rides-i/"
   },
   "3634": {
+    "id": 3634,
     "category": "Sliding Window",
+    "title": "Minimum Removals to Balance Array",
     "difficulty": "Medium",
-    "id": 3634,
-    "link": "https://leetcode.com/problems/minimum-removals-to-balance-array/",
-    "title": "Minimum Removals to Balance Array"
+    "link": "https://leetcode.com/problems/minimum-removals-to-balance-array/"
   },
   "3635": {
+    "id": 3635,
     "category": "Binary Search",
+    "title": "Earliest Finish Time for Land and Water Rides II",
     "difficulty": "Medium",
-    "id": 3635,
-    "link": "https://leetcode.com/problems/earliest-finish-time-for-land-and-water-rides-ii/",
-    "title": "Earliest Finish Time for Land and Water Rides II"
+    "link": "https://leetcode.com/problems/earliest-finish-time-for-land-and-water-rides-ii/"
   },
   "3636": {
+    "id": 3636,
     "category": "Binary Search",
+    "title": "Threshold Majority Queries",
     "difficulty": "Hard",
-    "id": 3636,
-    "link": "https://leetcode.com/problems/threshold-majority-queries/",
-    "title": "Threshold Majority Queries"
+    "link": "https://leetcode.com/problems/threshold-majority-queries/"
   },
   "3637": {
+    "id": 3637,
     "category": "Array & Hashing",
+    "title": "Trionic Array I",
     "difficulty": "Easy",
-    "id": 3637,
-    "link": "https://leetcode.com/problems/trionic-array-i/",
-    "title": "Trionic Array I"
+    "link": "https://leetcode.com/problems/trionic-array-i/"
   },
   "3638": {
+    "id": 3638,
     "category": "Dynamic Programming",
+    "title": "Maximum Balanced Shipments",
     "difficulty": "Medium",
-    "id": 3638,
-    "link": "https://leetcode.com/problems/maximum-balanced-shipments/",
-    "title": "Maximum Balanced Shipments"
+    "link": "https://leetcode.com/problems/maximum-balanced-shipments/"
   },
   "3639": {
+    "id": 3639,
     "category": "Binary Search",
+    "title": "Minimum Time to Activate String",
     "difficulty": "Medium",
-    "id": 3639,
-    "link": "https://leetcode.com/problems/minimum-time-to-activate-string/",
-    "title": "Minimum Time to Activate String"
+    "link": "https://leetcode.com/problems/minimum-time-to-activate-string/"
   },
   "3640": {
+    "id": 3640,
     "category": "Dynamic Programming",
+    "title": "Trionic Array II",
     "difficulty": "Hard",
-    "id": 3640,
-    "link": "https://leetcode.com/problems/trionic-array-ii/",
-    "title": "Trionic Array II"
+    "link": "https://leetcode.com/problems/trionic-array-ii/"
   },
   "3641": {
-    "category": "Array & Hashing",
-    "difficulty": "Medium",
     "id": 3641,
-    "link": "https://leetcode.com/problems/longest-semi-repeating-subarray/",
-    "title": "Longest Semi-Repeating Subarray"
+    "category": "Sliding Window",
+    "title": "Longest Semi-Repeating Subarray",
+    "difficulty": "Medium",
+    "link": "https://leetcode.com/problems/longest-semi-repeating-subarray/"
   },
   "3642": {
+    "id": 3642,
     "category": "Array & Hashing",
+    "title": "Find Books with Polarized Opinions",
     "difficulty": "Easy",
-    "id": 3642,
-    "link": "https://leetcode.com/problems/find-books-with-polarized-opinions/",
-    "title": "Find Books with Polarized Opinions"
+    "link": "https://leetcode.com/problems/find-books-with-polarized-opinions/"
   },
   "3643": {
+    "id": 3643,
     "category": "Two Pointers",
+    "title": "Flip Square Submatrix Vertically",
     "difficulty": "Easy",
-    "id": 3643,
-    "link": "https://leetcode.com/problems/flip-square-submatrix-vertically/",
-    "title": "Flip Square Submatrix Vertically"
+    "link": "https://leetcode.com/problems/flip-square-submatrix-vertically/"
   },
   "3644": {
+    "id": 3644,
     "category": "Bit Manipulation",
+    "title": "Maximum K to Sort a Permutation",
     "difficulty": "Medium",
-    "id": 3644,
-    "link": "https://leetcode.com/problems/maximum-k-to-sort-a-permutation/",
-    "title": "Maximum K to Sort a Permutation"
+    "link": "https://leetcode.com/problems/maximum-k-to-sort-a-permutation/"
   },
   "3645": {
+    "id": 3645,
     "category": "Heap (Priority Queue)",
+    "title": "Maximum Total from Optimal Activation Order",
     "difficulty": "Medium",
-    "id": 3645,
-    "link": "https://leetcode.com/problems/maximum-total-from-optimal-activation-order/",
-    "title": "Maximum Total from Optimal Activation Order"
+    "link": "https://leetcode.com/problems/maximum-total-from-optimal-activation-order/"
   },
   "3646": {
+    "id": 3646,
     "category": "Backtracking",
+    "title": "Next Special Palindrome Number",
     "difficulty": "Hard",
-    "id": 3646,
-    "link": "https://leetcode.com/problems/next-special-palindrome-number/",
-    "title": "Next Special Palindrome Number"
+    "link": "https://leetcode.com/problems/next-special-palindrome-number/"
   },
   "3647": {
+    "id": 3647,
     "category": "Dynamic Programming",
+    "title": "Maximum Weight in Two Bags",
     "difficulty": "Medium",
-    "id": 3647,
-    "link": "https://leetcode.com/problems/maximum-weight-in-two-bags/",
-    "title": "Maximum Weight in Two Bags"
+    "link": "https://leetcode.com/problems/maximum-weight-in-two-bags/"
   },
   "3648": {
+    "id": 3648,
     "category": "Math & Geometry",
+    "title": "Minimum Sensors to Cover Grid",
     "difficulty": "Medium",
-    "id": 3648,
-    "link": "https://leetcode.com/problems/minimum-sensors-to-cover-grid/",
-    "title": "Minimum Sensors to Cover Grid"
+    "link": "https://leetcode.com/problems/minimum-sensors-to-cover-grid/"
   },
   "3649": {
+    "id": 3649,
     "category": "Math & Geometry",
+    "title": "Number of Perfect Pairs",
     "difficulty": "Medium",
-    "id": 3649,
-    "link": "https://leetcode.com/problems/number-of-perfect-pairs/",
-    "title": "Number of Perfect Pairs"
+    "link": "https://leetcode.com/problems/number-of-perfect-pairs/"
   },
   "3650": {
+    "id": 3650,
     "category": "Graph Traversal",
+    "title": "Minimum Cost Path with Edge Reversals",
     "difficulty": "Medium",
-    "id": 3650,
-    "link": "https://leetcode.com/problems/minimum-cost-path-with-edge-reversals/",
-    "title": "Minimum Cost Path with Edge Reversals"
+    "link": "https://leetcode.com/problems/minimum-cost-path-with-edge-reversals/"
   },
   "3651": {
+    "id": 3651,
     "category": "Dynamic Programming",
+    "title": "Minimum Cost Path with Teleportations",
     "difficulty": "Hard",
-    "id": 3651,
-    "link": "https://leetcode.com/problems/minimum-cost-path-with-teleportations/",
-    "title": "Minimum Cost Path with Teleportations"
+    "link": "https://leetcode.com/problems/minimum-cost-path-with-teleportations/"
   },
   "3652": {
+    "id": 3652,
     "category": "Sliding Window",
+    "title": "Best Time to Buy and Sell Stock using Strategy",
     "difficulty": "Medium",
-    "id": 3652,
-    "link": "https://leetcode.com/problems/best-time-to-buy-and-sell-stock-using-strategy/",
-    "title": "Best Time to Buy and Sell Stock using Strategy"
+    "link": "https://leetcode.com/problems/best-time-to-buy-and-sell-stock-using-strategy/"
   },
   "3653": {
+    "id": 3653,
     "category": "Array & Hashing",
+    "title": "XOR After Range Multiplication Queries I",
     "difficulty": "Medium",
-    "id": 3653,
-    "link": "https://leetcode.com/problems/xor-after-range-multiplication-queries-i/",
-    "title": "XOR After Range Multiplication Queries I"
+    "link": "https://leetcode.com/problems/xor-after-range-multiplication-queries-i/"
   },
   "3654": {
+    "id": 3654,
     "category": "Dynamic Programming",
+    "title": "Minimum Sum After Divisible Sum Deletions",
     "difficulty": "Medium",
-    "id": 3654,
-    "link": "https://leetcode.com/problems/minimum-sum-after-divisible-sum-deletions/",
-    "title": "Minimum Sum After Divisible Sum Deletions"
+    "link": "https://leetcode.com/problems/minimum-sum-after-divisible-sum-deletions/"
   },
   "3655": {
+    "id": 3655,
     "category": "Array & Hashing",
+    "title": "XOR After Range Multiplication Queries II",
     "difficulty": "Hard",
-    "id": 3655,
-    "link": "https://leetcode.com/problems/xor-after-range-multiplication-queries-ii/",
-    "title": "XOR After Range Multiplication Queries II"
+    "link": "https://leetcode.com/problems/xor-after-range-multiplication-queries-ii/"
   },
   "3656": {
+    "id": 3656,
     "category": "Graph Traversal",
+    "title": "Determine if a Simple Graph Exists",
     "difficulty": "Medium",
-    "id": 3656,
-    "link": "https://leetcode.com/problems/determine-if-a-simple-graph-exists/",
-    "title": "Determine if a Simple Graph Exists"
+    "link": "https://leetcode.com/problems/determine-if-a-simple-graph-exists/"
   },
   "3657": {
+    "id": 3657,
     "category": "Array & Hashing",
+    "title": "Find Loyal Customers",
     "difficulty": "Medium",
-    "id": 3657,
-    "link": "https://leetcode.com/problems/find-loyal-customers/",
-    "title": "Find Loyal Customers"
+    "link": "https://leetcode.com/problems/find-loyal-customers/"
   },
   "3658": {
+    "id": 3658,
     "category": "Math & Geometry",
+    "title": "GCD of Odd and Even Sums",
     "difficulty": "Easy",
-    "id": 3658,
-    "link": "https://leetcode.com/problems/gcd-of-odd-and-even-sums/",
-    "title": "GCD of Odd and Even Sums"
+    "link": "https://leetcode.com/problems/gcd-of-odd-and-even-sums/"
   },
   "3659": {
+    "id": 3659,
     "category": "Array & Hashing",
+    "title": "Partition Array Into K-Distinct Groups",
     "difficulty": "Medium",
-    "id": 3659,
-    "link": "https://leetcode.com/problems/partition-array-into-k-distinct-groups/",
-    "title": "Partition Array Into K-Distinct Groups"
+    "link": "https://leetcode.com/problems/partition-array-into-k-distinct-groups/"
   },
   "3660": {
+    "id": 3660,
     "category": "Dynamic Programming",
+    "title": "Jump Game IX",
     "difficulty": "Medium",
-    "id": 3660,
-    "link": "https://leetcode.com/problems/jump-game-ix/",
-    "title": "Jump Game IX"
+    "link": "https://leetcode.com/problems/jump-game-ix/"
   },
   "3661": {
+    "id": 3661,
     "category": "Dynamic Programming",
+    "title": "Maximum Walls Destroyed by Robots",
     "difficulty": "Hard",
-    "id": 3661,
-    "link": "https://leetcode.com/problems/maximum-walls-destroyed-by-robots/",
-    "title": "Maximum Walls Destroyed by Robots"
+    "link": "https://leetcode.com/problems/maximum-walls-destroyed-by-robots/"
   },
   "3662": {
+    "id": 3662,
     "category": "Array & Hashing",
+    "title": "Filter Characters by Frequency",
     "difficulty": "Easy",
-    "id": 3662,
-    "link": "https://leetcode.com/problems/filter-characters-by-frequency/",
-    "title": "Filter Characters by Frequency"
+    "link": "https://leetcode.com/problems/filter-characters-by-frequency/"
   },
   "3663": {
+    "id": 3663,
     "category": "Math & Geometry",
+    "title": "Find The Least Frequent Digit",
     "difficulty": "Easy",
-    "id": 3663,
-    "link": "https://leetcode.com/problems/find-the-least-frequent-digit/",
-    "title": "Find The Least Frequent Digit"
+    "link": "https://leetcode.com/problems/find-the-least-frequent-digit/"
   },
   "3664": {
+    "id": 3664,
     "category": "Array & Hashing",
+    "title": "Two-Letter Card Game",
     "difficulty": "Medium",
-    "id": 3664,
-    "link": "https://leetcode.com/problems/two-letter-card-game/",
-    "title": "Two-Letter Card Game"
+    "link": "https://leetcode.com/problems/two-letter-card-game/"
   },
   "3665": {
+    "id": 3665,
     "category": "Dynamic Programming",
+    "title": "Twisted Mirror Path Count",
     "difficulty": "Medium",
-    "id": 3665,
-    "link": "https://leetcode.com/problems/twisted-mirror-path-count/",
-    "title": "Twisted Mirror Path Count"
+    "link": "https://leetcode.com/problems/twisted-mirror-path-count/"
   },
   "3666": {
+    "id": 3666,
     "category": "Graph Traversal",
+    "title": "Minimum Operations to Equalize Binary String",
     "difficulty": "Hard",
-    "id": 3666,
-    "link": "https://leetcode.com/problems/minimum-operations-to-equalize-binary-string/",
-    "title": "Minimum Operations to Equalize Binary String"
+    "link": "https://leetcode.com/problems/minimum-operations-to-equalize-binary-string/"
   },
   "3667": {
+    "id": 3667,
     "category": "Math & Geometry",
+    "title": "Sort Array By Absolute Value",
     "difficulty": "Easy",
-    "id": 3667,
-    "link": "https://leetcode.com/problems/sort-array-by-absolute-value/",
-    "title": "Sort Array By Absolute Value"
+    "link": "https://leetcode.com/problems/sort-array-by-absolute-value/"
   },
   "3668": {
+    "id": 3668,
     "category": "Array & Hashing",
+    "title": "Restore Finishing Order",
     "difficulty": "Easy",
-    "id": 3668,
-    "link": "https://leetcode.com/problems/restore-finishing-order/",
-    "title": "Restore Finishing Order"
+    "link": "https://leetcode.com/problems/restore-finishing-order/"
   },
   "3669": {
+    "id": 3669,
     "category": "Backtracking",
+    "title": "Balanced K-Factor Decomposition",
     "difficulty": "Medium",
-    "id": 3669,
-    "link": "https://leetcode.com/problems/balanced-k-factor-decomposition/",
-    "title": "Balanced K-Factor Decomposition"
+    "link": "https://leetcode.com/problems/balanced-k-factor-decomposition/"
   },
   "3670": {
+    "id": 3670,
     "category": "Dynamic Programming",
+    "title": "Maximum Product of Two Integers With No Common Bits",
     "difficulty": "Medium",
-    "id": 3670,
-    "link": "https://leetcode.com/problems/maximum-product-of-two-integers-with-no-common-bits/",
-    "title": "Maximum Product of Two Integers With No Common Bits"
+    "link": "https://leetcode.com/problems/maximum-product-of-two-integers-with-no-common-bits/"
   },
   "3671": {
+    "id": 3671,
     "category": "Tree",
+    "title": "Sum of Beautiful Subsequences",
     "difficulty": "Hard",
-    "id": 3671,
-    "link": "https://leetcode.com/problems/sum-of-beautiful-subsequences/",
-    "title": "Sum of Beautiful Subsequences"
+    "link": "https://leetcode.com/problems/sum-of-beautiful-subsequences/"
   },
   "3672": {
+    "id": 3672,
     "category": "Sliding Window",
+    "title": "Sum of Weighted Modes in Subarrays",
     "difficulty": "Medium",
-    "id": 3672,
-    "link": "https://leetcode.com/problems/sum-of-weighted-modes-in-subarrays/",
-    "title": "Sum of Weighted Modes in Subarrays"
+    "link": "https://leetcode.com/problems/sum-of-weighted-modes-in-subarrays/"
   },
   "3673": {
+    "id": 3673,
     "category": "Array & Hashing",
+    "title": "Find Zombie Sessions",
     "difficulty": "Hard",
-    "id": 3673,
-    "link": "https://leetcode.com/problems/find-zombie-sessions/",
-    "title": "Find Zombie Sessions"
+    "link": "https://leetcode.com/problems/find-zombie-sessions/"
   },
   "3674": {
+    "id": 3674,
     "category": "Bit Manipulation",
+    "title": "Minimum Operations to Equalize Array",
     "difficulty": "Easy",
-    "id": 3674,
-    "link": "https://leetcode.com/problems/minimum-operations-to-equalize-array/",
-    "title": "Minimum Operations to Equalize Array"
+    "link": "https://leetcode.com/problems/minimum-operations-to-equalize-array/"
   },
   "3675": {
+    "id": 3675,
     "category": "Greedy",
+    "title": "Minimum Operations to Transform String",
     "difficulty": "Medium",
-    "id": 3675,
-    "link": "https://leetcode.com/problems/minimum-operations-to-transform-string/",
-    "title": "Minimum Operations to Transform String"
+    "link": "https://leetcode.com/problems/minimum-operations-to-transform-string/"
   },
   "3676": {
+    "id": 3676,
     "category": "Stack",
+    "title": "Count Bowl Subarrays",
     "difficulty": "Medium",
-    "id": 3676,
-    "link": "https://leetcode.com/problems/count-bowl-subarrays/",
-    "title": "Count Bowl Subarrays"
+    "link": "https://leetcode.com/problems/count-bowl-subarrays/"
   },
   "3677": {
+    "id": 3677,
     "category": "Bit Manipulation",
+    "title": "Count Binary Palindromic Numbers",
     "difficulty": "Hard",
-    "id": 3677,
-    "link": "https://leetcode.com/problems/count-binary-palindromic-numbers/",
-    "title": "Count Binary Palindromic Numbers"
+    "link": "https://leetcode.com/problems/count-binary-palindromic-numbers/"
   },
   "3678": {
+    "id": 3678,
     "category": "Array & Hashing",
+    "title": "Smallest Absent Positive Greater Than Average",
     "difficulty": "Easy",
-    "id": 3678,
-    "link": "https://leetcode.com/problems/smallest-absent-positive-greater-than-average/",
-    "title": "Smallest Absent Positive Greater Than Average"
+    "link": "https://leetcode.com/problems/smallest-absent-positive-greater-than-average/"
   },
   "3679": {
+    "id": 3679,
     "category": "Sliding Window",
+    "title": " Minimum Discards to Balance Inventory",
     "difficulty": "Medium",
-    "id": 3679,
-    "link": "https://leetcode.com/problems/minimum-discards-to-balance-inventory/",
-    "title": " Minimum Discards to Balance Inventory"
+    "link": "https://leetcode.com/problems/minimum-discards-to-balance-inventory/"
   },
   "3680": {
+    "id": 3680,
     "category": "Greedy",
+    "title": "Generate Schedule",
     "difficulty": "Medium",
-    "id": 3680,
-    "link": "https://leetcode.com/problems/generate-schedule/",
-    "title": "Generate Schedule"
+    "link": "https://leetcode.com/problems/generate-schedule/"
   },
   "3681": {
+    "id": 3681,
     "category": "Bit Manipulation",
+    "title": "Maximum XOR of Subsequences",
     "difficulty": "Hard",
-    "id": 3681,
-    "link": "https://leetcode.com/problems/maximum-xor-of-subsequences/",
-    "title": "Maximum XOR of Subsequences"
+    "link": "https://leetcode.com/problems/maximum-xor-of-subsequences/"
   },
   "3682": {
+    "id": 3682,
     "category": "Array & Hashing",
+    "title": "Minimum Index Sum of Common Elements",
     "difficulty": "Medium",
-    "id": 3682,
-    "link": "https://leetcode.com/problems/minimum-index-sum-of-common-elements/",
-    "title": "Minimum Index Sum of Common Elements"
+    "link": "https://leetcode.com/problems/minimum-index-sum-of-common-elements/"
   },
   "3683": {
+    "id": 3683,
     "category": "Array & Hashing",
+    "title": "Earliest Time to Finish One Task",
     "difficulty": "Easy",
-    "id": 3683,
-    "link": "https://leetcode.com/problems/earliest-time-to-finish-one-task/",
-    "title": "Earliest Time to Finish One Task"
+    "link": "https://leetcode.com/problems/earliest-time-to-finish-one-task/"
   },
   "3684": {
+    "id": 3684,
     "category": "Greedy",
+    "title": "Maximize Sum of At Most K Distinct Elements",
     "difficulty": "Easy",
-    "id": 3684,
-    "link": "https://leetcode.com/problems/maximize-sum-of-at-most-k-distinct-elements/",
-    "title": "Maximize Sum of At Most K Distinct Elements"
+    "link": "https://leetcode.com/problems/maximize-sum-of-at-most-k-distinct-elements/"
   },
   "3685": {
+    "id": 3685,
     "category": "Dynamic Programming",
+    "title": "Subsequence Sum After Capping Elements",
     "difficulty": "Medium",
-    "id": 3685,
-    "link": "https://leetcode.com/problems/subsequence-sum-after-capping-elements/",
-    "title": "Subsequence Sum After Capping Elements"
+    "link": "https://leetcode.com/problems/subsequence-sum-after-capping-elements/"
   },
   "3686": {
+    "id": 3686,
     "category": "Dynamic Programming",
+    "title": "Number of Stable Subsequences",
     "difficulty": "Hard",
-    "id": 3686,
-    "link": "https://leetcode.com/problems/number-of-stable-subsequences/",
-    "title": "Number of Stable Subsequences"
+    "link": "https://leetcode.com/problems/number-of-stable-subsequences/"
   },
   "3687": {
+    "id": 3687,
     "category": "Array & Hashing",
+    "title": "Library Late Fee Calculator",
     "difficulty": "Easy",
-    "id": 3687,
-    "link": "https://leetcode.com/problems/library-late-fee-calculator/",
-    "title": "Library Late Fee Calculator"
+    "link": "https://leetcode.com/problems/library-late-fee-calculator/"
   },
   "3688": {
+    "id": 3688,
     "category": "Bit Manipulation",
+    "title": "Bitwise OR of Even Numbers in an Array",
     "difficulty": "Easy",
-    "id": 3688,
-    "link": "https://leetcode.com/problems/bitwise-or-of-even-numbers-in-an-array/",
-    "title": "Bitwise OR of Even Numbers in an Array"
+    "link": "https://leetcode.com/problems/bitwise-or-of-even-numbers-in-an-array/"
   },
   "3689": {
+    "id": 3689,
     "category": "Greedy",
+    "title": "Maximum Total Subarray Value I",
     "difficulty": "Medium",
-    "id": 3689,
-    "link": "https://leetcode.com/problems/maximum-total-subarray-value-i/",
-    "title": "Maximum Total Subarray Value I"
+    "link": "https://leetcode.com/problems/maximum-total-subarray-value-i/"
   },
   "3690": {
+    "id": 3690,
     "category": "Graph Traversal",
+    "title": "Split and Merge Array Transformation",
     "difficulty": "Medium",
-    "id": 3690,
-    "link": "https://leetcode.com/problems/split-and-merge-array-transformation/",
-    "title": "Split and Merge Array Transformation"
+    "link": "https://leetcode.com/problems/split-and-merge-array-transformation/"
   },
   "3691": {
+    "id": 3691,
     "category": "Tree",
+    "title": "Maximum Total Subarray Value II",
     "difficulty": "Hard",
-    "id": 3691,
-    "link": "https://leetcode.com/problems/maximum-total-subarray-value-ii/",
-    "title": "Maximum Total Subarray Value II"
+    "link": "https://leetcode.com/problems/maximum-total-subarray-value-ii/"
   },
   "3692": {
+    "id": 3692,
     "category": "Array & Hashing",
+    "title": "Majority Frequency Characters",
     "difficulty": "Easy",
-    "id": 3692,
-    "link": "https://leetcode.com/problems/majority-frequency-characters/",
-    "title": "Majority Frequency Characters"
+    "link": "https://leetcode.com/problems/majority-frequency-characters/"
   },
   "3693": {
+    "id": 3693,
     "category": "Dynamic Programming",
+    "title": "Climbing Stairs II",
     "difficulty": "Medium",
-    "id": 3693,
-    "link": "https://leetcode.com/problems/climbing-stairs-ii/",
-    "title": "Climbing Stairs II"
+    "link": "https://leetcode.com/problems/climbing-stairs-ii/"
   },
   "3694": {
+    "id": 3694,
     "category": "Sliding Window",
+    "title": "Distinct Points Reachable After Substring Removal",
     "difficulty": "Medium",
-    "id": 3694,
-    "link": "https://leetcode.com/problems/distinct-points-reachable-after-substring-removal/",
-    "title": "Distinct Points Reachable After Substring Removal"
+    "link": "https://leetcode.com/problems/distinct-points-reachable-after-substring-removal/"
   },
   "3695": {
+    "id": 3695,
     "category": "Graph Traversal",
+    "title": "Maximize Alternating Sum Using Swaps",
     "difficulty": "Hard",
-    "id": 3695,
-    "link": "https://leetcode.com/problems/maximize-alternating-sum-using-swaps/",
-    "title": "Maximize Alternating Sum Using Swaps"
+    "link": "https://leetcode.com/problems/maximize-alternating-sum-using-swaps/"
   },
   "3696": {
+    "id": 3696,
     "category": "Array & Hashing",
+    "title": "Maximum Distance Between Unequal Words in Array I",
     "difficulty": "Easy",
-    "id": 3696,
-    "link": "https://leetcode.com/problems/maximum-distance-between-unequal-words-in-array-i/",
-    "title": "Maximum Distance Between Unequal Words in Array I"
+    "link": "https://leetcode.com/problems/maximum-distance-between-unequal-words-in-array-i/"
   },
   "3697": {
+    "id": 3697,
     "category": "Math & Geometry",
+    "title": "Compute Decimal Representation",
     "difficulty": "Easy",
-    "id": 3697,
-    "link": "https://leetcode.com/problems/compute-decimal-representation/",
-    "title": "Compute Decimal Representation"
+    "link": "https://leetcode.com/problems/compute-decimal-representation/"
   },
   "3698": {
+    "id": 3698,
     "category": "Array & Hashing",
+    "title": "Split Array With Minimum Difference",
     "difficulty": "Medium",
-    "id": 3698,
-    "link": "https://leetcode.com/problems/split-array-with-minimum-difference/",
-    "title": "Split Array With Minimum Difference"
+    "link": "https://leetcode.com/problems/split-array-with-minimum-difference/"
   },
   "3699": {
+    "id": 3699,
     "category": "Dynamic Programming",
+    "title": "Number of ZigZag Arrays I",
     "difficulty": "Hard",
-    "id": 3699,
-    "link": "https://leetcode.com/problems/number-of-zigzag-arrays-i/",
-    "title": "Number of ZigZag Arrays I"
+    "link": "https://leetcode.com/problems/number-of-zigzag-arrays-i/"
   },
   "3700": {
+    "id": 3700,
     "category": "Dynamic Programming",
+    "title": "Number of ZigZag Arrays II",
     "difficulty": "Hard",
-    "id": 3700,
-    "link": "https://leetcode.com/problems/number-of-zigzag-arrays-ii/",
-    "title": "Number of ZigZag Arrays II"
+    "link": "https://leetcode.com/problems/number-of-zigzag-arrays-ii/"
   },
   "3701": {
+    "id": 3701,
     "category": "Array & Hashing",
+    "title": "Compute Alternating Sum",
     "difficulty": "Easy",
-    "id": 3701,
-    "link": "https://leetcode.com/problems/compute-alternating-sum/",
-    "title": "Compute Alternating Sum"
+    "link": "https://leetcode.com/problems/compute-alternating-sum/"
   },
   "3702": {
+    "id": 3702,
     "category": "Bit Manipulation",
+    "title": "Longest Subsequence With Non-Zero Bitwise XOR",
     "difficulty": "Medium",
-    "id": 3702,
-    "link": "https://leetcode.com/problems/longest-subsequence-with-non-zero-bitwise-xor/",
-    "title": "Longest Subsequence With Non-Zero Bitwise XOR"
+    "link": "https://leetcode.com/problems/longest-subsequence-with-non-zero-bitwise-xor/"
   },
   "3703": {
+    "id": 3703,
     "category": "Stack",
+    "title": "Remove K-Balanced Substrings",
     "difficulty": "Medium",
-    "id": 3703,
-    "link": "https://leetcode.com/problems/remove-k-balanced-substrings/",
-    "title": "Remove K-Balanced Substrings"
+    "link": "https://leetcode.com/problems/remove-k-balanced-substrings/"
   },
   "3704": {
+    "id": 3704,
     "category": "Dynamic Programming",
+    "title": "Count No-Zero Pairs That Sum to N",
     "difficulty": "Hard",
-    "id": 3704,
-    "link": "https://leetcode.com/problems/count-no-zero-pairs-that-sum-to-n/",
-    "title": "Count No-Zero Pairs That Sum to N"
+    "link": "https://leetcode.com/problems/count-no-zero-pairs-that-sum-to-n/"
   },
   "3705": {
+    "id": 3705,
     "category": "Array & Hashing",
+    "title": "Find Golden Hour Customers",
     "difficulty": "Medium",
-    "id": 3705,
-    "link": "https://leetcode.com/problems/find-golden-hour-customers/",
-    "title": "Find Golden Hour Customers"
+    "link": "https://leetcode.com/problems/find-golden-hour-customers/"
   },
   "3706": {
+    "id": 3706,
     "category": "Array & Hashing",
+    "title": "Maximum Distance Between Unequal Words in Array II",
     "difficulty": "Medium",
-    "id": 3706,
-    "link": "https://leetcode.com/problems/maximum-distance-between-unequal-words-in-array-ii/",
-    "title": "Maximum Distance Between Unequal Words in Array II"
+    "link": "https://leetcode.com/problems/maximum-distance-between-unequal-words-in-array-ii/"
   },
   "3707": {
+    "id": 3707,
     "category": "Array & Hashing",
+    "title": "Equal Score Substrings",
     "difficulty": "Easy",
-    "id": 3707,
-    "link": "https://leetcode.com/problems/equal-score-substrings/",
-    "title": "Equal Score Substrings"
+    "link": "https://leetcode.com/problems/equal-score-substrings/"
   },
   "3708": {
+    "id": 3708,
     "category": "Array & Hashing",
+    "title": "Longest Fibonacci Subarray",
     "difficulty": "Medium",
-    "id": 3708,
-    "link": "https://leetcode.com/problems/longest-fibonacci-subarray/",
-    "title": "Longest Fibonacci Subarray"
+    "link": "https://leetcode.com/problems/longest-fibonacci-subarray/"
   },
   "3709": {
+    "id": 3709,
     "category": "Binary Search",
+    "title": "Design Exam Scores Tracker",
     "difficulty": "Medium",
-    "id": 3709,
-    "link": "https://leetcode.com/problems/design-exam-scores-tracker/",
-    "title": "Design Exam Scores Tracker"
+    "link": "https://leetcode.com/problems/design-exam-scores-tracker/"
   },
   "3710": {
+    "id": 3710,
     "category": "Graph Traversal",
+    "title": "Maximum Partition Factor",
     "difficulty": "Hard",
-    "id": 3710,
-    "link": "https://leetcode.com/problems/maximum-partition-factor/",
-    "title": "Maximum Partition Factor"
+    "link": "https://leetcode.com/problems/maximum-partition-factor/"
   },
   "3711": {
+    "id": 3711,
     "category": "Heap (Priority Queue)",
+    "title": "Maximum Transactions Without Negative Balance",
     "difficulty": "Medium",
-    "id": 3711,
-    "link": "https://leetcode.com/problems/maximum-transactions-without-negative-balance/",
-    "title": "Maximum Transactions Without Negative Balance"
+    "link": "https://leetcode.com/problems/maximum-transactions-without-negative-balance/"
   },
   "3712": {
+    "id": 3712,
     "category": "Array & Hashing",
+    "title": "Sum of Elements With Frequency Divisible by K",
     "difficulty": "Easy",
-    "id": 3712,
-    "link": "https://leetcode.com/problems/sum-of-elements-with-frequency-divisible-by-k/",
-    "title": "Sum of Elements With Frequency Divisible by K"
+    "link": "https://leetcode.com/problems/sum-of-elements-with-frequency-divisible-by-k/"
   },
   "3713": {
+    "id": 3713,
     "category": "Array & Hashing",
+    "title": "Longest Balanced Substring I",
     "difficulty": "Medium",
-    "id": 3713,
-    "link": "https://leetcode.com/problems/longest-balanced-substring-i/",
-    "title": "Longest Balanced Substring I"
+    "link": "https://leetcode.com/problems/longest-balanced-substring-i/"
   },
   "3714": {
+    "id": 3714,
     "category": "Array & Hashing",
+    "title": "Longest Balanced Substring II",
     "difficulty": "Medium",
-    "id": 3714,
-    "link": "https://leetcode.com/problems/longest-balanced-substring-ii/",
-    "title": "Longest Balanced Substring II"
+    "link": "https://leetcode.com/problems/longest-balanced-substring-ii/"
   },
   "3715": {
+    "id": 3715,
     "category": "Tree",
+    "title": "Sum of Perfect Square Ancestors",
     "difficulty": "Hard",
-    "id": 3715,
-    "link": "https://leetcode.com/problems/sum-of-perfect-square-ancestors/",
-    "title": "Sum of Perfect Square Ancestors"
+    "link": "https://leetcode.com/problems/sum-of-perfect-square-ancestors/"
   },
   "3716": {
+    "id": 3716,
     "category": "Array & Hashing",
+    "title": "Find Churn Risk Customers",
     "difficulty": "Medium",
-    "id": 3716,
-    "link": "https://leetcode.com/problems/find-churn-risk-customers/",
-    "title": "Find Churn Risk Customers"
+    "link": "https://leetcode.com/problems/find-churn-risk-customers/"
   },
   "3717": {
+    "id": 3717,
     "category": "Dynamic Programming",
+    "title": "Minimum Operations to Make the Array Beautiful",
     "difficulty": "Medium",
-    "id": 3717,
-    "link": "https://leetcode.com/problems/minimum-operations-to-make-the-array-beautiful/",
-    "title": "Minimum Operations to Make the Array Beautiful"
+    "link": "https://leetcode.com/problems/minimum-operations-to-make-the-array-beautiful/"
   },
   "3718": {
+    "id": 3718,
     "category": "Array & Hashing",
+    "title": "Smallest Missing Multiple of K",
     "difficulty": "Easy",
-    "id": 3718,
-    "link": "https://leetcode.com/problems/smallest-missing-multiple-of-k/",
-    "title": "Smallest Missing Multiple of K"
+    "link": "https://leetcode.com/problems/smallest-missing-multiple-of-k/"
   },
   "3719": {
+    "id": 3719,
     "category": "Tree",
+    "title": "Longest Balanced Subarray I",
     "difficulty": "Medium",
-    "id": 3719,
-    "link": "https://leetcode.com/problems/longest-balanced-subarray-i/",
-    "title": "Longest Balanced Subarray I"
+    "link": "https://leetcode.com/problems/longest-balanced-subarray-i/"
   },
   "3720": {
+    "id": 3720,
     "category": "Greedy",
+    "title": "Lexicographically Smallest Permutation Greater Than Target",
     "difficulty": "Medium",
-    "id": 3720,
-    "link": "https://leetcode.com/problems/lexicographically-smallest-permutation-greater-than-target/",
-    "title": "Lexicographically Smallest Permutation Greater Than Target"
+    "link": "https://leetcode.com/problems/lexicographically-smallest-permutation-greater-than-target/"
   },
   "3721": {
+    "id": 3721,
     "category": "Tree",
+    "title": "Longest Balanced Subarray II",
     "difficulty": "Hard",
-    "id": 3721,
-    "link": "https://leetcode.com/problems/longest-balanced-subarray-ii/",
-    "title": "Longest Balanced Subarray II"
+    "link": "https://leetcode.com/problems/longest-balanced-subarray-ii/"
   },
   "3722": {
+    "id": 3722,
     "category": "Binary Search",
+    "title": "Lexicographically Smallest String After Reverse",
     "difficulty": "Medium",
-    "id": 3722,
-    "link": "https://leetcode.com/problems/lexicographically-smallest-string-after-reverse/",
-    "title": "Lexicographically Smallest String After Reverse"
+    "link": "https://leetcode.com/problems/lexicographically-smallest-string-after-reverse/"
   },
   "3723": {
-    "category": "Math",
-    "difficulty": "Medium",
     "id": 3723,
-    "link": "https://leetcode.com/problems/maximize-sum-of-squares-of-digits/",
-    "title": "Maximize Sum of Squares of Digits"
+    "category": "Greedy",
+    "title": "Maximize Sum of Squares of Digits",
+    "difficulty": "Medium",
+    "link": "https://leetcode.com/problems/maximize-sum-of-squares-of-digits/"
   },
   "3724": {
+    "id": 3724,
     "category": "Greedy",
+    "title": "Minimum Operations to Transform Array",
     "difficulty": "Medium",
-    "id": 3724,
-    "link": "https://leetcode.com/problems/minimum-operations-to-transform-array/",
-    "title": "Minimum Operations to Transform Array"
+    "link": "https://leetcode.com/problems/minimum-operations-to-transform-array/"
   },
   "3725": {
+    "id": 3725,
     "category": "Dynamic Programming",
+    "title": "Count Ways to Choose Coprime Integers from Rows",
     "difficulty": "Hard",
-    "id": 3725,
-    "link": "https://leetcode.com/problems/count-ways-to-choose-coprime-integers-from-rows/",
-    "title": "Count Ways to Choose Coprime Integers from Rows"
+    "link": "https://leetcode.com/problems/count-ways-to-choose-coprime-integers-from-rows/"
   },
   "3726": {
+    "id": 3726,
     "category": "Math & Geometry",
+    "title": "Remove Zeros in Decimal Representation",
     "difficulty": "Easy",
-    "id": 3726,
-    "link": "https://leetcode.com/problems/remove-zeros-in-decimal-representation/",
-    "title": "Remove Zeros in Decimal Representation"
+    "link": "https://leetcode.com/problems/remove-zeros-in-decimal-representation/"
   },
   "3727": {
+    "id": 3727,
     "category": "Greedy",
+    "title": "Maximum Alternating Sum of Squares",
     "difficulty": "Medium",
-    "id": 3727,
-    "link": "https://leetcode.com/problems/maximum-alternating-sum-of-squares/",
-    "title": "Maximum Alternating Sum of Squares"
+    "link": "https://leetcode.com/problems/maximum-alternating-sum-of-squares/"
   },
   "3728": {
+    "id": 3728,
     "category": "Array & Hashing",
+    "title": "Stable Subarrays With Equal Boundary and Interior Sum",
     "difficulty": "Medium",
-    "id": 3728,
-    "link": "https://leetcode.com/problems/stable-subarrays-with-equal-boundary-and-interior-sum/",
-    "title": "Stable Subarrays With Equal Boundary and Interior Sum"
+    "link": "https://leetcode.com/problems/stable-subarrays-with-equal-boundary-and-interior-sum/"
   },
   "3729": {
+    "id": 3729,
     "category": "Array & Hashing",
+    "title": "Count Distinct Subarrays Divisible by K in Sorted Array",
     "difficulty": "Hard",
-    "id": 3729,
-    "link": "https://leetcode.com/problems/count-distinct-subarrays-divisible-by-k-in-sorted-array/",
-    "title": "Count Distinct Subarrays Divisible by K in Sorted Array"
+    "link": "https://leetcode.com/problems/count-distinct-subarrays-divisible-by-k-in-sorted-array/"
   },
   "3730": {
+    "id": 3730,
     "category": "Greedy",
+    "title": "Maximum Calories Burnt from Jumps",
     "difficulty": "Medium",
-    "id": 3730,
-    "link": "https://leetcode.com/problems/maximum-calories-burnt-from-jumps/",
-    "title": "Maximum Calories Burnt from Jumps"
+    "link": "https://leetcode.com/problems/maximum-calories-burnt-from-jumps/"
   },
   "3731": {
+    "id": 3731,
     "category": "Array & Hashing",
+    "title": "Find Missing Elements",
     "difficulty": "Easy",
-    "id": 3731,
-    "link": "https://leetcode.com/problems/find-missing-elements/",
-    "title": "Find Missing Elements"
+    "link": "https://leetcode.com/problems/find-missing-elements/"
   },
   "3732": {
-    "category": "Array",
-    "difficulty": "Medium",
     "id": 3732,
-    "link": "https://leetcode.com/problems/maximum-product-of-three-elements-after-one-replacement/",
-    "title": "Maximum Product of Three Elements After One Replacement"
+    "category": "Greedy",
+    "title": "Maximum Product of Three Elements After One Replacement",
+    "difficulty": "Medium",
+    "link": "https://leetcode.com/problems/maximum-product-of-three-elements-after-one-replacement/"
   },
   "3733": {
+    "id": 3733,
     "category": "Binary Search",
+    "title": "Minimum Time to Complete All Deliveries",
     "difficulty": "Medium",
-    "id": 3733,
-    "link": "https://leetcode.com/problems/minimum-time-to-complete-all-deliveries/",
-    "title": "Minimum Time to Complete All Deliveries"
+    "link": "https://leetcode.com/problems/minimum-time-to-complete-all-deliveries/"
   },
   "3734": {
+    "id": 3734,
     "category": "Two Pointers",
+    "title": "Lexicographically Smallest Palindromic Permutation Greater Than Target",
     "difficulty": "Hard",
-    "id": 3734,
-    "link": "https://leetcode.com/problems/lexicographically-smallest-palindromic-permutation-greater-than-target/",
-    "title": "Lexicographically Smallest Palindromic Permutation Greater Than Target"
+    "link": "https://leetcode.com/problems/lexicographically-smallest-palindromic-permutation-greater-than-target/"
   },
   "3735": {
+    "id": 3735,
     "category": "Binary Search",
+    "title": "Lexicographically Smallest String After Reverse II",
     "difficulty": "Hard",
-    "id": 3735,
-    "link": "https://leetcode.com/problems/lexicographically-smallest-string-after-reverse-ii/",
-    "title": "Lexicographically Smallest String After Reverse II"
+    "link": "https://leetcode.com/problems/lexicographically-smallest-string-after-reverse-ii/"
   },
   "3736": {
+    "id": 3736,
     "category": "Math & Geometry",
+    "title": "Minimum Moves to Equal Array Elements III",
     "difficulty": "Easy",
-    "id": 3736,
-    "link": "https://leetcode.com/problems/minimum-moves-to-equal-array-elements-iii/",
-    "title": "Minimum Moves to Equal Array Elements III"
+    "link": "https://leetcode.com/problems/minimum-moves-to-equal-array-elements-iii/"
   },
   "3737": {
+    "id": 3737,
     "category": "Tree",
+    "title": "Count Subarrays With Majority Element I",
     "difficulty": "Medium",
-    "id": 3737,
-    "link": "https://leetcode.com/problems/count-subarrays-with-majority-element-i/",
-    "title": "Count Subarrays With Majority Element I"
+    "link": "https://leetcode.com/problems/count-subarrays-with-majority-element-i/"
   },
   "3738": {
+    "id": 3738,
     "category": "Dynamic Programming",
+    "title": "Longest Non-Decreasing Subarray After Replacing at Most One Element",
     "difficulty": "Medium",
-    "id": 3738,
-    "link": "https://leetcode.com/problems/longest-non-decreasing-subarray-after-replacing-at-most-one-element/",
-    "title": "Longest Non-Decreasing Subarray After Replacing at Most One Element"
+    "link": "https://leetcode.com/problems/longest-non-decreasing-subarray-after-replacing-at-most-one-element/"
   },
   "3739": {
-    "category": "Array & Hashing",
-    "difficulty": "Easy",
     "id": 3739,
-    "link": "https://leetcode.com/problems/find-minimum-operations-to-make-all-elements-divisible-by-three/",
-    "tags": ["array", "math"],
-    "title": "Find Minimum Operations to Make All Elements Divisible by Three"
+    "category": "Tree",
+    "title": "Count Subarrays With Majority Element II",
+    "difficulty": "Hard",
+    "link": "https://leetcode.com/problems/count-subarrays-with-majority-element-ii/"
   },
   "3740": {
+    "id": 3740,
     "category": "Array & Hashing",
+    "title": "Minimum Distance Between Three Equal Elements I",
     "difficulty": "Easy",
-    "id": 3740,
-    "link": "https://leetcode.com/problems/minimum-distance-between-three-equal-elements-i/",
-    "title": "Minimum Distance Between Three Equal Elements I"
+    "link": "https://leetcode.com/problems/minimum-distance-between-three-equal-elements-i/"
   },
   "3741": {
+    "id": 3741,
     "category": "Array & Hashing",
+    "title": "Minimum Distance Between Three Equal Elements II",
     "difficulty": "Medium",
-    "id": 3741,
-    "link": "https://leetcode.com/problems/minimum-distance-between-three-equal-elements-ii/",
-    "title": "Minimum Distance Between Three Equal Elements II"
+    "link": "https://leetcode.com/problems/minimum-distance-between-three-equal-elements-ii/"
   },
   "3742": {
+    "id": 3742,
     "category": "Dynamic Programming",
+    "title": "Maximum Path Score in a Grid",
     "difficulty": "Medium",
-    "id": 3742,
-    "link": "https://leetcode.com/problems/maximum-path-score-in-a-grid/",
-    "title": "Maximum Path Score in a Grid"
+    "link": "https://leetcode.com/problems/maximum-path-score-in-a-grid/"
   },
   "3743": {
-    "category": "Array & Hashing",
-    "difficulty": "Medium",
     "id": 3743,
-    "link": "https://leetcode.com/problems/count-the-number-of-beautiful-subarrays/",
-    "tags": ["array", "hash-table", "bit-manipulation", "prefix-sum"],
-    "title": "Count the Number of Beautiful Subarrays"
+    "category": "Dynamic Programming",
+    "title": "Maximize Cyclic Partition Score",
+    "difficulty": "Hard",
+    "link": "https://leetcode.com/problems/maximize-cyclic-partition-score/"
   },
   "3744": {
+    "id": 3744,
     "category": "Array & Hashing",
+    "title": "Find Kth Character in Expanded String",
     "difficulty": "Medium",
-    "id": 3744,
-    "link": "https://leetcode.com/problems/find-kth-character-in-expanded-string/",
-    "title": "Find Kth Character in Expanded String"
+    "link": "https://leetcode.com/problems/find-kth-character-in-expanded-string/"
   },
   "3745": {
+    "id": 3745,
     "category": "Greedy",
+    "title": "Maximize Expression of Three Elements",
     "difficulty": "Easy",
-    "id": 3745,
-    "link": "https://leetcode.com/problems/maximize-expression-of-three-elements/",
-    "title": "Maximize Expression of Three Elements"
+    "link": "https://leetcode.com/problems/maximize-expression-of-three-elements/"
   },
   "3746": {
+    "id": 3746,
     "category": "Stack",
+    "title": "Minimum String Length After Balanced Removals",
     "difficulty": "Medium",
-    "id": 3746,
-    "link": "https://leetcode.com/problems/minimum-string-length-after-balanced-removals/",
-    "title": "Minimum String Length After Balanced Removals"
+    "link": "https://leetcode.com/problems/minimum-string-length-after-balanced-removals/"
   },
   "3747": {
-    "category": "String",
-    "difficulty": "Medium",
     "id": 3747,
-    "link": "https://leetcode.com/problems/count-beautiful-substrings-i/",
-    "tags": ["hash-table", "math", "string", "enumeration", "number-theory", "prefix-sum"],
-    "title": "Count Beautiful Substrings I"
+    "category": "Dynamic Programming",
+    "title": "Count Distinct Integers After Removing Zeros",
+    "difficulty": "Medium",
+    "link": "https://leetcode.com/problems/count-distinct-integers-after-removing-zeros/"
   },
   "3748": {
-    "category": "String",
-    "difficulty": "Hard",
     "id": 3748,
-    "link": "https://leetcode.com/problems/count-beautiful-substrings-ii/",
-    "tags": ["hash-table", "math", "string", "number-theory", "prefix-sum"],
-    "title": "Count Beautiful Substrings II"
+    "category": "Binary Search",
+    "title": "Count Stable Subarrays",
+    "difficulty": "Hard",
+    "link": "https://leetcode.com/problems/count-stable-subarrays/"
   },
   "3749": {
+    "id": 3749,
     "category": "Stack",
+    "title": "Evaluate Valid Expressions",
     "difficulty": "Hard",
-    "id": 3749,
-    "link": "https://leetcode.com/problems/evaluate-valid-expressions/",
-    "title": "Evaluate Valid Expressions"
+    "link": "https://leetcode.com/problems/evaluate-valid-expressions/"
   },
   "3750": {
-    "category": "Array & Hashing",
-    "difficulty": "Easy",
     "id": 3750,
-    "link": "https://leetcode.com/problems/minimum-number-of-flips-to-reverse-binary-string/",
-    "title": "Minimum Number of Flips to Reverse Binary String"
+    "category": "Bit Manipulation",
+    "title": "Minimum Number of Flips to Reverse Binary String",
+    "difficulty": "Easy",
+    "link": "https://leetcode.com/problems/minimum-number-of-flips-to-reverse-binary-string/"
   },
   "3751": {
-    "category": "Array & Hashing",
-    "difficulty": "Medium",
     "id": 3751,
-    "link": "https://leetcode.com/problems/total-waviness-of-numbers-in-range-i/",
-    "title": "Total Waviness of Numbers in Range I"
+    "category": "Dynamic Programming",
+    "title": "Total Waviness of Numbers in Range I",
+    "difficulty": "Medium",
+    "link": "https://leetcode.com/problems/total-waviness-of-numbers-in-range-i/"
   },
   "3752": {
-    "category": "Array & Hashing",
-    "difficulty": "Medium",
     "id": 3752,
-    "link": "https://leetcode.com/problems/lexicographically-smallest-negated-permutation-that-sums-to-target/",
-    "title": "Lexicographically Smallest Negated Permutation that Sums to Target"
+    "category": "Greedy",
+    "title": "Lexicographically Smallest Negated Permutation that Sums to Target",
+    "difficulty": "Medium",
+    "link": "https://leetcode.com/problems/lexicographically-smallest-negated-permutation-that-sums-to-target/"
   },
   "3753": {
+    "id": 3753,
     "category": "Dynamic Programming",
+    "title": "Total Waviness of Numbers in Range II",
     "difficulty": "Hard",
-    "id": 3753,
-    "link": "https://leetcode.com/problems/paths-in-matrix-whose-sum-is-divisible-by-k/",
-    "tags": ["array", "dynamic-programming", "matrix"],
-    "title": "Paths in Matrix Whose Sum Is Divisible by K"
+    "link": "https://leetcode.com/problems/total-waviness-of-numbers-in-range-ii/"
   },
   "3754": {
-    "category": "Array & Hashing",
-    "difficulty": "Easy",
     "id": 3754,
-    "link": "https://leetcode.com/problems/concatenate-non-zero-digits-and-multiply-by-sum-i/",
-    "title": "Concatenate Non-Zero Digits and Multiply by Sum I"
+    "category": "Math & Geometry",
+    "title": "Concatenate Non-Zero Digits and Multiply by Sum I",
+    "difficulty": "Easy",
+    "link": "https://leetcode.com/problems/concatenate-non-zero-digits-and-multiply-by-sum-i/"
   },
   "3755": {
-    "category": "Array & Hashing",
-    "difficulty": "Medium",
     "id": 3755,
-    "link": "https://leetcode.com/problems/find-maximum-balanced-xor-subarray-length/",
-    "title": "Find Maximum Balanced XOR Subarray Length"
+    "category": "Bit Manipulation",
+    "title": "Find Maximum Balanced XOR Subarray Length",
+    "difficulty": "Medium",
+    "link": "https://leetcode.com/problems/find-maximum-balanced-xor-subarray-length/"
   },
   "3756": {
-    "category": "Array & Hashing",
-    "difficulty": "Medium",
     "id": 3756,
-    "link": "https://leetcode.com/problems/concatenate-non-zero-digits-and-multiply-by-sum-ii/",
-    "title": "Concatenate Non-Zero Digits and Multiply by Sum II"
+    "category": "Math & Geometry",
+    "title": "Concatenate Non-Zero Digits and Multiply by Sum II",
+    "difficulty": "Medium",
+    "link": "https://leetcode.com/problems/concatenate-non-zero-digits-and-multiply-by-sum-ii/"
   },
   "3757": {
-    "category": "Array & Hashing",
-    "difficulty": "Hard",
     "id": 3757,
-    "link": "https://leetcode.com/problems/number-of-effective-subsequences/",
-    "title": "Number of Effective Subsequences"
+    "category": "Dynamic Programming",
+    "title": "Number of Effective Subsequences",
+    "difficulty": "Hard",
+    "link": "https://leetcode.com/problems/number-of-effective-subsequences/"
   },
   "3758": {
-    "category": "Array & Hashing",
-    "difficulty": "Medium",
     "id": 3758,
-    "link": "https://leetcode.com/problems/convert-number-words-to-digits/",
-    "title": "Convert Number Words to Digits"
+    "category": "Trie",
+    "title": "Convert Number Words to Digits",
+    "difficulty": "Medium",
+    "link": "https://leetcode.com/problems/convert-number-words-to-digits/"
   },
   "3759": {
-    "category": "Array",
-    "difficulty": "Medium",
     "id": 3759,
-    "link": "https://leetcode.com/problems/count-elements-with-at-least-k-greater-values/",
-    "title": "Count Elements With at Least K Greater Values"
+    "category": "Binary Search",
+    "title": "Count Elements With at Least K Greater Values",
+    "difficulty": "Medium",
+    "link": "https://leetcode.com/problems/count-elements-with-at-least-k-greater-values/"
   },
   "3760": {
-    "category": "Graph",
-    "difficulty": "Hard",
     "id": 3760,
-    "link": "https://leetcode.com/problems/minimum-cost-to-convert-string-ii/",
-    "tags": ["array", "string", "dynamic-programming", "graph", "trie", "shortest-path"],
-    "title": "Minimum Cost to Convert String II"
+    "category": "Array & Hashing",
+    "title": "Maximum Substrings With Distinct Start",
+    "difficulty": "Medium",
+    "link": "https://leetcode.com/problems/maximum-substrings-with-distinct-start/"
   },
   "3761": {
-    "category": "Tree",
-    "difficulty": "Hard",
     "id": 3761,
-    "link": "https://leetcode.com/problems/count-valid-paths-in-a-tree/",
-    "tags": ["math", "dynamic-programming", "tree", "depth-first-search", "number-theory"],
-    "title": "Count Valid Paths in a Tree"
+    "category": "Math & Geometry",
+    "title": "Minimum Absolute Distance Between Mirror Pairs",
+    "difficulty": "Medium",
+    "link": "https://leetcode.com/problems/minimum-absolute-distance-between-mirror-pairs/"
   },
   "3762": {
-    "category": "Array & Hashing",
-    "difficulty": "Easy",
     "id": 3762,
-    "link": "https://leetcode.com/problems/minimum-operations-to-make-array-values-equal-to-k/",
-    "tags": ["array", "hash-table"],
-    "title": "Minimum Operations to Make Array Values Equal to K"
+    "category": "Tree",
+    "title": "Minimum Operations to Equalize Subarrays",
+    "difficulty": "Hard",
+    "link": "https://leetcode.com/problems/minimum-operations-to-equalize-subarrays/"
   },
   "3763": {
-    "category": "Array & Hashing",
-    "difficulty": "Medium",
     "id": 3763,
-    "link": "https://leetcode.com/problems/maximum-substrings-with-distinct-start/",
-    "title": "Maximum Substrings With Distinct Start"
+    "category": "Heap (Priority Queue)",
+    "title": "Maximum Total Sum with Threshold Constraints",
+    "difficulty": "Medium",
+    "link": "https://leetcode.com/problems/maximum-total-sum-with-threshold-constraints/"
   },
   "3764": {
-    "category": "Database",
-    "difficulty": "Hard",
     "id": 3764,
-    "link": "https://leetcode.com/problems/most-common-course-pairs/",
-    "title": "Most Common Course Pairs"
+    "category": "Array & Hashing",
+    "title": "Most Common Course Pairs",
+    "difficulty": "Hard",
+    "link": "https://leetcode.com/problems/most-common-course-pairs/"
   },
   "3765": {
+    "id": 3765,
     "category": "Math & Geometry",
+    "title": "Complete Prime Number",
     "difficulty": "Medium",
-    "id": 3765,
-    "link": "https://leetcode.com/problems/complete-prime-number/",
-    "title": "Complete Prime Number"
+    "link": "https://leetcode.com/problems/complete-prime-number/"
   },
   "3766": {
-    "category": "Array & Hashing",
-    "difficulty": "Medium",
     "id": 3766,
-    "link": "https://leetcode.com/problems/minimum-operations-to-make-binary-palindrome/",
-    "title": "Minimum Operations to Make Binary Palindrome"
+    "category": "Binary Search",
+    "title": "Minimum Operations to Make Binary Palindrome",
+    "difficulty": "Medium",
+    "link": "https://leetcode.com/problems/minimum-operations-to-make-binary-palindrome/"
   },
   "3767": {
-    "category": "Greedy",
-    "difficulty": "Medium",
     "id": 3767,
-    "link": "https://leetcode.com/problems/maximize-points-after-choosing-k-tasks/",
-    "title": "Maximize Points After Choosing K Tasks"
+    "category": "Heap (Priority Queue)",
+    "title": "Maximize Points After Choosing K Tasks",
+    "difficulty": "Medium",
+    "link": "https://leetcode.com/problems/maximize-points-after-choosing-k-tasks/"
   },
   "3768": {
-    "category": "Array & Hashing",
-    "difficulty": "Hard",
     "id": 3768,
-    "link": "https://leetcode.com/problems/minimum-inversion-count-in-subarrays-of-fixed-length/",
-    "title": "Minimum Inversion Count in Subarrays of Fixed Length"
+    "category": "Tree",
+    "title": "Minimum Inversion Count in Subarrays of Fixed Length",
+    "difficulty": "Hard",
+    "link": "https://leetcode.com/problems/minimum-inversion-count-in-subarrays-of-fixed-length/"
   },
   "3769": {
+    "id": 3769,
     "category": "Array & Hashing",
+    "title": "Sort Integers by Binary Reflection",
     "difficulty": "Easy",
-    "id": 3769,
-    "link": "https://leetcode.com/problems/sort-integers-by-binary-reflection/",
-    "title": "Sort Integers by Binary Reflection"
+    "link": "https://leetcode.com/problems/sort-integers-by-binary-reflection/"
   },
   "3770": {
+    "id": 3770,
     "category": "Math & Geometry",
+    "title": "Largest Prime from Consecutive Prime Sum",
     "difficulty": "Medium",
-    "id": 3770,
-    "link": "https://leetcode.com/problems/largest-prime-from-consecutive-prime-sum/",
-    "title": "Largest Prime from Consecutive Prime Sum"
+    "link": "https://leetcode.com/problems/largest-prime-from-consecutive-prime-sum/"
   },
   "3771": {
-    "category": "Dynamic Programming",
-    "difficulty": "Medium",
     "id": 3771,
-    "link": "https://leetcode.com/problems/total-score-of-dungeon-runs/",
-    "title": "Total Score of Dungeon Runs"
+    "category": "Binary Search",
+    "title": "Total Score of Dungeon Runs",
+    "difficulty": "Medium",
+    "link": "https://leetcode.com/problems/total-score-of-dungeon-runs/"
   },
   "3772": {
+    "id": 3772,
     "category": "Tree",
+    "title": "Maximum Subgraph Score in a Tree",
     "difficulty": "Hard",
-    "id": 3772,
-    "link": "https://leetcode.com/problems/maximum-subgraph-score-in-a-tree/",
-    "title": "Maximum Subgraph Score in a Tree"
-  },
-  "797": {"id": 797, "category": "Graph", "title": "All Paths From Source to Target", "difficulty": "Medium", "link": "https://leetcode.com/problems/all-paths-from-source-to-target/", "tags": []},
-  "1008": {"id": 1008, "category": "Tree", "title": "Construct Binary Search Tree from Preorder Traversal", "difficulty": "Medium", "link": "https://leetcode.com/problems/construct-binary-search-tree-from-preorder-traversal/", "tags": []},
-  "1079": {"id": 1079, "category": "Backtracking", "title": "Letter Tile Possibilities", "difficulty": "Medium", "link": "https://leetcode.com/problems/letter-tile-possibilities/", "tags": []},
-  "1261": {"id": 1261, "category": "Tree", "title": "Find Elements in a Contaminated Binary Tree", "difficulty": "Medium", "link": "https://leetcode.com/problems/find-elements-in-a-contaminated-binary-tree/", "tags": []},
-  "1630": {"id": 1630, "category": "Array", "title": "Arithmetic Subarrays", "difficulty": "Medium", "link": "https://leetcode.com/problems/arithmetic-subarrays/", "tags": []},
-  "2110": {"id": 2110, "category": "Array", "title": "Number of Smooth Descent Periods of a Stock", "difficulty": "Medium", "link": "https://leetcode.com/problems/number-of-smooth-descent-periods-of-a-stock/", "tags": []},
-  "237": {"id": 237, "category": "Linked List", "title": "Delete Node in a Linked List", "difficulty": "Medium", "link": "https://leetcode.com/problems/delete-node-in-a-linked-list/", "tags": []},
-  "2482": {"id": 2482, "category": "Matrix", "title": "Difference Between Ones and Zeros in Row and Column", "difficulty": "Medium", "link": "https://leetcode.com/problems/difference-between-ones-and-zeros-in-row-and-column/", "tags": []},
-  "2785": {"id": 2785, "category": "String", "title": "Sort Vowels in a String", "difficulty": "Medium", "link": "https://leetcode.com/problems/sort-vowels-in-a-string/", "tags": []},
-  "1347": {"id": 1347, "category": "String", "title": "Minimum Number of Steps to Make Two Strings Anagram", "difficulty": "Medium", "link": "https://leetcode.com/problems/minimum-number-of-steps-to-make-two-strings-anagram/", "tags": []},
-  "2326": {"id": 2326, "category": "Matrix", "title": "Spiral Matrix IV", "difficulty": "Medium", "link": "https://leetcode.com/problems/spiral-matrix-iv/", "tags": []},
-  "1823": {"id": 1823, "category": "Math", "title": "Find the Winner of the Circular Game", "difficulty": "Medium", "link": "https://leetcode.com/problems/find-the-winner-of-the-circular-game/", "tags": []},
-  "2120": {"id": 2120, "category": "Simulation", "title": "Execution of All Suffix Instructions Staying in a Grid", "difficulty": "Medium", "link": "https://leetcode.com/problems/execution-of-all-suffix-instructions-staying-in-a-grid/", "tags": []},
-  "2221": {"id": 2221, "category": "Array", "title": "Find Triangular Sum of an Array", "difficulty": "Medium", "link": "https://leetcode.com/problems/find-triangular-sum-of-an-array/", "tags": []},
-  "1605": {"id": 1605, "category": "Matrix", "title": "Find Valid Matrix Given Row and Column Sums", "difficulty": "Medium", "link": "https://leetcode.com/problems/find-valid-matrix-given-row-and-column-sums/", "tags": []},
-  "1551": {"id": 1551, "category": "Math", "title": "Minimum Operations to Make Array Equal", "difficulty": "Medium", "link": "https://leetcode.com/problems/minimum-operations-to-make-array-equal/", "tags": []},
-  "3562": {"id": 3562, "category": "Dynamic Programming", "title": "Maximum Profit from Trading Stocks with Discounts", "difficulty": "Hard", "link": "https://leetcode.com/problems/maximum-profit-from-trading-stocks-with-discounts/", "tags": []}
+    "link": "https://leetcode.com/problems/maximum-subgraph-score-in-a-tree/"
+  },
+  "3773": {
+    "id": 3773,
+    "category": "Array & Hashing",
+    "title": "Maximum Number of Equal Length Runs",
+    "difficulty": "Medium",
+    "link": "https://leetcode.com/problems/maximum-number-of-equal-length-runs/"
+  },
+  "3774": {
+    "id": 3774,
+    "category": "Array & Hashing",
+    "title": "Absolute Difference Between Maximum and Minimum K Elements",
+    "difficulty": "Easy",
+    "link": "https://leetcode.com/problems/absolute-difference-between-maximum-and-minimum-k-elements/"
+  },
+  "3775": {
+    "id": 3775,
+    "category": "Array & Hashing",
+    "title": "Reverse Words With Same Vowel Count",
+    "difficulty": "Medium",
+    "link": "https://leetcode.com/problems/reverse-words-with-same-vowel-count/"
+  },
+  "3776": {
+    "id": 3776,
+    "category": "Array & Hashing",
+    "title": "Minimum Moves to Balance Circular Array",
+    "difficulty": "Medium",
+    "link": "https://leetcode.com/problems/minimum-moves-to-balance-circular-array/"
+  },
+  "3777": {
+    "id": 3777,
+    "category": "Array & Hashing",
+    "title": "Minimum Deletions to Make Alternating Substring",
+    "difficulty": "Hard",
+    "link": "https://leetcode.com/problems/minimum-deletions-to-make-alternating-substring/"
+  },
+  "3778": {
+    "id": 3778,
+    "category": "Array & Hashing",
+    "title": "Minimum Distance Excluding One Maximum Weighted Edge",
+    "difficulty": "Medium",
+    "link": "https://leetcode.com/problems/minimum-distance-excluding-one-maximum-weighted-edge/"
+  }
 }
diff --git a/explanations/3676/en.md b/explanations/3676/en.md
new file mode 100644
index 0000000..413d77c
--- /dev/null
+++ b/explanations/3676/en.md
@@ -0,0 +1,79 @@
+## Explanation
+
+### Strategy (The "Why")
+
+**Restate the problem:** We need to count subarrays where the minimum of the two ends is strictly greater than the maximum of all elements in between. A subarray must have length at least 3.
+
+**1.1 Constraints & Complexity:**
+
+- **Input Size:** `3 <= nums.length <= 10^5`, `nums[i] <= 10^9`, all elements are distinct
+- **Time Complexity:** O(n) - Single pass with monotonic stack
+- **Space Complexity:** O(n) - Stack can hold at most n indices
+- **Edge Case:** Empty array or array with less than 3 elements returns 0
+
+**1.2 High-level approach:**
+
+A "bowl" subarray has the property that both endpoints are larger than all middle elements. We use a monotonic stack to efficiently find valid bowl subarrays. When we process each element as a potential right endpoint, we check if it can form bowls with elements in the stack.
+
+**1.3 Brute force vs. optimized strategy:**
+
+- **Brute Force:** Check all O(n²) subarrays of length >= 3, for each compute min(ends) and max(middle), then compare. This is O(n³) time.
+- **Optimized (Monotonic Stack):** Use a decreasing stack. When we encounter an element that's >= stack top, we pop elements that can form bowls with current. This is O(n) time.
+- **Why it's better:** The monotonic stack allows us to efficiently track potential left endpoints and count bowls without checking all pairs explicitly.
+
+**1.4 Decomposition:**
+
+1. Use a stack to maintain indices in decreasing order of values
+2. For each element as right endpoint, pop elements from stack that are <= current
+3. Each popped element forms a bowl with current if length >= 3
+4. Check if current forms a bowl with stack top
+5. Push current index to stack
+
+### Steps (The "How")
+
+**2.1 Initialization & Example Setup:**
+
+Let's use the example: `nums = [2,5,3,1,4]`
+
+- Initialize `res = 0` and empty stack
+- Process each element from left to right
+
+**2.2 Process Each Element:**
+
+For each element at index `r` with value `val`:
+
+**2.3 Pop Elements That Can Form Bowls:**
+
+```python
+while stack and nums[stack[-1]] <= val:
+    l = stack.pop()
+    if r - l + 1 >= 3:
+        res += 1
+```
+
+When we pop an element at index `l`, it means `nums[l] <= val`. Since the stack maintains decreasing order, all elements between `l` and `r` are also <= `nums[l]` (otherwise they would have been popped earlier). This means `min(nums[l], nums[r]) = nums[l] > max(middle)`, forming a bowl.
+
+**2.4 Check Bowl with Stack Top:**
+
+```python
+if stack and r - stack[-1] + 1 >= 3:
+    res += 1
+```
+
+If stack is not empty, the top element is > `val`. Since stack maintains decreasing order, `min(nums[stack[-1]], nums[r]) = nums[r] > max(middle)`, forming a bowl.
+
+**2.5 Push Current Index:**
+
+```python
+stack.append(r)
+```
+
+Add current index to maintain the decreasing order property.
+
+**2.6 Return Result:**
+
+After processing all elements, return the total count of bowl subarrays.
+
+**Time Complexity:** O(n) - Each element is pushed and popped at most once  
+**Space Complexity:** O(n) - Stack size
+
diff --git a/explanations/3679/en.md b/explanations/3679/en.md
new file mode 100644
index 0000000..78f8792
--- /dev/null
+++ b/explanations/3679/en.md
@@ -0,0 +1,74 @@
+## Explanation
+
+### Strategy (The "Why")
+
+**Restate the problem:** We need to find the minimum number of arrivals to discard so that in every sliding window of `w` days, each item type appears at most `m` times among kept arrivals.
+
+**1.1 Constraints & Complexity:**
+
+- **Input Size:** `arrivals.length <= 10^5`, `1 <= w <= arrivals.length`, `1 <= m <= w`
+- **Time Complexity:** O(n) - Single pass through arrivals with sliding window
+- **Space Complexity:** O(max(arrivals)) - Counter array for item types
+- **Edge Case:** Empty arrivals array returns 0
+
+**1.2 High-level approach:**
+
+We use a sliding window approach with a counter to track item frequencies. When an item arrives, we check if keeping it would violate the constraint. If so, we discard it (mark as 0) and don't add it to the counter. When items leave the window, we only decrement the counter if they were kept (not 0).
+
+**1.3 Brute force vs. optimized strategy:**
+
+- **Brute Force:** For each arrival, check all windows containing it to see if keeping it violates constraints. This is O(n * w) time.
+- **Optimized (Sliding Window):** Maintain a counter for the current window. When adding an item, if its count is already `m`, we must discard it. This is O(n) time.
+- **Why it's better:** We only need to check the current item's count, not all windows, because if an item type appears `m` times in the current window, adding one more would violate the constraint.
+
+**1.4 Decomposition:**
+
+1. Initialize counter array for item types
+2. For each arrival, remove items that left the window
+3. Check if current item can be kept (count < m)
+4. If yes, increment counter; if no, discard (mark as 0) and increment result
+5. Return total discards
+
+### Steps (The "How")
+
+**2.1 Initialization & Example Setup:**
+
+Let's use the example: `arrivals = [1,2,3,3,3,4], w = 3, m = 2`
+
+- Initialize `ctr = [0] * (max(arrivals) + 1)` to count each item type
+- Initialize `res = 0` to count discards
+
+**2.2 Process Each Arrival:**
+
+For each arrival at index `idx` with item type `item`:
+
+**2.3 Remove Items That Left Window:**
+
+```python
+if idx >= w:
+    left_item = arrivals[idx - w]
+    if left_item != 0:  # Only decrement if it was kept
+        ctr[left_item] -= 1
+```
+
+When `idx >= w`, the item at `idx - w` has left the window. We only decrement if it was kept (not marked as 0).
+
+**2.4 Check If We Need to Discard:**
+
+```python
+if ctr[item] >= m:
+    res += 1
+    arrivals[idx] = 0  # Mark as discarded
+else:
+    ctr[item] += 1
+```
+
+If the current item type already appears `m` times in the window, we must discard it. Otherwise, we keep it and increment the counter.
+
+**2.5 Return Result:**
+
+After processing all arrivals, return the total number of discards.
+
+**Time Complexity:** O(n) - Single pass through arrivals  
+**Space Complexity:** O(max(arrivals)) - Counter array
+
diff --git a/explanations/3680/en.md b/explanations/3680/en.md
new file mode 100644
index 0000000..3d8c7c7
--- /dev/null
+++ b/explanations/3680/en.md
@@ -0,0 +1,83 @@
+## Explanation
+
+### Strategy (The "Why")
+
+**Restate the problem:** We need to generate a schedule where each team plays every other team exactly twice (home and away), with exactly one match per day, and no team plays on consecutive days.
+
+**1.1 Constraints & Complexity:**
+
+- **Input Size:** `2 <= n <= 50`
+- **Time Complexity:** O(n²) - Generate n*(n-1) matches
+- **Space Complexity:** O(n²) - Store all matches
+- **Edge Case:** `n < 5` returns empty array (no valid schedule exists)
+
+**1.2 High-level approach:**
+
+We use a geometric approach: arrange teams in a polygon. Start with adjacent pairs (shortest edges), then progressively add longer edges. For each distance, we add matches in one direction, then reverse direction. This ensures no team plays consecutively.
+
+**1.3 Brute force vs. optimized strategy:**
+
+- **Brute Force:** Try all permutations of matches, check if schedule is valid. This is factorial complexity.
+- **Optimized (Geometric Pattern):** Use a systematic pattern based on distances in a circular arrangement. Start with distance 1 (adjacent), then distance 2, etc. This is O(n²) time.
+- **Why it's better:** The geometric pattern naturally ensures that matches are spaced out, preventing consecutive days for any team.
+
+**1.4 Decomposition:**
+
+1. Handle base case: `n < 5` returns empty
+2. For odd `n`: Add adjacent pairs going around twice, then reverse
+3. For even `n`: Add adjacent pairs in two groups, then reverse
+4. For each distance `diff` from 2 to `n//2`:
+   - Add matches with distance `diff` in one direction
+   - Add matches with distance `diff` in reverse direction
+5. For even `n`, handle special case: distance `n/2` (diametrically opposite)
+
+### Steps (The "How")
+
+**2.1 Initialization & Example Setup:**
+
+Let's use the example: `n = 5`
+
+- Total matches needed: `5 * 4 = 20`
+- Initialize `res = []`
+
+**2.2 Handle Adjacent Pairs (Odd n):**
+
+```python
+if n % 2:
+    for i in range(0, 2 * n, 2):
+        res.append([i % n, (i + 1) % n])
+    for i in range(0, 2 * n, 2):
+        res.append([(i + 1) % n, i % n])
+```
+
+For `n = 5`:
+- First pass: `[0,1], [2,3], [4,0], [1,2], [3,4]`
+- Second pass (reverse): `[1,0], [3,2], [0,4], [2,1], [4,3]`
+
+**2.3 Handle Longer Distances:**
+
+```python
+for diff in range(2, (n + 1) // 2):
+    start = res[-1][0] + 1
+    for i in range(start, start + n):
+        res.append([i % n, (i + diff) % n])
+    start = res[-1][-1] - 1
+    for i in range(start, start + n):
+        res.append([(i + diff) % n, i % n])
+```
+
+For `diff = 2`:
+- Forward: `[1,3], [2,4], [3,0], [4,1], [0,2]`
+- Reverse: `[2,0], [4,2], [0,4], [1,0], [3,1]`
+
+**2.4 Handle Special Case (Even n, distance n/2):**
+
+For even `n`, when `diff = n/2`, all matches are diametrically opposite. We add them in one pass.
+
+**2.5 Return Result:**
+
+Return the complete schedule with all matches.
+
+**Time Complexity:** O(n²) - Generate n*(n-1) matches  
+**Space Complexity:** O(n²) - Store all matches
+
diff --git a/explanations/3685/en.md b/explanations/3685/en.md
new file mode 100644
index 0000000..b45fc9f
--- /dev/null
+++ b/explanations/3685/en.md
@@ -0,0 +1,90 @@
+## Explanation
+
+### Strategy (The "Why")
+
+**Restate the problem:** For each cap value `x` from 1 to `n`, we cap all elements > `x` to `x`, then check if we can form a subsequence with sum exactly `k`.
+
+**1.1 Constraints & Complexity:**
+
+- **Input Size:** `n <= 4000`, `k <= 4000`, `1 <= nums[i] <= n`
+- **Time Complexity:** O(n log n + n * k) - Sort + DP precomputation + n queries
+- **Space Complexity:** O(n * k) - DP table
+- **Edge Case:** Empty array or `k = 0`
+
+**1.2 High-level approach:**
+
+We precompute a subset-sum DP table for the sorted array. For each cap `x`, we find where elements become > `x`. Elements before this point stay as-is; elements after become `x`. We check if any sum from the first part plus multiples of `x` equals `k`.
+
+**1.3 Brute force vs. optimized strategy:**
+
+- **Brute Force:** For each cap `x`, build capped array, then try all subsequences to check if sum `k` is possible. This is O(n * 2^n) time.
+- **Optimized (DP + Math):** Precompute subset-sum DP once. For each cap, use the DP result for elements <= `x`, then check if remainder can be formed using multiples of `x`. This is O(n log n + n * k) time.
+- **Why it's better:** We avoid recomputing DP for each cap by leveraging the fact that capping only affects elements > `x`, and we can use multiples of `x` to form the remainder.
+
+**1.4 Decomposition:**
+
+1. Sort array in ascending order
+2. Precompute subset-sum DP: `dp[i][j]` = can we form sum `j` using first `i` elements
+3. For each cap `x`:
+   - Find index where elements become > `x`
+   - Use DP to get all possible sums from elements <= `x`
+   - For each possible sum, check if remainder can be formed with multiples of `x`
+4. Return boolean array
+
+### Steps (The "How")
+
+**2.1 Initialization & Example Setup:**
+
+Let's use the example: `nums = [4,3,2,4], k = 5`
+
+- Sort: `[2, 3, 4, 4]`
+- Precompute DP table
+
+**2.2 Precompute Subset-Sum DP:**
+
+```python
+dp = [[False] * (k + 1) for _ in range(n + 1)]
+for i in range(n + 1):
+    dp[i][0] = True  # Sum 0 is always possible
+
+for i in range(1, n + 1):
+    for j in range(1, k + 1):
+        if sorted_nums[i - 1] <= j:
+            dp[i][j] = dp[i - 1][j - sorted_nums[i - 1]] or dp[i - 1][j]
+        else:
+            dp[i][j] = dp[i - 1][j]
+```
+
+This builds a table where `dp[i][j]` tells us if we can form sum `j` using the first `i` elements.
+
+**2.3 Process Each Cap Value:**
+
+For `x = 3`:
+- Find `ind = 2` (first index where element > 3)
+- Elements at indices 0-1 stay as-is: `[2, 3]`
+- Elements at indices 2-3 become 3: `[3, 3]`
+
+**2.4 Check If Sum k Is Possible:**
+
+```python
+for j in range(k + 1):
+    if dp[ind][j]:  # Can form sum j with first ind elements
+        remainder = k - j  # 5 - j
+        if remainder % x == 0:  # Can form remainder with multiples of x
+            multiple = remainder // x
+            if multiple <= sz:  # We have enough x's
+                found = True
+                break
+```
+
+For `x = 3`, `ind = 2`, `sz = 2`:
+- `dp[2][2] = True`: remainder = 3, multiple = 1, 1 <= 2 ✓
+- So `answer[2] = True`
+
+**2.5 Return Result:**
+
+Return the boolean array indicating for each cap if sum `k` is achievable.
+
+**Time Complexity:** O(n log n + n * k) - Sort + DP + queries  
+**Space Complexity:** O(n * k) - DP table
+
diff --git a/explanations/3689/en.md b/explanations/3689/en.md
new file mode 100644
index 0000000..26869d2
--- /dev/null
+++ b/explanations/3689/en.md
@@ -0,0 +1,65 @@
+## Explanation
+
+### Strategy (The "Why")
+
+**Restate the problem:** We need to choose exactly `k` non-empty subarrays from `nums` such that the sum of their values is maximized. The value of a subarray is `max(subarray) - min(subarray)`.
+
+**1.1 Constraints & Complexity:**
+
+- **Input Size:** `n <= 5 * 10^4`, `k <= 10^5`, `nums[i] <= 10^9`
+- **Time Complexity:** O(n) - We only need to find max and min once
+- **Space Complexity:** O(1) - Only storing max and min values
+- **Edge Case:** If `k = 0`, but constraints say `k >= 1`, so we don't need to handle this
+
+**1.2 High-level approach:**
+
+The key insight is that to maximize the total value, we should choose the subarray with the maximum value `k` times. The subarray with maximum value is the entire array itself, since it contains both the global maximum and minimum elements.
+
+**1.3 Brute force vs. optimized strategy:**
+
+- **Brute Force:** Try all possible combinations of `k` subarrays, calculate each value, and find the maximum sum. This would be exponential in complexity.
+- **Optimized (Greedy):** Since we can choose the same subarray multiple times, and the entire array has the maximum value (max - min), we simply choose it `k` times. This gives us `(max - min) * k`.
+- **Why it's better:** The entire array always has the maximum possible value because it contains both the maximum and minimum elements of the array.
+
+**1.4 Decomposition:**
+
+1. Find the maximum value in the array
+2. Find the minimum value in the array
+3. Calculate the value of the entire subarray: `max - min`
+4. Multiply by `k` to get the maximum total value
+
+### Steps (The "How")
+
+**2.1 Initialization & Example Setup:**
+
+Let's use the example: `nums = [1,3,2], k = 2`
+
+- Maximum value: 3
+- Minimum value: 1
+- Value of entire subarray: `3 - 1 = 2`
+- Maximum total value: `2 * 2 = 4`
+
+**2.2 Find Maximum and Minimum:**
+
+We iterate through the array once to find the maximum and minimum values. This is O(n) time.
+
+```python
+max_val = max(nums)  # 3
+min_val = min(nums)  # 1
+```
+
+**2.3 Calculate Maximum Total Value:**
+
+The value of choosing the entire array once is `max_val - min_val`. Since we can choose it `k` times, the maximum total value is:
+
+```python
+return (max_val - min_val) * k  # (3 - 1) * 2 = 4
+```
+
+**2.4 Return Result:**
+
+We return the calculated maximum total value.
+
+**Time Complexity:** O(n) - Single pass to find max and min  
+**Space Complexity:** O(1) - Only storing two variables
+
diff --git a/explanations/3747/en.md b/explanations/3747/en.md
index c1d84d7..6db2dc0 100644
--- a/explanations/3747/en.md
+++ b/explanations/3747/en.md
@@ -2,57 +2,80 @@
 
 ### Strategy (The "Why")
 
-**Restate the problem:** We need to count beautiful substrings where vowels equal consonants and their product is divisible by k. A substring is beautiful if it has equal numbers of vowels and consonants, and (vowels × consonants) % k == 0.
+**Restate the problem:** For every integer from 1 to `n`, we remove all zeros from its decimal representation and count how many distinct integers we get.
 
 **1.1 Constraints & Complexity:**
-- Input size: `1 <= s.length <= 1000`, `1 <= k <= 1000`
-- **Time Complexity:** O(n²) where n is the string length, as we check all possible substrings
-- **Space Complexity:** O(1) as we only use constant extra space for counters
-- **Edge Case:** If k = 1, any substring with vowels == consonants is beautiful since any number is divisible by 1
+
+- **Input Size:** `1 <= n <= 10^15` - Very large, can't iterate through all numbers
+- **Time Complexity:** O(log n) - Process digits of n
+- **Space Complexity:** O(log n) - Store digit string and powers of 9
+- **Edge Case:** `n = 1` returns 1
 
 **1.2 High-level approach:**
-For each possible starting position, we expand the substring and maintain counts of vowels and consonants. When both counts are equal and their product is divisible by k, we found a beautiful substring.
 
-![Substring expansion visualization](https://assets.leetcode.com/static_assets/others/substring-expansion.png)
+The key insight is that after removing zeros, we only get numbers with digits 1-9 (zero-free numbers). So the problem reduces to counting how many zero-free numbers are <= n. We use digit DP (dynamic programming) to count these numbers efficiently.
 
 **1.3 Brute force vs. optimized strategy:**
-- **Brute Force:** Generate all substrings and check each one. This is what we do, O(n²).
-- **Optimized Strategy (for larger constraints):** Use prefix sums and hash maps to count in O(n) time, but for n ≤ 1000, the O(n²) approach is acceptable.
+
+- **Brute Force:** Iterate from 1 to n, remove zeros from each, add to a set, return set size. This is O(n) time, which is impossible for n up to 10^15.
+- **Optimized (Digit DP/Combinatorics):** Count zero-free numbers using digit-by-digit construction. For numbers with fewer digits than n, we have 9^d possibilities (9 choices per digit). For numbers with same length as n, we count digit by digit. This is O(log n) time.
+- **Why it's better:** We don't need to iterate through all numbers; we can count them combinatorially by considering digit positions.
 
 **1.4 Decomposition:**
-1. Iterate through all possible starting positions
-2. For each starting position, expand the substring character by character
-3. Maintain counts of vowels and consonants
-4. Check if vowels == consonants and (vowels × consonants) % k == 0
-5. Count valid beautiful substrings
+
+1. Convert n to string to process digits
+2. Precompute powers of 9 (9^1, 9^2, ..., 9^length)
+3. Count zero-free numbers with fewer digits than n
+4. Count zero-free numbers with same length as n, digit by digit
+5. If n itself is zero-free, add 1
 
 ### Steps (The "How")
 
 **2.1 Initialization & Example Setup:**
-Let's use the example: `s = "baeyh"`, `k = 2`
-- Define vowels set: `{'a', 'e', 'i', 'o', 'u'}`
-- Initialize `res = 0`
-
-**2.2 Start Checking:**
-We begin checking substrings starting from index 0.
-
-**2.3 Trace Walkthrough:**
-Using the example `s = "baeyh"`, `k = 2`:
-
-| Start | End | Substring | Vowels | Consonants | Equal? | Product % k | Beautiful? | res |
-|-------|-----|-----------|--------|------------|--------|-------------|-------------|-----|
-| 0 | 0 | "b" | 0 | 1 | No | - | No | 0 |
-| 0 | 1 | "ba" | 1 | 1 | Yes | 1 % 2 = 1 | No | 0 |
-| 0 | 2 | "bae" | 2 | 1 | No | - | No | 0 |
-| 0 | 3 | "baey" | 2 | 2 | Yes | 4 % 2 = 0 | Yes | 1 |
-| 0 | 4 | "baeyh" | 2 | 3 | No | - | No | 1 |
-| 1 | 1 | "a" | 1 | 0 | No | - | No | 1 |
-| 1 | 2 | "ae" | 2 | 0 | No | - | No | 1 |
-| 1 | 3 | "aey" | 2 | 1 | No | - | No | 1 |
-| 1 | 4 | "aeyh" | 2 | 2 | Yes | 4 % 2 = 0 | Yes | 2 |
-
-**2.4 Increment and Loop:**
-For each valid beautiful substring found, we increment the result counter. We continue checking all possible substrings.
+
+Let's use the example: `n = 10`
+
+- String representation: `"10"`, length = 2
+- Precompute `pow9 = [1, 9, 81]` (9^0, 9^1, 9^2)
+
+**2.2 Count Numbers with Fewer Digits:**
+
+```python
+for d in range(1, length):
+    res += pow9[d]
+```
+
+For `n = 10`, we count:
+- 1-digit numbers: 9 (1-9)
+- Total so far: 9
+
+**2.3 Count Numbers with Same Length:**
+
+```python
+for i, ch in enumerate(s):
+    digit = int(ch)
+    if digit == 0:
+        return res  # Can't form any more zero-free numbers
+    res += (digit - 1) * pow9[length - i - 1]
+```
+
+For `n = 10`:
+- First digit: `1`
+  - We can use digits 1-0 (but 0 is not allowed for zero-free)
+  - Actually, we can use digits 1-0, but if we use 0, the number becomes invalid
+  - Wait, let me reconsider: for first digit position, if digit is `1`, we can use `1` only (since we can't use 0)
+  - Actually, the logic is: for digit `d`, we can use digits 1 to (d-1) freely, each giving `9^(remaining)` possibilities
+  - For `n = 10`: first digit is `1`, so we can use `1` only (0 choices for digits < 1)
+  - Second digit: if we used `1` for first, second digit is `0`, which means we can't form any zero-free numbers starting with `1` and second digit < `0`
+  - So we return 9 (from step 2.2)
+
+**2.4 Handle n Itself:**
+
+If we process all digits without hitting 0, `n` itself is zero-free, so we add 1.
 
 **2.5 Return Result:**
-After processing all substrings, `res = 2`, which represents the two beautiful substrings: "baey" and "aeyh".
+
+Return the total count of distinct zero-free numbers.
+
+**Time Complexity:** O(log n) - Process each digit of n  
+**Space Complexity:** O(log n) - Store digit string and powers
diff --git a/explanations/3753/en.md b/explanations/3753/en.md
index 7ad07b6..5e38d36 100644
--- a/explanations/3753/en.md
+++ b/explanations/3753/en.md
@@ -2,65 +2,87 @@
 
 ### Strategy (The "Why")
 
-**Restate the problem:** We need to count paths from (0,0) to (m-1,n-1) in a matrix where the sum of elements on the path is divisible by k. We can only move down or right.
+**Restate the problem:** We need to find the total waviness (count of peaks and valleys) for all numbers in the range `[num1, num2]`. A peak is a digit strictly greater than both neighbors; a valley is a digit strictly less than both neighbors.
 
 **1.1 Constraints & Complexity:**
-- Input size: `1 <= m, n <= 5 * 10^4`, `1 <= m * n <= 5 * 10^4`, `1 <= k <= 50`
-- **Time Complexity:** O(m * n * k) as we maintain k states (remainders) for each cell
-- **Space Complexity:** O(m * n * k) for the DP table
-- **Edge Case:** If k = 1, all paths are valid since any sum is divisible by 1
+
+- **Input Size:** `1 <= num1 <= num2 <= 10^15` - Very large range
+- **Time Complexity:** O(log num2 * 10^5) - Digit DP with memoization
+- **Space Complexity:** O(log num2 * 10^5) - Memoization cache
+- **Edge Case:** Numbers with < 3 digits have waviness 0
 
 **1.2 High-level approach:**
-We use dynamic programming where dp[i][j][r] represents the number of paths to cell (i,j) with sum remainder r modulo k. We only care about remainders, not actual sums.
 
-![DP with modulo states visualization](https://assets.leetcode.com/static_assets/others/dp-modulo-states.png)
+We use digit dynamic programming (digit DP) to count waviness efficiently. Instead of iterating through all numbers (impossible for ranges up to 10^15), we build numbers digit by digit and track the last two digits to detect peaks/valleys. We compute waviness from 0 to num2 and subtract waviness from 0 to num1-1.
 
 **1.3 Brute force vs. optimized strategy:**
-- **Brute Force:** Try all possible paths, which is exponential.
-- **Optimized Strategy:** Use DP with modulo states. Since we only care about sum % k, we maintain k states per cell instead of tracking actual sums, making it feasible.
+
+- **Brute Force:** Iterate from num1 to num2, for each number check all middle digits for peaks/valleys. This is O((num2 - num1) * log num2) time, which is impossible for large ranges.
+- **Optimized (Digit DP):** Build numbers digit by digit, tracking last two digits. When we have enough digits (p2, p1, current), we check for peak/valley. This is O(log num2 * states) time.
+- **Why it's better:** We count waviness for all numbers in a range without explicitly constructing them, using DP states to avoid redundant calculations.
 
 **1.4 Decomposition:**
-1. Initialize DP table with k states (remainders 0 to k-1) for each cell
-2. Set starting position (0,0) with initial remainder
-3. For each cell, update from top and left cells with new remainders
-4. Return dp[m-1][n-1][0] (paths ending with remainder 0)
+
+1. Compute waviness from 0 to num1-1
+2. Compute waviness from 0 to num2
+3. Return difference (waviness in range [num1, num2])
+4. For each range, use digit DP:
+   - State: (position, last_digit, second_last_digit, tight, has_started)
+   - Track total waviness and count of numbers formed
+   - When we have 3+ digits, check for peaks/valleys
 
 ### Steps (The "How")
 
 **2.1 Initialization & Example Setup:**
-Let's use the example: `grid = [[5,2,4],[3,0,5],[0,7,2]]`, `k = 3`
-- Initialize dp[0][0][5%3=2] = 1
-- All other states start at 0
-
-**2.2 Start Processing:**
-We process cells row by row, left to right.
-
-**2.3 Trace Walkthrough:**
-Processing `grid = [[5,2,4],[3,0,5],[0,7,2]]`, `k = 3`:
-
-| Cell (i,j) | Value | From | Old Remainder | New Remainder | dp[i][j][r] |
-|------------|-------|------|---------------|---------------|-------------|
-| (0,0) | 5 | Start | - | 2 | dp[0][0][2]=1 |
-| (0,1) | 2 | Left | 2 | (2+2)%3=1 | dp[0][1][1]=1 |
-| (0,2) | 4 | Left | 1 | (1+4)%3=2 | dp[0][2][2]=1 |
-| (1,0) | 3 | Top | 2 | (2+3)%3=2 | dp[1][0][2]=1 |
-| (1,1) | 0 | Top+Left | 2,1 | (2+0)%3=2, (1+0)%3=1 | dp[1][1][2]=1, dp[1][1][1]=1 |
-| (1,2) | 5 | Top+Left | 2,1 | (2+5)%3=1, (1+5)%3=0 | dp[1][2][1]=1, dp[1][2][0]=1 |
-| (2,0) | 0 | Top | 2 | (2+0)%3=2 | dp[2][0][2]=1 |
-| (2,1) | 7 | Top+Left | 2,1 | (2+7)%3=0, (1+7)%3=2 | dp[2][1][0]=1, dp[2][1][2]=1 |
-| (2,2) | 2 | Top+Left | 0,2 | (0+2)%3=2, (2+2)%3=1 | dp[2][2][2]=1, dp[2][2][1]=1 |
-
-Wait, let me recalculate paths to (2,2):
-- From (1,2) with remainder 0: (0+2)%3=2 → dp[2][2][2] += 1
-- From (1,2) with remainder 1: (1+2)%3=0 → dp[2][2][0] += 1  
-- From (2,1) with remainder 0: (0+2)%3=2 → dp[2][2][2] += 1
-- From (2,1) with remainder 2: (2+2)%3=1 → dp[2][2][1] += 1
-
-So dp[2][2][0] = 1, which is our answer.
-
-**2.4 Increment and Loop:**
-For each cell, we update all k remainder states based on incoming paths from top and left.
-
-**2.5 Return Result:**
-After processing all cells, `dp[m-1][n-1][0] = 2`, representing 2 paths with sum divisible by 3.
 
+Let's use the example: `num1 = 120, num2 = 130`
+
+- Compute `w1 = waviness(0 to 119)`
+- Compute `w2 = waviness(0 to 130)`
+- Return `w2 - w1`
+
+**2.2 Digit DP Function:**
+
+```python
+def dfs(pos, p1, p2, tight, has_started):
+    # pos: current digit position
+    # p1: last digit
+    # p2: second-to-last digit
+    # tight: whether we're still matching the prefix of num
+    # has_started: whether we've started building the number (non-zero digit)
+```
+
+**2.3 Base Case:**
+
+```python
+if pos == length:
+    return 0, 1  # No more waviness, exactly 1 number formed
+```
+
+**2.4 Process Each Digit:**
+
+For each possible digit `d` from 0 to `max_d`:
+- Update `next_tight` and `next_started`
+- Update last two digits: `nd1 = d`, `nd2 = p1`
+- Recursively compute waviness for remaining digits
+
+**2.5 Check for Peak/Valley:**
+
+```python
+if has_started and next_started and p1 is not None and p2 is not None:
+    if (p2 < p1 > d) or (p2 > p1 < d):
+        total_waviness += sub_count
+```
+
+When we have three consecutive digits (p2, p1, d), we check:
+- Peak: `p2 < p1 > d` (middle digit is highest)
+- Valley: `p2 > p1 < d` (middle digit is lowest)
+
+If either condition is true, all numbers formed from this state will have this peak/valley, so we add `sub_count` to waviness.
+
+**2.6 Return Result:**
+
+After processing all digits, return the total waviness for the range.
+
+**Time Complexity:** O(log num2 * states) - Digit DP with memoization  
+**Space Complexity:** O(log num2 * states) - Memoization cache
diff --git a/explanations/3769/en.md b/explanations/3769/en.md
new file mode 100644
index 0000000..de33934
--- /dev/null
+++ b/explanations/3769/en.md
@@ -0,0 +1,69 @@
+## Explanation
+
+### Strategy (The "Why")
+
+**Restate the problem:** We need to sort integers by their binary reflection (reversing binary digits and interpreting as decimal). If two numbers have the same reflection, sort by original value.
+
+**1.1 Constraints & Complexity:**
+
+- **Input Size:** `1 <= nums.length <= 100`, `1 <= nums[i] <= 10^9`
+- **Time Complexity:** O(n log n * log max(nums)) - Sort with comparison function
+- **Space Complexity:** O(1) - Sorting in-place
+- **Edge Case:** All numbers have same reflection
+
+**1.2 High-level approach:**
+
+For each number, compute its binary reflection. Sort by reflection value first, then by original value if reflections are equal.
+
+**1.3 Brute force vs. optimized strategy:**
+
+- **Brute Force:** Precompute all reflections, store in separate array, sort indices. This is O(n log n) but uses extra space.
+- **Optimized (Custom Sort Key):** Use a key function that computes reflection on-the-fly during sorting. This is O(n log n) with O(1) extra space.
+- **Why it's better:** The custom key function is clean and doesn't require precomputation or extra storage.
+
+**1.4 Decomposition:**
+
+1. Define function to compute binary reflection
+2. Sort array using custom key: (reflection, original_value)
+3. Return sorted array
+
+### Steps (The "How")
+
+**2.1 Initialization & Example Setup:**
+
+Let's use the example: `nums = [4,5,4]`
+
+- Binary reflections:
+  - 4 → `100` → reversed `001` → 1
+  - 5 → `101` → reversed `101` → 5
+  - 4 → `100` → reversed `001` → 1
+
+**2.2 Define Binary Reflection Function:**
+
+```python
+def binary_reflection(n):
+    binary = bin(n)[2:]  # Remove '0b' prefix: "100"
+    reversed_binary = binary[::-1]  # "001"
+    return int(reversed_binary, 2)  # 1
+```
+
+**2.3 Sort with Custom Key:**
+
+```python
+return sorted(nums, key=lambda x: (binary_reflection(x), x))
+```
+
+Sort key is `(reflection, original)`:
+- `(1, 4)` for first 4
+- `(5, 5)` for 5
+- `(1, 4)` for second 4
+
+Sorting: `(1, 4) < (1, 4) < (5, 5)` → `[4, 4, 5]`
+
+**2.4 Return Result:**
+
+The sorted array maintains order: same reflection values are sorted by original value.
+
+**Time Complexity:** O(n log n * log max(nums)) - Sort with O(log max) comparison  
+**Space Complexity:** O(1) - In-place sort
+
diff --git a/explanations/3774/en.md b/explanations/3774/en.md
new file mode 100644
index 0000000..2017f50
--- /dev/null
+++ b/explanations/3774/en.md
@@ -0,0 +1,65 @@
+## Explanation
+
+### Strategy (The "Why")
+
+**Restate the problem:** We need to find the absolute difference between the sum of the `k` largest elements and the sum of the `k` smallest elements in the array.
+
+**1.1 Constraints & Complexity:**
+
+- **Input Size:** `1 <= n <= 100`, `1 <= nums[i] <= 100`, `1 <= k <= n`
+- **Time Complexity:** O(n log n) - Sorting dominates
+- **Space Complexity:** O(1) - Only using input array
+- **Edge Case:** `k = n` means we use all elements
+
+**1.2 High-level approach:**
+
+Sort the array, then take the `k` largest elements (last `k` elements) and `k` smallest elements (first `k` elements). Calculate the difference between their sums.
+
+**1.3 Brute force vs. optimized strategy:**
+
+- **Brute Force:** Find k largest and k smallest without sorting, using multiple passes. This is O(n * k) time.
+- **Optimized (Sorting):** Sort once, then directly access first k and last k elements. This is O(n log n) time.
+- **Why it's better:** For small arrays (n <= 100), sorting is efficient and makes the solution simple and clear.
+
+**1.4 Decomposition:**
+
+1. Sort the array in ascending order
+2. Sum the first `k` elements (smallest)
+3. Sum the last `k` elements (largest)
+4. Return absolute difference
+
+### Steps (The "How")
+
+**2.1 Initialization & Example Setup:**
+
+Let's use the example: `nums = [5,2,2,4], k = 2`
+
+- After sorting: `[2, 2, 4, 5]`
+
+**2.2 Sort the Array:**
+
+```python
+nums.sort()  # [2, 2, 4, 5]
+```
+
+**2.3 Calculate Sum of k Smallest:**
+
+```python
+sum_smallest = sum(nums[:k])  # sum([2, 2]) = 4
+```
+
+**2.4 Calculate Sum of k Largest:**
+
+```python
+sum_largest = sum(nums[-k:])  # sum([4, 5]) = 9
+```
+
+**2.5 Return Absolute Difference:**
+
+```python
+return abs(sum_largest - sum_smallest)  # abs(9 - 4) = 5
+```
+
+**Time Complexity:** O(n log n) - Sorting  
+**Space Complexity:** O(1) - In-place sort
+
diff --git a/explanations/3775/en.md b/explanations/3775/en.md
new file mode 100644
index 0000000..5e3f997
--- /dev/null
+++ b/explanations/3775/en.md
@@ -0,0 +1,77 @@
+## Explanation
+
+### Strategy (The "Why")
+
+**Restate the problem:** We need to count vowels in the first word, then reverse each following word that has the same vowel count. Leave other words unchanged.
+
+**1.1 Constraints & Complexity:**
+
+- **Input Size:** `1 <= s.length <= 10^5`
+- **Time Complexity:** O(n) - Single pass through string
+- **Space Complexity:** O(n) - Store words and result
+- **Edge Case:** Empty string or single word
+
+**1.2 High-level approach:**
+
+Split the string into words. Count vowels in the first word. For each subsequent word, if its vowel count matches the first word's count, reverse it. Otherwise, keep it as-is.
+
+**1.3 Brute force vs. optimized strategy:**
+
+- **Brute Force:** Multiple passes - one to count vowels in first word, another to process each word. This is still O(n) but less efficient.
+- **Optimized (Single Pass):** Split once, count vowels in first word, then process each word in one pass. This is O(n) time.
+- **Why it's better:** We process the string efficiently in a single logical pass, making the code clear and maintainable.
+
+**1.4 Decomposition:**
+
+1. Split string into words
+2. Count vowels in first word
+3. For each subsequent word:
+   - Count its vowels
+   - If count matches first word, reverse it
+   - Otherwise, keep as-is
+4. Join words back into string
+
+### Steps (The "How")
+
+**2.1 Initialization & Example Setup:**
+
+Let's use the example: `s = "cat and mice"`
+
+- Words: `["cat", "and", "mice"]`
+- Vowels: `{'a', 'e', 'i', 'o', 'u'}`
+
+**2.2 Split into Words:**
+
+```python
+words = s.split()  # ["cat", "and", "mice"]
+```
+
+**2.3 Count Vowels in First Word:**
+
+```python
+first_vowel_count = sum(1 for c in words[0] if c in vowels)  # "cat" has 1 vowel: 'a'
+```
+
+**2.4 Process Each Subsequent Word:**
+
+```python
+for word in words[1:]:
+    vowel_count = sum(1 for c in word if c in vowels)
+    if vowel_count == first_vowel_count:
+        res.append(word[::-1])  # Reverse
+    else:
+        res.append(word)  # Keep as-is
+```
+
+For `"and"`: vowel_count = 1 (matches), so reverse → `"dna"`  
+For `"mice"`: vowel_count = 2 (doesn't match), so keep → `"mice"`
+
+**2.5 Join and Return:**
+
+```python
+return ' '.join(res)  # "cat dna mice"
+```
+
+**Time Complexity:** O(n) - Process each character once  
+**Space Complexity:** O(n) - Store words and result
+
diff --git a/explanations/3776/en.md b/explanations/3776/en.md
new file mode 100644
index 0000000..4c28839
--- /dev/null
+++ b/explanations/3776/en.md
@@ -0,0 +1,100 @@
+## Explanation
+
+### Strategy (The "Why")
+
+**Restate the problem:** We have a circular array where each person can transfer 1 unit to left or right neighbor. Find minimum moves to make all balances non-negative. Return -1 if impossible.
+
+**1.1 Constraints & Complexity:**
+
+- **Input Size:** `1 <= n <= 10^5`, `-10^9 <= balance[i] <= 10^9`
+- **Time Complexity:** O(n log n) - Sort positive indices by distance
+- **Space Complexity:** O(n) - Store positive indices
+- **Edge Case:** No negative balance (return 0), total sum < 0 (return -1)
+
+**1.2 High-level approach:**
+
+Find the negative balance index. Sort all positive indices by their circular distance from the negative index. Greedily transfer from closest positive neighbors until the negative is balanced.
+
+**1.3 Brute force vs. optimized strategy:**
+
+- **Brute Force:** Try all possible transfer sequences. This is exponential.
+- **Optimized (Greedy):** Always transfer from the closest positive neighbor. This minimizes total moves. This is O(n log n) due to sorting.
+- **Why it's better:** The greedy approach is optimal because transferring from closer neighbors minimizes the total distance traveled by units.
+
+**1.4 Decomposition:**
+
+1. Check if total sum < 0, return -1
+2. Find negative balance index
+3. If no negative, return 0
+4. Sort positive indices by circular distance from negative
+5. Greedily transfer from closest positives until negative is balanced
+6. Return total moves
+
+### Steps (The "How")
+
+**2.1 Initialization & Example Setup:**
+
+Let's use the example: `balance = [5,1,-4]`
+
+- Total sum: `5 + 1 - 4 = 2 >= 0` ✓
+- Negative index: `2` (value -4)
+
+**2.2 Check Total Sum:**
+
+```python
+total = sum(balance)
+if total < 0:
+    return -1
+```
+
+**2.3 Find Negative Index:**
+
+```python
+for i in range(n):
+    if balance[i] < 0:
+        neg_idx = i
+        break
+```
+
+**2.4 Sort Positive Indices by Distance:**
+
+```python
+positives = []
+for i in range(n):
+    if balance[i] > 0:
+        dist1 = (i - neg_idx) % n
+        dist2 = (neg_idx - i) % n
+        dist = min(dist1, dist2)
+        positives.append((dist, i, balance[i]))
+positives.sort()
+```
+
+For `balance = [5,1,-4]`, `neg_idx = 2`:
+- Index 0: dist = min(1, 2) = 1, amount = 5
+- Index 1: dist = min(2, 1) = 1, amount = 1
+- Sorted: `[(1, 0, 5), (1, 1, 1)]`
+
+**2.5 Greedily Transfer:**
+
+```python
+needed = abs(balance[neg_idx])  # 4
+for dist, idx, amount in positives:
+    if needed <= 0:
+        break
+    transfer = min(needed, amount)
+    res += transfer * dist
+    needed -= transfer
+```
+
+- From index 0: transfer 4, moves = 4 * 1 = 4
+- Needed = 0, done
+
+**2.6 Return Result:**
+
+```python
+return res if needed <= 0 else -1  # 4
+```
+
+**Time Complexity:** O(n log n) - Sort positive indices  
+**Space Complexity:** O(n) - Store positive indices
+
diff --git a/explanations/3777/en.md b/explanations/3777/en.md
new file mode 100644
index 0000000..0ec7f4d
--- /dev/null
+++ b/explanations/3777/en.md
@@ -0,0 +1,75 @@
+## Explanation
+
+### Strategy (The "Why")
+
+**Restate the problem:** We have a string of 'A' and 'B', and two types of queries: flip a character, or find minimum deletions to make a substring alternating.
+
+**1.1 Constraints & Complexity:**
+
+- **Input Size:** `1 <= n <= 10^5`, `1 <= q <= 10^5`
+- **Time Complexity:** O(n + q log n) - Initialize Fenwick tree + q queries
+- **Space Complexity:** O(n) - Fenwick tree
+- **Edge Case:** Empty string, single character (always alternating)
+
+**1.2 High-level approach:**
+
+Use a Fenwick Tree (Binary Indexed Tree) to track "violations" - adjacent identical characters. Each violation requires 1 deletion. For query type 2, count violations in the range. For query type 1, update violations at affected positions.
+
+**1.3 Brute force vs. optimized strategy:**
+
+- **Brute Force:** For each type 2 query, scan the substring and count violations. This is O(q * n) time.
+- **Optimized (Fenwick Tree):** Precompute violations, use Fenwick tree for range sum queries and point updates. This is O(n + q log n) time.
+- **Why it's better:** Fenwick tree allows O(log n) range queries and updates, making it efficient for many queries.
+
+**1.4 Decomposition:**
+
+1. Convert string to 0-1 array (A=0, B=1)
+2. Initialize Fenwick tree with violations (adjacent identical)
+3. For each query:
+   - Type 1: Flip character, update violations at i and i+1
+   - Type 2: Query range sum of violations
+
+### Steps (The "How")
+
+**2.1 Initialization & Example Setup:**
+
+Let's use the example: `s = "ABA", queries = [[2,1,2],[1,1],[2,0,2]]`
+
+- Convert to array: `A = [0, 1, 0]`
+- Initialize Fenwick tree
+
+**2.2 Initialize Violations:**
+
+```python
+for i in range(n - 1):
+    if A[i] == A[i+1]:
+        bit.add(i + 1, 1)
+```
+
+For `"ABA"`: No violations initially (A≠B, B≠A)
+
+**2.3 Process Queries:**
+
+**Query 1: [2, 1, 2]** - Query substring `s[1:3] = "BA"`
+- Range sum: `bit.query(2) - bit.query(1) = 0 - 0 = 0`
+- Result: `0` (already alternating)
+
+**Query 2: [1, 1]** - Flip `s[1]` from B to A
+- `A[1] ^= 1` → `A = [0, 0, 0]`
+- Update violations:
+  - At position 0: `A[0] == A[1]` → add 1
+  - At position 2: `A[1] == A[2]` → add 1
+
+**Query 3: [2, 0, 2]** - Query substring `s[0:3] = "AAA"`
+- Range sum: `bit.query(2) - bit.query(0) = 2 - 0 = 2`
+- Result: `2` (need to delete 2 characters)
+
+**2.4 Fenwick Tree Operations:**
+
+- `add(i, delta)`: Update tree at position i
+- `query(i)`: Get prefix sum up to position i
+- Range query `[l, r]`: `query(r) - query(l)`
+
+**Time Complexity:** O(n + q log n) - Initialize + q queries  
+**Space Complexity:** O(n) - Fenwick tree
+
diff --git a/requirements.txt b/requirements.txt
new file mode 100644
index 0000000..139597f
--- /dev/null
+++ b/requirements.txt
@@ -0,0 +1,2 @@
+
+
diff --git a/scripts/update_problems_from_leetcode.py b/scripts/update_problems_from_leetcode.py
new file mode 100755
index 0000000..9a4871d
--- /dev/null
+++ b/scripts/update_problems_from_leetcode.py
@@ -0,0 +1,327 @@
+#!/usr/bin/env python3
+
+"""
+Script to update leetcode-problems.json from LeetCode API.
+Fetches problems from LeetCode GraphQL API and adds missing problems.
+Uses the frontend problem number (questionFrontendId) as the ID.
+
+Requirements:
+    pip install requests
+"""
+
+import json
+import os
+import sys
+import time
+import requests
+from collections import OrderedDict
+from typing import Dict, List, Optional
+
+# Paths
+JSON_PATH = "data/leetcode-problems.json"
+
+# LeetCode GraphQL API endpoint
+LEETCODE_API_URL = "https://leetcode.com/graphql/"
+
+# GraphQL query to fetch problems
+PROBLEMS_QUERY = """
+query problemsetQuestionList($categorySlug: String, $limit: Int, $skip: Int, $filters: QuestionListFilterInput) {
+  problemsetQuestionList: questionList(
+    categorySlug: $categorySlug
+    limit: $limit
+    skip: $skip
+    filters: $filters
+  ) {
+    total: totalNum
+    questions: data {
+      acRate
+      difficulty
+      freqBar
+      frontendQuestionId: questionFrontendId
+      isFavor
+      paidOnly: isPaidOnly
+      status
+      title
+      titleSlug
+      topicTags {
+        name
+        slug
+      }
+      hasSolution
+      hasVideoSolution
+    }
+  }
+}
+"""
+
+
+def map_tags_to_category(tags: List[Dict[str, str]]) -> str:
+    """Map LeetCode topic tags to JSON category format."""
+    if not tags:
+        return "Array & Hashing"
+
+    tag_names = [tag.get("name", "").lower() for tag in tags]
+    tag_slugs = [tag.get("slug", "").lower() for tag in tags]
+    all_tags = tag_names + tag_slugs
+
+    # Priority mapping based on existing JSON structure
+    if any("database" in t for t in all_tags):
+        return "Database"
+    elif any("tree" in t or "binary-tree" in t or "bst" in t for t in all_tags):
+        return "Tree"
+    elif any(
+        "graph" in t
+        or "dfs" in t
+        or "depth-first" in t
+        or "bfs" in t
+        or "breadth-first" in t
+        or "union-find" in t
+        for t in all_tags
+    ):
+        return "Graph Traversal"
+    elif any(
+        "dynamic-programming" in t or "dp" in t or "memoization" in t for t in all_tags
+    ):
+        return "Dynamic Programming"
+    elif any("backtracking" in t for t in all_tags):
+        return "Backtracking"
+    elif any("sliding-window" in t for t in all_tags):
+        return "Sliding Window"
+    elif any("binary-search" in t for t in all_tags):
+        return "Binary Search"
+    elif any("heap" in t or "priority-queue" in t for t in all_tags):
+        return "Heap (Priority Queue)"
+    elif any("stack" in t or "monotonic-stack" in t for t in all_tags):
+        return "Stack"
+    elif any("linked-list" in t for t in all_tags):
+        return "Linked List"
+    elif any("trie" in t or "prefix-tree" in t for t in all_tags):
+        return "Trie"
+    elif any("bit-manipulation" in t or "bitmask" in t for t in all_tags):
+        return "Bit Manipulation"
+    elif any("greedy" in t for t in all_tags):
+        return "Greedy"
+    elif any(
+        "math" in t
+        or "geometry" in t
+        or "number-theory" in t
+        or "combinatorics" in t
+        for t in all_tags
+    ):
+        return "Math & Geometry"
+    elif any("two-pointers" in t for t in all_tags):
+        return "Two Pointers"
+    elif any("intervals" in t for t in all_tags):
+        return "Intervals"
+    elif any("topological" in t for t in all_tags):
+        return "Topological Sort"
+    elif any("array" in t or "hash-table" in t or "hash" in t for t in all_tags):
+        return "Array & Hashing"
+    elif any("string" in t for t in all_tags):
+        return "Array & Hashing"
+    else:
+        return "Array & Hashing"  # default
+
+
+def map_difficulty(difficulty: str) -> str:
+    """Map LeetCode difficulty to JSON format."""
+    difficulty_map = {
+        "Easy": "Easy",
+        "Medium": "Medium",
+        "Hard": "Hard",
+    }
+    return difficulty_map.get(difficulty, "Easy")
+
+
+def fetch_problems_batch(limit: int = 50, skip: int = 0) -> Optional[Dict]:
+    """Fetch a batch of problems from LeetCode GraphQL API."""
+    variables = {
+        "categorySlug": "",
+        "skip": skip,
+        "limit": limit,
+        "filters": {},
+    }
+
+    payload = {"query": PROBLEMS_QUERY, "variables": variables}
+
+    try:
+        response = requests.post(
+            LEETCODE_API_URL,
+            json=payload,
+            headers={
+                "Content-Type": "application/json",
+                "User-Agent": "Mozilla/5.0 (Windows NT 10.0; Win64; x64) AppleWebKit/537.36",
+            },
+            timeout=30,
+        )
+        response.raise_for_status()
+        return response.json()
+    except requests.exceptions.RequestException as e:
+        print(f"Error fetching problems (skip={skip}, limit={limit}): {e}")
+        return None
+
+
+def fetch_all_problems() -> Dict[str, Dict]:
+    """Fetch all problems from LeetCode API."""
+    problems = {}
+    skip = 0
+    limit = 50  # LeetCode API limit per request
+    batch_delay = 2  # Delay between requests to avoid rate limiting
+
+    print("Fetching problems from LeetCode API...")
+    print("This may take a while due to rate limiting...")
+
+    while True:
+        print(f"Fetching batch: skip={skip}, limit={limit}...", end=" ", flush=True)
+        data = fetch_problems_batch(limit=limit, skip=skip)
+
+        if not data:
+            print("Failed")
+            break
+
+        try:
+            question_list = data.get("data", {}).get("problemsetQuestionList", {})
+            questions = question_list.get("questions", [])
+            total = question_list.get("total", 0)
+
+            if not questions:
+                print("No more questions")
+                break
+
+            for question in questions:
+                frontend_id = question.get("frontendQuestionId")
+                if not frontend_id:
+                    continue
+
+                # Skip premium problems if needed (optional)
+                # if question.get("paidOnly"):
+                #     continue
+
+                problem_id = str(frontend_id)
+                title = question.get("title", "")
+                title_slug = question.get("titleSlug", "")
+                difficulty = map_difficulty(question.get("difficulty", "Easy"))
+                tags = question.get("topicTags", [])
+
+                category = map_tags_to_category(tags)
+                link = f"https://leetcode.com/problems/{title_slug}/"
+
+                problems[problem_id] = {
+                    "id": int(frontend_id),
+                    "category": category,
+                    "title": title,
+                    "difficulty": difficulty,
+                    "link": link,
+                }
+
+            print(f"Got {len(questions)} problems (total so far: {len(problems)})")
+
+            # Check if we've fetched all problems
+            if skip + len(questions) >= total:
+                print(f"Fetched all {total} problems")
+                break
+
+            skip += limit
+            time.sleep(batch_delay)  # Rate limiting
+
+        except KeyError as e:
+            print(f"Error parsing response: {e}")
+            print(f"Response: {json.dumps(data, indent=2)[:500]}")
+            break
+
+    return problems
+
+
+def load_existing_json() -> Dict:
+    """Load existing JSON file."""
+    if not os.path.exists(JSON_PATH):
+        return {}
+
+    try:
+        with open(JSON_PATH, "r", encoding="utf-8") as f:
+            return json.load(f)
+    except Exception as e:
+        print(f"Error reading JSON: {e}")
+        return {}
+
+
+def save_json(data: Dict):
+    """Save JSON file sorted by problem ID."""
+    try:
+        # Sort by problem ID (convert key to int for proper numeric sorting)
+        sorted_items = sorted(
+            data.items(),
+            key=lambda item: int(item[0]) if item[0].isdigit() else float("inf"),
+        )
+        sorted_data = OrderedDict(sorted_items)
+
+        # Write JSON (Prettier will format it via pre-commit hook)
+        with open(JSON_PATH, "w", encoding="utf-8") as f:
+            json.dump(sorted_data, f, ensure_ascii=False, indent=2)
+        return True
+    except Exception as e:
+        print(f"Error saving JSON: {e}")
+        return False
+
+
+def main():
+    """Main function to update JSON from LeetCode API."""
+    print("=" * 60)
+    print("LeetCode Problems Updater")
+    print("=" * 60)
+
+    print("\nLoading existing JSON file...")
+    existing_json = load_existing_json()
+    print(f"Found {len(existing_json)} problems in existing JSON")
+
+    print("\nFetching problems from LeetCode API...")
+    print("Note: This will take several minutes due to rate limiting.")
+    print("The script will fetch in batches with delays between requests.\n")
+
+    leetcode_problems = fetch_all_problems()
+    print(f"\nFetched {len(leetcode_problems)} problems from LeetCode")
+
+    if not leetcode_problems:
+        print("No problems fetched. Exiting.")
+        sys.exit(1)
+
+    # Find missing and updated problems
+    missing = []
+    updated = []
+
+    for problem_id, problem_data in leetcode_problems.items():
+        if problem_id not in existing_json:
+            missing.append(problem_id)
+            existing_json[problem_id] = problem_data
+        else:
+            # Update existing entry (in case data changed)
+            existing_json[problem_id] = problem_data
+            updated.append(problem_id)
+
+    print("-" * 60)
+    print(f"Found {len(missing)} missing problems")
+    print(f"Updated {len(updated)} existing problems")
+
+    if missing:
+        print("\nMissing problems (first 20):")
+        for pid in sorted(missing, key=int)[:20]:
+            print(f"  {pid}: {leetcode_problems[pid]['title']}")
+        if len(missing) > 20:
+            print(f"  ... and {len(missing) - 20} more")
+
+    # Save updated JSON
+    print(f"\nSaving updated JSON to {JSON_PATH}...")
+    if save_json(existing_json):
+        print(f"Successfully saved {len(existing_json)} problems to JSON")
+    else:
+        print("Failed to save JSON")
+        sys.exit(1)
+
+    print("\n" + "=" * 60)
+    print("Update complete!")
+    print("=" * 60)
+
+
+if __name__ == "__main__":
+    main()
+
diff --git a/solutions/3676/01.py b/solutions/3676/01.py
new file mode 100644
index 0000000..7f0c777
--- /dev/null
+++ b/solutions/3676/01.py
@@ -0,0 +1,20 @@
+class Solution:
+    def bowlSubarrays(self, nums: List[int]) -> int:
+        res = 0
+        stack = []
+        
+        for r, val in enumerate(nums):
+            # Pop elements that are <= current (they can form bowls with current)
+            while stack and nums[stack[-1]] <= val:
+                l = stack.pop()
+                if r - l + 1 >= 3:
+                    res += 1
+            
+            # Check if current element forms a bowl with stack top
+            if stack and r - stack[-1] + 1 >= 3:
+                res += 1
+            
+            stack.append(r)
+        
+        return res
+
diff --git a/solutions/3679/01.py b/solutions/3679/01.py
new file mode 100644
index 0000000..7ae8165
--- /dev/null
+++ b/solutions/3679/01.py
@@ -0,0 +1,22 @@
+class Solution:
+    def minArrivalsToDiscard(self, arrivals: List[int], w: int, m: int) -> int:
+        mx = max(arrivals) if arrivals else 0
+        ctr = [0] * (mx + 1)
+        res = 0
+        
+        for idx, item in enumerate(arrivals):
+            # Remove item that left the window
+            if idx >= w:
+                left_item = arrivals[idx - w]
+                if left_item != 0:  # Only decrement if it was kept
+                    ctr[left_item] -= 1
+            
+            # Check if we need to discard
+            if ctr[item] >= m:
+                res += 1
+                arrivals[idx] = 0  # Mark as discarded
+            else:
+                ctr[item] += 1
+        
+        return res
+
diff --git a/solutions/3680/01.py b/solutions/3680/01.py
new file mode 100644
index 0000000..b2832b2
--- /dev/null
+++ b/solutions/3680/01.py
@@ -0,0 +1,37 @@
+class Solution:
+    def generateSchedule(self, n: int) -> List[List[int]]:
+        res = []
+        if n < 5:
+            return res
+        if n % 2:
+            # Odd n: Adjacent pairs
+            for i in range(0, 2 * n, 2):
+                res.append([i % n, (i + 1) % n])
+            for i in range(0, 2 * n, 2):
+                res.append([(i + 1) % n, i % n])
+        else:
+            # Even n: Adjacent pairs
+            for i in range(0, n, 2):
+                res.append([i, i + 1])
+            for i in range(0, n, 2):
+                res.append([i + 1, i])
+            for i in range(1, n, 2):
+                res.append([i, (i + 1) % n])
+            for i in range(1, n, 2):
+                res.append([(i + 1) % n, i])
+
+        for diff in range(2, (n + 1) // 2):
+            # Find pairs that are diff apart
+            start = res[-1][0] + 1
+            for i in range(start, start + n):
+                res.append([i % n, (i + diff) % n])
+            start = res[-1][-1] - 1
+            for i in range(start, start + n):
+                res.append([(i + diff) % n, i % n])
+            
+        if n % 2 == 0:
+            # Find pairs that are n/2 apart
+            start = res[-1][0] - 1
+            for i in range(start, start + n):
+                res.append([i % n, (i + n // 2) % n])
+        return res
diff --git a/solutions/3685/01.py b/solutions/3685/01.py
new file mode 100644
index 0000000..02bfa96
--- /dev/null
+++ b/solutions/3685/01.py
@@ -0,0 +1,54 @@
+class Solution:
+    def subsequenceSumAfterCapping(self, nums: List[int], k: int) -> List[bool]:
+        n = len(nums)
+        
+        # Sort in ascending order
+        sorted_nums = sorted(nums)
+        
+        # Precompute subset-sum DP for all elements
+        # dp[i][j] = can we achieve sum j using first i elements
+        dp = [[False] * (k + 1) for _ in range(n + 1)]
+        
+        # Base case: sum 0 is always possible
+        for i in range(n + 1):
+            dp[i][0] = True
+        
+        # Fill DP table
+        for i in range(1, n + 1):
+            for j in range(1, k + 1):
+                if sorted_nums[i - 1] <= j:
+                    dp[i][j] = dp[i - 1][j - sorted_nums[i - 1]] or dp[i - 1][j]
+                else:
+                    dp[i][j] = dp[i - 1][j]
+        
+        res = []
+        # For each cap value x from 1 to n
+        for x in range(1, n + 1):
+            # Find first index where element > x
+            ind = n
+            for i in range(n):
+                if sorted_nums[i] > x:
+                    ind = i
+                    break
+            
+            # If no element > x, use original array result
+            if ind == n:
+                res.append(dp[n][k])
+            else:
+                # Elements from ind to n-1 will be capped to x
+                sz = n - ind  # Number of elements that become x
+                
+                # Check if we can form sum k
+                found = False
+                for j in range(k + 1):
+                    if dp[ind][j]:  # Can form sum j with first ind elements
+                        remainder = k - j
+                        if remainder % x == 0:
+                            multiple = remainder // x
+                            if multiple <= sz:  # We have enough x's
+                                found = True
+                                break
+                res.append(found)
+        
+        return res
+
diff --git a/solutions/3689/01.py b/solutions/3689/01.py
new file mode 100644
index 0000000..2f90259
--- /dev/null
+++ b/solutions/3689/01.py
@@ -0,0 +1,8 @@
+class Solution:
+    def maxTotalValue(self, nums: List[int], k: int) -> int:
+        # The hint says to choose the whole subarray k times
+        # Value of whole subarray = max(nums) - min(nums)
+        max_val = max(nums)
+        min_val = min(nums)
+        return (max_val - min_val) * k
+
diff --git a/solutions/3747/01.py b/solutions/3747/01.py
index e713e8d..33488cd 100644
--- a/solutions/3747/01.py
+++ b/solutions/3747/01.py
@@ -1,22 +1,23 @@
 class Solution:
     def countDistinct(self, n: int) -> int:
-        # For each integer x from 1 to n, remove zeros and count distinct results
-        distinct_set = set()
-
-        for x in range(1, n + 1):
-            # Remove zeros from decimal representation
-            s = str(x)
-            s_no_zeros = s.replace("0", "")
-            if s_no_zeros:  # If not empty after removing zeros
-                distinct_set.add(int(s_no_zeros))
-            else:
-                # If all zeros, the result is empty, but we can represent it as 0 or empty
-                # Actually, removing zeros from a number with only zeros gives empty string
-                # But we need to handle this - let's check the examples
-                # For n=10: 10 -> "10" -> "1" -> 1
-                # So we should add something for numbers that become empty
-                # Actually, looking at example: n=10 gives 9 distinct (1-9), and 10 becomes 1
-                # So empty strings might not be counted, or they become 0
-                pass
-
-        return len(distinct_set)
+        s = str(n)
+        length = len(s)
+        
+        pow9 = [1] * (length + 1)
+        for i in range(1, length + 1):
+            pow9[i] = pow9[i-1] * 9
+        
+        res = 0
+        # Count zero-free numbers with fewer digits
+        for d in range(1, length):
+            res += pow9[d]
+        
+        # Count zero-free numbers with same length as n
+        for i, ch in enumerate(s):
+            digit = int(ch)
+            if digit == 0:
+                return res
+            res += (digit - 1) * pow9[length - i - 1]
+        
+        # n itself is zero-free
+        return res + 1
diff --git a/solutions/3753/01.py b/solutions/3753/01.py
index 54bc03e..1e1242e 100644
--- a/solutions/3753/01.py
+++ b/solutions/3753/01.py
@@ -1,22 +1,49 @@
+from functools import lru_cache
+
 class Solution:
     def totalWaviness(self, num1: int, num2: int) -> int:
-        def get_waviness(n):
-            s = str(n)
-            if len(s) < 3:
-                return 0
-
-            waviness = 0
-            for i in range(1, len(s) - 1):
-                # Check if digit at i is a peak or valley
-                if s[i] > s[i - 1] and s[i] > s[i + 1]:
-                    waviness += 1  # Peak
-                elif s[i] < s[i - 1] and s[i] < s[i + 1]:
-                    waviness += 1  # Valley
-
-            return waviness
-
-        res = 0
-        for num in range(num1, num2 + 1):
-            res += get_waviness(num)
-
-        return res
+        w1 = self._total_waviness_upto(num1 - 1)
+        w2 = self._total_waviness_upto(num2)
+        return w2 - w1
+
+    def _total_waviness_upto(self, num: int) -> int:
+        digits = [int(c) for c in str(num)]
+        length = len(digits)
+
+        @lru_cache(None)
+        def dfs(pos, p1, p2, tight, has_started):
+            if pos == length:
+                return 0, 1  # no more waviness, exactly 1 number formed
+
+            max_d = digits[pos] if tight else 9
+            total_waviness = 0
+            total_count = 0
+
+            for d in range(max_d + 1):
+                next_tight = tight and (d == digits[pos])
+                next_started = has_started or (d != 0)
+
+                # Update last two real digits
+                if not next_started:
+                    nd1, nd2 = None, None
+                elif not has_started:
+                    nd1, nd2 = d, None
+                else:
+                    nd1, nd2 = d, p1
+
+                sub_waviness, sub_count = dfs(
+                    pos + 1, nd1, nd2, next_tight, next_started
+                )
+
+                # Always add downstream waviness
+                total_waviness += sub_waviness
+                total_count += sub_count
+
+                # If we have enough digits to form a triple, check peak/valley
+                if has_started and next_started and p1 is not None and p2 is not None:
+                    if (p2 < p1 > d) or (p2 > p1 < d):
+                        total_waviness += sub_count  # this peak/valley applies to all completions
+
+            return total_waviness, total_count
+
+        return dfs(0, None, None, True, False)[0]
diff --git a/solutions/3769/01.py b/solutions/3769/01.py
index 21c7fa2..4e16664 100644
--- a/solutions/3769/01.py
+++ b/solutions/3769/01.py
@@ -1,15 +1,9 @@
-from typing import List
-
-
 class Solution:
     def sortByReflection(self, nums: List[int]) -> List[int]:
         def binary_reflection(n):
-            # Convert to binary, remove '0b' prefix, reverse, convert back to int
-            binary = bin(n)[2:]
+            # Convert to binary, reverse, convert back
+            binary = bin(n)[2:]  # Remove '0b' prefix
             reversed_binary = binary[::-1]
             return int(reversed_binary, 2)
-
-        # Sort by binary reflection, then by original value if reflection is equal
-        res = sorted(nums, key=lambda x: (binary_reflection(x), x))
-        return res
-
+        
+        return sorted(nums, key=lambda x: (binary_reflection(x), x))
diff --git a/solutions/3774/01.py b/solutions/3774/01.py
new file mode 100644
index 0000000..63399cb
--- /dev/null
+++ b/solutions/3774/01.py
@@ -0,0 +1,7 @@
+class Solution:
+    def absDifference(self, nums: List[int], k: int) -> int:
+        nums.sort()
+        sum_largest = sum(nums[-k:])
+        sum_smallest = sum(nums[:k])
+        return abs(sum_largest - sum_smallest)
+
diff --git a/solutions/3775/01.py b/solutions/3775/01.py
new file mode 100644
index 0000000..85679cc
--- /dev/null
+++ b/solutions/3775/01.py
@@ -0,0 +1,19 @@
+class Solution:
+    def reverseWords(self, s: str) -> str:
+        words = s.split()
+        if not words:
+            return ""
+        
+        vowels = {'a', 'e', 'i', 'o', 'u'}
+        first_vowel_count = sum(1 for c in words[0] if c in vowels)
+        
+        res = [words[0]]
+        for word in words[1:]:
+            vowel_count = sum(1 for c in word if c in vowels)
+            if vowel_count == first_vowel_count:
+                res.append(word[::-1])
+            else:
+                res.append(word)
+        
+        return ' '.join(res)
+
diff --git a/solutions/3776/01.py b/solutions/3776/01.py
new file mode 100644
index 0000000..d67352e
--- /dev/null
+++ b/solutions/3776/01.py
@@ -0,0 +1,51 @@
+class Solution:
+    def minMoves(self, balance: List[int]) -> int:
+        n = len(balance)
+        total = sum(balance)
+        
+        # If total is negative, impossible
+        if total < 0:
+            return -1
+        
+        # Find the negative index
+        neg_idx = -1
+        for i in range(n):
+            if balance[i] < 0:
+                neg_idx = i
+                break
+        
+        # If no negative, already balanced
+        if neg_idx == -1:
+            return 0
+        
+        res = 0
+        # Greedily transfer from nearest positive neighbors
+        # We need to move abs(balance[neg_idx]) units to neg_idx
+        
+        needed = abs(balance[neg_idx])
+        
+        # Try both directions and take minimum
+        # Actually, we need to find the optimal way to transfer
+        
+        # Sort positive indices by distance from negative index
+        positives = []
+        for i in range(n):
+            if balance[i] > 0:
+                # Calculate circular distance
+                dist1 = (i - neg_idx) % n
+                dist2 = (neg_idx - i) % n
+                dist = min(dist1, dist2)
+                positives.append((dist, i, balance[i]))
+        
+        positives.sort()
+        
+        # Greedily use closest positives
+        for dist, idx, amount in positives:
+            if needed <= 0:
+                break
+            transfer = min(needed, amount)
+            res += transfer * dist
+            needed -= transfer
+        
+        return res if needed <= 0 else -1
+
diff --git a/solutions/3777/01.py b/solutions/3777/01.py
new file mode 100644
index 0000000..685419c
--- /dev/null
+++ b/solutions/3777/01.py
@@ -0,0 +1,45 @@
+class FenwickTree:
+    def __init__(self, size):
+        self.tree = [0] * (size + 1)
+
+    def add(self, i, delta):
+        while i < len(self.tree):
+            self.tree[i] += delta
+            i += i & (-i)
+
+    def query(self, i):
+        s = 0
+        while i > 0:
+            s += self.tree[i]
+            i -= i & (-i)
+        return s
+
+class Solution:
+    def minDeletions(self, s: str, queries: List[List[int]]) -> List[int]:
+        n = len(s)
+        A = [ord(c) - ord('A') for c in s]
+        bit = FenwickTree(n)
+        
+        # Initialize: mark violations (adjacent identical characters)
+        for i in range(n - 1):
+            if A[i] == A[i+1]:
+                bit.add(i + 1, 1)
+
+        res = []
+        for q in queries:
+            if q[0] == 1:
+                # Flip operation
+                i = q[1]
+                A[i] ^= 1
+                # Update violations at position i and i+1
+                if i > 0:
+                    bit.add(i, 1 if A[i] == A[i - 1] else -1)
+                if i < n - 1:
+                    bit.add(i + 1, 1 if A[i] == A[i + 1] else -1)
+            else:
+                # Query operation [2, l, r]
+                # Count violations in range [l, r]
+                res.append(bit.query(q[2]) - bit.query(q[1]))
+        
+        return res
+