diff --git a/action.yml b/action.yml index 96d9dc6..e6e70ac 100644 --- a/action.yml +++ b/action.yml @@ -53,9 +53,9 @@ runs: # git fetch origin main # git checkout main - echo "Initializing and updating submodules in case checkout resulted in uninitializations..." - git submodule update --init --recursive - git submodule update --recursive --remote + # echo "Initializing and updating submodules in case checkout resulted in uninitializations..." + # git submodule update --init --recursive + # git submodule update --recursive --remote # cd ../ diff --git a/main.ipynb b/main.ipynb index a59dfb6..7769328 100644 --- a/main.ipynb +++ b/main.ipynb @@ -9,7 +9,7 @@ }, { "cell_type": "code", - "execution_count": 401, + "execution_count": null, "metadata": {}, "outputs": [], "source": [ @@ -33,7 +33,7 @@ }, { "cell_type": "code", - "execution_count": 402, + "execution_count": null, "metadata": {}, "outputs": [], "source": [ @@ -63,7 +63,7 @@ }, { "cell_type": "code", - "execution_count": 403, + "execution_count": null, "metadata": {}, "outputs": [], "source": [ @@ -75,7 +75,7 @@ }, { "cell_type": "code", - "execution_count": 404, + "execution_count": null, "metadata": {}, "outputs": [], "source": [ @@ -93,7 +93,7 @@ }, { "cell_type": "code", - "execution_count": 405, + "execution_count": null, "metadata": {}, "outputs": [], "source": [ @@ -121,17 +121,9 @@ }, { "cell_type": "code", - "execution_count": 406, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "Default .env activated from script directory (.readme_updater/)\n" - ] - } - ], + "execution_count": null, + "metadata": {}, + "outputs": [], "source": [ "# loading env variables\n", "print('Default .env activated from script directory (.readme_updater/)')\n", @@ -144,17 +136,9 @@ }, { "cell_type": "code", - "execution_count": 407, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "Working directory already set to script location. No need for adjustment\n" - ] - } - ], + "execution_count": null, + "metadata": {}, + "outputs": [], "source": [ "# NOTE: if the script is being run from a jupyter notebook, then it should\n", "# already be in the correct directory.\n", @@ -173,17 +157,9 @@ }, { "cell_type": "code", - "execution_count": 408, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "Importing tqdm.notebook\n" - ] - } - ], + "execution_count": null, + "metadata": {}, + "outputs": [], "source": [ "# TQDM import based off if current running script is a jupyter notebook\n", "# or a python script\n", @@ -198,17 +174,9 @@ }, { "cell_type": "code", - "execution_count": 409, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "NOTEBOOK_ABS_DIR = 'c:/Users/antho/Documents/cs/projects/leetcode - testing environment 2 manual no github/WikiLeet'\n" - ] - } - ], + "execution_count": null, + "metadata": {}, + "outputs": [], "source": [ "# README_ABS_DIR will get confirmed in if name==main prior to running\n", "README_ABS_DIR = getcwd().replace('\\\\', '/')\n", @@ -220,7 +188,7 @@ }, { "cell_type": "code", - "execution_count": 410, + "execution_count": null, "metadata": {}, "outputs": [], "source": [ @@ -242,19 +210,19 @@ }, { "cell_type": "code", - "execution_count": 411, + "execution_count": null, "metadata": {}, "outputs": [], "source": [ "# Categories besides those in lists\n", "PRIMARY_CATEGORIES = set(['Daily', 'Weekly Premium', 'Contest', 'Favourite'])\n", - "# _OLDEST_DATE = datetime.now()\n", - "_OLDEST_DATE = datetime(2024, 7, 23)" + "_oldest_date = datetime.now()\n", + "# _oldest_date = datetime(2024, 7, 23)" ] }, { "cell_type": "code", - "execution_count": 412, + "execution_count": null, "metadata": {}, "outputs": [], "source": [ @@ -279,10 +247,6 @@ " creationDate = datetime.strptime(time.ctime(int(modifiedTimes[0])), '%a %b %d %H:%M:%S %Y')\n", " modifiedDate = datetime.strptime(time.ctime(int(modifiedTimes[-1])), '%a %b %d %H:%M:%S %Y')\n", " \n", - " global _OLDEST_DATE\n", - " if creationDate <_OLDEST_DATE:\n", - " _OLDEST_DATE = creationDate.replace(hour=0, minute=0, second=0, microsecond=0)\n", - "\n", " except ValueError as ve:\n", " print(f'Error in parsing {path}')\n", " print(f'{modifiedTimes}')\n", @@ -294,7 +258,7 @@ }, { "cell_type": "code", - "execution_count": 413, + "execution_count": null, "metadata": {}, "outputs": [], "source": [ @@ -318,14 +282,42 @@ "\n", " cmd = r\"git log --follow --format=%ct --reverse --\".split()\n", " output = {}\n", - "\n", + " \n", + " oldest_date = datetime.now()\n", + "\n", + " # if getenv(\"GITHUB_ACTIONS\") == 'true' :\n", + " # print('\\n')\n", + " # print('/' + '=' * 15 + '\\\\')\n", + " # print(' ', end='')\n", + " # pqBarsPrinted = 0\n", + " # for i, path in enumerate(paths) :\n", + " # path = join(LEETCODE_PATH_FROM_README, path)\n", + " # output[path] = individualCTimeViaGit(cmd + [path])\n", + " \n", + " # if output[path][0] < oldest_date :\n", + " # oldest_date = output[path][0]\n", + " \n", + " # curChunk = int((i / len(paths)) * 15)\n", + " # if curChunk > pqBarsPrinted :\n", + " # print('=' * (curChunk - pqBarsPrinted), end='')\n", + " # pqBarsPrinted = curChunk\n", + " \n", + " # print((15 - pqBarsPrinted) * '=', '\\n\\n')\n", + " # else :\n", " with tqdm(total=len(paths)) as pbar :\n", " # with tqdm(total=len(paths), position=0, leave=True) as pbar :\n", " for i, path in enumerate(paths) :\n", " path = join(LEETCODE_PATH_FROM_README, path)\n", " output[path] = individualCTimeViaGit(cmd + [path])\n", + " \n", + " if output[path][0] < oldest_date :\n", + " oldest_date = output[path][0]\n", + " \n", " pbar.update(1)\n", "\n", + " global _oldest_date\n", + " _oldest_date = oldest_date.replace(hour=0, minute=0, second=0, microsecond=0)\n", + "\n", " # Usually I'd avoid using global for this but this is a personal project so it should be fine.\n", " _ALL_GIT_CM_TIMES.update(output)\n", " print(f'{_ALL_GIT_CM_TIMES = }')\n", @@ -336,7 +328,7 @@ }, { "cell_type": "code", - "execution_count": 414, + "execution_count": null, "metadata": {}, "outputs": [], "source": [ @@ -364,7 +356,7 @@ }, { "cell_type": "code", - "execution_count": 415, + "execution_count": null, "metadata": {}, "outputs": [], "source": [ @@ -400,7 +392,7 @@ }, { "cell_type": "code", - "execution_count": 416, + "execution_count": null, "metadata": {}, "outputs": [], "source": [ @@ -418,7 +410,7 @@ }, { "cell_type": "code", - "execution_count": 417, + "execution_count": null, "metadata": {}, "outputs": [], "source": [ @@ -511,7 +503,7 @@ }, { "cell_type": "code", - "execution_count": 418, + "execution_count": null, "metadata": {}, "outputs": [], "source": [ @@ -585,7 +577,7 @@ }, { "cell_type": "code", - "execution_count": 419, + "execution_count": null, "metadata": {}, "outputs": [], "source": [ @@ -625,7 +617,7 @@ }, { "cell_type": "code", - "execution_count": 420, + "execution_count": null, "metadata": {}, "outputs": [], "source": [ @@ -634,7 +626,7 @@ }, { "cell_type": "code", - "execution_count": 421, + "execution_count": null, "metadata": {}, "outputs": [], "source": [ @@ -649,7 +641,7 @@ }, { "cell_type": "code", - "execution_count": 422, + "execution_count": null, "metadata": {}, "outputs": [], "source": [ @@ -672,7 +664,7 @@ }, { "cell_type": "code", - "execution_count": 423, + "execution_count": null, "metadata": {}, "outputs": [], "source": [ @@ -682,11 +674,11 @@ }, { "cell_type": "code", - "execution_count": 424, + "execution_count": null, "metadata": {}, "outputs": [], "source": [ - "def getDailies(firstDate: datetime = _OLDEST_DATE) -> List[Tuple[datetime, int]] :\n", + "def getDailies(firstDate: datetime = None) -> List[Tuple[datetime, int]] :\n", " '''\n", " Retrieves the daily questions from the official LeetCode json data\n", " and returns them as a set of strings\n", @@ -694,6 +686,11 @@ " ### Returns :\n", " dailies : List[Tuple[date, questionNo]]\n", " '''\n", + " if not firstDate :\n", + " global _oldest_date\n", + " firstDate = _oldest_date\n", + " \n", + " print('Oldest date found:', firstDate)\n", " \n", " with open(DAILIES_DATA_PATH, 'rb') as fp:\n", " dailies = json.load(fp)\n", @@ -706,17 +703,19 @@ " continue\n", "\n", " output.append((newK, int(dailies[k]['question']['questionFrontendId'])))\n", - " print(f'dailies: {output = }')\n", + "\n", + " # print(f'{firstDate = }')\n", + " # print(f'dailies: {output = }')\n", " return sorted(output, key=lambda x: x[0], reverse=True)" ] }, { "cell_type": "code", - "execution_count": 425, + "execution_count": null, "metadata": {}, "outputs": [], "source": [ - "def getWeeklies(firstDate: datetime = _OLDEST_DATE) -> List[Tuple[datetime, int]] :\n", + "def getWeeklies(firstDate: datetime = None) -> List[Tuple[datetime, int]] :\n", " '''\n", " Retrieves the weekly premium questions from the official LeetCode json data\n", " and returns them as a set of strings\n", @@ -724,6 +723,11 @@ " ### Returns :\n", " weeklies : List[Tuple[date, questionNo]]\n", " '''\n", + " if not firstDate :\n", + " global _oldest_date\n", + " firstDate = _oldest_date\n", + " \n", + " print('Oldest date found:', firstDate)\n", " \n", " with open(WEEKLIES_DATA_PATH, 'rb') as fp:\n", " weeklies = json.load(fp)\n", @@ -742,7 +746,7 @@ }, { "cell_type": "code", - "execution_count": 426, + "execution_count": null, "metadata": {}, "outputs": [], "source": [ @@ -753,7 +757,7 @@ }, { "cell_type": "code", - "execution_count": 427, + "execution_count": null, "metadata": {}, "outputs": [], "source": [ @@ -773,21 +777,24 @@ "\n", " # I have ~12 hours of leeway due to potential to forget to commit\n", " for date, qNo in dailies :\n", - " if qNo == 1334 :\n", - " print('\\n\\nhi')\n", - " print(f'{bool(qNo in questionData) = }')\n", - " print(f\"{questionData[qNo]['date_done'] = }\")\n", - " print(f\"{date + timedelta(days=1, hours=12) = }\")\n", + " # if qNo == 1334 :\n", + " # print('\\n\\nhi')\n", + " # print(f'{bool(qNo in questionData) = }')\n", + " # print(f\"{questionData[qNo]['date_done'] = }\")\n", + " # print(f\"{date + timedelta(days=1, hours=12) = }\")\n", " if qNo in questionData and questionData[qNo]['date_done'] <= date + timedelta(days=1, hours=12) :\n", " dailiesDict[date] = questionData[qNo].copy()\n", " dailiesDict[date]['date_done'] = date\n", + " # print(f'{dailiesDict[date] = }')\n", + "\n", + " # print(f'{dailiesDict = }')\n", "\n", " return dailiesDict" ] }, { "cell_type": "code", - "execution_count": 428, + "execution_count": null, "metadata": {}, "outputs": [], "source": [ @@ -824,22 +831,9 @@ }, { "cell_type": "code", - "execution_count": 429, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "getcwd() = 'c:\\\\Users\\\\antho\\\\Documents\\\\cs\\\\projects\\\\leetcode - testing environment 2 manual no github\\\\WikiLeet'\n", - "['dailies_weeklies', 'leetcode.json', 'leetcode.pkl', 'leetcode_s.json']\n", - "Question details path: QUESTION_DATA_FOLDER = 'question_data/question_data/data/leetcode.pkl'\n", - "\n", - "Files found. Importing now...\n", - "\n" - ] - } - ], + "execution_count": null, + "metadata": {}, + "outputs": [], "source": [ "# Parse one leetcode answer file in the submissions folder\n", "def parseCase(leetcodeFile: str, # file name\n", @@ -934,7 +928,7 @@ }, { "cell_type": "code", - "execution_count": 430, + "execution_count": null, "metadata": {}, "outputs": [], "source": [ @@ -991,7 +985,7 @@ }, { "cell_type": "code", - "execution_count": 431, + "execution_count": null, "metadata": {}, "outputs": [], "source": [ @@ -1038,7 +1032,7 @@ }, { "cell_type": "code", - "execution_count": 432, + "execution_count": null, "metadata": {}, "outputs": [], "source": [ @@ -1057,7 +1051,7 @@ }, { "cell_type": "code", - "execution_count": 433, + "execution_count": null, "metadata": {}, "outputs": [], "source": [ @@ -1090,17 +1084,9 @@ }, { "cell_type": "code", - "execution_count": 434, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "['B75', 'N150']\n" - ] - } - ], + "execution_count": null, + "metadata": {}, + "outputs": [], "source": [ "def processListData(questionData: dict,\n", " *,\n", @@ -1128,7 +1114,7 @@ }, { "cell_type": "code", - "execution_count": 435, + "execution_count": null, "metadata": {}, "outputs": [], "source": [ @@ -1157,7 +1143,7 @@ }, { "cell_type": "code", - "execution_count": 436, + "execution_count": null, "metadata": {}, "outputs": [], "source": [ @@ -1180,7 +1166,7 @@ }, { "cell_type": "code", - "execution_count": 437, + "execution_count": null, "metadata": {}, "outputs": [], "source": [ @@ -1278,7 +1264,7 @@ }, { "cell_type": "code", - "execution_count": 438, + "execution_count": null, "metadata": {}, "outputs": [], "source": [ @@ -1315,7 +1301,7 @@ }, { "cell_type": "code", - "execution_count": 439, + "execution_count": null, "metadata": {}, "outputs": [], "source": [ @@ -1342,7 +1328,7 @@ }, { "cell_type": "code", - "execution_count": 440, + "execution_count": null, "metadata": {}, "outputs": [], "source": [ @@ -1386,7 +1372,7 @@ "\n", " # Usually, x[0] is the question number but the qustionData set might be keyed by the date if it's a daily case\n", " if sortBy == 'date_done' and type(list(questionData.keys())[0]) == datetime :\n", - " dataframe_array.sort(key=lambda x: x[-1]) \n", + " dataframe_array.sort(key=lambda x: datetime.strptime(x[-1], '%b %d, %Y'))\n", " else :\n", " dataframe_array.sort(key=lambda x: questionData.get(x[0])[sortBy])\n", "\n", @@ -1395,7 +1381,7 @@ }, { "cell_type": "code", - "execution_count": 441, + "execution_count": null, "metadata": {}, "outputs": [], "source": [ @@ -1441,7 +1427,7 @@ }, { "cell_type": "code", - "execution_count": 442, + "execution_count": null, "metadata": {}, "outputs": [], "source": [ @@ -1460,7 +1446,7 @@ }, { "cell_type": "code", - "execution_count": 443, + "execution_count": null, "metadata": {}, "outputs": [], "source": [ @@ -1477,7 +1463,7 @@ }, { "cell_type": "code", - "execution_count": 444, + "execution_count": null, "metadata": {}, "outputs": [], "source": [ @@ -1510,7 +1496,7 @@ }, { "cell_type": "code", - "execution_count": 445, + "execution_count": null, "metadata": {}, "outputs": [], "source": [ @@ -1569,7 +1555,7 @@ }, { "cell_type": "code", - "execution_count": 446, + "execution_count": null, "metadata": {}, "outputs": [], "source": [ @@ -1652,7 +1638,7 @@ }, { "cell_type": "code", - "execution_count": 447, + "execution_count": null, "metadata": {}, "outputs": [], "source": [ @@ -1682,9 +1668,9 @@ " details = 'Calculations are based on the date of the first solve.\\n\\n'\n", " elif daily :\n", " dailyQuestionData = parseQuestionsForDailies(questionData)\n", - " global _OLDEST_DATE\n", + " global _oldest_date\n", " print(f'{dailyQuestionData = }')\n", - " print(f'{_OLDEST_DATE = }')\n", + " print(f'{_oldest_date = }')\n", " # for qNo, qData in questionData.items() :\n", " # if 'Daily' in qData['categories'] :\n", " # dailyQuestionData[qNo] = qData\n", @@ -1732,7 +1718,7 @@ }, { "cell_type": "code", - "execution_count": 448, + "execution_count": null, "metadata": {}, "outputs": [], "source": [ @@ -1810,7 +1796,7 @@ }, { "cell_type": "code", - "execution_count": 449, + "execution_count": null, "metadata": {}, "outputs": [], "source": [ @@ -1830,7 +1816,7 @@ "\n", "\n", " questionDetailsDict = retrieveQuestionDetails()\n", - " print(questionDetailsDict)\n", + " # print(questionDetailsDict)\n", "\n", " leetcodeFiles.sort()\n", " contestLeetcodeFiles.sort()\n", @@ -1934,81 +1920,9 @@ }, { "cell_type": "code", - "execution_count": 450, - "metadata": {}, - "outputs": [ - { - "name": "stdout", - "output_type": "stream", - "text": [ - "No record off\n", - "Recalculate off\n", - "Use Git dates off\n", - "\n", - "{1: questionNo: 1, acRate: 53.212054981006474, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Two Sum, slug: two-sum, url: https://leetcode.com/problems/two-sum, topics: ['Array', 'Hash Table'], hasSolution: True, hasVideoSolution: True, 2: questionNo: 2, acRate: 43.54633088258059, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Add Two Numbers, slug: add-two-numbers, url: https://leetcode.com/problems/add-two-numbers, topics: ['Linked List', 'Math', 'Recursion'], hasSolution: True, hasVideoSolution: True, 3: questionNo: 3, acRate: 35.13153299694981, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Longest Substring Without Repeating Characters, slug: longest-substring-without-repeating-characters, url: https://leetcode.com/problems/longest-substring-without-repeating-characters, topics: ['Hash Table', 'String', 'Sliding Window'], hasSolution: True, hasVideoSolution: True, 4: questionNo: 4, acRate: 40.83180606875667, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Median of Two Sorted Arrays, slug: median-of-two-sorted-arrays, url: https://leetcode.com/problems/median-of-two-sorted-arrays, topics: ['Array', 'Binary Search', 'Divide and Conquer'], hasSolution: True, hasVideoSolution: True, 5: questionNo: 5, acRate: 34.163843866818326, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Longest Palindromic Substring, slug: longest-palindromic-substring, url: https://leetcode.com/problems/longest-palindromic-substring, topics: ['Two Pointers', 'String', 'Dynamic Programming'], hasSolution: True, hasVideoSolution: True, 6: questionNo: 6, acRate: 48.734569717020634, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Zigzag Conversion, slug: zigzag-conversion, url: https://leetcode.com/problems/zigzag-conversion, topics: ['String'], hasSolution: True, hasVideoSolution: True, 7: questionNo: 7, acRate: 28.904693808644478, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Reverse Integer, slug: reverse-integer, url: https://leetcode.com/problems/reverse-integer, topics: ['Math'], hasSolution: True, hasVideoSolution: True, 8: questionNo: 8, acRate: 17.631247373215224, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: String to Integer (atoi), slug: string-to-integer-atoi, url: https://leetcode.com/problems/string-to-integer-atoi, topics: ['String'], hasSolution: True, hasVideoSolution: False, 9: questionNo: 9, acRate: 57.03460336332902, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Palindrome Number, slug: palindrome-number, url: https://leetcode.com/problems/palindrome-number, topics: ['Math'], hasSolution: True, hasVideoSolution: True, 10: questionNo: 10, acRate: 28.268255971590158, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Regular Expression Matching, slug: regular-expression-matching, url: https://leetcode.com/problems/regular-expression-matching, topics: ['String', 'Dynamic Programming', 'Recursion'], hasSolution: True, hasVideoSolution: False, 11: questionNo: 11, acRate: 55.75943049187051, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Container With Most Water, slug: container-with-most-water, url: https://leetcode.com/problems/container-with-most-water, topics: ['Array', 'Two Pointers', 'Greedy'], hasSolution: True, hasVideoSolution: True, 12: questionNo: 12, acRate: 65.62801630758611, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Integer to Roman, slug: integer-to-roman, url: https://leetcode.com/problems/integer-to-roman, topics: ['Hash Table', 'Math', 'String'], hasSolution: True, hasVideoSolution: True, 13: questionNo: 13, acRate: 62.01861949555509, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Roman to Integer, slug: roman-to-integer, url: https://leetcode.com/problems/roman-to-integer, topics: ['Hash Table', 'Math', 'String'], hasSolution: True, hasVideoSolution: True, 14: questionNo: 14, acRate: 43.33864946387773, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Longest Common Prefix, slug: longest-common-prefix, url: https://leetcode.com/problems/longest-common-prefix, topics: ['String', 'Trie'], hasSolution: True, hasVideoSolution: True, 15: questionNo: 15, acRate: 34.96537499732832, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: 3Sum, slug: 3sum, url: https://leetcode.com/problems/3sum, topics: ['Array', 'Two Pointers', 'Sorting'], hasSolution: True, hasVideoSolution: True, 16: questionNo: 16, acRate: 45.94193841402489, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: 3Sum Closest, slug: 3sum-closest, url: https://leetcode.com/problems/3sum-closest, topics: ['Array', 'Two Pointers', 'Sorting'], hasSolution: True, hasVideoSolution: True, 17: questionNo: 17, acRate: 61.15958032001812, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Letter Combinations of a Phone Number, slug: letter-combinations-of-a-phone-number, url: https://leetcode.com/problems/letter-combinations-of-a-phone-number, topics: ['Hash Table', 'String', 'Backtracking'], hasSolution: True, hasVideoSolution: False, 18: questionNo: 18, acRate: 36.50212417881871, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: 4Sum, slug: 4sum, url: https://leetcode.com/problems/4sum, topics: ['Array', 'Two Pointers', 'Sorting'], hasSolution: True, hasVideoSolution: False, 19: questionNo: 19, acRate: 46.10945136428713, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Remove Nth Node From End of List, slug: remove-nth-node-from-end-of-list, url: https://leetcode.com/problems/remove-nth-node-from-end-of-list, topics: ['Linked List', 'Two Pointers'], hasSolution: True, hasVideoSolution: True, 20: questionNo: 20, acRate: 40.79463436182799, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Valid Parentheses, slug: valid-parentheses, url: https://leetcode.com/problems/valid-parentheses, topics: ['String', 'Stack'], hasSolution: True, hasVideoSolution: True, 21: questionNo: 21, acRate: 64.83960105927365, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Merge Two Sorted Lists, slug: merge-two-sorted-lists, url: https://leetcode.com/problems/merge-two-sorted-lists, topics: ['Linked List', 'Recursion'], hasSolution: True, hasVideoSolution: True, 22: questionNo: 22, acRate: 75.09878973990564, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Generate Parentheses, slug: generate-parentheses, url: https://leetcode.com/problems/generate-parentheses, topics: ['String', 'Dynamic Programming', 'Backtracking'], hasSolution: True, hasVideoSolution: True, 23: questionNo: 23, acRate: 53.557688907153945, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Merge k Sorted Lists, slug: merge-k-sorted-lists, url: https://leetcode.com/problems/merge-k-sorted-lists, topics: ['Linked List', 'Divide and Conquer', 'Heap (Priority Queue)', 'Merge Sort'], hasSolution: True, hasVideoSolution: True, 24: questionNo: 24, acRate: 64.87715088831267, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Swap Nodes in Pairs, slug: swap-nodes-in-pairs, url: https://leetcode.com/problems/swap-nodes-in-pairs, topics: ['Linked List', 'Recursion'], hasSolution: True, hasVideoSolution: False, 25: questionNo: 25, acRate: 59.67676617810878, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Reverse Nodes in k-Group, slug: reverse-nodes-in-k-group, url: https://leetcode.com/problems/reverse-nodes-in-k-group, topics: ['Linked List', 'Recursion'], hasSolution: True, hasVideoSolution: False, 26: questionNo: 26, acRate: 56.81080447960747, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Remove Duplicates from Sorted Array, slug: remove-duplicates-from-sorted-array, url: https://leetcode.com/problems/remove-duplicates-from-sorted-array, topics: ['Array', 'Two Pointers'], hasSolution: True, hasVideoSolution: False, 27: questionNo: 27, acRate: 57.58151016984316, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Remove Element, slug: remove-element, url: https://leetcode.com/problems/remove-element, topics: ['Array', 'Two Pointers'], hasSolution: True, hasVideoSolution: True, 28: questionNo: 28, acRate: 42.956380296385426, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Find the Index of the First Occurrence in a String, slug: find-the-index-of-the-first-occurrence-in-a-string, url: https://leetcode.com/problems/find-the-index-of-the-first-occurrence-in-a-string, topics: ['Two Pointers', 'String', 'String Matching'], hasSolution: True, hasVideoSolution: True, 29: questionNo: 29, acRate: 17.642883989657626, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Divide Two Integers, slug: divide-two-integers, url: https://leetcode.com/problems/divide-two-integers, topics: ['Math', 'Bit Manipulation'], hasSolution: True, hasVideoSolution: False, 30: questionNo: 30, acRate: 32.6060523761455, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Substring with Concatenation of All Words, slug: substring-with-concatenation-of-all-words, url: https://leetcode.com/problems/substring-with-concatenation-of-all-words, topics: ['Hash Table', 'String', 'Sliding Window'], hasSolution: True, hasVideoSolution: True, 31: questionNo: 31, acRate: 40.58847614031763, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Next Permutation, slug: next-permutation, url: https://leetcode.com/problems/next-permutation, topics: ['Array', 'Two Pointers'], hasSolution: True, hasVideoSolution: True, 32: questionNo: 32, acRate: 34.5002288972918, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Longest Valid Parentheses, slug: longest-valid-parentheses, url: https://leetcode.com/problems/longest-valid-parentheses, topics: ['String', 'Dynamic Programming', 'Stack'], hasSolution: True, hasVideoSolution: False, 33: questionNo: 33, acRate: 41.173205146889735, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Search in Rotated Sorted Array, slug: search-in-rotated-sorted-array, url: https://leetcode.com/problems/search-in-rotated-sorted-array, topics: ['Array', 'Binary Search'], hasSolution: True, hasVideoSolution: False, 34: questionNo: 34, acRate: 44.80225679297444, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Find First and Last Position of Element in Sorted Array, slug: find-first-and-last-position-of-element-in-sorted-array, url: https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array, topics: ['Array', 'Binary Search'], hasSolution: True, hasVideoSolution: False, 35: questionNo: 35, acRate: 46.6159426212477, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Search Insert Position, slug: search-insert-position, url: https://leetcode.com/problems/search-insert-position, topics: ['Array', 'Binary Search'], hasSolution: True, hasVideoSolution: True, 36: questionNo: 36, acRate: 60.18107781651696, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Valid Sudoku, slug: valid-sudoku, url: https://leetcode.com/problems/valid-sudoku, topics: ['Array', 'Hash Table', 'Matrix'], hasSolution: True, hasVideoSolution: False, 37: questionNo: 37, acRate: 62.1293969282979, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Sudoku Solver, slug: sudoku-solver, url: https://leetcode.com/problems/sudoku-solver, topics: ['Array', 'Hash Table', 'Backtracking', 'Matrix'], hasSolution: True, hasVideoSolution: False, 38: questionNo: 38, acRate: 55.83582001917262, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Count and Say, slug: count-and-say, url: https://leetcode.com/problems/count-and-say, topics: ['String'], hasSolution: True, hasVideoSolution: False, 39: questionNo: 39, acRate: 72.17775094796825, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Combination Sum, slug: combination-sum, url: https://leetcode.com/problems/combination-sum, topics: ['Array', 'Backtracking'], hasSolution: True, hasVideoSolution: True, 40: questionNo: 40, acRate: 54.92686318264901, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Combination Sum II, slug: combination-sum-ii, url: https://leetcode.com/problems/combination-sum-ii, topics: ['Array', 'Backtracking'], hasSolution: True, hasVideoSolution: False, 41: questionNo: 41, acRate: 39.75190054970818, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: First Missing Positive, slug: first-missing-positive, url: https://leetcode.com/problems/first-missing-positive, topics: ['Array', 'Hash Table'], hasSolution: True, hasVideoSolution: False, 42: questionNo: 42, acRate: 62.59978987158507, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Trapping Rain Water, slug: trapping-rain-water, url: https://leetcode.com/problems/trapping-rain-water, topics: ['Array', 'Two Pointers', 'Dynamic Programming', 'Stack', 'Monotonic Stack'], hasSolution: True, hasVideoSolution: False, 43: questionNo: 43, acRate: 40.73728056155689, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Multiply Strings, slug: multiply-strings, url: https://leetcode.com/problems/multiply-strings, topics: ['Math', 'String', 'Simulation'], hasSolution: True, hasVideoSolution: False, 44: questionNo: 44, acRate: 28.336324221074292, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Wildcard Matching, slug: wildcard-matching, url: https://leetcode.com/problems/wildcard-matching, topics: ['String', 'Dynamic Programming', 'Greedy', 'Recursion'], hasSolution: True, hasVideoSolution: False, 45: questionNo: 45, acRate: 40.584754291981916, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Jump Game II, slug: jump-game-ii, url: https://leetcode.com/problems/jump-game-ii, topics: ['Array', 'Dynamic Programming', 'Greedy'], hasSolution: True, hasVideoSolution: False, 46: questionNo: 46, acRate: 78.86363239060319, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Permutations, slug: permutations, url: https://leetcode.com/problems/permutations, topics: ['Array', 'Backtracking'], hasSolution: True, hasVideoSolution: False, 47: questionNo: 47, acRate: 59.695380540624754, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Permutations II, slug: permutations-ii, url: https://leetcode.com/problems/permutations-ii, topics: ['Array', 'Backtracking'], hasSolution: True, hasVideoSolution: False, 48: questionNo: 48, acRate: 75.21550373830263, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Rotate Image, slug: rotate-image, url: https://leetcode.com/problems/rotate-image, topics: ['Array', 'Math', 'Matrix'], hasSolution: True, hasVideoSolution: False, 49: questionNo: 49, acRate: 69.03584991284514, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Group Anagrams, slug: group-anagrams, url: https://leetcode.com/problems/group-anagrams, topics: ['Array', 'Hash Table', 'String', 'Sorting'], hasSolution: True, hasVideoSolution: True, 50: questionNo: 50, acRate: 35.21168008299816, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Pow(x, n), slug: powx-n, url: https://leetcode.com/problems/powx-n, topics: ['Math', 'Recursion'], hasSolution: True, hasVideoSolution: False, 51: questionNo: 51, acRate: 69.27744428867587, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: N-Queens, slug: n-queens, url: https://leetcode.com/problems/n-queens, topics: ['Array', 'Backtracking'], hasSolution: True, hasVideoSolution: False, 52: questionNo: 52, acRate: 74.5502013721641, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: N-Queens II, slug: n-queens-ii, url: https://leetcode.com/problems/n-queens-ii, topics: ['Backtracking'], hasSolution: True, hasVideoSolution: False, 53: questionNo: 53, acRate: 50.98629726326259, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum Subarray, slug: maximum-subarray, url: https://leetcode.com/problems/maximum-subarray, topics: ['Array', 'Divide and Conquer', 'Dynamic Programming'], hasSolution: True, hasVideoSolution: True, 54: questionNo: 54, acRate: 50.42845830664401, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Spiral Matrix, slug: spiral-matrix, url: https://leetcode.com/problems/spiral-matrix, topics: ['Array', 'Matrix', 'Simulation'], hasSolution: True, hasVideoSolution: False, 55: questionNo: 55, acRate: 38.64657980300596, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Jump Game, slug: jump-game, url: https://leetcode.com/problems/jump-game, topics: ['Array', 'Dynamic Programming', 'Greedy'], hasSolution: True, hasVideoSolution: False, 56: questionNo: 56, acRate: 47.720856831368565, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Merge Intervals, slug: merge-intervals, url: https://leetcode.com/problems/merge-intervals, topics: ['Array', 'Sorting'], hasSolution: True, hasVideoSolution: True, 57: questionNo: 57, acRate: 41.88768244288823, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Insert Interval, slug: insert-interval, url: https://leetcode.com/problems/insert-interval, topics: ['Array'], hasSolution: True, hasVideoSolution: False, 58: questionNo: 58, acRate: 52.83355956936078, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Length of Last Word, slug: length-of-last-word, url: https://leetcode.com/problems/length-of-last-word, topics: ['String'], hasSolution: True, hasVideoSolution: False, 59: questionNo: 59, acRate: 71.56174898452113, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Spiral Matrix II, slug: spiral-matrix-ii, url: https://leetcode.com/problems/spiral-matrix-ii, topics: ['Array', 'Matrix', 'Simulation'], hasSolution: True, hasVideoSolution: False, 60: questionNo: 60, acRate: 47.67250085706079, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Permutation Sequence, slug: permutation-sequence, url: https://leetcode.com/problems/permutation-sequence, topics: ['Math', 'Recursion'], hasSolution: True, hasVideoSolution: False, 61: questionNo: 61, acRate: 38.27948419604877, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Rotate List, slug: rotate-list, url: https://leetcode.com/problems/rotate-list, topics: ['Linked List', 'Two Pointers'], hasSolution: True, hasVideoSolution: False, 62: questionNo: 62, acRate: 64.57782719154687, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Unique Paths, slug: unique-paths, url: https://leetcode.com/problems/unique-paths, topics: ['Math', 'Dynamic Programming', 'Combinatorics'], hasSolution: True, hasVideoSolution: False, 63: questionNo: 63, acRate: 41.94975268559475, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Unique Paths II, slug: unique-paths-ii, url: https://leetcode.com/problems/unique-paths-ii, topics: ['Array', 'Dynamic Programming', 'Matrix'], hasSolution: True, hasVideoSolution: False, 64: questionNo: 64, acRate: 64.4916356580335, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Path Sum, slug: minimum-path-sum, url: https://leetcode.com/problems/minimum-path-sum, topics: ['Array', 'Dynamic Programming', 'Matrix'], hasSolution: True, hasVideoSolution: False, 65: questionNo: 65, acRate: 20.15043705468504, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Valid Number, slug: valid-number, url: https://leetcode.com/problems/valid-number, topics: ['String'], hasSolution: True, hasVideoSolution: False, 66: questionNo: 66, acRate: 45.781455523642016, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Plus One, slug: plus-one, url: https://leetcode.com/problems/plus-one, topics: ['Array', 'Math'], hasSolution: True, hasVideoSolution: False, 67: questionNo: 67, acRate: 54.01253764596143, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Add Binary, slug: add-binary, url: https://leetcode.com/problems/add-binary, topics: ['Math', 'String', 'Bit Manipulation', 'Simulation'], hasSolution: True, hasVideoSolution: False, 68: questionNo: 68, acRate: 44.360678706124816, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Text Justification, slug: text-justification, url: https://leetcode.com/problems/text-justification, topics: ['Array', 'String', 'Simulation'], hasSolution: True, hasVideoSolution: False, 69: questionNo: 69, acRate: 39.110550854800785, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Sqrt(x), slug: sqrtx, url: https://leetcode.com/problems/sqrtx, topics: ['Math', 'Binary Search'], hasSolution: True, hasVideoSolution: True, 70: questionNo: 70, acRate: 53.014535595933424, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Climbing Stairs, slug: climbing-stairs, url: https://leetcode.com/problems/climbing-stairs, topics: ['Math', 'Dynamic Programming', 'Memoization'], hasSolution: True, hasVideoSolution: False, 71: questionNo: 71, acRate: 43.4438244087774, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Simplify Path, slug: simplify-path, url: https://leetcode.com/problems/simplify-path, topics: ['String', 'Stack'], hasSolution: True, hasVideoSolution: True, 72: questionNo: 72, acRate: 56.970856882366775, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Edit Distance, slug: edit-distance, url: https://leetcode.com/problems/edit-distance, topics: ['String', 'Dynamic Programming'], hasSolution: True, hasVideoSolution: False, 73: questionNo: 73, acRate: 56.67731863765558, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Set Matrix Zeroes, slug: set-matrix-zeroes, url: https://leetcode.com/problems/set-matrix-zeroes, topics: ['Array', 'Hash Table', 'Matrix'], hasSolution: True, hasVideoSolution: False, 74: questionNo: 74, acRate: 50.646746255184716, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Search a 2D Matrix, slug: search-a-2d-matrix, url: https://leetcode.com/problems/search-a-2d-matrix, topics: ['Array', 'Binary Search', 'Matrix'], hasSolution: True, hasVideoSolution: False, 75: questionNo: 75, acRate: 64.36494662832555, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Sort Colors, slug: sort-colors, url: https://leetcode.com/problems/sort-colors, topics: ['Array', 'Two Pointers', 'Sorting'], hasSolution: True, hasVideoSolution: False, 76: questionNo: 76, acRate: 43.399183555569294, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Minimum Window Substring, slug: minimum-window-substring, url: https://leetcode.com/problems/minimum-window-substring, topics: ['Hash Table', 'String', 'Sliding Window'], hasSolution: True, hasVideoSolution: False, 77: questionNo: 77, acRate: 70.89477996476047, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Combinations, slug: combinations, url: https://leetcode.com/problems/combinations, topics: ['Backtracking'], hasSolution: True, hasVideoSolution: False, 78: questionNo: 78, acRate: 78.7906840038834, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Subsets, slug: subsets, url: https://leetcode.com/problems/subsets, topics: ['Array', 'Backtracking', 'Bit Manipulation'], hasSolution: True, hasVideoSolution: True, 79: questionNo: 79, acRate: 43.265101177292465, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Word Search, slug: word-search, url: https://leetcode.com/problems/word-search, topics: ['Array', 'String', 'Backtracking', 'Matrix'], hasSolution: True, hasVideoSolution: False, 80: questionNo: 80, acRate: 59.39777008602087, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Remove Duplicates from Sorted Array II, slug: remove-duplicates-from-sorted-array-ii, url: https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii, topics: ['Array', 'Two Pointers'], hasSolution: True, hasVideoSolution: False, 81: questionNo: 81, acRate: 37.95506672381656, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Search in Rotated Sorted Array II, slug: search-in-rotated-sorted-array-ii, url: https://leetcode.com/problems/search-in-rotated-sorted-array-ii, topics: ['Array', 'Binary Search'], hasSolution: True, hasVideoSolution: False, 82: questionNo: 82, acRate: 47.925404457203086, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Remove Duplicates from Sorted List II, slug: remove-duplicates-from-sorted-list-ii, url: https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii, topics: ['Linked List', 'Two Pointers'], hasSolution: True, hasVideoSolution: False, 83: questionNo: 83, acRate: 53.02905084230647, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Remove Duplicates from Sorted List, slug: remove-duplicates-from-sorted-list, url: https://leetcode.com/problems/remove-duplicates-from-sorted-list, topics: ['Linked List'], hasSolution: True, hasVideoSolution: True, 84: questionNo: 84, acRate: 45.04612253780865, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Largest Rectangle in Histogram, slug: largest-rectangle-in-histogram, url: https://leetcode.com/problems/largest-rectangle-in-histogram, topics: ['Array', 'Stack', 'Monotonic Stack'], hasSolution: True, hasVideoSolution: True, 85: questionNo: 85, acRate: 51.12197611162353, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Maximal Rectangle, slug: maximal-rectangle, url: https://leetcode.com/problems/maximal-rectangle, topics: ['Array', 'Dynamic Programming', 'Stack', 'Matrix', 'Monotonic Stack'], hasSolution: True, hasVideoSolution: False, 86: questionNo: 86, acRate: 56.808900500609326, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Partition List, slug: partition-list, url: https://leetcode.com/problems/partition-list, topics: ['Linked List', 'Two Pointers'], hasSolution: True, hasVideoSolution: False, 87: questionNo: 87, acRate: 40.45847337643413, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Scramble String, slug: scramble-string, url: https://leetcode.com/problems/scramble-string, topics: ['String', 'Dynamic Programming'], hasSolution: True, hasVideoSolution: False, 88: questionNo: 88, acRate: 50.41292390821136, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Merge Sorted Array, slug: merge-sorted-array, url: https://leetcode.com/problems/merge-sorted-array, topics: ['Array', 'Two Pointers', 'Sorting'], hasSolution: True, hasVideoSolution: True, 89: questionNo: 89, acRate: 59.70530486342517, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Gray Code, slug: gray-code, url: https://leetcode.com/problems/gray-code, topics: ['Math', 'Backtracking', 'Bit Manipulation'], hasSolution: True, hasVideoSolution: False, 90: questionNo: 90, acRate: 57.74840309013853, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Subsets II, slug: subsets-ii, url: https://leetcode.com/problems/subsets-ii, topics: ['Array', 'Backtracking', 'Bit Manipulation'], hasSolution: True, hasVideoSolution: False, 91: questionNo: 91, acRate: 35.207919546078806, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Decode Ways, slug: decode-ways, url: https://leetcode.com/problems/decode-ways, topics: ['String', 'Dynamic Programming'], hasSolution: True, hasVideoSolution: True, 92: questionNo: 92, acRate: 48.01594813559106, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Reverse Linked List II, slug: reverse-linked-list-ii, url: https://leetcode.com/problems/reverse-linked-list-ii, topics: ['Linked List'], hasSolution: True, hasVideoSolution: True, 93: questionNo: 93, acRate: 50.57797609151512, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Restore IP Addresses, slug: restore-ip-addresses, url: https://leetcode.com/problems/restore-ip-addresses, topics: ['String', 'Backtracking'], hasSolution: True, hasVideoSolution: False, 94: questionNo: 94, acRate: 76.67661465296511, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Binary Tree Inorder Traversal, slug: binary-tree-inorder-traversal, url: https://leetcode.com/problems/binary-tree-inorder-traversal, topics: ['Stack', 'Tree', 'Depth-First Search', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 95: questionNo: 95, acRate: 58.27277801772585, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Unique Binary Search Trees II, slug: unique-binary-search-trees-ii, url: https://leetcode.com/problems/unique-binary-search-trees-ii, topics: ['Dynamic Programming', 'Backtracking', 'Tree', 'Binary Search Tree', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 96: questionNo: 96, acRate: 61.310547859540456, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Unique Binary Search Trees, slug: unique-binary-search-trees, url: https://leetcode.com/problems/unique-binary-search-trees, topics: ['Math', 'Dynamic Programming', 'Tree', 'Binary Search Tree', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 97: questionNo: 97, acRate: 40.33732759158709, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Interleaving String, slug: interleaving-string, url: https://leetcode.com/problems/interleaving-string, topics: ['String', 'Dynamic Programming'], hasSolution: True, hasVideoSolution: False, 98: questionNo: 98, acRate: 33.20384376123228, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Validate Binary Search Tree, slug: validate-binary-search-tree, url: https://leetcode.com/problems/validate-binary-search-tree, topics: ['Tree', 'Depth-First Search', 'Binary Search Tree', 'Binary Tree'], hasSolution: True, hasVideoSolution: True, 99: questionNo: 99, acRate: 53.78663161967913, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Recover Binary Search Tree, slug: recover-binary-search-tree, url: https://leetcode.com/problems/recover-binary-search-tree, topics: ['Tree', 'Depth-First Search', 'Binary Search Tree', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 100: questionNo: 100, acRate: 62.8225604715989, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Same Tree, slug: same-tree, url: https://leetcode.com/problems/same-tree, topics: ['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree'], hasSolution: True, hasVideoSolution: True, 101: questionNo: 101, acRate: 57.10591070606404, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Symmetric Tree, slug: symmetric-tree, url: https://leetcode.com/problems/symmetric-tree, topics: ['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree'], hasSolution: True, hasVideoSolution: True, 102: questionNo: 102, acRate: 67.97454706275741, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Binary Tree Level Order Traversal, slug: binary-tree-level-order-traversal, url: https://leetcode.com/problems/binary-tree-level-order-traversal, topics: ['Tree', 'Breadth-First Search', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 103: questionNo: 103, acRate: 59.55175497429018, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Binary Tree Zigzag Level Order Traversal, slug: binary-tree-zigzag-level-order-traversal, url: https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal, topics: ['Tree', 'Breadth-First Search', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 104: questionNo: 104, acRate: 75.79357096385657, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Maximum Depth of Binary Tree, slug: maximum-depth-of-binary-tree, url: https://leetcode.com/problems/maximum-depth-of-binary-tree, topics: ['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree'], hasSolution: True, hasVideoSolution: True, 105: questionNo: 105, acRate: 64.54061540832573, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Construct Binary Tree from Preorder and Inorder Traversal, slug: construct-binary-tree-from-preorder-and-inorder-traversal, url: https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal, topics: ['Array', 'Hash Table', 'Divide and Conquer', 'Tree', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 106: questionNo: 106, acRate: 63.69371254637116, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Construct Binary Tree from Inorder and Postorder Traversal, slug: construct-binary-tree-from-inorder-and-postorder-traversal, url: https://leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal, topics: ['Array', 'Hash Table', 'Divide and Conquer', 'Tree', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 107: questionNo: 107, acRate: 63.92789018095096, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Binary Tree Level Order Traversal II, slug: binary-tree-level-order-traversal-ii, url: https://leetcode.com/problems/binary-tree-level-order-traversal-ii, topics: ['Tree', 'Breadth-First Search', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 108: questionNo: 108, acRate: 72.23112917142656, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Convert Sorted Array to Binary Search Tree, slug: convert-sorted-array-to-binary-search-tree, url: https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree, topics: ['Array', 'Divide and Conquer', 'Tree', 'Binary Search Tree', 'Binary Tree'], hasSolution: True, hasVideoSolution: True, 109: questionNo: 109, acRate: 62.42621531294894, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Convert Sorted List to Binary Search Tree, slug: convert-sorted-list-to-binary-search-tree, url: https://leetcode.com/problems/convert-sorted-list-to-binary-search-tree, topics: ['Linked List', 'Divide and Conquer', 'Tree', 'Binary Search Tree', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 110: questionNo: 110, acRate: 52.850317367482006, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Balanced Binary Tree, slug: balanced-binary-tree, url: https://leetcode.com/problems/balanced-binary-tree, topics: ['Tree', 'Depth-First Search', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 111: questionNo: 111, acRate: 48.577865224731106, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Minimum Depth of Binary Tree, slug: minimum-depth-of-binary-tree, url: https://leetcode.com/problems/minimum-depth-of-binary-tree, topics: ['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 112: questionNo: 112, acRate: 50.94580692933258, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Path Sum, slug: path-sum, url: https://leetcode.com/problems/path-sum, topics: ['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 113: questionNo: 113, acRate: 58.871446001503614, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Path Sum II, slug: path-sum-ii, url: https://leetcode.com/problems/path-sum-ii, topics: ['Backtracking', 'Tree', 'Depth-First Search', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 114: questionNo: 114, acRate: 65.75868040035625, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Flatten Binary Tree to Linked List, slug: flatten-binary-tree-to-linked-list, url: https://leetcode.com/problems/flatten-binary-tree-to-linked-list, topics: ['Linked List', 'Stack', 'Tree', 'Depth-First Search', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 115: questionNo: 115, acRate: 47.73125732604928, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Distinct Subsequences, slug: distinct-subsequences, url: https://leetcode.com/problems/distinct-subsequences, topics: ['String', 'Dynamic Programming'], hasSolution: True, hasVideoSolution: False, 116: questionNo: 116, acRate: 63.26586678892492, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Populating Next Right Pointers in Each Node, slug: populating-next-right-pointers-in-each-node, url: https://leetcode.com/problems/populating-next-right-pointers-in-each-node, topics: ['Linked List', 'Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 117: questionNo: 117, acRate: 53.10624939292008, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Populating Next Right Pointers in Each Node II, slug: populating-next-right-pointers-in-each-node-ii, url: https://leetcode.com/problems/populating-next-right-pointers-in-each-node-ii, topics: ['Linked List', 'Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 118: questionNo: 118, acRate: 74.92309347470047, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Pascal's Triangle, slug: pascals-triangle, url: https://leetcode.com/problems/pascals-triangle, topics: ['Array', 'Dynamic Programming'], hasSolution: True, hasVideoSolution: True, 119: questionNo: 119, acRate: 64.38559410307056, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Pascal's Triangle II, slug: pascals-triangle-ii, url: https://leetcode.com/problems/pascals-triangle-ii, topics: ['Array', 'Dynamic Programming'], hasSolution: True, hasVideoSolution: False, 120: questionNo: 120, acRate: 57.24979338029832, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Triangle, slug: triangle, url: https://leetcode.com/problems/triangle, topics: ['Array', 'Dynamic Programming'], hasSolution: True, hasVideoSolution: False, 121: questionNo: 121, acRate: 53.92949452760936, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Best Time to Buy and Sell Stock, slug: best-time-to-buy-and-sell-stock, url: https://leetcode.com/problems/best-time-to-buy-and-sell-stock, topics: ['Array', 'Dynamic Programming'], hasSolution: True, hasVideoSolution: True, 122: questionNo: 122, acRate: 67.17096284002385, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Best Time to Buy and Sell Stock II, slug: best-time-to-buy-and-sell-stock-ii, url: https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii, topics: ['Array', 'Dynamic Programming', 'Greedy'], hasSolution: True, hasVideoSolution: True, 123: questionNo: 123, acRate: 48.70541200949296, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Best Time to Buy and Sell Stock III, slug: best-time-to-buy-and-sell-stock-iii, url: https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iii, topics: ['Array', 'Dynamic Programming'], hasSolution: True, hasVideoSolution: False, 124: questionNo: 124, acRate: 40.224646227517155, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Binary Tree Maximum Path Sum, slug: binary-tree-maximum-path-sum, url: https://leetcode.com/problems/binary-tree-maximum-path-sum, topics: ['Dynamic Programming', 'Tree', 'Depth-First Search', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 125: questionNo: 125, acRate: 48.204514467230254, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Valid Palindrome, slug: valid-palindrome, url: https://leetcode.com/problems/valid-palindrome, topics: ['Two Pointers', 'String'], hasSolution: True, hasVideoSolution: False, 126: questionNo: 126, acRate: 27.209104413286454, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Word Ladder II, slug: word-ladder-ii, url: https://leetcode.com/problems/word-ladder-ii, topics: ['Hash Table', 'String', 'Backtracking', 'Breadth-First Search'], hasSolution: True, hasVideoSolution: False, 127: questionNo: 127, acRate: 39.879402351743735, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Word Ladder, slug: word-ladder, url: https://leetcode.com/problems/word-ladder, topics: ['Hash Table', 'String', 'Breadth-First Search'], hasSolution: True, hasVideoSolution: True, 128: questionNo: 128, acRate: 47.32265296983356, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Longest Consecutive Sequence, slug: longest-consecutive-sequence, url: https://leetcode.com/problems/longest-consecutive-sequence, topics: ['Array', 'Hash Table', 'Union Find'], hasSolution: True, hasVideoSolution: False, 129: questionNo: 129, acRate: 66.3510675825342, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Sum Root to Leaf Numbers, slug: sum-root-to-leaf-numbers, url: https://leetcode.com/problems/sum-root-to-leaf-numbers, topics: ['Tree', 'Depth-First Search', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 130: questionNo: 130, acRate: 40.220901234037065, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Surrounded Regions, slug: surrounded-regions, url: https://leetcode.com/problems/surrounded-regions, topics: ['Array', 'Depth-First Search', 'Breadth-First Search', 'Union Find', 'Matrix'], hasSolution: True, hasVideoSolution: False, 131: questionNo: 131, acRate: 69.84377370849276, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Palindrome Partitioning, slug: palindrome-partitioning, url: https://leetcode.com/problems/palindrome-partitioning, topics: ['String', 'Dynamic Programming', 'Backtracking'], hasSolution: True, hasVideoSolution: False, 132: questionNo: 132, acRate: 34.17303854046608, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Palindrome Partitioning II, slug: palindrome-partitioning-ii, url: https://leetcode.com/problems/palindrome-partitioning-ii, topics: ['String', 'Dynamic Programming'], hasSolution: True, hasVideoSolution: False, 133: questionNo: 133, acRate: 58.34279217916482, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Clone Graph, slug: clone-graph, url: https://leetcode.com/problems/clone-graph, topics: ['Hash Table', 'Depth-First Search', 'Breadth-First Search', 'Graph'], hasSolution: True, hasVideoSolution: False, 134: questionNo: 134, acRate: 45.549557802567705, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Gas Station, slug: gas-station, url: https://leetcode.com/problems/gas-station, topics: ['Array', 'Greedy'], hasSolution: True, hasVideoSolution: False, 135: questionNo: 135, acRate: 43.59403191528129, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Candy, slug: candy, url: https://leetcode.com/problems/candy, topics: ['Array', 'Greedy'], hasSolution: True, hasVideoSolution: False, 136: questionNo: 136, acRate: 73.59393155712397, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Single Number, slug: single-number, url: https://leetcode.com/problems/single-number, topics: ['Array', 'Bit Manipulation'], hasSolution: True, hasVideoSolution: False, 137: questionNo: 137, acRate: 63.34016422896779, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Single Number II, slug: single-number-ii, url: https://leetcode.com/problems/single-number-ii, topics: ['Array', 'Bit Manipulation'], hasSolution: True, hasVideoSolution: False, 138: questionNo: 138, acRate: 57.012766670506785, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Copy List with Random Pointer, slug: copy-list-with-random-pointer, url: https://leetcode.com/problems/copy-list-with-random-pointer, topics: ['Hash Table', 'Linked List'], hasSolution: True, hasVideoSolution: False, 139: questionNo: 139, acRate: 47.03398046454101, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Word Break, slug: word-break, url: https://leetcode.com/problems/word-break, topics: ['Array', 'Hash Table', 'String', 'Dynamic Programming', 'Trie', 'Memoization'], hasSolution: True, hasVideoSolution: True, 140: questionNo: 140, acRate: 51.313242955679485, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Word Break II, slug: word-break-ii, url: https://leetcode.com/problems/word-break-ii, topics: ['Array', 'Hash Table', 'String', 'Dynamic Programming', 'Backtracking', 'Trie', 'Memoization'], hasSolution: True, hasVideoSolution: False, 141: questionNo: 141, acRate: 50.82194096170185, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Linked List Cycle, slug: linked-list-cycle, url: https://leetcode.com/problems/linked-list-cycle, topics: ['Hash Table', 'Linked List', 'Two Pointers'], hasSolution: True, hasVideoSolution: True, 142: questionNo: 142, acRate: 52.061235618459136, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Linked List Cycle II, slug: linked-list-cycle-ii, url: https://leetcode.com/problems/linked-list-cycle-ii, topics: ['Hash Table', 'Linked List', 'Two Pointers'], hasSolution: True, hasVideoSolution: False, 143: questionNo: 143, acRate: 59.49856419600743, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Reorder List, slug: reorder-list, url: https://leetcode.com/problems/reorder-list, topics: ['Linked List', 'Two Pointers', 'Stack', 'Recursion'], hasSolution: True, hasVideoSolution: False, 144: questionNo: 144, acRate: 70.27989967765402, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Binary Tree Preorder Traversal, slug: binary-tree-preorder-traversal, url: https://leetcode.com/problems/binary-tree-preorder-traversal, topics: ['Stack', 'Tree', 'Depth-First Search', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 145: questionNo: 145, acRate: 71.80326519553964, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Binary Tree Postorder Traversal, slug: binary-tree-postorder-traversal, url: https://leetcode.com/problems/binary-tree-postorder-traversal, topics: ['Stack', 'Tree', 'Depth-First Search', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 146: questionNo: 146, acRate: 42.90606628966732, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: LRU Cache, slug: lru-cache, url: https://leetcode.com/problems/lru-cache, topics: ['Hash Table', 'Linked List', 'Design', 'Doubly-Linked List'], hasSolution: True, hasVideoSolution: False, 147: questionNo: 147, acRate: 54.153453581309776, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Insertion Sort List, slug: insertion-sort-list, url: https://leetcode.com/problems/insertion-sort-list, topics: ['Linked List', 'Sorting'], hasSolution: True, hasVideoSolution: True, 148: questionNo: 148, acRate: 58.837689570000016, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Sort List, slug: sort-list, url: https://leetcode.com/problems/sort-list, topics: ['Linked List', 'Two Pointers', 'Divide and Conquer', 'Sorting', 'Merge Sort'], hasSolution: True, hasVideoSolution: False, 149: questionNo: 149, acRate: 27.195335112391827, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Max Points on a Line, slug: max-points-on-a-line, url: https://leetcode.com/problems/max-points-on-a-line, topics: ['Array', 'Hash Table', 'Math', 'Geometry'], hasSolution: True, hasVideoSolution: False, 150: questionNo: 150, acRate: 52.157664928272965, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Evaluate Reverse Polish Notation, slug: evaluate-reverse-polish-notation, url: https://leetcode.com/problems/evaluate-reverse-polish-notation, topics: ['Array', 'Math', 'Stack'], hasSolution: True, hasVideoSolution: False, 151: questionNo: 151, acRate: 44.604933545233635, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Reverse Words in a String, slug: reverse-words-in-a-string, url: https://leetcode.com/problems/reverse-words-in-a-string, topics: ['Two Pointers', 'String'], hasSolution: True, hasVideoSolution: False, 152: questionNo: 152, acRate: 34.20660125900301, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum Product Subarray, slug: maximum-product-subarray, url: https://leetcode.com/problems/maximum-product-subarray, topics: ['Array', 'Dynamic Programming'], hasSolution: True, hasVideoSolution: False, 153: questionNo: 153, acRate: 50.9094497490094, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Find Minimum in Rotated Sorted Array, slug: find-minimum-in-rotated-sorted-array, url: https://leetcode.com/problems/find-minimum-in-rotated-sorted-array, topics: ['Array', 'Binary Search'], hasSolution: True, hasVideoSolution: False, 154: questionNo: 154, acRate: 43.70176816991958, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Find Minimum in Rotated Sorted Array II, slug: find-minimum-in-rotated-sorted-array-ii, url: https://leetcode.com/problems/find-minimum-in-rotated-sorted-array-ii, topics: ['Array', 'Binary Search'], hasSolution: True, hasVideoSolution: False, 155: questionNo: 155, acRate: 54.651901643254305, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Min Stack, slug: min-stack, url: https://leetcode.com/problems/min-stack, topics: ['Stack', 'Design'], hasSolution: True, hasVideoSolution: False, 156: questionNo: 156, acRate: 63.03476997105556, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Binary Tree Upside Down, slug: binary-tree-upside-down, url: https://leetcode.com/problems/binary-tree-upside-down, topics: ['Tree', 'Depth-First Search', 'Binary Tree'], hasSolution: False, hasVideoSolution: False, 157: questionNo: 157, acRate: 41.66157235897048, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Read N Characters Given Read4, slug: read-n-characters-given-read4, url: https://leetcode.com/problems/read-n-characters-given-read4, topics: ['Array', 'Simulation', 'Interactive'], hasSolution: True, hasVideoSolution: False, 158: questionNo: 158, acRate: 42.41741569686164, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Read N Characters Given read4 II - Call Multiple Times, slug: read-n-characters-given-read4-ii-call-multiple-times, url: https://leetcode.com/problems/read-n-characters-given-read4-ii-call-multiple-times, topics: ['Array', 'Simulation', 'Interactive'], hasSolution: False, hasVideoSolution: False, 159: questionNo: 159, acRate: 55.57674779731965, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Longest Substring with At Most Two Distinct Characters, slug: longest-substring-with-at-most-two-distinct-characters, url: https://leetcode.com/problems/longest-substring-with-at-most-two-distinct-characters, topics: ['Hash Table', 'String', 'Sliding Window'], hasSolution: True, hasVideoSolution: True, 160: questionNo: 160, acRate: 58.27394354799783, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Intersection of Two Linked Lists, slug: intersection-of-two-linked-lists, url: https://leetcode.com/problems/intersection-of-two-linked-lists, topics: ['Hash Table', 'Linked List', 'Two Pointers'], hasSolution: True, hasVideoSolution: True, 161: questionNo: 161, acRate: 34.335368640487154, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: One Edit Distance, slug: one-edit-distance, url: https://leetcode.com/problems/one-edit-distance, topics: ['Two Pointers', 'String'], hasSolution: True, hasVideoSolution: False, 162: questionNo: 162, acRate: 46.00870863837493, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Find Peak Element, slug: find-peak-element, url: https://leetcode.com/problems/find-peak-element, topics: ['Array', 'Binary Search'], hasSolution: True, hasVideoSolution: True, 163: questionNo: 163, acRate: 34.03220489898527, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Missing Ranges, slug: missing-ranges, url: https://leetcode.com/problems/missing-ranges, topics: ['Array'], hasSolution: True, hasVideoSolution: False, 164: questionNo: 164, acRate: 46.67527898873946, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum Gap, slug: maximum-gap, url: https://leetcode.com/problems/maximum-gap, topics: ['Array', 'Sorting', 'Bucket Sort', 'Radix Sort'], hasSolution: True, hasVideoSolution: False, 165: questionNo: 165, acRate: 41.05198586664922, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Compare Version Numbers, slug: compare-version-numbers, url: https://leetcode.com/problems/compare-version-numbers, topics: ['Two Pointers', 'String'], hasSolution: True, hasVideoSolution: False, 166: questionNo: 166, acRate: 25.23595003731404, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Fraction to Recurring Decimal, slug: fraction-to-recurring-decimal, url: https://leetcode.com/problems/fraction-to-recurring-decimal, topics: ['Hash Table', 'Math', 'String'], hasSolution: True, hasVideoSolution: False, 167: questionNo: 167, acRate: 61.7395983766557, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Two Sum II - Input Array Is Sorted, slug: two-sum-ii-input-array-is-sorted, url: https://leetcode.com/problems/two-sum-ii-input-array-is-sorted, topics: ['Array', 'Two Pointers', 'Binary Search'], hasSolution: True, hasVideoSolution: False, 168: questionNo: 168, acRate: 41.191876119866656, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Excel Sheet Column Title, slug: excel-sheet-column-title, url: https://leetcode.com/problems/excel-sheet-column-title, topics: ['Math', 'String'], hasSolution: True, hasVideoSolution: False, 169: questionNo: 169, acRate: 65.05071275424828, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Majority Element, slug: majority-element, url: https://leetcode.com/problems/majority-element, topics: ['Array', 'Hash Table', 'Divide and Conquer', 'Sorting', 'Counting'], hasSolution: True, hasVideoSolution: False, 170: questionNo: 170, acRate: 38.238902046517275, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Two Sum III - Data structure design, slug: two-sum-iii-data-structure-design, url: https://leetcode.com/problems/two-sum-iii-data-structure-design, topics: ['Array', 'Hash Table', 'Two Pointers', 'Design', 'Data Stream'], hasSolution: True, hasVideoSolution: False, 171: questionNo: 171, acRate: 64.17397081979448, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Excel Sheet Column Number, slug: excel-sheet-column-number, url: https://leetcode.com/problems/excel-sheet-column-number, topics: ['Math', 'String'], hasSolution: True, hasVideoSolution: False, 172: questionNo: 172, acRate: 43.620259733978685, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Factorial Trailing Zeroes, slug: factorial-trailing-zeroes, url: https://leetcode.com/problems/factorial-trailing-zeroes, topics: ['Math'], hasSolution: True, hasVideoSolution: False, 173: questionNo: 173, acRate: 72.64804650553283, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Binary Search Tree Iterator, slug: binary-search-tree-iterator, url: https://leetcode.com/problems/binary-search-tree-iterator, topics: ['Stack', 'Tree', 'Design', 'Binary Search Tree', 'Binary Tree', 'Iterator'], hasSolution: True, hasVideoSolution: False, 174: questionNo: 174, acRate: 38.30584682716259, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Dungeon Game, slug: dungeon-game, url: https://leetcode.com/problems/dungeon-game, topics: ['Array', 'Dynamic Programming', 'Matrix'], hasSolution: True, hasVideoSolution: False, 175: questionNo: 175, acRate: 76.39013342737226, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Combine Two Tables, slug: combine-two-tables, url: https://leetcode.com/problems/combine-two-tables, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 176: questionNo: 176, acRate: 41.04878983185303, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Second Highest Salary, slug: second-highest-salary, url: https://leetcode.com/problems/second-highest-salary, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 177: questionNo: 177, acRate: 37.920927536231886, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Nth Highest Salary, slug: nth-highest-salary, url: https://leetcode.com/problems/nth-highest-salary, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 178: questionNo: 178, acRate: 62.90177769797091, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Rank Scores, slug: rank-scores, url: https://leetcode.com/problems/rank-scores, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 179: questionNo: 179, acRate: 36.595143549603726, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Largest Number, slug: largest-number, url: https://leetcode.com/problems/largest-number, topics: ['Array', 'String', 'Greedy', 'Sorting'], hasSolution: True, hasVideoSolution: False, 180: questionNo: 180, acRate: 44.645999050021075, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Consecutive Numbers, slug: consecutive-numbers, url: https://leetcode.com/problems/consecutive-numbers, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 181: questionNo: 181, acRate: 69.89440800795941, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Employees Earning More Than Their Managers, slug: employees-earning-more-than-their-managers, url: https://leetcode.com/problems/employees-earning-more-than-their-managers, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 182: questionNo: 182, acRate: 71.30529695551988, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Duplicate Emails, slug: duplicate-emails, url: https://leetcode.com/problems/duplicate-emails, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 183: questionNo: 183, acRate: 69.38545456046974, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Customers Who Never Order, slug: customers-who-never-order, url: https://leetcode.com/problems/customers-who-never-order, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 184: questionNo: 184, acRate: 52.23783077425678, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Department Highest Salary, slug: department-highest-salary, url: https://leetcode.com/problems/department-highest-salary, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 185: questionNo: 185, acRate: 54.23500978461501, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Department Top Three Salaries, slug: department-top-three-salaries, url: https://leetcode.com/problems/department-top-three-salaries, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 186: questionNo: 186, acRate: 54.9026832037674, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Reverse Words in a String II, slug: reverse-words-in-a-string-ii, url: https://leetcode.com/problems/reverse-words-in-a-string-ii, topics: ['Two Pointers', 'String'], hasSolution: True, hasVideoSolution: True, 187: questionNo: 187, acRate: 49.31176194523015, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Repeated DNA Sequences, slug: repeated-dna-sequences, url: https://leetcode.com/problems/repeated-dna-sequences, topics: ['Hash Table', 'String', 'Bit Manipulation', 'Sliding Window', 'Rolling Hash', 'Hash Function'], hasSolution: True, hasVideoSolution: False, 188: questionNo: 188, acRate: 43.81292402724701, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Best Time to Buy and Sell Stock IV, slug: best-time-to-buy-and-sell-stock-iv, url: https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv, topics: ['Array', 'Dynamic Programming'], hasSolution: True, hasVideoSolution: False, 189: questionNo: 189, acRate: 41.10672951455126, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Rotate Array, slug: rotate-array, url: https://leetcode.com/problems/rotate-array, topics: ['Array', 'Math', 'Two Pointers'], hasSolution: True, hasVideoSolution: False, 190: questionNo: 190, acRate: 59.50926403946538, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Reverse Bits, slug: reverse-bits, url: https://leetcode.com/problems/reverse-bits, topics: ['Divide and Conquer', 'Bit Manipulation'], hasSolution: True, hasVideoSolution: False, 191: questionNo: 191, acRate: 71.83628635336254, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Number of 1 Bits, slug: number-of-1-bits, url: https://leetcode.com/problems/number-of-1-bits, topics: ['Divide and Conquer', 'Bit Manipulation'], hasSolution: True, hasVideoSolution: False, 192: questionNo: 192, acRate: 25.933926114423517, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Word Frequency, slug: word-frequency, url: https://leetcode.com/problems/word-frequency, topics: ['Shell'], hasSolution: False, hasVideoSolution: False, 193: questionNo: 193, acRate: 26.162656668971962, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Valid Phone Numbers, slug: valid-phone-numbers, url: https://leetcode.com/problems/valid-phone-numbers, topics: ['Shell'], hasSolution: False, hasVideoSolution: False, 194: questionNo: 194, acRate: 26.601000000000003, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Transpose File, slug: transpose-file, url: https://leetcode.com/problems/transpose-file, topics: ['Shell'], hasSolution: False, hasVideoSolution: False, 195: questionNo: 195, acRate: 33.5136483674289, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Tenth Line, slug: tenth-line, url: https://leetcode.com/problems/tenth-line, topics: ['Shell'], hasSolution: False, hasVideoSolution: False, 196: questionNo: 196, acRate: 62.44244592678374, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Delete Duplicate Emails, slug: delete-duplicate-emails, url: https://leetcode.com/problems/delete-duplicate-emails, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 197: questionNo: 197, acRate: 48.18162147098171, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Rising Temperature, slug: rising-temperature, url: https://leetcode.com/problems/rising-temperature, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 198: questionNo: 198, acRate: 51.29437580633473, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: House Robber, slug: house-robber, url: https://leetcode.com/problems/house-robber, topics: ['Array', 'Dynamic Programming'], hasSolution: True, hasVideoSolution: False, 199: questionNo: 199, acRate: 63.52853092044477, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Binary Tree Right Side View, slug: binary-tree-right-side-view, url: https://leetcode.com/problems/binary-tree-right-side-view, topics: ['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree'], hasSolution: True, hasVideoSolution: True, 200: questionNo: 200, acRate: 59.974826788812905, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Number of Islands, slug: number-of-islands, url: https://leetcode.com/problems/number-of-islands, topics: ['Array', 'Depth-First Search', 'Breadth-First Search', 'Union Find', 'Matrix'], hasSolution: True, hasVideoSolution: True, 201: questionNo: 201, acRate: 47.12370186884369, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Bitwise AND of Numbers Range, slug: bitwise-and-of-numbers-range, url: https://leetcode.com/problems/bitwise-and-of-numbers-range, topics: ['Bit Manipulation'], hasSolution: True, hasVideoSolution: False, 202: questionNo: 202, acRate: 56.50908467388336, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Happy Number, slug: happy-number, url: https://leetcode.com/problems/happy-number, topics: ['Hash Table', 'Math', 'Two Pointers'], hasSolution: True, hasVideoSolution: False, 203: questionNo: 203, acRate: 49.4180315941974, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Remove Linked List Elements, slug: remove-linked-list-elements, url: https://leetcode.com/problems/remove-linked-list-elements, topics: ['Linked List', 'Recursion'], hasSolution: True, hasVideoSolution: False, 204: questionNo: 204, acRate: 33.825585758931815, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Count Primes, slug: count-primes, url: https://leetcode.com/problems/count-primes, topics: ['Array', 'Math', 'Enumeration', 'Number Theory'], hasSolution: True, hasVideoSolution: False, 205: questionNo: 205, acRate: 45.4537750466819, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Isomorphic Strings, slug: isomorphic-strings, url: https://leetcode.com/problems/isomorphic-strings, topics: ['Hash Table', 'String'], hasSolution: True, hasVideoSolution: False, 206: questionNo: 206, acRate: 77.16602323186889, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Reverse Linked List, slug: reverse-linked-list, url: https://leetcode.com/problems/reverse-linked-list, topics: ['Linked List', 'Recursion'], hasSolution: True, hasVideoSolution: True, 207: questionNo: 207, acRate: 47.16711230597783, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Course Schedule, slug: course-schedule, url: https://leetcode.com/problems/course-schedule, topics: ['Depth-First Search', 'Breadth-First Search', 'Graph', 'Topological Sort'], hasSolution: True, hasVideoSolution: False, 208: questionNo: 208, acRate: 65.82684132548322, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Implement Trie (Prefix Tree), slug: implement-trie-prefix-tree, url: https://leetcode.com/problems/implement-trie-prefix-tree, topics: ['Hash Table', 'String', 'Design', 'Trie'], hasSolution: True, hasVideoSolution: False, 209: questionNo: 209, acRate: 47.51650252444544, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Size Subarray Sum, slug: minimum-size-subarray-sum, url: https://leetcode.com/problems/minimum-size-subarray-sum, topics: ['Array', 'Binary Search', 'Sliding Window', 'Prefix Sum'], hasSolution: True, hasVideoSolution: False, 210: questionNo: 210, acRate: 51.043026299996995, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Course Schedule II, slug: course-schedule-ii, url: https://leetcode.com/problems/course-schedule-ii, topics: ['Depth-First Search', 'Breadth-First Search', 'Graph', 'Topological Sort'], hasSolution: True, hasVideoSolution: True, 211: questionNo: 211, acRate: 45.6340012079442, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Design Add and Search Words Data Structure, slug: design-add-and-search-words-data-structure, url: https://leetcode.com/problems/design-add-and-search-words-data-structure, topics: ['String', 'Depth-First Search', 'Design', 'Trie'], hasSolution: True, hasVideoSolution: False, 212: questionNo: 212, acRate: 36.47680412371134, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Word Search II, slug: word-search-ii, url: https://leetcode.com/problems/word-search-ii, topics: ['Array', 'String', 'Backtracking', 'Trie', 'Matrix'], hasSolution: True, hasVideoSolution: True, 213: questionNo: 213, acRate: 42.2965226955455, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: House Robber II, slug: house-robber-ii, url: https://leetcode.com/problems/house-robber-ii, topics: ['Array', 'Dynamic Programming'], hasSolution: True, hasVideoSolution: False, 214: questionNo: 214, acRate: 33.77978083486289, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Shortest Palindrome, slug: shortest-palindrome, url: https://leetcode.com/problems/shortest-palindrome, topics: ['String', 'Rolling Hash', 'String Matching', 'Hash Function'], hasSolution: True, hasVideoSolution: False, 215: questionNo: 215, acRate: 66.93602588783753, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Kth Largest Element in an Array, slug: kth-largest-element-in-an-array, url: https://leetcode.com/problems/kth-largest-element-in-an-array, topics: ['Array', 'Divide and Conquer', 'Sorting', 'Heap (Priority Queue)', 'Quickselect'], hasSolution: True, hasVideoSolution: True, 216: questionNo: 216, acRate: 70.16983339804914, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Combination Sum III, slug: combination-sum-iii, url: https://leetcode.com/problems/combination-sum-iii, topics: ['Array', 'Backtracking'], hasSolution: True, hasVideoSolution: False, 217: questionNo: 217, acRate: 62.00272835336348, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Contains Duplicate, slug: contains-duplicate, url: https://leetcode.com/problems/contains-duplicate, topics: ['Array', 'Hash Table', 'Sorting'], hasSolution: True, hasVideoSolution: False, 218: questionNo: 218, acRate: 42.88957308678851, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: The Skyline Problem, slug: the-skyline-problem, url: https://leetcode.com/problems/the-skyline-problem, topics: ['Array', 'Divide and Conquer', 'Binary Indexed Tree', 'Segment Tree', 'Line Sweep', 'Heap (Priority Queue)', 'Ordered Set'], hasSolution: True, hasVideoSolution: False, 219: questionNo: 219, acRate: 45.88367063114538, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Contains Duplicate II, slug: contains-duplicate-ii, url: https://leetcode.com/problems/contains-duplicate-ii, topics: ['Array', 'Hash Table', 'Sliding Window'], hasSolution: True, hasVideoSolution: False, 220: questionNo: 220, acRate: 22.888867912430808, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Contains Duplicate III, slug: contains-duplicate-iii, url: https://leetcode.com/problems/contains-duplicate-iii, topics: ['Array', 'Sliding Window', 'Sorting', 'Bucket Sort', 'Ordered Set'], hasSolution: True, hasVideoSolution: False, 221: questionNo: 221, acRate: 46.97551556902801, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximal Square, slug: maximal-square, url: https://leetcode.com/problems/maximal-square, topics: ['Array', 'Dynamic Programming', 'Matrix'], hasSolution: True, hasVideoSolution: False, 222: questionNo: 222, acRate: 66.421583893918, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Count Complete Tree Nodes, slug: count-complete-tree-nodes, url: https://leetcode.com/problems/count-complete-tree-nodes, topics: ['Binary Search', 'Bit Manipulation', 'Tree', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 223: questionNo: 223, acRate: 46.46533033340151, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Rectangle Area, slug: rectangle-area, url: https://leetcode.com/problems/rectangle-area, topics: ['Math', 'Geometry'], hasSolution: True, hasVideoSolution: False, 224: questionNo: 224, acRate: 43.72389436832279, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Basic Calculator, slug: basic-calculator, url: https://leetcode.com/problems/basic-calculator, topics: ['Math', 'String', 'Stack', 'Recursion'], hasSolution: True, hasVideoSolution: False, 225: questionNo: 225, acRate: 64.58449238351376, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Implement Stack using Queues, slug: implement-stack-using-queues, url: https://leetcode.com/problems/implement-stack-using-queues, topics: ['Stack', 'Design', 'Queue'], hasSolution: True, hasVideoSolution: False, 226: questionNo: 226, acRate: 77.46854331155892, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Invert Binary Tree, slug: invert-binary-tree, url: https://leetcode.com/problems/invert-binary-tree, topics: ['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree'], hasSolution: True, hasVideoSolution: True, 227: questionNo: 227, acRate: 43.977573576230405, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Basic Calculator II, slug: basic-calculator-ii, url: https://leetcode.com/problems/basic-calculator-ii, topics: ['Math', 'String', 'Stack'], hasSolution: True, hasVideoSolution: False, 228: questionNo: 228, acRate: 51.14749193811152, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Summary Ranges, slug: summary-ranges, url: https://leetcode.com/problems/summary-ranges, topics: ['Array'], hasSolution: True, hasVideoSolution: False, 229: questionNo: 229, acRate: 52.13163177883201, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Majority Element II, slug: majority-element-ii, url: https://leetcode.com/problems/majority-element-ii, topics: ['Array', 'Hash Table', 'Sorting', 'Counting'], hasSolution: True, hasVideoSolution: False, 230: questionNo: 230, acRate: 73.18690107087205, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Kth Smallest Element in a BST, slug: kth-smallest-element-in-a-bst, url: https://leetcode.com/problems/kth-smallest-element-in-a-bst, topics: ['Tree', 'Depth-First Search', 'Binary Search Tree', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 231: questionNo: 231, acRate: 47.87805204178905, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Power of Two, slug: power-of-two, url: https://leetcode.com/problems/power-of-two, topics: ['Math', 'Bit Manipulation', 'Recursion'], hasSolution: True, hasVideoSolution: False, 232: questionNo: 232, acRate: 66.66446659336113, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Implement Queue using Stacks, slug: implement-queue-using-stacks, url: https://leetcode.com/problems/implement-queue-using-stacks, topics: ['Stack', 'Design', 'Queue'], hasSolution: True, hasVideoSolution: False, 233: questionNo: 233, acRate: 34.766720550697194, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Number of Digit One, slug: number-of-digit-one, url: https://leetcode.com/problems/number-of-digit-one, topics: ['Math', 'Dynamic Programming', 'Recursion'], hasSolution: True, hasVideoSolution: False, 234: questionNo: 234, acRate: 53.722353812504565, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Palindrome Linked List, slug: palindrome-linked-list, url: https://leetcode.com/problems/palindrome-linked-list, topics: ['Linked List', 'Two Pointers', 'Stack', 'Recursion'], hasSolution: True, hasVideoSolution: True, 235: questionNo: 235, acRate: 65.52328300052784, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Lowest Common Ancestor of a Binary Search Tree, slug: lowest-common-ancestor-of-a-binary-search-tree, url: https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree, topics: ['Tree', 'Depth-First Search', 'Binary Search Tree', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 236: questionNo: 236, acRate: 63.21586040977488, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Lowest Common Ancestor of a Binary Tree, slug: lowest-common-ancestor-of-a-binary-tree, url: https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree, topics: ['Tree', 'Depth-First Search', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 237: questionNo: 237, acRate: 80.32313122441877, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Delete Node in a Linked List, slug: delete-node-in-a-linked-list, url: https://leetcode.com/problems/delete-node-in-a-linked-list, topics: ['Linked List'], hasSolution: True, hasVideoSolution: False, 238: questionNo: 238, acRate: 66.49894610271875, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Product of Array Except Self, slug: product-of-array-except-self, url: https://leetcode.com/problems/product-of-array-except-self, topics: ['Array', 'Prefix Sum'], hasSolution: True, hasVideoSolution: True, 239: questionNo: 239, acRate: 46.72190001562798, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Sliding Window Maximum, slug: sliding-window-maximum, url: https://leetcode.com/problems/sliding-window-maximum, topics: ['Array', 'Queue', 'Sliding Window', 'Heap (Priority Queue)', 'Monotonic Queue'], hasSolution: True, hasVideoSolution: False, 240: questionNo: 240, acRate: 53.163884786592774, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Search a 2D Matrix II, slug: search-a-2d-matrix-ii, url: https://leetcode.com/problems/search-a-2d-matrix-ii, topics: ['Array', 'Binary Search', 'Divide and Conquer', 'Matrix'], hasSolution: True, hasVideoSolution: False, 241: questionNo: 241, acRate: 65.7292096944769, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Different Ways to Add Parentheses, slug: different-ways-to-add-parentheses, url: https://leetcode.com/problems/different-ways-to-add-parentheses, topics: ['Math', 'String', 'Dynamic Programming', 'Recursion', 'Memoization'], hasSolution: False, hasVideoSolution: False, 242: questionNo: 242, acRate: 64.96997367950101, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Valid Anagram, slug: valid-anagram, url: https://leetcode.com/problems/valid-anagram, topics: ['Hash Table', 'String', 'Sorting'], hasSolution: True, hasVideoSolution: True, 243: questionNo: 243, acRate: 65.41552770991073, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Shortest Word Distance, slug: shortest-word-distance, url: https://leetcode.com/problems/shortest-word-distance, topics: ['Array', 'String'], hasSolution: True, hasVideoSolution: False, 244: questionNo: 244, acRate: 61.32878776493295, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Shortest Word Distance II, slug: shortest-word-distance-ii, url: https://leetcode.com/problems/shortest-word-distance-ii, topics: ['Array', 'Hash Table', 'Two Pointers', 'String', 'Design'], hasSolution: True, hasVideoSolution: True, 245: questionNo: 245, acRate: 58.54667024780538, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Shortest Word Distance III, slug: shortest-word-distance-iii, url: https://leetcode.com/problems/shortest-word-distance-iii, topics: ['Array', 'String'], hasSolution: True, hasVideoSolution: False, 246: questionNo: 246, acRate: 47.68694352780026, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Strobogrammatic Number, slug: strobogrammatic-number, url: https://leetcode.com/problems/strobogrammatic-number, topics: ['Hash Table', 'Two Pointers', 'String'], hasSolution: True, hasVideoSolution: True, 247: questionNo: 247, acRate: 52.530770218463964, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Strobogrammatic Number II, slug: strobogrammatic-number-ii, url: https://leetcode.com/problems/strobogrammatic-number-ii, topics: ['Array', 'String', 'Recursion'], hasSolution: True, hasVideoSolution: False, 248: questionNo: 248, acRate: 42.15979737508634, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Strobogrammatic Number III, slug: strobogrammatic-number-iii, url: https://leetcode.com/problems/strobogrammatic-number-iii, topics: ['Array', 'String', 'Recursion'], hasSolution: False, hasVideoSolution: False, 249: questionNo: 249, acRate: 65.92254404684031, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Group Shifted Strings, slug: group-shifted-strings, url: https://leetcode.com/problems/group-shifted-strings, topics: ['Array', 'Hash Table', 'String'], hasSolution: True, hasVideoSolution: True, 250: questionNo: 250, acRate: 56.54841437477349, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Count Univalue Subtrees, slug: count-univalue-subtrees, url: https://leetcode.com/problems/count-univalue-subtrees, topics: ['Tree', 'Depth-First Search', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 251: questionNo: 251, acRate: 49.61702620753587, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Flatten 2D Vector, slug: flatten-2d-vector, url: https://leetcode.com/problems/flatten-2d-vector, topics: ['Array', 'Two Pointers', 'Design', 'Iterator'], hasSolution: True, hasVideoSolution: False, 252: questionNo: 252, acRate: 58.24243975989303, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Meeting Rooms, slug: meeting-rooms, url: https://leetcode.com/problems/meeting-rooms, topics: ['Array', 'Sorting'], hasSolution: True, hasVideoSolution: True, 253: questionNo: 253, acRate: 51.41202540397789, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Meeting Rooms II, slug: meeting-rooms-ii, url: https://leetcode.com/problems/meeting-rooms-ii, topics: ['Array', 'Two Pointers', 'Greedy', 'Sorting', 'Heap (Priority Queue)', 'Prefix Sum'], hasSolution: True, hasVideoSolution: True, 254: questionNo: 254, acRate: 49.620832737158395, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Factor Combinations, slug: factor-combinations, url: https://leetcode.com/problems/factor-combinations, topics: ['Backtracking'], hasSolution: True, hasVideoSolution: False, 255: questionNo: 255, acRate: 50.1118978610999, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Verify Preorder Sequence in Binary Search Tree, slug: verify-preorder-sequence-in-binary-search-tree, url: https://leetcode.com/problems/verify-preorder-sequence-in-binary-search-tree, topics: ['Array', 'Stack', 'Tree', 'Binary Search Tree', 'Recursion', 'Monotonic Stack', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 256: questionNo: 256, acRate: 62.72735370089961, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Paint House, slug: paint-house, url: https://leetcode.com/problems/paint-house, topics: ['Array', 'Dynamic Programming'], hasSolution: True, hasVideoSolution: False, 257: questionNo: 257, acRate: 64.2468258216465, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Binary Tree Paths, slug: binary-tree-paths, url: https://leetcode.com/problems/binary-tree-paths, topics: ['String', 'Backtracking', 'Tree', 'Depth-First Search', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 258: questionNo: 258, acRate: 66.9023528873672, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Add Digits, slug: add-digits, url: https://leetcode.com/problems/add-digits, topics: ['Math', 'Simulation', 'Number Theory'], hasSolution: True, hasVideoSolution: False, 259: questionNo: 259, acRate: 50.806628003314, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: 3Sum Smaller, slug: 3sum-smaller, url: https://leetcode.com/problems/3sum-smaller, topics: ['Array', 'Two Pointers', 'Binary Search', 'Sorting'], hasSolution: True, hasVideoSolution: False, 260: questionNo: 260, acRate: 70.79054107150414, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Single Number III, slug: single-number-iii, url: https://leetcode.com/problems/single-number-iii, topics: ['Array', 'Bit Manipulation'], hasSolution: True, hasVideoSolution: False, 261: questionNo: 261, acRate: 48.35480779469705, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Graph Valid Tree, slug: graph-valid-tree, url: https://leetcode.com/problems/graph-valid-tree, topics: ['Depth-First Search', 'Breadth-First Search', 'Union Find', 'Graph'], hasSolution: True, hasVideoSolution: False, 262: questionNo: 262, acRate: 36.50936139930909, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Trips and Users, slug: trips-and-users, url: https://leetcode.com/problems/trips-and-users, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 263: questionNo: 263, acRate: 42.00101482510001, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Ugly Number, slug: ugly-number, url: https://leetcode.com/problems/ugly-number, topics: ['Math'], hasSolution: True, hasVideoSolution: False, 264: questionNo: 264, acRate: 46.2658768243042, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Ugly Number II, slug: ugly-number-ii, url: https://leetcode.com/problems/ugly-number-ii, topics: ['Hash Table', 'Math', 'Dynamic Programming', 'Heap (Priority Queue)'], hasSolution: False, hasVideoSolution: False, 265: questionNo: 265, acRate: 54.8922743357762, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Paint House II, slug: paint-house-ii, url: https://leetcode.com/problems/paint-house-ii, topics: ['Array', 'Dynamic Programming'], hasSolution: True, hasVideoSolution: False, 266: questionNo: 266, acRate: 67.56988587997013, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Palindrome Permutation, slug: palindrome-permutation, url: https://leetcode.com/problems/palindrome-permutation, topics: ['Hash Table', 'String', 'Bit Manipulation'], hasSolution: True, hasVideoSolution: False, 267: questionNo: 267, acRate: 41.74916112391484, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Palindrome Permutation II, slug: palindrome-permutation-ii, url: https://leetcode.com/problems/palindrome-permutation-ii, topics: ['Hash Table', 'String', 'Backtracking'], hasSolution: True, hasVideoSolution: False, 268: questionNo: 268, acRate: 67.55164918974815, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Missing Number, slug: missing-number, url: https://leetcode.com/problems/missing-number, topics: ['Array', 'Hash Table', 'Math', 'Binary Search', 'Bit Manipulation', 'Sorting'], hasSolution: True, hasVideoSolution: True, 269: questionNo: 269, acRate: 35.88580497527128, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Alien Dictionary, slug: alien-dictionary, url: https://leetcode.com/problems/alien-dictionary, topics: ['Array', 'String', 'Depth-First Search', 'Breadth-First Search', 'Graph', 'Topological Sort'], hasSolution: True, hasVideoSolution: False, 270: questionNo: 270, acRate: 51.30889445707747, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Closest Binary Search Tree Value, slug: closest-binary-search-tree-value, url: https://leetcode.com/problems/closest-binary-search-tree-value, topics: ['Binary Search', 'Tree', 'Depth-First Search', 'Binary Search Tree', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 271: questionNo: 271, acRate: 47.18894736249, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Encode and Decode Strings, slug: encode-and-decode-strings, url: https://leetcode.com/problems/encode-and-decode-strings, topics: ['Array', 'String', 'Design'], hasSolution: True, hasVideoSolution: False, 272: questionNo: 272, acRate: 59.34566313330672, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Closest Binary Search Tree Value II, slug: closest-binary-search-tree-value-ii, url: https://leetcode.com/problems/closest-binary-search-tree-value-ii, topics: ['Two Pointers', 'Stack', 'Tree', 'Depth-First Search', 'Binary Search Tree', 'Heap (Priority Queue)', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 273: questionNo: 273, acRate: 30.888108997889237, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Integer to English Words, slug: integer-to-english-words, url: https://leetcode.com/problems/integer-to-english-words, topics: ['Math', 'String', 'Recursion'], hasSolution: False, hasVideoSolution: False, 274: questionNo: 274, acRate: 39.16235667170321, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: H-Index, slug: h-index, url: https://leetcode.com/problems/h-index, topics: ['Array', 'Sorting', 'Counting Sort'], hasSolution: True, hasVideoSolution: False, 275: questionNo: 275, acRate: 38.30561680726742, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: H-Index II, slug: h-index-ii, url: https://leetcode.com/problems/h-index-ii, topics: ['Array', 'Binary Search'], hasSolution: True, hasVideoSolution: False, 276: questionNo: 276, acRate: 46.851926048881005, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Paint Fence, slug: paint-fence, url: https://leetcode.com/problems/paint-fence, topics: ['Dynamic Programming'], hasSolution: True, hasVideoSolution: False, 277: questionNo: 277, acRate: 47.44746571735, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Find the Celebrity, slug: find-the-celebrity, url: https://leetcode.com/problems/find-the-celebrity, topics: ['Two Pointers', 'Graph', 'Interactive'], hasSolution: True, hasVideoSolution: True, 278: questionNo: 278, acRate: 44.663368594544444, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: First Bad Version, slug: first-bad-version, url: https://leetcode.com/problems/first-bad-version, topics: ['Binary Search', 'Interactive'], hasSolution: True, hasVideoSolution: True, 279: questionNo: 279, acRate: 54.99296942488003, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Perfect Squares, slug: perfect-squares, url: https://leetcode.com/problems/perfect-squares, topics: ['Math', 'Dynamic Programming', 'Breadth-First Search'], hasSolution: True, hasVideoSolution: False, 280: questionNo: 280, acRate: 67.76430791908005, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Wiggle Sort, slug: wiggle-sort, url: https://leetcode.com/problems/wiggle-sort, topics: ['Array', 'Greedy', 'Sorting'], hasSolution: True, hasVideoSolution: True, 281: questionNo: 281, acRate: 64.12201354804688, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Zigzag Iterator, slug: zigzag-iterator, url: https://leetcode.com/problems/zigzag-iterator, topics: ['Array', 'Design', 'Queue', 'Iterator'], hasSolution: True, hasVideoSolution: False, 282: questionNo: 282, acRate: 40.09810442301297, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Expression Add Operators, slug: expression-add-operators, url: https://leetcode.com/problems/expression-add-operators, topics: ['Math', 'String', 'Backtracking'], hasSolution: True, hasVideoSolution: False, 283: questionNo: 283, acRate: 61.93460155879453, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Move Zeroes, slug: move-zeroes, url: https://leetcode.com/problems/move-zeroes, topics: ['Array', 'Two Pointers'], hasSolution: True, hasVideoSolution: True, 284: questionNo: 284, acRate: 59.707663451232584, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Peeking Iterator, slug: peeking-iterator, url: https://leetcode.com/problems/peeking-iterator, topics: ['Array', 'Design', 'Iterator'], hasSolution: True, hasVideoSolution: False, 285: questionNo: 285, acRate: 49.979778996324534, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Inorder Successor in BST, slug: inorder-successor-in-bst, url: https://leetcode.com/problems/inorder-successor-in-bst, topics: ['Tree', 'Depth-First Search', 'Binary Search Tree', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 286: questionNo: 286, acRate: 61.62938867630158, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Walls and Gates, slug: walls-and-gates, url: https://leetcode.com/problems/walls-and-gates, topics: ['Array', 'Breadth-First Search', 'Matrix'], hasSolution: True, hasVideoSolution: False, 287: questionNo: 287, acRate: 61.24675186163597, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Find the Duplicate Number, slug: find-the-duplicate-number, url: https://leetcode.com/problems/find-the-duplicate-number, topics: ['Array', 'Two Pointers', 'Binary Search', 'Bit Manipulation'], hasSolution: True, hasVideoSolution: False, 288: questionNo: 288, acRate: 26.399091496709175, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Unique Word Abbreviation, slug: unique-word-abbreviation, url: https://leetcode.com/problems/unique-word-abbreviation, topics: ['Array', 'Hash Table', 'String', 'Design'], hasSolution: True, hasVideoSolution: False, 289: questionNo: 289, acRate: 69.65034244222004, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Game of Life, slug: game-of-life, url: https://leetcode.com/problems/game-of-life, topics: ['Array', 'Matrix', 'Simulation'], hasSolution: True, hasVideoSolution: True, 290: questionNo: 290, acRate: 42.24027055704403, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Word Pattern, slug: word-pattern, url: https://leetcode.com/problems/word-pattern, topics: ['Hash Table', 'String'], hasSolution: True, hasVideoSolution: False, 291: questionNo: 291, acRate: 48.2981260966487, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Word Pattern II, slug: word-pattern-ii, url: https://leetcode.com/problems/word-pattern-ii, topics: ['Hash Table', 'String', 'Backtracking'], hasSolution: True, hasVideoSolution: False, 292: questionNo: 292, acRate: 57.08114629936239, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Nim Game, slug: nim-game, url: https://leetcode.com/problems/nim-game, topics: ['Math', 'Brainteaser', 'Game Theory'], hasSolution: True, hasVideoSolution: False, 293: questionNo: 293, acRate: 64.6504073559846, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Flip Game, slug: flip-game, url: https://leetcode.com/problems/flip-game, topics: ['String'], hasSolution: True, hasVideoSolution: False, 294: questionNo: 294, acRate: 52.13102999173197, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Flip Game II, slug: flip-game-ii, url: https://leetcode.com/problems/flip-game-ii, topics: ['Math', 'Dynamic Programming', 'Backtracking', 'Memoization', 'Game Theory'], hasSolution: False, hasVideoSolution: False, 295: questionNo: 295, acRate: 52.16666455125846, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Find Median from Data Stream, slug: find-median-from-data-stream, url: https://leetcode.com/problems/find-median-from-data-stream, topics: ['Two Pointers', 'Design', 'Sorting', 'Heap (Priority Queue)', 'Data Stream'], hasSolution: True, hasVideoSolution: False, 296: questionNo: 296, acRate: 60.97426733380986, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Best Meeting Point, slug: best-meeting-point, url: https://leetcode.com/problems/best-meeting-point, topics: ['Array', 'Math', 'Sorting', 'Matrix'], hasSolution: True, hasVideoSolution: False, 297: questionNo: 297, acRate: 57.20266156039677, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Serialize and Deserialize Binary Tree, slug: serialize-and-deserialize-binary-tree, url: https://leetcode.com/problems/serialize-and-deserialize-binary-tree, topics: ['String', 'Tree', 'Depth-First Search', 'Breadth-First Search', 'Design', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 298: questionNo: 298, acRate: 53.64367605871194, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Binary Tree Longest Consecutive Sequence, slug: binary-tree-longest-consecutive-sequence, url: https://leetcode.com/problems/binary-tree-longest-consecutive-sequence, topics: ['Tree', 'Depth-First Search', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 299: questionNo: 299, acRate: 50.48340955402598, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Bulls and Cows, slug: bulls-and-cows, url: https://leetcode.com/problems/bulls-and-cows, topics: ['Hash Table', 'String', 'Counting'], hasSolution: True, hasVideoSolution: False, 300: questionNo: 300, acRate: 55.904704251354154, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Longest Increasing Subsequence, slug: longest-increasing-subsequence, url: https://leetcode.com/problems/longest-increasing-subsequence, topics: ['Array', 'Binary Search', 'Dynamic Programming'], hasSolution: True, hasVideoSolution: False, 301: questionNo: 301, acRate: 48.425325571890916, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Remove Invalid Parentheses, slug: remove-invalid-parentheses, url: https://leetcode.com/problems/remove-invalid-parentheses, topics: ['String', 'Backtracking', 'Breadth-First Search'], hasSolution: True, hasVideoSolution: False, 302: questionNo: 302, acRate: 59.02489869533647, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Smallest Rectangle Enclosing Black Pixels, slug: smallest-rectangle-enclosing-black-pixels, url: https://leetcode.com/problems/smallest-rectangle-enclosing-black-pixels, topics: ['Array', 'Binary Search', 'Depth-First Search', 'Breadth-First Search', 'Matrix'], hasSolution: True, hasVideoSolution: False, 303: questionNo: 303, acRate: 64.19432892337194, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Range Sum Query - Immutable, slug: range-sum-query-immutable, url: https://leetcode.com/problems/range-sum-query-immutable, topics: ['Array', 'Design', 'Prefix Sum'], hasSolution: True, hasVideoSolution: True, 304: questionNo: 304, acRate: 54.987986847833895, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Range Sum Query 2D - Immutable, slug: range-sum-query-2d-immutable, url: https://leetcode.com/problems/range-sum-query-2d-immutable, topics: ['Array', 'Design', 'Matrix', 'Prefix Sum'], hasSolution: True, hasVideoSolution: True, 305: questionNo: 305, acRate: 39.89658743959262, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Number of Islands II, slug: number-of-islands-ii, url: https://leetcode.com/problems/number-of-islands-ii, topics: ['Array', 'Hash Table', 'Union Find'], hasSolution: True, hasVideoSolution: False, 306: questionNo: 306, acRate: 31.85299356076175, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Additive Number, slug: additive-number, url: https://leetcode.com/problems/additive-number, topics: ['String', 'Backtracking'], hasSolution: False, hasVideoSolution: False, 307: questionNo: 307, acRate: 41.158835794805405, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Range Sum Query - Mutable, slug: range-sum-query-mutable, url: https://leetcode.com/problems/range-sum-query-mutable, topics: ['Array', 'Design', 'Binary Indexed Tree', 'Segment Tree'], hasSolution: True, hasVideoSolution: False, 308: questionNo: 308, acRate: 44.18788047270809, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Range Sum Query 2D - Mutable, slug: range-sum-query-2d-mutable, url: https://leetcode.com/problems/range-sum-query-2d-mutable, topics: ['Array', 'Design', 'Binary Indexed Tree', 'Segment Tree', 'Matrix'], hasSolution: False, hasVideoSolution: False, 309: questionNo: 309, acRate: 58.730289734980914, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Best Time to Buy and Sell Stock with Cooldown, slug: best-time-to-buy-and-sell-stock-with-cooldown, url: https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-cooldown, topics: ['Array', 'Dynamic Programming'], hasSolution: True, hasVideoSolution: False, 310: questionNo: 310, acRate: 41.81957479829937, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Height Trees, slug: minimum-height-trees, url: https://leetcode.com/problems/minimum-height-trees, topics: ['Depth-First Search', 'Breadth-First Search', 'Graph', 'Topological Sort'], hasSolution: True, hasVideoSolution: False, 311: questionNo: 311, acRate: 68.18891408308434, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Sparse Matrix Multiplication, slug: sparse-matrix-multiplication, url: https://leetcode.com/problems/sparse-matrix-multiplication, topics: ['Array', 'Hash Table', 'Matrix'], hasSolution: True, hasVideoSolution: False, 312: questionNo: 312, acRate: 59.41117413182083, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Burst Balloons, slug: burst-balloons, url: https://leetcode.com/problems/burst-balloons, topics: ['Array', 'Dynamic Programming'], hasSolution: True, hasVideoSolution: False, 313: questionNo: 313, acRate: 45.30211113807328, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Super Ugly Number, slug: super-ugly-number, url: https://leetcode.com/problems/super-ugly-number, topics: ['Array', 'Math', 'Dynamic Programming'], hasSolution: False, hasVideoSolution: False, 314: questionNo: 314, acRate: 54.828784691940704, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Binary Tree Vertical Order Traversal, slug: binary-tree-vertical-order-traversal, url: https://leetcode.com/problems/binary-tree-vertical-order-traversal, topics: ['Hash Table', 'Tree', 'Depth-First Search', 'Breadth-First Search', 'Sorting', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 315: questionNo: 315, acRate: 42.525181150445476, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Count of Smaller Numbers After Self, slug: count-of-smaller-numbers-after-self, url: https://leetcode.com/problems/count-of-smaller-numbers-after-self, topics: ['Array', 'Binary Search', 'Divide and Conquer', 'Binary Indexed Tree', 'Segment Tree', 'Merge Sort', 'Ordered Set'], hasSolution: True, hasVideoSolution: False, 316: questionNo: 316, acRate: 49.92148955590971, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Remove Duplicate Letters, slug: remove-duplicate-letters, url: https://leetcode.com/problems/remove-duplicate-letters, topics: ['String', 'Stack', 'Greedy', 'Monotonic Stack'], hasSolution: True, hasVideoSolution: False, 317: questionNo: 317, acRate: 43.38894386426739, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Shortest Distance from All Buildings, slug: shortest-distance-from-all-buildings, url: https://leetcode.com/problems/shortest-distance-from-all-buildings, topics: ['Array', 'Breadth-First Search', 'Matrix'], hasSolution: True, hasVideoSolution: False, 318: questionNo: 318, acRate: 60.07505726327989, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum Product of Word Lengths, slug: maximum-product-of-word-lengths, url: https://leetcode.com/problems/maximum-product-of-word-lengths, topics: ['Array', 'String', 'Bit Manipulation'], hasSolution: True, hasVideoSolution: False, 319: questionNo: 319, acRate: 52.94606769707578, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Bulb Switcher, slug: bulb-switcher, url: https://leetcode.com/problems/bulb-switcher, topics: ['Math', 'Brainteaser'], hasSolution: True, hasVideoSolution: False, 320: questionNo: 320, acRate: 58.56511500921439, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Generalized Abbreviation, slug: generalized-abbreviation, url: https://leetcode.com/problems/generalized-abbreviation, topics: ['String', 'Backtracking', 'Bit Manipulation'], hasSolution: True, hasVideoSolution: False, 321: questionNo: 321, acRate: 30.48478579517322, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Create Maximum Number, slug: create-maximum-number, url: https://leetcode.com/problems/create-maximum-number, topics: ['Array', 'Two Pointers', 'Stack', 'Greedy', 'Monotonic Stack'], hasSolution: False, hasVideoSolution: False, 322: questionNo: 322, acRate: 44.43966236863152, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Coin Change, slug: coin-change, url: https://leetcode.com/problems/coin-change, topics: ['Array', 'Dynamic Programming', 'Breadth-First Search'], hasSolution: True, hasVideoSolution: True, 323: questionNo: 323, acRate: 63.066947383860395, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Number of Connected Components in an Undirected Graph, slug: number-of-connected-components-in-an-undirected-graph, url: https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph, topics: ['Depth-First Search', 'Breadth-First Search', 'Union Find', 'Graph'], hasSolution: True, hasVideoSolution: True, 324: questionNo: 324, acRate: 34.573688961558766, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Wiggle Sort II, slug: wiggle-sort-ii, url: https://leetcode.com/problems/wiggle-sort-ii, topics: ['Array', 'Divide and Conquer', 'Greedy', 'Sorting', 'Quickselect'], hasSolution: False, hasVideoSolution: False, 325: questionNo: 325, acRate: 49.568440238642744, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Maximum Size Subarray Sum Equals k, slug: maximum-size-subarray-sum-equals-k, url: https://leetcode.com/problems/maximum-size-subarray-sum-equals-k, topics: ['Array', 'Hash Table', 'Prefix Sum'], hasSolution: True, hasVideoSolution: False, 326: questionNo: 326, acRate: 46.83626282480997, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Power of Three, slug: power-of-three, url: https://leetcode.com/problems/power-of-three, topics: ['Math', 'Recursion'], hasSolution: True, hasVideoSolution: False, 327: questionNo: 327, acRate: 36.002159461598644, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Count of Range Sum, slug: count-of-range-sum, url: https://leetcode.com/problems/count-of-range-sum, topics: ['Array', 'Binary Search', 'Divide and Conquer', 'Binary Indexed Tree', 'Segment Tree', 'Merge Sort', 'Ordered Set'], hasSolution: False, hasVideoSolution: False, 328: questionNo: 328, acRate: 61.506614862353125, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Odd Even Linked List, slug: odd-even-linked-list, url: https://leetcode.com/problems/odd-even-linked-list, topics: ['Linked List'], hasSolution: True, hasVideoSolution: False, 329: questionNo: 329, acRate: 53.8837201867127, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Longest Increasing Path in a Matrix, slug: longest-increasing-path-in-a-matrix, url: https://leetcode.com/problems/longest-increasing-path-in-a-matrix, topics: ['Array', 'Dynamic Programming', 'Depth-First Search', 'Breadth-First Search', 'Graph', 'Topological Sort', 'Memoization', 'Matrix'], hasSolution: True, hasVideoSolution: False, 330: questionNo: 330, acRate: 53.11782560613649, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Patching Array, slug: patching-array, url: https://leetcode.com/problems/patching-array, topics: ['Array', 'Greedy'], hasSolution: True, hasVideoSolution: False, 331: questionNo: 331, acRate: 45.41015254130008, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Verify Preorder Serialization of a Binary Tree, slug: verify-preorder-serialization-of-a-binary-tree, url: https://leetcode.com/problems/verify-preorder-serialization-of-a-binary-tree, topics: ['String', 'Stack', 'Tree', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 332: questionNo: 332, acRate: 43.2547241506596, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Reconstruct Itinerary, slug: reconstruct-itinerary, url: https://leetcode.com/problems/reconstruct-itinerary, topics: ['Depth-First Search', 'Graph', 'Eulerian Circuit'], hasSolution: True, hasVideoSolution: False, 333: questionNo: 333, acRate: 44.10631849666547, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Largest BST Subtree, slug: largest-bst-subtree, url: https://leetcode.com/problems/largest-bst-subtree, topics: ['Dynamic Programming', 'Tree', 'Depth-First Search', 'Binary Search Tree', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 334: questionNo: 334, acRate: 39.568234980837715, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Increasing Triplet Subsequence, slug: increasing-triplet-subsequence, url: https://leetcode.com/problems/increasing-triplet-subsequence, topics: ['Array', 'Greedy'], hasSolution: True, hasVideoSolution: False, 335: questionNo: 335, acRate: 30.72123197789114, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Self Crossing, slug: self-crossing, url: https://leetcode.com/problems/self-crossing, topics: ['Array', 'Math', 'Geometry'], hasSolution: False, hasVideoSolution: False, 336: questionNo: 336, acRate: 35.456729340859894, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Palindrome Pairs, slug: palindrome-pairs, url: https://leetcode.com/problems/palindrome-pairs, topics: ['Array', 'Hash Table', 'String', 'Trie'], hasSolution: True, hasVideoSolution: False, 337: questionNo: 337, acRate: 54.347302454516466, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: House Robber III, slug: house-robber-iii, url: https://leetcode.com/problems/house-robber-iii, topics: ['Dynamic Programming', 'Tree', 'Depth-First Search', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 338: questionNo: 338, acRate: 78.61116184733153, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Counting Bits, slug: counting-bits, url: https://leetcode.com/problems/counting-bits, topics: ['Dynamic Programming', 'Bit Manipulation'], hasSolution: True, hasVideoSolution: False, 339: questionNo: 339, acRate: 84.0099270123312, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Nested List Weight Sum, slug: nested-list-weight-sum, url: https://leetcode.com/problems/nested-list-weight-sum, topics: ['Depth-First Search', 'Breadth-First Search'], hasSolution: True, hasVideoSolution: True, 340: questionNo: 340, acRate: 48.936902020494365, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Longest Substring with At Most K Distinct Characters, slug: longest-substring-with-at-most-k-distinct-characters, url: https://leetcode.com/problems/longest-substring-with-at-most-k-distinct-characters, topics: ['Hash Table', 'String', 'Sliding Window'], hasSolution: True, hasVideoSolution: True, 341: questionNo: 341, acRate: 64.64651173303048, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Flatten Nested List Iterator, slug: flatten-nested-list-iterator, url: https://leetcode.com/problems/flatten-nested-list-iterator, topics: ['Stack', 'Tree', 'Depth-First Search', 'Design', 'Queue', 'Iterator'], hasSolution: True, hasVideoSolution: False, 342: questionNo: 342, acRate: 48.23110222222846, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Power of Four, slug: power-of-four, url: https://leetcode.com/problems/power-of-four, topics: ['Math', 'Bit Manipulation', 'Recursion'], hasSolution: True, hasVideoSolution: False, 343: questionNo: 343, acRate: 60.49592318020157, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Integer Break, slug: integer-break, url: https://leetcode.com/problems/integer-break, topics: ['Math', 'Dynamic Programming'], hasSolution: True, hasVideoSolution: False, 344: questionNo: 344, acRate: 78.81288845638394, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Reverse String, slug: reverse-string, url: https://leetcode.com/problems/reverse-string, topics: ['Two Pointers', 'String'], hasSolution: True, hasVideoSolution: True, 345: questionNo: 345, acRate: 53.76025477632703, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Reverse Vowels of a String, slug: reverse-vowels-of-a-string, url: https://leetcode.com/problems/reverse-vowels-of-a-string, topics: ['Two Pointers', 'String'], hasSolution: True, hasVideoSolution: True, 346: questionNo: 346, acRate: 78.66725079034302, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Moving Average from Data Stream, slug: moving-average-from-data-stream, url: https://leetcode.com/problems/moving-average-from-data-stream, topics: ['Array', 'Design', 'Queue', 'Data Stream'], hasSolution: True, hasVideoSolution: True, 347: questionNo: 347, acRate: 63.03446913949089, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Top K Frequent Elements, slug: top-k-frequent-elements, url: https://leetcode.com/problems/top-k-frequent-elements, topics: ['Array', 'Hash Table', 'Divide and Conquer', 'Sorting', 'Heap (Priority Queue)', 'Bucket Sort', 'Counting', 'Quickselect'], hasSolution: True, hasVideoSolution: True, 348: questionNo: 348, acRate: 58.14613273801219, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Design Tic-Tac-Toe, slug: design-tic-tac-toe, url: https://leetcode.com/problems/design-tic-tac-toe, topics: ['Array', 'Hash Table', 'Design', 'Matrix', 'Simulation'], hasSolution: True, hasVideoSolution: False, 349: questionNo: 349, acRate: 74.90253862270406, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Intersection of Two Arrays, slug: intersection-of-two-arrays, url: https://leetcode.com/problems/intersection-of-two-arrays, topics: ['Array', 'Hash Table', 'Two Pointers', 'Binary Search', 'Sorting'], hasSolution: True, hasVideoSolution: False, 350: questionNo: 350, acRate: 58.56977267367272, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Intersection of Two Arrays II, slug: intersection-of-two-arrays-ii, url: https://leetcode.com/problems/intersection-of-two-arrays-ii, topics: ['Array', 'Hash Table', 'Two Pointers', 'Binary Search', 'Sorting'], hasSolution: True, hasVideoSolution: False, 351: questionNo: 351, acRate: 51.914784430838964, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Android Unlock Patterns, slug: android-unlock-patterns, url: https://leetcode.com/problems/android-unlock-patterns, topics: ['Dynamic Programming', 'Backtracking', 'Bit Manipulation', 'Bitmask'], hasSolution: False, hasVideoSolution: False, 352: questionNo: 352, acRate: 60.11326684271404, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Data Stream as Disjoint Intervals, slug: data-stream-as-disjoint-intervals, url: https://leetcode.com/problems/data-stream-as-disjoint-intervals, topics: ['Binary Search', 'Design', 'Ordered Set'], hasSolution: True, hasVideoSolution: False, 353: questionNo: 353, acRate: 38.8274321243899, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Design Snake Game, slug: design-snake-game, url: https://leetcode.com/problems/design-snake-game, topics: ['Array', 'Hash Table', 'Design', 'Queue', 'Simulation'], hasSolution: True, hasVideoSolution: False, 354: questionNo: 354, acRate: 37.07938430011876, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Russian Doll Envelopes, slug: russian-doll-envelopes, url: https://leetcode.com/problems/russian-doll-envelopes, topics: ['Array', 'Binary Search', 'Dynamic Programming', 'Sorting'], hasSolution: True, hasVideoSolution: False, 355: questionNo: 355, acRate: 40.13852298442936, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Design Twitter, slug: design-twitter, url: https://leetcode.com/problems/design-twitter, topics: ['Hash Table', 'Linked List', 'Design', 'Heap (Priority Queue)'], hasSolution: False, hasVideoSolution: False, 356: questionNo: 356, acRate: 35.664744355538744, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Line Reflection, slug: line-reflection, url: https://leetcode.com/problems/line-reflection, topics: ['Array', 'Hash Table', 'Math'], hasSolution: False, hasVideoSolution: False, 357: questionNo: 357, acRate: 53.22746341809651, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Count Numbers with Unique Digits, slug: count-numbers-with-unique-digits, url: https://leetcode.com/problems/count-numbers-with-unique-digits, topics: ['Math', 'Dynamic Programming', 'Backtracking'], hasSolution: False, hasVideoSolution: False, 358: questionNo: 358, acRate: 38.90900685723091, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Rearrange String k Distance Apart, slug: rearrange-string-k-distance-apart, url: https://leetcode.com/problems/rearrange-string-k-distance-apart, topics: ['Hash Table', 'String', 'Greedy', 'Sorting', 'Heap (Priority Queue)', 'Counting'], hasSolution: True, hasVideoSolution: False, 359: questionNo: 359, acRate: 76.01774366803008, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Logger Rate Limiter, slug: logger-rate-limiter, url: https://leetcode.com/problems/logger-rate-limiter, topics: ['Hash Table', 'Design', 'Data Stream'], hasSolution: True, hasVideoSolution: True, 360: questionNo: 360, acRate: 55.95039714428307, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Sort Transformed Array, slug: sort-transformed-array, url: https://leetcode.com/problems/sort-transformed-array, topics: ['Array', 'Math', 'Two Pointers', 'Sorting'], hasSolution: True, hasVideoSolution: False, 361: questionNo: 361, acRate: 51.83067416766578, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Bomb Enemy, slug: bomb-enemy, url: https://leetcode.com/problems/bomb-enemy, topics: ['Array', 'Dynamic Programming', 'Matrix'], hasSolution: True, hasVideoSolution: False, 362: questionNo: 362, acRate: 68.76981090069155, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Design Hit Counter, slug: design-hit-counter, url: https://leetcode.com/problems/design-hit-counter, topics: ['Array', 'Binary Search', 'Design', 'Queue', 'Data Stream'], hasSolution: True, hasVideoSolution: False, 363: questionNo: 363, acRate: 44.216564376506874, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Max Sum of Rectangle No Larger Than K, slug: max-sum-of-rectangle-no-larger-than-k, url: https://leetcode.com/problems/max-sum-of-rectangle-no-larger-than-k, topics: ['Array', 'Binary Search', 'Matrix', 'Prefix Sum', 'Ordered Set'], hasSolution: True, hasVideoSolution: False, 364: questionNo: 364, acRate: 64.89536257430571, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Nested List Weight Sum II, slug: nested-list-weight-sum-ii, url: https://leetcode.com/problems/nested-list-weight-sum-ii, topics: ['Stack', 'Depth-First Search', 'Breadth-First Search'], hasSolution: True, hasVideoSolution: False, 365: questionNo: 365, acRate: 41.16209137646717, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Water and Jug Problem, slug: water-and-jug-problem, url: https://leetcode.com/problems/water-and-jug-problem, topics: ['Math', 'Depth-First Search', 'Breadth-First Search'], hasSolution: False, hasVideoSolution: False, 366: questionNo: 366, acRate: 80.66493377122667, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Find Leaves of Binary Tree, slug: find-leaves-of-binary-tree, url: https://leetcode.com/problems/find-leaves-of-binary-tree, topics: ['Tree', 'Depth-First Search', 'Binary Tree'], hasSolution: True, hasVideoSolution: True, 367: questionNo: 367, acRate: 43.79185908562922, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Valid Perfect Square, slug: valid-perfect-square, url: https://leetcode.com/problems/valid-perfect-square, topics: ['Math', 'Binary Search'], hasSolution: True, hasVideoSolution: False, 368: questionNo: 368, acRate: 45.51153325904695, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Largest Divisible Subset, slug: largest-divisible-subset, url: https://leetcode.com/problems/largest-divisible-subset, topics: ['Array', 'Math', 'Dynamic Programming', 'Sorting'], hasSolution: True, hasVideoSolution: False, 369: questionNo: 369, acRate: 61.074023614895545, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Plus One Linked List, slug: plus-one-linked-list, url: https://leetcode.com/problems/plus-one-linked-list, topics: ['Linked List', 'Math'], hasSolution: True, hasVideoSolution: True, 370: questionNo: 370, acRate: 71.71919835855813, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Range Addition, slug: range-addition, url: https://leetcode.com/problems/range-addition, topics: ['Array', 'Prefix Sum'], hasSolution: True, hasVideoSolution: False, 371: questionNo: 371, acRate: 52.24218668339083, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Sum of Two Integers, slug: sum-of-two-integers, url: https://leetcode.com/problems/sum-of-two-integers, topics: ['Math', 'Bit Manipulation'], hasSolution: True, hasVideoSolution: False, 372: questionNo: 372, acRate: 35.086784662731354, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Super Pow, slug: super-pow, url: https://leetcode.com/problems/super-pow, topics: ['Math', 'Divide and Conquer'], hasSolution: False, hasVideoSolution: False, 373: questionNo: 373, acRate: 40.047397670609556, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Find K Pairs with Smallest Sums, slug: find-k-pairs-with-smallest-sums, url: https://leetcode.com/problems/find-k-pairs-with-smallest-sums, topics: ['Array', 'Heap (Priority Queue)'], hasSolution: True, hasVideoSolution: False, 374: questionNo: 374, acRate: 53.91713752118746, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Guess Number Higher or Lower, slug: guess-number-higher-or-lower, url: https://leetcode.com/problems/guess-number-higher-or-lower, topics: ['Binary Search', 'Interactive'], hasSolution: True, hasVideoSolution: True, 375: questionNo: 375, acRate: 49.515938148730186, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Guess Number Higher or Lower II, slug: guess-number-higher-or-lower-ii, url: https://leetcode.com/problems/guess-number-higher-or-lower-ii, topics: ['Math', 'Dynamic Programming', 'Game Theory'], hasSolution: True, hasVideoSolution: False, 376: questionNo: 376, acRate: 48.555192371711634, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Wiggle Subsequence, slug: wiggle-subsequence, url: https://leetcode.com/problems/wiggle-subsequence, topics: ['Array', 'Dynamic Programming', 'Greedy'], hasSolution: True, hasVideoSolution: False, 377: questionNo: 377, acRate: 54.231036035887946, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Combination Sum IV, slug: combination-sum-iv, url: https://leetcode.com/problems/combination-sum-iv, topics: ['Array', 'Dynamic Programming'], hasSolution: True, hasVideoSolution: False, 378: questionNo: 378, acRate: 62.63675162148885, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Kth Smallest Element in a Sorted Matrix, slug: kth-smallest-element-in-a-sorted-matrix, url: https://leetcode.com/problems/kth-smallest-element-in-a-sorted-matrix, topics: ['Array', 'Binary Search', 'Sorting', 'Heap (Priority Queue)', 'Matrix'], hasSolution: True, hasVideoSolution: False, 379: questionNo: 379, acRate: 51.801584835301426, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Design Phone Directory, slug: design-phone-directory, url: https://leetcode.com/problems/design-phone-directory, topics: ['Array', 'Hash Table', 'Linked List', 'Design', 'Queue'], hasSolution: True, hasVideoSolution: False, 380: questionNo: 380, acRate: 54.558285655319494, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Insert Delete GetRandom O(1), slug: insert-delete-getrandom-o1, url: https://leetcode.com/problems/insert-delete-getrandom-o1, topics: ['Array', 'Hash Table', 'Math', 'Design', 'Randomized'], hasSolution: True, hasVideoSolution: False, 381: questionNo: 381, acRate: 35.53640290083142, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Insert Delete GetRandom O(1) - Duplicates allowed, slug: insert-delete-getrandom-o1-duplicates-allowed, url: https://leetcode.com/problems/insert-delete-getrandom-o1-duplicates-allowed, topics: ['Array', 'Hash Table', 'Math', 'Design', 'Randomized'], hasSolution: True, hasVideoSolution: False, 382: questionNo: 382, acRate: 63.31351202529854, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Linked List Random Node, slug: linked-list-random-node, url: https://leetcode.com/problems/linked-list-random-node, topics: ['Linked List', 'Math', 'Reservoir Sampling', 'Randomized'], hasSolution: True, hasVideoSolution: False, 383: questionNo: 383, acRate: 62.08961544848094, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Ransom Note, slug: ransom-note, url: https://leetcode.com/problems/ransom-note, topics: ['Hash Table', 'String', 'Counting'], hasSolution: True, hasVideoSolution: True, 384: questionNo: 384, acRate: 58.44632695625306, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Shuffle an Array, slug: shuffle-an-array, url: https://leetcode.com/problems/shuffle-an-array, topics: ['Array', 'Math', 'Randomized'], hasSolution: True, hasVideoSolution: False, 385: questionNo: 385, acRate: 38.50967383834646, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Mini Parser, slug: mini-parser, url: https://leetcode.com/problems/mini-parser, topics: ['String', 'Stack', 'Depth-First Search'], hasSolution: False, hasVideoSolution: False, 386: questionNo: 386, acRate: 64.40970532645608, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Lexicographical Numbers, slug: lexicographical-numbers, url: https://leetcode.com/problems/lexicographical-numbers, topics: ['Depth-First Search', 'Trie'], hasSolution: False, hasVideoSolution: False, 387: questionNo: 387, acRate: 62.37557968505592, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: First Unique Character in a String, slug: first-unique-character-in-a-string, url: https://leetcode.com/problems/first-unique-character-in-a-string, topics: ['Hash Table', 'String', 'Queue', 'Counting'], hasSolution: True, hasVideoSolution: True, 388: questionNo: 388, acRate: 47.661340927740504, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Longest Absolute File Path, slug: longest-absolute-file-path, url: https://leetcode.com/problems/longest-absolute-file-path, topics: ['String', 'Stack', 'Depth-First Search'], hasSolution: False, hasVideoSolution: False, 389: questionNo: 389, acRate: 59.62283430702534, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Find the Difference, slug: find-the-difference, url: https://leetcode.com/problems/find-the-difference, topics: ['Hash Table', 'String', 'Bit Manipulation', 'Sorting'], hasSolution: True, hasVideoSolution: False, 390: questionNo: 390, acRate: 45.87527118281541, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Elimination Game, slug: elimination-game, url: https://leetcode.com/problems/elimination-game, topics: ['Math', 'Recursion'], hasSolution: False, hasVideoSolution: False, 391: questionNo: 391, acRate: 33.90756712530307, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Perfect Rectangle, slug: perfect-rectangle, url: https://leetcode.com/problems/perfect-rectangle, topics: ['Array', 'Line Sweep'], hasSolution: False, hasVideoSolution: False, 392: questionNo: 392, acRate: 48.10256658282343, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Is Subsequence, slug: is-subsequence, url: https://leetcode.com/problems/is-subsequence, topics: ['Two Pointers', 'String', 'Dynamic Programming'], hasSolution: True, hasVideoSolution: False, 393: questionNo: 393, acRate: 45.196266564128976, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: UTF-8 Validation, slug: utf-8-validation, url: https://leetcode.com/problems/utf-8-validation, topics: ['Array', 'Bit Manipulation'], hasSolution: True, hasVideoSolution: False, 394: questionNo: 394, acRate: 59.5245531321394, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Decode String, slug: decode-string, url: https://leetcode.com/problems/decode-string, topics: ['String', 'Stack', 'Recursion'], hasSolution: True, hasVideoSolution: False, 395: questionNo: 395, acRate: 45.01828225287573, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Longest Substring with At Least K Repeating Characters, slug: longest-substring-with-at-least-k-repeating-characters, url: https://leetcode.com/problems/longest-substring-with-at-least-k-repeating-characters, topics: ['Hash Table', 'String', 'Divide and Conquer', 'Sliding Window'], hasSolution: True, hasVideoSolution: False, 396: questionNo: 396, acRate: 42.76993402128314, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Rotate Function, slug: rotate-function, url: https://leetcode.com/problems/rotate-function, topics: ['Array', 'Math', 'Dynamic Programming'], hasSolution: False, hasVideoSolution: False, 397: questionNo: 397, acRate: 35.97363219968213, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Integer Replacement, slug: integer-replacement, url: https://leetcode.com/problems/integer-replacement, topics: ['Dynamic Programming', 'Greedy', 'Bit Manipulation', 'Memoization'], hasSolution: False, hasVideoSolution: False, 398: questionNo: 398, acRate: 63.6661866116373, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Random Pick Index, slug: random-pick-index, url: https://leetcode.com/problems/random-pick-index, topics: ['Hash Table', 'Math', 'Reservoir Sampling', 'Randomized'], hasSolution: False, hasVideoSolution: False, 399: questionNo: 399, acRate: 61.974558572242266, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Evaluate Division, slug: evaluate-division, url: https://leetcode.com/problems/evaluate-division, topics: ['Array', 'String', 'Depth-First Search', 'Breadth-First Search', 'Union Find', 'Graph', 'Shortest Path'], hasSolution: True, hasVideoSolution: False, 400: questionNo: 400, acRate: 34.998163141310954, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Nth Digit, slug: nth-digit, url: https://leetcode.com/problems/nth-digit, topics: ['Math', 'Binary Search'], hasSolution: False, hasVideoSolution: False, 401: questionNo: 401, acRate: 54.83753668735877, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Binary Watch, slug: binary-watch, url: https://leetcode.com/problems/binary-watch, topics: ['Backtracking', 'Bit Manipulation'], hasSolution: False, hasVideoSolution: False, 402: questionNo: 402, acRate: 33.7196676678407, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Remove K Digits, slug: remove-k-digits, url: https://leetcode.com/problems/remove-k-digits, topics: ['String', 'Stack', 'Greedy', 'Monotonic Stack'], hasSolution: True, hasVideoSolution: False, 403: questionNo: 403, acRate: 46.15740945737438, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Frog Jump, slug: frog-jump, url: https://leetcode.com/problems/frog-jump, topics: ['Array', 'Dynamic Programming'], hasSolution: True, hasVideoSolution: False, 404: questionNo: 404, acRate: 60.80401769241459, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Sum of Left Leaves, slug: sum-of-left-leaves, url: https://leetcode.com/problems/sum-of-left-leaves, topics: ['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 405: questionNo: 405, acRate: 48.96473486321795, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Convert a Number to Hexadecimal, slug: convert-a-number-to-hexadecimal, url: https://leetcode.com/problems/convert-a-number-to-hexadecimal, topics: ['Math', 'Bit Manipulation'], hasSolution: False, hasVideoSolution: False, 406: questionNo: 406, acRate: 73.6231974740571, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Queue Reconstruction by Height, slug: queue-reconstruction-by-height, url: https://leetcode.com/problems/queue-reconstruction-by-height, topics: ['Array', 'Binary Indexed Tree', 'Segment Tree', 'Sorting'], hasSolution: True, hasVideoSolution: False, 407: questionNo: 407, acRate: 48.10762657164347, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Trapping Rain Water II, slug: trapping-rain-water-ii, url: https://leetcode.com/problems/trapping-rain-water-ii, topics: ['Array', 'Breadth-First Search', 'Heap (Priority Queue)', 'Matrix'], hasSolution: False, hasVideoSolution: False, 408: questionNo: 408, acRate: 35.99421392408454, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Valid Word Abbreviation, slug: valid-word-abbreviation, url: https://leetcode.com/problems/valid-word-abbreviation, topics: ['Two Pointers', 'String'], hasSolution: False, hasVideoSolution: False, 409: questionNo: 409, acRate: 55.351775086024915, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Longest Palindrome, slug: longest-palindrome, url: https://leetcode.com/problems/longest-palindrome, topics: ['Hash Table', 'String', 'Greedy'], hasSolution: True, hasVideoSolution: False, 410: questionNo: 410, acRate: 55.93445223080501, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Split Array Largest Sum, slug: split-array-largest-sum, url: https://leetcode.com/problems/split-array-largest-sum, topics: ['Array', 'Binary Search', 'Dynamic Programming', 'Greedy', 'Prefix Sum'], hasSolution: True, hasVideoSolution: False, 411: questionNo: 411, acRate: 39.79061818769007, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Minimum Unique Word Abbreviation, slug: minimum-unique-word-abbreviation, url: https://leetcode.com/problems/minimum-unique-word-abbreviation, topics: ['String', 'Backtracking', 'Bit Manipulation'], hasSolution: False, hasVideoSolution: False, 412: questionNo: 412, acRate: 72.62675770858858, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Fizz Buzz, slug: fizz-buzz, url: https://leetcode.com/problems/fizz-buzz, topics: ['Math', 'String', 'Simulation'], hasSolution: True, hasVideoSolution: True, 413: questionNo: 413, acRate: 65.03718713302172, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Arithmetic Slices, slug: arithmetic-slices, url: https://leetcode.com/problems/arithmetic-slices, topics: ['Array', 'Dynamic Programming'], hasSolution: True, hasVideoSolution: False, 414: questionNo: 414, acRate: 35.29155034548969, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Third Maximum Number, slug: third-maximum-number, url: https://leetcode.com/problems/third-maximum-number, topics: ['Array', 'Sorting'], hasSolution: True, hasVideoSolution: False, 415: questionNo: 415, acRate: 51.67478302436401, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Add Strings, slug: add-strings, url: https://leetcode.com/problems/add-strings, topics: ['Math', 'String', 'Simulation'], hasSolution: True, hasVideoSolution: False, 416: questionNo: 416, acRate: 46.54495981440754, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Partition Equal Subset Sum, slug: partition-equal-subset-sum, url: https://leetcode.com/problems/partition-equal-subset-sum, topics: ['Array', 'Dynamic Programming'], hasSolution: True, hasVideoSolution: True, 417: questionNo: 417, acRate: 55.6461531816022, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Pacific Atlantic Water Flow, slug: pacific-atlantic-water-flow, url: https://leetcode.com/problems/pacific-atlantic-water-flow, topics: ['Array', 'Depth-First Search', 'Breadth-First Search', 'Matrix'], hasSolution: True, hasVideoSolution: False, 418: questionNo: 418, acRate: 36.22002020810806, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Sentence Screen Fitting, slug: sentence-screen-fitting, url: https://leetcode.com/problems/sentence-screen-fitting, topics: ['Array', 'String', 'Dynamic Programming'], hasSolution: False, hasVideoSolution: False, 419: questionNo: 419, acRate: 75.51383195446351, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Battleships in a Board, slug: battleships-in-a-board, url: https://leetcode.com/problems/battleships-in-a-board, topics: ['Array', 'Depth-First Search', 'Matrix'], hasSolution: False, hasVideoSolution: False, 420: questionNo: 420, acRate: 13.886435290552607, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Strong Password Checker, slug: strong-password-checker, url: https://leetcode.com/problems/strong-password-checker, topics: ['String', 'Greedy', 'Heap (Priority Queue)'], hasSolution: False, hasVideoSolution: False, 421: questionNo: 421, acRate: 53.29400415789826, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum XOR of Two Numbers in an Array, slug: maximum-xor-of-two-numbers-in-an-array, url: https://leetcode.com/problems/maximum-xor-of-two-numbers-in-an-array, topics: ['Array', 'Hash Table', 'Bit Manipulation', 'Trie'], hasSolution: True, hasVideoSolution: False, 422: questionNo: 422, acRate: 41.28811298602958, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Valid Word Square, slug: valid-word-square, url: https://leetcode.com/problems/valid-word-square, topics: ['Array', 'Matrix'], hasSolution: True, hasVideoSolution: False, 423: questionNo: 423, acRate: 51.17048680969483, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Reconstruct Original Digits from English, slug: reconstruct-original-digits-from-english, url: https://leetcode.com/problems/reconstruct-original-digits-from-english, topics: ['Hash Table', 'Math', 'String'], hasSolution: True, hasVideoSolution: False, 424: questionNo: 424, acRate: 54.644702432271366, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Longest Repeating Character Replacement, slug: longest-repeating-character-replacement, url: https://leetcode.com/problems/longest-repeating-character-replacement, topics: ['Hash Table', 'String', 'Sliding Window'], hasSolution: True, hasVideoSolution: False, 425: questionNo: 425, acRate: 53.45666157949537, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Word Squares, slug: word-squares, url: https://leetcode.com/problems/word-squares, topics: ['Array', 'String', 'Backtracking', 'Trie'], hasSolution: True, hasVideoSolution: False, 426: questionNo: 426, acRate: 64.87080114687546, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Convert Binary Search Tree to Sorted Doubly Linked List, slug: convert-binary-search-tree-to-sorted-doubly-linked-list, url: https://leetcode.com/problems/convert-binary-search-tree-to-sorted-doubly-linked-list, topics: ['Linked List', 'Stack', 'Tree', 'Depth-First Search', 'Binary Search Tree', 'Binary Tree', 'Doubly-Linked List'], hasSolution: True, hasVideoSolution: False, 427: questionNo: 427, acRate: 75.6996759643149, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Construct Quad Tree, slug: construct-quad-tree, url: https://leetcode.com/problems/construct-quad-tree, topics: ['Array', 'Divide and Conquer', 'Tree', 'Matrix'], hasSolution: True, hasVideoSolution: False, 428: questionNo: 428, acRate: 67.43316958500345, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Serialize and Deserialize N-ary Tree, slug: serialize-and-deserialize-n-ary-tree, url: https://leetcode.com/problems/serialize-and-deserialize-n-ary-tree, topics: ['String', 'Tree', 'Depth-First Search', 'Breadth-First Search'], hasSolution: True, hasVideoSolution: False, 429: questionNo: 429, acRate: 70.89347823607895, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: N-ary Tree Level Order Traversal, slug: n-ary-tree-level-order-traversal, url: https://leetcode.com/problems/n-ary-tree-level-order-traversal, topics: ['Tree', 'Breadth-First Search'], hasSolution: True, hasVideoSolution: False, 430: questionNo: 430, acRate: 60.2729660122746, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Flatten a Multilevel Doubly Linked List, slug: flatten-a-multilevel-doubly-linked-list, url: https://leetcode.com/problems/flatten-a-multilevel-doubly-linked-list, topics: ['Linked List', 'Depth-First Search', 'Doubly-Linked List'], hasSolution: True, hasVideoSolution: False, 431: questionNo: 431, acRate: 79.58355965960529, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Encode N-ary Tree to Binary Tree, slug: encode-n-ary-tree-to-binary-tree, url: https://leetcode.com/problems/encode-n-ary-tree-to-binary-tree, topics: ['Tree', 'Depth-First Search', 'Breadth-First Search', 'Design', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 432: questionNo: 432, acRate: 36.963694909856514, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: All O`one Data Structure, slug: all-oone-data-structure, url: https://leetcode.com/problems/all-oone-data-structure, topics: ['Hash Table', 'Linked List', 'Design', 'Doubly-Linked List'], hasSolution: False, hasVideoSolution: False, 433: questionNo: 433, acRate: 54.10985418727687, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Genetic Mutation, slug: minimum-genetic-mutation, url: https://leetcode.com/problems/minimum-genetic-mutation, topics: ['Hash Table', 'String', 'Breadth-First Search'], hasSolution: True, hasVideoSolution: False, 434: questionNo: 434, acRate: 36.359109408666505, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Number of Segments in a String, slug: number-of-segments-in-a-string, url: https://leetcode.com/problems/number-of-segments-in-a-string, topics: ['String'], hasSolution: True, hasVideoSolution: False, 435: questionNo: 435, acRate: 53.73525125285894, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Non-overlapping Intervals, slug: non-overlapping-intervals, url: https://leetcode.com/problems/non-overlapping-intervals, topics: ['Array', 'Dynamic Programming', 'Greedy', 'Sorting'], hasSolution: True, hasVideoSolution: False, 436: questionNo: 436, acRate: 52.41221619019603, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Find Right Interval, slug: find-right-interval, url: https://leetcode.com/problems/find-right-interval, topics: ['Array', 'Binary Search', 'Sorting'], hasSolution: True, hasVideoSolution: False, 437: questionNo: 437, acRate: 46.163551002176376, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Path Sum III, slug: path-sum-iii, url: https://leetcode.com/problems/path-sum-iii, topics: ['Tree', 'Depth-First Search', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 438: questionNo: 438, acRate: 51.11354977732429, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Find All Anagrams in a String, slug: find-all-anagrams-in-a-string, url: https://leetcode.com/problems/find-all-anagrams-in-a-string, topics: ['Hash Table', 'String', 'Sliding Window'], hasSolution: True, hasVideoSolution: False, 439: questionNo: 439, acRate: 61.02283373440858, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Ternary Expression Parser, slug: ternary-expression-parser, url: https://leetcode.com/problems/ternary-expression-parser, topics: ['String', 'Stack', 'Recursion'], hasSolution: True, hasVideoSolution: False, 440: questionNo: 440, acRate: 32.51500123297805, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: K-th Smallest in Lexicographical Order, slug: k-th-smallest-in-lexicographical-order, url: https://leetcode.com/problems/k-th-smallest-in-lexicographical-order, topics: ['Trie'], hasSolution: False, hasVideoSolution: False, 441: questionNo: 441, acRate: 46.74002555875069, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Arranging Coins, slug: arranging-coins, url: https://leetcode.com/problems/arranging-coins, topics: ['Math', 'Binary Search'], hasSolution: True, hasVideoSolution: False, 442: questionNo: 442, acRate: 75.82300059044245, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Find All Duplicates in an Array, slug: find-all-duplicates-in-an-array, url: https://leetcode.com/problems/find-all-duplicates-in-an-array, topics: ['Array', 'Hash Table'], hasSolution: True, hasVideoSolution: False, 443: questionNo: 443, acRate: 55.20611220118295, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: String Compression, slug: string-compression, url: https://leetcode.com/problems/string-compression, topics: ['Two Pointers', 'String'], hasSolution: True, hasVideoSolution: False, 444: questionNo: 444, acRate: 28.400226918167636, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Sequence Reconstruction, slug: sequence-reconstruction, url: https://leetcode.com/problems/sequence-reconstruction, topics: ['Array', 'Graph', 'Topological Sort'], hasSolution: False, hasVideoSolution: False, 445: questionNo: 445, acRate: 61.268609268497585, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Add Two Numbers II, slug: add-two-numbers-ii, url: https://leetcode.com/problems/add-two-numbers-ii, topics: ['Linked List', 'Math', 'Stack'], hasSolution: True, hasVideoSolution: False, 446: questionNo: 446, acRate: 54.57559873736643, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Arithmetic Slices II - Subsequence, slug: arithmetic-slices-ii-subsequence, url: https://leetcode.com/problems/arithmetic-slices-ii-subsequence, topics: ['Array', 'Dynamic Programming'], hasSolution: True, hasVideoSolution: False, 447: questionNo: 447, acRate: 55.58723075320574, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Number of Boomerangs, slug: number-of-boomerangs, url: https://leetcode.com/problems/number-of-boomerangs, topics: ['Array', 'Hash Table', 'Math'], hasSolution: False, hasVideoSolution: False, 448: questionNo: 448, acRate: 61.18148882155653, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Find All Numbers Disappeared in an Array, slug: find-all-numbers-disappeared-in-an-array, url: https://leetcode.com/problems/find-all-numbers-disappeared-in-an-array, topics: ['Array', 'Hash Table'], hasSolution: True, hasVideoSolution: False, 449: questionNo: 449, acRate: 57.82925523020664, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Serialize and Deserialize BST, slug: serialize-and-deserialize-bst, url: https://leetcode.com/problems/serialize-and-deserialize-bst, topics: ['String', 'Tree', 'Depth-First Search', 'Breadth-First Search', 'Design', 'Binary Search Tree', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 450: questionNo: 450, acRate: 51.66440640338219, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Delete Node in a BST, slug: delete-node-in-a-bst, url: https://leetcode.com/problems/delete-node-in-a-bst, topics: ['Tree', 'Binary Search Tree', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 451: questionNo: 451, acRate: 72.80372324275088, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Sort Characters By Frequency, slug: sort-characters-by-frequency, url: https://leetcode.com/problems/sort-characters-by-frequency, topics: ['Hash Table', 'String', 'Sorting', 'Heap (Priority Queue)', 'Bucket Sort', 'Counting'], hasSolution: True, hasVideoSolution: False, 452: questionNo: 452, acRate: 59.16492300355587, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Number of Arrows to Burst Balloons, slug: minimum-number-of-arrows-to-burst-balloons, url: https://leetcode.com/problems/minimum-number-of-arrows-to-burst-balloons, topics: ['Array', 'Greedy', 'Sorting'], hasSolution: True, hasVideoSolution: False, 453: questionNo: 453, acRate: 56.88765087003612, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Moves to Equal Array Elements, slug: minimum-moves-to-equal-array-elements, url: https://leetcode.com/problems/minimum-moves-to-equal-array-elements, topics: ['Array', 'Math'], hasSolution: True, hasVideoSolution: False, 454: questionNo: 454, acRate: 57.319545436415375, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: 4Sum II, slug: 4sum-ii, url: https://leetcode.com/problems/4sum-ii, topics: ['Array', 'Hash Table'], hasSolution: True, hasVideoSolution: False, 455: questionNo: 455, acRate: 52.8405034795976, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Assign Cookies, slug: assign-cookies, url: https://leetcode.com/problems/assign-cookies, topics: ['Array', 'Two Pointers', 'Greedy', 'Sorting'], hasSolution: True, hasVideoSolution: False, 456: questionNo: 456, acRate: 33.777462737641606, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: 132 Pattern, slug: 132-pattern, url: https://leetcode.com/problems/132-pattern, topics: ['Array', 'Binary Search', 'Stack', 'Monotonic Stack', 'Ordered Set'], hasSolution: True, hasVideoSolution: True, 457: questionNo: 457, acRate: 34.32076972800955, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Circular Array Loop, slug: circular-array-loop, url: https://leetcode.com/problems/circular-array-loop, topics: ['Array', 'Hash Table', 'Two Pointers'], hasSolution: False, hasVideoSolution: False, 458: questionNo: 458, acRate: 59.58624448738913, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Poor Pigs, slug: poor-pigs, url: https://leetcode.com/problems/poor-pigs, topics: ['Math', 'Dynamic Programming', 'Combinatorics'], hasSolution: True, hasVideoSolution: False, 459: questionNo: 459, acRate: 46.1666269401719, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Repeated Substring Pattern, slug: repeated-substring-pattern, url: https://leetcode.com/problems/repeated-substring-pattern, topics: ['String', 'String Matching'], hasSolution: True, hasVideoSolution: False, 460: questionNo: 460, acRate: 44.585345833972795, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: LFU Cache, slug: lfu-cache, url: https://leetcode.com/problems/lfu-cache, topics: ['Hash Table', 'Linked List', 'Design', 'Doubly-Linked List'], hasSolution: True, hasVideoSolution: False, 461: questionNo: 461, acRate: 75.51334808680014, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Hamming Distance, slug: hamming-distance, url: https://leetcode.com/problems/hamming-distance, topics: ['Bit Manipulation'], hasSolution: True, hasVideoSolution: False, 462: questionNo: 462, acRate: 60.214051983119056, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Moves to Equal Array Elements II, slug: minimum-moves-to-equal-array-elements-ii, url: https://leetcode.com/problems/minimum-moves-to-equal-array-elements-ii, topics: ['Array', 'Math', 'Sorting'], hasSolution: True, hasVideoSolution: False, 463: questionNo: 463, acRate: 72.96176840691744, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Island Perimeter, slug: island-perimeter, url: https://leetcode.com/problems/island-perimeter, topics: ['Array', 'Depth-First Search', 'Breadth-First Search', 'Matrix'], hasSolution: True, hasVideoSolution: False, 464: questionNo: 464, acRate: 29.77778323882312, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Can I Win, slug: can-i-win, url: https://leetcode.com/problems/can-i-win, topics: ['Math', 'Dynamic Programming', 'Bit Manipulation', 'Memoization', 'Game Theory', 'Bitmask'], hasSolution: False, hasVideoSolution: False, 465: questionNo: 465, acRate: 49.61056730870435, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Optimal Account Balancing, slug: optimal-account-balancing, url: https://leetcode.com/problems/optimal-account-balancing, topics: ['Array', 'Dynamic Programming', 'Backtracking', 'Bit Manipulation', 'Bitmask'], hasSolution: True, hasVideoSolution: False, 466: questionNo: 466, acRate: 30.437800741500354, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Count The Repetitions, slug: count-the-repetitions, url: https://leetcode.com/problems/count-the-repetitions, topics: ['String', 'Dynamic Programming'], hasSolution: False, hasVideoSolution: False, 467: questionNo: 467, acRate: 39.94261446396294, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Unique Substrings in Wraparound String, slug: unique-substrings-in-wraparound-string, url: https://leetcode.com/problems/unique-substrings-in-wraparound-string, topics: ['String', 'Dynamic Programming'], hasSolution: False, hasVideoSolution: False, 468: questionNo: 468, acRate: 27.23689158478165, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Validate IP Address, slug: validate-ip-address, url: https://leetcode.com/problems/validate-ip-address, topics: ['String'], hasSolution: True, hasVideoSolution: False, 469: questionNo: 469, acRate: 39.5222067754445, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Convex Polygon, slug: convex-polygon, url: https://leetcode.com/problems/convex-polygon, topics: ['Array', 'Math', 'Geometry'], hasSolution: False, hasVideoSolution: False, 470: questionNo: 470, acRate: 45.80819470083906, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Implement Rand10() Using Rand7(), slug: implement-rand10-using-rand7, url: https://leetcode.com/problems/implement-rand10-using-rand7, topics: ['Math', 'Rejection Sampling', 'Randomized', 'Probability and Statistics'], hasSolution: True, hasVideoSolution: False, 471: questionNo: 471, acRate: 50.46946826198937, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Encode String with Shortest Length, slug: encode-string-with-shortest-length, url: https://leetcode.com/problems/encode-string-with-shortest-length, topics: ['String', 'Dynamic Programming'], hasSolution: False, hasVideoSolution: False, 472: questionNo: 472, acRate: 49.383462151936165, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Concatenated Words, slug: concatenated-words, url: https://leetcode.com/problems/concatenated-words, topics: ['Array', 'String', 'Dynamic Programming', 'Depth-First Search', 'Trie'], hasSolution: True, hasVideoSolution: False, 473: questionNo: 473, acRate: 40.31404383961212, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Matchsticks to Square, slug: matchsticks-to-square, url: https://leetcode.com/problems/matchsticks-to-square, topics: ['Array', 'Dynamic Programming', 'Backtracking', 'Bit Manipulation', 'Bitmask'], hasSolution: True, hasVideoSolution: False, 474: questionNo: 474, acRate: 47.78630696391172, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Ones and Zeroes, slug: ones-and-zeroes, url: https://leetcode.com/problems/ones-and-zeroes, topics: ['Array', 'String', 'Dynamic Programming'], hasSolution: True, hasVideoSolution: False, 475: questionNo: 475, acRate: 38.23474886490393, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Heaters, slug: heaters, url: https://leetcode.com/problems/heaters, topics: ['Array', 'Two Pointers', 'Binary Search', 'Sorting'], hasSolution: False, hasVideoSolution: False, 476: questionNo: 476, acRate: 67.68316744859034, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Number Complement, slug: number-complement, url: https://leetcode.com/problems/number-complement, topics: ['Bit Manipulation'], hasSolution: True, hasVideoSolution: False, 477: questionNo: 477, acRate: 52.84942356270537, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Total Hamming Distance, slug: total-hamming-distance, url: https://leetcode.com/problems/total-hamming-distance, topics: ['Array', 'Math', 'Bit Manipulation'], hasSolution: True, hasVideoSolution: False, 478: questionNo: 478, acRate: 39.97777096428024, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Generate Random Point in a Circle, slug: generate-random-point-in-a-circle, url: https://leetcode.com/problems/generate-random-point-in-a-circle, topics: ['Math', 'Geometry', 'Rejection Sampling', 'Randomized'], hasSolution: True, hasVideoSolution: False, 479: questionNo: 479, acRate: 33.53181537138095, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Largest Palindrome Product, slug: largest-palindrome-product, url: https://leetcode.com/problems/largest-palindrome-product, topics: ['Math', 'Enumeration'], hasSolution: False, hasVideoSolution: False, 480: questionNo: 480, acRate: 39.00548621553245, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Sliding Window Median, slug: sliding-window-median, url: https://leetcode.com/problems/sliding-window-median, topics: ['Array', 'Hash Table', 'Sliding Window', 'Heap (Priority Queue)'], hasSolution: True, hasVideoSolution: False, 481: questionNo: 481, acRate: 51.44489706646254, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Magical String, slug: magical-string, url: https://leetcode.com/problems/magical-string, topics: ['Two Pointers', 'String'], hasSolution: False, hasVideoSolution: False, 482: questionNo: 482, acRate: 43.945054339844326, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: License Key Formatting, slug: license-key-formatting, url: https://leetcode.com/problems/license-key-formatting, topics: ['String'], hasSolution: True, hasVideoSolution: False, 483: questionNo: 483, acRate: 41.11052850452926, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Smallest Good Base, slug: smallest-good-base, url: https://leetcode.com/problems/smallest-good-base, topics: ['Math', 'Binary Search'], hasSolution: False, hasVideoSolution: False, 484: questionNo: 484, acRate: 66.88893413417489, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Find Permutation, slug: find-permutation, url: https://leetcode.com/problems/find-permutation, topics: ['Array', 'String', 'Stack', 'Greedy'], hasSolution: True, hasVideoSolution: False, 485: questionNo: 485, acRate: 59.88360276339178, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Max Consecutive Ones, slug: max-consecutive-ones, url: https://leetcode.com/problems/max-consecutive-ones, topics: ['Array'], hasSolution: True, hasVideoSolution: False, 486: questionNo: 486, acRate: 55.429066918352454, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Predict the Winner, slug: predict-the-winner, url: https://leetcode.com/problems/predict-the-winner, topics: ['Array', 'Math', 'Dynamic Programming', 'Recursion', 'Game Theory'], hasSolution: True, hasVideoSolution: True, 487: questionNo: 487, acRate: 50.46947398501766, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Max Consecutive Ones II, slug: max-consecutive-ones-ii, url: https://leetcode.com/problems/max-consecutive-ones-ii, topics: ['Array', 'Dynamic Programming', 'Sliding Window'], hasSolution: True, hasVideoSolution: False, 488: questionNo: 488, acRate: 32.64221883173496, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Zuma Game, slug: zuma-game, url: https://leetcode.com/problems/zuma-game, topics: ['String', 'Dynamic Programming', 'Stack', 'Breadth-First Search', 'Memoization'], hasSolution: False, hasVideoSolution: False, 489: questionNo: 489, acRate: 76.82659283821444, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Robot Room Cleaner, slug: robot-room-cleaner, url: https://leetcode.com/problems/robot-room-cleaner, topics: ['Backtracking', 'Interactive'], hasSolution: True, hasVideoSolution: False, 490: questionNo: 490, acRate: 58.235501018694876, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: The Maze, slug: the-maze, url: https://leetcode.com/problems/the-maze, topics: ['Array', 'Depth-First Search', 'Breadth-First Search', 'Matrix'], hasSolution: True, hasVideoSolution: False, 491: questionNo: 491, acRate: 60.9109379328962, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Non-decreasing Subsequences, slug: non-decreasing-subsequences, url: https://leetcode.com/problems/non-decreasing-subsequences, topics: ['Array', 'Hash Table', 'Backtracking', 'Bit Manipulation'], hasSolution: True, hasVideoSolution: False, 492: questionNo: 492, acRate: 58.24107917011971, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Construct the Rectangle, slug: construct-the-rectangle, url: https://leetcode.com/problems/construct-the-rectangle, topics: ['Math'], hasSolution: False, hasVideoSolution: False, 493: questionNo: 493, acRate: 30.826486039832307, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Reverse Pairs, slug: reverse-pairs, url: https://leetcode.com/problems/reverse-pairs, topics: ['Array', 'Binary Search', 'Divide and Conquer', 'Binary Indexed Tree', 'Segment Tree', 'Merge Sort', 'Ordered Set'], hasSolution: False, hasVideoSolution: False, 494: questionNo: 494, acRate: 47.17188609826036, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Target Sum, slug: target-sum, url: https://leetcode.com/problems/target-sum, topics: ['Array', 'Dynamic Programming', 'Backtracking'], hasSolution: True, hasVideoSolution: False, 495: questionNo: 495, acRate: 56.665953349026324, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Teemo Attacking, slug: teemo-attacking, url: https://leetcode.com/problems/teemo-attacking, topics: ['Array', 'Simulation'], hasSolution: True, hasVideoSolution: False, 496: questionNo: 496, acRate: 72.67139140032896, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Next Greater Element I, slug: next-greater-element-i, url: https://leetcode.com/problems/next-greater-element-i, topics: ['Array', 'Hash Table', 'Stack', 'Monotonic Stack'], hasSolution: True, hasVideoSolution: False, 497: questionNo: 497, acRate: 40.11332044289246, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Random Point in Non-overlapping Rectangles, slug: random-point-in-non-overlapping-rectangles, url: https://leetcode.com/problems/random-point-in-non-overlapping-rectangles, topics: ['Array', 'Math', 'Binary Search', 'Reservoir Sampling', 'Prefix Sum', 'Ordered Set', 'Randomized'], hasSolution: False, hasVideoSolution: False, 498: questionNo: 498, acRate: 60.67772548714559, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Diagonal Traverse, slug: diagonal-traverse, url: https://leetcode.com/problems/diagonal-traverse, topics: ['Array', 'Matrix', 'Simulation'], hasSolution: True, hasVideoSolution: False, 499: questionNo: 499, acRate: 49.082857011508345, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: The Maze III, slug: the-maze-iii, url: https://leetcode.com/problems/the-maze-iii, topics: ['Array', 'String', 'Depth-First Search', 'Breadth-First Search', 'Graph', 'Heap (Priority Queue)', 'Matrix', 'Shortest Path'], hasSolution: True, hasVideoSolution: False, 500: questionNo: 500, acRate: 71.00170402885408, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Keyboard Row, slug: keyboard-row, url: https://leetcode.com/problems/keyboard-row, topics: ['Array', 'Hash Table', 'String'], hasSolution: False, hasVideoSolution: False, 501: questionNo: 501, acRate: 56.385653012195405, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Find Mode in Binary Search Tree, slug: find-mode-in-binary-search-tree, url: https://leetcode.com/problems/find-mode-in-binary-search-tree, topics: ['Tree', 'Depth-First Search', 'Binary Search Tree', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 502: questionNo: 502, acRate: 53.15194209868992, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: IPO, slug: ipo, url: https://leetcode.com/problems/ipo, topics: ['Array', 'Greedy', 'Sorting', 'Heap (Priority Queue)'], hasSolution: True, hasVideoSolution: False, 503: questionNo: 503, acRate: 64.30460858729244, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Next Greater Element II, slug: next-greater-element-ii, url: https://leetcode.com/problems/next-greater-element-ii, topics: ['Array', 'Stack', 'Monotonic Stack'], hasSolution: True, hasVideoSolution: False, 504: questionNo: 504, acRate: 50.42254241872638, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Base 7, slug: base-7, url: https://leetcode.com/problems/base-7, topics: ['Math'], hasSolution: False, hasVideoSolution: False, 505: questionNo: 505, acRate: 53.49385170458729, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: The Maze II, slug: the-maze-ii, url: https://leetcode.com/problems/the-maze-ii, topics: ['Array', 'Depth-First Search', 'Breadth-First Search', 'Graph', 'Heap (Priority Queue)', 'Matrix', 'Shortest Path'], hasSolution: True, hasVideoSolution: False, 506: questionNo: 506, acRate: 71.8971582046083, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Relative Ranks, slug: relative-ranks, url: https://leetcode.com/problems/relative-ranks, topics: ['Array', 'Sorting', 'Heap (Priority Queue)'], hasSolution: True, hasVideoSolution: False, 507: questionNo: 507, acRate: 41.389277828915134, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Perfect Number, slug: perfect-number, url: https://leetcode.com/problems/perfect-number, topics: ['Math'], hasSolution: True, hasVideoSolution: False, 508: questionNo: 508, acRate: 66.79771823300847, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Most Frequent Subtree Sum, slug: most-frequent-subtree-sum, url: https://leetcode.com/problems/most-frequent-subtree-sum, topics: ['Hash Table', 'Tree', 'Depth-First Search', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 509: questionNo: 509, acRate: 71.45051625321256, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Fibonacci Number, slug: fibonacci-number, url: https://leetcode.com/problems/fibonacci-number, topics: ['Math', 'Dynamic Programming', 'Recursion', 'Memoization'], hasSolution: True, hasVideoSolution: False, 510: questionNo: 510, acRate: 60.906577815206056, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Inorder Successor in BST II, slug: inorder-successor-in-bst-ii, url: https://leetcode.com/problems/inorder-successor-in-bst-ii, topics: ['Tree', 'Binary Search Tree', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 511: questionNo: 511, acRate: 74.82016061517473, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Game Play Analysis I, slug: game-play-analysis-i, url: https://leetcode.com/problems/game-play-analysis-i, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 512: questionNo: 512, acRate: 52.97316175806442, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Game Play Analysis II, slug: game-play-analysis-ii, url: https://leetcode.com/problems/game-play-analysis-ii, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 513: questionNo: 513, acRate: 71.28049929391015, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Find Bottom Left Tree Value, slug: find-bottom-left-tree-value, url: https://leetcode.com/problems/find-bottom-left-tree-value, topics: ['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 514: questionNo: 514, acRate: 58.99365484981701, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Freedom Trail, slug: freedom-trail, url: https://leetcode.com/problems/freedom-trail, topics: ['String', 'Dynamic Programming', 'Depth-First Search', 'Breadth-First Search'], hasSolution: True, hasVideoSolution: False, 515: questionNo: 515, acRate: 65.68109008905994, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Find Largest Value in Each Tree Row, slug: find-largest-value-in-each-tree-row, url: https://leetcode.com/problems/find-largest-value-in-each-tree-row, topics: ['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 516: questionNo: 516, acRate: 62.951737489778026, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Longest Palindromic Subsequence, slug: longest-palindromic-subsequence, url: https://leetcode.com/problems/longest-palindromic-subsequence, topics: ['String', 'Dynamic Programming'], hasSolution: True, hasVideoSolution: False, 517: questionNo: 517, acRate: 41.4496223222025, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Super Washing Machines, slug: super-washing-machines, url: https://leetcode.com/problems/super-washing-machines, topics: ['Array', 'Greedy'], hasSolution: True, hasVideoSolution: False, 518: questionNo: 518, acRate: 64.38723507801978, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Coin Change II, slug: coin-change-ii, url: https://leetcode.com/problems/coin-change-ii, topics: ['Array', 'Dynamic Programming'], hasSolution: True, hasVideoSolution: False, 519: questionNo: 519, acRate: 42.21651066441614, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Random Flip Matrix, slug: random-flip-matrix, url: https://leetcode.com/problems/random-flip-matrix, topics: ['Hash Table', 'Math', 'Reservoir Sampling', 'Randomized'], hasSolution: False, hasVideoSolution: False, 520: questionNo: 520, acRate: 56.41971449144268, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Detect Capital, slug: detect-capital, url: https://leetcode.com/problems/detect-capital, topics: ['String'], hasSolution: True, hasVideoSolution: False, 521: questionNo: 521, acRate: 60.86701109333613, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Longest Uncommon Subsequence I, slug: longest-uncommon-subsequence-i, url: https://leetcode.com/problems/longest-uncommon-subsequence-i, topics: ['String'], hasSolution: True, hasVideoSolution: False, 522: questionNo: 522, acRate: 41.871381387215855, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Longest Uncommon Subsequence II, slug: longest-uncommon-subsequence-ii, url: https://leetcode.com/problems/longest-uncommon-subsequence-ii, topics: ['Array', 'Hash Table', 'Two Pointers', 'String', 'Sorting'], hasSolution: False, hasVideoSolution: False, 523: questionNo: 523, acRate: 30.27502563059567, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Continuous Subarray Sum, slug: continuous-subarray-sum, url: https://leetcode.com/problems/continuous-subarray-sum, topics: ['Array', 'Hash Table', 'Math', 'Prefix Sum'], hasSolution: True, hasVideoSolution: False, 524: questionNo: 524, acRate: 51.27904884949385, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Longest Word in Dictionary through Deleting, slug: longest-word-in-dictionary-through-deleting, url: https://leetcode.com/problems/longest-word-in-dictionary-through-deleting, topics: ['Array', 'Two Pointers', 'String', 'Sorting'], hasSolution: True, hasVideoSolution: False, 525: questionNo: 525, acRate: 48.9579449020129, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Contiguous Array, slug: contiguous-array, url: https://leetcode.com/problems/contiguous-array, topics: ['Array', 'Hash Table', 'Prefix Sum'], hasSolution: True, hasVideoSolution: False, 526: questionNo: 526, acRate: 64.30373442186298, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Beautiful Arrangement, slug: beautiful-arrangement, url: https://leetcode.com/problems/beautiful-arrangement, topics: ['Array', 'Dynamic Programming', 'Backtracking', 'Bit Manipulation', 'Bitmask'], hasSolution: True, hasVideoSolution: False, 527: questionNo: 527, acRate: 61.14067766542487, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Word Abbreviation, slug: word-abbreviation, url: https://leetcode.com/problems/word-abbreviation, topics: ['Array', 'String', 'Greedy', 'Trie', 'Sorting'], hasSolution: True, hasVideoSolution: False, 528: questionNo: 528, acRate: 47.061070557920836, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Random Pick with Weight, slug: random-pick-with-weight, url: https://leetcode.com/problems/random-pick-with-weight, topics: ['Array', 'Math', 'Binary Search', 'Prefix Sum', 'Randomized'], hasSolution: True, hasVideoSolution: False, 529: questionNo: 529, acRate: 66.92175465273876, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minesweeper, slug: minesweeper, url: https://leetcode.com/problems/minesweeper, topics: ['Array', 'Depth-First Search', 'Breadth-First Search', 'Matrix'], hasSolution: False, hasVideoSolution: False, 530: questionNo: 530, acRate: 58.44753520869952, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Minimum Absolute Difference in BST, slug: minimum-absolute-difference-in-bst, url: https://leetcode.com/problems/minimum-absolute-difference-in-bst, topics: ['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Search Tree', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 531: questionNo: 531, acRate: 62.34319832362144, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Lonely Pixel I, slug: lonely-pixel-i, url: https://leetcode.com/problems/lonely-pixel-i, topics: ['Array', 'Hash Table', 'Matrix'], hasSolution: True, hasVideoSolution: True, 532: questionNo: 532, acRate: 43.13471276736187, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: K-diff Pairs in an Array, slug: k-diff-pairs-in-an-array, url: https://leetcode.com/problems/k-diff-pairs-in-an-array, topics: ['Array', 'Hash Table', 'Two Pointers', 'Binary Search', 'Sorting'], hasSolution: True, hasVideoSolution: False, 533: questionNo: 533, acRate: 48.6376220311817, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Lonely Pixel II, slug: lonely-pixel-ii, url: https://leetcode.com/problems/lonely-pixel-ii, topics: ['Array', 'Hash Table', 'Matrix'], hasSolution: False, hasVideoSolution: False, 534: questionNo: 534, acRate: 80.9164185607436, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Game Play Analysis III, slug: game-play-analysis-iii, url: https://leetcode.com/problems/game-play-analysis-iii, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 535: questionNo: 535, acRate: 86.442360619643, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Encode and Decode TinyURL, slug: encode-and-decode-tinyurl, url: https://leetcode.com/problems/encode-and-decode-tinyurl, topics: ['Hash Table', 'String', 'Design', 'Hash Function'], hasSolution: True, hasVideoSolution: False, 536: questionNo: 536, acRate: 57.16740391933028, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Construct Binary Tree from String, slug: construct-binary-tree-from-string, url: https://leetcode.com/problems/construct-binary-tree-from-string, topics: ['String', 'Stack', 'Tree', 'Depth-First Search', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 537: questionNo: 537, acRate: 71.9578681897415, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Complex Number Multiplication, slug: complex-number-multiplication, url: https://leetcode.com/problems/complex-number-multiplication, topics: ['Math', 'String', 'Simulation'], hasSolution: True, hasVideoSolution: False, 538: questionNo: 538, acRate: 69.57255713665766, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Convert BST to Greater Tree, slug: convert-bst-to-greater-tree, url: https://leetcode.com/problems/convert-bst-to-greater-tree, topics: ['Tree', 'Depth-First Search', 'Binary Search Tree', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 539: questionNo: 539, acRate: 56.976622012083, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Time Difference, slug: minimum-time-difference, url: https://leetcode.com/problems/minimum-time-difference, topics: ['Array', 'Math', 'String', 'Sorting'], hasSolution: False, hasVideoSolution: False, 540: questionNo: 540, acRate: 59.1859089889929, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Single Element in a Sorted Array, slug: single-element-in-a-sorted-array, url: https://leetcode.com/problems/single-element-in-a-sorted-array, topics: ['Array', 'Binary Search'], hasSolution: True, hasVideoSolution: False, 541: questionNo: 541, acRate: 50.95430411037195, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Reverse String II, slug: reverse-string-ii, url: https://leetcode.com/problems/reverse-string-ii, topics: ['Two Pointers', 'String'], hasSolution: True, hasVideoSolution: False, 542: questionNo: 542, acRate: 49.0431830111828, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: 01 Matrix, slug: 01-matrix, url: https://leetcode.com/problems/01-matrix, topics: ['Array', 'Dynamic Programming', 'Breadth-First Search', 'Matrix'], hasSolution: True, hasVideoSolution: False, 543: questionNo: 543, acRate: 61.009264264945514, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Diameter of Binary Tree, slug: diameter-of-binary-tree, url: https://leetcode.com/problems/diameter-of-binary-tree, topics: ['Tree', 'Depth-First Search', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 544: questionNo: 544, acRate: 77.16968820041423, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Output Contest Matches, slug: output-contest-matches, url: https://leetcode.com/problems/output-contest-matches, topics: ['String', 'Recursion', 'Simulation'], hasSolution: True, hasVideoSolution: False, 545: questionNo: 545, acRate: 45.68937519461343, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Boundary of Binary Tree, slug: boundary-of-binary-tree, url: https://leetcode.com/problems/boundary-of-binary-tree, topics: ['Tree', 'Depth-First Search', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 546: questionNo: 546, acRate: 47.84854053943059, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Remove Boxes, slug: remove-boxes, url: https://leetcode.com/problems/remove-boxes, topics: ['Array', 'Dynamic Programming', 'Memoization'], hasSolution: True, hasVideoSolution: False, 547: questionNo: 547, acRate: 66.75839880316126, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Number of Provinces, slug: number-of-provinces, url: https://leetcode.com/problems/number-of-provinces, topics: ['Depth-First Search', 'Breadth-First Search', 'Union Find', 'Graph'], hasSolution: True, hasVideoSolution: False, 548: questionNo: 548, acRate: 50.12945794704753, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Split Array with Equal Sum, slug: split-array-with-equal-sum, url: https://leetcode.com/problems/split-array-with-equal-sum, topics: ['Array', 'Hash Table', 'Prefix Sum'], hasSolution: True, hasVideoSolution: False, 549: questionNo: 549, acRate: 49.49751488339068, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Binary Tree Longest Consecutive Sequence II, slug: binary-tree-longest-consecutive-sequence-ii, url: https://leetcode.com/problems/binary-tree-longest-consecutive-sequence-ii, topics: ['Tree', 'Depth-First Search', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 550: questionNo: 550, acRate: 36.985130575028855, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Game Play Analysis IV, slug: game-play-analysis-iv, url: https://leetcode.com/problems/game-play-analysis-iv, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 551: questionNo: 551, acRate: 49.19399776232367, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Student Attendance Record I, slug: student-attendance-record-i, url: https://leetcode.com/problems/student-attendance-record-i, topics: ['String'], hasSolution: True, hasVideoSolution: False, 552: questionNo: 552, acRate: 55.15126867932953, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Student Attendance Record II, slug: student-attendance-record-ii, url: https://leetcode.com/problems/student-attendance-record-ii, topics: ['Dynamic Programming'], hasSolution: True, hasVideoSolution: False, 553: questionNo: 553, acRate: 60.95501873602204, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Optimal Division, slug: optimal-division, url: https://leetcode.com/problems/optimal-division, topics: ['Array', 'Math', 'Dynamic Programming'], hasSolution: True, hasVideoSolution: False, 554: questionNo: 554, acRate: 55.130403148716475, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Brick Wall, slug: brick-wall, url: https://leetcode.com/problems/brick-wall, topics: ['Array', 'Hash Table'], hasSolution: True, hasVideoSolution: True, 555: questionNo: 555, acRate: 43.38661402279819, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Split Concatenated Strings, slug: split-concatenated-strings, url: https://leetcode.com/problems/split-concatenated-strings, topics: ['Array', 'String', 'Greedy'], hasSolution: False, hasVideoSolution: False, 556: questionNo: 556, acRate: 34.13982775465583, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Next Greater Element III, slug: next-greater-element-iii, url: https://leetcode.com/problems/next-greater-element-iii, topics: ['Math', 'Two Pointers', 'String'], hasSolution: True, hasVideoSolution: False, 557: questionNo: 557, acRate: 83.1957495072768, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Reverse Words in a String III, slug: reverse-words-in-a-string-iii, url: https://leetcode.com/problems/reverse-words-in-a-string-iii, topics: ['Two Pointers', 'String'], hasSolution: True, hasVideoSolution: False, 558: questionNo: 558, acRate: 49.859061515503235, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Logical OR of Two Binary Grids Represented as Quad-Trees, slug: logical-or-of-two-binary-grids-represented-as-quad-trees, url: https://leetcode.com/problems/logical-or-of-two-binary-grids-represented-as-quad-trees, topics: ['Divide and Conquer', 'Tree'], hasSolution: False, hasVideoSolution: False, 559: questionNo: 559, acRate: 72.2894312364121, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Maximum Depth of N-ary Tree, slug: maximum-depth-of-n-ary-tree, url: https://leetcode.com/problems/maximum-depth-of-n-ary-tree, topics: ['Tree', 'Depth-First Search', 'Breadth-First Search'], hasSolution: True, hasVideoSolution: False, 560: questionNo: 560, acRate: 43.89675292185204, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Subarray Sum Equals K, slug: subarray-sum-equals-k, url: https://leetcode.com/problems/subarray-sum-equals-k, topics: ['Array', 'Hash Table', 'Prefix Sum'], hasSolution: True, hasVideoSolution: True, 561: questionNo: 561, acRate: 79.10786925736603, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Array Partition, slug: array-partition, url: https://leetcode.com/problems/array-partition, topics: ['Array', 'Greedy', 'Sorting', 'Counting Sort'], hasSolution: True, hasVideoSolution: False, 562: questionNo: 562, acRate: 50.405369092327156, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Longest Line of Consecutive One in Matrix, slug: longest-line-of-consecutive-one-in-matrix, url: https://leetcode.com/problems/longest-line-of-consecutive-one-in-matrix, topics: ['Array', 'Dynamic Programming', 'Matrix'], hasSolution: True, hasVideoSolution: False, 563: questionNo: 563, acRate: 62.282975161120156, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Binary Tree Tilt, slug: binary-tree-tilt, url: https://leetcode.com/problems/binary-tree-tilt, topics: ['Tree', 'Depth-First Search', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 564: questionNo: 564, acRate: 22.551891116804963, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Find the Closest Palindrome, slug: find-the-closest-palindrome, url: https://leetcode.com/problems/find-the-closest-palindrome, topics: ['Math', 'String'], hasSolution: False, hasVideoSolution: False, 565: questionNo: 565, acRate: 56.28639095751503, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Array Nesting, slug: array-nesting, url: https://leetcode.com/problems/array-nesting, topics: ['Array', 'Depth-First Search'], hasSolution: True, hasVideoSolution: False, 566: questionNo: 566, acRate: 63.16908505798696, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Reshape the Matrix, slug: reshape-the-matrix, url: https://leetcode.com/problems/reshape-the-matrix, topics: ['Array', 'Matrix', 'Simulation'], hasSolution: True, hasVideoSolution: False, 567: questionNo: 567, acRate: 44.58944259579839, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Permutation in String, slug: permutation-in-string, url: https://leetcode.com/problems/permutation-in-string, topics: ['Hash Table', 'Two Pointers', 'String', 'Sliding Window'], hasSolution: True, hasVideoSolution: False, 568: questionNo: 568, acRate: 45.77936846137272, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Maximum Vacation Days, slug: maximum-vacation-days, url: https://leetcode.com/problems/maximum-vacation-days, topics: ['Array', 'Dynamic Programming', 'Matrix'], hasSolution: True, hasVideoSolution: False, 569: questionNo: 569, acRate: 65.86872339744615, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Median Employee Salary, slug: median-employee-salary, url: https://leetcode.com/problems/median-employee-salary, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 570: questionNo: 570, acRate: 49.78158382489791, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Managers with at Least 5 Direct Reports, slug: managers-with-at-least-5-direct-reports, url: https://leetcode.com/problems/managers-with-at-least-5-direct-reports, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 571: questionNo: 571, acRate: 42.39580179634675, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Find Median Given Frequency of Numbers, slug: find-median-given-frequency-of-numbers, url: https://leetcode.com/problems/find-median-given-frequency-of-numbers, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 572: questionNo: 572, acRate: 48.32207642939823, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Subtree of Another Tree, slug: subtree-of-another-tree, url: https://leetcode.com/problems/subtree-of-another-tree, topics: ['Tree', 'Depth-First Search', 'String Matching', 'Binary Tree', 'Hash Function'], hasSolution: True, hasVideoSolution: False, 573: questionNo: 573, acRate: 57.174539243926695, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Squirrel Simulation, slug: squirrel-simulation, url: https://leetcode.com/problems/squirrel-simulation, topics: ['Array', 'Math'], hasSolution: True, hasVideoSolution: True, 574: questionNo: 574, acRate: 60.94661888583794, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Winning Candidate, slug: winning-candidate, url: https://leetcode.com/problems/winning-candidate, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 575: questionNo: 575, acRate: 68.02581156162277, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Distribute Candies, slug: distribute-candies, url: https://leetcode.com/problems/distribute-candies, topics: ['Array', 'Hash Table'], hasSolution: True, hasVideoSolution: False, 576: questionNo: 576, acRate: 48.08072277820742, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Out of Boundary Paths, slug: out-of-boundary-paths, url: https://leetcode.com/problems/out-of-boundary-paths, topics: ['Dynamic Programming'], hasSolution: True, hasVideoSolution: False, 577: questionNo: 577, acRate: 75.71041677298011, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Employee Bonus, slug: employee-bonus, url: https://leetcode.com/problems/employee-bonus, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 578: questionNo: 578, acRate: 40.24376457288207, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Get Highest Answer Rate Question, slug: get-highest-answer-rate-question, url: https://leetcode.com/problems/get-highest-answer-rate-question, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 579: questionNo: 579, acRate: 47.21861672538476, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Find Cumulative Salary of an Employee, slug: find-cumulative-salary-of-an-employee, url: https://leetcode.com/problems/find-cumulative-salary-of-an-employee, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 580: questionNo: 580, acRate: 59.09941763727121, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Count Student Number in Departments, slug: count-student-number-in-departments, url: https://leetcode.com/problems/count-student-number-in-departments, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 581: questionNo: 581, acRate: 36.9617807876988, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Shortest Unsorted Continuous Subarray, slug: shortest-unsorted-continuous-subarray, url: https://leetcode.com/problems/shortest-unsorted-continuous-subarray, topics: ['Array', 'Two Pointers', 'Stack', 'Greedy', 'Sorting', 'Monotonic Stack'], hasSolution: True, hasVideoSolution: False, 582: questionNo: 582, acRate: 69.54523211692886, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Kill Process, slug: kill-process, url: https://leetcode.com/problems/kill-process, topics: ['Array', 'Hash Table', 'Tree', 'Depth-First Search', 'Breadth-First Search'], hasSolution: True, hasVideoSolution: True, 583: questionNo: 583, acRate: 62.21650739473989, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Delete Operation for Two Strings, slug: delete-operation-for-two-strings, url: https://leetcode.com/problems/delete-operation-for-two-strings, topics: ['String', 'Dynamic Programming'], hasSolution: True, hasVideoSolution: False, 584: questionNo: 584, acRate: 70.29587443504747, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Find Customer Referee, slug: find-customer-referee, url: https://leetcode.com/problems/find-customer-referee, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 585: questionNo: 585, acRate: 48.14622672788052, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Investments in 2016, slug: investments-in-2016, url: https://leetcode.com/problems/investments-in-2016, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 586: questionNo: 586, acRate: 64.656712578074, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Customer Placing the Largest Number of Orders, slug: customer-placing-the-largest-number-of-orders, url: https://leetcode.com/problems/customer-placing-the-largest-number-of-orders, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 587: questionNo: 587, acRate: 51.94735858626305, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Erect the Fence, slug: erect-the-fence, url: https://leetcode.com/problems/erect-the-fence, topics: ['Array', 'Math', 'Geometry'], hasSolution: True, hasVideoSolution: False, 588: questionNo: 588, acRate: 48.09295333429353, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Design In-Memory File System, slug: design-in-memory-file-system, url: https://leetcode.com/problems/design-in-memory-file-system, topics: ['Hash Table', 'String', 'Design', 'Trie'], hasSolution: True, hasVideoSolution: False, 589: questionNo: 589, acRate: 75.61064687153785, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: N-ary Tree Preorder Traversal, slug: n-ary-tree-preorder-traversal, url: https://leetcode.com/problems/n-ary-tree-preorder-traversal, topics: ['Stack', 'Tree', 'Depth-First Search'], hasSolution: True, hasVideoSolution: False, 590: questionNo: 590, acRate: 78.02120839356745, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: N-ary Tree Postorder Traversal, slug: n-ary-tree-postorder-traversal, url: https://leetcode.com/problems/n-ary-tree-postorder-traversal, topics: ['Stack', 'Tree', 'Depth-First Search'], hasSolution: True, hasVideoSolution: False, 591: questionNo: 591, acRate: 38.88243867493392, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Tag Validator, slug: tag-validator, url: https://leetcode.com/problems/tag-validator, topics: ['String', 'Stack'], hasSolution: True, hasVideoSolution: False, 592: questionNo: 592, acRate: 53.517460040432255, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Fraction Addition and Subtraction, slug: fraction-addition-and-subtraction, url: https://leetcode.com/problems/fraction-addition-and-subtraction, topics: ['Math', 'String', 'Simulation'], hasSolution: True, hasVideoSolution: False, 593: questionNo: 593, acRate: 44.076978474833965, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Valid Square, slug: valid-square, url: https://leetcode.com/problems/valid-square, topics: ['Math', 'Geometry'], hasSolution: True, hasVideoSolution: False, 594: questionNo: 594, acRate: 54.983455734000486, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Longest Harmonious Subsequence, slug: longest-harmonious-subsequence, url: https://leetcode.com/problems/longest-harmonious-subsequence, topics: ['Array', 'Hash Table', 'Sliding Window', 'Sorting', 'Counting'], hasSolution: True, hasVideoSolution: False, 595: questionNo: 595, acRate: 68.05972747550382, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Big Countries, slug: big-countries, url: https://leetcode.com/problems/big-countries, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 596: questionNo: 596, acRate: 56.20004323334562, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Classes More Than 5 Students, slug: classes-more-than-5-students, url: https://leetcode.com/problems/classes-more-than-5-students, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 597: questionNo: 597, acRate: 41.82281344189034, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Friend Requests I: Overall Acceptance Rate, slug: friend-requests-i-overall-acceptance-rate, url: https://leetcode.com/problems/friend-requests-i-overall-acceptance-rate, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 598: questionNo: 598, acRate: 56.292316829544845, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Range Addition II, slug: range-addition-ii, url: https://leetcode.com/problems/range-addition-ii, topics: ['Array', 'Math'], hasSolution: True, hasVideoSolution: False, 599: questionNo: 599, acRate: 55.89675586076249, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Minimum Index Sum of Two Lists, slug: minimum-index-sum-of-two-lists, url: https://leetcode.com/problems/minimum-index-sum-of-two-lists, topics: ['Array', 'Hash Table', 'String'], hasSolution: True, hasVideoSolution: False, 600: questionNo: 600, acRate: 39.950344992621545, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Non-negative Integers without Consecutive Ones, slug: non-negative-integers-without-consecutive-ones, url: https://leetcode.com/problems/non-negative-integers-without-consecutive-ones, topics: ['Dynamic Programming'], hasSolution: True, hasVideoSolution: False, 601: questionNo: 601, acRate: 48.71266592920354, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Human Traffic of Stadium, slug: human-traffic-of-stadium, url: https://leetcode.com/problems/human-traffic-of-stadium, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 602: questionNo: 602, acRate: 57.69896431416719, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Friend Requests II: Who Has the Most Friends, slug: friend-requests-ii-who-has-the-most-friends, url: https://leetcode.com/problems/friend-requests-ii-who-has-the-most-friends, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 603: questionNo: 603, acRate: 65.94544731848896, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Consecutive Available Seats, slug: consecutive-available-seats, url: https://leetcode.com/problems/consecutive-available-seats, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 604: questionNo: 604, acRate: 39.85629505527567, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Design Compressed String Iterator, slug: design-compressed-string-iterator, url: https://leetcode.com/problems/design-compressed-string-iterator, topics: ['Array', 'String', 'Design', 'Iterator'], hasSolution: True, hasVideoSolution: False, 605: questionNo: 605, acRate: 29.01075834920504, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Can Place Flowers, slug: can-place-flowers, url: https://leetcode.com/problems/can-place-flowers, topics: ['Array', 'Greedy'], hasSolution: True, hasVideoSolution: False, 606: questionNo: 606, acRate: 69.38852021029044, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Construct String from Binary Tree, slug: construct-string-from-binary-tree, url: https://leetcode.com/problems/construct-string-from-binary-tree, topics: ['String', 'Tree', 'Depth-First Search', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 607: questionNo: 607, acRate: 65.73120699367938, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Sales Person, slug: sales-person, url: https://leetcode.com/problems/sales-person, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 608: questionNo: 608, acRate: 72.51979959405858, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Tree Node, slug: tree-node, url: https://leetcode.com/problems/tree-node, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 609: questionNo: 609, acRate: 67.64893475661071, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Find Duplicate File in System, slug: find-duplicate-file-in-system, url: https://leetcode.com/problems/find-duplicate-file-in-system, topics: ['Array', 'Hash Table', 'String'], hasSolution: True, hasVideoSolution: False, 610: questionNo: 610, acRate: 71.95217089629237, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Triangle Judgement, slug: triangle-judgement, url: https://leetcode.com/problems/triangle-judgement, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 611: questionNo: 611, acRate: 51.320455309937884, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Valid Triangle Number, slug: valid-triangle-number, url: https://leetcode.com/problems/valid-triangle-number, topics: ['Array', 'Two Pointers', 'Binary Search', 'Greedy', 'Sorting'], hasSolution: True, hasVideoSolution: False, 612: questionNo: 612, acRate: 61.313050912414134, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Shortest Distance in a Plane, slug: shortest-distance-in-a-plane, url: https://leetcode.com/problems/shortest-distance-in-a-plane, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 613: questionNo: 613, acRate: 80.17874241940632, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Shortest Distance in a Line, slug: shortest-distance-in-a-line, url: https://leetcode.com/problems/shortest-distance-in-a-line, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 614: questionNo: 614, acRate: 38.84115221591073, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Second Degree Follower, slug: second-degree-follower, url: https://leetcode.com/problems/second-degree-follower, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 615: questionNo: 615, acRate: 56.159900138527355, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Average Salary: Departments VS Company, slug: average-salary-departments-vs-company, url: https://leetcode.com/problems/average-salary-departments-vs-company, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 616: questionNo: 616, acRate: 49.90283652040433, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Add Bold Tag in String, slug: add-bold-tag-in-string, url: https://leetcode.com/problems/add-bold-tag-in-string, topics: ['Array', 'Hash Table', 'String', 'Trie', 'String Matching'], hasSolution: True, hasVideoSolution: False, 617: questionNo: 617, acRate: 79.031754704728, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Merge Two Binary Trees, slug: merge-two-binary-trees, url: https://leetcode.com/problems/merge-two-binary-trees, topics: ['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 618: questionNo: 618, acRate: 63.460990704057586, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Students Report By Geography, slug: students-report-by-geography, url: https://leetcode.com/problems/students-report-by-geography, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 619: questionNo: 619, acRate: 64.63334325896743, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Biggest Single Number, slug: biggest-single-number, url: https://leetcode.com/problems/biggest-single-number, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 620: questionNo: 620, acRate: 73.91957623449716, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Not Boring Movies, slug: not-boring-movies, url: https://leetcode.com/problems/not-boring-movies, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 621: questionNo: 621, acRate: 60.16281338585576, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Task Scheduler, slug: task-scheduler, url: https://leetcode.com/problems/task-scheduler, topics: ['Array', 'Hash Table', 'Greedy', 'Sorting', 'Heap (Priority Queue)', 'Counting'], hasSolution: True, hasVideoSolution: False, 622: questionNo: 622, acRate: 51.657982712405506, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Design Circular Queue, slug: design-circular-queue, url: https://leetcode.com/problems/design-circular-queue, topics: ['Array', 'Linked List', 'Design', 'Queue'], hasSolution: True, hasVideoSolution: False, 623: questionNo: 623, acRate: 64.03710843708895, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Add One Row to Tree, slug: add-one-row-to-tree, url: https://leetcode.com/problems/add-one-row-to-tree, topics: ['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 624: questionNo: 624, acRate: 42.39072618434495, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Maximum Distance in Arrays, slug: maximum-distance-in-arrays, url: https://leetcode.com/problems/maximum-distance-in-arrays, topics: ['Array', 'Greedy'], hasSolution: True, hasVideoSolution: False, 625: questionNo: 625, acRate: 33.653108211818875, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Minimum Factorization, slug: minimum-factorization, url: https://leetcode.com/problems/minimum-factorization, topics: ['Math', 'Greedy'], hasSolution: True, hasVideoSolution: True, 626: questionNo: 626, acRate: 70.20282213367686, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Exchange Seats, slug: exchange-seats, url: https://leetcode.com/problems/exchange-seats, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 627: questionNo: 627, acRate: 83.3607340472115, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Swap Salary, slug: swap-salary, url: https://leetcode.com/problems/swap-salary, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 628: questionNo: 628, acRate: 45.179927679423585, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Maximum Product of Three Numbers, slug: maximum-product-of-three-numbers, url: https://leetcode.com/problems/maximum-product-of-three-numbers, topics: ['Array', 'Math', 'Sorting'], hasSolution: True, hasVideoSolution: False, 629: questionNo: 629, acRate: 49.501854937412546, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: K Inverse Pairs Array, slug: k-inverse-pairs-array, url: https://leetcode.com/problems/k-inverse-pairs-array, topics: ['Dynamic Programming'], hasSolution: True, hasVideoSolution: False, 630: questionNo: 630, acRate: 40.237741034116695, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Course Schedule III, slug: course-schedule-iii, url: https://leetcode.com/problems/course-schedule-iii, topics: ['Array', 'Greedy', 'Sorting', 'Heap (Priority Queue)'], hasSolution: True, hasVideoSolution: False, 631: questionNo: 631, acRate: 43.97187530730652, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Design Excel Sum Formula, slug: design-excel-sum-formula, url: https://leetcode.com/problems/design-excel-sum-formula, topics: ['Array', 'Graph', 'Design', 'Topological Sort', 'Matrix'], hasSolution: True, hasVideoSolution: False, 632: questionNo: 632, acRate: 62.922436331945384, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Smallest Range Covering Elements from K Lists, slug: smallest-range-covering-elements-from-k-lists, url: https://leetcode.com/problems/smallest-range-covering-elements-from-k-lists, topics: ['Array', 'Hash Table', 'Greedy', 'Sliding Window', 'Sorting', 'Heap (Priority Queue)'], hasSolution: True, hasVideoSolution: False, 633: questionNo: 633, acRate: 36.63448814546603, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Sum of Square Numbers, slug: sum-of-square-numbers, url: https://leetcode.com/problems/sum-of-square-numbers, topics: ['Math', 'Two Pointers', 'Binary Search'], hasSolution: True, hasVideoSolution: False, 634: questionNo: 634, acRate: 41.881610688439416, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Find the Derangement of An Array, slug: find-the-derangement-of-an-array, url: https://leetcode.com/problems/find-the-derangement-of-an-array, topics: ['Math', 'Dynamic Programming'], hasSolution: True, hasVideoSolution: False, 635: questionNo: 635, acRate: 60.78241803773976, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Design Log Storage System, slug: design-log-storage-system, url: https://leetcode.com/problems/design-log-storage-system, topics: ['Hash Table', 'String', 'Design', 'Ordered Set'], hasSolution: True, hasVideoSolution: False, 636: questionNo: 636, acRate: 62.240127243057906, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Exclusive Time of Functions, slug: exclusive-time-of-functions, url: https://leetcode.com/problems/exclusive-time-of-functions, topics: ['Array', 'Stack'], hasSolution: False, hasVideoSolution: False, 637: questionNo: 637, acRate: 72.98793602524643, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Average of Levels in Binary Tree, slug: average-of-levels-in-binary-tree, url: https://leetcode.com/problems/average-of-levels-in-binary-tree, topics: ['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 638: questionNo: 638, acRate: 51.94867198820662, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Shopping Offers, slug: shopping-offers, url: https://leetcode.com/problems/shopping-offers, topics: ['Array', 'Dynamic Programming', 'Backtracking', 'Bit Manipulation', 'Memoization', 'Bitmask'], hasSolution: False, hasVideoSolution: False, 639: questionNo: 639, acRate: 30.77706155656632, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Decode Ways II, slug: decode-ways-ii, url: https://leetcode.com/problems/decode-ways-ii, topics: ['String', 'Dynamic Programming'], hasSolution: True, hasVideoSolution: False, 640: questionNo: 640, acRate: 43.86122261476369, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Solve the Equation, slug: solve-the-equation, url: https://leetcode.com/problems/solve-the-equation, topics: ['Math', 'String', 'Simulation'], hasSolution: True, hasVideoSolution: False, 641: questionNo: 641, acRate: 57.19374046629036, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Design Circular Deque, slug: design-circular-deque, url: https://leetcode.com/problems/design-circular-deque, topics: ['Array', 'Linked List', 'Design', 'Queue'], hasSolution: False, hasVideoSolution: False, 642: questionNo: 642, acRate: 49.03578177467814, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Design Search Autocomplete System, slug: design-search-autocomplete-system, url: https://leetcode.com/problems/design-search-autocomplete-system, topics: ['String', 'Design', 'Trie', 'Sorting', 'Heap (Priority Queue)', 'Data Stream'], hasSolution: True, hasVideoSolution: False, 643: questionNo: 643, acRate: 43.568541772113264, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Maximum Average Subarray I, slug: maximum-average-subarray-i, url: https://leetcode.com/problems/maximum-average-subarray-i, topics: ['Array', 'Sliding Window'], hasSolution: True, hasVideoSolution: False, 644: questionNo: 644, acRate: 36.767694776252455, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Maximum Average Subarray II, slug: maximum-average-subarray-ii, url: https://leetcode.com/problems/maximum-average-subarray-ii, topics: ['Array', 'Binary Search', 'Prefix Sum'], hasSolution: True, hasVideoSolution: True, 645: questionNo: 645, acRate: 44.48284502198913, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Set Mismatch, slug: set-mismatch, url: https://leetcode.com/problems/set-mismatch, topics: ['Array', 'Hash Table', 'Bit Manipulation', 'Sorting'], hasSolution: True, hasVideoSolution: False, 646: questionNo: 646, acRate: 60.05394534133184, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum Length of Pair Chain, slug: maximum-length-of-pair-chain, url: https://leetcode.com/problems/maximum-length-of-pair-chain, topics: ['Array', 'Dynamic Programming', 'Greedy', 'Sorting'], hasSolution: True, hasVideoSolution: False, 647: questionNo: 647, acRate: 70.41541071896431, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Palindromic Substrings, slug: palindromic-substrings, url: https://leetcode.com/problems/palindromic-substrings, topics: ['Two Pointers', 'String', 'Dynamic Programming'], hasSolution: True, hasVideoSolution: False, 648: questionNo: 648, acRate: 68.04613502122453, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Replace Words, slug: replace-words, url: https://leetcode.com/problems/replace-words, topics: ['Array', 'Hash Table', 'String', 'Trie'], hasSolution: True, hasVideoSolution: False, 649: questionNo: 649, acRate: 47.7864579434495, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Dota2 Senate, slug: dota2-senate, url: https://leetcode.com/problems/dota2-senate, topics: ['String', 'Greedy', 'Queue'], hasSolution: True, hasVideoSolution: False, 650: questionNo: 650, acRate: 54.25514879057614, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: 2 Keys Keyboard, slug: 2-keys-keyboard, url: https://leetcode.com/problems/2-keys-keyboard, topics: ['Math', 'Dynamic Programming'], hasSolution: True, hasVideoSolution: False, 651: questionNo: 651, acRate: 55.872820742065265, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: 4 Keys Keyboard, slug: 4-keys-keyboard, url: https://leetcode.com/problems/4-keys-keyboard, topics: ['Math', 'Dynamic Programming'], hasSolution: True, hasVideoSolution: False, 652: questionNo: 652, acRate: 59.548262385080285, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Find Duplicate Subtrees, slug: find-duplicate-subtrees, url: https://leetcode.com/problems/find-duplicate-subtrees, topics: ['Hash Table', 'Tree', 'Depth-First Search', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 653: questionNo: 653, acRate: 61.41290803516242, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Two Sum IV - Input is a BST, slug: two-sum-iv-input-is-a-bst, url: https://leetcode.com/problems/two-sum-iv-input-is-a-bst, topics: ['Hash Table', 'Two Pointers', 'Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Search Tree', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 654: questionNo: 654, acRate: 85.49924335436712, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum Binary Tree, slug: maximum-binary-tree, url: https://leetcode.com/problems/maximum-binary-tree, topics: ['Array', 'Divide and Conquer', 'Stack', 'Tree', 'Monotonic Stack', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 655: questionNo: 655, acRate: 64.3387842643958, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Print Binary Tree, slug: print-binary-tree, url: https://leetcode.com/problems/print-binary-tree, topics: ['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree'], hasSolution: False, hasVideoSolution: False, 656: questionNo: 656, acRate: 32.11854856885283, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Coin Path, slug: coin-path, url: https://leetcode.com/problems/coin-path, topics: ['Array', 'Dynamic Programming'], hasSolution: True, hasVideoSolution: False, 657: questionNo: 657, acRate: 75.87010203606206, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Robot Return to Origin, slug: robot-return-to-origin, url: https://leetcode.com/problems/robot-return-to-origin, topics: ['String', 'Simulation'], hasSolution: True, hasVideoSolution: False, 658: questionNo: 658, acRate: 47.62949886018652, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Find K Closest Elements, slug: find-k-closest-elements, url: https://leetcode.com/problems/find-k-closest-elements, topics: ['Array', 'Two Pointers', 'Binary Search', 'Sliding Window', 'Sorting', 'Heap (Priority Queue)'], hasSolution: True, hasVideoSolution: False, 659: questionNo: 659, acRate: 51.13330323645251, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Split Array into Consecutive Subsequences, slug: split-array-into-consecutive-subsequences, url: https://leetcode.com/problems/split-array-into-consecutive-subsequences, topics: ['Array', 'Hash Table', 'Greedy', 'Heap (Priority Queue)'], hasSolution: True, hasVideoSolution: False, 660: questionNo: 660, acRate: 57.419629550777096, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Remove 9, slug: remove-9, url: https://leetcode.com/problems/remove-9, topics: ['Math'], hasSolution: True, hasVideoSolution: False, 661: questionNo: 661, acRate: 67.47150209225146, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Image Smoother, slug: image-smoother, url: https://leetcode.com/problems/image-smoother, topics: ['Array', 'Matrix'], hasSolution: True, hasVideoSolution: False, 662: questionNo: 662, acRate: 43.060378785319756, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum Width of Binary Tree, slug: maximum-width-of-binary-tree, url: https://leetcode.com/problems/maximum-width-of-binary-tree, topics: ['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 663: questionNo: 663, acRate: 41.54873270968258, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Equal Tree Partition, slug: equal-tree-partition, url: https://leetcode.com/problems/equal-tree-partition, topics: ['Tree', 'Depth-First Search', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 664: questionNo: 664, acRate: 54.97975708502024, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Strange Printer, slug: strange-printer, url: https://leetcode.com/problems/strange-printer, topics: ['String', 'Dynamic Programming'], hasSolution: True, hasVideoSolution: False, 665: questionNo: 665, acRate: 24.778851790855448, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Non-decreasing Array, slug: non-decreasing-array, url: https://leetcode.com/problems/non-decreasing-array, topics: ['Array'], hasSolution: True, hasVideoSolution: False, 666: questionNo: 666, acRate: 61.397841952718515, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Path Sum IV, slug: path-sum-iv, url: https://leetcode.com/problems/path-sum-iv, topics: ['Array', 'Hash Table', 'Tree', 'Depth-First Search', 'Binary Tree'], hasSolution: False, hasVideoSolution: False, 667: questionNo: 667, acRate: 60.23000476406784, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Beautiful Arrangement II, slug: beautiful-arrangement-ii, url: https://leetcode.com/problems/beautiful-arrangement-ii, topics: ['Array', 'Math'], hasSolution: True, hasVideoSolution: False, 668: questionNo: 668, acRate: 51.86040990741474, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Kth Smallest Number in Multiplication Table, slug: kth-smallest-number-in-multiplication-table, url: https://leetcode.com/problems/kth-smallest-number-in-multiplication-table, topics: ['Math', 'Binary Search'], hasSolution: True, hasVideoSolution: False, 669: questionNo: 669, acRate: 66.28098035819755, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Trim a Binary Search Tree, slug: trim-a-binary-search-tree, url: https://leetcode.com/problems/trim-a-binary-search-tree, topics: ['Tree', 'Depth-First Search', 'Binary Search Tree', 'Binary Tree'], hasSolution: True, hasVideoSolution: True, 670: questionNo: 670, acRate: 48.91198342647106, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum Swap, slug: maximum-swap, url: https://leetcode.com/problems/maximum-swap, topics: ['Math', 'Greedy'], hasSolution: True, hasVideoSolution: False, 671: questionNo: 671, acRate: 44.627359390761455, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Second Minimum Node In a Binary Tree, slug: second-minimum-node-in-a-binary-tree, url: https://leetcode.com/problems/second-minimum-node-in-a-binary-tree, topics: ['Tree', 'Depth-First Search', 'Binary Tree'], hasSolution: False, hasVideoSolution: False, 672: questionNo: 672, acRate: 50.17767692768763, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Bulb Switcher II, slug: bulb-switcher-ii, url: https://leetcode.com/problems/bulb-switcher-ii, topics: ['Math', 'Bit Manipulation', 'Depth-First Search', 'Breadth-First Search'], hasSolution: True, hasVideoSolution: False, 673: questionNo: 673, acRate: 48.39859961136376, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Number of Longest Increasing Subsequence, slug: number-of-longest-increasing-subsequence, url: https://leetcode.com/problems/number-of-longest-increasing-subsequence, topics: ['Array', 'Dynamic Programming', 'Binary Indexed Tree', 'Segment Tree'], hasSolution: True, hasVideoSolution: False, 674: questionNo: 674, acRate: 50.40215174885358, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Longest Continuous Increasing Subsequence, slug: longest-continuous-increasing-subsequence, url: https://leetcode.com/problems/longest-continuous-increasing-subsequence, topics: ['Array'], hasSolution: True, hasVideoSolution: False, 675: questionNo: 675, acRate: 34.46059761802437, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Cut Off Trees for Golf Event, slug: cut-off-trees-for-golf-event, url: https://leetcode.com/problems/cut-off-trees-for-golf-event, topics: ['Array', 'Breadth-First Search', 'Heap (Priority Queue)', 'Matrix'], hasSolution: True, hasVideoSolution: False, 676: questionNo: 676, acRate: 57.568368584130404, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Implement Magic Dictionary, slug: implement-magic-dictionary, url: https://leetcode.com/problems/implement-magic-dictionary, topics: ['Hash Table', 'String', 'Depth-First Search', 'Design', 'Trie'], hasSolution: False, hasVideoSolution: False, 677: questionNo: 677, acRate: 56.79443341861744, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Map Sum Pairs, slug: map-sum-pairs, url: https://leetcode.com/problems/map-sum-pairs, topics: ['Hash Table', 'String', 'Design', 'Trie'], hasSolution: True, hasVideoSolution: False, 678: questionNo: 678, acRate: 38.116518327488876, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Valid Parenthesis String, slug: valid-parenthesis-string, url: https://leetcode.com/problems/valid-parenthesis-string, topics: ['String', 'Dynamic Programming', 'Stack', 'Greedy'], hasSolution: True, hasVideoSolution: False, 679: questionNo: 679, acRate: 49.42964603412226, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: 24 Game, slug: 24-game, url: https://leetcode.com/problems/24-game, topics: ['Array', 'Math', 'Backtracking'], hasSolution: True, hasVideoSolution: False, 680: questionNo: 680, acRate: 41.051197715974844, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Valid Palindrome II, slug: valid-palindrome-ii, url: https://leetcode.com/problems/valid-palindrome-ii, topics: ['Two Pointers', 'String', 'Greedy'], hasSolution: True, hasVideoSolution: False, 681: questionNo: 681, acRate: 46.7333092285769, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Next Closest Time, slug: next-closest-time, url: https://leetcode.com/problems/next-closest-time, topics: ['Hash Table', 'String', 'Backtracking', 'Enumeration'], hasSolution: True, hasVideoSolution: False, 682: questionNo: 682, acRate: 76.83383141100052, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Baseball Game, slug: baseball-game, url: https://leetcode.com/problems/baseball-game, topics: ['Array', 'Stack', 'Simulation'], hasSolution: True, hasVideoSolution: False, 683: questionNo: 683, acRate: 37.133966906266586, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: K Empty Slots, slug: k-empty-slots, url: https://leetcode.com/problems/k-empty-slots, topics: ['Array', 'Binary Indexed Tree', 'Segment Tree', 'Queue', 'Sliding Window', 'Heap (Priority Queue)', 'Ordered Set', 'Monotonic Queue'], hasSolution: True, hasVideoSolution: False, 684: questionNo: 684, acRate: 63.20648157655967, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Redundant Connection, slug: redundant-connection, url: https://leetcode.com/problems/redundant-connection, topics: ['Depth-First Search', 'Breadth-First Search', 'Union Find', 'Graph'], hasSolution: True, hasVideoSolution: False, 685: questionNo: 685, acRate: 34.552697604044965, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Redundant Connection II, slug: redundant-connection-ii, url: https://leetcode.com/problems/redundant-connection-ii, topics: ['Depth-First Search', 'Breadth-First Search', 'Union Find', 'Graph'], hasSolution: True, hasVideoSolution: False, 686: questionNo: 686, acRate: 35.31651555837002, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Repeated String Match, slug: repeated-string-match, url: https://leetcode.com/problems/repeated-string-match, topics: ['String', 'String Matching'], hasSolution: True, hasVideoSolution: False, 687: questionNo: 687, acRate: 41.726795268247194, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Longest Univalue Path, slug: longest-univalue-path, url: https://leetcode.com/problems/longest-univalue-path, topics: ['Tree', 'Depth-First Search', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 688: questionNo: 688, acRate: 56.253798770886576, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Knight Probability in Chessboard, slug: knight-probability-in-chessboard, url: https://leetcode.com/problems/knight-probability-in-chessboard, topics: ['Dynamic Programming'], hasSolution: True, hasVideoSolution: False, 689: questionNo: 689, acRate: 50.197664086946446, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Maximum Sum of 3 Non-Overlapping Subarrays, slug: maximum-sum-of-3-non-overlapping-subarrays, url: https://leetcode.com/problems/maximum-sum-of-3-non-overlapping-subarrays, topics: ['Array', 'Dynamic Programming'], hasSolution: True, hasVideoSolution: False, 690: questionNo: 690, acRate: 67.24001957587679, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Employee Importance, slug: employee-importance, url: https://leetcode.com/problems/employee-importance, topics: ['Array', 'Hash Table', 'Tree', 'Depth-First Search', 'Breadth-First Search'], hasSolution: True, hasVideoSolution: False, 691: questionNo: 691, acRate: 48.92780604530693, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Stickers to Spell Word, slug: stickers-to-spell-word, url: https://leetcode.com/problems/stickers-to-spell-word, topics: ['Array', 'String', 'Dynamic Programming', 'Backtracking', 'Bit Manipulation', 'Bitmask'], hasSolution: True, hasVideoSolution: False, 692: questionNo: 692, acRate: 58.25126188900567, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Top K Frequent Words, slug: top-k-frequent-words, url: https://leetcode.com/problems/top-k-frequent-words, topics: ['Hash Table', 'String', 'Trie', 'Sorting', 'Heap (Priority Queue)', 'Bucket Sort', 'Counting'], hasSolution: True, hasVideoSolution: False, 693: questionNo: 693, acRate: 62.6861104514149, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Binary Number with Alternating Bits, slug: binary-number-with-alternating-bits, url: https://leetcode.com/problems/binary-number-with-alternating-bits, topics: ['Bit Manipulation'], hasSolution: True, hasVideoSolution: False, 694: questionNo: 694, acRate: 61.45953590394828, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Number of Distinct Islands, slug: number-of-distinct-islands, url: https://leetcode.com/problems/number-of-distinct-islands, topics: ['Hash Table', 'Depth-First Search', 'Breadth-First Search', 'Union Find', 'Hash Function'], hasSolution: True, hasVideoSolution: True, 695: questionNo: 695, acRate: 72.34059122950688, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Max Area of Island, slug: max-area-of-island, url: https://leetcode.com/problems/max-area-of-island, topics: ['Array', 'Depth-First Search', 'Breadth-First Search', 'Union Find', 'Matrix'], hasSolution: True, hasVideoSolution: False, 696: questionNo: 696, acRate: 65.65190795132388, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Count Binary Substrings, slug: count-binary-substrings, url: https://leetcode.com/problems/count-binary-substrings, topics: ['Two Pointers', 'String'], hasSolution: True, hasVideoSolution: False, 697: questionNo: 697, acRate: 56.65506166562031, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Degree of an Array, slug: degree-of-an-array, url: https://leetcode.com/problems/degree-of-an-array, topics: ['Array', 'Hash Table'], hasSolution: True, hasVideoSolution: False, 698: questionNo: 698, acRate: 38.21587932738757, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Partition to K Equal Sum Subsets, slug: partition-to-k-equal-sum-subsets, url: https://leetcode.com/problems/partition-to-k-equal-sum-subsets, topics: ['Array', 'Dynamic Programming', 'Backtracking', 'Bit Manipulation', 'Memoization', 'Bitmask'], hasSolution: True, hasVideoSolution: False, 699: questionNo: 699, acRate: 45.20394182994668, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Falling Squares, slug: falling-squares, url: https://leetcode.com/problems/falling-squares, topics: ['Array', 'Segment Tree', 'Ordered Set'], hasSolution: True, hasVideoSolution: False, 700: questionNo: 700, acRate: 80.25742392044113, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Search in a Binary Search Tree, slug: search-in-a-binary-search-tree, url: https://leetcode.com/problems/search-in-a-binary-search-tree, topics: ['Tree', 'Binary Search Tree', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 701: questionNo: 701, acRate: 73.70096714916238, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Insert into a Binary Search Tree, slug: insert-into-a-binary-search-tree, url: https://leetcode.com/problems/insert-into-a-binary-search-tree, topics: ['Tree', 'Binary Search Tree', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 702: questionNo: 702, acRate: 72.23377476195688, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Search in a Sorted Array of Unknown Size, slug: search-in-a-sorted-array-of-unknown-size, url: https://leetcode.com/problems/search-in-a-sorted-array-of-unknown-size, topics: ['Array', 'Binary Search', 'Interactive'], hasSolution: True, hasVideoSolution: False, 703: questionNo: 703, acRate: 57.02321485447158, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Kth Largest Element in a Stream, slug: kth-largest-element-in-a-stream, url: https://leetcode.com/problems/kth-largest-element-in-a-stream, topics: ['Tree', 'Design', 'Binary Search Tree', 'Heap (Priority Queue)', 'Binary Tree', 'Data Stream'], hasSolution: True, hasVideoSolution: False, 704: questionNo: 704, acRate: 58.01370257276152, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Binary Search, slug: binary-search, url: https://leetcode.com/problems/binary-search, topics: ['Array', 'Binary Search'], hasSolution: True, hasVideoSolution: False, 705: questionNo: 705, acRate: 67.1155276333436, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Design HashSet, slug: design-hashset, url: https://leetcode.com/problems/design-hashset, topics: ['Array', 'Hash Table', 'Linked List', 'Design', 'Hash Function'], hasSolution: True, hasVideoSolution: False, 706: questionNo: 706, acRate: 65.56995298538402, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Design HashMap, slug: design-hashmap, url: https://leetcode.com/problems/design-hashmap, topics: ['Array', 'Hash Table', 'Linked List', 'Design', 'Hash Function'], hasSolution: True, hasVideoSolution: False, 707: questionNo: 707, acRate: 28.328555617823596, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Design Linked List, slug: design-linked-list, url: https://leetcode.com/problems/design-linked-list, topics: ['Linked List', 'Design'], hasSolution: True, hasVideoSolution: False, 708: questionNo: 708, acRate: 36.44014353833385, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Insert into a Sorted Circular Linked List, slug: insert-into-a-sorted-circular-linked-list, url: https://leetcode.com/problems/insert-into-a-sorted-circular-linked-list, topics: ['Linked List'], hasSolution: True, hasVideoSolution: False, 709: questionNo: 709, acRate: 83.53091469706953, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: To Lower Case, slug: to-lower-case, url: https://leetcode.com/problems/to-lower-case, topics: ['String'], hasSolution: True, hasVideoSolution: False, 710: questionNo: 710, acRate: 33.47749844694855, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Random Pick with Blacklist, slug: random-pick-with-blacklist, url: https://leetcode.com/problems/random-pick-with-blacklist, topics: ['Array', 'Hash Table', 'Math', 'Binary Search', 'Sorting', 'Randomized'], hasSolution: False, hasVideoSolution: False, 711: questionNo: 711, acRate: 53.04592314901593, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Number of Distinct Islands II, slug: number-of-distinct-islands-ii, url: https://leetcode.com/problems/number-of-distinct-islands-ii, topics: ['Hash Table', 'Depth-First Search', 'Breadth-First Search', 'Union Find', 'Hash Function'], hasSolution: False, hasVideoSolution: False, 712: questionNo: 712, acRate: 65.17077484248922, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum ASCII Delete Sum for Two Strings, slug: minimum-ascii-delete-sum-for-two-strings, url: https://leetcode.com/problems/minimum-ascii-delete-sum-for-two-strings, topics: ['String', 'Dynamic Programming'], hasSolution: True, hasVideoSolution: False, 713: questionNo: 713, acRate: 51.60912944486608, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Subarray Product Less Than K, slug: subarray-product-less-than-k, url: https://leetcode.com/problems/subarray-product-less-than-k, topics: ['Array', 'Sliding Window'], hasSolution: True, hasVideoSolution: False, 714: questionNo: 714, acRate: 68.99928041843131, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Best Time to Buy and Sell Stock with Transaction Fee, slug: best-time-to-buy-and-sell-stock-with-transaction-fee, url: https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-transaction-fee, topics: ['Array', 'Dynamic Programming', 'Greedy'], hasSolution: True, hasVideoSolution: False, 715: questionNo: 715, acRate: 43.9360622958702, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Range Module, slug: range-module, url: https://leetcode.com/problems/range-module, topics: ['Design', 'Segment Tree', 'Ordered Set'], hasSolution: True, hasVideoSolution: False, 716: questionNo: 716, acRate: 45.05772469938707, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Max Stack, slug: max-stack, url: https://leetcode.com/problems/max-stack, topics: ['Linked List', 'Stack', 'Design', 'Doubly-Linked List', 'Ordered Set'], hasSolution: True, hasVideoSolution: False, 717: questionNo: 717, acRate: 45.21470262405132, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: 1-bit and 2-bit Characters, slug: 1-bit-and-2-bit-characters, url: https://leetcode.com/problems/1-bit-and-2-bit-characters, topics: ['Array'], hasSolution: True, hasVideoSolution: False, 718: questionNo: 718, acRate: 50.951372442993595, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum Length of Repeated Subarray, slug: maximum-length-of-repeated-subarray, url: https://leetcode.com/problems/maximum-length-of-repeated-subarray, topics: ['Array', 'Binary Search', 'Dynamic Programming', 'Sliding Window', 'Rolling Hash', 'Hash Function'], hasSolution: True, hasVideoSolution: False, 719: questionNo: 719, acRate: 38.29806549584049, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Find K-th Smallest Pair Distance, slug: find-k-th-smallest-pair-distance, url: https://leetcode.com/problems/find-k-th-smallest-pair-distance, topics: ['Array', 'Two Pointers', 'Binary Search', 'Sorting'], hasSolution: False, hasVideoSolution: False, 720: questionNo: 720, acRate: 52.599609295510966, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Longest Word in Dictionary, slug: longest-word-in-dictionary, url: https://leetcode.com/problems/longest-word-in-dictionary, topics: ['Array', 'Hash Table', 'String', 'Trie', 'Sorting'], hasSolution: True, hasVideoSolution: False, 721: questionNo: 721, acRate: 57.60574494726692, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Accounts Merge, slug: accounts-merge, url: https://leetcode.com/problems/accounts-merge, topics: ['Array', 'Hash Table', 'String', 'Depth-First Search', 'Breadth-First Search', 'Union Find', 'Sorting'], hasSolution: True, hasVideoSolution: False, 722: questionNo: 722, acRate: 38.85702213067132, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Remove Comments, slug: remove-comments, url: https://leetcode.com/problems/remove-comments, topics: ['Array', 'String'], hasSolution: True, hasVideoSolution: False, 723: questionNo: 723, acRate: 76.91043030130577, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Candy Crush, slug: candy-crush, url: https://leetcode.com/problems/candy-crush, topics: ['Array', 'Two Pointers', 'Matrix', 'Simulation'], hasSolution: True, hasVideoSolution: False, 724: questionNo: 724, acRate: 58.189449468312915, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Find Pivot Index, slug: find-pivot-index, url: https://leetcode.com/problems/find-pivot-index, topics: ['Array', 'Prefix Sum'], hasSolution: True, hasVideoSolution: False, 725: questionNo: 725, acRate: 64.21638857896338, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Split Linked List in Parts, slug: split-linked-list-in-parts, url: https://leetcode.com/problems/split-linked-list-in-parts, topics: ['Linked List'], hasSolution: True, hasVideoSolution: False, 726: questionNo: 726, acRate: 65.1804481812676, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Number of Atoms, slug: number-of-atoms, url: https://leetcode.com/problems/number-of-atoms, topics: ['Hash Table', 'String', 'Stack', 'Sorting'], hasSolution: True, hasVideoSolution: False, 727: questionNo: 727, acRate: 43.50945152479586, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Minimum Window Subsequence, slug: minimum-window-subsequence, url: https://leetcode.com/problems/minimum-window-subsequence, topics: ['String', 'Dynamic Programming', 'Sliding Window'], hasSolution: False, hasVideoSolution: False, 728: questionNo: 728, acRate: 78.82054353994577, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Self Dividing Numbers, slug: self-dividing-numbers, url: https://leetcode.com/problems/self-dividing-numbers, topics: ['Math'], hasSolution: True, hasVideoSolution: False, 729: questionNo: 729, acRate: 56.59824911905361, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: My Calendar I, slug: my-calendar-i, url: https://leetcode.com/problems/my-calendar-i, topics: ['Array', 'Binary Search', 'Design', 'Segment Tree', 'Ordered Set'], hasSolution: True, hasVideoSolution: False, 730: questionNo: 730, acRate: 45.69445122248792, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Count Different Palindromic Subsequences, slug: count-different-palindromic-subsequences, url: https://leetcode.com/problems/count-different-palindromic-subsequences, topics: ['String', 'Dynamic Programming'], hasSolution: False, hasVideoSolution: False, 731: questionNo: 731, acRate: 55.659839337797976, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: My Calendar II, slug: my-calendar-ii, url: https://leetcode.com/problems/my-calendar-ii, topics: ['Array', 'Binary Search', 'Design', 'Segment Tree', 'Prefix Sum', 'Ordered Set'], hasSolution: False, hasVideoSolution: False, 732: questionNo: 732, acRate: 71.63343252805961, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: My Calendar III, slug: my-calendar-iii, url: https://leetcode.com/problems/my-calendar-iii, topics: ['Binary Search', 'Design', 'Segment Tree', 'Prefix Sum', 'Ordered Set'], hasSolution: True, hasVideoSolution: False, 733: questionNo: 733, acRate: 64.42997679858678, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Flood Fill, slug: flood-fill, url: https://leetcode.com/problems/flood-fill, topics: ['Array', 'Depth-First Search', 'Breadth-First Search', 'Matrix'], hasSolution: True, hasVideoSolution: False, 734: questionNo: 734, acRate: 44.35944445177203, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Sentence Similarity, slug: sentence-similarity, url: https://leetcode.com/problems/sentence-similarity, topics: ['Array', 'Hash Table', 'String'], hasSolution: True, hasVideoSolution: False, 735: questionNo: 735, acRate: 44.57322618663563, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Asteroid Collision, slug: asteroid-collision, url: https://leetcode.com/problems/asteroid-collision, topics: ['Array', 'Stack', 'Simulation'], hasSolution: True, hasVideoSolution: False, 736: questionNo: 736, acRate: 51.93151786740204, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Parse Lisp Expression, slug: parse-lisp-expression, url: https://leetcode.com/problems/parse-lisp-expression, topics: ['Hash Table', 'String', 'Stack', 'Recursion'], hasSolution: False, hasVideoSolution: False, 737: questionNo: 737, acRate: 50.11522185444337, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Sentence Similarity II, slug: sentence-similarity-ii, url: https://leetcode.com/problems/sentence-similarity-ii, topics: ['Array', 'Hash Table', 'String', 'Depth-First Search', 'Breadth-First Search', 'Union Find'], hasSolution: True, hasVideoSolution: False, 738: questionNo: 738, acRate: 48.22988586726786, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Monotone Increasing Digits, slug: monotone-increasing-digits, url: https://leetcode.com/problems/monotone-increasing-digits, topics: ['Math', 'Greedy'], hasSolution: False, hasVideoSolution: False, 739: questionNo: 739, acRate: 66.18211980878303, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Daily Temperatures, slug: daily-temperatures, url: https://leetcode.com/problems/daily-temperatures, topics: ['Array', 'Stack', 'Monotonic Stack'], hasSolution: True, hasVideoSolution: False, 740: questionNo: 740, acRate: 56.51936301180488, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Delete and Earn, slug: delete-and-earn, url: https://leetcode.com/problems/delete-and-earn, topics: ['Array', 'Hash Table', 'Dynamic Programming'], hasSolution: True, hasVideoSolution: False, 741: questionNo: 741, acRate: 37.053000775927416, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Cherry Pickup, slug: cherry-pickup, url: https://leetcode.com/problems/cherry-pickup, topics: ['Array', 'Dynamic Programming', 'Matrix'], hasSolution: True, hasVideoSolution: False, 742: questionNo: 742, acRate: 46.39593705636534, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Closest Leaf in a Binary Tree, slug: closest-leaf-in-a-binary-tree, url: https://leetcode.com/problems/closest-leaf-in-a-binary-tree, topics: ['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 743: questionNo: 743, acRate: 54.50541557189573, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Network Delay Time, slug: network-delay-time, url: https://leetcode.com/problems/network-delay-time, topics: ['Depth-First Search', 'Breadth-First Search', 'Graph', 'Heap (Priority Queue)', 'Shortest Path'], hasSolution: True, hasVideoSolution: False, 744: questionNo: 744, acRate: 52.4750638535137, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Find Smallest Letter Greater Than Target, slug: find-smallest-letter-greater-than-target, url: https://leetcode.com/problems/find-smallest-letter-greater-than-target, topics: ['Array', 'Binary Search'], hasSolution: True, hasVideoSolution: False, 745: questionNo: 745, acRate: 41.14253422288948, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Prefix and Suffix Search, slug: prefix-and-suffix-search, url: https://leetcode.com/problems/prefix-and-suffix-search, topics: ['Array', 'Hash Table', 'String', 'Design', 'Trie'], hasSolution: True, hasVideoSolution: False, 746: questionNo: 746, acRate: 65.99094341899942, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Min Cost Climbing Stairs, slug: min-cost-climbing-stairs, url: https://leetcode.com/problems/min-cost-climbing-stairs, topics: ['Array', 'Dynamic Programming'], hasSolution: True, hasVideoSolution: False, 747: questionNo: 747, acRate: 49.167944755424415, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Largest Number At Least Twice of Others, slug: largest-number-at-least-twice-of-others, url: https://leetcode.com/problems/largest-number-at-least-twice-of-others, topics: ['Array', 'Sorting'], hasSolution: False, hasVideoSolution: False, 748: questionNo: 748, acRate: 60.22949858876876, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Shortest Completing Word, slug: shortest-completing-word, url: https://leetcode.com/problems/shortest-completing-word, topics: ['Array', 'Hash Table', 'String'], hasSolution: False, hasVideoSolution: False, 749: questionNo: 749, acRate: 51.21093595669867, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Contain Virus, slug: contain-virus, url: https://leetcode.com/problems/contain-virus, topics: ['Array', 'Depth-First Search', 'Breadth-First Search', 'Matrix', 'Simulation'], hasSolution: False, hasVideoSolution: False, 750: questionNo: 750, acRate: 67.75026797167408, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Number Of Corner Rectangles, slug: number-of-corner-rectangles, url: https://leetcode.com/problems/number-of-corner-rectangles, topics: ['Array', 'Math', 'Dynamic Programming', 'Matrix'], hasSolution: True, hasVideoSolution: False, 751: questionNo: 751, acRate: 55.58750196545296, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: IP to CIDR, slug: ip-to-cidr, url: https://leetcode.com/problems/ip-to-cidr, topics: ['String', 'Bit Manipulation'], hasSolution: False, hasVideoSolution: False, 752: questionNo: 752, acRate: 60.33864274698831, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Open the Lock, slug: open-the-lock, url: https://leetcode.com/problems/open-the-lock, topics: ['Array', 'Hash Table', 'String', 'Breadth-First Search'], hasSolution: True, hasVideoSolution: False, 753: questionNo: 753, acRate: 56.99946517935592, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Cracking the Safe, slug: cracking-the-safe, url: https://leetcode.com/problems/cracking-the-safe, topics: ['Depth-First Search', 'Graph', 'Eulerian Circuit'], hasSolution: False, hasVideoSolution: False, 754: questionNo: 754, acRate: 43.270837200668275, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Reach a Number, slug: reach-a-number, url: https://leetcode.com/problems/reach-a-number, topics: ['Math', 'Binary Search'], hasSolution: True, hasVideoSolution: False, 755: questionNo: 755, acRate: 47.05265724037055, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Pour Water, slug: pour-water, url: https://leetcode.com/problems/pour-water, topics: ['Array', 'Simulation'], hasSolution: False, hasVideoSolution: False, 756: questionNo: 756, acRate: 52.89717591440657, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Pyramid Transition Matrix, slug: pyramid-transition-matrix, url: https://leetcode.com/problems/pyramid-transition-matrix, topics: ['Bit Manipulation', 'Depth-First Search', 'Breadth-First Search'], hasSolution: False, hasVideoSolution: False, 757: questionNo: 757, acRate: 44.60570327116049, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Set Intersection Size At Least Two, slug: set-intersection-size-at-least-two, url: https://leetcode.com/problems/set-intersection-size-at-least-two, topics: ['Array', 'Greedy', 'Sorting'], hasSolution: False, hasVideoSolution: False, 758: questionNo: 758, acRate: 51.54853516943432, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Bold Words in String, slug: bold-words-in-string, url: https://leetcode.com/problems/bold-words-in-string, topics: ['Array', 'Hash Table', 'String', 'Trie', 'String Matching'], hasSolution: False, hasVideoSolution: False, 759: questionNo: 759, acRate: 72.23556948957408, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Employee Free Time, slug: employee-free-time, url: https://leetcode.com/problems/employee-free-time, topics: ['Array', 'Sorting', 'Heap (Priority Queue)'], hasSolution: False, hasVideoSolution: False, 760: questionNo: 760, acRate: 83.69150595865291, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Find Anagram Mappings, slug: find-anagram-mappings, url: https://leetcode.com/problems/find-anagram-mappings, topics: ['Array', 'Hash Table'], hasSolution: True, hasVideoSolution: True, 761: questionNo: 761, acRate: 61.346377505644114, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Special Binary String, slug: special-binary-string, url: https://leetcode.com/problems/special-binary-string, topics: ['String', 'Recursion'], hasSolution: True, hasVideoSolution: False, 762: questionNo: 762, acRate: 69.7386748716243, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Prime Number of Set Bits in Binary Representation, slug: prime-number-of-set-bits-in-binary-representation, url: https://leetcode.com/problems/prime-number-of-set-bits-in-binary-representation, topics: ['Math', 'Bit Manipulation'], hasSolution: False, hasVideoSolution: False, 763: questionNo: 763, acRate: 79.9350340859742, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Partition Labels, slug: partition-labels, url: https://leetcode.com/problems/partition-labels, topics: ['Hash Table', 'Two Pointers', 'String', 'Greedy'], hasSolution: True, hasVideoSolution: False, 764: questionNo: 764, acRate: 48.340456710221034, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Largest Plus Sign, slug: largest-plus-sign, url: https://leetcode.com/problems/largest-plus-sign, topics: ['Array', 'Dynamic Programming'], hasSolution: True, hasVideoSolution: False, 765: questionNo: 765, acRate: 57.51388256713701, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Couples Holding Hands, slug: couples-holding-hands, url: https://leetcode.com/problems/couples-holding-hands, topics: ['Greedy', 'Depth-First Search', 'Breadth-First Search', 'Union Find', 'Graph'], hasSolution: True, hasVideoSolution: False, 766: questionNo: 766, acRate: 69.10766945188047, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Toeplitz Matrix, slug: toeplitz-matrix, url: https://leetcode.com/problems/toeplitz-matrix, topics: ['Array', 'Matrix'], hasSolution: True, hasVideoSolution: False, 767: questionNo: 767, acRate: 54.82998120503792, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Reorganize String, slug: reorganize-string, url: https://leetcode.com/problems/reorganize-string, topics: ['Hash Table', 'String', 'Greedy', 'Sorting', 'Heap (Priority Queue)', 'Counting'], hasSolution: True, hasVideoSolution: False, 768: questionNo: 768, acRate: 53.367990357257064, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Max Chunks To Make Sorted II, slug: max-chunks-to-make-sorted-ii, url: https://leetcode.com/problems/max-chunks-to-make-sorted-ii, topics: ['Array', 'Stack', 'Greedy', 'Sorting', 'Monotonic Stack'], hasSolution: False, hasVideoSolution: False, 769: questionNo: 769, acRate: 58.501668052211656, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Max Chunks To Make Sorted, slug: max-chunks-to-make-sorted, url: https://leetcode.com/problems/max-chunks-to-make-sorted, topics: ['Array', 'Stack', 'Greedy', 'Sorting', 'Monotonic Stack'], hasSolution: False, hasVideoSolution: False, 770: questionNo: 770, acRate: 55.673666020840976, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Basic Calculator IV, slug: basic-calculator-iv, url: https://leetcode.com/problems/basic-calculator-iv, topics: ['Hash Table', 'Math', 'String', 'Stack', 'Recursion'], hasSolution: False, hasVideoSolution: False, 771: questionNo: 771, acRate: 88.73058145064313, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Jewels and Stones, slug: jewels-and-stones, url: https://leetcode.com/problems/jewels-and-stones, topics: ['Hash Table', 'String'], hasSolution: True, hasVideoSolution: False, 772: questionNo: 772, acRate: 50.91517495585115, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Basic Calculator III, slug: basic-calculator-iii, url: https://leetcode.com/problems/basic-calculator-iii, topics: ['Math', 'String', 'Stack', 'Recursion'], hasSolution: True, hasVideoSolution: False, 773: questionNo: 773, acRate: 64.9462859924415, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Sliding Puzzle, slug: sliding-puzzle, url: https://leetcode.com/problems/sliding-puzzle, topics: ['Array', 'Breadth-First Search', 'Matrix'], hasSolution: False, hasVideoSolution: False, 774: questionNo: 774, acRate: 52.36007002872538, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Minimize Max Distance to Gas Station, slug: minimize-max-distance-to-gas-station, url: https://leetcode.com/problems/minimize-max-distance-to-gas-station, topics: ['Array', 'Binary Search'], hasSolution: True, hasVideoSolution: False, 775: questionNo: 775, acRate: 42.45479427718034, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Global and Local Inversions, slug: global-and-local-inversions, url: https://leetcode.com/problems/global-and-local-inversions, topics: ['Array', 'Math'], hasSolution: True, hasVideoSolution: False, 776: questionNo: 776, acRate: 82.6387300425454, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Split BST, slug: split-bst, url: https://leetcode.com/problems/split-bst, topics: ['Tree', 'Binary Search Tree', 'Recursion', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 777: questionNo: 777, acRate: 36.84539218069917, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Swap Adjacent in LR String, slug: swap-adjacent-in-lr-string, url: https://leetcode.com/problems/swap-adjacent-in-lr-string, topics: ['Two Pointers', 'String'], hasSolution: False, hasVideoSolution: False, 778: questionNo: 778, acRate: 61.216060473739596, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Swim in Rising Water, slug: swim-in-rising-water, url: https://leetcode.com/problems/swim-in-rising-water, topics: ['Array', 'Binary Search', 'Depth-First Search', 'Breadth-First Search', 'Union Find', 'Heap (Priority Queue)', 'Matrix'], hasSolution: False, hasVideoSolution: False, 779: questionNo: 779, acRate: 46.66469667371954, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: K-th Symbol in Grammar, slug: k-th-symbol-in-grammar, url: https://leetcode.com/problems/k-th-symbol-in-grammar, topics: ['Math', 'Bit Manipulation', 'Recursion'], hasSolution: True, hasVideoSolution: False, 780: questionNo: 780, acRate: 33.283856137019704, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Reaching Points, slug: reaching-points, url: https://leetcode.com/problems/reaching-points, topics: ['Math'], hasSolution: True, hasVideoSolution: False, 781: questionNo: 781, acRate: 53.08595601584789, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Rabbits in Forest, slug: rabbits-in-forest, url: https://leetcode.com/problems/rabbits-in-forest, topics: ['Array', 'Hash Table', 'Math', 'Greedy'], hasSolution: False, hasVideoSolution: False, 782: questionNo: 782, acRate: 50.92200596675664, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Transform to Chessboard, slug: transform-to-chessboard, url: https://leetcode.com/problems/transform-to-chessboard, topics: ['Array', 'Math', 'Bit Manipulation', 'Matrix'], hasSolution: True, hasVideoSolution: False, 783: questionNo: 783, acRate: 59.66976642694981, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Minimum Distance Between BST Nodes, slug: minimum-distance-between-bst-nodes, url: https://leetcode.com/problems/minimum-distance-between-bst-nodes, topics: ['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Search Tree', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 784: questionNo: 784, acRate: 74.36631521836541, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Letter Case Permutation, slug: letter-case-permutation, url: https://leetcode.com/problems/letter-case-permutation, topics: ['String', 'Backtracking', 'Bit Manipulation'], hasSolution: True, hasVideoSolution: False, 785: questionNo: 785, acRate: 56.09436711126597, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Is Graph Bipartite?, slug: is-graph-bipartite, url: https://leetcode.com/problems/is-graph-bipartite, topics: ['Depth-First Search', 'Breadth-First Search', 'Union Find', 'Graph'], hasSolution: True, hasVideoSolution: False, 786: questionNo: 786, acRate: 68.12483414317218, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: K-th Smallest Prime Fraction, slug: k-th-smallest-prime-fraction, url: https://leetcode.com/problems/k-th-smallest-prime-fraction, topics: ['Array', 'Two Pointers', 'Binary Search', 'Sorting', 'Heap (Priority Queue)'], hasSolution: True, hasVideoSolution: False, 787: questionNo: 787, acRate: 39.46804277826572, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Cheapest Flights Within K Stops, slug: cheapest-flights-within-k-stops, url: https://leetcode.com/problems/cheapest-flights-within-k-stops, topics: ['Dynamic Programming', 'Depth-First Search', 'Breadth-First Search', 'Graph', 'Heap (Priority Queue)', 'Shortest Path'], hasSolution: True, hasVideoSolution: False, 788: questionNo: 788, acRate: 56.447388290920074, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Rotated Digits, slug: rotated-digits, url: https://leetcode.com/problems/rotated-digits, topics: ['Math', 'Dynamic Programming'], hasSolution: False, hasVideoSolution: False, 789: questionNo: 789, acRate: 61.94470650970098, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Escape The Ghosts, slug: escape-the-ghosts, url: https://leetcode.com/problems/escape-the-ghosts, topics: ['Array', 'Math'], hasSolution: True, hasVideoSolution: False, 790: questionNo: 790, acRate: 50.1876300495085, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Domino and Tromino Tiling, slug: domino-and-tromino-tiling, url: https://leetcode.com/problems/domino-and-tromino-tiling, topics: ['Dynamic Programming'], hasSolution: True, hasVideoSolution: False, 791: questionNo: 791, acRate: 70.91383168415089, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Custom Sort String, slug: custom-sort-string, url: https://leetcode.com/problems/custom-sort-string, topics: ['Hash Table', 'String', 'Sorting'], hasSolution: True, hasVideoSolution: False, 792: questionNo: 792, acRate: 50.91479386177373, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Number of Matching Subsequences, slug: number-of-matching-subsequences, url: https://leetcode.com/problems/number-of-matching-subsequences, topics: ['Array', 'Hash Table', 'String', 'Binary Search', 'Dynamic Programming', 'Trie', 'Sorting'], hasSolution: True, hasVideoSolution: False, 793: questionNo: 793, acRate: 44.76448978636778, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Preimage Size of Factorial Zeroes Function, slug: preimage-size-of-factorial-zeroes-function, url: https://leetcode.com/problems/preimage-size-of-factorial-zeroes-function, topics: ['Math', 'Binary Search'], hasSolution: False, hasVideoSolution: False, 794: questionNo: 794, acRate: 34.72121714880774, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Valid Tic-Tac-Toe State, slug: valid-tic-tac-toe-state, url: https://leetcode.com/problems/valid-tic-tac-toe-state, topics: ['Array', 'Matrix'], hasSolution: False, hasVideoSolution: False, 795: questionNo: 795, acRate: 53.25327576384517, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Number of Subarrays with Bounded Maximum, slug: number-of-subarrays-with-bounded-maximum, url: https://leetcode.com/problems/number-of-subarrays-with-bounded-maximum, topics: ['Array', 'Two Pointers'], hasSolution: True, hasVideoSolution: False, 796: questionNo: 796, acRate: 58.71395945097863, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Rotate String, slug: rotate-string, url: https://leetcode.com/problems/rotate-string, topics: ['String', 'String Matching'], hasSolution: True, hasVideoSolution: False, 797: questionNo: 797, acRate: 82.56642113127396, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: All Paths From Source to Target, slug: all-paths-from-source-to-target, url: https://leetcode.com/problems/all-paths-from-source-to-target, topics: ['Backtracking', 'Depth-First Search', 'Breadth-First Search', 'Graph'], hasSolution: True, hasVideoSolution: False, 798: questionNo: 798, acRate: 51.51470963508439, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Smallest Rotation with Highest Score, slug: smallest-rotation-with-highest-score, url: https://leetcode.com/problems/smallest-rotation-with-highest-score, topics: ['Array', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 799: questionNo: 799, acRate: 58.18510668573954, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Champagne Tower, slug: champagne-tower, url: https://leetcode.com/problems/champagne-tower, topics: ['Dynamic Programming'], hasSolution: True, hasVideoSolution: False, 800: questionNo: 800, acRate: 67.47263836063028, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Similar RGB Color, slug: similar-rgb-color, url: https://leetcode.com/problems/similar-rgb-color, topics: ['Math', 'String', 'Enumeration'], hasSolution: True, hasVideoSolution: False, 801: questionNo: 801, acRate: 40.15424760216007, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Minimum Swaps To Make Sequences Increasing, slug: minimum-swaps-to-make-sequences-increasing, url: https://leetcode.com/problems/minimum-swaps-to-make-sequences-increasing, topics: ['Array', 'Dynamic Programming'], hasSolution: False, hasVideoSolution: False, 802: questionNo: 802, acRate: 63.50264659198912, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Find Eventual Safe States, slug: find-eventual-safe-states, url: https://leetcode.com/problems/find-eventual-safe-states, topics: ['Depth-First Search', 'Breadth-First Search', 'Graph', 'Topological Sort'], hasSolution: True, hasVideoSolution: False, 803: questionNo: 803, acRate: 34.86408053143492, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Bricks Falling When Hit, slug: bricks-falling-when-hit, url: https://leetcode.com/problems/bricks-falling-when-hit, topics: ['Array', 'Union Find', 'Matrix'], hasSolution: True, hasVideoSolution: False, 804: questionNo: 804, acRate: 82.91494993990008, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Unique Morse Code Words, slug: unique-morse-code-words, url: https://leetcode.com/problems/unique-morse-code-words, topics: ['Array', 'Hash Table', 'String'], hasSolution: True, hasVideoSolution: False, 805: questionNo: 805, acRate: 25.541289023162133, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Split Array With Same Average, slug: split-array-with-same-average, url: https://leetcode.com/problems/split-array-with-same-average, topics: ['Array', 'Math', 'Dynamic Programming', 'Bit Manipulation', 'Bitmask'], hasSolution: False, hasVideoSolution: False, 806: questionNo: 806, acRate: 68.76376743875575, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Number of Lines To Write String, slug: number-of-lines-to-write-string, url: https://leetcode.com/problems/number-of-lines-to-write-string, topics: ['Array', 'String'], hasSolution: True, hasVideoSolution: False, 807: questionNo: 807, acRate: 86.18060975042509, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Max Increase to Keep City Skyline, slug: max-increase-to-keep-city-skyline, url: https://leetcode.com/problems/max-increase-to-keep-city-skyline, topics: ['Array', 'Greedy', 'Matrix'], hasSolution: True, hasVideoSolution: False, 808: questionNo: 808, acRate: 53.859456689698234, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Soup Servings, slug: soup-servings, url: https://leetcode.com/problems/soup-servings, topics: ['Math', 'Dynamic Programming', 'Probability and Statistics'], hasSolution: True, hasVideoSolution: False, 809: questionNo: 809, acRate: 46.20473782522724, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Expressive Words, slug: expressive-words, url: https://leetcode.com/problems/expressive-words, topics: ['Array', 'Two Pointers', 'String'], hasSolution: False, hasVideoSolution: False, 810: questionNo: 810, acRate: 60.24620609147829, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Chalkboard XOR Game, slug: chalkboard-xor-game, url: https://leetcode.com/problems/chalkboard-xor-game, topics: ['Array', 'Math', 'Bit Manipulation', 'Brainteaser', 'Game Theory'], hasSolution: True, hasVideoSolution: False, 811: questionNo: 811, acRate: 76.3086914567436, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Subdomain Visit Count, slug: subdomain-visit-count, url: https://leetcode.com/problems/subdomain-visit-count, topics: ['Array', 'Hash Table', 'String', 'Counting'], hasSolution: True, hasVideoSolution: False, 812: questionNo: 812, acRate: 60.84613803968127, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Largest Triangle Area, slug: largest-triangle-area, url: https://leetcode.com/problems/largest-triangle-area, topics: ['Array', 'Math', 'Geometry'], hasSolution: False, hasVideoSolution: False, 813: questionNo: 813, acRate: 53.576777550055176, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Largest Sum of Averages, slug: largest-sum-of-averages, url: https://leetcode.com/problems/largest-sum-of-averages, topics: ['Array', 'Dynamic Programming', 'Prefix Sum'], hasSolution: True, hasVideoSolution: False, 814: questionNo: 814, acRate: 72.26082027849033, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Binary Tree Pruning, slug: binary-tree-pruning, url: https://leetcode.com/problems/binary-tree-pruning, topics: ['Tree', 'Depth-First Search', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 815: questionNo: 815, acRate: 47.66951687575359, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Bus Routes, slug: bus-routes, url: https://leetcode.com/problems/bus-routes, topics: ['Array', 'Hash Table', 'Breadth-First Search'], hasSolution: True, hasVideoSolution: False, 816: questionNo: 816, acRate: 56.838808880888095, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Ambiguous Coordinates, slug: ambiguous-coordinates, url: https://leetcode.com/problems/ambiguous-coordinates, topics: ['String', 'Backtracking', 'Enumeration'], hasSolution: False, hasVideoSolution: False, 817: questionNo: 817, acRate: 56.88508577478052, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Linked List Components, slug: linked-list-components, url: https://leetcode.com/problems/linked-list-components, topics: ['Array', 'Hash Table', 'Linked List'], hasSolution: False, hasVideoSolution: False, 818: questionNo: 818, acRate: 43.772085022127904, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Race Car, slug: race-car, url: https://leetcode.com/problems/race-car, topics: ['Dynamic Programming'], hasSolution: False, hasVideoSolution: False, 819: questionNo: 819, acRate: 44.314883010979564, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Most Common Word, slug: most-common-word, url: https://leetcode.com/problems/most-common-word, topics: ['Array', 'Hash Table', 'String', 'Counting'], hasSolution: True, hasVideoSolution: False, 820: questionNo: 820, acRate: 60.46058326431228, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Short Encoding of Words, slug: short-encoding-of-words, url: https://leetcode.com/problems/short-encoding-of-words, topics: ['Array', 'Hash Table', 'String', 'Trie'], hasSolution: True, hasVideoSolution: False, 821: questionNo: 821, acRate: 71.70665082686057, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Shortest Distance to a Character, slug: shortest-distance-to-a-character, url: https://leetcode.com/problems/shortest-distance-to-a-character, topics: ['Array', 'Two Pointers', 'String'], hasSolution: True, hasVideoSolution: False, 822: questionNo: 822, acRate: 47.768281101614434, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Card Flipping Game, slug: card-flipping-game, url: https://leetcode.com/problems/card-flipping-game, topics: ['Array', 'Hash Table'], hasSolution: False, hasVideoSolution: False, 823: questionNo: 823, acRate: 52.89893860532599, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Binary Trees With Factors, slug: binary-trees-with-factors, url: https://leetcode.com/problems/binary-trees-with-factors, topics: ['Array', 'Hash Table', 'Dynamic Programming', 'Sorting'], hasSolution: True, hasVideoSolution: False, 824: questionNo: 824, acRate: 68.39546069159293, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Goat Latin, slug: goat-latin, url: https://leetcode.com/problems/goat-latin, topics: ['String'], hasSolution: False, hasVideoSolution: False, 825: questionNo: 825, acRate: 47.82958829896826, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Friends Of Appropriate Ages, slug: friends-of-appropriate-ages, url: https://leetcode.com/problems/friends-of-appropriate-ages, topics: ['Array', 'Two Pointers', 'Binary Search', 'Sorting'], hasSolution: False, hasVideoSolution: False, 826: questionNo: 826, acRate: 55.88733095046261, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Most Profit Assigning Work, slug: most-profit-assigning-work, url: https://leetcode.com/problems/most-profit-assigning-work, topics: ['Array', 'Two Pointers', 'Binary Search', 'Greedy', 'Sorting'], hasSolution: True, hasVideoSolution: False, 827: questionNo: 827, acRate: 47.99242239750626, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Making A Large Island, slug: making-a-large-island, url: https://leetcode.com/problems/making-a-large-island, topics: ['Array', 'Depth-First Search', 'Breadth-First Search', 'Union Find', 'Matrix'], hasSolution: True, hasVideoSolution: False, 828: questionNo: 828, acRate: 52.50352305081821, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Count Unique Characters of All Substrings of a Given String, slug: count-unique-characters-of-all-substrings-of-a-given-string, url: https://leetcode.com/problems/count-unique-characters-of-all-substrings-of-a-given-string, topics: ['Hash Table', 'String', 'Dynamic Programming'], hasSolution: False, hasVideoSolution: False, 829: questionNo: 829, acRate: 41.86315512750042, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Consecutive Numbers Sum, slug: consecutive-numbers-sum, url: https://leetcode.com/problems/consecutive-numbers-sum, topics: ['Math', 'Enumeration'], hasSolution: False, hasVideoSolution: False, 830: questionNo: 830, acRate: 52.35668858351179, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Positions of Large Groups, slug: positions-of-large-groups, url: https://leetcode.com/problems/positions-of-large-groups, topics: ['String'], hasSolution: True, hasVideoSolution: False, 831: questionNo: 831, acRate: 49.00658970420651, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Masking Personal Information, slug: masking-personal-information, url: https://leetcode.com/problems/masking-personal-information, topics: ['String'], hasSolution: False, hasVideoSolution: False, 832: questionNo: 832, acRate: 82.17295361889376, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Flipping an Image, slug: flipping-an-image, url: https://leetcode.com/problems/flipping-an-image, topics: ['Array', 'Two Pointers', 'Bit Manipulation', 'Matrix', 'Simulation'], hasSolution: True, hasVideoSolution: False, 833: questionNo: 833, acRate: 52.35011044768828, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Find And Replace in String, slug: find-and-replace-in-string, url: https://leetcode.com/problems/find-and-replace-in-string, topics: ['Array', 'String', 'Sorting'], hasSolution: False, hasVideoSolution: False, 834: questionNo: 834, acRate: 65.2663544442054, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Sum of Distances in Tree, slug: sum-of-distances-in-tree, url: https://leetcode.com/problems/sum-of-distances-in-tree, topics: ['Dynamic Programming', 'Tree', 'Depth-First Search', 'Graph'], hasSolution: True, hasVideoSolution: False, 835: questionNo: 835, acRate: 63.68994511585152, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Image Overlap, slug: image-overlap, url: https://leetcode.com/problems/image-overlap, topics: ['Array', 'Matrix'], hasSolution: True, hasVideoSolution: False, 836: questionNo: 836, acRate: 44.95873786407767, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Rectangle Overlap, slug: rectangle-overlap, url: https://leetcode.com/problems/rectangle-overlap, topics: ['Math', 'Geometry'], hasSolution: True, hasVideoSolution: False, 837: questionNo: 837, acRate: 44.96971755912983, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: New 21 Game, slug: new-21-game, url: https://leetcode.com/problems/new-21-game, topics: ['Math', 'Dynamic Programming', 'Sliding Window', 'Probability and Statistics'], hasSolution: False, hasVideoSolution: False, 838: questionNo: 838, acRate: 57.200788227673726, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Push Dominoes, slug: push-dominoes, url: https://leetcode.com/problems/push-dominoes, topics: ['Two Pointers', 'String', 'Dynamic Programming'], hasSolution: True, hasVideoSolution: False, 839: questionNo: 839, acRate: 55.00439458876616, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Similar String Groups, slug: similar-string-groups, url: https://leetcode.com/problems/similar-string-groups, topics: ['Array', 'Hash Table', 'String', 'Depth-First Search', 'Breadth-First Search', 'Union Find'], hasSolution: True, hasVideoSolution: False, 840: questionNo: 840, acRate: 39.071547552946775, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Magic Squares In Grid, slug: magic-squares-in-grid, url: https://leetcode.com/problems/magic-squares-in-grid, topics: ['Array', 'Hash Table', 'Math', 'Matrix'], hasSolution: False, hasVideoSolution: False, 841: questionNo: 841, acRate: 73.35389428561004, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Keys and Rooms, slug: keys-and-rooms, url: https://leetcode.com/problems/keys-and-rooms, topics: ['Depth-First Search', 'Breadth-First Search', 'Graph'], hasSolution: True, hasVideoSolution: False, 842: questionNo: 842, acRate: 39.11537410717771, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Split Array into Fibonacci Sequence, slug: split-array-into-fibonacci-sequence, url: https://leetcode.com/problems/split-array-into-fibonacci-sequence, topics: ['String', 'Backtracking'], hasSolution: True, hasVideoSolution: False, 843: questionNo: 843, acRate: 38.93567686255212, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Guess the Word, slug: guess-the-word, url: https://leetcode.com/problems/guess-the-word, topics: ['Array', 'Math', 'String', 'Interactive', 'Game Theory'], hasSolution: False, hasVideoSolution: False, 844: questionNo: 844, acRate: 49.2111639478841, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Backspace String Compare, slug: backspace-string-compare, url: https://leetcode.com/problems/backspace-string-compare, topics: ['Two Pointers', 'String', 'Stack', 'Simulation'], hasSolution: True, hasVideoSolution: False, 845: questionNo: 845, acRate: 40.53373538000473, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Longest Mountain in Array, slug: longest-mountain-in-array, url: https://leetcode.com/problems/longest-mountain-in-array, topics: ['Array', 'Two Pointers', 'Dynamic Programming', 'Enumeration'], hasSolution: True, hasVideoSolution: False, 846: questionNo: 846, acRate: 56.711062380133406, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Hand of Straights, slug: hand-of-straights, url: https://leetcode.com/problems/hand-of-straights, topics: ['Array', 'Hash Table', 'Greedy', 'Sorting'], hasSolution: True, hasVideoSolution: False, 847: questionNo: 847, acRate: 65.39097838833976, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Shortest Path Visiting All Nodes, slug: shortest-path-visiting-all-nodes, url: https://leetcode.com/problems/shortest-path-visiting-all-nodes, topics: ['Dynamic Programming', 'Bit Manipulation', 'Breadth-First Search', 'Graph', 'Bitmask'], hasSolution: True, hasVideoSolution: False, 848: questionNo: 848, acRate: 44.808084262054635, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Shifting Letters, slug: shifting-letters, url: https://leetcode.com/problems/shifting-letters, topics: ['Array', 'String', 'Prefix Sum'], hasSolution: True, hasVideoSolution: False, 849: questionNo: 849, acRate: 48.2352817956157, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximize Distance to Closest Person, slug: maximize-distance-to-closest-person, url: https://leetcode.com/problems/maximize-distance-to-closest-person, topics: ['Array'], hasSolution: True, hasVideoSolution: False, 850: questionNo: 850, acRate: 54.2328528142503, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Rectangle Area II, slug: rectangle-area-ii, url: https://leetcode.com/problems/rectangle-area-ii, topics: ['Array', 'Segment Tree', 'Line Sweep', 'Ordered Set'], hasSolution: True, hasVideoSolution: False, 851: questionNo: 851, acRate: 59.87047077006108, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Loud and Rich, slug: loud-and-rich, url: https://leetcode.com/problems/loud-and-rich, topics: ['Array', 'Depth-First Search', 'Graph', 'Topological Sort'], hasSolution: True, hasVideoSolution: False, 852: questionNo: 852, acRate: 68.29322836738298, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Peak Index in a Mountain Array, slug: peak-index-in-a-mountain-array, url: https://leetcode.com/problems/peak-index-in-a-mountain-array, topics: ['Array', 'Binary Search'], hasSolution: True, hasVideoSolution: False, 853: questionNo: 853, acRate: 51.52968087563613, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Car Fleet, slug: car-fleet, url: https://leetcode.com/problems/car-fleet, topics: ['Array', 'Stack', 'Sorting', 'Monotonic Stack'], hasSolution: False, hasVideoSolution: False, 854: questionNo: 854, acRate: 40.0078537160028, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: K-Similar Strings, slug: k-similar-strings, url: https://leetcode.com/problems/k-similar-strings, topics: ['String', 'Breadth-First Search'], hasSolution: False, hasVideoSolution: False, 855: questionNo: 855, acRate: 43.54177541149041, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Exam Room, slug: exam-room, url: https://leetcode.com/problems/exam-room, topics: ['Design', 'Heap (Priority Queue)', 'Ordered Set'], hasSolution: False, hasVideoSolution: False, 856: questionNo: 856, acRate: 64.08610808506607, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Score of Parentheses, slug: score-of-parentheses, url: https://leetcode.com/problems/score-of-parentheses, topics: ['String', 'Stack'], hasSolution: True, hasVideoSolution: False, 857: questionNo: 857, acRate: 63.39602281486049, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Minimum Cost to Hire K Workers, slug: minimum-cost-to-hire-k-workers, url: https://leetcode.com/problems/minimum-cost-to-hire-k-workers, topics: ['Array', 'Greedy', 'Sorting', 'Heap (Priority Queue)'], hasSolution: True, hasVideoSolution: False, 858: questionNo: 858, acRate: 62.52115453289239, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Mirror Reflection, slug: mirror-reflection, url: https://leetcode.com/problems/mirror-reflection, topics: ['Math', 'Geometry', 'Number Theory'], hasSolution: False, hasVideoSolution: False, 859: questionNo: 859, acRate: 33.14786994312694, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Buddy Strings, slug: buddy-strings, url: https://leetcode.com/problems/buddy-strings, topics: ['Hash Table', 'String'], hasSolution: True, hasVideoSolution: False, 860: questionNo: 860, acRate: 53.80749560783864, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Lemonade Change, slug: lemonade-change, url: https://leetcode.com/problems/lemonade-change, topics: ['Array', 'Greedy'], hasSolution: True, hasVideoSolution: False, 861: questionNo: 861, acRate: 80.38625049561655, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Score After Flipping Matrix, slug: score-after-flipping-matrix, url: https://leetcode.com/problems/score-after-flipping-matrix, topics: ['Array', 'Greedy', 'Bit Manipulation', 'Matrix'], hasSolution: True, hasVideoSolution: False, 862: questionNo: 862, acRate: 26.060265422450808, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Shortest Subarray with Sum at Least K, slug: shortest-subarray-with-sum-at-least-k, url: https://leetcode.com/problems/shortest-subarray-with-sum-at-least-k, topics: ['Array', 'Binary Search', 'Queue', 'Sliding Window', 'Heap (Priority Queue)', 'Prefix Sum', 'Monotonic Queue'], hasSolution: True, hasVideoSolution: False, 863: questionNo: 863, acRate: 64.75399527166716, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: All Nodes Distance K in Binary Tree, slug: all-nodes-distance-k-in-binary-tree, url: https://leetcode.com/problems/all-nodes-distance-k-in-binary-tree, topics: ['Hash Table', 'Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 864: questionNo: 864, acRate: 53.512110726643606, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Shortest Path to Get All Keys, slug: shortest-path-to-get-all-keys, url: https://leetcode.com/problems/shortest-path-to-get-all-keys, topics: ['Array', 'Bit Manipulation', 'Breadth-First Search', 'Matrix'], hasSolution: True, hasVideoSolution: False, 865: questionNo: 865, acRate: 70.85593897858519, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Smallest Subtree with all the Deepest Nodes, slug: smallest-subtree-with-all-the-deepest-nodes, url: https://leetcode.com/problems/smallest-subtree-with-all-the-deepest-nodes, topics: ['Hash Table', 'Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 866: questionNo: 866, acRate: 26.051799703739903, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Prime Palindrome, slug: prime-palindrome, url: https://leetcode.com/problems/prime-palindrome, topics: ['Math', 'Number Theory'], hasSolution: False, hasVideoSolution: False, 867: questionNo: 867, acRate: 72.06766641130852, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Transpose Matrix, slug: transpose-matrix, url: https://leetcode.com/problems/transpose-matrix, topics: ['Array', 'Matrix', 'Simulation'], hasSolution: True, hasVideoSolution: False, 868: questionNo: 868, acRate: 63.636018928593096, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Binary Gap, slug: binary-gap, url: https://leetcode.com/problems/binary-gap, topics: ['Bit Manipulation'], hasSolution: True, hasVideoSolution: False, 869: questionNo: 869, acRate: 62.612521187719075, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Reordered Power of 2, slug: reordered-power-of-2, url: https://leetcode.com/problems/reordered-power-of-2, topics: ['Hash Table', 'Math', 'Sorting', 'Counting', 'Enumeration'], hasSolution: True, hasVideoSolution: False, 870: questionNo: 870, acRate: 52.622411457325335, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Advantage Shuffle, slug: advantage-shuffle, url: https://leetcode.com/problems/advantage-shuffle, topics: ['Array', 'Two Pointers', 'Greedy', 'Sorting'], hasSolution: True, hasVideoSolution: False, 871: questionNo: 871, acRate: 40.07414663465011, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Minimum Number of Refueling Stops, slug: minimum-number-of-refueling-stops, url: https://leetcode.com/problems/minimum-number-of-refueling-stops, topics: ['Array', 'Dynamic Programming', 'Greedy', 'Heap (Priority Queue)'], hasSolution: True, hasVideoSolution: False, 872: questionNo: 872, acRate: 70.04541686446503, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Leaf-Similar Trees, slug: leaf-similar-trees, url: https://leetcode.com/problems/leaf-similar-trees, topics: ['Tree', 'Depth-First Search', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 873: questionNo: 873, acRate: 48.404488700165835, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Length of Longest Fibonacci Subsequence, slug: length-of-longest-fibonacci-subsequence, url: https://leetcode.com/problems/length-of-longest-fibonacci-subsequence, topics: ['Array', 'Hash Table', 'Dynamic Programming'], hasSolution: True, hasVideoSolution: False, 874: questionNo: 874, acRate: 40.40592535590612, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Walking Robot Simulation, slug: walking-robot-simulation, url: https://leetcode.com/problems/walking-robot-simulation, topics: ['Array', 'Hash Table', 'Simulation'], hasSolution: False, hasVideoSolution: False, 875: questionNo: 875, acRate: 48.47221671546586, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Koko Eating Bananas, slug: koko-eating-bananas, url: https://leetcode.com/problems/koko-eating-bananas, topics: ['Array', 'Binary Search'], hasSolution: True, hasVideoSolution: False, 876: questionNo: 876, acRate: 78.95722914422939, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Middle of the Linked List, slug: middle-of-the-linked-list, url: https://leetcode.com/problems/middle-of-the-linked-list, topics: ['Linked List', 'Two Pointers'], hasSolution: True, hasVideoSolution: True, 877: questionNo: 877, acRate: 70.72621807028634, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Stone Game, slug: stone-game, url: https://leetcode.com/problems/stone-game, topics: ['Array', 'Math', 'Dynamic Programming', 'Game Theory'], hasSolution: True, hasVideoSolution: False, 878: questionNo: 878, acRate: 35.47798764852468, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Nth Magical Number, slug: nth-magical-number, url: https://leetcode.com/problems/nth-magical-number, topics: ['Math', 'Binary Search'], hasSolution: True, hasVideoSolution: False, 879: questionNo: 879, acRate: 48.25425246195166, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Profitable Schemes, slug: profitable-schemes, url: https://leetcode.com/problems/profitable-schemes, topics: ['Array', 'Dynamic Programming'], hasSolution: True, hasVideoSolution: False, 880: questionNo: 880, acRate: 36.470193865579084, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Decoded String at Index, slug: decoded-string-at-index, url: https://leetcode.com/problems/decoded-string-at-index, topics: ['String', 'Stack'], hasSolution: True, hasVideoSolution: False, 881: questionNo: 881, acRate: 59.4796240009006, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Boats to Save People, slug: boats-to-save-people, url: https://leetcode.com/problems/boats-to-save-people, topics: ['Array', 'Two Pointers', 'Greedy', 'Sorting'], hasSolution: True, hasVideoSolution: False, 882: questionNo: 882, acRate: 50.528356934462394, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Reachable Nodes In Subdivided Graph, slug: reachable-nodes-in-subdivided-graph, url: https://leetcode.com/problems/reachable-nodes-in-subdivided-graph, topics: ['Graph', 'Heap (Priority Queue)', 'Shortest Path'], hasSolution: True, hasVideoSolution: False, 883: questionNo: 883, acRate: 72.92741001056827, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Projection Area of 3D Shapes, slug: projection-area-of-3d-shapes, url: https://leetcode.com/problems/projection-area-of-3d-shapes, topics: ['Array', 'Math', 'Geometry', 'Matrix'], hasSolution: True, hasVideoSolution: False, 884: questionNo: 884, acRate: 67.53351067096939, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Uncommon Words from Two Sentences, slug: uncommon-words-from-two-sentences, url: https://leetcode.com/problems/uncommon-words-from-two-sentences, topics: ['Hash Table', 'String'], hasSolution: True, hasVideoSolution: False, 885: questionNo: 885, acRate: 74.6929650384621, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Spiral Matrix III, slug: spiral-matrix-iii, url: https://leetcode.com/problems/spiral-matrix-iii, topics: ['Array', 'Matrix', 'Simulation'], hasSolution: False, hasVideoSolution: False, 886: questionNo: 886, acRate: 50.69038888134365, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Possible Bipartition, slug: possible-bipartition, url: https://leetcode.com/problems/possible-bipartition, topics: ['Depth-First Search', 'Breadth-First Search', 'Union Find', 'Graph'], hasSolution: True, hasVideoSolution: False, 887: questionNo: 887, acRate: 27.808785005280622, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Super Egg Drop, slug: super-egg-drop, url: https://leetcode.com/problems/super-egg-drop, topics: ['Math', 'Binary Search', 'Dynamic Programming'], hasSolution: True, hasVideoSolution: False, 888: questionNo: 888, acRate: 61.95439803536539, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Fair Candy Swap, slug: fair-candy-swap, url: https://leetcode.com/problems/fair-candy-swap, topics: ['Array', 'Hash Table', 'Binary Search', 'Sorting'], hasSolution: True, hasVideoSolution: False, 889: questionNo: 889, acRate: 71.52186942414076, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Construct Binary Tree from Preorder and Postorder Traversal, slug: construct-binary-tree-from-preorder-and-postorder-traversal, url: https://leetcode.com/problems/construct-binary-tree-from-preorder-and-postorder-traversal, topics: ['Array', 'Hash Table', 'Divide and Conquer', 'Tree', 'Binary Tree'], hasSolution: False, hasVideoSolution: False, 890: questionNo: 890, acRate: 76.8077680329336, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Find and Replace Pattern, slug: find-and-replace-pattern, url: https://leetcode.com/problems/find-and-replace-pattern, topics: ['Array', 'Hash Table', 'String'], hasSolution: True, hasVideoSolution: False, 891: questionNo: 891, acRate: 37.96918841653872, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Sum of Subsequence Widths, slug: sum-of-subsequence-widths, url: https://leetcode.com/problems/sum-of-subsequence-widths, topics: ['Array', 'Math', 'Sorting'], hasSolution: True, hasVideoSolution: False, 892: questionNo: 892, acRate: 66.31268531648833, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Surface Area of 3D Shapes, slug: surface-area-of-3d-shapes, url: https://leetcode.com/problems/surface-area-of-3d-shapes, topics: ['Array', 'Math', 'Geometry', 'Matrix'], hasSolution: False, hasVideoSolution: False, 893: questionNo: 893, acRate: 71.88307215429653, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Groups of Special-Equivalent Strings, slug: groups-of-special-equivalent-strings, url: https://leetcode.com/problems/groups-of-special-equivalent-strings, topics: ['Array', 'Hash Table', 'String', 'Sorting'], hasSolution: False, hasVideoSolution: False, 894: questionNo: 894, acRate: 82.73829325739531, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: All Possible Full Binary Trees, slug: all-possible-full-binary-trees, url: https://leetcode.com/problems/all-possible-full-binary-trees, topics: ['Dynamic Programming', 'Tree', 'Recursion', 'Memoization', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 895: questionNo: 895, acRate: 66.42646761247386, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Maximum Frequency Stack, slug: maximum-frequency-stack, url: https://leetcode.com/problems/maximum-frequency-stack, topics: ['Hash Table', 'Stack', 'Design', 'Ordered Set'], hasSolution: True, hasVideoSolution: False, 896: questionNo: 896, acRate: 61.24841466318862, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Monotonic Array, slug: monotonic-array, url: https://leetcode.com/problems/monotonic-array, topics: ['Array'], hasSolution: True, hasVideoSolution: False, 897: questionNo: 897, acRate: 78.34409038630675, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Increasing Order Search Tree, slug: increasing-order-search-tree, url: https://leetcode.com/problems/increasing-order-search-tree, topics: ['Stack', 'Tree', 'Depth-First Search', 'Binary Search Tree', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 898: questionNo: 898, acRate: 39.191727339875484, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Bitwise ORs of Subarrays, slug: bitwise-ors-of-subarrays, url: https://leetcode.com/problems/bitwise-ors-of-subarrays, topics: ['Array', 'Dynamic Programming', 'Bit Manipulation'], hasSolution: False, hasVideoSolution: False, 899: questionNo: 899, acRate: 65.94990745993806, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Orderly Queue, slug: orderly-queue, url: https://leetcode.com/problems/orderly-queue, topics: ['Math', 'String', 'Sorting'], hasSolution: True, hasVideoSolution: False, 900: questionNo: 900, acRate: 59.59180747078364, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: RLE Iterator, slug: rle-iterator, url: https://leetcode.com/problems/rle-iterator, topics: ['Array', 'Design', 'Counting', 'Iterator'], hasSolution: False, hasVideoSolution: False, 901: questionNo: 901, acRate: 66.18842886212657, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Online Stock Span, slug: online-stock-span, url: https://leetcode.com/problems/online-stock-span, topics: ['Stack', 'Design', 'Monotonic Stack', 'Data Stream'], hasSolution: True, hasVideoSolution: False, 902: questionNo: 902, acRate: 42.57262116118309, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Numbers At Most N Given Digit Set, slug: numbers-at-most-n-given-digit-set, url: https://leetcode.com/problems/numbers-at-most-n-given-digit-set, topics: ['Array', 'Math', 'String', 'Binary Search', 'Dynamic Programming'], hasSolution: True, hasVideoSolution: False, 903: questionNo: 903, acRate: 57.256020278833965, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Valid Permutations for DI Sequence, slug: valid-permutations-for-di-sequence, url: https://leetcode.com/problems/valid-permutations-for-di-sequence, topics: ['String', 'Dynamic Programming', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 904: questionNo: 904, acRate: 44.6327963721098, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Fruit Into Baskets, slug: fruit-into-baskets, url: https://leetcode.com/problems/fruit-into-baskets, topics: ['Array', 'Hash Table', 'Sliding Window'], hasSolution: True, hasVideoSolution: False, 905: questionNo: 905, acRate: 76.24203857335716, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Sort Array By Parity, slug: sort-array-by-parity, url: https://leetcode.com/problems/sort-array-by-parity, topics: ['Array', 'Two Pointers', 'Sorting'], hasSolution: True, hasVideoSolution: False, 906: questionNo: 906, acRate: 38.953985495772244, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Super Palindromes, slug: super-palindromes, url: https://leetcode.com/problems/super-palindromes, topics: ['Math', 'Enumeration'], hasSolution: True, hasVideoSolution: False, 907: questionNo: 907, acRate: 37.27241846880334, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Sum of Subarray Minimums, slug: sum-of-subarray-minimums, url: https://leetcode.com/problems/sum-of-subarray-minimums, topics: ['Array', 'Dynamic Programming', 'Stack', 'Monotonic Stack'], hasSolution: True, hasVideoSolution: False, 908: questionNo: 908, acRate: 70.3128449936426, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Smallest Range I, slug: smallest-range-i, url: https://leetcode.com/problems/smallest-range-i, topics: ['Array', 'Math'], hasSolution: False, hasVideoSolution: False, 909: questionNo: 909, acRate: 43.81971333316892, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Snakes and Ladders, slug: snakes-and-ladders, url: https://leetcode.com/problems/snakes-and-ladders, topics: ['Array', 'Breadth-First Search', 'Matrix'], hasSolution: True, hasVideoSolution: False, 910: questionNo: 910, acRate: 36.37043450881612, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Smallest Range II, slug: smallest-range-ii, url: https://leetcode.com/problems/smallest-range-ii, topics: ['Array', 'Math', 'Greedy', 'Sorting'], hasSolution: True, hasVideoSolution: False, 911: questionNo: 911, acRate: 52.04720554510551, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Online Election, slug: online-election, url: https://leetcode.com/problems/online-election, topics: ['Array', 'Hash Table', 'Binary Search', 'Design'], hasSolution: False, hasVideoSolution: False, 912: questionNo: 912, acRate: 58.09562602213634, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Sort an Array, slug: sort-an-array, url: https://leetcode.com/problems/sort-an-array, topics: ['Array', 'Divide and Conquer', 'Sorting', 'Heap (Priority Queue)', 'Merge Sort', 'Bucket Sort', 'Radix Sort', 'Counting Sort'], hasSolution: True, hasVideoSolution: False, 913: questionNo: 913, acRate: 33.854306864064604, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Cat and Mouse, slug: cat-and-mouse, url: https://leetcode.com/problems/cat-and-mouse, topics: ['Math', 'Dynamic Programming', 'Graph', 'Topological Sort', 'Memoization', 'Game Theory'], hasSolution: True, hasVideoSolution: False, 914: questionNo: 914, acRate: 29.91773144766307, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: X of a Kind in a Deck of Cards, slug: x-of-a-kind-in-a-deck-of-cards, url: https://leetcode.com/problems/x-of-a-kind-in-a-deck-of-cards, topics: ['Array', 'Hash Table', 'Math', 'Counting', 'Number Theory'], hasSolution: True, hasVideoSolution: False, 915: questionNo: 915, acRate: 48.78862707185538, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Partition Array into Disjoint Intervals, slug: partition-array-into-disjoint-intervals, url: https://leetcode.com/problems/partition-array-into-disjoint-intervals, topics: ['Array'], hasSolution: True, hasVideoSolution: False, 916: questionNo: 916, acRate: 51.97730941623152, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Word Subsets, slug: word-subsets, url: https://leetcode.com/problems/word-subsets, topics: ['Array', 'Hash Table', 'String'], hasSolution: True, hasVideoSolution: False, 917: questionNo: 917, acRate: 65.09253736504067, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Reverse Only Letters, slug: reverse-only-letters, url: https://leetcode.com/problems/reverse-only-letters, topics: ['Two Pointers', 'String'], hasSolution: True, hasVideoSolution: False, 918: questionNo: 918, acRate: 45.31276467833383, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum Sum Circular Subarray, slug: maximum-sum-circular-subarray, url: https://leetcode.com/problems/maximum-sum-circular-subarray, topics: ['Array', 'Divide and Conquer', 'Dynamic Programming', 'Queue', 'Monotonic Queue'], hasSolution: True, hasVideoSolution: False, 919: questionNo: 919, acRate: 65.81111708217482, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Complete Binary Tree Inserter, slug: complete-binary-tree-inserter, url: https://leetcode.com/problems/complete-binary-tree-inserter, topics: ['Tree', 'Breadth-First Search', 'Design', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 920: questionNo: 920, acRate: 60.426754276573234, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Number of Music Playlists, slug: number-of-music-playlists, url: https://leetcode.com/problems/number-of-music-playlists, topics: ['Math', 'Dynamic Programming', 'Combinatorics'], hasSolution: True, hasVideoSolution: False, 921: questionNo: 921, acRate: 74.97242915982085, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Add to Make Parentheses Valid, slug: minimum-add-to-make-parentheses-valid, url: https://leetcode.com/problems/minimum-add-to-make-parentheses-valid, topics: ['String', 'Stack', 'Greedy'], hasSolution: True, hasVideoSolution: False, 922: questionNo: 922, acRate: 70.80886068383963, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Sort Array By Parity II, slug: sort-array-by-parity-ii, url: https://leetcode.com/problems/sort-array-by-parity-ii, topics: ['Array', 'Two Pointers', 'Sorting'], hasSolution: True, hasVideoSolution: True, 923: questionNo: 923, acRate: 45.46923517003742, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: 3Sum With Multiplicity, slug: 3sum-with-multiplicity, url: https://leetcode.com/problems/3sum-with-multiplicity, topics: ['Array', 'Hash Table', 'Two Pointers', 'Sorting', 'Counting'], hasSolution: True, hasVideoSolution: False, 924: questionNo: 924, acRate: 42.068970958350754, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Minimize Malware Spread, slug: minimize-malware-spread, url: https://leetcode.com/problems/minimize-malware-spread, topics: ['Array', 'Hash Table', 'Depth-First Search', 'Breadth-First Search', 'Union Find', 'Graph'], hasSolution: True, hasVideoSolution: False, 925: questionNo: 925, acRate: 32.300096526167465, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Long Pressed Name, slug: long-pressed-name, url: https://leetcode.com/problems/long-pressed-name, topics: ['Two Pointers', 'String'], hasSolution: False, hasVideoSolution: False, 926: questionNo: 926, acRate: 61.455141952614376, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Flip String to Monotone Increasing, slug: flip-string-to-monotone-increasing, url: https://leetcode.com/problems/flip-string-to-monotone-increasing, topics: ['String', 'Dynamic Programming'], hasSolution: True, hasVideoSolution: False, 927: questionNo: 927, acRate: 39.958843393837064, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Three Equal Parts, slug: three-equal-parts, url: https://leetcode.com/problems/three-equal-parts, topics: ['Array', 'Math'], hasSolution: True, hasVideoSolution: False, 928: questionNo: 928, acRate: 44.01052928457272, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Minimize Malware Spread II, slug: minimize-malware-spread-ii, url: https://leetcode.com/problems/minimize-malware-spread-ii, topics: ['Array', 'Hash Table', 'Depth-First Search', 'Breadth-First Search', 'Union Find', 'Graph'], hasSolution: False, hasVideoSolution: False, 929: questionNo: 929, acRate: 67.24321780548777, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Unique Email Addresses, slug: unique-email-addresses, url: https://leetcode.com/problems/unique-email-addresses, topics: ['Array', 'Hash Table', 'String'], hasSolution: True, hasVideoSolution: False, 930: questionNo: 930, acRate: 63.308287656269556, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Binary Subarrays With Sum, slug: binary-subarrays-with-sum, url: https://leetcode.com/problems/binary-subarrays-with-sum, topics: ['Array', 'Hash Table', 'Sliding Window', 'Prefix Sum'], hasSolution: True, hasVideoSolution: False, 931: questionNo: 931, acRate: 63.368018066338905, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Falling Path Sum, slug: minimum-falling-path-sum, url: https://leetcode.com/problems/minimum-falling-path-sum, topics: ['Array', 'Dynamic Programming', 'Matrix'], hasSolution: True, hasVideoSolution: False, 932: questionNo: 932, acRate: 65.92099487929774, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Beautiful Array, slug: beautiful-array, url: https://leetcode.com/problems/beautiful-array, topics: ['Array', 'Math', 'Divide and Conquer'], hasSolution: True, hasVideoSolution: False, 933: questionNo: 933, acRate: 75.78034121752617, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Number of Recent Calls, slug: number-of-recent-calls, url: https://leetcode.com/problems/number-of-recent-calls, topics: ['Design', 'Queue', 'Data Stream'], hasSolution: True, hasVideoSolution: False, 934: questionNo: 934, acRate: 57.80003090541839, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Shortest Bridge, slug: shortest-bridge, url: https://leetcode.com/problems/shortest-bridge, topics: ['Array', 'Depth-First Search', 'Breadth-First Search', 'Matrix'], hasSolution: True, hasVideoSolution: False, 935: questionNo: 935, acRate: 60.366331572669964, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Knight Dialer, slug: knight-dialer, url: https://leetcode.com/problems/knight-dialer, topics: ['Dynamic Programming'], hasSolution: True, hasVideoSolution: False, 936: questionNo: 936, acRate: 62.51806358381503, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Stamping The Sequence, slug: stamping-the-sequence, url: https://leetcode.com/problems/stamping-the-sequence, topics: ['String', 'Stack', 'Greedy', 'Queue'], hasSolution: True, hasVideoSolution: False, 937: questionNo: 937, acRate: 56.47691817306926, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Reorder Data in Log Files, slug: reorder-data-in-log-files, url: https://leetcode.com/problems/reorder-data-in-log-files, topics: ['Array', 'String', 'Sorting'], hasSolution: True, hasVideoSolution: False, 938: questionNo: 938, acRate: 86.94050768531415, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Range Sum of BST, slug: range-sum-of-bst, url: https://leetcode.com/problems/range-sum-of-bst, topics: ['Tree', 'Depth-First Search', 'Binary Search Tree', 'Binary Tree'], hasSolution: True, hasVideoSolution: True, 939: questionNo: 939, acRate: 54.042686870553446, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Area Rectangle, slug: minimum-area-rectangle, url: https://leetcode.com/problems/minimum-area-rectangle, topics: ['Array', 'Hash Table', 'Math', 'Geometry', 'Sorting'], hasSolution: False, hasVideoSolution: False, 940: questionNo: 940, acRate: 43.12212510272255, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Distinct Subsequences II, slug: distinct-subsequences-ii, url: https://leetcode.com/problems/distinct-subsequences-ii, topics: ['String', 'Dynamic Programming'], hasSolution: True, hasVideoSolution: False, 941: questionNo: 941, acRate: 33.518721701101825, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Valid Mountain Array, slug: valid-mountain-array, url: https://leetcode.com/problems/valid-mountain-array, topics: ['Array'], hasSolution: True, hasVideoSolution: False, 942: questionNo: 942, acRate: 78.95120533559262, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: DI String Match, slug: di-string-match, url: https://leetcode.com/problems/di-string-match, topics: ['Array', 'Two Pointers', 'String', 'Greedy'], hasSolution: True, hasVideoSolution: False, 943: questionNo: 943, acRate: 43.91746411483254, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Find the Shortest Superstring, slug: find-the-shortest-superstring, url: https://leetcode.com/problems/find-the-shortest-superstring, topics: ['Array', 'String', 'Dynamic Programming', 'Bit Manipulation', 'Bitmask'], hasSolution: True, hasVideoSolution: False, 944: questionNo: 944, acRate: 74.61567464404962, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Delete Columns to Make Sorted, slug: delete-columns-to-make-sorted, url: https://leetcode.com/problems/delete-columns-to-make-sorted, topics: ['Array', 'String'], hasSolution: True, hasVideoSolution: False, 945: questionNo: 945, acRate: 60.016260532103196, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Increment to Make Array Unique, slug: minimum-increment-to-make-array-unique, url: https://leetcode.com/problems/minimum-increment-to-make-array-unique, topics: ['Array', 'Greedy', 'Sorting', 'Counting'], hasSolution: True, hasVideoSolution: False, 946: questionNo: 946, acRate: 69.52485309969137, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Validate Stack Sequences, slug: validate-stack-sequences, url: https://leetcode.com/problems/validate-stack-sequences, topics: ['Array', 'Stack', 'Simulation'], hasSolution: True, hasVideoSolution: False, 947: questionNo: 947, acRate: 58.9323257539977, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Most Stones Removed with Same Row or Column, slug: most-stones-removed-with-same-row-or-column, url: https://leetcode.com/problems/most-stones-removed-with-same-row-or-column, topics: ['Hash Table', 'Depth-First Search', 'Union Find', 'Graph'], hasSolution: True, hasVideoSolution: False, 948: questionNo: 948, acRate: 58.97394746696625, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Bag of Tokens, slug: bag-of-tokens, url: https://leetcode.com/problems/bag-of-tokens, topics: ['Array', 'Two Pointers', 'Greedy', 'Sorting'], hasSolution: True, hasVideoSolution: False, 949: questionNo: 949, acRate: 35.31226548820145, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Largest Time for Given Digits, slug: largest-time-for-given-digits, url: https://leetcode.com/problems/largest-time-for-given-digits, topics: ['Array', 'String', 'Enumeration'], hasSolution: True, hasVideoSolution: False, 950: questionNo: 950, acRate: 83.0105174379037, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Reveal Cards In Increasing Order, slug: reveal-cards-in-increasing-order, url: https://leetcode.com/problems/reveal-cards-in-increasing-order, topics: ['Array', 'Queue', 'Sorting', 'Simulation'], hasSolution: True, hasVideoSolution: False, 951: questionNo: 951, acRate: 67.01232442513663, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Flip Equivalent Binary Trees, slug: flip-equivalent-binary-trees, url: https://leetcode.com/problems/flip-equivalent-binary-trees, topics: ['Tree', 'Depth-First Search', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 952: questionNo: 952, acRate: 40.81065492108437, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Largest Component Size by Common Factor, slug: largest-component-size-by-common-factor, url: https://leetcode.com/problems/largest-component-size-by-common-factor, topics: ['Array', 'Hash Table', 'Math', 'Union Find', 'Number Theory'], hasSolution: True, hasVideoSolution: False, 953: questionNo: 953, acRate: 55.12034909983616, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Verifying an Alien Dictionary, slug: verifying-an-alien-dictionary, url: https://leetcode.com/problems/verifying-an-alien-dictionary, topics: ['Array', 'Hash Table', 'String'], hasSolution: True, hasVideoSolution: False, 954: questionNo: 954, acRate: 39.19907891428345, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Array of Doubled Pairs, slug: array-of-doubled-pairs, url: https://leetcode.com/problems/array-of-doubled-pairs, topics: ['Array', 'Hash Table', 'Greedy', 'Sorting'], hasSolution: True, hasVideoSolution: False, 955: questionNo: 955, acRate: 35.298653233268226, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Delete Columns to Make Sorted II, slug: delete-columns-to-make-sorted-ii, url: https://leetcode.com/problems/delete-columns-to-make-sorted-ii, topics: ['Array', 'String', 'Greedy'], hasSolution: False, hasVideoSolution: False, 956: questionNo: 956, acRate: 52.179843659828975, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Tallest Billboard, slug: tallest-billboard, url: https://leetcode.com/problems/tallest-billboard, topics: ['Array', 'Dynamic Programming'], hasSolution: True, hasVideoSolution: False, 957: questionNo: 957, acRate: 38.98566612898552, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Prison Cells After N Days, slug: prison-cells-after-n-days, url: https://leetcode.com/problems/prison-cells-after-n-days, topics: ['Array', 'Hash Table', 'Math', 'Bit Manipulation'], hasSolution: True, hasVideoSolution: False, 958: questionNo: 958, acRate: 57.114160016127315, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Check Completeness of a Binary Tree, slug: check-completeness-of-a-binary-tree, url: https://leetcode.com/problems/check-completeness-of-a-binary-tree, topics: ['Tree', 'Breadth-First Search', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 959: questionNo: 959, acRate: 69.47414853232102, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Regions Cut By Slashes, slug: regions-cut-by-slashes, url: https://leetcode.com/problems/regions-cut-by-slashes, topics: ['Array', 'Hash Table', 'Depth-First Search', 'Breadth-First Search', 'Union Find', 'Matrix'], hasSolution: True, hasVideoSolution: False, 960: questionNo: 960, acRate: 58.235960764390946, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Delete Columns to Make Sorted III, slug: delete-columns-to-make-sorted-iii, url: https://leetcode.com/problems/delete-columns-to-make-sorted-iii, topics: ['Array', 'String', 'Dynamic Programming'], hasSolution: True, hasVideoSolution: False, 961: questionNo: 961, acRate: 76.8593695623717, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: N-Repeated Element in Size 2N Array, slug: n-repeated-element-in-size-2n-array, url: https://leetcode.com/problems/n-repeated-element-in-size-2n-array, topics: ['Array', 'Hash Table'], hasSolution: True, hasVideoSolution: False, 962: questionNo: 962, acRate: 50.35911175227987, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum Width Ramp, slug: maximum-width-ramp, url: https://leetcode.com/problems/maximum-width-ramp, topics: ['Array', 'Stack', 'Monotonic Stack'], hasSolution: False, hasVideoSolution: False, 963: questionNo: 963, acRate: 55.13853335341064, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Area Rectangle II, slug: minimum-area-rectangle-ii, url: https://leetcode.com/problems/minimum-area-rectangle-ii, topics: ['Array', 'Math', 'Geometry'], hasSolution: False, hasVideoSolution: False, 964: questionNo: 964, acRate: 48.57445069474494, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Least Operators to Express Number, slug: least-operators-to-express-number, url: https://leetcode.com/problems/least-operators-to-express-number, topics: ['Math', 'Dynamic Programming', 'Memoization'], hasSolution: False, hasVideoSolution: False, 965: questionNo: 965, acRate: 71.13915422555878, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Univalued Binary Tree, slug: univalued-binary-tree, url: https://leetcode.com/problems/univalued-binary-tree, topics: ['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 966: questionNo: 966, acRate: 51.352870038967545, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Vowel Spellchecker, slug: vowel-spellchecker, url: https://leetcode.com/problems/vowel-spellchecker, topics: ['Array', 'Hash Table', 'String'], hasSolution: True, hasVideoSolution: False, 967: questionNo: 967, acRate: 58.16247439822292, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Numbers With Same Consecutive Differences, slug: numbers-with-same-consecutive-differences, url: https://leetcode.com/problems/numbers-with-same-consecutive-differences, topics: ['Backtracking', 'Breadth-First Search'], hasSolution: True, hasVideoSolution: False, 968: questionNo: 968, acRate: 46.75528547091115, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Binary Tree Cameras, slug: binary-tree-cameras, url: https://leetcode.com/problems/binary-tree-cameras, topics: ['Dynamic Programming', 'Tree', 'Depth-First Search', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 969: questionNo: 969, acRate: 70.84256060471846, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Pancake Sorting, slug: pancake-sorting, url: https://leetcode.com/problems/pancake-sorting, topics: ['Array', 'Two Pointers', 'Greedy', 'Sorting'], hasSolution: True, hasVideoSolution: False, 970: questionNo: 970, acRate: 43.851197644854814, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Powerful Integers, slug: powerful-integers, url: https://leetcode.com/problems/powerful-integers, topics: ['Hash Table', 'Math', 'Enumeration'], hasSolution: True, hasVideoSolution: False, 971: questionNo: 971, acRate: 50.61634922512718, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Flip Binary Tree To Match Preorder Traversal, slug: flip-binary-tree-to-match-preorder-traversal, url: https://leetcode.com/problems/flip-binary-tree-to-match-preorder-traversal, topics: ['Tree', 'Depth-First Search', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 972: questionNo: 972, acRate: 44.07124978171023, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Equal Rational Numbers, slug: equal-rational-numbers, url: https://leetcode.com/problems/equal-rational-numbers, topics: ['Math', 'String'], hasSolution: True, hasVideoSolution: False, 973: questionNo: 973, acRate: 66.63785050360399, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: K Closest Points to Origin, slug: k-closest-points-to-origin, url: https://leetcode.com/problems/k-closest-points-to-origin, topics: ['Array', 'Math', 'Divide and Conquer', 'Geometry', 'Sorting', 'Heap (Priority Queue)', 'Quickselect'], hasSolution: True, hasVideoSolution: False, 974: questionNo: 974, acRate: 55.489935951790194, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Subarray Sums Divisible by K, slug: subarray-sums-divisible-by-k, url: https://leetcode.com/problems/subarray-sums-divisible-by-k, topics: ['Array', 'Hash Table', 'Prefix Sum'], hasSolution: True, hasVideoSolution: False, 975: questionNo: 975, acRate: 40.14930306870145, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Odd Even Jump, slug: odd-even-jump, url: https://leetcode.com/problems/odd-even-jump, topics: ['Array', 'Dynamic Programming', 'Stack', 'Monotonic Stack', 'Ordered Set'], hasSolution: False, hasVideoSolution: False, 976: questionNo: 976, acRate: 56.21194422471992, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Largest Perimeter Triangle, slug: largest-perimeter-triangle, url: https://leetcode.com/problems/largest-perimeter-triangle, topics: ['Array', 'Math', 'Greedy', 'Sorting'], hasSolution: True, hasVideoSolution: False, 977: questionNo: 977, acRate: 72.89793918087214, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Squares of a Sorted Array, slug: squares-of-a-sorted-array, url: https://leetcode.com/problems/squares-of-a-sorted-array, topics: ['Array', 'Two Pointers', 'Sorting'], hasSolution: True, hasVideoSolution: True, 978: questionNo: 978, acRate: 47.54801168380138, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Longest Turbulent Subarray, slug: longest-turbulent-subarray, url: https://leetcode.com/problems/longest-turbulent-subarray, topics: ['Array', 'Dynamic Programming', 'Sliding Window'], hasSolution: True, hasVideoSolution: False, 979: questionNo: 979, acRate: 77.09945621120305, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Distribute Coins in Binary Tree, slug: distribute-coins-in-binary-tree, url: https://leetcode.com/problems/distribute-coins-in-binary-tree, topics: ['Tree', 'Depth-First Search', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 980: questionNo: 980, acRate: 81.8743083696232, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Unique Paths III, slug: unique-paths-iii, url: https://leetcode.com/problems/unique-paths-iii, topics: ['Array', 'Backtracking', 'Bit Manipulation', 'Matrix'], hasSolution: True, hasVideoSolution: False, 981: questionNo: 981, acRate: 49.304653944551106, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Time Based Key-Value Store, slug: time-based-key-value-store, url: https://leetcode.com/problems/time-based-key-value-store, topics: ['Hash Table', 'String', 'Binary Search', 'Design'], hasSolution: True, hasVideoSolution: False, 982: questionNo: 982, acRate: 58.265702466289824, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Triples with Bitwise AND Equal To Zero, slug: triples-with-bitwise-and-equal-to-zero, url: https://leetcode.com/problems/triples-with-bitwise-and-equal-to-zero, topics: ['Array', 'Hash Table', 'Bit Manipulation'], hasSolution: False, hasVideoSolution: False, 983: questionNo: 983, acRate: 65.2284973924734, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Cost For Tickets, slug: minimum-cost-for-tickets, url: https://leetcode.com/problems/minimum-cost-for-tickets, topics: ['Array', 'Dynamic Programming'], hasSolution: True, hasVideoSolution: False, 984: questionNo: 984, acRate: 44.00524981897176, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: String Without AAA or BBB, slug: string-without-aaa-or-bbb, url: https://leetcode.com/problems/string-without-aaa-or-bbb, topics: ['String', 'Greedy'], hasSolution: True, hasVideoSolution: False, 985: questionNo: 985, acRate: 68.17676446455535, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Sum of Even Numbers After Queries, slug: sum-of-even-numbers-after-queries, url: https://leetcode.com/problems/sum-of-even-numbers-after-queries, topics: ['Array', 'Simulation'], hasSolution: True, hasVideoSolution: False, 986: questionNo: 986, acRate: 71.80177999962768, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Interval List Intersections, slug: interval-list-intersections, url: https://leetcode.com/problems/interval-list-intersections, topics: ['Array', 'Two Pointers'], hasSolution: True, hasVideoSolution: False, 987: questionNo: 987, acRate: 48.29017459364403, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Vertical Order Traversal of a Binary Tree, slug: vertical-order-traversal-of-a-binary-tree, url: https://leetcode.com/problems/vertical-order-traversal-of-a-binary-tree, topics: ['Hash Table', 'Tree', 'Depth-First Search', 'Breadth-First Search', 'Sorting', 'Binary Tree'], hasSolution: True, hasVideoSolution: True, 988: questionNo: 988, acRate: 60.51955286045245, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Smallest String Starting From Leaf, slug: smallest-string-starting-from-leaf, url: https://leetcode.com/problems/smallest-string-starting-from-leaf, topics: ['String', 'Backtracking', 'Tree', 'Depth-First Search', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 989: questionNo: 989, acRate: 45.1818886765116, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Add to Array-Form of Integer, slug: add-to-array-form-of-integer, url: https://leetcode.com/problems/add-to-array-form-of-integer, topics: ['Array', 'Math'], hasSolution: True, hasVideoSolution: False, 990: questionNo: 990, acRate: 50.56977787793194, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Satisfiability of Equality Equations, slug: satisfiability-of-equality-equations, url: https://leetcode.com/problems/satisfiability-of-equality-equations, topics: ['Array', 'String', 'Union Find', 'Graph'], hasSolution: True, hasVideoSolution: False, 991: questionNo: 991, acRate: 54.50185841842185, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Broken Calculator, slug: broken-calculator, url: https://leetcode.com/problems/broken-calculator, topics: ['Math', 'Greedy'], hasSolution: True, hasVideoSolution: False, 992: questionNo: 992, acRate: 63.75361426993855, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Subarrays with K Different Integers, slug: subarrays-with-k-different-integers, url: https://leetcode.com/problems/subarrays-with-k-different-integers, topics: ['Array', 'Hash Table', 'Sliding Window', 'Counting'], hasSolution: True, hasVideoSolution: False, 993: questionNo: 993, acRate: 56.44818016651028, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Cousins in Binary Tree, slug: cousins-in-binary-tree, url: https://leetcode.com/problems/cousins-in-binary-tree, topics: ['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 994: questionNo: 994, acRate: 54.58010017364312, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Rotting Oranges, slug: rotting-oranges, url: https://leetcode.com/problems/rotting-oranges, topics: ['Array', 'Breadth-First Search', 'Matrix'], hasSolution: True, hasVideoSolution: False, 995: questionNo: 995, acRate: 62.73271379691748, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Minimum Number of K Consecutive Bit Flips, slug: minimum-number-of-k-consecutive-bit-flips, url: https://leetcode.com/problems/minimum-number-of-k-consecutive-bit-flips, topics: ['Array', 'Bit Manipulation', 'Queue', 'Sliding Window', 'Prefix Sum'], hasSolution: True, hasVideoSolution: False, 996: questionNo: 996, acRate: 50.14812314846064, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Number of Squareful Arrays, slug: number-of-squareful-arrays, url: https://leetcode.com/problems/number-of-squareful-arrays, topics: ['Array', 'Hash Table', 'Math', 'Dynamic Programming', 'Backtracking', 'Bit Manipulation', 'Bitmask'], hasSolution: False, hasVideoSolution: False, 997: questionNo: 997, acRate: 49.752649126615744, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Find the Town Judge, slug: find-the-town-judge, url: https://leetcode.com/problems/find-the-town-judge, topics: ['Array', 'Hash Table', 'Graph'], hasSolution: True, hasVideoSolution: False, 998: questionNo: 998, acRate: 69.41864204771184, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum Binary Tree II, slug: maximum-binary-tree-ii, url: https://leetcode.com/problems/maximum-binary-tree-ii, topics: ['Tree', 'Binary Tree'], hasSolution: False, hasVideoSolution: False, 999: questionNo: 999, acRate: 69.2103544014372, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Available Captures for Rook, slug: available-captures-for-rook, url: https://leetcode.com/problems/available-captures-for-rook, topics: ['Array', 'Matrix', 'Simulation'], hasSolution: False, hasVideoSolution: False, 1000: questionNo: 1000, acRate: 43.24396869195504, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Minimum Cost to Merge Stones, slug: minimum-cost-to-merge-stones, url: https://leetcode.com/problems/minimum-cost-to-merge-stones, topics: ['Array', 'Dynamic Programming', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 1001: questionNo: 1001, acRate: 37.176560121765604, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Grid Illumination, slug: grid-illumination, url: https://leetcode.com/problems/grid-illumination, topics: ['Array', 'Hash Table'], hasSolution: False, hasVideoSolution: False, 1002: questionNo: 1002, acRate: 74.58471967540926, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Find Common Characters, slug: find-common-characters, url: https://leetcode.com/problems/find-common-characters, topics: ['Array', 'Hash Table', 'String'], hasSolution: True, hasVideoSolution: False, 1003: questionNo: 1003, acRate: 59.85468846647402, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Check If Word Is Valid After Substitutions, slug: check-if-word-is-valid-after-substitutions, url: https://leetcode.com/problems/check-if-word-is-valid-after-substitutions, topics: ['String', 'Stack'], hasSolution: False, hasVideoSolution: False, 1004: questionNo: 1004, acRate: 63.64865855830374, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Max Consecutive Ones III, slug: max-consecutive-ones-iii, url: https://leetcode.com/problems/max-consecutive-ones-iii, topics: ['Array', 'Binary Search', 'Sliding Window', 'Prefix Sum'], hasSolution: True, hasVideoSolution: False, 1005: questionNo: 1005, acRate: 51.28888840219451, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Maximize Sum Of Array After K Negations, slug: maximize-sum-of-array-after-k-negations, url: https://leetcode.com/problems/maximize-sum-of-array-after-k-negations, topics: ['Array', 'Greedy', 'Sorting'], hasSolution: False, hasVideoSolution: False, 1006: questionNo: 1006, acRate: 57.503881779729085, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Clumsy Factorial, slug: clumsy-factorial, url: https://leetcode.com/problems/clumsy-factorial, topics: ['Math', 'Stack', 'Simulation'], hasSolution: False, hasVideoSolution: False, 1007: questionNo: 1007, acRate: 52.25421949529129, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Domino Rotations For Equal Row, slug: minimum-domino-rotations-for-equal-row, url: https://leetcode.com/problems/minimum-domino-rotations-for-equal-row, topics: ['Array', 'Greedy'], hasSolution: True, hasVideoSolution: False, 1008: questionNo: 1008, acRate: 82.30100360484654, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Construct Binary Search Tree from Preorder Traversal, slug: construct-binary-search-tree-from-preorder-traversal, url: https://leetcode.com/problems/construct-binary-search-tree-from-preorder-traversal, topics: ['Array', 'Stack', 'Tree', 'Binary Search Tree', 'Monotonic Stack', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 1009: questionNo: 1009, acRate: 60.789981666682834, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Complement of Base 10 Integer, slug: complement-of-base-10-integer, url: https://leetcode.com/problems/complement-of-base-10-integer, topics: ['Bit Manipulation'], hasSolution: True, hasVideoSolution: False, 1010: questionNo: 1010, acRate: 52.978168803259905, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Pairs of Songs With Total Durations Divisible by 60, slug: pairs-of-songs-with-total-durations-divisible-by-60, url: https://leetcode.com/problems/pairs-of-songs-with-total-durations-divisible-by-60, topics: ['Array', 'Hash Table', 'Counting'], hasSolution: True, hasVideoSolution: True, 1011: questionNo: 1011, acRate: 70.0147330152548, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Capacity To Ship Packages Within D Days, slug: capacity-to-ship-packages-within-d-days, url: https://leetcode.com/problems/capacity-to-ship-packages-within-d-days, topics: ['Array', 'Binary Search'], hasSolution: True, hasVideoSolution: False, 1012: questionNo: 1012, acRate: 42.40358961920931, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Numbers With Repeated Digits, slug: numbers-with-repeated-digits, url: https://leetcode.com/problems/numbers-with-repeated-digits, topics: ['Math', 'Dynamic Programming'], hasSolution: False, hasVideoSolution: False, 1013: questionNo: 1013, acRate: 41.99639737323038, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Partition Array Into Three Parts With Equal Sum, slug: partition-array-into-three-parts-with-equal-sum, url: https://leetcode.com/problems/partition-array-into-three-parts-with-equal-sum, topics: ['Array', 'Greedy'], hasSolution: False, hasVideoSolution: False, 1014: questionNo: 1014, acRate: 59.14325575496227, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Best Sightseeing Pair, slug: best-sightseeing-pair, url: https://leetcode.com/problems/best-sightseeing-pair, topics: ['Array', 'Dynamic Programming'], hasSolution: False, hasVideoSolution: False, 1015: questionNo: 1015, acRate: 46.586652734136415, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Smallest Integer Divisible by K, slug: smallest-integer-divisible-by-k, url: https://leetcode.com/problems/smallest-integer-divisible-by-k, topics: ['Hash Table', 'Math'], hasSolution: True, hasVideoSolution: False, 1016: questionNo: 1016, acRate: 57.40486494553052, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Binary String With Substrings Representing 1 To N, slug: binary-string-with-substrings-representing-1-to-n, url: https://leetcode.com/problems/binary-string-with-substrings-representing-1-to-n, topics: ['String'], hasSolution: False, hasVideoSolution: False, 1017: questionNo: 1017, acRate: 60.829890187587, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Convert to Base -2, slug: convert-to-base-2, url: https://leetcode.com/problems/convert-to-base-2, topics: ['Math'], hasSolution: False, hasVideoSolution: False, 1018: questionNo: 1018, acRate: 46.77650015292921, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Binary Prefix Divisible By 5, slug: binary-prefix-divisible-by-5, url: https://leetcode.com/problems/binary-prefix-divisible-by-5, topics: ['Array', 'Bit Manipulation'], hasSolution: False, hasVideoSolution: False, 1019: questionNo: 1019, acRate: 61.06955871353777, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Next Greater Node In Linked List, slug: next-greater-node-in-linked-list, url: https://leetcode.com/problems/next-greater-node-in-linked-list, topics: ['Array', 'Linked List', 'Stack', 'Monotonic Stack'], hasSolution: True, hasVideoSolution: False, 1020: questionNo: 1020, acRate: 69.14691183541444, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Number of Enclaves, slug: number-of-enclaves, url: https://leetcode.com/problems/number-of-enclaves, topics: ['Array', 'Depth-First Search', 'Breadth-First Search', 'Union Find', 'Matrix'], hasSolution: True, hasVideoSolution: False, 1021: questionNo: 1021, acRate: 83.28902162168724, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Remove Outermost Parentheses, slug: remove-outermost-parentheses, url: https://leetcode.com/problems/remove-outermost-parentheses, topics: ['String', 'Stack'], hasSolution: False, hasVideoSolution: False, 1022: questionNo: 1022, acRate: 73.12388964897593, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Sum of Root To Leaf Binary Numbers, slug: sum-of-root-to-leaf-binary-numbers, url: https://leetcode.com/problems/sum-of-root-to-leaf-binary-numbers, topics: ['Tree', 'Depth-First Search', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 1023: questionNo: 1023, acRate: 62.53376383532042, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Camelcase Matching, slug: camelcase-matching, url: https://leetcode.com/problems/camelcase-matching, topics: ['Array', 'Two Pointers', 'String', 'Trie', 'String Matching'], hasSolution: False, hasVideoSolution: False, 1024: questionNo: 1024, acRate: 51.41680528178561, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Video Stitching, slug: video-stitching, url: https://leetcode.com/problems/video-stitching, topics: ['Array', 'Dynamic Programming', 'Greedy'], hasSolution: False, hasVideoSolution: False, 1025: questionNo: 1025, acRate: 69.02182922028139, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Divisor Game, slug: divisor-game, url: https://leetcode.com/problems/divisor-game, topics: ['Math', 'Dynamic Programming', 'Brainteaser', 'Game Theory'], hasSolution: False, hasVideoSolution: False, 1026: questionNo: 1026, acRate: 78.10938213262754, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum Difference Between Node and Ancestor, slug: maximum-difference-between-node-and-ancestor, url: https://leetcode.com/problems/maximum-difference-between-node-and-ancestor, topics: ['Tree', 'Depth-First Search', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 1027: questionNo: 1027, acRate: 49.15566396141436, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Longest Arithmetic Subsequence, slug: longest-arithmetic-subsequence, url: https://leetcode.com/problems/longest-arithmetic-subsequence, topics: ['Array', 'Hash Table', 'Binary Search', 'Dynamic Programming'], hasSolution: True, hasVideoSolution: False, 1028: questionNo: 1028, acRate: 74.95809682099244, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Recover a Tree From Preorder Traversal, slug: recover-a-tree-from-preorder-traversal, url: https://leetcode.com/problems/recover-a-tree-from-preorder-traversal, topics: ['String', 'Tree', 'Depth-First Search', 'Binary Tree'], hasSolution: False, hasVideoSolution: False, 1029: questionNo: 1029, acRate: 66.85446263962695, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Two City Scheduling, slug: two-city-scheduling, url: https://leetcode.com/problems/two-city-scheduling, topics: ['Array', 'Greedy', 'Sorting'], hasSolution: True, hasVideoSolution: False, 1030: questionNo: 1030, acRate: 71.38932588227007, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Matrix Cells in Distance Order, slug: matrix-cells-in-distance-order, url: https://leetcode.com/problems/matrix-cells-in-distance-order, topics: ['Array', 'Math', 'Geometry', 'Sorting', 'Matrix'], hasSolution: False, hasVideoSolution: False, 1031: questionNo: 1031, acRate: 59.797058260428024, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum Sum of Two Non-Overlapping Subarrays, slug: maximum-sum-of-two-non-overlapping-subarrays, url: https://leetcode.com/problems/maximum-sum-of-two-non-overlapping-subarrays, topics: ['Array', 'Dynamic Programming', 'Sliding Window'], hasSolution: False, hasVideoSolution: False, 1032: questionNo: 1032, acRate: 52.09899767451254, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Stream of Characters, slug: stream-of-characters, url: https://leetcode.com/problems/stream-of-characters, topics: ['Array', 'String', 'Design', 'Trie', 'Data Stream'], hasSolution: True, hasVideoSolution: False, 1033: questionNo: 1033, acRate: 48.29917799916664, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Moving Stones Until Consecutive, slug: moving-stones-until-consecutive, url: https://leetcode.com/problems/moving-stones-until-consecutive, topics: ['Math', 'Brainteaser'], hasSolution: False, hasVideoSolution: False, 1034: questionNo: 1034, acRate: 49.113814192533525, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Coloring A Border, slug: coloring-a-border, url: https://leetcode.com/problems/coloring-a-border, topics: ['Array', 'Depth-First Search', 'Breadth-First Search', 'Matrix'], hasSolution: False, hasVideoSolution: False, 1035: questionNo: 1035, acRate: 63.298711207422066, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Uncrossed Lines, slug: uncrossed-lines, url: https://leetcode.com/problems/uncrossed-lines, topics: ['Array', 'Dynamic Programming'], hasSolution: True, hasVideoSolution: False, 1036: questionNo: 1036, acRate: 34.73301658223467, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Escape a Large Maze, slug: escape-a-large-maze, url: https://leetcode.com/problems/escape-a-large-maze, topics: ['Array', 'Hash Table', 'Depth-First Search', 'Breadth-First Search'], hasSolution: False, hasVideoSolution: False, 1037: questionNo: 1037, acRate: 37.13785046728972, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Valid Boomerang, slug: valid-boomerang, url: https://leetcode.com/problems/valid-boomerang, topics: ['Array', 'Math', 'Geometry'], hasSolution: False, hasVideoSolution: False, 1038: questionNo: 1038, acRate: 88.22851310931654, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Binary Search Tree to Greater Sum Tree, slug: binary-search-tree-to-greater-sum-tree, url: https://leetcode.com/problems/binary-search-tree-to-greater-sum-tree, topics: ['Tree', 'Depth-First Search', 'Binary Search Tree', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 1039: questionNo: 1039, acRate: 59.368466503045184, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Score Triangulation of Polygon, slug: minimum-score-triangulation-of-polygon, url: https://leetcode.com/problems/minimum-score-triangulation-of-polygon, topics: ['Array', 'Dynamic Programming'], hasSolution: False, hasVideoSolution: False, 1040: questionNo: 1040, acRate: 56.67854443364647, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Moving Stones Until Consecutive II, slug: moving-stones-until-consecutive-ii, url: https://leetcode.com/problems/moving-stones-until-consecutive-ii, topics: ['Array', 'Math', 'Two Pointers', 'Sorting'], hasSolution: False, hasVideoSolution: False, 1041: questionNo: 1041, acRate: 55.838744335964876, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Robot Bounded In Circle, slug: robot-bounded-in-circle, url: https://leetcode.com/problems/robot-bounded-in-circle, topics: ['Math', 'String', 'Simulation'], hasSolution: True, hasVideoSolution: False, 1042: questionNo: 1042, acRate: 51.454000648908625, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Flower Planting With No Adjacent, slug: flower-planting-with-no-adjacent, url: https://leetcode.com/problems/flower-planting-with-no-adjacent, topics: ['Depth-First Search', 'Breadth-First Search', 'Graph'], hasSolution: False, hasVideoSolution: False, 1043: questionNo: 1043, acRate: 76.62154364404797, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Partition Array for Maximum Sum, slug: partition-array-for-maximum-sum, url: https://leetcode.com/problems/partition-array-for-maximum-sum, topics: ['Array', 'Dynamic Programming'], hasSolution: True, hasVideoSolution: False, 1044: questionNo: 1044, acRate: 30.552998841771956, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Longest Duplicate Substring, slug: longest-duplicate-substring, url: https://leetcode.com/problems/longest-duplicate-substring, topics: ['String', 'Binary Search', 'Sliding Window', 'Rolling Hash', 'Suffix Array', 'Hash Function'], hasSolution: True, hasVideoSolution: False, 1045: questionNo: 1045, acRate: 61.94726350126858, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Customers Who Bought All Products, slug: customers-who-bought-all-products, url: https://leetcode.com/problems/customers-who-bought-all-products, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 1046: questionNo: 1046, acRate: 65.50159981868042, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Last Stone Weight, slug: last-stone-weight, url: https://leetcode.com/problems/last-stone-weight, topics: ['Array', 'Heap (Priority Queue)'], hasSolution: True, hasVideoSolution: False, 1047: questionNo: 1047, acRate: 69.86320576868697, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Remove All Adjacent Duplicates In String, slug: remove-all-adjacent-duplicates-in-string, url: https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string, topics: ['String', 'Stack'], hasSolution: True, hasVideoSolution: False, 1048: questionNo: 1048, acRate: 61.23636918974322, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Longest String Chain, slug: longest-string-chain, url: https://leetcode.com/problems/longest-string-chain, topics: ['Array', 'Hash Table', 'Two Pointers', 'String', 'Dynamic Programming', 'Sorting'], hasSolution: True, hasVideoSolution: False, 1049: questionNo: 1049, acRate: 55.76375245579568, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Last Stone Weight II, slug: last-stone-weight-ii, url: https://leetcode.com/problems/last-stone-weight-ii, topics: ['Array', 'Dynamic Programming'], hasSolution: False, hasVideoSolution: False, 1050: questionNo: 1050, acRate: 70.09986809873752, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Actors and Directors Who Cooperated At Least Three Times, slug: actors-and-directors-who-cooperated-at-least-three-times, url: https://leetcode.com/problems/actors-and-directors-who-cooperated-at-least-three-times, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 1051: questionNo: 1051, acRate: 80.75270747706098, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Height Checker, slug: height-checker, url: https://leetcode.com/problems/height-checker, topics: ['Array', 'Sorting', 'Counting Sort'], hasSolution: True, hasVideoSolution: False, 1052: questionNo: 1052, acRate: 64.34794051848928, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Grumpy Bookstore Owner, slug: grumpy-bookstore-owner, url: https://leetcode.com/problems/grumpy-bookstore-owner, topics: ['Array', 'Sliding Window'], hasSolution: True, hasVideoSolution: False, 1053: questionNo: 1053, acRate: 49.69345966510772, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Previous Permutation With One Swap, slug: previous-permutation-with-one-swap, url: https://leetcode.com/problems/previous-permutation-with-one-swap, topics: ['Array', 'Greedy'], hasSolution: False, hasVideoSolution: False, 1054: questionNo: 1054, acRate: 46.60882109595435, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Distant Barcodes, slug: distant-barcodes, url: https://leetcode.com/problems/distant-barcodes, topics: ['Array', 'Hash Table', 'Greedy', 'Sorting', 'Heap (Priority Queue)', 'Counting'], hasSolution: False, hasVideoSolution: False, 1055: questionNo: 1055, acRate: 60.32857652044198, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Shortest Way to Form String, slug: shortest-way-to-form-string, url: https://leetcode.com/problems/shortest-way-to-form-string, topics: ['Two Pointers', 'String', 'Greedy'], hasSolution: True, hasVideoSolution: False, 1056: questionNo: 1056, acRate: 48.79998319451301, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Confusing Number, slug: confusing-number, url: https://leetcode.com/problems/confusing-number, topics: ['Math'], hasSolution: True, hasVideoSolution: True, 1057: questionNo: 1057, acRate: 58.63085808983014, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Campus Bikes, slug: campus-bikes, url: https://leetcode.com/problems/campus-bikes, topics: ['Array', 'Greedy', 'Sorting'], hasSolution: True, hasVideoSolution: False, 1058: questionNo: 1058, acRate: 45.072062891250546, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Minimize Rounding Error to Meet Target, slug: minimize-rounding-error-to-meet-target, url: https://leetcode.com/problems/minimize-rounding-error-to-meet-target, topics: ['Array', 'Math', 'String', 'Greedy', 'Sorting'], hasSolution: False, hasVideoSolution: False, 1059: questionNo: 1059, acRate: 37.54510880791242, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: All Paths from Source Lead to Destination, slug: all-paths-from-source-lead-to-destination, url: https://leetcode.com/problems/all-paths-from-source-lead-to-destination, topics: ['Graph', 'Topological Sort'], hasSolution: True, hasVideoSolution: True, 1060: questionNo: 1060, acRate: 57.24742692466035, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Missing Element in Sorted Array, slug: missing-element-in-sorted-array, url: https://leetcode.com/problems/missing-element-in-sorted-array, topics: ['Array', 'Binary Search'], hasSolution: True, hasVideoSolution: False, 1061: questionNo: 1061, acRate: 76.56946438014656, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Lexicographically Smallest Equivalent String, slug: lexicographically-smallest-equivalent-string, url: https://leetcode.com/problems/lexicographically-smallest-equivalent-string, topics: ['String', 'Union Find'], hasSolution: True, hasVideoSolution: False, 1062: questionNo: 1062, acRate: 60.997016980266174, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Longest Repeating Substring, slug: longest-repeating-substring, url: https://leetcode.com/problems/longest-repeating-substring, topics: ['String', 'Binary Search', 'Dynamic Programming', 'Rolling Hash', 'Suffix Array', 'Hash Function'], hasSolution: True, hasVideoSolution: False, 1063: questionNo: 1063, acRate: 79.12647664462989, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Number of Valid Subarrays, slug: number-of-valid-subarrays, url: https://leetcode.com/problems/number-of-valid-subarrays, topics: ['Array', 'Stack', 'Monotonic Stack'], hasSolution: True, hasVideoSolution: False, 1064: questionNo: 1064, acRate: 64.1323457359426, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Fixed Point, slug: fixed-point, url: https://leetcode.com/problems/fixed-point, topics: ['Array', 'Binary Search'], hasSolution: True, hasVideoSolution: False, 1065: questionNo: 1065, acRate: 67.4973514398536, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Index Pairs of a String, slug: index-pairs-of-a-string, url: https://leetcode.com/problems/index-pairs-of-a-string, topics: ['Array', 'String', 'Trie', 'Sorting'], hasSolution: True, hasVideoSolution: False, 1066: questionNo: 1066, acRate: 55.17941119628937, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Campus Bikes II, slug: campus-bikes-ii, url: https://leetcode.com/problems/campus-bikes-ii, topics: ['Array', 'Dynamic Programming', 'Backtracking', 'Bit Manipulation', 'Bitmask'], hasSolution: True, hasVideoSolution: False, 1067: questionNo: 1067, acRate: 46.32180047027209, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Digit Count in Range, slug: digit-count-in-range, url: https://leetcode.com/problems/digit-count-in-range, topics: ['Math', 'Dynamic Programming'], hasSolution: False, hasVideoSolution: False, 1068: questionNo: 1068, acRate: 83.33619167397131, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Product Sales Analysis I, slug: product-sales-analysis-i, url: https://leetcode.com/problems/product-sales-analysis-i, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 1069: questionNo: 1069, acRate: 81.83783134700249, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Product Sales Analysis II, slug: product-sales-analysis-ii, url: https://leetcode.com/problems/product-sales-analysis-ii, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 1070: questionNo: 1070, acRate: 43.01512229467046, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Product Sales Analysis III, slug: product-sales-analysis-iii, url: https://leetcode.com/problems/product-sales-analysis-iii, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 1071: questionNo: 1071, acRate: 51.510792697398635, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Greatest Common Divisor of Strings, slug: greatest-common-divisor-of-strings, url: https://leetcode.com/problems/greatest-common-divisor-of-strings, topics: ['Math', 'String'], hasSolution: True, hasVideoSolution: False, 1072: questionNo: 1072, acRate: 64.08487624513673, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Flip Columns For Maximum Number of Equal Rows, slug: flip-columns-for-maximum-number-of-equal-rows, url: https://leetcode.com/problems/flip-columns-for-maximum-number-of-equal-rows, topics: ['Array', 'Hash Table', 'Matrix'], hasSolution: False, hasVideoSolution: False, 1073: questionNo: 1073, acRate: 36.91113871972952, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Adding Two Negabinary Numbers, slug: adding-two-negabinary-numbers, url: https://leetcode.com/problems/adding-two-negabinary-numbers, topics: ['Array', 'Math'], hasSolution: False, hasVideoSolution: False, 1074: questionNo: 1074, acRate: 74.44232392205002, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Number of Submatrices That Sum to Target, slug: number-of-submatrices-that-sum-to-target, url: https://leetcode.com/problems/number-of-submatrices-that-sum-to-target, topics: ['Array', 'Hash Table', 'Matrix', 'Prefix Sum'], hasSolution: True, hasVideoSolution: False, 1075: questionNo: 1075, acRate: 62.275227279698555, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Project Employees I, slug: project-employees-i, url: https://leetcode.com/problems/project-employees-i, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 1076: questionNo: 1076, acRate: 49.94161185622778, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Project Employees II, slug: project-employees-ii, url: https://leetcode.com/problems/project-employees-ii, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 1077: questionNo: 1077, acRate: 76.57729741074006, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Project Employees III, slug: project-employees-iii, url: https://leetcode.com/problems/project-employees-iii, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 1078: questionNo: 1078, acRate: 63.491143427041955, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Occurrences After Bigram, slug: occurrences-after-bigram, url: https://leetcode.com/problems/occurrences-after-bigram, topics: ['String'], hasSolution: False, hasVideoSolution: False, 1079: questionNo: 1079, acRate: 76.39237591549923, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Letter Tile Possibilities, slug: letter-tile-possibilities, url: https://leetcode.com/problems/letter-tile-possibilities, topics: ['Hash Table', 'String', 'Backtracking', 'Counting'], hasSolution: False, hasVideoSolution: False, 1080: questionNo: 1080, acRate: 55.81405468126768, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Insufficient Nodes in Root to Leaf Paths, slug: insufficient-nodes-in-root-to-leaf-paths, url: https://leetcode.com/problems/insufficient-nodes-in-root-to-leaf-paths, topics: ['Tree', 'Depth-First Search', 'Binary Tree'], hasSolution: False, hasVideoSolution: False, 1081: questionNo: 1081, acRate: 61.064727147529695, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Smallest Subsequence of Distinct Characters, slug: smallest-subsequence-of-distinct-characters, url: https://leetcode.com/problems/smallest-subsequence-of-distinct-characters, topics: ['String', 'Stack', 'Greedy', 'Monotonic Stack'], hasSolution: False, hasVideoSolution: False, 1082: questionNo: 1082, acRate: 74.36768544770993, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Sales Analysis I, slug: sales-analysis-i, url: https://leetcode.com/problems/sales-analysis-i, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 1083: questionNo: 1083, acRate: 49.717869917879995, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Sales Analysis II, slug: sales-analysis-ii, url: https://leetcode.com/problems/sales-analysis-ii, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 1084: questionNo: 1084, acRate: 46.52463160695872, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Sales Analysis III, slug: sales-analysis-iii, url: https://leetcode.com/problems/sales-analysis-iii, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 1085: questionNo: 1085, acRate: 76.40946274596506, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Sum of Digits in the Minimum Number, slug: sum-of-digits-in-the-minimum-number, url: https://leetcode.com/problems/sum-of-digits-in-the-minimum-number, topics: ['Array', 'Math'], hasSolution: False, hasVideoSolution: False, 1086: questionNo: 1086, acRate: 74.5191965999062, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: High Five, slug: high-five, url: https://leetcode.com/problems/high-five, topics: ['Array', 'Hash Table', 'Sorting', 'Heap (Priority Queue)'], hasSolution: True, hasVideoSolution: False, 1087: questionNo: 1087, acRate: 66.41182082956713, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Brace Expansion, slug: brace-expansion, url: https://leetcode.com/problems/brace-expansion, topics: ['String', 'Backtracking', 'Breadth-First Search'], hasSolution: True, hasVideoSolution: False, 1088: questionNo: 1088, acRate: 47.1657646064368, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Confusing Number II, slug: confusing-number-ii, url: https://leetcode.com/problems/confusing-number-ii, topics: ['Math', 'Backtracking'], hasSolution: False, hasVideoSolution: False, 1089: questionNo: 1089, acRate: 52.02097325150533, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Duplicate Zeros, slug: duplicate-zeros, url: https://leetcode.com/problems/duplicate-zeros, topics: ['Array', 'Two Pointers'], hasSolution: True, hasVideoSolution: False, 1090: questionNo: 1090, acRate: 62.29947371758291, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Largest Values From Labels, slug: largest-values-from-labels, url: https://leetcode.com/problems/largest-values-from-labels, topics: ['Array', 'Hash Table', 'Greedy', 'Sorting', 'Counting'], hasSolution: False, hasVideoSolution: False, 1091: questionNo: 1091, acRate: 47.77758065985491, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Shortest Path in Binary Matrix, slug: shortest-path-in-binary-matrix, url: https://leetcode.com/problems/shortest-path-in-binary-matrix, topics: ['Array', 'Breadth-First Search', 'Matrix'], hasSolution: True, hasVideoSolution: False, 1092: questionNo: 1092, acRate: 59.343994562395565, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Shortest Common Supersequence , slug: shortest-common-supersequence, url: https://leetcode.com/problems/shortest-common-supersequence, topics: ['String', 'Dynamic Programming'], hasSolution: False, hasVideoSolution: False, 1093: questionNo: 1093, acRate: 42.00690889416074, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Statistics from a Large Sample, slug: statistics-from-a-large-sample, url: https://leetcode.com/problems/statistics-from-a-large-sample, topics: ['Array', 'Math', 'Probability and Statistics'], hasSolution: False, hasVideoSolution: False, 1094: questionNo: 1094, acRate: 55.97928950106525, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Car Pooling, slug: car-pooling, url: https://leetcode.com/problems/car-pooling, topics: ['Array', 'Sorting', 'Heap (Priority Queue)', 'Simulation', 'Prefix Sum'], hasSolution: True, hasVideoSolution: False, 1095: questionNo: 1095, acRate: 40.287265324587196, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Find in Mountain Array, slug: find-in-mountain-array, url: https://leetcode.com/problems/find-in-mountain-array, topics: ['Array', 'Binary Search', 'Interactive'], hasSolution: True, hasVideoSolution: False, 1096: questionNo: 1096, acRate: 63.78587224524034, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Brace Expansion II, slug: brace-expansion-ii, url: https://leetcode.com/problems/brace-expansion-ii, topics: ['String', 'Backtracking', 'Stack', 'Breadth-First Search'], hasSolution: False, hasVideoSolution: False, 1097: questionNo: 1097, acRate: 51.084002140181916, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Game Play Analysis V, slug: game-play-analysis-v, url: https://leetcode.com/problems/game-play-analysis-v, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 1098: questionNo: 1098, acRate: 43.17247096081703, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Unpopular Books, slug: unpopular-books, url: https://leetcode.com/problems/unpopular-books, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 1099: questionNo: 1099, acRate: 61.8306166647669, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Two Sum Less Than K, slug: two-sum-less-than-k, url: https://leetcode.com/problems/two-sum-less-than-k, topics: ['Array', 'Two Pointers', 'Binary Search', 'Sorting'], hasSolution: True, hasVideoSolution: True, 1100: questionNo: 1100, acRate: 74.7335467304513, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Find K-Length Substrings With No Repeated Characters, slug: find-k-length-substrings-with-no-repeated-characters, url: https://leetcode.com/problems/find-k-length-substrings-with-no-repeated-characters, topics: ['Hash Table', 'String', 'Sliding Window'], hasSolution: True, hasVideoSolution: False, 1101: questionNo: 1101, acRate: 65.30971467749592, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: The Earliest Moment When Everyone Become Friends, slug: the-earliest-moment-when-everyone-become-friends, url: https://leetcode.com/problems/the-earliest-moment-when-everyone-become-friends, topics: ['Array', 'Union Find', 'Sorting'], hasSolution: True, hasVideoSolution: False, 1102: questionNo: 1102, acRate: 53.76782597590567, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Path With Maximum Minimum Value, slug: path-with-maximum-minimum-value, url: https://leetcode.com/problems/path-with-maximum-minimum-value, topics: ['Array', 'Binary Search', 'Depth-First Search', 'Breadth-First Search', 'Union Find', 'Heap (Priority Queue)', 'Matrix'], hasSolution: True, hasVideoSolution: False, 1103: questionNo: 1103, acRate: 65.39127765474598, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Distribute Candies to People, slug: distribute-candies-to-people, url: https://leetcode.com/problems/distribute-candies-to-people, topics: ['Math', 'Simulation'], hasSolution: True, hasVideoSolution: False, 1104: questionNo: 1104, acRate: 75.45618641286511, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Path In Zigzag Labelled Binary Tree, slug: path-in-zigzag-labelled-binary-tree, url: https://leetcode.com/problems/path-in-zigzag-labelled-binary-tree, topics: ['Math', 'Tree', 'Binary Tree'], hasSolution: False, hasVideoSolution: False, 1105: questionNo: 1105, acRate: 59.59038522004055, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Filling Bookcase Shelves, slug: filling-bookcase-shelves, url: https://leetcode.com/problems/filling-bookcase-shelves, topics: ['Array', 'Dynamic Programming'], hasSolution: False, hasVideoSolution: False, 1106: questionNo: 1106, acRate: 59.601343457943926, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Parsing A Boolean Expression, slug: parsing-a-boolean-expression, url: https://leetcode.com/problems/parsing-a-boolean-expression, topics: ['String', 'Stack', 'Recursion'], hasSolution: False, hasVideoSolution: False, 1107: questionNo: 1107, acRate: 44.62948460672507, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: New Users Daily Count, slug: new-users-daily-count, url: https://leetcode.com/problems/new-users-daily-count, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 1108: questionNo: 1108, acRate: 89.20007726791317, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Defanging an IP Address, slug: defanging-an-ip-address, url: https://leetcode.com/problems/defanging-an-ip-address, topics: ['String'], hasSolution: False, hasVideoSolution: False, 1109: questionNo: 1109, acRate: 62.27192908320891, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Corporate Flight Bookings, slug: corporate-flight-bookings, url: https://leetcode.com/problems/corporate-flight-bookings, topics: ['Array', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 1110: questionNo: 1110, acRate: 72.40481009033346, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Delete Nodes And Return Forest, slug: delete-nodes-and-return-forest, url: https://leetcode.com/problems/delete-nodes-and-return-forest, topics: ['Array', 'Hash Table', 'Tree', 'Depth-First Search', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 1111: questionNo: 1111, acRate: 72.03511613931492, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum Nesting Depth of Two Valid Parentheses Strings, slug: maximum-nesting-depth-of-two-valid-parentheses-strings, url: https://leetcode.com/problems/maximum-nesting-depth-of-two-valid-parentheses-strings, topics: ['String', 'Stack'], hasSolution: False, hasVideoSolution: False, 1112: questionNo: 1112, acRate: 70.89152673668862, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Highest Grade For Each Student, slug: highest-grade-for-each-student, url: https://leetcode.com/problems/highest-grade-for-each-student, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 1113: questionNo: 1113, acRate: 64.843182161028, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Reported Posts, slug: reported-posts, url: https://leetcode.com/problems/reported-posts, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 1114: questionNo: 1114, acRate: 69.64307205611814, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Print in Order, slug: print-in-order, url: https://leetcode.com/problems/print-in-order, topics: ['Concurrency'], hasSolution: True, hasVideoSolution: False, 1115: questionNo: 1115, acRate: 66.42862615891502, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Print FooBar Alternately, slug: print-foobar-alternately, url: https://leetcode.com/problems/print-foobar-alternately, topics: ['Concurrency'], hasSolution: False, hasVideoSolution: False, 1116: questionNo: 1116, acRate: 61.29286327247934, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Print Zero Even Odd, slug: print-zero-even-odd, url: https://leetcode.com/problems/print-zero-even-odd, topics: ['Concurrency'], hasSolution: False, hasVideoSolution: False, 1117: questionNo: 1117, acRate: 56.48071459274714, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Building H2O, slug: building-h2o, url: https://leetcode.com/problems/building-h2o, topics: ['Concurrency'], hasSolution: False, hasVideoSolution: False, 1118: questionNo: 1118, acRate: 58.30338373906557, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Number of Days in a Month, slug: number-of-days-in-a-month, url: https://leetcode.com/problems/number-of-days-in-a-month, topics: ['Math'], hasSolution: False, hasVideoSolution: False, 1119: questionNo: 1119, acRate: 91.15932270196588, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Remove Vowels from a String, slug: remove-vowels-from-a-string, url: https://leetcode.com/problems/remove-vowels-from-a-string, topics: ['String'], hasSolution: True, hasVideoSolution: False, 1120: questionNo: 1120, acRate: 66.63595000863906, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Maximum Average Subtree, slug: maximum-average-subtree, url: https://leetcode.com/problems/maximum-average-subtree, topics: ['Tree', 'Depth-First Search', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 1121: questionNo: 1121, acRate: 61.34020618556701, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Divide Array Into Increasing Sequences, slug: divide-array-into-increasing-sequences, url: https://leetcode.com/problems/divide-array-into-increasing-sequences, topics: ['Array', 'Counting'], hasSolution: False, hasVideoSolution: False, 1122: questionNo: 1122, acRate: 74.77591829996832, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Relative Sort Array, slug: relative-sort-array, url: https://leetcode.com/problems/relative-sort-array, topics: ['Array', 'Hash Table', 'Sorting', 'Counting Sort'], hasSolution: True, hasVideoSolution: False, 1123: questionNo: 1123, acRate: 72.46413577036745, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Lowest Common Ancestor of Deepest Leaves, slug: lowest-common-ancestor-of-deepest-leaves, url: https://leetcode.com/problems/lowest-common-ancestor-of-deepest-leaves, topics: ['Hash Table', 'Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree'], hasSolution: False, hasVideoSolution: False, 1124: questionNo: 1124, acRate: 35.175545113774355, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Longest Well-Performing Interval, slug: longest-well-performing-interval, url: https://leetcode.com/problems/longest-well-performing-interval, topics: ['Array', 'Hash Table', 'Stack', 'Monotonic Stack', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 1125: questionNo: 1125, acRate: 55.48417983200592, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Smallest Sufficient Team, slug: smallest-sufficient-team, url: https://leetcode.com/problems/smallest-sufficient-team, topics: ['Array', 'Dynamic Programming', 'Bit Manipulation', 'Bitmask'], hasSolution: True, hasVideoSolution: False, 1126: questionNo: 1126, acRate: 65.68452552224204, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Active Businesses, slug: active-businesses, url: https://leetcode.com/problems/active-businesses, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 1127: questionNo: 1127, acRate: 47.07889505385277, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: User Purchase Platform, slug: user-purchase-platform, url: https://leetcode.com/problems/user-purchase-platform, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 1128: questionNo: 1128, acRate: 48.38589853826311, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Number of Equivalent Domino Pairs, slug: number-of-equivalent-domino-pairs, url: https://leetcode.com/problems/number-of-equivalent-domino-pairs, topics: ['Array', 'Hash Table', 'Counting'], hasSolution: False, hasVideoSolution: False, 1129: questionNo: 1129, acRate: 47.12229929678302, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Shortest Path with Alternating Colors, slug: shortest-path-with-alternating-colors, url: https://leetcode.com/problems/shortest-path-with-alternating-colors, topics: ['Breadth-First Search', 'Graph'], hasSolution: True, hasVideoSolution: False, 1130: questionNo: 1130, acRate: 67.71853246033812, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Cost Tree From Leaf Values, slug: minimum-cost-tree-from-leaf-values, url: https://leetcode.com/problems/minimum-cost-tree-from-leaf-values, topics: ['Array', 'Dynamic Programming', 'Stack', 'Greedy', 'Monotonic Stack'], hasSolution: False, hasVideoSolution: False, 1131: questionNo: 1131, acRate: 48.42076298669392, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum of Absolute Value Expression, slug: maximum-of-absolute-value-expression, url: https://leetcode.com/problems/maximum-of-absolute-value-expression, topics: ['Array', 'Math'], hasSolution: False, hasVideoSolution: False, 1132: questionNo: 1132, acRate: 32.25461217001325, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Reported Posts II, slug: reported-posts-ii, url: https://leetcode.com/problems/reported-posts-ii, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 1133: questionNo: 1133, acRate: 69.11434918003168, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Largest Unique Number, slug: largest-unique-number, url: https://leetcode.com/problems/largest-unique-number, topics: ['Array', 'Hash Table', 'Sorting'], hasSolution: True, hasVideoSolution: False, 1134: questionNo: 1134, acRate: 77.78033376552762, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Armstrong Number, slug: armstrong-number, url: https://leetcode.com/problems/armstrong-number, topics: ['Math'], hasSolution: True, hasVideoSolution: False, 1135: questionNo: 1135, acRate: 62.07405075351489, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Connecting Cities With Minimum Cost, slug: connecting-cities-with-minimum-cost, url: https://leetcode.com/problems/connecting-cities-with-minimum-cost, topics: ['Union Find', 'Graph', 'Heap (Priority Queue)', 'Minimum Spanning Tree'], hasSolution: True, hasVideoSolution: False, 1136: questionNo: 1136, acRate: 61.47955083816059, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Parallel Courses, slug: parallel-courses, url: https://leetcode.com/problems/parallel-courses, topics: ['Graph', 'Topological Sort'], hasSolution: True, hasVideoSolution: False, 1137: questionNo: 1137, acRate: 63.795541020016145, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: N-th Tribonacci Number, slug: n-th-tribonacci-number, url: https://leetcode.com/problems/n-th-tribonacci-number, topics: ['Math', 'Dynamic Programming', 'Memoization'], hasSolution: True, hasVideoSolution: False, 1138: questionNo: 1138, acRate: 51.66706405976792, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Alphabet Board Path, slug: alphabet-board-path, url: https://leetcode.com/problems/alphabet-board-path, topics: ['Hash Table', 'String'], hasSolution: False, hasVideoSolution: False, 1139: questionNo: 1139, acRate: 50.24939124970545, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Largest 1-Bordered Square, slug: largest-1-bordered-square, url: https://leetcode.com/problems/largest-1-bordered-square, topics: ['Array', 'Dynamic Programming', 'Matrix'], hasSolution: False, hasVideoSolution: False, 1140: questionNo: 1140, acRate: 67.44891454350582, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Stone Game II, slug: stone-game-ii, url: https://leetcode.com/problems/stone-game-ii, topics: ['Array', 'Math', 'Dynamic Programming', 'Prefix Sum', 'Game Theory'], hasSolution: True, hasVideoSolution: False, 1141: questionNo: 1141, acRate: 48.62317456807743, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: User Activity for the Past 30 Days I, slug: user-activity-for-the-past-30-days-i, url: https://leetcode.com/problems/user-activity-for-the-past-30-days-i, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 1142: questionNo: 1142, acRate: 35.719997334577194, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: User Activity for the Past 30 Days II, slug: user-activity-for-the-past-30-days-ii, url: https://leetcode.com/problems/user-activity-for-the-past-30-days-ii, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 1143: questionNo: 1143, acRate: 57.73874625000944, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Longest Common Subsequence, slug: longest-common-subsequence, url: https://leetcode.com/problems/longest-common-subsequence, topics: ['String', 'Dynamic Programming'], hasSolution: True, hasVideoSolution: False, 1144: questionNo: 1144, acRate: 47.94044550810015, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Decrease Elements To Make Array Zigzag, slug: decrease-elements-to-make-array-zigzag, url: https://leetcode.com/problems/decrease-elements-to-make-array-zigzag, topics: ['Array', 'Greedy'], hasSolution: False, hasVideoSolution: False, 1145: questionNo: 1145, acRate: 52.09683376422791, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Binary Tree Coloring Game, slug: binary-tree-coloring-game, url: https://leetcode.com/problems/binary-tree-coloring-game, topics: ['Tree', 'Depth-First Search', 'Binary Tree'], hasSolution: False, hasVideoSolution: False, 1146: questionNo: 1146, acRate: 36.91738829408282, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Snapshot Array, slug: snapshot-array, url: https://leetcode.com/problems/snapshot-array, topics: ['Array', 'Hash Table', 'Binary Search', 'Design'], hasSolution: True, hasVideoSolution: False, 1147: questionNo: 1147, acRate: 58.684966637380384, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Longest Chunked Palindrome Decomposition, slug: longest-chunked-palindrome-decomposition, url: https://leetcode.com/problems/longest-chunked-palindrome-decomposition, topics: ['Two Pointers', 'String', 'Dynamic Programming', 'Greedy', 'Rolling Hash', 'Hash Function'], hasSolution: False, hasVideoSolution: False, 1148: questionNo: 1148, acRate: 75.82316585859662, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Article Views I, slug: article-views-i, url: https://leetcode.com/problems/article-views-i, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 1149: questionNo: 1149, acRate: 47.0528164190443, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Article Views II, slug: article-views-ii, url: https://leetcode.com/problems/article-views-ii, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 1150: questionNo: 1150, acRate: 58.917485242169256, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Check If a Number Is Majority Element in a Sorted Array, slug: check-if-a-number-is-majority-element-in-a-sorted-array, url: https://leetcode.com/problems/check-if-a-number-is-majority-element-in-a-sorted-array, topics: ['Array', 'Binary Search'], hasSolution: True, hasVideoSolution: False, 1151: questionNo: 1151, acRate: 60.181094003756165, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Minimum Swaps to Group All 1's Together, slug: minimum-swaps-to-group-all-1s-together, url: https://leetcode.com/problems/minimum-swaps-to-group-all-1s-together, topics: ['Array', 'Sliding Window'], hasSolution: True, hasVideoSolution: True, 1152: questionNo: 1152, acRate: 42.72188752065317, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Analyze User Website Visit Pattern, slug: analyze-user-website-visit-pattern, url: https://leetcode.com/problems/analyze-user-website-visit-pattern, topics: ['Array', 'Hash Table', 'Sorting'], hasSolution: False, hasVideoSolution: False, 1153: questionNo: 1153, acRate: 34.95538250726914, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: String Transforms Into Another String, slug: string-transforms-into-another-string, url: https://leetcode.com/problems/string-transforms-into-another-string, topics: ['Hash Table', 'String'], hasSolution: True, hasVideoSolution: False, 1154: questionNo: 1154, acRate: 48.892591984102765, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Day of the Year, slug: day-of-the-year, url: https://leetcode.com/problems/day-of-the-year, topics: ['Math', 'String'], hasSolution: False, hasVideoSolution: False, 1155: questionNo: 1155, acRate: 61.025014721860515, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Number of Dice Rolls With Target Sum, slug: number-of-dice-rolls-with-target-sum, url: https://leetcode.com/problems/number-of-dice-rolls-with-target-sum, topics: ['Dynamic Programming'], hasSolution: True, hasVideoSolution: False, 1156: questionNo: 1156, acRate: 44.08101156730989, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Swap For Longest Repeated Character Substring, slug: swap-for-longest-repeated-character-substring, url: https://leetcode.com/problems/swap-for-longest-repeated-character-substring, topics: ['Hash Table', 'String', 'Sliding Window'], hasSolution: False, hasVideoSolution: False, 1157: questionNo: 1157, acRate: 41.809584476675816, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Online Majority Element In Subarray, slug: online-majority-element-in-subarray, url: https://leetcode.com/problems/online-majority-element-in-subarray, topics: ['Array', 'Binary Search', 'Design', 'Binary Indexed Tree', 'Segment Tree'], hasSolution: False, hasVideoSolution: False, 1158: questionNo: 1158, acRate: 57.070459201092525, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Market Analysis I, slug: market-analysis-i, url: https://leetcode.com/problems/market-analysis-i, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 1159: questionNo: 1159, acRate: 57.08061647895673, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Market Analysis II, slug: market-analysis-ii, url: https://leetcode.com/problems/market-analysis-ii, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 1160: questionNo: 1160, acRate: 70.64509507548192, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Find Words That Can Be Formed by Characters, slug: find-words-that-can-be-formed-by-characters, url: https://leetcode.com/problems/find-words-that-can-be-formed-by-characters, topics: ['Array', 'Hash Table', 'String'], hasSolution: True, hasVideoSolution: False, 1161: questionNo: 1161, acRate: 67.14030747603658, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum Level Sum of a Binary Tree, slug: maximum-level-sum-of-a-binary-tree, url: https://leetcode.com/problems/maximum-level-sum-of-a-binary-tree, topics: ['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 1162: questionNo: 1162, acRate: 51.60356788899902, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: As Far from Land as Possible, slug: as-far-from-land-as-possible, url: https://leetcode.com/problems/as-far-from-land-as-possible, topics: ['Array', 'Dynamic Programming', 'Breadth-First Search', 'Matrix'], hasSolution: True, hasVideoSolution: False, 1163: questionNo: 1163, acRate: 34.556072453726614, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Last Substring in Lexicographical Order, slug: last-substring-in-lexicographical-order, url: https://leetcode.com/problems/last-substring-in-lexicographical-order, topics: ['Two Pointers', 'String'], hasSolution: False, hasVideoSolution: False, 1164: questionNo: 1164, acRate: 55.93086046539975, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Product Price at a Given Date, slug: product-price-at-a-given-date, url: https://leetcode.com/problems/product-price-at-a-given-date, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 1165: questionNo: 1165, acRate: 87.53055242847435, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Single-Row Keyboard, slug: single-row-keyboard, url: https://leetcode.com/problems/single-row-keyboard, topics: ['Hash Table', 'String'], hasSolution: True, hasVideoSolution: True, 1166: questionNo: 1166, acRate: 63.08577298407807, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Design File System, slug: design-file-system, url: https://leetcode.com/problems/design-file-system, topics: ['Hash Table', 'String', 'Design', 'Trie'], hasSolution: True, hasVideoSolution: False, 1167: questionNo: 1167, acRate: 70.13304889687308, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Minimum Cost to Connect Sticks, slug: minimum-cost-to-connect-sticks, url: https://leetcode.com/problems/minimum-cost-to-connect-sticks, topics: ['Array', 'Greedy', 'Heap (Priority Queue)'], hasSolution: True, hasVideoSolution: True, 1168: questionNo: 1168, acRate: 64.81650950277856, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Optimize Water Distribution in a Village, slug: optimize-water-distribution-in-a-village, url: https://leetcode.com/problems/optimize-water-distribution-in-a-village, topics: ['Union Find', 'Graph', 'Heap (Priority Queue)', 'Minimum Spanning Tree'], hasSolution: True, hasVideoSolution: False, 1169: questionNo: 1169, acRate: 31.122408165877385, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Invalid Transactions, slug: invalid-transactions, url: https://leetcode.com/problems/invalid-transactions, topics: ['Array', 'Hash Table', 'String', 'Sorting'], hasSolution: False, hasVideoSolution: False, 1170: questionNo: 1170, acRate: 62.34134413326711, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Compare Strings by Frequency of the Smallest Character, slug: compare-strings-by-frequency-of-the-smallest-character, url: https://leetcode.com/problems/compare-strings-by-frequency-of-the-smallest-character, topics: ['Array', 'Hash Table', 'String', 'Binary Search', 'Sorting'], hasSolution: False, hasVideoSolution: False, 1171: questionNo: 1171, acRate: 52.77650415201997, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Remove Zero Sum Consecutive Nodes from Linked List, slug: remove-zero-sum-consecutive-nodes-from-linked-list, url: https://leetcode.com/problems/remove-zero-sum-consecutive-nodes-from-linked-list, topics: ['Hash Table', 'Linked List'], hasSolution: True, hasVideoSolution: False, 1172: questionNo: 1172, acRate: 32.70936133597907, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Dinner Plate Stacks, slug: dinner-plate-stacks, url: https://leetcode.com/problems/dinner-plate-stacks, topics: ['Hash Table', 'Stack', 'Design', 'Heap (Priority Queue)'], hasSolution: False, hasVideoSolution: False, 1173: questionNo: 1173, acRate: 80.88613676399936, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Immediate Food Delivery I, slug: immediate-food-delivery-i, url: https://leetcode.com/problems/immediate-food-delivery-i, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 1174: questionNo: 1174, acRate: 51.63179813288929, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Immediate Food Delivery II, slug: immediate-food-delivery-ii, url: https://leetcode.com/problems/immediate-food-delivery-ii, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 1175: questionNo: 1175, acRate: 57.616359800191155, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Prime Arrangements, slug: prime-arrangements, url: https://leetcode.com/problems/prime-arrangements, topics: ['Math'], hasSolution: False, hasVideoSolution: False, 1176: questionNo: 1176, acRate: 53.4780270811947, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Diet Plan Performance, slug: diet-plan-performance, url: https://leetcode.com/problems/diet-plan-performance, topics: ['Array', 'Sliding Window'], hasSolution: False, hasVideoSolution: False, 1177: questionNo: 1177, acRate: 39.19977771603223, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Can Make Palindrome from Substring, slug: can-make-palindrome-from-substring, url: https://leetcode.com/problems/can-make-palindrome-from-substring, topics: ['Array', 'Hash Table', 'String', 'Bit Manipulation', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 1178: questionNo: 1178, acRate: 46.7891552767197, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Number of Valid Words for Each Puzzle, slug: number-of-valid-words-for-each-puzzle, url: https://leetcode.com/problems/number-of-valid-words-for-each-puzzle, topics: ['Array', 'Hash Table', 'String', 'Bit Manipulation', 'Trie'], hasSolution: True, hasVideoSolution: False, 1179: questionNo: 1179, acRate: 76.99452159510766, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Reformat Department Table, slug: reformat-department-table, url: https://leetcode.com/problems/reformat-department-table, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 1180: questionNo: 1180, acRate: 79.9942288270091, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Count Substrings with Only One Distinct Letter, slug: count-substrings-with-only-one-distinct-letter, url: https://leetcode.com/problems/count-substrings-with-only-one-distinct-letter, topics: ['Math', 'String'], hasSolution: True, hasVideoSolution: False, 1181: questionNo: 1181, acRate: 45.89294173377546, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Before and After Puzzle, slug: before-and-after-puzzle, url: https://leetcode.com/problems/before-and-after-puzzle, topics: ['Array', 'Hash Table', 'String', 'Sorting'], hasSolution: False, hasVideoSolution: False, 1182: questionNo: 1182, acRate: 55.419345885182956, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Shortest Distance to Target Color, slug: shortest-distance-to-target-color, url: https://leetcode.com/problems/shortest-distance-to-target-color, topics: ['Array', 'Binary Search', 'Dynamic Programming'], hasSolution: True, hasVideoSolution: False, 1183: questionNo: 1183, acRate: 68.08020593415527, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Maximum Number of Ones, slug: maximum-number-of-ones, url: https://leetcode.com/problems/maximum-number-of-ones, topics: ['Greedy', 'Heap (Priority Queue)'], hasSolution: False, hasVideoSolution: False, 1184: questionNo: 1184, acRate: 54.11952638831594, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Distance Between Bus Stops, slug: distance-between-bus-stops, url: https://leetcode.com/problems/distance-between-bus-stops, topics: ['Array'], hasSolution: False, hasVideoSolution: False, 1185: questionNo: 1185, acRate: 57.67800077777589, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Day of the Week, slug: day-of-the-week, url: https://leetcode.com/problems/day-of-the-week, topics: ['Math'], hasSolution: False, hasVideoSolution: False, 1186: questionNo: 1186, acRate: 44.11434011506233, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum Subarray Sum with One Deletion, slug: maximum-subarray-sum-with-one-deletion, url: https://leetcode.com/problems/maximum-subarray-sum-with-one-deletion, topics: ['Array', 'Dynamic Programming'], hasSolution: False, hasVideoSolution: False, 1187: questionNo: 1187, acRate: 58.201633247250506, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Make Array Strictly Increasing, slug: make-array-strictly-increasing, url: https://leetcode.com/problems/make-array-strictly-increasing, topics: ['Array', 'Binary Search', 'Dynamic Programming', 'Sorting'], hasSolution: True, hasVideoSolution: False, 1188: questionNo: 1188, acRate: 72.4810832337714, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Design Bounded Blocking Queue, slug: design-bounded-blocking-queue, url: https://leetcode.com/problems/design-bounded-blocking-queue, topics: ['Concurrency'], hasSolution: False, hasVideoSolution: False, 1189: questionNo: 1189, acRate: 59.6866576342906, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Maximum Number of Balloons, slug: maximum-number-of-balloons, url: https://leetcode.com/problems/maximum-number-of-balloons, topics: ['Hash Table', 'String', 'Counting'], hasSolution: True, hasVideoSolution: False, 1190: questionNo: 1190, acRate: 71.67055239412917, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Reverse Substrings Between Each Pair of Parentheses, slug: reverse-substrings-between-each-pair-of-parentheses, url: https://leetcode.com/problems/reverse-substrings-between-each-pair-of-parentheses, topics: ['String', 'Stack'], hasSolution: True, hasVideoSolution: False, 1191: questionNo: 1191, acRate: 23.83251527596915, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: K-Concatenation Maximum Sum, slug: k-concatenation-maximum-sum, url: https://leetcode.com/problems/k-concatenation-maximum-sum, topics: ['Array', 'Dynamic Programming'], hasSolution: False, hasVideoSolution: False, 1192: questionNo: 1192, acRate: 56.16234312789037, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Critical Connections in a Network, slug: critical-connections-in-a-network, url: https://leetcode.com/problems/critical-connections-in-a-network, topics: ['Depth-First Search', 'Graph', 'Biconnected Component'], hasSolution: True, hasVideoSolution: False, 1193: questionNo: 1193, acRate: 57.76298688052594, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Monthly Transactions I, slug: monthly-transactions-i, url: https://leetcode.com/problems/monthly-transactions-i, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 1194: questionNo: 1194, acRate: 49.13332555698122, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Tournament Winners, slug: tournament-winners, url: https://leetcode.com/problems/tournament-winners, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 1195: questionNo: 1195, acRate: 72.58424685343078, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Fizz Buzz Multithreaded, slug: fizz-buzz-multithreaded, url: https://leetcode.com/problems/fizz-buzz-multithreaded, topics: ['Concurrency'], hasSolution: False, hasVideoSolution: False, 1196: questionNo: 1196, acRate: 67.0600479491516, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: How Many Apples Can You Put into the Basket, slug: how-many-apples-can-you-put-into-the-basket, url: https://leetcode.com/problems/how-many-apples-can-you-put-into-the-basket, topics: ['Array', 'Greedy', 'Sorting'], hasSolution: True, hasVideoSolution: True, 1197: questionNo: 1197, acRate: 40.63280365399508, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Minimum Knight Moves, slug: minimum-knight-moves, url: https://leetcode.com/problems/minimum-knight-moves, topics: ['Breadth-First Search'], hasSolution: True, hasVideoSolution: False, 1198: questionNo: 1198, acRate: 76.48123403751501, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Find Smallest Common Element in All Rows, slug: find-smallest-common-element-in-all-rows, url: https://leetcode.com/problems/find-smallest-common-element-in-all-rows, topics: ['Array', 'Hash Table', 'Binary Search', 'Matrix', 'Counting'], hasSolution: True, hasVideoSolution: True, 1199: questionNo: 1199, acRate: 45.76717742494626, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Minimum Time to Build Blocks, slug: minimum-time-to-build-blocks, url: https://leetcode.com/problems/minimum-time-to-build-blocks, topics: ['Array', 'Math', 'Greedy', 'Heap (Priority Queue)'], hasSolution: True, hasVideoSolution: False, 1200: questionNo: 1200, acRate: 69.64006865213905, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Minimum Absolute Difference, slug: minimum-absolute-difference, url: https://leetcode.com/problems/minimum-absolute-difference, topics: ['Array', 'Sorting'], hasSolution: True, hasVideoSolution: False, 1201: questionNo: 1201, acRate: 29.702898485027063, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Ugly Number III, slug: ugly-number-iii, url: https://leetcode.com/problems/ugly-number-iii, topics: ['Math', 'Binary Search', 'Combinatorics', 'Number Theory'], hasSolution: False, hasVideoSolution: False, 1202: questionNo: 1202, acRate: 58.44097506438539, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Smallest String With Swaps, slug: smallest-string-with-swaps, url: https://leetcode.com/problems/smallest-string-with-swaps, topics: ['Array', 'Hash Table', 'String', 'Depth-First Search', 'Breadth-First Search', 'Union Find', 'Sorting'], hasSolution: True, hasVideoSolution: False, 1203: questionNo: 1203, acRate: 66.33810652605099, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Sort Items by Groups Respecting Dependencies, slug: sort-items-by-groups-respecting-dependencies, url: https://leetcode.com/problems/sort-items-by-groups-respecting-dependencies, topics: ['Depth-First Search', 'Breadth-First Search', 'Graph', 'Topological Sort'], hasSolution: True, hasVideoSolution: False, 1204: questionNo: 1204, acRate: 67.15349911862246, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Last Person to Fit in the Bus, slug: last-person-to-fit-in-the-bus, url: https://leetcode.com/problems/last-person-to-fit-in-the-bus, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 1205: questionNo: 1205, acRate: 41.7794038907728, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Monthly Transactions II, slug: monthly-transactions-ii, url: https://leetcode.com/problems/monthly-transactions-ii, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 1206: questionNo: 1206, acRate: 61.67098213141231, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Design Skiplist, slug: design-skiplist, url: https://leetcode.com/problems/design-skiplist, topics: ['Linked List', 'Design'], hasSolution: False, hasVideoSolution: False, 1207: questionNo: 1207, acRate: 77.32519272394079, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Unique Number of Occurrences, slug: unique-number-of-occurrences, url: https://leetcode.com/problems/unique-number-of-occurrences, topics: ['Array', 'Hash Table'], hasSolution: True, hasVideoSolution: True, 1208: questionNo: 1208, acRate: 58.31507333773275, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Get Equal Substrings Within Budget, slug: get-equal-substrings-within-budget, url: https://leetcode.com/problems/get-equal-substrings-within-budget, topics: ['String', 'Binary Search', 'Sliding Window', 'Prefix Sum'], hasSolution: True, hasVideoSolution: False, 1209: questionNo: 1209, acRate: 58.08365078685671, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Remove All Adjacent Duplicates in String II, slug: remove-all-adjacent-duplicates-in-string-ii, url: https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string-ii, topics: ['String', 'Stack'], hasSolution: True, hasVideoSolution: False, 1210: questionNo: 1210, acRate: 49.74565062569946, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Minimum Moves to Reach Target with Rotations, slug: minimum-moves-to-reach-target-with-rotations, url: https://leetcode.com/problems/minimum-moves-to-reach-target-with-rotations, topics: ['Array', 'Breadth-First Search', 'Matrix'], hasSolution: False, hasVideoSolution: False, 1211: questionNo: 1211, acRate: 45.689681087968474, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Queries Quality and Percentage, slug: queries-quality-and-percentage, url: https://leetcode.com/problems/queries-quality-and-percentage, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 1212: questionNo: 1212, acRate: 55.79390145057156, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Team Scores in Football Tournament, slug: team-scores-in-football-tournament, url: https://leetcode.com/problems/team-scores-in-football-tournament, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 1213: questionNo: 1213, acRate: 79.80870640433501, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Intersection of Three Sorted Arrays, slug: intersection-of-three-sorted-arrays, url: https://leetcode.com/problems/intersection-of-three-sorted-arrays, topics: ['Array', 'Hash Table', 'Binary Search', 'Counting'], hasSolution: True, hasVideoSolution: False, 1214: questionNo: 1214, acRate: 67.25889015955998, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Two Sum BSTs, slug: two-sum-bsts, url: https://leetcode.com/problems/two-sum-bsts, topics: ['Two Pointers', 'Binary Search', 'Stack', 'Tree', 'Depth-First Search', 'Binary Search Tree', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 1215: questionNo: 1215, acRate: 47.185266084193806, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Stepping Numbers, slug: stepping-numbers, url: https://leetcode.com/problems/stepping-numbers, topics: ['Backtracking', 'Breadth-First Search'], hasSolution: False, hasVideoSolution: False, 1216: questionNo: 1216, acRate: 49.33437582165146, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Valid Palindrome III, slug: valid-palindrome-iii, url: https://leetcode.com/problems/valid-palindrome-iii, topics: ['String', 'Dynamic Programming'], hasSolution: True, hasVideoSolution: False, 1217: questionNo: 1217, acRate: 71.74241764936252, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Minimum Cost to Move Chips to The Same Position, slug: minimum-cost-to-move-chips-to-the-same-position, url: https://leetcode.com/problems/minimum-cost-to-move-chips-to-the-same-position, topics: ['Array', 'Math', 'Greedy'], hasSolution: True, hasVideoSolution: False, 1218: questionNo: 1218, acRate: 54.695762718239195, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Longest Arithmetic Subsequence of Given Difference, slug: longest-arithmetic-subsequence-of-given-difference, url: https://leetcode.com/problems/longest-arithmetic-subsequence-of-given-difference, topics: ['Array', 'Hash Table', 'Dynamic Programming'], hasSolution: True, hasVideoSolution: False, 1219: questionNo: 1219, acRate: 68.01367033462276, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Path with Maximum Gold, slug: path-with-maximum-gold, url: https://leetcode.com/problems/path-with-maximum-gold, topics: ['Array', 'Backtracking', 'Matrix'], hasSolution: True, hasVideoSolution: False, 1220: questionNo: 1220, acRate: 61.85492893168272, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Count Vowels Permutation, slug: count-vowels-permutation, url: https://leetcode.com/problems/count-vowels-permutation, topics: ['Dynamic Programming'], hasSolution: True, hasVideoSolution: False, 1221: questionNo: 1221, acRate: 86.26673277144273, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Split a String in Balanced Strings, slug: split-a-string-in-balanced-strings, url: https://leetcode.com/problems/split-a-string-in-balanced-strings, topics: ['String', 'Greedy', 'Counting'], hasSolution: False, hasVideoSolution: False, 1222: questionNo: 1222, acRate: 71.98215825429463, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Queens That Can Attack the King, slug: queens-that-can-attack-the-king, url: https://leetcode.com/problems/queens-that-can-attack-the-king, topics: ['Array', 'Matrix', 'Simulation'], hasSolution: False, hasVideoSolution: False, 1223: questionNo: 1223, acRate: 49.254268332570156, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Dice Roll Simulation, slug: dice-roll-simulation, url: https://leetcode.com/problems/dice-roll-simulation, topics: ['Array', 'Dynamic Programming'], hasSolution: False, hasVideoSolution: False, 1224: questionNo: 1224, acRate: 37.1280568606192, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Maximum Equal Frequency, slug: maximum-equal-frequency, url: https://leetcode.com/problems/maximum-equal-frequency, topics: ['Array', 'Hash Table'], hasSolution: False, hasVideoSolution: False, 1225: questionNo: 1225, acRate: 57.582422953784494, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Report Contiguous Dates, slug: report-contiguous-dates, url: https://leetcode.com/problems/report-contiguous-dates, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 1226: questionNo: 1226, acRate: 53.87528638000093, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: The Dining Philosophers, slug: the-dining-philosophers, url: https://leetcode.com/problems/the-dining-philosophers, topics: ['Concurrency'], hasSolution: False, hasVideoSolution: False, 1227: questionNo: 1227, acRate: 66.47115873089179, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Airplane Seat Assignment Probability, slug: airplane-seat-assignment-probability, url: https://leetcode.com/problems/airplane-seat-assignment-probability, topics: ['Math', 'Dynamic Programming', 'Brainteaser', 'Probability and Statistics'], hasSolution: False, hasVideoSolution: False, 1228: questionNo: 1228, acRate: 51.95232455398266, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Missing Number In Arithmetic Progression, slug: missing-number-in-arithmetic-progression, url: https://leetcode.com/problems/missing-number-in-arithmetic-progression, topics: ['Array', 'Math'], hasSolution: True, hasVideoSolution: True, 1229: questionNo: 1229, acRate: 54.9992326045402, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Meeting Scheduler, slug: meeting-scheduler, url: https://leetcode.com/problems/meeting-scheduler, topics: ['Array', 'Two Pointers', 'Sorting'], hasSolution: True, hasVideoSolution: False, 1230: questionNo: 1230, acRate: 56.25894356996205, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Toss Strange Coins, slug: toss-strange-coins, url: https://leetcode.com/problems/toss-strange-coins, topics: ['Array', 'Math', 'Dynamic Programming', 'Probability and Statistics'], hasSolution: True, hasVideoSolution: False, 1231: questionNo: 1231, acRate: 58.806503068780835, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Divide Chocolate, slug: divide-chocolate, url: https://leetcode.com/problems/divide-chocolate, topics: ['Array', 'Binary Search'], hasSolution: True, hasVideoSolution: False, 1232: questionNo: 1232, acRate: 39.53362733284974, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Check If It Is a Straight Line, slug: check-if-it-is-a-straight-line, url: https://leetcode.com/problems/check-if-it-is-a-straight-line, topics: ['Array', 'Math', 'Geometry'], hasSolution: True, hasVideoSolution: False, 1233: questionNo: 1233, acRate: 66.00587012351718, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Remove Sub-Folders from the Filesystem, slug: remove-sub-folders-from-the-filesystem, url: https://leetcode.com/problems/remove-sub-folders-from-the-filesystem, topics: ['Array', 'String', 'Depth-First Search', 'Trie'], hasSolution: False, hasVideoSolution: False, 1234: questionNo: 1234, acRate: 38.49500783621757, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Replace the Substring for Balanced String, slug: replace-the-substring-for-balanced-string, url: https://leetcode.com/problems/replace-the-substring-for-balanced-string, topics: ['String', 'Sliding Window'], hasSolution: False, hasVideoSolution: False, 1235: questionNo: 1235, acRate: 54.38685903139259, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Maximum Profit in Job Scheduling, slug: maximum-profit-in-job-scheduling, url: https://leetcode.com/problems/maximum-profit-in-job-scheduling, topics: ['Array', 'Binary Search', 'Dynamic Programming', 'Sorting'], hasSolution: True, hasVideoSolution: False, 1236: questionNo: 1236, acRate: 67.91411799961219, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Web Crawler, slug: web-crawler, url: https://leetcode.com/problems/web-crawler, topics: ['String', 'Depth-First Search', 'Breadth-First Search', 'Interactive'], hasSolution: True, hasVideoSolution: False, 1237: questionNo: 1237, acRate: 69.62289794510822, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Find Positive Integer Solution for a Given Equation, slug: find-positive-integer-solution-for-a-given-equation, url: https://leetcode.com/problems/find-positive-integer-solution-for-a-given-equation, topics: ['Math', 'Two Pointers', 'Binary Search', 'Interactive'], hasSolution: False, hasVideoSolution: False, 1238: questionNo: 1238, acRate: 70.26624961855356, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Circular Permutation in Binary Representation, slug: circular-permutation-in-binary-representation, url: https://leetcode.com/problems/circular-permutation-in-binary-representation, topics: ['Math', 'Backtracking', 'Bit Manipulation'], hasSolution: False, hasVideoSolution: False, 1239: questionNo: 1239, acRate: 54.09895880842856, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum Length of a Concatenated String with Unique Characters, slug: maximum-length-of-a-concatenated-string-with-unique-characters, url: https://leetcode.com/problems/maximum-length-of-a-concatenated-string-with-unique-characters, topics: ['Array', 'String', 'Backtracking', 'Bit Manipulation'], hasSolution: True, hasVideoSolution: False, 1240: questionNo: 1240, acRate: 54.330780038979285, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Tiling a Rectangle with the Fewest Squares, slug: tiling-a-rectangle-with-the-fewest-squares, url: https://leetcode.com/problems/tiling-a-rectangle-with-the-fewest-squares, topics: ['Backtracking'], hasSolution: False, hasVideoSolution: False, 1241: questionNo: 1241, acRate: 65.89804931910194, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Number of Comments per Post, slug: number-of-comments-per-post, url: https://leetcode.com/problems/number-of-comments-per-post, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 1242: questionNo: 1242, acRate: 49.27054770442241, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Web Crawler Multithreaded, slug: web-crawler-multithreaded, url: https://leetcode.com/problems/web-crawler-multithreaded, topics: ['Depth-First Search', 'Breadth-First Search', 'Concurrency'], hasSolution: False, hasVideoSolution: False, 1243: questionNo: 1243, acRate: 52.337956737234414, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Array Transformation, slug: array-transformation, url: https://leetcode.com/problems/array-transformation, topics: ['Array', 'Simulation'], hasSolution: False, hasVideoSolution: False, 1244: questionNo: 1244, acRate: 67.8921769171326, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Design A Leaderboard, slug: design-a-leaderboard, url: https://leetcode.com/problems/design-a-leaderboard, topics: ['Hash Table', 'Design', 'Sorting'], hasSolution: True, hasVideoSolution: False, 1245: questionNo: 1245, acRate: 61.190229180420644, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Tree Diameter, slug: tree-diameter, url: https://leetcode.com/problems/tree-diameter, topics: ['Tree', 'Depth-First Search', 'Breadth-First Search', 'Graph', 'Topological Sort'], hasSolution: True, hasVideoSolution: False, 1246: questionNo: 1246, acRate: 46.39643499871454, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Palindrome Removal, slug: palindrome-removal, url: https://leetcode.com/problems/palindrome-removal, topics: ['Array', 'Dynamic Programming'], hasSolution: False, hasVideoSolution: False, 1247: questionNo: 1247, acRate: 64.4199177007241, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Swaps to Make Strings Equal, slug: minimum-swaps-to-make-strings-equal, url: https://leetcode.com/problems/minimum-swaps-to-make-strings-equal, topics: ['Math', 'String', 'Greedy'], hasSolution: False, hasVideoSolution: False, 1248: questionNo: 1248, acRate: 71.18738058111698, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Count Number of Nice Subarrays, slug: count-number-of-nice-subarrays, url: https://leetcode.com/problems/count-number-of-nice-subarrays, topics: ['Array', 'Hash Table', 'Math', 'Sliding Window'], hasSolution: True, hasVideoSolution: False, 1249: questionNo: 1249, acRate: 69.09440926242249, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Remove to Make Valid Parentheses, slug: minimum-remove-to-make-valid-parentheses, url: https://leetcode.com/problems/minimum-remove-to-make-valid-parentheses, topics: ['String', 'Stack'], hasSolution: True, hasVideoSolution: False, 1250: questionNo: 1250, acRate: 59.6820341850571, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Check If It Is a Good Array, slug: check-if-it-is-a-good-array, url: https://leetcode.com/problems/check-if-it-is-a-good-array, topics: ['Array', 'Math', 'Number Theory'], hasSolution: False, hasVideoSolution: False, 1251: questionNo: 1251, acRate: 38.21460256421669, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Average Selling Price, slug: average-selling-price, url: https://leetcode.com/problems/average-selling-price, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 1252: questionNo: 1252, acRate: 78.75178591984182, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Cells with Odd Values in a Matrix, slug: cells-with-odd-values-in-a-matrix, url: https://leetcode.com/problems/cells-with-odd-values-in-a-matrix, topics: ['Array', 'Math', 'Simulation'], hasSolution: False, hasVideoSolution: False, 1253: questionNo: 1253, acRate: 46.630723291307234, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Reconstruct a 2-Row Binary Matrix, slug: reconstruct-a-2-row-binary-matrix, url: https://leetcode.com/problems/reconstruct-a-2-row-binary-matrix, topics: ['Array', 'Greedy', 'Matrix'], hasSolution: False, hasVideoSolution: False, 1254: questionNo: 1254, acRate: 66.40413087293152, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Number of Closed Islands, slug: number-of-closed-islands, url: https://leetcode.com/problems/number-of-closed-islands, topics: ['Array', 'Depth-First Search', 'Breadth-First Search', 'Union Find', 'Matrix'], hasSolution: True, hasVideoSolution: False, 1255: questionNo: 1255, acRate: 82.08901882018256, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Maximum Score Words Formed by Letters, slug: maximum-score-words-formed-by-letters, url: https://leetcode.com/problems/maximum-score-words-formed-by-letters, topics: ['Array', 'String', 'Dynamic Programming', 'Backtracking', 'Bit Manipulation', 'Bitmask'], hasSolution: True, hasVideoSolution: False, 1256: questionNo: 1256, acRate: 69.81081563448153, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Encode Number, slug: encode-number, url: https://leetcode.com/problems/encode-number, topics: ['Math', 'String', 'Bit Manipulation'], hasSolution: False, hasVideoSolution: False, 1257: questionNo: 1257, acRate: 65.80976863753213, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Smallest Common Region, slug: smallest-common-region, url: https://leetcode.com/problems/smallest-common-region, topics: ['Array', 'Hash Table', 'String', 'Tree', 'Depth-First Search', 'Breadth-First Search'], hasSolution: False, hasVideoSolution: False, 1258: questionNo: 1258, acRate: 56.380646104370705, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Synonymous Sentences, slug: synonymous-sentences, url: https://leetcode.com/problems/synonymous-sentences, topics: ['Array', 'Hash Table', 'String', 'Backtracking', 'Union Find'], hasSolution: False, hasVideoSolution: False, 1259: questionNo: 1259, acRate: 59.5984752223634, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Handshakes That Don't Cross, slug: handshakes-that-dont-cross, url: https://leetcode.com/problems/handshakes-that-dont-cross, topics: ['Math', 'Dynamic Programming'], hasSolution: True, hasVideoSolution: False, 1260: questionNo: 1260, acRate: 67.40802340994922, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Shift 2D Grid, slug: shift-2d-grid, url: https://leetcode.com/problems/shift-2d-grid, topics: ['Array', 'Matrix', 'Simulation'], hasSolution: True, hasVideoSolution: False, 1261: questionNo: 1261, acRate: 77.42087304388751, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Find Elements in a Contaminated Binary Tree, slug: find-elements-in-a-contaminated-binary-tree, url: https://leetcode.com/problems/find-elements-in-a-contaminated-binary-tree, topics: ['Hash Table', 'Tree', 'Depth-First Search', 'Breadth-First Search', 'Design', 'Binary Tree'], hasSolution: False, hasVideoSolution: False, 1262: questionNo: 1262, acRate: 50.60502190674116, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Greatest Sum Divisible by Three, slug: greatest-sum-divisible-by-three, url: https://leetcode.com/problems/greatest-sum-divisible-by-three, topics: ['Array', 'Dynamic Programming', 'Greedy', 'Sorting'], hasSolution: False, hasVideoSolution: False, 1263: questionNo: 1263, acRate: 49.00693240901213, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Minimum Moves to Move a Box to Their Target Location, slug: minimum-moves-to-move-a-box-to-their-target-location, url: https://leetcode.com/problems/minimum-moves-to-move-a-box-to-their-target-location, topics: ['Array', 'Breadth-First Search', 'Heap (Priority Queue)', 'Matrix'], hasSolution: False, hasVideoSolution: False, 1264: questionNo: 1264, acRate: 65.15386722673728, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Page Recommendations, slug: page-recommendations, url: https://leetcode.com/problems/page-recommendations, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 1265: questionNo: 1265, acRate: 94.0384, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Print Immutable Linked List in Reverse, slug: print-immutable-linked-list-in-reverse, url: https://leetcode.com/problems/print-immutable-linked-list-in-reverse, topics: ['Linked List', 'Two Pointers', 'Stack', 'Recursion'], hasSolution: True, hasVideoSolution: False, 1266: questionNo: 1266, acRate: 82.46172369240952, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Minimum Time Visiting All Points, slug: minimum-time-visiting-all-points, url: https://leetcode.com/problems/minimum-time-visiting-all-points, topics: ['Array', 'Math', 'Geometry'], hasSolution: True, hasVideoSolution: False, 1267: questionNo: 1267, acRate: 60.53067660262526, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Count Servers that Communicate, slug: count-servers-that-communicate, url: https://leetcode.com/problems/count-servers-that-communicate, topics: ['Array', 'Depth-First Search', 'Breadth-First Search', 'Union Find', 'Matrix', 'Counting'], hasSolution: False, hasVideoSolution: False, 1268: questionNo: 1268, acRate: 65.09871672343797, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Search Suggestions System, slug: search-suggestions-system, url: https://leetcode.com/problems/search-suggestions-system, topics: ['Array', 'String', 'Binary Search', 'Trie', 'Sorting', 'Heap (Priority Queue)'], hasSolution: True, hasVideoSolution: False, 1269: questionNo: 1269, acRate: 50.33008607859919, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Number of Ways to Stay in the Same Place After Some Steps, slug: number-of-ways-to-stay-in-the-same-place-after-some-steps, url: https://leetcode.com/problems/number-of-ways-to-stay-in-the-same-place-after-some-steps, topics: ['Dynamic Programming'], hasSolution: True, hasVideoSolution: False, 1270: questionNo: 1270, acRate: 84.77347529993477, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: All People Report to the Given Manager, slug: all-people-report-to-the-given-manager, url: https://leetcode.com/problems/all-people-report-to-the-given-manager, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 1271: questionNo: 1271, acRate: 58.06518580029064, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Hexspeak, slug: hexspeak, url: https://leetcode.com/problems/hexspeak, topics: ['Math', 'String'], hasSolution: False, hasVideoSolution: False, 1272: questionNo: 1272, acRate: 66.1754120780249, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Remove Interval, slug: remove-interval, url: https://leetcode.com/problems/remove-interval, topics: ['Array'], hasSolution: True, hasVideoSolution: True, 1273: questionNo: 1273, acRate: 61.14721172022685, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Delete Tree Nodes, slug: delete-tree-nodes, url: https://leetcode.com/problems/delete-tree-nodes, topics: ['Array', 'Tree', 'Depth-First Search', 'Breadth-First Search'], hasSolution: False, hasVideoSolution: False, 1274: questionNo: 1274, acRate: 68.66944743872146, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Number of Ships in a Rectangle, slug: number-of-ships-in-a-rectangle, url: https://leetcode.com/problems/number-of-ships-in-a-rectangle, topics: ['Array', 'Divide and Conquer', 'Interactive'], hasSolution: True, hasVideoSolution: False, 1275: questionNo: 1275, acRate: 53.9044376575043, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Find Winner on a Tic Tac Toe Game, slug: find-winner-on-a-tic-tac-toe-game, url: https://leetcode.com/problems/find-winner-on-a-tic-tac-toe-game, topics: ['Array', 'Hash Table', 'Matrix', 'Simulation'], hasSolution: True, hasVideoSolution: False, 1276: questionNo: 1276, acRate: 51.119237801943996, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Number of Burgers with No Waste of Ingredients, slug: number-of-burgers-with-no-waste-of-ingredients, url: https://leetcode.com/problems/number-of-burgers-with-no-waste-of-ingredients, topics: ['Math'], hasSolution: False, hasVideoSolution: False, 1277: questionNo: 1277, acRate: 75.3565899133643, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Count Square Submatrices with All Ones, slug: count-square-submatrices-with-all-ones, url: https://leetcode.com/problems/count-square-submatrices-with-all-ones, topics: ['Array', 'Dynamic Programming', 'Matrix'], hasSolution: False, hasVideoSolution: False, 1278: questionNo: 1278, acRate: 61.048986063590085, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Palindrome Partitioning III, slug: palindrome-partitioning-iii, url: https://leetcode.com/problems/palindrome-partitioning-iii, topics: ['String', 'Dynamic Programming'], hasSolution: False, hasVideoSolution: False, 1279: questionNo: 1279, acRate: 72.87381878821567, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Traffic Light Controlled Intersection, slug: traffic-light-controlled-intersection, url: https://leetcode.com/problems/traffic-light-controlled-intersection, topics: ['Concurrency'], hasSolution: False, hasVideoSolution: False, 1280: questionNo: 1280, acRate: 57.74722468337937, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Students and Examinations, slug: students-and-examinations, url: https://leetcode.com/problems/students-and-examinations, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 1281: questionNo: 1281, acRate: 86.535650200775, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Subtract the Product and Sum of Digits of an Integer, slug: subtract-the-product-and-sum-of-digits-of-an-integer, url: https://leetcode.com/problems/subtract-the-product-and-sum-of-digits-of-an-integer, topics: ['Math'], hasSolution: False, hasVideoSolution: False, 1282: questionNo: 1282, acRate: 87.43754313604748, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Group the People Given the Group Size They Belong To, slug: group-the-people-given-the-group-size-they-belong-to, url: https://leetcode.com/problems/group-the-people-given-the-group-size-they-belong-to, topics: ['Array', 'Hash Table'], hasSolution: True, hasVideoSolution: False, 1283: questionNo: 1283, acRate: 60.71890534453354, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Find the Smallest Divisor Given a Threshold, slug: find-the-smallest-divisor-given-a-threshold, url: https://leetcode.com/problems/find-the-smallest-divisor-given-a-threshold, topics: ['Array', 'Binary Search'], hasSolution: True, hasVideoSolution: False, 1284: questionNo: 1284, acRate: 72.12607228086772, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Minimum Number of Flips to Convert Binary Matrix to Zero Matrix, slug: minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix, url: https://leetcode.com/problems/minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix, topics: ['Array', 'Hash Table', 'Bit Manipulation', 'Breadth-First Search', 'Matrix'], hasSolution: True, hasVideoSolution: False, 1285: questionNo: 1285, acRate: 82.34350588480368, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Find the Start and End Number of Continuous Ranges, slug: find-the-start-and-end-number-of-continuous-ranges, url: https://leetcode.com/problems/find-the-start-and-end-number-of-continuous-ranges, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 1286: questionNo: 1286, acRate: 73.27980283817625, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Iterator for Combination, slug: iterator-for-combination, url: https://leetcode.com/problems/iterator-for-combination, topics: ['String', 'Backtracking', 'Design', 'Iterator'], hasSolution: True, hasVideoSolution: False, 1287: questionNo: 1287, acRate: 60.96757533883282, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Element Appearing More Than 25% In Sorted Array, slug: element-appearing-more-than-25-in-sorted-array, url: https://leetcode.com/problems/element-appearing-more-than-25-in-sorted-array, topics: ['Array'], hasSolution: True, hasVideoSolution: False, 1288: questionNo: 1288, acRate: 56.328229151236854, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Remove Covered Intervals, slug: remove-covered-intervals, url: https://leetcode.com/problems/remove-covered-intervals, topics: ['Array', 'Sorting'], hasSolution: True, hasVideoSolution: False, 1289: questionNo: 1289, acRate: 64.34054054054053, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Minimum Falling Path Sum II, slug: minimum-falling-path-sum-ii, url: https://leetcode.com/problems/minimum-falling-path-sum-ii, topics: ['Array', 'Dynamic Programming', 'Matrix'], hasSolution: True, hasVideoSolution: False, 1290: questionNo: 1290, acRate: 81.10255835804975, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Convert Binary Number in a Linked List to Integer, slug: convert-binary-number-in-a-linked-list-to-integer, url: https://leetcode.com/problems/convert-binary-number-in-a-linked-list-to-integer, topics: ['Linked List', 'Math'], hasSolution: True, hasVideoSolution: False, 1291: questionNo: 1291, acRate: 65.26837103466738, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Sequential Digits, slug: sequential-digits, url: https://leetcode.com/problems/sequential-digits, topics: ['Enumeration'], hasSolution: True, hasVideoSolution: False, 1292: questionNo: 1292, acRate: 53.52892027808869, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum Side Length of a Square with Sum Less than or Equal to Threshold, slug: maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold, url: https://leetcode.com/problems/maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold, topics: ['Array', 'Binary Search', 'Matrix', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 1293: questionNo: 1293, acRate: 45.27599804423335, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Shortest Path in a Grid with Obstacles Elimination, slug: shortest-path-in-a-grid-with-obstacles-elimination, url: https://leetcode.com/problems/shortest-path-in-a-grid-with-obstacles-elimination, topics: ['Array', 'Breadth-First Search', 'Matrix'], hasSolution: True, hasVideoSolution: False, 1294: questionNo: 1294, acRate: 66.7319697170939, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Weather Type in Each Country, slug: weather-type-in-each-country, url: https://leetcode.com/problems/weather-type-in-each-country, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 1295: questionNo: 1295, acRate: 77.3483367585777, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Find Numbers with Even Number of Digits, slug: find-numbers-with-even-number-of-digits, url: https://leetcode.com/problems/find-numbers-with-even-number-of-digits, topics: ['Array'], hasSolution: True, hasVideoSolution: False, 1296: questionNo: 1296, acRate: 58.45912286336223, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Divide Array in Sets of K Consecutive Numbers, slug: divide-array-in-sets-of-k-consecutive-numbers, url: https://leetcode.com/problems/divide-array-in-sets-of-k-consecutive-numbers, topics: ['Array', 'Hash Table', 'Greedy', 'Sorting'], hasSolution: False, hasVideoSolution: False, 1297: questionNo: 1297, acRate: 52.072030913901735, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum Number of Occurrences of a Substring, slug: maximum-number-of-occurrences-of-a-substring, url: https://leetcode.com/problems/maximum-number-of-occurrences-of-a-substring, topics: ['Hash Table', 'String', 'Sliding Window'], hasSolution: False, hasVideoSolution: False, 1298: questionNo: 1298, acRate: 57.89367361368304, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Maximum Candies You Can Get from Boxes, slug: maximum-candies-you-can-get-from-boxes, url: https://leetcode.com/problems/maximum-candies-you-can-get-from-boxes, topics: ['Array', 'Breadth-First Search', 'Graph'], hasSolution: False, hasVideoSolution: False, 1299: questionNo: 1299, acRate: 71.24149098115808, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Replace Elements with Greatest Element on Right Side, slug: replace-elements-with-greatest-element-on-right-side, url: https://leetcode.com/problems/replace-elements-with-greatest-element-on-right-side, topics: ['Array'], hasSolution: False, hasVideoSolution: False, 1300: questionNo: 1300, acRate: 44.568730086481565, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Sum of Mutated Array Closest to Target, slug: sum-of-mutated-array-closest-to-target, url: https://leetcode.com/problems/sum-of-mutated-array-closest-to-target, topics: ['Array', 'Binary Search', 'Sorting'], hasSolution: False, hasVideoSolution: False, 1301: questionNo: 1301, acRate: 39.61131345322103, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Number of Paths with Max Score, slug: number-of-paths-with-max-score, url: https://leetcode.com/problems/number-of-paths-with-max-score, topics: ['Array', 'Dynamic Programming', 'Matrix'], hasSolution: False, hasVideoSolution: False, 1302: questionNo: 1302, acRate: 86.31189804455687, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Deepest Leaves Sum, slug: deepest-leaves-sum, url: https://leetcode.com/problems/deepest-leaves-sum, topics: ['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 1303: questionNo: 1303, acRate: 89.53461946366346, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Find the Team Size, slug: find-the-team-size, url: https://leetcode.com/problems/find-the-team-size, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 1304: questionNo: 1304, acRate: 76.18457111537408, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Find N Unique Integers Sum up to Zero, slug: find-n-unique-integers-sum-up-to-zero, url: https://leetcode.com/problems/find-n-unique-integers-sum-up-to-zero, topics: ['Array', 'Math'], hasSolution: False, hasVideoSolution: False, 1305: questionNo: 1305, acRate: 79.81375788525082, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: All Elements in Two Binary Search Trees, slug: all-elements-in-two-binary-search-trees, url: https://leetcode.com/problems/all-elements-in-two-binary-search-trees, topics: ['Tree', 'Depth-First Search', 'Binary Search Tree', 'Sorting', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 1306: questionNo: 1306, acRate: 65.04169074548007, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Jump Game III, slug: jump-game-iii, url: https://leetcode.com/problems/jump-game-iii, topics: ['Array', 'Depth-First Search', 'Breadth-First Search'], hasSolution: True, hasVideoSolution: True, 1307: questionNo: 1307, acRate: 34.5279913532634, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Verbal Arithmetic Puzzle, slug: verbal-arithmetic-puzzle, url: https://leetcode.com/problems/verbal-arithmetic-puzzle, topics: ['Array', 'Math', 'String', 'Backtracking'], hasSolution: False, hasVideoSolution: False, 1308: questionNo: 1308, acRate: 86.39675096298778, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Running Total for Different Genders, slug: running-total-for-different-genders, url: https://leetcode.com/problems/running-total-for-different-genders, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 1309: questionNo: 1309, acRate: 79.77417771232204, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Decrypt String from Alphabet to Integer Mapping, slug: decrypt-string-from-alphabet-to-integer-mapping, url: https://leetcode.com/problems/decrypt-string-from-alphabet-to-integer-mapping, topics: ['String'], hasSolution: False, hasVideoSolution: False, 1310: questionNo: 1310, acRate: 73.12509967979783, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: XOR Queries of a Subarray, slug: xor-queries-of-a-subarray, url: https://leetcode.com/problems/xor-queries-of-a-subarray, topics: ['Array', 'Bit Manipulation', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 1311: questionNo: 1311, acRate: 47.45788874524862, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Get Watched Videos by Your Friends, slug: get-watched-videos-by-your-friends, url: https://leetcode.com/problems/get-watched-videos-by-your-friends, topics: ['Array', 'Hash Table', 'Breadth-First Search', 'Graph', 'Sorting'], hasSolution: False, hasVideoSolution: False, 1312: questionNo: 1312, acRate: 71.04248771373392, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Minimum Insertion Steps to Make a String Palindrome, slug: minimum-insertion-steps-to-make-a-string-palindrome, url: https://leetcode.com/problems/minimum-insertion-steps-to-make-a-string-palindrome, topics: ['String', 'Dynamic Programming'], hasSolution: True, hasVideoSolution: False, 1313: questionNo: 1313, acRate: 85.78488832567717, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Decompress Run-Length Encoded List, slug: decompress-run-length-encoded-list, url: https://leetcode.com/problems/decompress-run-length-encoded-list, topics: ['Array'], hasSolution: False, hasVideoSolution: False, 1314: questionNo: 1314, acRate: 75.54020977550489, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Matrix Block Sum, slug: matrix-block-sum, url: https://leetcode.com/problems/matrix-block-sum, topics: ['Array', 'Matrix', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 1315: questionNo: 1315, acRate: 85.56419829343886, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Sum of Nodes with Even-Valued Grandparent, slug: sum-of-nodes-with-even-valued-grandparent, url: https://leetcode.com/problems/sum-of-nodes-with-even-valued-grandparent, topics: ['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 1316: questionNo: 1316, acRate: 50.654594032952346, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Distinct Echo Substrings, slug: distinct-echo-substrings, url: https://leetcode.com/problems/distinct-echo-substrings, topics: ['String', 'Trie', 'Rolling Hash', 'Hash Function'], hasSolution: False, hasVideoSolution: False, 1317: questionNo: 1317, acRate: 53.97057324407897, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Convert Integer to the Sum of Two No-Zero Integers, slug: convert-integer-to-the-sum-of-two-no-zero-integers, url: https://leetcode.com/problems/convert-integer-to-the-sum-of-two-no-zero-integers, topics: ['Math'], hasSolution: False, hasVideoSolution: False, 1318: questionNo: 1318, acRate: 71.10408762995395, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Flips to Make a OR b Equal to c, slug: minimum-flips-to-make-a-or-b-equal-to-c, url: https://leetcode.com/problems/minimum-flips-to-make-a-or-b-equal-to-c, topics: ['Bit Manipulation'], hasSolution: True, hasVideoSolution: False, 1319: questionNo: 1319, acRate: 63.11280369001855, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Number of Operations to Make Network Connected, slug: number-of-operations-to-make-network-connected, url: https://leetcode.com/problems/number-of-operations-to-make-network-connected, topics: ['Depth-First Search', 'Breadth-First Search', 'Union Find', 'Graph'], hasSolution: True, hasVideoSolution: False, 1320: questionNo: 1320, acRate: 59.16239094596848, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Minimum Distance to Type a Word Using Two Fingers, slug: minimum-distance-to-type-a-word-using-two-fingers, url: https://leetcode.com/problems/minimum-distance-to-type-a-word-using-two-fingers, topics: ['String', 'Dynamic Programming'], hasSolution: False, hasVideoSolution: False, 1321: questionNo: 1321, acRate: 51.66281873685291, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Restaurant Growth, slug: restaurant-growth, url: https://leetcode.com/problems/restaurant-growth, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 1322: questionNo: 1322, acRate: 59.411037891268535, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Ads Performance, slug: ads-performance, url: https://leetcode.com/problems/ads-performance, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 1323: questionNo: 1323, acRate: 82.39014127209194, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Maximum 69 Number, slug: maximum-69-number, url: https://leetcode.com/problems/maximum-69-number, topics: ['Math', 'Greedy'], hasSolution: True, hasVideoSolution: False, 1324: questionNo: 1324, acRate: 64.28758694076461, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Print Words Vertically, slug: print-words-vertically, url: https://leetcode.com/problems/print-words-vertically, topics: ['Array', 'String', 'Simulation'], hasSolution: False, hasVideoSolution: False, 1325: questionNo: 1325, acRate: 77.46379024517931, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Delete Leaves With a Given Value, slug: delete-leaves-with-a-given-value, url: https://leetcode.com/problems/delete-leaves-with-a-given-value, topics: ['Tree', 'Depth-First Search', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 1326: questionNo: 1326, acRate: 50.860684912833406, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Minimum Number of Taps to Open to Water a Garden, slug: minimum-number-of-taps-to-open-to-water-a-garden, url: https://leetcode.com/problems/minimum-number-of-taps-to-open-to-water-a-garden, topics: ['Array', 'Dynamic Programming', 'Greedy'], hasSolution: True, hasVideoSolution: False, 1327: questionNo: 1327, acRate: 70.80552881157111, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: List the Products Ordered in a Period, slug: list-the-products-ordered-in-a-period, url: https://leetcode.com/problems/list-the-products-ordered-in-a-period, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 1328: questionNo: 1328, acRate: 51.74498289054487, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Break a Palindrome, slug: break-a-palindrome, url: https://leetcode.com/problems/break-a-palindrome, topics: ['String', 'Greedy'], hasSolution: True, hasVideoSolution: False, 1329: questionNo: 1329, acRate: 82.92286129048405, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Sort the Matrix Diagonally, slug: sort-the-matrix-diagonally, url: https://leetcode.com/problems/sort-the-matrix-diagonally, topics: ['Array', 'Sorting', 'Matrix'], hasSolution: True, hasVideoSolution: True, 1330: questionNo: 1330, acRate: 41.543087541857446, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Reverse Subarray To Maximize Array Value, slug: reverse-subarray-to-maximize-array-value, url: https://leetcode.com/problems/reverse-subarray-to-maximize-array-value, topics: ['Array', 'Math', 'Greedy'], hasSolution: False, hasVideoSolution: False, 1331: questionNo: 1331, acRate: 62.44419555648165, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Rank Transform of an Array, slug: rank-transform-of-an-array, url: https://leetcode.com/problems/rank-transform-of-an-array, topics: ['Array', 'Hash Table', 'Sorting'], hasSolution: False, hasVideoSolution: False, 1332: questionNo: 1332, acRate: 76.47553189089186, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Remove Palindromic Subsequences, slug: remove-palindromic-subsequences, url: https://leetcode.com/problems/remove-palindromic-subsequences, topics: ['Two Pointers', 'String'], hasSolution: True, hasVideoSolution: False, 1333: questionNo: 1333, acRate: 61.52233088012905, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Filter Restaurants by Vegan-Friendly, Price and Distance, slug: filter-restaurants-by-vegan-friendly-price-and-distance, url: https://leetcode.com/problems/filter-restaurants-by-vegan-friendly-price-and-distance, topics: ['Array', 'Sorting'], hasSolution: False, hasVideoSolution: False, 1334: questionNo: 1334, acRate: 63.701395873709, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Find the City With the Smallest Number of Neighbors at a Threshold Distance, slug: find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance, url: https://leetcode.com/problems/find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance, topics: ['Dynamic Programming', 'Graph', 'Shortest Path'], hasSolution: True, hasVideoSolution: False, 1335: questionNo: 1335, acRate: 59.59158621648834, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Minimum Difficulty of a Job Schedule, slug: minimum-difficulty-of-a-job-schedule, url: https://leetcode.com/problems/minimum-difficulty-of-a-job-schedule, topics: ['Array', 'Dynamic Programming'], hasSolution: True, hasVideoSolution: False, 1336: questionNo: 1336, acRate: 47.75192638587566, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Number of Transactions per Visit, slug: number-of-transactions-per-visit, url: https://leetcode.com/problems/number-of-transactions-per-visit, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 1337: questionNo: 1337, acRate: 73.5460423260126, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: The K Weakest Rows in a Matrix, slug: the-k-weakest-rows-in-a-matrix, url: https://leetcode.com/problems/the-k-weakest-rows-in-a-matrix, topics: ['Array', 'Binary Search', 'Sorting', 'Heap (Priority Queue)', 'Matrix'], hasSolution: True, hasVideoSolution: False, 1338: questionNo: 1338, acRate: 68.9382854342423, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Reduce Array Size to The Half, slug: reduce-array-size-to-the-half, url: https://leetcode.com/problems/reduce-array-size-to-the-half, topics: ['Array', 'Hash Table', 'Greedy', 'Sorting', 'Heap (Priority Queue)'], hasSolution: True, hasVideoSolution: False, 1339: questionNo: 1339, acRate: 47.69386739974863, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum Product of Splitted Binary Tree, slug: maximum-product-of-splitted-binary-tree, url: https://leetcode.com/problems/maximum-product-of-splitted-binary-tree, topics: ['Tree', 'Depth-First Search', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 1340: questionNo: 1340, acRate: 63.41828797510899, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Jump Game V, slug: jump-game-v, url: https://leetcode.com/problems/jump-game-v, topics: ['Array', 'Dynamic Programming', 'Sorting'], hasSolution: False, hasVideoSolution: False, 1341: questionNo: 1341, acRate: 39.94773063213497, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Movie Rating, slug: movie-rating, url: https://leetcode.com/problems/movie-rating, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 1342: questionNo: 1342, acRate: 85.2299215413156, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Number of Steps to Reduce a Number to Zero, slug: number-of-steps-to-reduce-a-number-to-zero, url: https://leetcode.com/problems/number-of-steps-to-reduce-a-number-to-zero, topics: ['Math', 'Bit Manipulation'], hasSolution: True, hasVideoSolution: True, 1343: questionNo: 1343, acRate: 68.69457537748661, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold, slug: number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold, url: https://leetcode.com/problems/number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold, topics: ['Array', 'Sliding Window'], hasSolution: False, hasVideoSolution: False, 1344: questionNo: 1344, acRate: 63.84593990461377, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Angle Between Hands of a Clock, slug: angle-between-hands-of-a-clock, url: https://leetcode.com/problems/angle-between-hands-of-a-clock, topics: ['Math'], hasSolution: True, hasVideoSolution: False, 1345: questionNo: 1345, acRate: 46.17705378404789, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Jump Game IV, slug: jump-game-iv, url: https://leetcode.com/problems/jump-game-iv, topics: ['Array', 'Hash Table', 'Breadth-First Search'], hasSolution: True, hasVideoSolution: False, 1346: questionNo: 1346, acRate: 37.320481578634215, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Check If N and Its Double Exist, slug: check-if-n-and-its-double-exist, url: https://leetcode.com/problems/check-if-n-and-its-double-exist, topics: ['Array', 'Hash Table', 'Two Pointers', 'Binary Search', 'Sorting'], hasSolution: False, hasVideoSolution: False, 1347: questionNo: 1347, acRate: 82.05488847793434, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Number of Steps to Make Two Strings Anagram, slug: minimum-number-of-steps-to-make-two-strings-anagram, url: https://leetcode.com/problems/minimum-number-of-steps-to-make-two-strings-anagram, topics: ['Hash Table', 'String', 'Counting'], hasSolution: True, hasVideoSolution: False, 1348: questionNo: 1348, acRate: 44.617776348236305, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Tweet Counts Per Frequency, slug: tweet-counts-per-frequency, url: https://leetcode.com/problems/tweet-counts-per-frequency, topics: ['Hash Table', 'Binary Search', 'Design', 'Sorting', 'Ordered Set'], hasSolution: False, hasVideoSolution: False, 1349: questionNo: 1349, acRate: 50.73000391342304, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Maximum Students Taking Exam, slug: maximum-students-taking-exam, url: https://leetcode.com/problems/maximum-students-taking-exam, topics: ['Array', 'Dynamic Programming', 'Bit Manipulation', 'Matrix', 'Bitmask'], hasSolution: False, hasVideoSolution: False, 1350: questionNo: 1350, acRate: 89.71682643794148, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Students With Invalid Departments, slug: students-with-invalid-departments, url: https://leetcode.com/problems/students-with-invalid-departments, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 1351: questionNo: 1351, acRate: 77.39282162553116, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Count Negative Numbers in a Sorted Matrix, slug: count-negative-numbers-in-a-sorted-matrix, url: https://leetcode.com/problems/count-negative-numbers-in-a-sorted-matrix, topics: ['Array', 'Binary Search', 'Matrix'], hasSolution: True, hasVideoSolution: False, 1352: questionNo: 1352, acRate: 51.6802007378035, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Product of the Last K Numbers, slug: product-of-the-last-k-numbers, url: https://leetcode.com/problems/product-of-the-last-k-numbers, topics: ['Array', 'Math', 'Design', 'Queue', 'Data Stream'], hasSolution: False, hasVideoSolution: False, 1353: questionNo: 1353, acRate: 32.49788127259529, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum Number of Events That Can Be Attended, slug: maximum-number-of-events-that-can-be-attended, url: https://leetcode.com/problems/maximum-number-of-events-that-can-be-attended, topics: ['Array', 'Greedy', 'Sorting', 'Heap (Priority Queue)'], hasSolution: False, hasVideoSolution: False, 1354: questionNo: 1354, acRate: 36.1753285786233, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Construct Target Array With Multiple Sums, slug: construct-target-array-with-multiple-sums, url: https://leetcode.com/problems/construct-target-array-with-multiple-sums, topics: ['Array', 'Heap (Priority Queue)'], hasSolution: True, hasVideoSolution: False, 1355: questionNo: 1355, acRate: 72.34476727237393, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Activity Participants, slug: activity-participants, url: https://leetcode.com/problems/activity-participants, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 1356: questionNo: 1356, acRate: 78.27586917119788, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Sort Integers by The Number of 1 Bits, slug: sort-integers-by-the-number-of-1-bits, url: https://leetcode.com/problems/sort-integers-by-the-number-of-1-bits, topics: ['Array', 'Bit Manipulation', 'Sorting', 'Counting'], hasSolution: True, hasVideoSolution: False, 1357: questionNo: 1357, acRate: 71.10576322040255, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Apply Discount Every n Orders, slug: apply-discount-every-n-orders, url: https://leetcode.com/problems/apply-discount-every-n-orders, topics: ['Array', 'Hash Table', 'Design'], hasSolution: False, hasVideoSolution: False, 1358: questionNo: 1358, acRate: 67.36387091697067, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Number of Substrings Containing All Three Characters, slug: number-of-substrings-containing-all-three-characters, url: https://leetcode.com/problems/number-of-substrings-containing-all-three-characters, topics: ['Hash Table', 'String', 'Sliding Window'], hasSolution: False, hasVideoSolution: False, 1359: questionNo: 1359, acRate: 65.02502681444405, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Count All Valid Pickup and Delivery Options, slug: count-all-valid-pickup-and-delivery-options, url: https://leetcode.com/problems/count-all-valid-pickup-and-delivery-options, topics: ['Math', 'Dynamic Programming', 'Combinatorics'], hasSolution: True, hasVideoSolution: False, 1360: questionNo: 1360, acRate: 50.036841110901186, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Number of Days Between Two Dates, slug: number-of-days-between-two-dates, url: https://leetcode.com/problems/number-of-days-between-two-dates, topics: ['Math', 'String'], hasSolution: False, hasVideoSolution: False, 1361: questionNo: 1361, acRate: 43.83603200485381, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Validate Binary Tree Nodes, slug: validate-binary-tree-nodes, url: https://leetcode.com/problems/validate-binary-tree-nodes, topics: ['Tree', 'Depth-First Search', 'Breadth-First Search', 'Union Find', 'Graph', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 1362: questionNo: 1362, acRate: 60.84157889137142, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Closest Divisors, slug: closest-divisors, url: https://leetcode.com/problems/closest-divisors, topics: ['Math'], hasSolution: False, hasVideoSolution: False, 1363: questionNo: 1363, acRate: 32.66891017344033, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Largest Multiple of Three, slug: largest-multiple-of-three, url: https://leetcode.com/problems/largest-multiple-of-three, topics: ['Array', 'Dynamic Programming', 'Greedy'], hasSolution: False, hasVideoSolution: False, 1364: questionNo: 1364, acRate: 75.05906674542233, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Number of Trusted Contacts of a Customer, slug: number-of-trusted-contacts-of-a-customer, url: https://leetcode.com/problems/number-of-trusted-contacts-of-a-customer, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 1365: questionNo: 1365, acRate: 86.84167551848695, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: How Many Numbers Are Smaller Than the Current Number, slug: how-many-numbers-are-smaller-than-the-current-number, url: https://leetcode.com/problems/how-many-numbers-are-smaller-than-the-current-number, topics: ['Array', 'Hash Table', 'Sorting', 'Counting'], hasSolution: False, hasVideoSolution: False, 1366: questionNo: 1366, acRate: 58.53012477442241, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Rank Teams by Votes, slug: rank-teams-by-votes, url: https://leetcode.com/problems/rank-teams-by-votes, topics: ['Array', 'Hash Table', 'String', 'Sorting', 'Counting'], hasSolution: False, hasVideoSolution: False, 1367: questionNo: 1367, acRate: 43.970122843434176, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Linked List in Binary Tree, slug: linked-list-in-binary-tree, url: https://leetcode.com/problems/linked-list-in-binary-tree, topics: ['Linked List', 'Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree'], hasSolution: False, hasVideoSolution: False, 1368: questionNo: 1368, acRate: 62.208070666478356, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Minimum Cost to Make at Least One Valid Path in a Grid, slug: minimum-cost-to-make-at-least-one-valid-path-in-a-grid, url: https://leetcode.com/problems/minimum-cost-to-make-at-least-one-valid-path-in-a-grid, topics: ['Array', 'Breadth-First Search', 'Graph', 'Heap (Priority Queue)', 'Matrix', 'Shortest Path'], hasSolution: False, hasVideoSolution: False, 1369: questionNo: 1369, acRate: 67.61667589005718, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Get the Second Most Recent Activity, slug: get-the-second-most-recent-activity, url: https://leetcode.com/problems/get-the-second-most-recent-activity, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 1370: questionNo: 1370, acRate: 76.51665658921425, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Increasing Decreasing String, slug: increasing-decreasing-string, url: https://leetcode.com/problems/increasing-decreasing-string, topics: ['Hash Table', 'String', 'Counting'], hasSolution: False, hasVideoSolution: False, 1371: questionNo: 1371, acRate: 64.02517753389283, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Find the Longest Substring Containing Vowels in Even Counts, slug: find-the-longest-substring-containing-vowels-in-even-counts, url: https://leetcode.com/problems/find-the-longest-substring-containing-vowels-in-even-counts, topics: ['Hash Table', 'String', 'Bit Manipulation', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 1372: questionNo: 1372, acRate: 65.89964604829073, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Longest ZigZag Path in a Binary Tree, slug: longest-zigzag-path-in-a-binary-tree, url: https://leetcode.com/problems/longest-zigzag-path-in-a-binary-tree, topics: ['Dynamic Programming', 'Tree', 'Depth-First Search', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 1373: questionNo: 1373, acRate: 41.567802567402424, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Maximum Sum BST in Binary Tree, slug: maximum-sum-bst-in-binary-tree, url: https://leetcode.com/problems/maximum-sum-bst-in-binary-tree, topics: ['Dynamic Programming', 'Tree', 'Depth-First Search', 'Binary Search Tree', 'Binary Tree'], hasSolution: False, hasVideoSolution: False, 1374: questionNo: 1374, acRate: 77.9085878187313, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Generate a String With Characters That Have Odd Counts, slug: generate-a-string-with-characters-that-have-odd-counts, url: https://leetcode.com/problems/generate-a-string-with-characters-that-have-odd-counts, topics: ['String'], hasSolution: False, hasVideoSolution: False, 1375: questionNo: 1375, acRate: 65.77395244603696, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Number of Times Binary String Is Prefix-Aligned, slug: number-of-times-binary-string-is-prefix-aligned, url: https://leetcode.com/problems/number-of-times-binary-string-is-prefix-aligned, topics: ['Array'], hasSolution: False, hasVideoSolution: False, 1376: questionNo: 1376, acRate: 60.01358087986648, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Time Needed to Inform All Employees, slug: time-needed-to-inform-all-employees, url: https://leetcode.com/problems/time-needed-to-inform-all-employees, topics: ['Tree', 'Depth-First Search', 'Breadth-First Search'], hasSolution: True, hasVideoSolution: False, 1377: questionNo: 1377, acRate: 35.47494762670864, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Frog Position After T Seconds, slug: frog-position-after-t-seconds, url: https://leetcode.com/problems/frog-position-after-t-seconds, topics: ['Tree', 'Depth-First Search', 'Breadth-First Search', 'Graph'], hasSolution: False, hasVideoSolution: False, 1378: questionNo: 1378, acRate: 83.01950556158327, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Replace Employee ID With The Unique Identifier, slug: replace-employee-id-with-the-unique-identifier, url: https://leetcode.com/problems/replace-employee-id-with-the-unique-identifier, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 1379: questionNo: 1379, acRate: 85.8644396456745, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Find a Corresponding Node of a Binary Tree in a Clone of That Tree, slug: find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree, url: https://leetcode.com/problems/find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree, topics: ['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 1380: questionNo: 1380, acRate: 79.9091551230232, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Lucky Numbers in a Matrix, slug: lucky-numbers-in-a-matrix, url: https://leetcode.com/problems/lucky-numbers-in-a-matrix, topics: ['Array', 'Matrix'], hasSolution: True, hasVideoSolution: False, 1381: questionNo: 1381, acRate: 77.16189802739105, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Design a Stack With Increment Operation, slug: design-a-stack-with-increment-operation, url: https://leetcode.com/problems/design-a-stack-with-increment-operation, topics: ['Array', 'Stack', 'Design'], hasSolution: False, hasVideoSolution: False, 1382: questionNo: 1382, acRate: 84.6552137754558, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Balance a Binary Search Tree, slug: balance-a-binary-search-tree, url: https://leetcode.com/problems/balance-a-binary-search-tree, topics: ['Divide and Conquer', 'Greedy', 'Tree', 'Depth-First Search', 'Binary Search Tree', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 1383: questionNo: 1383, acRate: 47.73963095812584, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Maximum Performance of a Team, slug: maximum-performance-of-a-team, url: https://leetcode.com/problems/maximum-performance-of-a-team, topics: ['Array', 'Greedy', 'Sorting', 'Heap (Priority Queue)'], hasSolution: True, hasVideoSolution: False, 1384: questionNo: 1384, acRate: 61.34864129421851, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Total Sales Amount by Year, slug: total-sales-amount-by-year, url: https://leetcode.com/problems/total-sales-amount-by-year, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 1385: questionNo: 1385, acRate: 68.67520647227371, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Find the Distance Value Between Two Arrays, slug: find-the-distance-value-between-two-arrays, url: https://leetcode.com/problems/find-the-distance-value-between-two-arrays, topics: ['Array', 'Two Pointers', 'Binary Search', 'Sorting'], hasSolution: False, hasVideoSolution: False, 1386: questionNo: 1386, acRate: 42.10499316005472, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Cinema Seat Allocation, slug: cinema-seat-allocation, url: https://leetcode.com/problems/cinema-seat-allocation, topics: ['Array', 'Hash Table', 'Greedy', 'Bit Manipulation'], hasSolution: False, hasVideoSolution: False, 1387: questionNo: 1387, acRate: 70.09347882760419, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Sort Integers by The Power Value, slug: sort-integers-by-the-power-value, url: https://leetcode.com/problems/sort-integers-by-the-power-value, topics: ['Dynamic Programming', 'Memoization', 'Sorting'], hasSolution: False, hasVideoSolution: False, 1388: questionNo: 1388, acRate: 52.040209374256484, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Pizza With 3n Slices, slug: pizza-with-3n-slices, url: https://leetcode.com/problems/pizza-with-3n-slices, topics: ['Array', 'Dynamic Programming', 'Greedy', 'Heap (Priority Queue)'], hasSolution: False, hasVideoSolution: False, 1389: questionNo: 1389, acRate: 85.93708429734254, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Create Target Array in the Given Order, slug: create-target-array-in-the-given-order, url: https://leetcode.com/problems/create-target-array-in-the-given-order, topics: ['Array', 'Simulation'], hasSolution: False, hasVideoSolution: False, 1390: questionNo: 1390, acRate: 42.91537524572173, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Four Divisors, slug: four-divisors, url: https://leetcode.com/problems/four-divisors, topics: ['Array', 'Math'], hasSolution: False, hasVideoSolution: False, 1391: questionNo: 1391, acRate: 48.07208443616639, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Check if There is a Valid Path in a Grid, slug: check-if-there-is-a-valid-path-in-a-grid, url: https://leetcode.com/problems/check-if-there-is-a-valid-path-in-a-grid, topics: ['Array', 'Depth-First Search', 'Breadth-First Search', 'Union Find', 'Matrix'], hasSolution: False, hasVideoSolution: False, 1392: questionNo: 1392, acRate: 46.2990071599996, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Longest Happy Prefix, slug: longest-happy-prefix, url: https://leetcode.com/problems/longest-happy-prefix, topics: ['String', 'Rolling Hash', 'String Matching', 'Hash Function'], hasSolution: False, hasVideoSolution: False, 1393: questionNo: 1393, acRate: 85.36576278511762, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Capital Gain/Loss, slug: capital-gainloss, url: https://leetcode.com/problems/capital-gainloss, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 1394: questionNo: 1394, acRate: 67.43742986141922, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Find Lucky Integer in an Array, slug: find-lucky-integer-in-an-array, url: https://leetcode.com/problems/find-lucky-integer-in-an-array, topics: ['Array', 'Hash Table', 'Counting'], hasSolution: True, hasVideoSolution: False, 1395: questionNo: 1395, acRate: 65.93993004365045, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Count Number of Teams, slug: count-number-of-teams, url: https://leetcode.com/problems/count-number-of-teams, topics: ['Array', 'Dynamic Programming', 'Binary Indexed Tree'], hasSolution: False, hasVideoSolution: False, 1396: questionNo: 1396, acRate: 74.69959090501045, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Design Underground System, slug: design-underground-system, url: https://leetcode.com/problems/design-underground-system, topics: ['Hash Table', 'String', 'Design'], hasSolution: True, hasVideoSolution: False, 1397: questionNo: 1397, acRate: 42.26400807672893, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Find All Good Strings, slug: find-all-good-strings, url: https://leetcode.com/problems/find-all-good-strings, topics: ['String', 'Dynamic Programming', 'String Matching'], hasSolution: False, hasVideoSolution: False, 1398: questionNo: 1398, acRate: 72.66033581062483, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Customers Who Bought Products A and B but Not C, slug: customers-who-bought-products-a-and-b-but-not-c, url: https://leetcode.com/problems/customers-who-bought-products-a-and-b-but-not-c, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 1399: questionNo: 1399, acRate: 66.33859373244974, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Count Largest Group, slug: count-largest-group, url: https://leetcode.com/problems/count-largest-group, topics: ['Hash Table', 'Math'], hasSolution: False, hasVideoSolution: False, 1400: questionNo: 1400, acRate: 62.15436179126711, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Construct K Palindrome Strings, slug: construct-k-palindrome-strings, url: https://leetcode.com/problems/construct-k-palindrome-strings, topics: ['Hash Table', 'String', 'Greedy', 'Counting'], hasSolution: False, hasVideoSolution: False, 1401: questionNo: 1401, acRate: 46.5482438433589, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Circle and Rectangle Overlapping, slug: circle-and-rectangle-overlapping, url: https://leetcode.com/problems/circle-and-rectangle-overlapping, topics: ['Math', 'Geometry'], hasSolution: False, hasVideoSolution: False, 1402: questionNo: 1402, acRate: 76.22150838418149, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Reducing Dishes, slug: reducing-dishes, url: https://leetcode.com/problems/reducing-dishes, topics: ['Array', 'Dynamic Programming', 'Greedy', 'Sorting'], hasSolution: True, hasVideoSolution: False, 1403: questionNo: 1403, acRate: 72.64694994837025, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Minimum Subsequence in Non-Increasing Order, slug: minimum-subsequence-in-non-increasing-order, url: https://leetcode.com/problems/minimum-subsequence-in-non-increasing-order, topics: ['Array', 'Greedy', 'Sorting'], hasSolution: False, hasVideoSolution: False, 1404: questionNo: 1404, acRate: 61.46195184228497, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Number of Steps to Reduce a Number in Binary Representation to One, slug: number-of-steps-to-reduce-a-number-in-binary-representation-to-one, url: https://leetcode.com/problems/number-of-steps-to-reduce-a-number-in-binary-representation-to-one, topics: ['String', 'Bit Manipulation'], hasSolution: True, hasVideoSolution: False, 1405: questionNo: 1405, acRate: 57.44685175399374, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Longest Happy String, slug: longest-happy-string, url: https://leetcode.com/problems/longest-happy-string, topics: ['String', 'Greedy', 'Heap (Priority Queue)'], hasSolution: False, hasVideoSolution: False, 1406: questionNo: 1406, acRate: 63.837614834977884, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Stone Game III, slug: stone-game-iii, url: https://leetcode.com/problems/stone-game-iii, topics: ['Array', 'Math', 'Dynamic Programming', 'Game Theory'], hasSolution: True, hasVideoSolution: False, 1407: questionNo: 1407, acRate: 57.57326697605144, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Top Travellers, slug: top-travellers, url: https://leetcode.com/problems/top-travellers, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 1408: questionNo: 1408, acRate: 64.02407337181702, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: String Matching in an Array, slug: string-matching-in-an-array, url: https://leetcode.com/problems/string-matching-in-an-array, topics: ['Array', 'String', 'String Matching'], hasSolution: False, hasVideoSolution: False, 1409: questionNo: 1409, acRate: 84.29398148148148, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Queries on a Permutation With Key, slug: queries-on-a-permutation-with-key, url: https://leetcode.com/problems/queries-on-a-permutation-with-key, topics: ['Array', 'Binary Indexed Tree', 'Simulation'], hasSolution: False, hasVideoSolution: False, 1410: questionNo: 1410, acRate: 50.881499665253294, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: HTML Entity Parser, slug: html-entity-parser, url: https://leetcode.com/problems/html-entity-parser, topics: ['Hash Table', 'String'], hasSolution: False, hasVideoSolution: False, 1411: questionNo: 1411, acRate: 63.69785164620172, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Number of Ways to Paint N × 3 Grid, slug: number-of-ways-to-paint-n-3-grid, url: https://leetcode.com/problems/number-of-ways-to-paint-n-3-grid, topics: ['Dynamic Programming'], hasSolution: False, hasVideoSolution: False, 1412: questionNo: 1412, acRate: 58.986114749803505, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Find the Quiet Students in All Exams, slug: find-the-quiet-students-in-all-exams, url: https://leetcode.com/problems/find-the-quiet-students-in-all-exams, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 1413: questionNo: 1413, acRate: 65.5080532909127, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Minimum Value to Get Positive Step by Step Sum, slug: minimum-value-to-get-positive-step-by-step-sum, url: https://leetcode.com/problems/minimum-value-to-get-positive-step-by-step-sum, topics: ['Array', 'Prefix Sum'], hasSolution: True, hasVideoSolution: False, 1414: questionNo: 1414, acRate: 65.35532045430739, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Find the Minimum Number of Fibonacci Numbers Whose Sum Is K, slug: find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k, url: https://leetcode.com/problems/find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k, topics: ['Math', 'Greedy'], hasSolution: False, hasVideoSolution: False, 1415: questionNo: 1415, acRate: 74.79016619209796, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: The k-th Lexicographical String of All Happy Strings of Length n, slug: the-k-th-lexicographical-string-of-all-happy-strings-of-length-n, url: https://leetcode.com/problems/the-k-th-lexicographical-string-of-all-happy-strings-of-length-n, topics: ['String', 'Backtracking'], hasSolution: False, hasVideoSolution: False, 1416: questionNo: 1416, acRate: 47.59340668172211, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Restore The Array, slug: restore-the-array, url: https://leetcode.com/problems/restore-the-array, topics: ['String', 'Dynamic Programming'], hasSolution: True, hasVideoSolution: False, 1417: questionNo: 1417, acRate: 52.75298284528558, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Reformat The String, slug: reformat-the-string, url: https://leetcode.com/problems/reformat-the-string, topics: ['String'], hasSolution: False, hasVideoSolution: False, 1418: questionNo: 1418, acRate: 74.76749307012773, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Display Table of Food Orders in a Restaurant, slug: display-table-of-food-orders-in-a-restaurant, url: https://leetcode.com/problems/display-table-of-food-orders-in-a-restaurant, topics: ['Array', 'Hash Table', 'String', 'Sorting', 'Ordered Set'], hasSolution: False, hasVideoSolution: False, 1419: questionNo: 1419, acRate: 50.34832872581051, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Number of Frogs Croaking, slug: minimum-number-of-frogs-croaking, url: https://leetcode.com/problems/minimum-number-of-frogs-croaking, topics: ['String', 'Counting'], hasSolution: False, hasVideoSolution: False, 1420: questionNo: 1420, acRate: 68.2609886059687, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Build Array Where You Can Find The Maximum Exactly K Comparisons, slug: build-array-where-you-can-find-the-maximum-exactly-k-comparisons, url: https://leetcode.com/problems/build-array-where-you-can-find-the-maximum-exactly-k-comparisons, topics: ['Dynamic Programming', 'Prefix Sum'], hasSolution: True, hasVideoSolution: False, 1421: questionNo: 1421, acRate: 82.77303233679073, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: NPV Queries, slug: npv-queries, url: https://leetcode.com/problems/npv-queries, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 1422: questionNo: 1422, acRate: 62.23727088349905, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Maximum Score After Splitting a String, slug: maximum-score-after-splitting-a-string, url: https://leetcode.com/problems/maximum-score-after-splitting-a-string, topics: ['String', 'Prefix Sum'], hasSolution: True, hasVideoSolution: False, 1423: questionNo: 1423, acRate: 53.42341844441988, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum Points You Can Obtain from Cards, slug: maximum-points-you-can-obtain-from-cards, url: https://leetcode.com/problems/maximum-points-you-can-obtain-from-cards, topics: ['Array', 'Sliding Window', 'Prefix Sum'], hasSolution: True, hasVideoSolution: False, 1424: questionNo: 1424, acRate: 57.06363336905353, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Diagonal Traverse II, slug: diagonal-traverse-ii, url: https://leetcode.com/problems/diagonal-traverse-ii, topics: ['Array', 'Sorting', 'Heap (Priority Queue)'], hasSolution: True, hasVideoSolution: False, 1425: questionNo: 1425, acRate: 56.60934728306122, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Constrained Subsequence Sum, slug: constrained-subsequence-sum, url: https://leetcode.com/problems/constrained-subsequence-sum, topics: ['Array', 'Dynamic Programming', 'Queue', 'Sliding Window', 'Heap (Priority Queue)', 'Monotonic Queue'], hasSolution: True, hasVideoSolution: False, 1426: questionNo: 1426, acRate: 60.22843912430107, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Counting Elements, slug: counting-elements, url: https://leetcode.com/problems/counting-elements, topics: ['Array', 'Hash Table'], hasSolution: True, hasVideoSolution: False, 1427: questionNo: 1427, acRate: 54.77133475508615, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Perform String Shifts, slug: perform-string-shifts, url: https://leetcode.com/problems/perform-string-shifts, topics: ['Array', 'Math', 'String'], hasSolution: True, hasVideoSolution: False, 1428: questionNo: 1428, acRate: 54.517419941354206, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Leftmost Column with at Least a One, slug: leftmost-column-with-at-least-a-one, url: https://leetcode.com/problems/leftmost-column-with-at-least-a-one, topics: ['Array', 'Binary Search', 'Matrix', 'Interactive'], hasSolution: True, hasVideoSolution: False, 1429: questionNo: 1429, acRate: 53.84394309527231, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: First Unique Number, slug: first-unique-number, url: https://leetcode.com/problems/first-unique-number, topics: ['Array', 'Hash Table', 'Design', 'Queue', 'Data Stream'], hasSolution: True, hasVideoSolution: False, 1430: questionNo: 1430, acRate: 46.94466686333178, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree, slug: check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree, url: https://leetcode.com/problems/check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree, topics: ['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree'], hasSolution: False, hasVideoSolution: False, 1431: questionNo: 1431, acRate: 87.61347746191184, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Kids With the Greatest Number of Candies, slug: kids-with-the-greatest-number-of-candies, url: https://leetcode.com/problems/kids-with-the-greatest-number-of-candies, topics: ['Array'], hasSolution: True, hasVideoSolution: False, 1432: questionNo: 1432, acRate: 41.03894951645817, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Max Difference You Can Get From Changing an Integer, slug: max-difference-you-can-get-from-changing-an-integer, url: https://leetcode.com/problems/max-difference-you-can-get-from-changing-an-integer, topics: ['Math', 'Greedy'], hasSolution: False, hasVideoSolution: False, 1433: questionNo: 1433, acRate: 69.75613630947652, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Check If a String Can Break Another String, slug: check-if-a-string-can-break-another-string, url: https://leetcode.com/problems/check-if-a-string-can-break-another-string, topics: ['String', 'Greedy', 'Sorting'], hasSolution: False, hasVideoSolution: False, 1434: questionNo: 1434, acRate: 43.788035365713625, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Number of Ways to Wear Different Hats to Each Other, slug: number-of-ways-to-wear-different-hats-to-each-other, url: https://leetcode.com/problems/number-of-ways-to-wear-different-hats-to-each-other, topics: ['Array', 'Dynamic Programming', 'Bit Manipulation', 'Bitmask'], hasSolution: True, hasVideoSolution: False, 1435: questionNo: 1435, acRate: 75.23821787277878, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Create a Session Bar Chart, slug: create-a-session-bar-chart, url: https://leetcode.com/problems/create-a-session-bar-chart, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 1436: questionNo: 1436, acRate: 79.49520556137377, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Destination City, slug: destination-city, url: https://leetcode.com/problems/destination-city, topics: ['Array', 'Hash Table', 'String'], hasSolution: True, hasVideoSolution: False, 1437: questionNo: 1437, acRate: 57.999067843514226, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Check If All 1's Are at Least Length K Places Away, slug: check-if-all-1s-are-at-least-length-k-places-away, url: https://leetcode.com/problems/check-if-all-1s-are-at-least-length-k-places-away, topics: ['Array'], hasSolution: True, hasVideoSolution: False, 1438: questionNo: 1438, acRate: 56.60269751801679, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit, slug: longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit, url: https://leetcode.com/problems/longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit, topics: ['Array', 'Queue', 'Sliding Window', 'Heap (Priority Queue)', 'Ordered Set', 'Monotonic Queue'], hasSolution: True, hasVideoSolution: False, 1439: questionNo: 1439, acRate: 61.76361484517143, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Find the Kth Smallest Sum of a Matrix With Sorted Rows, slug: find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows, url: https://leetcode.com/problems/find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows, topics: ['Array', 'Binary Search', 'Heap (Priority Queue)', 'Matrix'], hasSolution: False, hasVideoSolution: False, 1440: questionNo: 1440, acRate: 72.50276991259386, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Evaluate Boolean Expression, slug: evaluate-boolean-expression, url: https://leetcode.com/problems/evaluate-boolean-expression, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 1441: questionNo: 1441, acRate: 79.96293909120207, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Build an Array With Stack Operations, slug: build-an-array-with-stack-operations, url: https://leetcode.com/problems/build-an-array-with-stack-operations, topics: ['Array', 'Stack', 'Simulation'], hasSolution: True, hasVideoSolution: False, 1442: questionNo: 1442, acRate: 84.96200849979326, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Count Triplets That Can Form Two Arrays of Equal XOR, slug: count-triplets-that-can-form-two-arrays-of-equal-xor, url: https://leetcode.com/problems/count-triplets-that-can-form-two-arrays-of-equal-xor, topics: ['Array', 'Hash Table', 'Math', 'Bit Manipulation', 'Prefix Sum'], hasSolution: True, hasVideoSolution: False, 1443: questionNo: 1443, acRate: 62.42192583787218, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Time to Collect All Apples in a Tree, slug: minimum-time-to-collect-all-apples-in-a-tree, url: https://leetcode.com/problems/minimum-time-to-collect-all-apples-in-a-tree, topics: ['Hash Table', 'Tree', 'Depth-First Search', 'Breadth-First Search'], hasSolution: True, hasVideoSolution: False, 1444: questionNo: 1444, acRate: 62.076094447063944, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Number of Ways of Cutting a Pizza, slug: number-of-ways-of-cutting-a-pizza, url: https://leetcode.com/problems/number-of-ways-of-cutting-a-pizza, topics: ['Array', 'Dynamic Programming', 'Memoization', 'Matrix'], hasSolution: True, hasVideoSolution: False, 1445: questionNo: 1445, acRate: 86.30975452196382, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Apples & Oranges, slug: apples-oranges, url: https://leetcode.com/problems/apples-oranges, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 1446: questionNo: 1446, acRate: 60.34369131559366, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Consecutive Characters, slug: consecutive-characters, url: https://leetcode.com/problems/consecutive-characters, topics: ['String'], hasSolution: True, hasVideoSolution: False, 1447: questionNo: 1447, acRate: 66.96351170304989, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Simplified Fractions, slug: simplified-fractions, url: https://leetcode.com/problems/simplified-fractions, topics: ['Math', 'String', 'Number Theory'], hasSolution: False, hasVideoSolution: False, 1448: questionNo: 1448, acRate: 73.02889369528515, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Count Good Nodes in Binary Tree, slug: count-good-nodes-in-binary-tree, url: https://leetcode.com/problems/count-good-nodes-in-binary-tree, topics: ['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree'], hasSolution: True, hasVideoSolution: True, 1449: questionNo: 1449, acRate: 48.259256335359595, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Form Largest Integer With Digits That Add up to Target, slug: form-largest-integer-with-digits-that-add-up-to-target, url: https://leetcode.com/problems/form-largest-integer-with-digits-that-add-up-to-target, topics: ['Array', 'Dynamic Programming'], hasSolution: False, hasVideoSolution: False, 1450: questionNo: 1450, acRate: 75.65758642650292, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Number of Students Doing Homework at a Given Time, slug: number-of-students-doing-homework-at-a-given-time, url: https://leetcode.com/problems/number-of-students-doing-homework-at-a-given-time, topics: ['Array'], hasSolution: False, hasVideoSolution: False, 1451: questionNo: 1451, acRate: 64.7185617008769, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Rearrange Words in a Sentence, slug: rearrange-words-in-a-sentence, url: https://leetcode.com/problems/rearrange-words-in-a-sentence, topics: ['String', 'Sorting'], hasSolution: False, hasVideoSolution: False, 1452: questionNo: 1452, acRate: 57.97313627068228, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: People Whose List of Favorite Companies Is Not a Subset of Another List, slug: people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list, url: https://leetcode.com/problems/people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list, topics: ['Array', 'Hash Table', 'String'], hasSolution: False, hasVideoSolution: False, 1453: questionNo: 1453, acRate: 38.05721889554225, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Maximum Number of Darts Inside of a Circular Dartboard, slug: maximum-number-of-darts-inside-of-a-circular-dartboard, url: https://leetcode.com/problems/maximum-number-of-darts-inside-of-a-circular-dartboard, topics: ['Array', 'Math', 'Geometry'], hasSolution: False, hasVideoSolution: False, 1454: questionNo: 1454, acRate: 36.61929804930812, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Active Users, slug: active-users, url: https://leetcode.com/problems/active-users, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 1455: questionNo: 1455, acRate: 64.34783292445115, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Check If a Word Occurs As a Prefix of Any Word in a Sentence, slug: check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence, url: https://leetcode.com/problems/check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence, topics: ['Two Pointers', 'String', 'String Matching'], hasSolution: False, hasVideoSolution: False, 1456: questionNo: 1456, acRate: 58.781244452709615, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum Number of Vowels in a Substring of Given Length, slug: maximum-number-of-vowels-in-a-substring-of-given-length, url: https://leetcode.com/problems/maximum-number-of-vowels-in-a-substring-of-given-length, topics: ['String', 'Sliding Window'], hasSolution: True, hasVideoSolution: False, 1457: questionNo: 1457, acRate: 68.35142753481622, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Pseudo-Palindromic Paths in a Binary Tree, slug: pseudo-palindromic-paths-in-a-binary-tree, url: https://leetcode.com/problems/pseudo-palindromic-paths-in-a-binary-tree, topics: ['Bit Manipulation', 'Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 1458: questionNo: 1458, acRate: 62.45353159851301, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Max Dot Product of Two Subsequences, slug: max-dot-product-of-two-subsequences, url: https://leetcode.com/problems/max-dot-product-of-two-subsequences, topics: ['Array', 'Dynamic Programming'], hasSolution: True, hasVideoSolution: False, 1459: questionNo: 1459, acRate: 68.51690897597977, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Rectangles Area, slug: rectangles-area, url: https://leetcode.com/problems/rectangles-area, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 1460: questionNo: 1460, acRate: 72.05357487629566, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Make Two Arrays Equal by Reversing Subarrays, slug: make-two-arrays-equal-by-reversing-subarrays, url: https://leetcode.com/problems/make-two-arrays-equal-by-reversing-subarrays, topics: ['Array', 'Hash Table', 'Sorting'], hasSolution: False, hasVideoSolution: False, 1461: questionNo: 1461, acRate: 56.534658490557334, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Check If a String Contains All Binary Codes of Size K, slug: check-if-a-string-contains-all-binary-codes-of-size-k, url: https://leetcode.com/problems/check-if-a-string-contains-all-binary-codes-of-size-k, topics: ['Hash Table', 'String', 'Bit Manipulation', 'Rolling Hash', 'Hash Function'], hasSolution: True, hasVideoSolution: False, 1462: questionNo: 1462, acRate: 49.9887705338809, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Course Schedule IV, slug: course-schedule-iv, url: https://leetcode.com/problems/course-schedule-iv, topics: ['Depth-First Search', 'Breadth-First Search', 'Graph', 'Topological Sort'], hasSolution: False, hasVideoSolution: False, 1463: questionNo: 1463, acRate: 71.86698255649804, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Cherry Pickup II, slug: cherry-pickup-ii, url: https://leetcode.com/problems/cherry-pickup-ii, topics: ['Array', 'Dynamic Programming', 'Matrix'], hasSolution: True, hasVideoSolution: False, 1464: questionNo: 1464, acRate: 82.77672002343333, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Maximum Product of Two Elements in an Array, slug: maximum-product-of-two-elements-in-an-array, url: https://leetcode.com/problems/maximum-product-of-two-elements-in-an-array, topics: ['Array', 'Sorting', 'Heap (Priority Queue)'], hasSolution: True, hasVideoSolution: False, 1465: questionNo: 1465, acRate: 41.054281459601285, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts, slug: maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts, url: https://leetcode.com/problems/maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts, topics: ['Array', 'Greedy', 'Sorting'], hasSolution: True, hasVideoSolution: False, 1466: questionNo: 1466, acRate: 64.45444796124923, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Reorder Routes to Make All Paths Lead to the City Zero, slug: reorder-routes-to-make-all-paths-lead-to-the-city-zero, url: https://leetcode.com/problems/reorder-routes-to-make-all-paths-lead-to-the-city-zero, topics: ['Depth-First Search', 'Breadth-First Search', 'Graph'], hasSolution: True, hasVideoSolution: False, 1467: questionNo: 1467, acRate: 60.53052983360022, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Probability of a Two Boxes Having The Same Number of Distinct Balls, slug: probability-of-a-two-boxes-having-the-same-number-of-distinct-balls, url: https://leetcode.com/problems/probability-of-a-two-boxes-having-the-same-number-of-distinct-balls, topics: ['Array', 'Math', 'Dynamic Programming', 'Backtracking', 'Combinatorics', 'Probability and Statistics'], hasSolution: False, hasVideoSolution: False, 1468: questionNo: 1468, acRate: 78.50245369637486, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Calculate Salaries, slug: calculate-salaries, url: https://leetcode.com/problems/calculate-salaries, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 1469: questionNo: 1469, acRate: 83.67466442449175, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Find All The Lonely Nodes, slug: find-all-the-lonely-nodes, url: https://leetcode.com/problems/find-all-the-lonely-nodes, topics: ['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 1470: questionNo: 1470, acRate: 88.57338861216333, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Shuffle the Array, slug: shuffle-the-array, url: https://leetcode.com/problems/shuffle-the-array, topics: ['Array'], hasSolution: True, hasVideoSolution: False, 1471: questionNo: 1471, acRate: 61.32227273437378, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: The k Strongest Values in an Array, slug: the-k-strongest-values-in-an-array, url: https://leetcode.com/problems/the-k-strongest-values-in-an-array, topics: ['Array', 'Two Pointers', 'Sorting'], hasSolution: False, hasVideoSolution: False, 1472: questionNo: 1472, acRate: 77.6361199691665, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Design Browser History, slug: design-browser-history, url: https://leetcode.com/problems/design-browser-history, topics: ['Array', 'Linked List', 'Stack', 'Design', 'Doubly-Linked List', 'Data Stream'], hasSolution: True, hasVideoSolution: False, 1473: questionNo: 1473, acRate: 60.97956567343926, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Paint House III, slug: paint-house-iii, url: https://leetcode.com/problems/paint-house-iii, topics: ['Array', 'Dynamic Programming'], hasSolution: True, hasVideoSolution: False, 1474: questionNo: 1474, acRate: 73.24760751890003, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Delete N Nodes After M Nodes of a Linked List, slug: delete-n-nodes-after-m-nodes-of-a-linked-list, url: https://leetcode.com/problems/delete-n-nodes-after-m-nodes-of-a-linked-list, topics: ['Linked List'], hasSolution: True, hasVideoSolution: False, 1475: questionNo: 1475, acRate: 78.16705417286926, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Final Prices With a Special Discount in a Shop, slug: final-prices-with-a-special-discount-in-a-shop, url: https://leetcode.com/problems/final-prices-with-a-special-discount-in-a-shop, topics: ['Array', 'Stack', 'Monotonic Stack'], hasSolution: False, hasVideoSolution: False, 1476: questionNo: 1476, acRate: 88.20472226886389, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Subrectangle Queries, slug: subrectangle-queries, url: https://leetcode.com/problems/subrectangle-queries, topics: ['Array', 'Design', 'Matrix'], hasSolution: False, hasVideoSolution: False, 1477: questionNo: 1477, acRate: 36.517699751091335, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Find Two Non-overlapping Sub-arrays Each With Target Sum, slug: find-two-non-overlapping-sub-arrays-each-with-target-sum, url: https://leetcode.com/problems/find-two-non-overlapping-sub-arrays-each-with-target-sum, topics: ['Array', 'Hash Table', 'Binary Search', 'Dynamic Programming', 'Sliding Window'], hasSolution: False, hasVideoSolution: False, 1478: questionNo: 1478, acRate: 55.41460867294763, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Allocate Mailboxes, slug: allocate-mailboxes, url: https://leetcode.com/problems/allocate-mailboxes, topics: ['Array', 'Math', 'Dynamic Programming', 'Sorting'], hasSolution: False, hasVideoSolution: False, 1479: questionNo: 1479, acRate: 77.44519574486411, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Sales by Day of the Week, slug: sales-by-day-of-the-week, url: https://leetcode.com/problems/sales-by-day-of-the-week, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 1480: questionNo: 1480, acRate: 86.8041996512723, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Running Sum of 1d Array, slug: running-sum-of-1d-array, url: https://leetcode.com/problems/running-sum-of-1d-array, topics: ['Array', 'Prefix Sum'], hasSolution: True, hasVideoSolution: True, 1481: questionNo: 1481, acRate: 63.06647541920006, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Least Number of Unique Integers after K Removals, slug: least-number-of-unique-integers-after-k-removals, url: https://leetcode.com/problems/least-number-of-unique-integers-after-k-removals, topics: ['Array', 'Hash Table', 'Greedy', 'Sorting', 'Counting'], hasSolution: True, hasVideoSolution: False, 1482: questionNo: 1482, acRate: 56.01586354239648, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Number of Days to Make m Bouquets, slug: minimum-number-of-days-to-make-m-bouquets, url: https://leetcode.com/problems/minimum-number-of-days-to-make-m-bouquets, topics: ['Array', 'Binary Search'], hasSolution: True, hasVideoSolution: False, 1483: questionNo: 1483, acRate: 34.77250926326481, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Kth Ancestor of a Tree Node, slug: kth-ancestor-of-a-tree-node, url: https://leetcode.com/problems/kth-ancestor-of-a-tree-node, topics: ['Binary Search', 'Dynamic Programming', 'Tree', 'Depth-First Search', 'Breadth-First Search', 'Design'], hasSolution: False, hasVideoSolution: False, 1484: questionNo: 1484, acRate: 76.91427223663581, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Group Sold Products By The Date, slug: group-sold-products-by-the-date, url: https://leetcode.com/problems/group-sold-products-by-the-date, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 1485: questionNo: 1485, acRate: 80.670736760684, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Clone Binary Tree With Random Pointer, slug: clone-binary-tree-with-random-pointer, url: https://leetcode.com/problems/clone-binary-tree-with-random-pointer, topics: ['Hash Table', 'Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 1486: questionNo: 1486, acRate: 86.03046641436397, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: XOR Operation in an Array, slug: xor-operation-in-an-array, url: https://leetcode.com/problems/xor-operation-in-an-array, topics: ['Math', 'Bit Manipulation'], hasSolution: False, hasVideoSolution: False, 1487: questionNo: 1487, acRate: 37.12873447831875, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Making File Names Unique, slug: making-file-names-unique, url: https://leetcode.com/problems/making-file-names-unique, topics: ['Array', 'Hash Table', 'String'], hasSolution: False, hasVideoSolution: False, 1488: questionNo: 1488, acRate: 26.99605554496532, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Avoid Flood in The City, slug: avoid-flood-in-the-city, url: https://leetcode.com/problems/avoid-flood-in-the-city, topics: ['Array', 'Hash Table', 'Binary Search', 'Greedy', 'Heap (Priority Queue)'], hasSolution: False, hasVideoSolution: False, 1489: questionNo: 1489, acRate: 67.5812318885258, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree, slug: find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree, url: https://leetcode.com/problems/find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree, topics: ['Union Find', 'Graph', 'Sorting', 'Minimum Spanning Tree', 'Strongly Connected Component'], hasSolution: True, hasVideoSolution: False, 1490: questionNo: 1490, acRate: 83.13015569132014, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Clone N-ary Tree, slug: clone-n-ary-tree, url: https://leetcode.com/problems/clone-n-ary-tree, topics: ['Hash Table', 'Tree', 'Depth-First Search', 'Breadth-First Search'], hasSolution: True, hasVideoSolution: False, 1491: questionNo: 1491, acRate: 63.46380174802342, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Average Salary Excluding the Minimum and Maximum Salary, slug: average-salary-excluding-the-minimum-and-maximum-salary, url: https://leetcode.com/problems/average-salary-excluding-the-minimum-and-maximum-salary, topics: ['Array', 'Sorting'], hasSolution: True, hasVideoSolution: False, 1492: questionNo: 1492, acRate: 68.02870728347331, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: The kth Factor of n, slug: the-kth-factor-of-n, url: https://leetcode.com/problems/the-kth-factor-of-n, topics: ['Math', 'Number Theory'], hasSolution: False, hasVideoSolution: False, 1493: questionNo: 1493, acRate: 67.65329162887971, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Longest Subarray of 1's After Deleting One Element, slug: longest-subarray-of-1s-after-deleting-one-element, url: https://leetcode.com/problems/longest-subarray-of-1s-after-deleting-one-element, topics: ['Array', 'Dynamic Programming', 'Sliding Window'], hasSolution: True, hasVideoSolution: False, 1494: questionNo: 1494, acRate: 29.508325110035553, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Parallel Courses II, slug: parallel-courses-ii, url: https://leetcode.com/problems/parallel-courses-ii, topics: ['Dynamic Programming', 'Bit Manipulation', 'Graph', 'Bitmask'], hasSolution: False, hasVideoSolution: False, 1495: questionNo: 1495, acRate: 48.99424845446437, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Friendly Movies Streamed Last Month, slug: friendly-movies-streamed-last-month, url: https://leetcode.com/problems/friendly-movies-streamed-last-month, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 1496: questionNo: 1496, acRate: 62.441420177007345, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Path Crossing, slug: path-crossing, url: https://leetcode.com/problems/path-crossing, topics: ['Hash Table', 'String'], hasSolution: True, hasVideoSolution: False, 1497: questionNo: 1497, acRate: 38.474053461133565, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Check If Array Pairs Are Divisible by k, slug: check-if-array-pairs-are-divisible-by-k, url: https://leetcode.com/problems/check-if-array-pairs-are-divisible-by-k, topics: ['Array', 'Hash Table', 'Counting'], hasSolution: False, hasVideoSolution: False, 1498: questionNo: 1498, acRate: 43.6635234139646, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Number of Subsequences That Satisfy the Given Sum Condition, slug: number-of-subsequences-that-satisfy-the-given-sum-condition, url: https://leetcode.com/problems/number-of-subsequences-that-satisfy-the-given-sum-condition, topics: ['Array', 'Two Pointers', 'Binary Search', 'Sorting'], hasSolution: True, hasVideoSolution: False, 1499: questionNo: 1499, acRate: 44.116617142399775, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Max Value of Equation, slug: max-value-of-equation, url: https://leetcode.com/problems/max-value-of-equation, topics: ['Array', 'Queue', 'Sliding Window', 'Heap (Priority Queue)', 'Monotonic Queue'], hasSolution: False, hasVideoSolution: False, 1500: questionNo: 1500, acRate: 43.33000997008973, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Design a File Sharing System, slug: design-a-file-sharing-system, url: https://leetcode.com/problems/design-a-file-sharing-system, topics: ['Hash Table', 'Design', 'Heap (Priority Queue)', 'Data Stream'], hasSolution: False, hasVideoSolution: False, 1501: questionNo: 1501, acRate: 50.11530278128146, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Countries You Can Safely Invest In, slug: countries-you-can-safely-invest-in, url: https://leetcode.com/problems/countries-you-can-safely-invest-in, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 1502: questionNo: 1502, acRate: 69.55968334168053, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Can Make Arithmetic Progression From Sequence, slug: can-make-arithmetic-progression-from-sequence, url: https://leetcode.com/problems/can-make-arithmetic-progression-from-sequence, topics: ['Array', 'Sorting'], hasSolution: True, hasVideoSolution: False, 1503: questionNo: 1503, acRate: 68.5038530657001, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Last Moment Before All Ants Fall Out of a Plank, slug: last-moment-before-all-ants-fall-out-of-a-plank, url: https://leetcode.com/problems/last-moment-before-all-ants-fall-out-of-a-plank, topics: ['Array', 'Brainteaser', 'Simulation'], hasSolution: True, hasVideoSolution: False, 1504: questionNo: 1504, acRate: 57.25104702384828, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Count Submatrices With All Ones, slug: count-submatrices-with-all-ones, url: https://leetcode.com/problems/count-submatrices-with-all-ones, topics: ['Array', 'Dynamic Programming', 'Stack', 'Matrix', 'Monotonic Stack'], hasSolution: False, hasVideoSolution: False, 1505: questionNo: 1505, acRate: 39.604830696323475, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Minimum Possible Integer After at Most K Adjacent Swaps On Digits, slug: minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits, url: https://leetcode.com/problems/minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits, topics: ['String', 'Greedy', 'Binary Indexed Tree', 'Segment Tree'], hasSolution: False, hasVideoSolution: False, 1506: questionNo: 1506, acRate: 78.40764757002474, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Find Root of N-Ary Tree, slug: find-root-of-n-ary-tree, url: https://leetcode.com/problems/find-root-of-n-ary-tree, topics: ['Hash Table', 'Bit Manipulation', 'Tree', 'Depth-First Search'], hasSolution: True, hasVideoSolution: False, 1507: questionNo: 1507, acRate: 66.31368977928103, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Reformat Date, slug: reformat-date, url: https://leetcode.com/problems/reformat-date, topics: ['String'], hasSolution: False, hasVideoSolution: False, 1508: questionNo: 1508, acRate: 58.407725897554364, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Range Sum of Sorted Subarray Sums, slug: range-sum-of-sorted-subarray-sums, url: https://leetcode.com/problems/range-sum-of-sorted-subarray-sums, topics: ['Array', 'Two Pointers', 'Binary Search', 'Sorting'], hasSolution: False, hasVideoSolution: False, 1509: questionNo: 1509, acRate: 59.1891724798813, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Difference Between Largest and Smallest Value in Three Moves, slug: minimum-difference-between-largest-and-smallest-value-in-three-moves, url: https://leetcode.com/problems/minimum-difference-between-largest-and-smallest-value-in-three-moves, topics: ['Array', 'Greedy', 'Sorting'], hasSolution: True, hasVideoSolution: False, 1510: questionNo: 1510, acRate: 59.74236152338508, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Stone Game IV, slug: stone-game-iv, url: https://leetcode.com/problems/stone-game-iv, topics: ['Math', 'Dynamic Programming', 'Game Theory'], hasSolution: True, hasVideoSolution: False, 1511: questionNo: 1511, acRate: 67.81732452336271, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Customer Order Frequency, slug: customer-order-frequency, url: https://leetcode.com/problems/customer-order-frequency, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 1512: questionNo: 1512, acRate: 89.16787837555417, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Number of Good Pairs, slug: number-of-good-pairs, url: https://leetcode.com/problems/number-of-good-pairs, topics: ['Array', 'Hash Table', 'Math', 'Counting'], hasSolution: True, hasVideoSolution: False, 1513: questionNo: 1513, acRate: 46.91521879021879, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Number of Substrings With Only 1s, slug: number-of-substrings-with-only-1s, url: https://leetcode.com/problems/number-of-substrings-with-only-1s, topics: ['Math', 'String'], hasSolution: False, hasVideoSolution: False, 1514: questionNo: 1514, acRate: 55.396590431553086, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Path with Maximum Probability, slug: path-with-maximum-probability, url: https://leetcode.com/problems/path-with-maximum-probability, topics: ['Array', 'Graph', 'Heap (Priority Queue)', 'Shortest Path'], hasSolution: True, hasVideoSolution: False, 1515: questionNo: 1515, acRate: 35.46547358587969, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Best Position for a Service Centre, slug: best-position-for-a-service-centre, url: https://leetcode.com/problems/best-position-for-a-service-centre, topics: ['Array', 'Math', 'Geometry', 'Randomized'], hasSolution: False, hasVideoSolution: False, 1516: questionNo: 1516, acRate: 62.108108108108105, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Move Sub-Tree of N-Ary Tree, slug: move-sub-tree-of-n-ary-tree, url: https://leetcode.com/problems/move-sub-tree-of-n-ary-tree, topics: ['Tree', 'Depth-First Search'], hasSolution: False, hasVideoSolution: False, 1517: questionNo: 1517, acRate: 44.181448116476254, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Find Users With Valid E-Mails, slug: find-users-with-valid-e-mails, url: https://leetcode.com/problems/find-users-with-valid-e-mails, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 1518: questionNo: 1518, acRate: 71.01276720458667, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Water Bottles, slug: water-bottles, url: https://leetcode.com/problems/water-bottles, topics: ['Math', 'Simulation'], hasSolution: True, hasVideoSolution: False, 1519: questionNo: 1519, acRate: 54.98512243874807, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Number of Nodes in the Sub-Tree With the Same Label, slug: number-of-nodes-in-the-sub-tree-with-the-same-label, url: https://leetcode.com/problems/number-of-nodes-in-the-sub-tree-with-the-same-label, topics: ['Hash Table', 'Tree', 'Depth-First Search', 'Breadth-First Search', 'Counting'], hasSolution: True, hasVideoSolution: False, 1520: questionNo: 1520, acRate: 39.444122756224665, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Maximum Number of Non-Overlapping Substrings, slug: maximum-number-of-non-overlapping-substrings, url: https://leetcode.com/problems/maximum-number-of-non-overlapping-substrings, topics: ['String', 'Greedy'], hasSolution: False, hasVideoSolution: False, 1521: questionNo: 1521, acRate: 45.270130407783064, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Find a Value of a Mysterious Function Closest to Target, slug: find-a-value-of-a-mysterious-function-closest-to-target, url: https://leetcode.com/problems/find-a-value-of-a-mysterious-function-closest-to-target, topics: ['Array', 'Binary Search', 'Bit Manipulation', 'Segment Tree'], hasSolution: False, hasVideoSolution: False, 1522: questionNo: 1522, acRate: 74.43024398963267, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Diameter of N-Ary Tree, slug: diameter-of-n-ary-tree, url: https://leetcode.com/problems/diameter-of-n-ary-tree, topics: ['Tree', 'Depth-First Search'], hasSolution: True, hasVideoSolution: False, 1523: questionNo: 1523, acRate: 49.95433149344054, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Count Odd Numbers in an Interval Range, slug: count-odd-numbers-in-an-interval-range, url: https://leetcode.com/problems/count-odd-numbers-in-an-interval-range, topics: ['Math'], hasSolution: True, hasVideoSolution: False, 1524: questionNo: 1524, acRate: 43.672420856817, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Number of Sub-arrays With Odd Sum, slug: number-of-sub-arrays-with-odd-sum, url: https://leetcode.com/problems/number-of-sub-arrays-with-odd-sum, topics: ['Array', 'Math', 'Dynamic Programming', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 1525: questionNo: 1525, acRate: 68.31184647316488, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Number of Good Ways to Split a String, slug: number-of-good-ways-to-split-a-string, url: https://leetcode.com/problems/number-of-good-ways-to-split-a-string, topics: ['Hash Table', 'String', 'Dynamic Programming', 'Bit Manipulation'], hasSolution: False, hasVideoSolution: False, 1526: questionNo: 1526, acRate: 70.47715076733773, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Minimum Number of Increments on Subarrays to Form a Target Array, slug: minimum-number-of-increments-on-subarrays-to-form-a-target-array, url: https://leetcode.com/problems/minimum-number-of-increments-on-subarrays-to-form-a-target-array, topics: ['Array', 'Dynamic Programming', 'Stack', 'Greedy', 'Monotonic Stack'], hasSolution: False, hasVideoSolution: False, 1527: questionNo: 1527, acRate: 40.296699012759326, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Patients With a Condition, slug: patients-with-a-condition, url: https://leetcode.com/problems/patients-with-a-condition, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 1528: questionNo: 1528, acRate: 84.76482004309884, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Shuffle String, slug: shuffle-string, url: https://leetcode.com/problems/shuffle-string, topics: ['Array', 'String'], hasSolution: False, hasVideoSolution: False, 1529: questionNo: 1529, acRate: 73.41110963807503, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Suffix Flips, slug: minimum-suffix-flips, url: https://leetcode.com/problems/minimum-suffix-flips, topics: ['String', 'Greedy'], hasSolution: False, hasVideoSolution: False, 1530: questionNo: 1530, acRate: 71.9270838515806, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Number of Good Leaf Nodes Pairs, slug: number-of-good-leaf-nodes-pairs, url: https://leetcode.com/problems/number-of-good-leaf-nodes-pairs, topics: ['Tree', 'Depth-First Search', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 1531: questionNo: 1531, acRate: 52.52056606269012, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: String Compression II, slug: string-compression-ii, url: https://leetcode.com/problems/string-compression-ii, topics: ['String', 'Dynamic Programming'], hasSolution: True, hasVideoSolution: False, 1532: questionNo: 1532, acRate: 68.40956582307871, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: The Most Recent Three Orders, slug: the-most-recent-three-orders, url: https://leetcode.com/problems/the-most-recent-three-orders, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 1533: questionNo: 1533, acRate: 56.167723061921016, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Find the Index of the Large Integer, slug: find-the-index-of-the-large-integer, url: https://leetcode.com/problems/find-the-index-of-the-large-integer, topics: ['Array', 'Binary Search', 'Interactive'], hasSolution: True, hasVideoSolution: False, 1534: questionNo: 1534, acRate: 81.3553067692855, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Count Good Triplets, slug: count-good-triplets, url: https://leetcode.com/problems/count-good-triplets, topics: ['Array', 'Enumeration'], hasSolution: False, hasVideoSolution: False, 1535: questionNo: 1535, acRate: 57.022636510914474, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Find the Winner of an Array Game, slug: find-the-winner-of-an-array-game, url: https://leetcode.com/problems/find-the-winner-of-an-array-game, topics: ['Array', 'Simulation'], hasSolution: True, hasVideoSolution: False, 1536: questionNo: 1536, acRate: 47.682201289043135, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Swaps to Arrange a Binary Grid, slug: minimum-swaps-to-arrange-a-binary-grid, url: https://leetcode.com/problems/minimum-swaps-to-arrange-a-binary-grid, topics: ['Array', 'Greedy', 'Matrix'], hasSolution: False, hasVideoSolution: False, 1537: questionNo: 1537, acRate: 39.55561391223156, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Get the Maximum Score, slug: get-the-maximum-score, url: https://leetcode.com/problems/get-the-maximum-score, topics: ['Array', 'Two Pointers', 'Dynamic Programming', 'Greedy'], hasSolution: False, hasVideoSolution: False, 1538: questionNo: 1538, acRate: 69.76860329615448, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Guess the Majority in a Hidden Array, slug: guess-the-majority-in-a-hidden-array, url: https://leetcode.com/problems/guess-the-majority-in-a-hidden-array, topics: ['Array', 'Math', 'Interactive'], hasSolution: True, hasVideoSolution: False, 1539: questionNo: 1539, acRate: 60.380833500785805, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Kth Missing Positive Number, slug: kth-missing-positive-number, url: https://leetcode.com/problems/kth-missing-positive-number, topics: ['Array', 'Binary Search'], hasSolution: True, hasVideoSolution: False, 1540: questionNo: 1540, acRate: 35.01121579183491, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Can Convert String in K Moves, slug: can-convert-string-in-k-moves, url: https://leetcode.com/problems/can-convert-string-in-k-moves, topics: ['Hash Table', 'String'], hasSolution: False, hasVideoSolution: False, 1541: questionNo: 1541, acRate: 52.65480917533554, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Insertions to Balance a Parentheses String, slug: minimum-insertions-to-balance-a-parentheses-string, url: https://leetcode.com/problems/minimum-insertions-to-balance-a-parentheses-string, topics: ['String', 'Stack', 'Greedy'], hasSolution: False, hasVideoSolution: False, 1542: questionNo: 1542, acRate: 43.782436592874944, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Find Longest Awesome Substring, slug: find-longest-awesome-substring, url: https://leetcode.com/problems/find-longest-awesome-substring, topics: ['Hash Table', 'String', 'Bit Manipulation'], hasSolution: False, hasVideoSolution: False, 1543: questionNo: 1543, acRate: 59.3908191440405, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Fix Product Name Format, slug: fix-product-name-format, url: https://leetcode.com/problems/fix-product-name-format, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 1544: questionNo: 1544, acRate: 68.34839438264727, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Make The String Great, slug: make-the-string-great, url: https://leetcode.com/problems/make-the-string-great, topics: ['String', 'Stack'], hasSolution: True, hasVideoSolution: False, 1545: questionNo: 1545, acRate: 58.89821331889551, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Find Kth Bit in Nth Binary String, slug: find-kth-bit-in-nth-binary-string, url: https://leetcode.com/problems/find-kth-bit-in-nth-binary-string, topics: ['String', 'Recursion', 'Simulation'], hasSolution: False, hasVideoSolution: False, 1546: questionNo: 1546, acRate: 47.799472470596044, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum Number of Non-Overlapping Subarrays With Sum Equals Target, slug: maximum-number-of-non-overlapping-subarrays-with-sum-equals-target, url: https://leetcode.com/problems/maximum-number-of-non-overlapping-subarrays-with-sum-equals-target, topics: ['Array', 'Hash Table', 'Greedy', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 1547: questionNo: 1547, acRate: 61.73186067870853, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Minimum Cost to Cut a Stick, slug: minimum-cost-to-cut-a-stick, url: https://leetcode.com/problems/minimum-cost-to-cut-a-stick, topics: ['Array', 'Dynamic Programming', 'Sorting'], hasSolution: True, hasVideoSolution: False, 1548: questionNo: 1548, acRate: 59.21043667824784, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: The Most Similar Path in a Graph, slug: the-most-similar-path-in-a-graph, url: https://leetcode.com/problems/the-most-similar-path-in-a-graph, topics: ['Dynamic Programming', 'Graph'], hasSolution: True, hasVideoSolution: False, 1549: questionNo: 1549, acRate: 64.7795976695614, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: The Most Recent Orders for Each Product, slug: the-most-recent-orders-for-each-product, url: https://leetcode.com/problems/the-most-recent-orders-for-each-product, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 1550: questionNo: 1550, acRate: 68.41448663640183, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Three Consecutive Odds, slug: three-consecutive-odds, url: https://leetcode.com/problems/three-consecutive-odds, topics: ['Array'], hasSolution: True, hasVideoSolution: False, 1551: questionNo: 1551, acRate: 82.35235682709978, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Operations to Make Array Equal, slug: minimum-operations-to-make-array-equal, url: https://leetcode.com/problems/minimum-operations-to-make-array-equal, topics: ['Math'], hasSolution: True, hasVideoSolution: False, 1552: questionNo: 1552, acRate: 71.0498578133806, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Magnetic Force Between Two Balls, slug: magnetic-force-between-two-balls, url: https://leetcode.com/problems/magnetic-force-between-two-balls, topics: ['Array', 'Binary Search', 'Sorting'], hasSolution: True, hasVideoSolution: False, 1553: questionNo: 1553, acRate: 35.4390728797944, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Minimum Number of Days to Eat N Oranges, slug: minimum-number-of-days-to-eat-n-oranges, url: https://leetcode.com/problems/minimum-number-of-days-to-eat-n-oranges, topics: ['Dynamic Programming', 'Memoization'], hasSolution: False, hasVideoSolution: False, 1554: questionNo: 1554, acRate: 41.680760384251116, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Strings Differ by One Character, slug: strings-differ-by-one-character, url: https://leetcode.com/problems/strings-differ-by-one-character, topics: ['Hash Table', 'String', 'Rolling Hash', 'Hash Function'], hasSolution: False, hasVideoSolution: False, 1555: questionNo: 1555, acRate: 51.3052403806142, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Bank Account Summary, slug: bank-account-summary, url: https://leetcode.com/problems/bank-account-summary, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 1556: questionNo: 1556, acRate: 53.72732099742529, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Thousand Separator, slug: thousand-separator, url: https://leetcode.com/problems/thousand-separator, topics: ['String'], hasSolution: False, hasVideoSolution: False, 1557: questionNo: 1557, acRate: 81.03683732122549, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Number of Vertices to Reach All Nodes, slug: minimum-number-of-vertices-to-reach-all-nodes, url: https://leetcode.com/problems/minimum-number-of-vertices-to-reach-all-nodes, topics: ['Graph'], hasSolution: True, hasVideoSolution: False, 1558: questionNo: 1558, acRate: 63.61179718146157, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Numbers of Function Calls to Make Target Array, slug: minimum-numbers-of-function-calls-to-make-target-array, url: https://leetcode.com/problems/minimum-numbers-of-function-calls-to-make-target-array, topics: ['Array', 'Greedy', 'Bit Manipulation'], hasSolution: False, hasVideoSolution: False, 1559: questionNo: 1559, acRate: 48.771387273521796, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Detect Cycles in 2D Grid, slug: detect-cycles-in-2d-grid, url: https://leetcode.com/problems/detect-cycles-in-2d-grid, topics: ['Array', 'Depth-First Search', 'Breadth-First Search', 'Union Find', 'Matrix'], hasSolution: False, hasVideoSolution: False, 1560: questionNo: 1560, acRate: 58.87972921329913, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Most Visited Sector in a Circular Track, slug: most-visited-sector-in-a-circular-track, url: https://leetcode.com/problems/most-visited-sector-in-a-circular-track, topics: ['Array', 'Simulation'], hasSolution: False, hasVideoSolution: False, 1561: questionNo: 1561, acRate: 84.5715848876911, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum Number of Coins You Can Get, slug: maximum-number-of-coins-you-can-get, url: https://leetcode.com/problems/maximum-number-of-coins-you-can-get, topics: ['Array', 'Math', 'Greedy', 'Sorting', 'Game Theory'], hasSolution: True, hasVideoSolution: False, 1562: questionNo: 1562, acRate: 42.94809464277446, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Find Latest Group of Size M, slug: find-latest-group-of-size-m, url: https://leetcode.com/problems/find-latest-group-of-size-m, topics: ['Array', 'Binary Search', 'Simulation'], hasSolution: False, hasVideoSolution: False, 1563: questionNo: 1563, acRate: 40.8818079278118, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Stone Game V, slug: stone-game-v, url: https://leetcode.com/problems/stone-game-v, topics: ['Array', 'Math', 'Dynamic Programming', 'Game Theory'], hasSolution: False, hasVideoSolution: False, 1564: questionNo: 1564, acRate: 67.37467447916666, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Put Boxes Into the Warehouse I, slug: put-boxes-into-the-warehouse-i, url: https://leetcode.com/problems/put-boxes-into-the-warehouse-i, topics: ['Array', 'Greedy', 'Sorting'], hasSolution: True, hasVideoSolution: False, 1565: questionNo: 1565, acRate: 82.07052878005277, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Unique Orders and Customers Per Month, slug: unique-orders-and-customers-per-month, url: https://leetcode.com/problems/unique-orders-and-customers-per-month, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 1566: questionNo: 1566, acRate: 43.23229108004211, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Detect Pattern of Length M Repeated K or More Times, slug: detect-pattern-of-length-m-repeated-k-or-more-times, url: https://leetcode.com/problems/detect-pattern-of-length-m-repeated-k-or-more-times, topics: ['Array', 'Enumeration'], hasSolution: False, hasVideoSolution: False, 1567: questionNo: 1567, acRate: 44.262384943928005, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum Length of Subarray With Positive Product, slug: maximum-length-of-subarray-with-positive-product, url: https://leetcode.com/problems/maximum-length-of-subarray-with-positive-product, topics: ['Array', 'Dynamic Programming', 'Greedy'], hasSolution: False, hasVideoSolution: False, 1568: questionNo: 1568, acRate: 44.806882891804904, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Minimum Number of Days to Disconnect Island, slug: minimum-number-of-days-to-disconnect-island, url: https://leetcode.com/problems/minimum-number-of-days-to-disconnect-island, topics: ['Array', 'Depth-First Search', 'Breadth-First Search', 'Matrix', 'Strongly Connected Component'], hasSolution: False, hasVideoSolution: False, 1569: questionNo: 1569, acRate: 53.48414905716279, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Number of Ways to Reorder Array to Get Same BST, slug: number-of-ways-to-reorder-array-to-get-same-bst, url: https://leetcode.com/problems/number-of-ways-to-reorder-array-to-get-same-bst, topics: ['Array', 'Math', 'Divide and Conquer', 'Dynamic Programming', 'Tree', 'Union Find', 'Binary Search Tree', 'Memoization', 'Combinatorics', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 1570: questionNo: 1570, acRate: 89.80642964673994, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Dot Product of Two Sparse Vectors, slug: dot-product-of-two-sparse-vectors, url: https://leetcode.com/problems/dot-product-of-two-sparse-vectors, topics: ['Array', 'Hash Table', 'Two Pointers', 'Design'], hasSolution: True, hasVideoSolution: False, 1571: questionNo: 1571, acRate: 87.7479483690049, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Warehouse Manager, slug: warehouse-manager, url: https://leetcode.com/problems/warehouse-manager, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 1572: questionNo: 1572, acRate: 83.10264322729236, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Matrix Diagonal Sum, slug: matrix-diagonal-sum, url: https://leetcode.com/problems/matrix-diagonal-sum, topics: ['Array', 'Matrix'], hasSolution: True, hasVideoSolution: False, 1573: questionNo: 1573, acRate: 33.412228796844175, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Number of Ways to Split a String, slug: number-of-ways-to-split-a-string, url: https://leetcode.com/problems/number-of-ways-to-split-a-string, topics: ['Math', 'String'], hasSolution: False, hasVideoSolution: False, 1574: questionNo: 1574, acRate: 38.03644773135155, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Shortest Subarray to be Removed to Make Array Sorted, slug: shortest-subarray-to-be-removed-to-make-array-sorted, url: https://leetcode.com/problems/shortest-subarray-to-be-removed-to-make-array-sorted, topics: ['Array', 'Two Pointers', 'Binary Search', 'Stack', 'Monotonic Stack'], hasSolution: False, hasVideoSolution: False, 1575: questionNo: 1575, acRate: 65.2738767974039, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Count All Possible Routes, slug: count-all-possible-routes, url: https://leetcode.com/problems/count-all-possible-routes, topics: ['Array', 'Dynamic Programming', 'Memoization'], hasSolution: True, hasVideoSolution: False, 1576: questionNo: 1576, acRate: 46.253311657032754, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Replace All ?'s to Avoid Consecutive Repeating Characters, slug: replace-all-s-to-avoid-consecutive-repeating-characters, url: https://leetcode.com/problems/replace-all-s-to-avoid-consecutive-repeating-characters, topics: ['String'], hasSolution: False, hasVideoSolution: False, 1577: questionNo: 1577, acRate: 41.3478488270732, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Number of Ways Where Square of Number Is Equal to Product of Two Numbers, slug: number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers, url: https://leetcode.com/problems/number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers, topics: ['Array', 'Hash Table', 'Math', 'Two Pointers'], hasSolution: False, hasVideoSolution: False, 1578: questionNo: 1578, acRate: 63.71797888297404, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Time to Make Rope Colorful, slug: minimum-time-to-make-rope-colorful, url: https://leetcode.com/problems/minimum-time-to-make-rope-colorful, topics: ['Array', 'String', 'Dynamic Programming', 'Greedy'], hasSolution: True, hasVideoSolution: False, 1579: questionNo: 1579, acRate: 71.01007991382059, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Remove Max Number of Edges to Keep Graph Fully Traversable, slug: remove-max-number-of-edges-to-keep-graph-fully-traversable, url: https://leetcode.com/problems/remove-max-number-of-edges-to-keep-graph-fully-traversable, topics: ['Union Find', 'Graph'], hasSolution: True, hasVideoSolution: False, 1580: questionNo: 1580, acRate: 66.24252063924865, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Put Boxes Into the Warehouse II, slug: put-boxes-into-the-warehouse-ii, url: https://leetcode.com/problems/put-boxes-into-the-warehouse-ii, topics: ['Array', 'Greedy', 'Sorting'], hasSolution: True, hasVideoSolution: False, 1581: questionNo: 1581, acRate: 67.90012646793134, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Customer Who Visited but Did Not Make Any Transactions, slug: customer-who-visited-but-did-not-make-any-transactions, url: https://leetcode.com/problems/customer-who-visited-but-did-not-make-any-transactions, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 1582: questionNo: 1582, acRate: 68.64383193090204, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Special Positions in a Binary Matrix, slug: special-positions-in-a-binary-matrix, url: https://leetcode.com/problems/special-positions-in-a-binary-matrix, topics: ['Array', 'Matrix'], hasSolution: True, hasVideoSolution: False, 1583: questionNo: 1583, acRate: 61.60513643659711, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Count Unhappy Friends, slug: count-unhappy-friends, url: https://leetcode.com/problems/count-unhappy-friends, topics: ['Array', 'Simulation'], hasSolution: False, hasVideoSolution: False, 1584: questionNo: 1584, acRate: 67.23023791934062, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Min Cost to Connect All Points, slug: min-cost-to-connect-all-points, url: https://leetcode.com/problems/min-cost-to-connect-all-points, topics: ['Array', 'Union Find', 'Graph', 'Minimum Spanning Tree'], hasSolution: True, hasVideoSolution: False, 1585: questionNo: 1585, acRate: 48.644124539671914, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Check If String Is Transformable With Substring Sort Operations, slug: check-if-string-is-transformable-with-substring-sort-operations, url: https://leetcode.com/problems/check-if-string-is-transformable-with-substring-sort-operations, topics: ['String', 'Greedy', 'Sorting'], hasSolution: False, hasVideoSolution: False, 1586: questionNo: 1586, acRate: 64.43357857697755, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Binary Search Tree Iterator II, slug: binary-search-tree-iterator-ii, url: https://leetcode.com/problems/binary-search-tree-iterator-ii, topics: ['Stack', 'Tree', 'Design', 'Binary Search Tree', 'Binary Tree', 'Iterator'], hasSolution: True, hasVideoSolution: False, 1587: questionNo: 1587, acRate: 83.37610917228751, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Bank Account Summary II, slug: bank-account-summary-ii, url: https://leetcode.com/problems/bank-account-summary-ii, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 1588: questionNo: 1588, acRate: 83.15312957495358, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Sum of All Odd Length Subarrays, slug: sum-of-all-odd-length-subarrays, url: https://leetcode.com/problems/sum-of-all-odd-length-subarrays, topics: ['Array', 'Math', 'Prefix Sum'], hasSolution: True, hasVideoSolution: False, 1589: questionNo: 1589, acRate: 38.133463370719085, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum Sum Obtained of Any Permutation, slug: maximum-sum-obtained-of-any-permutation, url: https://leetcode.com/problems/maximum-sum-obtained-of-any-permutation, topics: ['Array', 'Greedy', 'Sorting', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 1590: questionNo: 1590, acRate: 29.17268334007201, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Make Sum Divisible by P, slug: make-sum-divisible-by-p, url: https://leetcode.com/problems/make-sum-divisible-by-p, topics: ['Array', 'Hash Table', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 1591: questionNo: 1591, acRate: 59.112503262855654, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Strange Printer II, slug: strange-printer-ii, url: https://leetcode.com/problems/strange-printer-ii, topics: ['Array', 'Graph', 'Topological Sort', 'Matrix'], hasSolution: False, hasVideoSolution: False, 1592: questionNo: 1592, acRate: 43.2683943729566, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Rearrange Spaces Between Words, slug: rearrange-spaces-between-words, url: https://leetcode.com/problems/rearrange-spaces-between-words, topics: ['String'], hasSolution: False, hasVideoSolution: False, 1593: questionNo: 1593, acRate: 56.63534468977033, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Split a String Into the Max Number of Unique Substrings, slug: split-a-string-into-the-max-number-of-unique-substrings, url: https://leetcode.com/problems/split-a-string-into-the-max-number-of-unique-substrings, topics: ['Hash Table', 'String', 'Backtracking'], hasSolution: False, hasVideoSolution: False, 1594: questionNo: 1594, acRate: 33.81492995165774, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum Non Negative Product in a Matrix, slug: maximum-non-negative-product-in-a-matrix, url: https://leetcode.com/problems/maximum-non-negative-product-in-a-matrix, topics: ['Array', 'Dynamic Programming', 'Matrix'], hasSolution: False, hasVideoSolution: False, 1595: questionNo: 1595, acRate: 48.12859139617953, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Minimum Cost to Connect Two Groups of Points, slug: minimum-cost-to-connect-two-groups-of-points, url: https://leetcode.com/problems/minimum-cost-to-connect-two-groups-of-points, topics: ['Array', 'Dynamic Programming', 'Bit Manipulation', 'Matrix', 'Bitmask'], hasSolution: False, hasVideoSolution: False, 1596: questionNo: 1596, acRate: 78.36780970891758, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: The Most Frequently Ordered Products for Each Customer, slug: the-most-frequently-ordered-products-for-each-customer, url: https://leetcode.com/problems/the-most-frequently-ordered-products-for-each-customer, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 1597: questionNo: 1597, acRate: 62.511816978634904, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Build Binary Expression Tree From Infix Expression, slug: build-binary-expression-tree-from-infix-expression, url: https://leetcode.com/problems/build-binary-expression-tree-from-infix-expression, topics: ['String', 'Stack', 'Tree', 'Binary Tree'], hasSolution: False, hasVideoSolution: False, 1598: questionNo: 1598, acRate: 71.77613465168228, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Crawler Log Folder, slug: crawler-log-folder, url: https://leetcode.com/problems/crawler-log-folder, topics: ['Array', 'String', 'Stack'], hasSolution: True, hasVideoSolution: False, 1599: questionNo: 1599, acRate: 44.10089224433768, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum Profit of Operating a Centennial Wheel, slug: maximum-profit-of-operating-a-centennial-wheel, url: https://leetcode.com/problems/maximum-profit-of-operating-a-centennial-wheel, topics: ['Array', 'Simulation'], hasSolution: False, hasVideoSolution: False, 1600: questionNo: 1600, acRate: 65.54944259446938, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Throne Inheritance, slug: throne-inheritance, url: https://leetcode.com/problems/throne-inheritance, topics: ['Hash Table', 'Tree', 'Depth-First Search', 'Design'], hasSolution: False, hasVideoSolution: False, 1601: questionNo: 1601, acRate: 64.52957772218986, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Maximum Number of Achievable Transfer Requests, slug: maximum-number-of-achievable-transfer-requests, url: https://leetcode.com/problems/maximum-number-of-achievable-transfer-requests, topics: ['Array', 'Backtracking', 'Bit Manipulation', 'Enumeration'], hasSolution: True, hasVideoSolution: False, 1602: questionNo: 1602, acRate: 75.46771469403663, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Find Nearest Right Node in Binary Tree, slug: find-nearest-right-node-in-binary-tree, url: https://leetcode.com/problems/find-nearest-right-node-in-binary-tree, topics: ['Tree', 'Breadth-First Search', 'Binary Tree'], hasSolution: True, hasVideoSolution: True, 1603: questionNo: 1603, acRate: 87.95636269662783, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Design Parking System, slug: design-parking-system, url: https://leetcode.com/problems/design-parking-system, topics: ['Design', 'Simulation', 'Counting'], hasSolution: True, hasVideoSolution: False, 1604: questionNo: 1604, acRate: 45.83823110902139, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Alert Using Same Key-Card Three or More Times in a One Hour Period, slug: alert-using-same-key-card-three-or-more-times-in-a-one-hour-period, url: https://leetcode.com/problems/alert-using-same-key-card-three-or-more-times-in-a-one-hour-period, topics: ['Array', 'Hash Table', 'String', 'Sorting'], hasSolution: False, hasVideoSolution: False, 1605: questionNo: 1605, acRate: 83.1294895319021, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Find Valid Matrix Given Row and Column Sums, slug: find-valid-matrix-given-row-and-column-sums, url: https://leetcode.com/problems/find-valid-matrix-given-row-and-column-sums, topics: ['Array', 'Greedy', 'Matrix'], hasSolution: True, hasVideoSolution: False, 1606: questionNo: 1606, acRate: 43.61096348037355, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Find Servers That Handled Most Number of Requests, slug: find-servers-that-handled-most-number-of-requests, url: https://leetcode.com/problems/find-servers-that-handled-most-number-of-requests, topics: ['Array', 'Greedy', 'Heap (Priority Queue)', 'Ordered Set'], hasSolution: True, hasVideoSolution: False, 1607: questionNo: 1607, acRate: 54.31912425922689, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Sellers With No Sales, slug: sellers-with-no-sales, url: https://leetcode.com/problems/sellers-with-no-sales, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 1608: questionNo: 1608, acRate: 66.908371562746, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Special Array With X Elements Greater Than or Equal X, slug: special-array-with-x-elements-greater-than-or-equal-x, url: https://leetcode.com/problems/special-array-with-x-elements-greater-than-or-equal-x, topics: ['Array', 'Binary Search', 'Sorting'], hasSolution: True, hasVideoSolution: False, 1609: questionNo: 1609, acRate: 65.82522989549454, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Even Odd Tree, slug: even-odd-tree, url: https://leetcode.com/problems/even-odd-tree, topics: ['Tree', 'Breadth-First Search', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 1610: questionNo: 1610, acRate: 37.35569870527457, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Maximum Number of Visible Points, slug: maximum-number-of-visible-points, url: https://leetcode.com/problems/maximum-number-of-visible-points, topics: ['Array', 'Math', 'Geometry', 'Sliding Window', 'Sorting'], hasSolution: False, hasVideoSolution: False, 1611: questionNo: 1611, acRate: 74.04427571121475, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Minimum One Bit Operations to Make Integers Zero, slug: minimum-one-bit-operations-to-make-integers-zero, url: https://leetcode.com/problems/minimum-one-bit-operations-to-make-integers-zero, topics: ['Dynamic Programming', 'Bit Manipulation', 'Memoization'], hasSolution: True, hasVideoSolution: False, 1612: questionNo: 1612, acRate: 70.5843293492696, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Check If Two Expression Trees are Equivalent, slug: check-if-two-expression-trees-are-equivalent, url: https://leetcode.com/problems/check-if-two-expression-trees-are-equivalent, topics: ['Hash Table', 'Tree', 'Depth-First Search', 'Binary Tree', 'Counting'], hasSolution: False, hasVideoSolution: False, 1613: questionNo: 1613, acRate: 73.0273199023199, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Find the Missing IDs, slug: find-the-missing-ids, url: https://leetcode.com/problems/find-the-missing-ids, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 1614: questionNo: 1614, acRate: 83.84395736404547, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Maximum Nesting Depth of the Parentheses, slug: maximum-nesting-depth-of-the-parentheses, url: https://leetcode.com/problems/maximum-nesting-depth-of-the-parentheses, topics: ['String', 'Stack'], hasSolution: True, hasVideoSolution: False, 1615: questionNo: 1615, acRate: 65.12909724319135, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximal Network Rank, slug: maximal-network-rank, url: https://leetcode.com/problems/maximal-network-rank, topics: ['Graph'], hasSolution: True, hasVideoSolution: False, 1616: questionNo: 1616, acRate: 31.041641226034926, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Split Two Strings to Make Palindrome, slug: split-two-strings-to-make-palindrome, url: https://leetcode.com/problems/split-two-strings-to-make-palindrome, topics: ['Two Pointers', 'String'], hasSolution: False, hasVideoSolution: False, 1617: questionNo: 1617, acRate: 65.87788131436979, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Count Subtrees With Max Distance Between Cities, slug: count-subtrees-with-max-distance-between-cities, url: https://leetcode.com/problems/count-subtrees-with-max-distance-between-cities, topics: ['Dynamic Programming', 'Bit Manipulation', 'Tree', 'Enumeration', 'Bitmask'], hasSolution: False, hasVideoSolution: False, 1618: questionNo: 1618, acRate: 60.909090909090914, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Maximum Font to Fit a Sentence in a Screen, slug: maximum-font-to-fit-a-sentence-in-a-screen, url: https://leetcode.com/problems/maximum-font-to-fit-a-sentence-in-a-screen, topics: ['Array', 'String', 'Binary Search', 'Interactive'], hasSolution: False, hasVideoSolution: False, 1619: questionNo: 1619, acRate: 68.64684999499204, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Mean of Array After Removing Some Elements, slug: mean-of-array-after-removing-some-elements, url: https://leetcode.com/problems/mean-of-array-after-removing-some-elements, topics: ['Array', 'Sorting'], hasSolution: False, hasVideoSolution: False, 1620: questionNo: 1620, acRate: 38.005914659907056, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Coordinate With Maximum Network Quality, slug: coordinate-with-maximum-network-quality, url: https://leetcode.com/problems/coordinate-with-maximum-network-quality, topics: ['Array', 'Enumeration'], hasSolution: False, hasVideoSolution: False, 1621: questionNo: 1621, acRate: 43.66384108228444, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Number of Sets of K Non-Overlapping Line Segments, slug: number-of-sets-of-k-non-overlapping-line-segments, url: https://leetcode.com/problems/number-of-sets-of-k-non-overlapping-line-segments, topics: ['Math', 'Dynamic Programming', 'Combinatorics'], hasSolution: False, hasVideoSolution: False, 1622: questionNo: 1622, acRate: 17.355348494718058, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Fancy Sequence, slug: fancy-sequence, url: https://leetcode.com/problems/fancy-sequence, topics: ['Math', 'Design', 'Segment Tree'], hasSolution: False, hasVideoSolution: False, 1623: questionNo: 1623, acRate: 81.95907991307557, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: All Valid Triplets That Can Represent a Country, slug: all-valid-triplets-that-can-represent-a-country, url: https://leetcode.com/problems/all-valid-triplets-that-can-represent-a-country, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 1624: questionNo: 1624, acRate: 68.56384987659526, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Largest Substring Between Two Equal Characters, slug: largest-substring-between-two-equal-characters, url: https://leetcode.com/problems/largest-substring-between-two-equal-characters, topics: ['Hash Table', 'String'], hasSolution: True, hasVideoSolution: False, 1625: questionNo: 1625, acRate: 65.53499738174202, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Lexicographically Smallest String After Applying Operations, slug: lexicographically-smallest-string-after-applying-operations, url: https://leetcode.com/problems/lexicographically-smallest-string-after-applying-operations, topics: ['String', 'Depth-First Search', 'Breadth-First Search', 'Enumeration'], hasSolution: False, hasVideoSolution: False, 1626: questionNo: 1626, acRate: 50.377915346962276, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Best Team With No Conflicts, slug: best-team-with-no-conflicts, url: https://leetcode.com/problems/best-team-with-no-conflicts, topics: ['Array', 'Dynamic Programming', 'Sorting'], hasSolution: True, hasVideoSolution: False, 1627: questionNo: 1627, acRate: 47.162617019038606, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Graph Connectivity With Threshold, slug: graph-connectivity-with-threshold, url: https://leetcode.com/problems/graph-connectivity-with-threshold, topics: ['Array', 'Math', 'Union Find', 'Number Theory'], hasSolution: False, hasVideoSolution: False, 1628: questionNo: 1628, acRate: 82.54390304229533, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Design an Expression Tree With Evaluate Function, slug: design-an-expression-tree-with-evaluate-function, url: https://leetcode.com/problems/design-an-expression-tree-with-evaluate-function, topics: ['Array', 'Math', 'Stack', 'Tree', 'Design', 'Binary Tree'], hasSolution: False, hasVideoSolution: False, 1629: questionNo: 1629, acRate: 59.0974074095686, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Slowest Key, slug: slowest-key, url: https://leetcode.com/problems/slowest-key, topics: ['Array', 'String'], hasSolution: True, hasVideoSolution: False, 1630: questionNo: 1630, acRate: 83.7523628918777, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Arithmetic Subarrays, slug: arithmetic-subarrays, url: https://leetcode.com/problems/arithmetic-subarrays, topics: ['Array', 'Hash Table', 'Sorting'], hasSolution: True, hasVideoSolution: False, 1631: questionNo: 1631, acRate: 59.94217988480284, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Path With Minimum Effort, slug: path-with-minimum-effort, url: https://leetcode.com/problems/path-with-minimum-effort, topics: ['Array', 'Binary Search', 'Depth-First Search', 'Breadth-First Search', 'Union Find', 'Heap (Priority Queue)', 'Matrix'], hasSolution: True, hasVideoSolution: False, 1632: questionNo: 1632, acRate: 40.98153440316553, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Rank Transform of a Matrix, slug: rank-transform-of-a-matrix, url: https://leetcode.com/problems/rank-transform-of-a-matrix, topics: ['Array', 'Union Find', 'Graph', 'Topological Sort', 'Sorting', 'Matrix'], hasSolution: True, hasVideoSolution: False, 1633: questionNo: 1633, acRate: 56.27628594589862, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Percentage of Users Attended a Contest, slug: percentage-of-users-attended-a-contest, url: https://leetcode.com/problems/percentage-of-users-attended-a-contest, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 1634: questionNo: 1634, acRate: 55.42036610764003, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Add Two Polynomials Represented as Linked Lists, slug: add-two-polynomials-represented-as-linked-lists, url: https://leetcode.com/problems/add-two-polynomials-represented-as-linked-lists, topics: ['Linked List', 'Math', 'Two Pointers'], hasSolution: False, hasVideoSolution: False, 1635: questionNo: 1635, acRate: 47.65815760266371, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Hopper Company Queries I, slug: hopper-company-queries-i, url: https://leetcode.com/problems/hopper-company-queries-i, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 1636: questionNo: 1636, acRate: 79.69322829196409, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Sort Array by Increasing Frequency, slug: sort-array-by-increasing-frequency, url: https://leetcode.com/problems/sort-array-by-increasing-frequency, topics: ['Array', 'Hash Table', 'Sorting'], hasSolution: True, hasVideoSolution: False, 1637: questionNo: 1637, acRate: 87.41605324190783, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Widest Vertical Area Between Two Points Containing No Points, slug: widest-vertical-area-between-two-points-containing-no-points, url: https://leetcode.com/problems/widest-vertical-area-between-two-points-containing-no-points, topics: ['Array', 'Sorting'], hasSolution: True, hasVideoSolution: False, 1638: questionNo: 1638, acRate: 71.26086856246685, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Count Substrings That Differ by One Character, slug: count-substrings-that-differ-by-one-character, url: https://leetcode.com/problems/count-substrings-that-differ-by-one-character, topics: ['Hash Table', 'String', 'Dynamic Programming', 'Enumeration'], hasSolution: False, hasVideoSolution: False, 1639: questionNo: 1639, acRate: 51.10588861298333, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Number of Ways to Form a Target String Given a Dictionary, slug: number-of-ways-to-form-a-target-string-given-a-dictionary, url: https://leetcode.com/problems/number-of-ways-to-form-a-target-string-given-a-dictionary, topics: ['Array', 'String', 'Dynamic Programming'], hasSolution: True, hasVideoSolution: False, 1640: questionNo: 1640, acRate: 56.61597348005878, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Check Array Formation Through Concatenation, slug: check-array-formation-through-concatenation, url: https://leetcode.com/problems/check-array-formation-through-concatenation, topics: ['Array', 'Hash Table'], hasSolution: True, hasVideoSolution: False, 1641: questionNo: 1641, acRate: 78.49410875181148, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Count Sorted Vowel Strings, slug: count-sorted-vowel-strings, url: https://leetcode.com/problems/count-sorted-vowel-strings, topics: ['Math', 'Dynamic Programming', 'Combinatorics'], hasSolution: True, hasVideoSolution: False, 1642: questionNo: 1642, acRate: 49.77800068173874, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Furthest Building You Can Reach, slug: furthest-building-you-can-reach, url: https://leetcode.com/problems/furthest-building-you-can-reach, topics: ['Array', 'Greedy', 'Heap (Priority Queue)'], hasSolution: True, hasVideoSolution: False, 1643: questionNo: 1643, acRate: 48.24312888627249, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Kth Smallest Instructions, slug: kth-smallest-instructions, url: https://leetcode.com/problems/kth-smallest-instructions, topics: ['Array', 'Math', 'Dynamic Programming', 'Combinatorics'], hasSolution: False, hasVideoSolution: False, 1644: questionNo: 1644, acRate: 64.72802855013921, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Lowest Common Ancestor of a Binary Tree II, slug: lowest-common-ancestor-of-a-binary-tree-ii, url: https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree-ii, topics: ['Tree', 'Depth-First Search', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 1645: questionNo: 1645, acRate: 39.11328308996703, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Hopper Company Queries II, slug: hopper-company-queries-ii, url: https://leetcode.com/problems/hopper-company-queries-ii, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 1646: questionNo: 1646, acRate: 50.4825811195882, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Get Maximum in Generated Array, slug: get-maximum-in-generated-array, url: https://leetcode.com/problems/get-maximum-in-generated-array, topics: ['Array', 'Simulation'], hasSolution: False, hasVideoSolution: False, 1647: questionNo: 1647, acRate: 61.23922059698577, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Deletions to Make Character Frequencies Unique, slug: minimum-deletions-to-make-character-frequencies-unique, url: https://leetcode.com/problems/minimum-deletions-to-make-character-frequencies-unique, topics: ['Hash Table', 'String', 'Greedy', 'Sorting'], hasSolution: True, hasVideoSolution: False, 1648: questionNo: 1648, acRate: 29.965509603518655, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Sell Diminishing-Valued Colored Balls, slug: sell-diminishing-valued-colored-balls, url: https://leetcode.com/problems/sell-diminishing-valued-colored-balls, topics: ['Array', 'Math', 'Binary Search', 'Greedy', 'Sorting', 'Heap (Priority Queue)'], hasSolution: False, hasVideoSolution: False, 1649: questionNo: 1649, acRate: 39.058907299995546, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Create Sorted Array through Instructions, slug: create-sorted-array-through-instructions, url: https://leetcode.com/problems/create-sorted-array-through-instructions, topics: ['Array', 'Binary Search', 'Divide and Conquer', 'Binary Indexed Tree', 'Segment Tree', 'Merge Sort', 'Ordered Set'], hasSolution: True, hasVideoSolution: False, 1650: questionNo: 1650, acRate: 80.04901058667416, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Lowest Common Ancestor of a Binary Tree III, slug: lowest-common-ancestor-of-a-binary-tree-iii, url: https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree-iii, topics: ['Hash Table', 'Two Pointers', 'Tree', 'Binary Tree'], hasSolution: False, hasVideoSolution: False, 1651: questionNo: 1651, acRate: 65.16264428121721, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Hopper Company Queries III, slug: hopper-company-queries-iii, url: https://leetcode.com/problems/hopper-company-queries-iii, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 1652: questionNo: 1652, acRate: 66.11527526492634, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Defuse the Bomb, slug: defuse-the-bomb, url: https://leetcode.com/problems/defuse-the-bomb, topics: ['Array', 'Sliding Window'], hasSolution: False, hasVideoSolution: False, 1653: questionNo: 1653, acRate: 58.79646544608181, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Deletions to Make String Balanced, slug: minimum-deletions-to-make-string-balanced, url: https://leetcode.com/problems/minimum-deletions-to-make-string-balanced, topics: ['String', 'Dynamic Programming', 'Stack'], hasSolution: False, hasVideoSolution: False, 1654: questionNo: 1654, acRate: 29.4594975535435, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Jumps to Reach Home, slug: minimum-jumps-to-reach-home, url: https://leetcode.com/problems/minimum-jumps-to-reach-home, topics: ['Array', 'Dynamic Programming', 'Breadth-First Search'], hasSolution: False, hasVideoSolution: False, 1655: questionNo: 1655, acRate: 39.56249679437862, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Distribute Repeating Integers, slug: distribute-repeating-integers, url: https://leetcode.com/problems/distribute-repeating-integers, topics: ['Array', 'Dynamic Programming', 'Backtracking', 'Bit Manipulation', 'Bitmask'], hasSolution: False, hasVideoSolution: False, 1656: questionNo: 1656, acRate: 84.38680505208532, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Design an Ordered Stream, slug: design-an-ordered-stream, url: https://leetcode.com/problems/design-an-ordered-stream, topics: ['Array', 'Hash Table', 'Design', 'Data Stream'], hasSolution: False, hasVideoSolution: False, 1657: questionNo: 1657, acRate: 54.61181971676638, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Determine if Two Strings Are Close, slug: determine-if-two-strings-are-close, url: https://leetcode.com/problems/determine-if-two-strings-are-close, topics: ['Hash Table', 'String', 'Sorting', 'Counting'], hasSolution: True, hasVideoSolution: False, 1658: questionNo: 1658, acRate: 39.74545722363839, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Operations to Reduce X to Zero, slug: minimum-operations-to-reduce-x-to-zero, url: https://leetcode.com/problems/minimum-operations-to-reduce-x-to-zero, topics: ['Array', 'Hash Table', 'Binary Search', 'Sliding Window', 'Prefix Sum'], hasSolution: True, hasVideoSolution: False, 1659: questionNo: 1659, acRate: 39.64934516265315, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Maximize Grid Happiness, slug: maximize-grid-happiness, url: https://leetcode.com/problems/maximize-grid-happiness, topics: ['Dynamic Programming', 'Bit Manipulation', 'Memoization', 'Bitmask'], hasSolution: False, hasVideoSolution: False, 1660: questionNo: 1660, acRate: 74.38637565138585, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Correct a Binary Tree, slug: correct-a-binary-tree, url: https://leetcode.com/problems/correct-a-binary-tree, topics: ['Hash Table', 'Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 1661: questionNo: 1661, acRate: 67.53408691727714, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Average Time of Process per Machine, slug: average-time-of-process-per-machine, url: https://leetcode.com/problems/average-time-of-process-per-machine, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 1662: questionNo: 1662, acRate: 85.51236083572195, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Check If Two String Arrays are Equivalent, slug: check-if-two-string-arrays-are-equivalent, url: https://leetcode.com/problems/check-if-two-string-arrays-are-equivalent, topics: ['Array', 'String'], hasSolution: True, hasVideoSolution: False, 1663: questionNo: 1663, acRate: 66.83241679133043, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Smallest String With A Given Numeric Value, slug: smallest-string-with-a-given-numeric-value, url: https://leetcode.com/problems/smallest-string-with-a-given-numeric-value, topics: ['String', 'Greedy'], hasSolution: True, hasVideoSolution: False, 1664: questionNo: 1664, acRate: 63.600462338663064, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Ways to Make a Fair Array, slug: ways-to-make-a-fair-array, url: https://leetcode.com/problems/ways-to-make-a-fair-array, topics: ['Array', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 1665: questionNo: 1665, acRate: 58.15888701079184, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Minimum Initial Energy to Finish Tasks, slug: minimum-initial-energy-to-finish-tasks, url: https://leetcode.com/problems/minimum-initial-energy-to-finish-tasks, topics: ['Array', 'Greedy', 'Sorting'], hasSolution: False, hasVideoSolution: False, 1666: questionNo: 1666, acRate: 73.81708238851095, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Change the Root of a Binary Tree, slug: change-the-root-of-a-binary-tree, url: https://leetcode.com/problems/change-the-root-of-a-binary-tree, topics: ['Tree', 'Depth-First Search', 'Binary Tree'], hasSolution: False, hasVideoSolution: False, 1667: questionNo: 1667, acRate: 61.44883208622354, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Fix Names in a Table, slug: fix-names-in-a-table, url: https://leetcode.com/problems/fix-names-in-a-table, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 1668: questionNo: 1668, acRate: 38.76087525927184, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Maximum Repeating Substring, slug: maximum-repeating-substring, url: https://leetcode.com/problems/maximum-repeating-substring, topics: ['String', 'Dynamic Programming', 'String Matching'], hasSolution: False, hasVideoSolution: False, 1669: questionNo: 1669, acRate: 81.63128407877232, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Merge In Between Linked Lists, slug: merge-in-between-linked-lists, url: https://leetcode.com/problems/merge-in-between-linked-lists, topics: ['Linked List'], hasSolution: True, hasVideoSolution: False, 1670: questionNo: 1670, acRate: 56.48390589624963, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Design Front Middle Back Queue, slug: design-front-middle-back-queue, url: https://leetcode.com/problems/design-front-middle-back-queue, topics: ['Array', 'Linked List', 'Design', 'Queue', 'Data Stream'], hasSolution: False, hasVideoSolution: False, 1671: questionNo: 1671, acRate: 41.86293936935619, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Minimum Number of Removals to Make Mountain Array, slug: minimum-number-of-removals-to-make-mountain-array, url: https://leetcode.com/problems/minimum-number-of-removals-to-make-mountain-array, topics: ['Array', 'Binary Search', 'Dynamic Programming', 'Greedy'], hasSolution: False, hasVideoSolution: False, 1672: questionNo: 1672, acRate: 88.1269904361643, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Richest Customer Wealth, slug: richest-customer-wealth, url: https://leetcode.com/problems/richest-customer-wealth, topics: ['Array', 'Matrix'], hasSolution: True, hasVideoSolution: True, 1673: questionNo: 1673, acRate: 50.52693345851426, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Find the Most Competitive Subsequence, slug: find-the-most-competitive-subsequence, url: https://leetcode.com/problems/find-the-most-competitive-subsequence, topics: ['Array', 'Stack', 'Greedy', 'Monotonic Stack'], hasSolution: True, hasVideoSolution: False, 1674: questionNo: 1674, acRate: 39.96488918147904, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Moves to Make Array Complementary, slug: minimum-moves-to-make-array-complementary, url: https://leetcode.com/problems/minimum-moves-to-make-array-complementary, topics: ['Array', 'Hash Table', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 1675: questionNo: 1675, acRate: 54.02874129979992, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Minimize Deviation in Array, slug: minimize-deviation-in-array, url: https://leetcode.com/problems/minimize-deviation-in-array, topics: ['Array', 'Greedy', 'Heap (Priority Queue)', 'Ordered Set'], hasSolution: True, hasVideoSolution: False, 1676: questionNo: 1676, acRate: 78.5443718176853, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Lowest Common Ancestor of a Binary Tree IV, slug: lowest-common-ancestor-of-a-binary-tree-iv, url: https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree-iv, topics: ['Hash Table', 'Tree', 'Depth-First Search', 'Binary Tree'], hasSolution: False, hasVideoSolution: False, 1677: questionNo: 1677, acRate: 38.1453345440854, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Product's Worth Over Invoices, slug: products-worth-over-invoices, url: https://leetcode.com/problems/products-worth-over-invoices, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 1678: questionNo: 1678, acRate: 87.30369967099847, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Goal Parser Interpretation, slug: goal-parser-interpretation, url: https://leetcode.com/problems/goal-parser-interpretation, topics: ['String'], hasSolution: False, hasVideoSolution: False, 1679: questionNo: 1679, acRate: 55.13454844475726, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Max Number of K-Sum Pairs, slug: max-number-of-k-sum-pairs, url: https://leetcode.com/problems/max-number-of-k-sum-pairs, topics: ['Array', 'Hash Table', 'Two Pointers', 'Sorting'], hasSolution: True, hasVideoSolution: False, 1680: questionNo: 1680, acRate: 57.1045677614194, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Concatenation of Consecutive Binary Numbers, slug: concatenation-of-consecutive-binary-numbers, url: https://leetcode.com/problems/concatenation-of-consecutive-binary-numbers, topics: ['Math', 'Bit Manipulation', 'Simulation'], hasSolution: True, hasVideoSolution: False, 1681: questionNo: 1681, acRate: 38.874750045446284, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Minimum Incompatibility, slug: minimum-incompatibility, url: https://leetcode.com/problems/minimum-incompatibility, topics: ['Array', 'Dynamic Programming', 'Bit Manipulation', 'Bitmask'], hasSolution: False, hasVideoSolution: False, 1682: questionNo: 1682, acRate: 50.04073504118766, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Longest Palindromic Subsequence II, slug: longest-palindromic-subsequence-ii, url: https://leetcode.com/problems/longest-palindromic-subsequence-ii, topics: ['String', 'Dynamic Programming'], hasSolution: False, hasVideoSolution: False, 1683: questionNo: 1683, acRate: 85.2821609365193, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Invalid Tweets, slug: invalid-tweets, url: https://leetcode.com/problems/invalid-tweets, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 1684: questionNo: 1684, acRate: 83.38436148674545, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Count the Number of Consistent Strings, slug: count-the-number-of-consistent-strings, url: https://leetcode.com/problems/count-the-number-of-consistent-strings, topics: ['Array', 'Hash Table', 'String', 'Bit Manipulation'], hasSolution: False, hasVideoSolution: False, 1685: questionNo: 1685, acRate: 68.44445272380668, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Sum of Absolute Differences in a Sorted Array, slug: sum-of-absolute-differences-in-a-sorted-array, url: https://leetcode.com/problems/sum-of-absolute-differences-in-a-sorted-array, topics: ['Array', 'Math', 'Prefix Sum'], hasSolution: True, hasVideoSolution: False, 1686: questionNo: 1686, acRate: 57.28629043630312, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Stone Game VI, slug: stone-game-vi, url: https://leetcode.com/problems/stone-game-vi, topics: ['Array', 'Math', 'Greedy', 'Sorting', 'Heap (Priority Queue)', 'Game Theory'], hasSolution: False, hasVideoSolution: False, 1687: questionNo: 1687, acRate: 38.928678904604276, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Delivering Boxes from Storage to Ports, slug: delivering-boxes-from-storage-to-ports, url: https://leetcode.com/problems/delivering-boxes-from-storage-to-ports, topics: ['Array', 'Dynamic Programming', 'Segment Tree', 'Queue', 'Heap (Priority Queue)', 'Prefix Sum', 'Monotonic Queue'], hasSolution: False, hasVideoSolution: False, 1688: questionNo: 1688, acRate: 85.73089861974444, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Count of Matches in Tournament, slug: count-of-matches-in-tournament, url: https://leetcode.com/problems/count-of-matches-in-tournament, topics: ['Math', 'Simulation'], hasSolution: True, hasVideoSolution: False, 1689: questionNo: 1689, acRate: 88.72827753641707, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Partitioning Into Minimum Number Of Deci-Binary Numbers, slug: partitioning-into-minimum-number-of-deci-binary-numbers, url: https://leetcode.com/problems/partitioning-into-minimum-number-of-deci-binary-numbers, topics: ['String', 'Greedy'], hasSolution: True, hasVideoSolution: False, 1690: questionNo: 1690, acRate: 58.070815725445, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Stone Game VII, slug: stone-game-vii, url: https://leetcode.com/problems/stone-game-vii, topics: ['Array', 'Math', 'Dynamic Programming', 'Game Theory'], hasSolution: True, hasVideoSolution: False, 1691: questionNo: 1691, acRate: 57.760141093474424, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Maximum Height by Stacking Cuboids , slug: maximum-height-by-stacking-cuboids, url: https://leetcode.com/problems/maximum-height-by-stacking-cuboids, topics: ['Array', 'Dynamic Programming', 'Sorting'], hasSolution: False, hasVideoSolution: False, 1692: questionNo: 1692, acRate: 62.69765213224725, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Count Ways to Distribute Candies, slug: count-ways-to-distribute-candies, url: https://leetcode.com/problems/count-ways-to-distribute-candies, topics: ['Dynamic Programming'], hasSolution: False, hasVideoSolution: False, 1693: questionNo: 1693, acRate: 86.5959982857449, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Daily Leads and Partners, slug: daily-leads-and-partners, url: https://leetcode.com/problems/daily-leads-and-partners, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 1694: questionNo: 1694, acRate: 65.8648666846216, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Reformat Phone Number, slug: reformat-phone-number, url: https://leetcode.com/problems/reformat-phone-number, topics: ['String'], hasSolution: False, hasVideoSolution: False, 1695: questionNo: 1695, acRate: 58.372858085337796, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum Erasure Value, slug: maximum-erasure-value, url: https://leetcode.com/problems/maximum-erasure-value, topics: ['Array', 'Hash Table', 'Sliding Window'], hasSolution: True, hasVideoSolution: False, 1696: questionNo: 1696, acRate: 45.666366596276326, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Jump Game VI, slug: jump-game-vi, url: https://leetcode.com/problems/jump-game-vi, topics: ['Array', 'Dynamic Programming', 'Queue', 'Heap (Priority Queue)', 'Monotonic Queue'], hasSolution: True, hasVideoSolution: False, 1697: questionNo: 1697, acRate: 62.532221195467145, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Checking Existence of Edge Length Limited Paths, slug: checking-existence-of-edge-length-limited-paths, url: https://leetcode.com/problems/checking-existence-of-edge-length-limited-paths, topics: ['Array', 'Two Pointers', 'Union Find', 'Graph', 'Sorting'], hasSolution: True, hasVideoSolution: False, 1698: questionNo: 1698, acRate: 64.12891986062718, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Number of Distinct Substrings in a String, slug: number-of-distinct-substrings-in-a-string, url: https://leetcode.com/problems/number-of-distinct-substrings-in-a-string, topics: ['String', 'Trie', 'Rolling Hash', 'Suffix Array', 'Hash Function'], hasSolution: False, hasVideoSolution: False, 1699: questionNo: 1699, acRate: 81.16438356164383, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Number of Calls Between Two Persons, slug: number-of-calls-between-two-persons, url: https://leetcode.com/problems/number-of-calls-between-two-persons, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 1700: questionNo: 1700, acRate: 78.28396074309933, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Number of Students Unable to Eat Lunch, slug: number-of-students-unable-to-eat-lunch, url: https://leetcode.com/problems/number-of-students-unable-to-eat-lunch, topics: ['Array', 'Stack', 'Queue', 'Simulation'], hasSolution: True, hasVideoSolution: False, 1701: questionNo: 1701, acRate: 73.06344324440312, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Average Waiting Time, slug: average-waiting-time, url: https://leetcode.com/problems/average-waiting-time, topics: ['Array', 'Simulation'], hasSolution: True, hasVideoSolution: False, 1702: questionNo: 1702, acRate: 46.91750882959751, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum Binary String After Change, slug: maximum-binary-string-after-change, url: https://leetcode.com/problems/maximum-binary-string-after-change, topics: ['String', 'Greedy'], hasSolution: False, hasVideoSolution: False, 1703: questionNo: 1703, acRate: 42.71715598769418, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Minimum Adjacent Swaps for K Consecutive Ones, slug: minimum-adjacent-swaps-for-k-consecutive-ones, url: https://leetcode.com/problems/minimum-adjacent-swaps-for-k-consecutive-ones, topics: ['Array', 'Greedy', 'Sliding Window', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 1704: questionNo: 1704, acRate: 78.6603670041694, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Determine if String Halves Are Alike, slug: determine-if-string-halves-are-alike, url: https://leetcode.com/problems/determine-if-string-halves-are-alike, topics: ['String', 'Counting'], hasSolution: True, hasVideoSolution: False, 1705: questionNo: 1705, acRate: 39.25899835631143, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum Number of Eaten Apples, slug: maximum-number-of-eaten-apples, url: https://leetcode.com/problems/maximum-number-of-eaten-apples, topics: ['Array', 'Greedy', 'Heap (Priority Queue)'], hasSolution: False, hasVideoSolution: False, 1706: questionNo: 1706, acRate: 71.82743443975794, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Where Will the Ball Fall, slug: where-will-the-ball-fall, url: https://leetcode.com/problems/where-will-the-ball-fall, topics: ['Array', 'Matrix', 'Simulation'], hasSolution: True, hasVideoSolution: False, 1707: questionNo: 1707, acRate: 51.00491568664053, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Maximum XOR With an Element From Array, slug: maximum-xor-with-an-element-from-array, url: https://leetcode.com/problems/maximum-xor-with-an-element-from-array, topics: ['Array', 'Bit Manipulation', 'Trie'], hasSolution: False, hasVideoSolution: False, 1708: questionNo: 1708, acRate: 64.8826924518402, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Largest Subarray Length K, slug: largest-subarray-length-k, url: https://leetcode.com/problems/largest-subarray-length-k, topics: ['Array', 'Greedy'], hasSolution: False, hasVideoSolution: False, 1709: questionNo: 1709, acRate: 70.47333055836356, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Biggest Window Between Visits, slug: biggest-window-between-visits, url: https://leetcode.com/problems/biggest-window-between-visits, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 1710: questionNo: 1710, acRate: 73.72209193692922, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Maximum Units on a Truck, slug: maximum-units-on-a-truck, url: https://leetcode.com/problems/maximum-units-on-a-truck, topics: ['Array', 'Greedy', 'Sorting'], hasSolution: True, hasVideoSolution: False, 1711: questionNo: 1711, acRate: 30.385168439102785, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Count Good Meals, slug: count-good-meals, url: https://leetcode.com/problems/count-good-meals, topics: ['Array', 'Hash Table'], hasSolution: False, hasVideoSolution: False, 1712: questionNo: 1712, acRate: 33.002441819903325, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Ways to Split Array Into Three Subarrays, slug: ways-to-split-array-into-three-subarrays, url: https://leetcode.com/problems/ways-to-split-array-into-three-subarrays, topics: ['Array', 'Two Pointers', 'Binary Search', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 1713: questionNo: 1713, acRate: 47.751080649558006, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Minimum Operations to Make a Subsequence, slug: minimum-operations-to-make-a-subsequence, url: https://leetcode.com/problems/minimum-operations-to-make-a-subsequence, topics: ['Array', 'Hash Table', 'Binary Search', 'Greedy'], hasSolution: False, hasVideoSolution: False, 1714: questionNo: 1714, acRate: 49.73526297211437, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Sum Of Special Evenly-Spaced Elements In Array, slug: sum-of-special-evenly-spaced-elements-in-array, url: https://leetcode.com/problems/sum-of-special-evenly-spaced-elements-in-array, topics: ['Array', 'Dynamic Programming'], hasSolution: False, hasVideoSolution: False, 1715: questionNo: 1715, acRate: 75.49697702539298, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Count Apples and Oranges, slug: count-apples-and-oranges, url: https://leetcode.com/problems/count-apples-and-oranges, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 1716: questionNo: 1716, acRate: 78.33263726337668, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Calculate Money in Leetcode Bank, slug: calculate-money-in-leetcode-bank, url: https://leetcode.com/problems/calculate-money-in-leetcode-bank, topics: ['Math'], hasSolution: True, hasVideoSolution: False, 1717: questionNo: 1717, acRate: 63.08732436924006, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum Score From Removing Substrings, slug: maximum-score-from-removing-substrings, url: https://leetcode.com/problems/maximum-score-from-removing-substrings, topics: ['String', 'Stack', 'Greedy'], hasSolution: True, hasVideoSolution: False, 1718: questionNo: 1718, acRate: 53.73965444906366, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Construct the Lexicographically Largest Valid Sequence, slug: construct-the-lexicographically-largest-valid-sequence, url: https://leetcode.com/problems/construct-the-lexicographically-largest-valid-sequence, topics: ['Array', 'Backtracking'], hasSolution: False, hasVideoSolution: False, 1719: questionNo: 1719, acRate: 44.48014018691589, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Number Of Ways To Reconstruct A Tree, slug: number-of-ways-to-reconstruct-a-tree, url: https://leetcode.com/problems/number-of-ways-to-reconstruct-a-tree, topics: ['Tree', 'Graph'], hasSolution: False, hasVideoSolution: False, 1720: questionNo: 1720, acRate: 86.46132868555469, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Decode XORed Array, slug: decode-xored-array, url: https://leetcode.com/problems/decode-xored-array, topics: ['Array', 'Bit Manipulation'], hasSolution: False, hasVideoSolution: False, 1721: questionNo: 1721, acRate: 68.00265529956822, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Swapping Nodes in a Linked List, slug: swapping-nodes-in-a-linked-list, url: https://leetcode.com/problems/swapping-nodes-in-a-linked-list, topics: ['Linked List', 'Two Pointers'], hasSolution: True, hasVideoSolution: False, 1722: questionNo: 1722, acRate: 48.841874398202634, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimize Hamming Distance After Swap Operations, slug: minimize-hamming-distance-after-swap-operations, url: https://leetcode.com/problems/minimize-hamming-distance-after-swap-operations, topics: ['Array', 'Depth-First Search', 'Union Find'], hasSolution: False, hasVideoSolution: False, 1723: questionNo: 1723, acRate: 42.450938696154076, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Find Minimum Time to Finish All Jobs, slug: find-minimum-time-to-finish-all-jobs, url: https://leetcode.com/problems/find-minimum-time-to-finish-all-jobs, topics: ['Array', 'Dynamic Programming', 'Backtracking', 'Bit Manipulation', 'Bitmask'], hasSolution: False, hasVideoSolution: False, 1724: questionNo: 1724, acRate: 51.38205867390199, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Checking Existence of Edge Length Limited Paths II, slug: checking-existence-of-edge-length-limited-paths-ii, url: https://leetcode.com/problems/checking-existence-of-edge-length-limited-paths-ii, topics: ['Union Find', 'Graph', 'Minimum Spanning Tree'], hasSolution: False, hasVideoSolution: False, 1725: questionNo: 1725, acRate: 78.78053024206703, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Number Of Rectangles That Can Form The Largest Square, slug: number-of-rectangles-that-can-form-the-largest-square, url: https://leetcode.com/problems/number-of-rectangles-that-can-form-the-largest-square, topics: ['Array'], hasSolution: False, hasVideoSolution: False, 1726: questionNo: 1726, acRate: 61.18245281392743, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Tuple with Same Product, slug: tuple-with-same-product, url: https://leetcode.com/problems/tuple-with-same-product, topics: ['Array', 'Hash Table', 'Counting'], hasSolution: False, hasVideoSolution: False, 1727: questionNo: 1727, acRate: 75.37033379419317, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Largest Submatrix With Rearrangements, slug: largest-submatrix-with-rearrangements, url: https://leetcode.com/problems/largest-submatrix-with-rearrangements, topics: ['Array', 'Greedy', 'Sorting', 'Matrix'], hasSolution: True, hasVideoSolution: False, 1728: questionNo: 1728, acRate: 40.002197319270486, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Cat and Mouse II, slug: cat-and-mouse-ii, url: https://leetcode.com/problems/cat-and-mouse-ii, topics: ['Array', 'Math', 'Dynamic Programming', 'Graph', 'Topological Sort', 'Memoization', 'Matrix', 'Game Theory'], hasSolution: False, hasVideoSolution: False, 1729: questionNo: 1729, acRate: 69.12131441052443, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Find Followers Count, slug: find-followers-count, url: https://leetcode.com/problems/find-followers-count, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 1730: questionNo: 1730, acRate: 54.971668415529905, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Shortest Path to Get Food, slug: shortest-path-to-get-food, url: https://leetcode.com/problems/shortest-path-to-get-food, topics: ['Array', 'Breadth-First Search', 'Matrix'], hasSolution: False, hasVideoSolution: False, 1731: questionNo: 1731, acRate: 48.41221019247594, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: The Number of Employees Which Report to Each Employee, slug: the-number-of-employees-which-report-to-each-employee, url: https://leetcode.com/problems/the-number-of-employees-which-report-to-each-employee, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 1732: questionNo: 1732, acRate: 83.35009920358803, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Find the Highest Altitude, slug: find-the-highest-altitude, url: https://leetcode.com/problems/find-the-highest-altitude, topics: ['Array', 'Prefix Sum'], hasSolution: True, hasVideoSolution: False, 1733: questionNo: 1733, acRate: 42.67976775346137, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Number of People to Teach, slug: minimum-number-of-people-to-teach, url: https://leetcode.com/problems/minimum-number-of-people-to-teach, topics: ['Array', 'Hash Table', 'Greedy'], hasSolution: False, hasVideoSolution: False, 1734: questionNo: 1734, acRate: 64.85144383241528, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Decode XORed Permutation, slug: decode-xored-permutation, url: https://leetcode.com/problems/decode-xored-permutation, topics: ['Array', 'Bit Manipulation'], hasSolution: False, hasVideoSolution: False, 1735: questionNo: 1735, acRate: 51.84555196461983, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Count Ways to Make Array With Product, slug: count-ways-to-make-array-with-product, url: https://leetcode.com/problems/count-ways-to-make-array-with-product, topics: ['Array', 'Math', 'Dynamic Programming', 'Combinatorics', 'Number Theory'], hasSolution: False, hasVideoSolution: False, 1736: questionNo: 1736, acRate: 42.74698850893621, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Latest Time by Replacing Hidden Digits, slug: latest-time-by-replacing-hidden-digits, url: https://leetcode.com/problems/latest-time-by-replacing-hidden-digits, topics: ['String', 'Greedy'], hasSolution: False, hasVideoSolution: False, 1737: questionNo: 1737, acRate: 36.719559843712624, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Change Minimum Characters to Satisfy One of Three Conditions, slug: change-minimum-characters-to-satisfy-one-of-three-conditions, url: https://leetcode.com/problems/change-minimum-characters-to-satisfy-one-of-three-conditions, topics: ['Hash Table', 'String', 'Counting', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 1738: questionNo: 1738, acRate: 61.83283255941, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Find Kth Largest XOR Coordinate Value, slug: find-kth-largest-xor-coordinate-value, url: https://leetcode.com/problems/find-kth-largest-xor-coordinate-value, topics: ['Array', 'Divide and Conquer', 'Bit Manipulation', 'Sorting', 'Heap (Priority Queue)', 'Matrix', 'Prefix Sum', 'Quickselect'], hasSolution: False, hasVideoSolution: False, 1739: questionNo: 1739, acRate: 51.923614997202016, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Building Boxes, slug: building-boxes, url: https://leetcode.com/problems/building-boxes, topics: ['Math', 'Binary Search', 'Greedy'], hasSolution: False, hasVideoSolution: False, 1740: questionNo: 1740, acRate: 73.43929254302103, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Find Distance in a Binary Tree, slug: find-distance-in-a-binary-tree, url: https://leetcode.com/problems/find-distance-in-a-binary-tree, topics: ['Hash Table', 'Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 1741: questionNo: 1741, acRate: 86.88755269030499, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Find Total Time Spent by Each Employee, slug: find-total-time-spent-by-each-employee, url: https://leetcode.com/problems/find-total-time-spent-by-each-employee, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 1742: questionNo: 1742, acRate: 73.51817193576224, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Maximum Number of Balls in a Box, slug: maximum-number-of-balls-in-a-box, url: https://leetcode.com/problems/maximum-number-of-balls-in-a-box, topics: ['Hash Table', 'Math', 'Counting'], hasSolution: False, hasVideoSolution: False, 1743: questionNo: 1743, acRate: 74.75383463234682, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Restore the Array From Adjacent Pairs, slug: restore-the-array-from-adjacent-pairs, url: https://leetcode.com/problems/restore-the-array-from-adjacent-pairs, topics: ['Array', 'Hash Table'], hasSolution: True, hasVideoSolution: False, 1744: questionNo: 1744, acRate: 34.261336704060675, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Can You Eat Your Favorite Candy on Your Favorite Day?, slug: can-you-eat-your-favorite-candy-on-your-favorite-day, url: https://leetcode.com/problems/can-you-eat-your-favorite-candy-on-your-favorite-day, topics: ['Array', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 1745: questionNo: 1745, acRate: 44.35035631523008, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Palindrome Partitioning IV, slug: palindrome-partitioning-iv, url: https://leetcode.com/problems/palindrome-partitioning-iv, topics: ['String', 'Dynamic Programming'], hasSolution: False, hasVideoSolution: False, 1746: questionNo: 1746, acRate: 62.27885853724666, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Maximum Subarray Sum After One Operation, slug: maximum-subarray-sum-after-one-operation, url: https://leetcode.com/problems/maximum-subarray-sum-after-one-operation, topics: ['Array', 'Dynamic Programming'], hasSolution: False, hasVideoSolution: False, 1747: questionNo: 1747, acRate: 63.49878934624697, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Leetflex Banned Accounts, slug: leetflex-banned-accounts, url: https://leetcode.com/problems/leetflex-banned-accounts, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 1748: questionNo: 1748, acRate: 77.95313479485436, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Sum of Unique Elements, slug: sum-of-unique-elements, url: https://leetcode.com/problems/sum-of-unique-elements, topics: ['Array', 'Hash Table', 'Counting'], hasSolution: False, hasVideoSolution: False, 1749: questionNo: 1749, acRate: 60.21206352983166, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum Absolute Sum of Any Subarray, slug: maximum-absolute-sum-of-any-subarray, url: https://leetcode.com/problems/maximum-absolute-sum-of-any-subarray, topics: ['Array', 'Dynamic Programming'], hasSolution: False, hasVideoSolution: False, 1750: questionNo: 1750, acRate: 55.98289280243448, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Length of String After Deleting Similar Ends, slug: minimum-length-of-string-after-deleting-similar-ends, url: https://leetcode.com/problems/minimum-length-of-string-after-deleting-similar-ends, topics: ['Two Pointers', 'String'], hasSolution: True, hasVideoSolution: False, 1751: questionNo: 1751, acRate: 61.54434810925225, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Maximum Number of Events That Can Be Attended II, slug: maximum-number-of-events-that-can-be-attended-ii, url: https://leetcode.com/problems/maximum-number-of-events-that-can-be-attended-ii, topics: ['Array', 'Binary Search', 'Dynamic Programming', 'Sorting'], hasSolution: True, hasVideoSolution: False, 1752: questionNo: 1752, acRate: 51.225743811323454, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Check if Array Is Sorted and Rotated, slug: check-if-array-is-sorted-and-rotated, url: https://leetcode.com/problems/check-if-array-is-sorted-and-rotated, topics: ['Array'], hasSolution: False, hasVideoSolution: False, 1753: questionNo: 1753, acRate: 67.34465086483024, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum Score From Removing Stones, slug: maximum-score-from-removing-stones, url: https://leetcode.com/problems/maximum-score-from-removing-stones, topics: ['Math', 'Greedy', 'Heap (Priority Queue)'], hasSolution: False, hasVideoSolution: False, 1754: questionNo: 1754, acRate: 48.454292709241045, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Largest Merge Of Two Strings, slug: largest-merge-of-two-strings, url: https://leetcode.com/problems/largest-merge-of-two-strings, topics: ['Two Pointers', 'String', 'Greedy'], hasSolution: False, hasVideoSolution: False, 1755: questionNo: 1755, acRate: 39.58755695071175, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Closest Subsequence Sum, slug: closest-subsequence-sum, url: https://leetcode.com/problems/closest-subsequence-sum, topics: ['Array', 'Two Pointers', 'Dynamic Programming', 'Bit Manipulation', 'Bitmask'], hasSolution: False, hasVideoSolution: False, 1756: questionNo: 1756, acRate: 75.70729171179758, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Design Most Recently Used Queue, slug: design-most-recently-used-queue, url: https://leetcode.com/problems/design-most-recently-used-queue, topics: ['Array', 'Hash Table', 'Stack', 'Design', 'Binary Indexed Tree', 'Ordered Set'], hasSolution: False, hasVideoSolution: False, 1757: questionNo: 1757, acRate: 89.17165593864715, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Recyclable and Low Fat Products, slug: recyclable-and-low-fat-products, url: https://leetcode.com/problems/recyclable-and-low-fat-products, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 1758: questionNo: 1758, acRate: 63.7590357263726, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Minimum Changes To Make Alternating Binary String, slug: minimum-changes-to-make-alternating-binary-string, url: https://leetcode.com/problems/minimum-changes-to-make-alternating-binary-string, topics: ['String'], hasSolution: True, hasVideoSolution: False, 1759: questionNo: 1759, acRate: 57.67505133470225, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Count Number of Homogenous Substrings, slug: count-number-of-homogenous-substrings, url: https://leetcode.com/problems/count-number-of-homogenous-substrings, topics: ['Math', 'String'], hasSolution: True, hasVideoSolution: False, 1760: questionNo: 1760, acRate: 60.30920083015009, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Limit of Balls in a Bag, slug: minimum-limit-of-balls-in-a-bag, url: https://leetcode.com/problems/minimum-limit-of-balls-in-a-bag, topics: ['Array', 'Binary Search'], hasSolution: False, hasVideoSolution: False, 1761: questionNo: 1761, acRate: 42.44197743109534, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Minimum Degree of a Connected Trio in a Graph, slug: minimum-degree-of-a-connected-trio-in-a-graph, url: https://leetcode.com/problems/minimum-degree-of-a-connected-trio-in-a-graph, topics: ['Graph'], hasSolution: False, hasVideoSolution: False, 1762: questionNo: 1762, acRate: 79.84932141203291, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Buildings With an Ocean View, slug: buildings-with-an-ocean-view, url: https://leetcode.com/problems/buildings-with-an-ocean-view, topics: ['Array', 'Stack', 'Monotonic Stack'], hasSolution: True, hasVideoSolution: False, 1763: questionNo: 1763, acRate: 60.61296534017971, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Longest Nice Substring, slug: longest-nice-substring, url: https://leetcode.com/problems/longest-nice-substring, topics: ['Hash Table', 'String', 'Divide and Conquer', 'Bit Manipulation', 'Sliding Window'], hasSolution: False, hasVideoSolution: False, 1764: questionNo: 1764, acRate: 53.6230902130831, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Form Array by Concatenating Subarrays of Another Array, slug: form-array-by-concatenating-subarrays-of-another-array, url: https://leetcode.com/problems/form-array-by-concatenating-subarrays-of-another-array, topics: ['Array', 'Two Pointers', 'Greedy', 'String Matching'], hasSolution: False, hasVideoSolution: False, 1765: questionNo: 1765, acRate: 62.77031236095043, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Map of Highest Peak, slug: map-of-highest-peak, url: https://leetcode.com/problems/map-of-highest-peak, topics: ['Array', 'Breadth-First Search', 'Matrix'], hasSolution: False, hasVideoSolution: False, 1766: questionNo: 1766, acRate: 41.241648337967376, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Tree of Coprimes, slug: tree-of-coprimes, url: https://leetcode.com/problems/tree-of-coprimes, topics: ['Array', 'Math', 'Tree', 'Depth-First Search', 'Number Theory'], hasSolution: False, hasVideoSolution: False, 1767: questionNo: 1767, acRate: 77.25976956883241, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Find the Subtasks That Did Not Execute, slug: find-the-subtasks-that-did-not-execute, url: https://leetcode.com/problems/find-the-subtasks-that-did-not-execute, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 1768: questionNo: 1768, acRate: 80.2584211215301, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Merge Strings Alternately, slug: merge-strings-alternately, url: https://leetcode.com/problems/merge-strings-alternately, topics: ['Two Pointers', 'String'], hasSolution: True, hasVideoSolution: True, 1769: questionNo: 1769, acRate: 85.94647350564676, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Number of Operations to Move All Balls to Each Box, slug: minimum-number-of-operations-to-move-all-balls-to-each-box, url: https://leetcode.com/problems/minimum-number-of-operations-to-move-all-balls-to-each-box, topics: ['Array', 'String'], hasSolution: False, hasVideoSolution: False, 1770: questionNo: 1770, acRate: 40.51284990650054, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Maximum Score from Performing Multiplication Operations, slug: maximum-score-from-performing-multiplication-operations, url: https://leetcode.com/problems/maximum-score-from-performing-multiplication-operations, topics: ['Array', 'Dynamic Programming'], hasSolution: True, hasVideoSolution: False, 1771: questionNo: 1771, acRate: 36.36130274346222, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Maximize Palindrome Length From Subsequences, slug: maximize-palindrome-length-from-subsequences, url: https://leetcode.com/problems/maximize-palindrome-length-from-subsequences, topics: ['String', 'Dynamic Programming'], hasSolution: False, hasVideoSolution: False, 1772: questionNo: 1772, acRate: 65.7194938880549, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Sort Features by Popularity, slug: sort-features-by-popularity, url: https://leetcode.com/problems/sort-features-by-popularity, topics: ['Array', 'Hash Table', 'String', 'Sorting'], hasSolution: False, hasVideoSolution: False, 1773: questionNo: 1773, acRate: 84.99341184981232, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Count Items Matching a Rule, slug: count-items-matching-a-rule, url: https://leetcode.com/problems/count-items-matching-a-rule, topics: ['Array', 'String'], hasSolution: False, hasVideoSolution: False, 1774: questionNo: 1774, acRate: 47.58795904226653, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Closest Dessert Cost, slug: closest-dessert-cost, url: https://leetcode.com/problems/closest-dessert-cost, topics: ['Array', 'Dynamic Programming', 'Backtracking'], hasSolution: False, hasVideoSolution: False, 1775: questionNo: 1775, acRate: 53.70490737731557, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Equal Sum Arrays With Minimum Number of Operations, slug: equal-sum-arrays-with-minimum-number-of-operations, url: https://leetcode.com/problems/equal-sum-arrays-with-minimum-number-of-operations, topics: ['Array', 'Hash Table', 'Greedy', 'Counting'], hasSolution: False, hasVideoSolution: False, 1776: questionNo: 1776, acRate: 55.34280158931439, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Car Fleet II, slug: car-fleet-ii, url: https://leetcode.com/problems/car-fleet-ii, topics: ['Array', 'Math', 'Stack', 'Heap (Priority Queue)', 'Monotonic Stack'], hasSolution: False, hasVideoSolution: False, 1777: questionNo: 1777, acRate: 82.28079228357083, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Product's Price for Each Store, slug: products-price-for-each-store, url: https://leetcode.com/problems/products-price-for-each-store, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 1778: questionNo: 1778, acRate: 39.910035675507984, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Shortest Path in a Hidden Grid, slug: shortest-path-in-a-hidden-grid, url: https://leetcode.com/problems/shortest-path-in-a-hidden-grid, topics: ['Depth-First Search', 'Breadth-First Search', 'Graph', 'Interactive'], hasSolution: False, hasVideoSolution: False, 1779: questionNo: 1779, acRate: 68.60952110912237, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Find Nearest Point That Has the Same X or Y Coordinate, slug: find-nearest-point-that-has-the-same-x-or-y-coordinate, url: https://leetcode.com/problems/find-nearest-point-that-has-the-same-x-or-y-coordinate, topics: ['Array'], hasSolution: False, hasVideoSolution: False, 1780: questionNo: 1780, acRate: 67.90098135117226, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Check if Number is a Sum of Powers of Three, slug: check-if-number-is-a-sum-of-powers-of-three, url: https://leetcode.com/problems/check-if-number-is-a-sum-of-powers-of-three, topics: ['Math'], hasSolution: False, hasVideoSolution: False, 1781: questionNo: 1781, acRate: 66.67079333280812, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Sum of Beauty of All Substrings, slug: sum-of-beauty-of-all-substrings, url: https://leetcode.com/problems/sum-of-beauty-of-all-substrings, topics: ['Hash Table', 'String', 'Counting'], hasSolution: False, hasVideoSolution: False, 1782: questionNo: 1782, acRate: 40.216887033170956, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Count Pairs Of Nodes, slug: count-pairs-of-nodes, url: https://leetcode.com/problems/count-pairs-of-nodes, topics: ['Array', 'Two Pointers', 'Binary Search', 'Graph', 'Sorting'], hasSolution: False, hasVideoSolution: False, 1783: questionNo: 1783, acRate: 83.54281610133525, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Grand Slam Titles, slug: grand-slam-titles, url: https://leetcode.com/problems/grand-slam-titles, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 1784: questionNo: 1784, acRate: 39.157121283040865, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Check if Binary String Has at Most One Segment of Ones, slug: check-if-binary-string-has-at-most-one-segment-of-ones, url: https://leetcode.com/problems/check-if-binary-string-has-at-most-one-segment-of-ones, topics: ['String'], hasSolution: False, hasVideoSolution: False, 1785: questionNo: 1785, acRate: 43.52058284895294, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Elements to Add to Form a Given Sum, slug: minimum-elements-to-add-to-form-a-given-sum, url: https://leetcode.com/problems/minimum-elements-to-add-to-form-a-given-sum, topics: ['Array', 'Greedy'], hasSolution: False, hasVideoSolution: False, 1786: questionNo: 1786, acRate: 39.21568627450981, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Number of Restricted Paths From First to Last Node, slug: number-of-restricted-paths-from-first-to-last-node, url: https://leetcode.com/problems/number-of-restricted-paths-from-first-to-last-node, topics: ['Dynamic Programming', 'Graph', 'Topological Sort', 'Heap (Priority Queue)', 'Shortest Path'], hasSolution: False, hasVideoSolution: False, 1787: questionNo: 1787, acRate: 39.75600739371534, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Make the XOR of All Segments Equal to Zero, slug: make-the-xor-of-all-segments-equal-to-zero, url: https://leetcode.com/problems/make-the-xor-of-all-segments-equal-to-zero, topics: ['Array', 'Dynamic Programming', 'Bit Manipulation'], hasSolution: False, hasVideoSolution: False, 1788: questionNo: 1788, acRate: 66.96243714877255, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Maximize the Beauty of the Garden, slug: maximize-the-beauty-of-the-garden, url: https://leetcode.com/problems/maximize-the-beauty-of-the-garden, topics: ['Array', 'Hash Table', 'Greedy', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 1789: questionNo: 1789, acRate: 64.35653080012544, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Primary Department for Each Employee, slug: primary-department-for-each-employee, url: https://leetcode.com/problems/primary-department-for-each-employee, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 1790: questionNo: 1790, acRate: 45.7212976581996, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Check if One String Swap Can Make Strings Equal, slug: check-if-one-string-swap-can-make-strings-equal, url: https://leetcode.com/problems/check-if-one-string-swap-can-make-strings-equal, topics: ['Hash Table', 'String', 'Counting'], hasSolution: False, hasVideoSolution: False, 1791: questionNo: 1791, acRate: 86.67419551510443, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Find Center of Star Graph, slug: find-center-of-star-graph, url: https://leetcode.com/problems/find-center-of-star-graph, topics: ['Graph'], hasSolution: True, hasVideoSolution: False, 1792: questionNo: 1792, acRate: 53.98054493539176, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum Average Pass Ratio, slug: maximum-average-pass-ratio, url: https://leetcode.com/problems/maximum-average-pass-ratio, topics: ['Array', 'Greedy', 'Heap (Priority Queue)'], hasSolution: False, hasVideoSolution: False, 1793: questionNo: 1793, acRate: 64.3231287559903, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Maximum Score of a Good Subarray, slug: maximum-score-of-a-good-subarray, url: https://leetcode.com/problems/maximum-score-of-a-good-subarray, topics: ['Array', 'Two Pointers', 'Binary Search', 'Stack', 'Monotonic Stack'], hasSolution: True, hasVideoSolution: False, 1794: questionNo: 1794, acRate: 65.294698715838, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Count Pairs of Equal Substrings With Minimum Difference, slug: count-pairs-of-equal-substrings-with-minimum-difference, url: https://leetcode.com/problems/count-pairs-of-equal-substrings-with-minimum-difference, topics: ['Hash Table', 'String', 'Greedy'], hasSolution: False, hasVideoSolution: False, 1795: questionNo: 1795, acRate: 85.3100757813551, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Rearrange Products Table, slug: rearrange-products-table, url: https://leetcode.com/problems/rearrange-products-table, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 1796: questionNo: 1796, acRate: 50.51480326398086, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Second Largest Digit in a String, slug: second-largest-digit-in-a-string, url: https://leetcode.com/problems/second-largest-digit-in-a-string, topics: ['Hash Table', 'String'], hasSolution: False, hasVideoSolution: False, 1797: questionNo: 1797, acRate: 57.52421716602838, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Design Authentication Manager, slug: design-authentication-manager, url: https://leetcode.com/problems/design-authentication-manager, topics: ['Hash Table', 'Linked List', 'Design', 'Doubly-Linked List'], hasSolution: False, hasVideoSolution: False, 1798: questionNo: 1798, acRate: 60.926928281461436, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum Number of Consecutive Values You Can Make, slug: maximum-number-of-consecutive-values-you-can-make, url: https://leetcode.com/problems/maximum-number-of-consecutive-values-you-can-make, topics: ['Array', 'Greedy', 'Sorting'], hasSolution: False, hasVideoSolution: False, 1799: questionNo: 1799, acRate: 57.78946176065246, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Maximize Score After N Operations, slug: maximize-score-after-n-operations, url: https://leetcode.com/problems/maximize-score-after-n-operations, topics: ['Array', 'Math', 'Dynamic Programming', 'Backtracking', 'Bit Manipulation', 'Number Theory', 'Bitmask'], hasSolution: True, hasVideoSolution: False, 1800: questionNo: 1800, acRate: 62.0220537118044, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Maximum Ascending Subarray Sum, slug: maximum-ascending-subarray-sum, url: https://leetcode.com/problems/maximum-ascending-subarray-sum, topics: ['Array'], hasSolution: False, hasVideoSolution: False, 1801: questionNo: 1801, acRate: 49.75949189744548, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Number of Orders in the Backlog, slug: number-of-orders-in-the-backlog, url: https://leetcode.com/problems/number-of-orders-in-the-backlog, topics: ['Array', 'Heap (Priority Queue)', 'Simulation'], hasSolution: False, hasVideoSolution: False, 1802: questionNo: 1802, acRate: 39.19707950708617, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum Value at a Given Index in a Bounded Array, slug: maximum-value-at-a-given-index-in-a-bounded-array, url: https://leetcode.com/problems/maximum-value-at-a-given-index-in-a-bounded-array, topics: ['Binary Search', 'Greedy'], hasSolution: True, hasVideoSolution: False, 1803: questionNo: 1803, acRate: 48.02308949734368, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Count Pairs With XOR in a Range, slug: count-pairs-with-xor-in-a-range, url: https://leetcode.com/problems/count-pairs-with-xor-in-a-range, topics: ['Array', 'Bit Manipulation', 'Trie'], hasSolution: False, hasVideoSolution: False, 1804: questionNo: 1804, acRate: 61.47397603881316, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Implement Trie II (Prefix Tree), slug: implement-trie-ii-prefix-tree, url: https://leetcode.com/problems/implement-trie-ii-prefix-tree, topics: ['Hash Table', 'String', 'Design', 'Trie'], hasSolution: True, hasVideoSolution: False, 1805: questionNo: 1805, acRate: 38.017561975450505, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Number of Different Integers in a String, slug: number-of-different-integers-in-a-string, url: https://leetcode.com/problems/number-of-different-integers-in-a-string, topics: ['Hash Table', 'String'], hasSolution: False, hasVideoSolution: False, 1806: questionNo: 1806, acRate: 72.75247825591553, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Number of Operations to Reinitialize a Permutation, slug: minimum-number-of-operations-to-reinitialize-a-permutation, url: https://leetcode.com/problems/minimum-number-of-operations-to-reinitialize-a-permutation, topics: ['Array', 'Math', 'Simulation'], hasSolution: False, hasVideoSolution: False, 1807: questionNo: 1807, acRate: 66.97716540526554, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Evaluate the Bracket Pairs of a String, slug: evaluate-the-bracket-pairs-of-a-string, url: https://leetcode.com/problems/evaluate-the-bracket-pairs-of-a-string, topics: ['Array', 'Hash Table', 'String'], hasSolution: False, hasVideoSolution: False, 1808: questionNo: 1808, acRate: 33.113352233118, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Maximize Number of Nice Divisors, slug: maximize-number-of-nice-divisors, url: https://leetcode.com/problems/maximize-number-of-nice-divisors, topics: ['Math', 'Recursion'], hasSolution: False, hasVideoSolution: False, 1809: questionNo: 1809, acRate: 58.563049853372426, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Ad-Free Sessions, slug: ad-free-sessions, url: https://leetcode.com/problems/ad-free-sessions, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 1810: questionNo: 1810, acRate: 56.50782361308677, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Minimum Path Cost in a Hidden Grid, slug: minimum-path-cost-in-a-hidden-grid, url: https://leetcode.com/problems/minimum-path-cost-in-a-hidden-grid, topics: ['Depth-First Search', 'Breadth-First Search', 'Graph', 'Heap (Priority Queue)', 'Interactive'], hasSolution: False, hasVideoSolution: False, 1811: questionNo: 1811, acRate: 60.98789535337759, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Find Interview Candidates, slug: find-interview-candidates, url: https://leetcode.com/problems/find-interview-candidates, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 1812: questionNo: 1812, acRate: 78.5317877162485, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Determine Color of a Chessboard Square, slug: determine-color-of-a-chessboard-square, url: https://leetcode.com/problems/determine-color-of-a-chessboard-square, topics: ['Math', 'String'], hasSolution: False, hasVideoSolution: False, 1813: questionNo: 1813, acRate: 33.54714560615779, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Sentence Similarity III, slug: sentence-similarity-iii, url: https://leetcode.com/problems/sentence-similarity-iii, topics: ['Array', 'Two Pointers', 'String'], hasSolution: False, hasVideoSolution: False, 1814: questionNo: 1814, acRate: 48.76725706929462, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Count Nice Pairs in an Array, slug: count-nice-pairs-in-an-array, url: https://leetcode.com/problems/count-nice-pairs-in-an-array, topics: ['Array', 'Hash Table', 'Math', 'Counting'], hasSolution: True, hasVideoSolution: False, 1815: questionNo: 1815, acRate: 40.01681378730559, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Maximum Number of Groups Getting Fresh Donuts, slug: maximum-number-of-groups-getting-fresh-donuts, url: https://leetcode.com/problems/maximum-number-of-groups-getting-fresh-donuts, topics: ['Array', 'Dynamic Programming', 'Bit Manipulation', 'Memoization', 'Bitmask'], hasSolution: False, hasVideoSolution: False, 1816: questionNo: 1816, acRate: 85.32797377761399, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Truncate Sentence, slug: truncate-sentence, url: https://leetcode.com/problems/truncate-sentence, topics: ['Array', 'String'], hasSolution: False, hasVideoSolution: False, 1817: questionNo: 1817, acRate: 80.49750701577528, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Finding the Users Active Minutes, slug: finding-the-users-active-minutes, url: https://leetcode.com/problems/finding-the-users-active-minutes, topics: ['Array', 'Hash Table'], hasSolution: False, hasVideoSolution: False, 1818: questionNo: 1818, acRate: 30.726277196198566, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Absolute Sum Difference, slug: minimum-absolute-sum-difference, url: https://leetcode.com/problems/minimum-absolute-sum-difference, topics: ['Array', 'Binary Search', 'Sorting', 'Ordered Set'], hasSolution: False, hasVideoSolution: False, 1819: questionNo: 1819, acRate: 40.81227675618468, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Number of Different Subsequences GCDs, slug: number-of-different-subsequences-gcds, url: https://leetcode.com/problems/number-of-different-subsequences-gcds, topics: ['Array', 'Math', 'Counting', 'Number Theory'], hasSolution: False, hasVideoSolution: False, 1820: questionNo: 1820, acRate: 50.175589920522455, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Maximum Number of Accepted Invitations, slug: maximum-number-of-accepted-invitations, url: https://leetcode.com/problems/maximum-number-of-accepted-invitations, topics: ['Array', 'Backtracking', 'Matrix'], hasSolution: False, hasVideoSolution: False, 1821: questionNo: 1821, acRate: 87.88337617521745, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Find Customers With Positive Revenue this Year, slug: find-customers-with-positive-revenue-this-year, url: https://leetcode.com/problems/find-customers-with-positive-revenue-this-year, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 1822: questionNo: 1822, acRate: 65.30417656324936, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Sign of the Product of an Array, slug: sign-of-the-product-of-an-array, url: https://leetcode.com/problems/sign-of-the-product-of-an-array, topics: ['Array', 'Math'], hasSolution: True, hasVideoSolution: False, 1823: questionNo: 1823, acRate: 81.72381414554445, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Find the Winner of the Circular Game, slug: find-the-winner-of-the-circular-game, url: https://leetcode.com/problems/find-the-winner-of-the-circular-game, topics: ['Array', 'Math', 'Recursion', 'Queue', 'Simulation'], hasSolution: True, hasVideoSolution: False, 1824: questionNo: 1824, acRate: 50.118923911788485, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Sideway Jumps, slug: minimum-sideway-jumps, url: https://leetcode.com/problems/minimum-sideway-jumps, topics: ['Array', 'Dynamic Programming', 'Greedy'], hasSolution: False, hasVideoSolution: False, 1825: questionNo: 1825, acRate: 37.27342846124181, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Finding MK Average, slug: finding-mk-average, url: https://leetcode.com/problems/finding-mk-average, topics: ['Design', 'Queue', 'Heap (Priority Queue)', 'Data Stream', 'Ordered Set'], hasSolution: False, hasVideoSolution: False, 1826: questionNo: 1826, acRate: 49.934268185801926, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Faulty Sensor, slug: faulty-sensor, url: https://leetcode.com/problems/faulty-sensor, topics: ['Array', 'Two Pointers'], hasSolution: False, hasVideoSolution: False, 1827: questionNo: 1827, acRate: 79.97189657941223, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Minimum Operations to Make the Array Increasing, slug: minimum-operations-to-make-the-array-increasing, url: https://leetcode.com/problems/minimum-operations-to-make-the-array-increasing, topics: ['Array', 'Greedy'], hasSolution: False, hasVideoSolution: False, 1828: questionNo: 1828, acRate: 86.32607641796307, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Queries on Number of Points Inside a Circle, slug: queries-on-number-of-points-inside-a-circle, url: https://leetcode.com/problems/queries-on-number-of-points-inside-a-circle, topics: ['Array', 'Math', 'Geometry'], hasSolution: False, hasVideoSolution: False, 1829: questionNo: 1829, acRate: 77.17360374576403, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum XOR for Each Query, slug: maximum-xor-for-each-query, url: https://leetcode.com/problems/maximum-xor-for-each-query, topics: ['Array', 'Bit Manipulation', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 1830: questionNo: 1830, acRate: 50.12275963663148, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Minimum Number of Operations to Make String Sorted, slug: minimum-number-of-operations-to-make-string-sorted, url: https://leetcode.com/problems/minimum-number-of-operations-to-make-string-sorted, topics: ['Math', 'String', 'Combinatorics'], hasSolution: False, hasVideoSolution: False, 1831: questionNo: 1831, acRate: 81.68713070443783, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Maximum Transaction Each Day, slug: maximum-transaction-each-day, url: https://leetcode.com/problems/maximum-transaction-each-day, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 1832: questionNo: 1832, acRate: 83.30673211748044, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Check if the Sentence Is Pangram, slug: check-if-the-sentence-is-pangram, url: https://leetcode.com/problems/check-if-the-sentence-is-pangram, topics: ['Hash Table', 'String'], hasSolution: True, hasVideoSolution: False, 1833: questionNo: 1833, acRate: 73.84067136275931, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum Ice Cream Bars, slug: maximum-ice-cream-bars, url: https://leetcode.com/problems/maximum-ice-cream-bars, topics: ['Array', 'Greedy', 'Sorting'], hasSolution: True, hasVideoSolution: False, 1834: questionNo: 1834, acRate: 45.62236331155488, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Single-Threaded CPU, slug: single-threaded-cpu, url: https://leetcode.com/problems/single-threaded-cpu, topics: ['Array', 'Sorting', 'Heap (Priority Queue)'], hasSolution: True, hasVideoSolution: False, 1835: questionNo: 1835, acRate: 61.49574344734995, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Find XOR Sum of All Pairs Bitwise AND, slug: find-xor-sum-of-all-pairs-bitwise-and, url: https://leetcode.com/problems/find-xor-sum-of-all-pairs-bitwise-and, topics: ['Array', 'Math', 'Bit Manipulation'], hasSolution: False, hasVideoSolution: False, 1836: questionNo: 1836, acRate: 74.4728103842339, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Remove Duplicates From an Unsorted Linked List, slug: remove-duplicates-from-an-unsorted-linked-list, url: https://leetcode.com/problems/remove-duplicates-from-an-unsorted-linked-list, topics: ['Hash Table', 'Linked List'], hasSolution: True, hasVideoSolution: False, 1837: questionNo: 1837, acRate: 77.58930546339306, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Sum of Digits in Base K, slug: sum-of-digits-in-base-k, url: https://leetcode.com/problems/sum-of-digits-in-base-k, topics: ['Math'], hasSolution: False, hasVideoSolution: False, 1838: questionNo: 1838, acRate: 44.4164238597897, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Frequency of the Most Frequent Element, slug: frequency-of-the-most-frequent-element, url: https://leetcode.com/problems/frequency-of-the-most-frequent-element, topics: ['Array', 'Binary Search', 'Greedy', 'Sliding Window', 'Sorting', 'Prefix Sum'], hasSolution: True, hasVideoSolution: False, 1839: questionNo: 1839, acRate: 49.478205585448684, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Longest Substring Of All Vowels in Order, slug: longest-substring-of-all-vowels-in-order, url: https://leetcode.com/problems/longest-substring-of-all-vowels-in-order, topics: ['String', 'Sliding Window'], hasSolution: False, hasVideoSolution: False, 1840: questionNo: 1840, acRate: 36.28069829371733, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Maximum Building Height, slug: maximum-building-height, url: https://leetcode.com/problems/maximum-building-height, topics: ['Array', 'Math', 'Sorting'], hasSolution: False, hasVideoSolution: False, 1841: questionNo: 1841, acRate: 53.414691386998356, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: League Statistics, slug: league-statistics, url: https://leetcode.com/problems/league-statistics, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 1842: questionNo: 1842, acRate: 53.316066968828046, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Next Palindrome Using Same Digits, slug: next-palindrome-using-same-digits, url: https://leetcode.com/problems/next-palindrome-using-same-digits, topics: ['Two Pointers', 'String'], hasSolution: False, hasVideoSolution: False, 1843: questionNo: 1843, acRate: 44.80110825252325, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Suspicious Bank Accounts, slug: suspicious-bank-accounts, url: https://leetcode.com/problems/suspicious-bank-accounts, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 1844: questionNo: 1844, acRate: 81.38686795198254, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Replace All Digits with Characters, slug: replace-all-digits-with-characters, url: https://leetcode.com/problems/replace-all-digits-with-characters, topics: ['String'], hasSolution: False, hasVideoSolution: False, 1845: questionNo: 1845, acRate: 69.35754189944134, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Seat Reservation Manager, slug: seat-reservation-manager, url: https://leetcode.com/problems/seat-reservation-manager, topics: ['Design', 'Heap (Priority Queue)'], hasSolution: True, hasVideoSolution: False, 1846: questionNo: 1846, acRate: 65.86284853051997, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum Element After Decreasing and Rearranging, slug: maximum-element-after-decreasing-and-rearranging, url: https://leetcode.com/problems/maximum-element-after-decreasing-and-rearranging, topics: ['Array', 'Greedy', 'Sorting'], hasSolution: True, hasVideoSolution: False, 1847: questionNo: 1847, acRate: 38.136047134440275, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Closest Room, slug: closest-room, url: https://leetcode.com/problems/closest-room, topics: ['Array', 'Binary Search', 'Sorting'], hasSolution: False, hasVideoSolution: False, 1848: questionNo: 1848, acRate: 54.54190063259649, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Minimum Distance to the Target Element, slug: minimum-distance-to-the-target-element, url: https://leetcode.com/problems/minimum-distance-to-the-target-element, topics: ['Array'], hasSolution: False, hasVideoSolution: False, 1849: questionNo: 1849, acRate: 35.79078422447723, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Splitting a String Into Descending Consecutive Values, slug: splitting-a-string-into-descending-consecutive-values, url: https://leetcode.com/problems/splitting-a-string-into-descending-consecutive-values, topics: ['String', 'Backtracking'], hasSolution: False, hasVideoSolution: False, 1850: questionNo: 1850, acRate: 71.31825525040387, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Adjacent Swaps to Reach the Kth Smallest Number, slug: minimum-adjacent-swaps-to-reach-the-kth-smallest-number, url: https://leetcode.com/problems/minimum-adjacent-swaps-to-reach-the-kth-smallest-number, topics: ['Two Pointers', 'String', 'Greedy'], hasSolution: False, hasVideoSolution: False, 1851: questionNo: 1851, acRate: 50.04415165743921, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Minimum Interval to Include Each Query, slug: minimum-interval-to-include-each-query, url: https://leetcode.com/problems/minimum-interval-to-include-each-query, topics: ['Array', 'Binary Search', 'Line Sweep', 'Sorting', 'Heap (Priority Queue)'], hasSolution: False, hasVideoSolution: False, 1852: questionNo: 1852, acRate: 71.4176245210728, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Distinct Numbers in Each Subarray, slug: distinct-numbers-in-each-subarray, url: https://leetcode.com/problems/distinct-numbers-in-each-subarray, topics: ['Array', 'Hash Table', 'Sliding Window'], hasSolution: False, hasVideoSolution: False, 1853: questionNo: 1853, acRate: 85.72450572320498, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Convert Date Format, slug: convert-date-format, url: https://leetcode.com/problems/convert-date-format, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 1854: questionNo: 1854, acRate: 61.03013046619353, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Maximum Population Year, slug: maximum-population-year, url: https://leetcode.com/problems/maximum-population-year, topics: ['Array', 'Counting', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 1855: questionNo: 1855, acRate: 53.47002654202841, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum Distance Between a Pair of Values, slug: maximum-distance-between-a-pair-of-values, url: https://leetcode.com/problems/maximum-distance-between-a-pair-of-values, topics: ['Array', 'Two Pointers', 'Binary Search'], hasSolution: True, hasVideoSolution: False, 1856: questionNo: 1856, acRate: 38.09190701678863, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum Subarray Min-Product, slug: maximum-subarray-min-product, url: https://leetcode.com/problems/maximum-subarray-min-product, topics: ['Array', 'Stack', 'Monotonic Stack', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 1857: questionNo: 1857, acRate: 49.965730468249845, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Largest Color Value in a Directed Graph, slug: largest-color-value-in-a-directed-graph, url: https://leetcode.com/problems/largest-color-value-in-a-directed-graph, topics: ['Hash Table', 'Dynamic Programming', 'Graph', 'Topological Sort', 'Memoization', 'Counting'], hasSolution: True, hasVideoSolution: False, 1858: questionNo: 1858, acRate: 68.50152905198776, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Longest Word With All Prefixes, slug: longest-word-with-all-prefixes, url: https://leetcode.com/problems/longest-word-with-all-prefixes, topics: ['Depth-First Search', 'Trie'], hasSolution: False, hasVideoSolution: False, 1859: questionNo: 1859, acRate: 83.2480354038861, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Sorting the Sentence, slug: sorting-the-sentence, url: https://leetcode.com/problems/sorting-the-sentence, topics: ['String', 'Sorting'], hasSolution: False, hasVideoSolution: False, 1860: questionNo: 1860, acRate: 72.13934004556478, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Incremental Memory Leak, slug: incremental-memory-leak, url: https://leetcode.com/problems/incremental-memory-leak, topics: ['Math', 'Simulation'], hasSolution: False, hasVideoSolution: False, 1861: questionNo: 1861, acRate: 67.66584273328398, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Rotating the Box, slug: rotating-the-box, url: https://leetcode.com/problems/rotating-the-box, topics: ['Array', 'Two Pointers', 'Matrix'], hasSolution: False, hasVideoSolution: False, 1862: questionNo: 1862, acRate: 28.88243831640058, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Sum of Floored Pairs, slug: sum-of-floored-pairs, url: https://leetcode.com/problems/sum-of-floored-pairs, topics: ['Array', 'Math', 'Binary Search', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 1863: questionNo: 1863, acRate: 87.83766595896643, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Sum of All Subset XOR Totals, slug: sum-of-all-subset-xor-totals, url: https://leetcode.com/problems/sum-of-all-subset-xor-totals, topics: ['Array', 'Math', 'Backtracking', 'Bit Manipulation', 'Combinatorics', 'Enumeration'], hasSolution: True, hasVideoSolution: False, 1864: questionNo: 1864, acRate: 43.39864117554116, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Number of Swaps to Make the Binary String Alternating, slug: minimum-number-of-swaps-to-make-the-binary-string-alternating, url: https://leetcode.com/problems/minimum-number-of-swaps-to-make-the-binary-string-alternating, topics: ['String', 'Greedy'], hasSolution: False, hasVideoSolution: False, 1865: questionNo: 1865, acRate: 50.985965535619115, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Finding Pairs With a Certain Sum, slug: finding-pairs-with-a-certain-sum, url: https://leetcode.com/problems/finding-pairs-with-a-certain-sum, topics: ['Array', 'Hash Table', 'Design'], hasSolution: False, hasVideoSolution: False, 1866: questionNo: 1866, acRate: 57.47412652711851, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Number of Ways to Rearrange Sticks With K Sticks Visible, slug: number-of-ways-to-rearrange-sticks-with-k-sticks-visible, url: https://leetcode.com/problems/number-of-ways-to-rearrange-sticks-with-k-sticks-visible, topics: ['Math', 'Dynamic Programming', 'Combinatorics'], hasSolution: False, hasVideoSolution: False, 1867: questionNo: 1867, acRate: 71.05354810622552, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Orders With Maximum Quantity Above Average, slug: orders-with-maximum-quantity-above-average, url: https://leetcode.com/problems/orders-with-maximum-quantity-above-average, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 1868: questionNo: 1868, acRate: 58.6870069756829, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Product of Two Run-Length Encoded Arrays, slug: product-of-two-run-length-encoded-arrays, url: https://leetcode.com/problems/product-of-two-run-length-encoded-arrays, topics: ['Array', 'Two Pointers'], hasSolution: False, hasVideoSolution: False, 1869: questionNo: 1869, acRate: 61.15633139651373, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Longer Contiguous Segments of Ones than Zeros, slug: longer-contiguous-segments-of-ones-than-zeros, url: https://leetcode.com/problems/longer-contiguous-segments-of-ones-than-zeros, topics: ['String'], hasSolution: False, hasVideoSolution: False, 1870: questionNo: 1870, acRate: 46.826331931983326, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Speed to Arrive on Time, slug: minimum-speed-to-arrive-on-time, url: https://leetcode.com/problems/minimum-speed-to-arrive-on-time, topics: ['Array', 'Binary Search'], hasSolution: True, hasVideoSolution: False, 1871: questionNo: 1871, acRate: 24.888980633141202, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Jump Game VII, slug: jump-game-vii, url: https://leetcode.com/problems/jump-game-vii, topics: ['String', 'Dynamic Programming', 'Sliding Window', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 1872: questionNo: 1872, acRate: 53.03171386317577, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Stone Game VIII, slug: stone-game-viii, url: https://leetcode.com/problems/stone-game-viii, topics: ['Array', 'Math', 'Dynamic Programming', 'Prefix Sum', 'Game Theory'], hasSolution: False, hasVideoSolution: False, 1873: questionNo: 1873, acRate: 57.575521128891914, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Calculate Special Bonus, slug: calculate-special-bonus, url: https://leetcode.com/problems/calculate-special-bonus, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 1874: questionNo: 1874, acRate: 89.39004018240101, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Minimize Product Sum of Two Arrays, slug: minimize-product-sum-of-two-arrays, url: https://leetcode.com/problems/minimize-product-sum-of-two-arrays, topics: ['Array', 'Greedy', 'Sorting'], hasSolution: True, hasVideoSolution: False, 1875: questionNo: 1875, acRate: 67.6783004552352, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Group Employees of the Same Salary, slug: group-employees-of-the-same-salary, url: https://leetcode.com/problems/group-employees-of-the-same-salary, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 1876: questionNo: 1876, acRate: 73.71837636835113, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Substrings of Size Three with Distinct Characters, slug: substrings-of-size-three-with-distinct-characters, url: https://leetcode.com/problems/substrings-of-size-three-with-distinct-characters, topics: ['Hash Table', 'String', 'Sliding Window', 'Counting'], hasSolution: False, hasVideoSolution: False, 1877: questionNo: 1877, acRate: 81.45192948501419, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimize Maximum Pair Sum in Array, slug: minimize-maximum-pair-sum-in-array, url: https://leetcode.com/problems/minimize-maximum-pair-sum-in-array, topics: ['Array', 'Two Pointers', 'Greedy', 'Sorting'], hasSolution: True, hasVideoSolution: False, 1878: questionNo: 1878, acRate: 47.95540181604793, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Get Biggest Three Rhombus Sums in a Grid, slug: get-biggest-three-rhombus-sums-in-a-grid, url: https://leetcode.com/problems/get-biggest-three-rhombus-sums-in-a-grid, topics: ['Array', 'Math', 'Sorting', 'Heap (Priority Queue)', 'Matrix', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 1879: questionNo: 1879, acRate: 47.654102866117, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Minimum XOR Sum of Two Arrays, slug: minimum-xor-sum-of-two-arrays, url: https://leetcode.com/problems/minimum-xor-sum-of-two-arrays, topics: ['Array', 'Dynamic Programming', 'Bit Manipulation', 'Bitmask'], hasSolution: False, hasVideoSolution: False, 1880: questionNo: 1880, acRate: 74.19598402363626, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Check if Word Equals Summation of Two Words, slug: check-if-word-equals-summation-of-two-words, url: https://leetcode.com/problems/check-if-word-equals-summation-of-two-words, topics: ['String'], hasSolution: False, hasVideoSolution: False, 1881: questionNo: 1881, acRate: 37.97809807552943, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum Value after Insertion, slug: maximum-value-after-insertion, url: https://leetcode.com/problems/maximum-value-after-insertion, topics: ['String', 'Greedy'], hasSolution: False, hasVideoSolution: False, 1882: questionNo: 1882, acRate: 40.27772895060643, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Process Tasks Using Servers, slug: process-tasks-using-servers, url: https://leetcode.com/problems/process-tasks-using-servers, topics: ['Array', 'Heap (Priority Queue)'], hasSolution: False, hasVideoSolution: False, 1883: questionNo: 1883, acRate: 37.833763996554694, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Minimum Skips to Arrive at Meeting On Time, slug: minimum-skips-to-arrive-at-meeting-on-time, url: https://leetcode.com/problems/minimum-skips-to-arrive-at-meeting-on-time, topics: ['Array', 'Dynamic Programming'], hasSolution: False, hasVideoSolution: False, 1884: questionNo: 1884, acRate: 72.95956154643757, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Egg Drop With 2 Eggs and N Floors, slug: egg-drop-with-2-eggs-and-n-floors, url: https://leetcode.com/problems/egg-drop-with-2-eggs-and-n-floors, topics: ['Math', 'Dynamic Programming'], hasSolution: False, hasVideoSolution: False, 1885: questionNo: 1885, acRate: 60.89100493113416, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Count Pairs in Two Arrays, slug: count-pairs-in-two-arrays, url: https://leetcode.com/problems/count-pairs-in-two-arrays, topics: ['Array', 'Two Pointers', 'Binary Search', 'Sorting'], hasSolution: True, hasVideoSolution: False, 1886: questionNo: 1886, acRate: 57.02185902338876, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Determine Whether Matrix Can Be Obtained By Rotation, slug: determine-whether-matrix-can-be-obtained-by-rotation, url: https://leetcode.com/problems/determine-whether-matrix-can-be-obtained-by-rotation, topics: ['Array', 'Matrix'], hasSolution: False, hasVideoSolution: False, 1887: questionNo: 1887, acRate: 72.91344756809114, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Reduction Operations to Make the Array Elements Equal, slug: reduction-operations-to-make-the-array-elements-equal, url: https://leetcode.com/problems/reduction-operations-to-make-the-array-elements-equal, topics: ['Array', 'Sorting'], hasSolution: True, hasVideoSolution: False, 1888: questionNo: 1888, acRate: 39.96799215663658, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Number of Flips to Make the Binary String Alternating, slug: minimum-number-of-flips-to-make-the-binary-string-alternating, url: https://leetcode.com/problems/minimum-number-of-flips-to-make-the-binary-string-alternating, topics: ['String', 'Dynamic Programming', 'Greedy', 'Sliding Window'], hasSolution: False, hasVideoSolution: False, 1889: questionNo: 1889, acRate: 31.849247713639496, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Minimum Space Wasted From Packaging, slug: minimum-space-wasted-from-packaging, url: https://leetcode.com/problems/minimum-space-wasted-from-packaging, topics: ['Array', 'Binary Search', 'Sorting', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 1890: questionNo: 1890, acRate: 77.2323346912116, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: The Latest Login in 2020, slug: the-latest-login-in-2020, url: https://leetcode.com/problems/the-latest-login-in-2020, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 1891: questionNo: 1891, acRate: 49.66331798954964, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Cutting Ribbons, slug: cutting-ribbons, url: https://leetcode.com/problems/cutting-ribbons, topics: ['Array', 'Binary Search'], hasSolution: False, hasVideoSolution: False, 1892: questionNo: 1892, acRate: 43.56843956577112, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Page Recommendations II, slug: page-recommendations-ii, url: https://leetcode.com/problems/page-recommendations-ii, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 1893: questionNo: 1893, acRate: 49.99779672593474, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Check if All the Integers in a Range Are Covered, slug: check-if-all-the-integers-in-a-range-are-covered, url: https://leetcode.com/problems/check-if-all-the-integers-in-a-range-are-covered, topics: ['Array', 'Hash Table', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 1894: questionNo: 1894, acRate: 45.71015650702637, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Find the Student that Will Replace the Chalk, slug: find-the-student-that-will-replace-the-chalk, url: https://leetcode.com/problems/find-the-student-that-will-replace-the-chalk, topics: ['Array', 'Binary Search', 'Simulation', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 1895: questionNo: 1895, acRate: 52.481510767942694, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Largest Magic Square, slug: largest-magic-square, url: https://leetcode.com/problems/largest-magic-square, topics: ['Array', 'Matrix', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 1896: questionNo: 1896, acRate: 54.14531599001445, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Minimum Cost to Change the Final Value of Expression, slug: minimum-cost-to-change-the-final-value-of-expression, url: https://leetcode.com/problems/minimum-cost-to-change-the-final-value-of-expression, topics: ['Math', 'String', 'Dynamic Programming', 'Stack'], hasSolution: False, hasVideoSolution: False, 1897: questionNo: 1897, acRate: 67.23679537754231, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Redistribute Characters to Make All Strings Equal, slug: redistribute-characters-to-make-all-strings-equal, url: https://leetcode.com/problems/redistribute-characters-to-make-all-strings-equal, topics: ['Hash Table', 'String', 'Counting'], hasSolution: True, hasVideoSolution: False, 1898: questionNo: 1898, acRate: 43.89127324749643, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum Number of Removable Characters, slug: maximum-number-of-removable-characters, url: https://leetcode.com/problems/maximum-number-of-removable-characters, topics: ['Array', 'Two Pointers', 'String', 'Binary Search'], hasSolution: False, hasVideoSolution: False, 1899: questionNo: 1899, acRate: 66.21250572034779, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Merge Triplets to Form Target Triplet, slug: merge-triplets-to-form-target-triplet, url: https://leetcode.com/problems/merge-triplets-to-form-target-triplet, topics: ['Array', 'Greedy'], hasSolution: False, hasVideoSolution: False, 1900: questionNo: 1900, acRate: 51.03212070721096, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: The Earliest and Latest Rounds Where Players Compete, slug: the-earliest-and-latest-rounds-where-players-compete, url: https://leetcode.com/problems/the-earliest-and-latest-rounds-where-players-compete, topics: ['Dynamic Programming', 'Memoization'], hasSolution: False, hasVideoSolution: False, 1901: questionNo: 1901, acRate: 51.829632864196704, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Find a Peak Element II, slug: find-a-peak-element-ii, url: https://leetcode.com/problems/find-a-peak-element-ii, topics: ['Array', 'Binary Search', 'Matrix'], hasSolution: False, hasVideoSolution: False, 1902: questionNo: 1902, acRate: 44.29026814175886, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Depth of BST Given Insertion Order, slug: depth-of-bst-given-insertion-order, url: https://leetcode.com/problems/depth-of-bst-given-insertion-order, topics: ['Tree', 'Binary Search Tree', 'Binary Tree', 'Ordered Set'], hasSolution: False, hasVideoSolution: False, 1903: questionNo: 1903, acRate: 63.5064614639778, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Largest Odd Number in String, slug: largest-odd-number-in-string, url: https://leetcode.com/problems/largest-odd-number-in-string, topics: ['Math', 'String', 'Greedy'], hasSolution: True, hasVideoSolution: False, 1904: questionNo: 1904, acRate: 43.92451186185591, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: The Number of Full Rounds You Have Played, slug: the-number-of-full-rounds-you-have-played, url: https://leetcode.com/problems/the-number-of-full-rounds-you-have-played, topics: ['Math', 'String'], hasSolution: False, hasVideoSolution: False, 1905: questionNo: 1905, acRate: 67.46835711109071, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Count Sub Islands, slug: count-sub-islands, url: https://leetcode.com/problems/count-sub-islands, topics: ['Array', 'Depth-First Search', 'Breadth-First Search', 'Union Find', 'Matrix'], hasSolution: False, hasVideoSolution: False, 1906: questionNo: 1906, acRate: 44.49398303412902, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Absolute Difference Queries, slug: minimum-absolute-difference-queries, url: https://leetcode.com/problems/minimum-absolute-difference-queries, topics: ['Array', 'Hash Table'], hasSolution: False, hasVideoSolution: False, 1907: questionNo: 1907, acRate: 59.50678917075726, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Count Salary Categories, slug: count-salary-categories, url: https://leetcode.com/problems/count-salary-categories, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 1908: questionNo: 1908, acRate: 63.05536089698669, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Game of Nim, slug: game-of-nim, url: https://leetcode.com/problems/game-of-nim, topics: ['Array', 'Math', 'Dynamic Programming', 'Bit Manipulation', 'Brainteaser', 'Game Theory'], hasSolution: True, hasVideoSolution: False, 1909: questionNo: 1909, acRate: 27.608578047763192, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Remove One Element to Make the Array Strictly Increasing, slug: remove-one-element-to-make-the-array-strictly-increasing, url: https://leetcode.com/problems/remove-one-element-to-make-the-array-strictly-increasing, topics: ['Array'], hasSolution: False, hasVideoSolution: False, 1910: questionNo: 1910, acRate: 77.62336254066383, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Remove All Occurrences of a Substring, slug: remove-all-occurrences-of-a-substring, url: https://leetcode.com/problems/remove-all-occurrences-of-a-substring, topics: ['String'], hasSolution: False, hasVideoSolution: False, 1911: questionNo: 1911, acRate: 59.11298353121409, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum Alternating Subsequence Sum, slug: maximum-alternating-subsequence-sum, url: https://leetcode.com/problems/maximum-alternating-subsequence-sum, topics: ['Array', 'Dynamic Programming'], hasSolution: False, hasVideoSolution: False, 1912: questionNo: 1912, acRate: 36.58630347630293, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Design Movie Rental System, slug: design-movie-rental-system, url: https://leetcode.com/problems/design-movie-rental-system, topics: ['Array', 'Hash Table', 'Design', 'Heap (Priority Queue)', 'Ordered Set'], hasSolution: False, hasVideoSolution: False, 1913: questionNo: 1913, acRate: 82.8480663534197, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Maximum Product Difference Between Two Pairs, slug: maximum-product-difference-between-two-pairs, url: https://leetcode.com/problems/maximum-product-difference-between-two-pairs, topics: ['Array', 'Sorting'], hasSolution: True, hasVideoSolution: False, 1914: questionNo: 1914, acRate: 49.62830342894952, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Cyclically Rotating a Grid, slug: cyclically-rotating-a-grid, url: https://leetcode.com/problems/cyclically-rotating-a-grid, topics: ['Array', 'Matrix', 'Simulation'], hasSolution: False, hasVideoSolution: False, 1915: questionNo: 1915, acRate: 67.00413239914592, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Number of Wonderful Substrings, slug: number-of-wonderful-substrings, url: https://leetcode.com/problems/number-of-wonderful-substrings, topics: ['Hash Table', 'String', 'Bit Manipulation', 'Prefix Sum'], hasSolution: True, hasVideoSolution: False, 1916: questionNo: 1916, acRate: 48.66425992779783, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Count Ways to Build Rooms in an Ant Colony, slug: count-ways-to-build-rooms-in-an-ant-colony, url: https://leetcode.com/problems/count-ways-to-build-rooms-in-an-ant-colony, topics: ['Math', 'Dynamic Programming', 'Tree', 'Graph', 'Topological Sort', 'Combinatorics'], hasSolution: False, hasVideoSolution: False, 1917: questionNo: 1917, acRate: 26.904141326382856, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Leetcodify Friends Recommendations, slug: leetcodify-friends-recommendations, url: https://leetcode.com/problems/leetcodify-friends-recommendations, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 1918: questionNo: 1918, acRate: 52.59842519685039, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Kth Smallest Subarray Sum, slug: kth-smallest-subarray-sum, url: https://leetcode.com/problems/kth-smallest-subarray-sum, topics: ['Array', 'Binary Search', 'Sliding Window'], hasSolution: False, hasVideoSolution: False, 1919: questionNo: 1919, acRate: 41.57118250580394, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Leetcodify Similar Friends, slug: leetcodify-similar-friends, url: https://leetcode.com/problems/leetcodify-similar-friends, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 1920: questionNo: 1920, acRate: 89.91395217068823, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Build Array from Permutation, slug: build-array-from-permutation, url: https://leetcode.com/problems/build-array-from-permutation, topics: ['Array', 'Simulation'], hasSolution: False, hasVideoSolution: False, 1921: questionNo: 1921, acRate: 50.90291135221946, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Eliminate Maximum Number of Monsters, slug: eliminate-maximum-number-of-monsters, url: https://leetcode.com/problems/eliminate-maximum-number-of-monsters, topics: ['Array', 'Greedy', 'Sorting'], hasSolution: True, hasVideoSolution: False, 1922: questionNo: 1922, acRate: 45.8568297832536, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Count Good Numbers, slug: count-good-numbers, url: https://leetcode.com/problems/count-good-numbers, topics: ['Math', 'Recursion'], hasSolution: False, hasVideoSolution: False, 1923: questionNo: 1923, acRate: 28.273251892378028, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Longest Common Subpath, slug: longest-common-subpath, url: https://leetcode.com/problems/longest-common-subpath, topics: ['Array', 'Binary Search', 'Rolling Hash', 'Suffix Array', 'Hash Function'], hasSolution: False, hasVideoSolution: False, 1924: questionNo: 1924, acRate: 50.700280112044815, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Erect the Fence II, slug: erect-the-fence-ii, url: https://leetcode.com/problems/erect-the-fence-ii, topics: ['Array', 'Math', 'Geometry'], hasSolution: False, hasVideoSolution: False, 1925: questionNo: 1925, acRate: 67.91531660973213, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Count Square Sum Triples, slug: count-square-sum-triples, url: https://leetcode.com/problems/count-square-sum-triples, topics: ['Math', 'Enumeration'], hasSolution: False, hasVideoSolution: False, 1926: questionNo: 1926, acRate: 46.70585838247279, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Nearest Exit from Entrance in Maze, slug: nearest-exit-from-entrance-in-maze, url: https://leetcode.com/problems/nearest-exit-from-entrance-in-maze, topics: ['Array', 'Breadth-First Search', 'Matrix'], hasSolution: True, hasVideoSolution: False, 1927: questionNo: 1927, acRate: 47.899193548387096, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Sum Game, slug: sum-game, url: https://leetcode.com/problems/sum-game, topics: ['Math', 'String', 'Greedy', 'Game Theory'], hasSolution: False, hasVideoSolution: False, 1928: questionNo: 1928, acRate: 38.352973151365724, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Minimum Cost to Reach Destination in Time, slug: minimum-cost-to-reach-destination-in-time, url: https://leetcode.com/problems/minimum-cost-to-reach-destination-in-time, topics: ['Array', 'Dynamic Programming', 'Graph'], hasSolution: False, hasVideoSolution: False, 1929: questionNo: 1929, acRate: 89.98139330158857, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Concatenation of Array, slug: concatenation-of-array, url: https://leetcode.com/problems/concatenation-of-array, topics: ['Array', 'Simulation'], hasSolution: False, hasVideoSolution: False, 1930: questionNo: 1930, acRate: 66.0987052212017, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Unique Length-3 Palindromic Subsequences, slug: unique-length-3-palindromic-subsequences, url: https://leetcode.com/problems/unique-length-3-palindromic-subsequences, topics: ['Hash Table', 'String', 'Bit Manipulation', 'Prefix Sum'], hasSolution: True, hasVideoSolution: False, 1931: questionNo: 1931, acRate: 57.72412115314438, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Painting a Grid With Three Different Colors, slug: painting-a-grid-with-three-different-colors, url: https://leetcode.com/problems/painting-a-grid-with-three-different-colors, topics: ['Dynamic Programming'], hasSolution: False, hasVideoSolution: False, 1932: questionNo: 1932, acRate: 36.27825662709384, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Merge BSTs to Create Single BST, slug: merge-bsts-to-create-single-bst, url: https://leetcode.com/problems/merge-bsts-to-create-single-bst, topics: ['Hash Table', 'Binary Search', 'Tree', 'Depth-First Search', 'Binary Tree'], hasSolution: False, hasVideoSolution: False, 1933: questionNo: 1933, acRate: 50.64864864864865, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Check if String Is Decomposable Into Value-Equal Substrings, slug: check-if-string-is-decomposable-into-value-equal-substrings, url: https://leetcode.com/problems/check-if-string-is-decomposable-into-value-equal-substrings, topics: ['String'], hasSolution: False, hasVideoSolution: False, 1934: questionNo: 1934, acRate: 58.554799995619945, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Confirmation Rate, slug: confirmation-rate, url: https://leetcode.com/problems/confirmation-rate, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 1935: questionNo: 1935, acRate: 73.43395505456976, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Maximum Number of Words You Can Type, slug: maximum-number-of-words-you-can-type, url: https://leetcode.com/problems/maximum-number-of-words-you-can-type, topics: ['Hash Table', 'String'], hasSolution: False, hasVideoSolution: False, 1936: questionNo: 1936, acRate: 42.89281282239134, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Add Minimum Number of Rungs, slug: add-minimum-number-of-rungs, url: https://leetcode.com/problems/add-minimum-number-of-rungs, topics: ['Array', 'Greedy'], hasSolution: False, hasVideoSolution: False, 1937: questionNo: 1937, acRate: 35.65216874416725, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum Number of Points with Cost, slug: maximum-number-of-points-with-cost, url: https://leetcode.com/problems/maximum-number-of-points-with-cost, topics: ['Array', 'Dynamic Programming'], hasSolution: False, hasVideoSolution: False, 1938: questionNo: 1938, acRate: 42.77910286989305, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Maximum Genetic Difference Query, slug: maximum-genetic-difference-query, url: https://leetcode.com/problems/maximum-genetic-difference-query, topics: ['Array', 'Hash Table', 'Bit Manipulation', 'Depth-First Search', 'Trie'], hasSolution: False, hasVideoSolution: False, 1939: questionNo: 1939, acRate: 56.32699885281062, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Users That Actively Request Confirmation Messages, slug: users-that-actively-request-confirmation-messages, url: https://leetcode.com/problems/users-that-actively-request-confirmation-messages, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 1940: questionNo: 1940, acRate: 81.24772644598036, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Longest Common Subsequence Between Sorted Arrays, slug: longest-common-subsequence-between-sorted-arrays, url: https://leetcode.com/problems/longest-common-subsequence-between-sorted-arrays, topics: ['Array', 'Hash Table', 'Counting'], hasSolution: True, hasVideoSolution: False, 1941: questionNo: 1941, acRate: 77.66614727474283, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Check if All Characters Have Equal Number of Occurrences, slug: check-if-all-characters-have-equal-number-of-occurrences, url: https://leetcode.com/problems/check-if-all-characters-have-equal-number-of-occurrences, topics: ['Hash Table', 'String', 'Counting'], hasSolution: False, hasVideoSolution: False, 1942: questionNo: 1942, acRate: 42.24512062068129, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: The Number of the Smallest Unoccupied Chair, slug: the-number-of-the-smallest-unoccupied-chair, url: https://leetcode.com/problems/the-number-of-the-smallest-unoccupied-chair, topics: ['Array', 'Hash Table', 'Heap (Priority Queue)'], hasSolution: False, hasVideoSolution: False, 1943: questionNo: 1943, acRate: 50.01152782047341, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Describe the Painting, slug: describe-the-painting, url: https://leetcode.com/problems/describe-the-painting, topics: ['Array', 'Hash Table', 'Sorting', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 1944: questionNo: 1944, acRate: 69.85924666208344, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Number of Visible People in a Queue, slug: number-of-visible-people-in-a-queue, url: https://leetcode.com/problems/number-of-visible-people-in-a-queue, topics: ['Array', 'Stack', 'Monotonic Stack'], hasSolution: False, hasVideoSolution: False, 1945: questionNo: 1945, acRate: 62.772075585230105, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Sum of Digits of String After Convert, slug: sum-of-digits-of-string-after-convert, url: https://leetcode.com/problems/sum-of-digits-of-string-after-convert, topics: ['String', 'Simulation'], hasSolution: False, hasVideoSolution: False, 1946: questionNo: 1946, acRate: 35.95874273547531, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Largest Number After Mutating Substring, slug: largest-number-after-mutating-substring, url: https://leetcode.com/problems/largest-number-after-mutating-substring, topics: ['Array', 'String', 'Greedy'], hasSolution: False, hasVideoSolution: False, 1947: questionNo: 1947, acRate: 62.19962802231866, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum Compatibility Score Sum, slug: maximum-compatibility-score-sum, url: https://leetcode.com/problems/maximum-compatibility-score-sum, topics: ['Array', 'Dynamic Programming', 'Backtracking', 'Bit Manipulation', 'Bitmask'], hasSolution: False, hasVideoSolution: False, 1948: questionNo: 1948, acRate: 55.57707929763169, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Delete Duplicate Folders in System, slug: delete-duplicate-folders-in-system, url: https://leetcode.com/problems/delete-duplicate-folders-in-system, topics: ['Array', 'Hash Table', 'String', 'Trie', 'Hash Function'], hasSolution: False, hasVideoSolution: False, 1949: questionNo: 1949, acRate: 54.44741532976827, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Strong Friendship, slug: strong-friendship, url: https://leetcode.com/problems/strong-friendship, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 1950: questionNo: 1950, acRate: 49.70935060621159, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Maximum of Minimum Values in All Subarrays, slug: maximum-of-minimum-values-in-all-subarrays, url: https://leetcode.com/problems/maximum-of-minimum-values-in-all-subarrays, topics: ['Array', 'Stack', 'Monotonic Stack'], hasSolution: False, hasVideoSolution: False, 1951: questionNo: 1951, acRate: 68.72163611716861, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: All the Pairs With the Maximum Number of Common Followers, slug: all-the-pairs-with-the-maximum-number-of-common-followers, url: https://leetcode.com/problems/all-the-pairs-with-the-maximum-number-of-common-followers, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 1952: questionNo: 1952, acRate: 60.977430850161205, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Three Divisors, slug: three-divisors, url: https://leetcode.com/problems/three-divisors, topics: ['Math', 'Enumeration', 'Number Theory'], hasSolution: False, hasVideoSolution: False, 1953: questionNo: 1953, acRate: 40.70568573280126, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum Number of Weeks for Which You Can Work, slug: maximum-number-of-weeks-for-which-you-can-work, url: https://leetcode.com/problems/maximum-number-of-weeks-for-which-you-can-work, topics: ['Array', 'Greedy'], hasSolution: False, hasVideoSolution: False, 1954: questionNo: 1954, acRate: 54.45126021040587, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Garden Perimeter to Collect Enough Apples, slug: minimum-garden-perimeter-to-collect-enough-apples, url: https://leetcode.com/problems/minimum-garden-perimeter-to-collect-enough-apples, topics: ['Math', 'Binary Search'], hasSolution: False, hasVideoSolution: False, 1955: questionNo: 1955, acRate: 51.277927497174645, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Count Number of Special Subsequences, slug: count-number-of-special-subsequences, url: https://leetcode.com/problems/count-number-of-special-subsequences, topics: ['Array', 'Dynamic Programming'], hasSolution: False, hasVideoSolution: False, 1956: questionNo: 1956, acRate: 47.18826405867971, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Minimum Time For K Virus Variants to Spread, slug: minimum-time-for-k-virus-variants-to-spread, url: https://leetcode.com/problems/minimum-time-for-k-virus-variants-to-spread, topics: ['Array', 'Math', 'Binary Search', 'Geometry', 'Enumeration'], hasSolution: False, hasVideoSolution: False, 1957: questionNo: 1957, acRate: 58.28899082568807, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Delete Characters to Make Fancy String, slug: delete-characters-to-make-fancy-string, url: https://leetcode.com/problems/delete-characters-to-make-fancy-string, topics: ['String'], hasSolution: False, hasVideoSolution: False, 1958: questionNo: 1958, acRate: 48.36619918843881, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Check if Move is Legal, slug: check-if-move-is-legal, url: https://leetcode.com/problems/check-if-move-is-legal, topics: ['Array', 'Matrix', 'Enumeration'], hasSolution: False, hasVideoSolution: False, 1959: questionNo: 1959, acRate: 43.054423155320016, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Total Space Wasted With K Resizing Operations, slug: minimum-total-space-wasted-with-k-resizing-operations, url: https://leetcode.com/problems/minimum-total-space-wasted-with-k-resizing-operations, topics: ['Array', 'Dynamic Programming'], hasSolution: False, hasVideoSolution: False, 1960: questionNo: 1960, acRate: 30.73607707259359, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Maximum Product of the Length of Two Palindromic Substrings, slug: maximum-product-of-the-length-of-two-palindromic-substrings, url: https://leetcode.com/problems/maximum-product-of-the-length-of-two-palindromic-substrings, topics: ['String', 'Rolling Hash', 'Hash Function'], hasSolution: False, hasVideoSolution: False, 1961: questionNo: 1961, acRate: 52.80726737048859, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Check If String Is a Prefix of Array, slug: check-if-string-is-a-prefix-of-array, url: https://leetcode.com/problems/check-if-string-is-a-prefix-of-array, topics: ['Array', 'Two Pointers', 'String'], hasSolution: False, hasVideoSolution: False, 1962: questionNo: 1962, acRate: 62.46990087149964, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Remove Stones to Minimize the Total, slug: remove-stones-to-minimize-the-total, url: https://leetcode.com/problems/remove-stones-to-minimize-the-total, topics: ['Array', 'Greedy', 'Heap (Priority Queue)'], hasSolution: True, hasVideoSolution: False, 1963: questionNo: 1963, acRate: 71.90515066053139, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Number of Swaps to Make the String Balanced, slug: minimum-number-of-swaps-to-make-the-string-balanced, url: https://leetcode.com/problems/minimum-number-of-swaps-to-make-the-string-balanced, topics: ['Two Pointers', 'String', 'Stack', 'Greedy'], hasSolution: False, hasVideoSolution: False, 1964: questionNo: 1964, acRate: 62.943625811740844, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Find the Longest Valid Obstacle Course at Each Position, slug: find-the-longest-valid-obstacle-course-at-each-position, url: https://leetcode.com/problems/find-the-longest-valid-obstacle-course-at-each-position, topics: ['Array', 'Binary Search', 'Binary Indexed Tree'], hasSolution: True, hasVideoSolution: False, 1965: questionNo: 1965, acRate: 72.28399895588619, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Employees With Missing Information, slug: employees-with-missing-information, url: https://leetcode.com/problems/employees-with-missing-information, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 1966: questionNo: 1966, acRate: 64.04494382022472, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Binary Searchable Numbers in an Unsorted Array, slug: binary-searchable-numbers-in-an-unsorted-array, url: https://leetcode.com/problems/binary-searchable-numbers-in-an-unsorted-array, topics: ['Array', 'Binary Search'], hasSolution: False, hasVideoSolution: False, 1967: questionNo: 1967, acRate: 80.97406011252922, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Number of Strings That Appear as Substrings in Word, slug: number-of-strings-that-appear-as-substrings-in-word, url: https://leetcode.com/problems/number-of-strings-that-appear-as-substrings-in-word, topics: ['String'], hasSolution: False, hasVideoSolution: False, 1968: questionNo: 1968, acRate: 50.22937322588891, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Array With Elements Not Equal to Average of Neighbors, slug: array-with-elements-not-equal-to-average-of-neighbors, url: https://leetcode.com/problems/array-with-elements-not-equal-to-average-of-neighbors, topics: ['Array', 'Greedy', 'Sorting'], hasSolution: False, hasVideoSolution: False, 1969: questionNo: 1969, acRate: 35.55163175840234, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Non-Zero Product of the Array Elements, slug: minimum-non-zero-product-of-the-array-elements, url: https://leetcode.com/problems/minimum-non-zero-product-of-the-array-elements, topics: ['Math', 'Greedy', 'Recursion'], hasSolution: False, hasVideoSolution: False, 1970: questionNo: 1970, acRate: 61.9518894350769, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Last Day Where You Can Still Cross, slug: last-day-where-you-can-still-cross, url: https://leetcode.com/problems/last-day-where-you-can-still-cross, topics: ['Array', 'Binary Search', 'Depth-First Search', 'Breadth-First Search', 'Union Find', 'Matrix'], hasSolution: True, hasVideoSolution: False, 1971: questionNo: 1971, acRate: 54.114716809007376, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Find if Path Exists in Graph, slug: find-if-path-exists-in-graph, url: https://leetcode.com/problems/find-if-path-exists-in-graph, topics: ['Depth-First Search', 'Breadth-First Search', 'Union Find', 'Graph'], hasSolution: True, hasVideoSolution: False, 1972: questionNo: 1972, acRate: 50.332478140216764, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: First and Last Call On the Same Day, slug: first-and-last-call-on-the-same-day, url: https://leetcode.com/problems/first-and-last-call-on-the-same-day, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 1973: questionNo: 1973, acRate: 76.92530232019904, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Count Nodes Equal to Sum of Descendants, slug: count-nodes-equal-to-sum-of-descendants, url: https://leetcode.com/problems/count-nodes-equal-to-sum-of-descendants, topics: ['Tree', 'Depth-First Search', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 1974: questionNo: 1974, acRate: 75.38495269256067, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Minimum Time to Type Word Using Special Typewriter, slug: minimum-time-to-type-word-using-special-typewriter, url: https://leetcode.com/problems/minimum-time-to-type-word-using-special-typewriter, topics: ['String', 'Greedy'], hasSolution: False, hasVideoSolution: False, 1975: questionNo: 1975, acRate: 49.70178926441352, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum Matrix Sum, slug: maximum-matrix-sum, url: https://leetcode.com/problems/maximum-matrix-sum, topics: ['Array', 'Greedy', 'Matrix'], hasSolution: False, hasVideoSolution: False, 1976: questionNo: 1976, acRate: 27.583678660979395, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Number of Ways to Arrive at Destination, slug: number-of-ways-to-arrive-at-destination, url: https://leetcode.com/problems/number-of-ways-to-arrive-at-destination, topics: ['Dynamic Programming', 'Graph', 'Topological Sort', 'Shortest Path'], hasSolution: False, hasVideoSolution: False, 1977: questionNo: 1977, acRate: 20.883992307441574, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Number of Ways to Separate Numbers, slug: number-of-ways-to-separate-numbers, url: https://leetcode.com/problems/number-of-ways-to-separate-numbers, topics: ['String', 'Dynamic Programming', 'Suffix Array'], hasSolution: False, hasVideoSolution: False, 1978: questionNo: 1978, acRate: 48.25546416802196, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Employees Whose Manager Left the Company, slug: employees-whose-manager-left-the-company, url: https://leetcode.com/problems/employees-whose-manager-left-the-company, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 1979: questionNo: 1979, acRate: 77.96641069554168, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Find Greatest Common Divisor of Array, slug: find-greatest-common-divisor-of-array, url: https://leetcode.com/problems/find-greatest-common-divisor-of-array, topics: ['Array', 'Math', 'Number Theory'], hasSolution: False, hasVideoSolution: False, 1980: questionNo: 1980, acRate: 74.63457214654147, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Find Unique Binary String, slug: find-unique-binary-string, url: https://leetcode.com/problems/find-unique-binary-string, topics: ['Array', 'Hash Table', 'String', 'Backtracking'], hasSolution: True, hasVideoSolution: False, 1981: questionNo: 1981, acRate: 34.95260087506077, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimize the Difference Between Target and Chosen Elements, slug: minimize-the-difference-between-target-and-chosen-elements, url: https://leetcode.com/problems/minimize-the-difference-between-target-and-chosen-elements, topics: ['Array', 'Dynamic Programming', 'Matrix'], hasSolution: False, hasVideoSolution: False, 1982: questionNo: 1982, acRate: 48.738551926732335, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Find Array Given Subset Sums, slug: find-array-given-subset-sums, url: https://leetcode.com/problems/find-array-given-subset-sums, topics: ['Array', 'Divide and Conquer'], hasSolution: False, hasVideoSolution: False, 1983: questionNo: 1983, acRate: 53.44369507459636, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Widest Pair of Indices With Equal Range Sum, slug: widest-pair-of-indices-with-equal-range-sum, url: https://leetcode.com/problems/widest-pair-of-indices-with-equal-range-sum, topics: ['Array', 'Hash Table', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 1984: questionNo: 1984, acRate: 57.06670903995609, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Minimum Difference Between Highest and Lowest of K Scores, slug: minimum-difference-between-highest-and-lowest-of-k-scores, url: https://leetcode.com/problems/minimum-difference-between-highest-and-lowest-of-k-scores, topics: ['Array', 'Sliding Window', 'Sorting'], hasSolution: False, hasVideoSolution: False, 1985: questionNo: 1985, acRate: 45.64707948106677, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Find the Kth Largest Integer in the Array, slug: find-the-kth-largest-integer-in-the-array, url: https://leetcode.com/problems/find-the-kth-largest-integer-in-the-array, topics: ['Array', 'String', 'Divide and Conquer', 'Sorting', 'Heap (Priority Queue)', 'Quickselect'], hasSolution: False, hasVideoSolution: False, 1986: questionNo: 1986, acRate: 33.23064258631012, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Number of Work Sessions to Finish the Tasks, slug: minimum-number-of-work-sessions-to-finish-the-tasks, url: https://leetcode.com/problems/minimum-number-of-work-sessions-to-finish-the-tasks, topics: ['Array', 'Dynamic Programming', 'Backtracking', 'Bit Manipulation', 'Bitmask'], hasSolution: False, hasVideoSolution: False, 1987: questionNo: 1987, acRate: 52.30570917709676, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Number of Unique Good Subsequences, slug: number-of-unique-good-subsequences, url: https://leetcode.com/problems/number-of-unique-good-subsequences, topics: ['String', 'Dynamic Programming'], hasSolution: False, hasVideoSolution: False, 1988: questionNo: 1988, acRate: 66.9790060491045, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Find Cutoff Score for Each School, slug: find-cutoff-score-for-each-school, url: https://leetcode.com/problems/find-cutoff-score-for-each-school, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 1989: questionNo: 1989, acRate: 51.26987894611915, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Maximum Number of People That Can Be Caught in Tag, slug: maximum-number-of-people-that-can-be-caught-in-tag, url: https://leetcode.com/problems/maximum-number-of-people-that-can-be-caught-in-tag, topics: ['Array', 'Greedy'], hasSolution: False, hasVideoSolution: False, 1990: questionNo: 1990, acRate: 49.206241057436806, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Count the Number of Experiments, slug: count-the-number-of-experiments, url: https://leetcode.com/problems/count-the-number-of-experiments, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 1991: questionNo: 1991, acRate: 67.52922784121806, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Find the Middle Index in Array, slug: find-the-middle-index-in-array, url: https://leetcode.com/problems/find-the-middle-index-in-array, topics: ['Array', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 1992: questionNo: 1992, acRate: 75.80069281061206, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Find All Groups of Farmland, slug: find-all-groups-of-farmland, url: https://leetcode.com/problems/find-all-groups-of-farmland, topics: ['Array', 'Depth-First Search', 'Breadth-First Search', 'Matrix'], hasSolution: True, hasVideoSolution: False, 1993: questionNo: 1993, acRate: 45.9105350465319, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Operations on Tree, slug: operations-on-tree, url: https://leetcode.com/problems/operations-on-tree, topics: ['Array', 'Hash Table', 'Tree', 'Depth-First Search', 'Breadth-First Search', 'Design'], hasSolution: False, hasVideoSolution: False, 1994: questionNo: 1994, acRate: 34.74371903363003, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: The Number of Good Subsets, slug: the-number-of-good-subsets, url: https://leetcode.com/problems/the-number-of-good-subsets, topics: ['Array', 'Math', 'Dynamic Programming', 'Bit Manipulation', 'Bitmask'], hasSolution: False, hasVideoSolution: False, 1995: questionNo: 1995, acRate: 61.510136954401894, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Count Special Quadruplets, slug: count-special-quadruplets, url: https://leetcode.com/problems/count-special-quadruplets, topics: ['Array', 'Hash Table', 'Enumeration'], hasSolution: False, hasVideoSolution: False, 1996: questionNo: 1996, acRate: 43.96717230321315, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: The Number of Weak Characters in the Game, slug: the-number-of-weak-characters-in-the-game, url: https://leetcode.com/problems/the-number-of-weak-characters-in-the-game, topics: ['Array', 'Stack', 'Greedy', 'Sorting', 'Monotonic Stack'], hasSolution: True, hasVideoSolution: False, 1997: questionNo: 1997, acRate: 37.5109448380164, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: First Day Where You Have Been in All the Rooms, slug: first-day-where-you-have-been-in-all-the-rooms, url: https://leetcode.com/problems/first-day-where-you-have-been-in-all-the-rooms, topics: ['Array', 'Dynamic Programming'], hasSolution: False, hasVideoSolution: False, 1998: questionNo: 1998, acRate: 46.00411845459894, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: GCD Sort of an Array, slug: gcd-sort-of-an-array, url: https://leetcode.com/problems/gcd-sort-of-an-array, topics: ['Array', 'Math', 'Union Find', 'Sorting', 'Number Theory'], hasSolution: False, hasVideoSolution: False, 1999: questionNo: 1999, acRate: 49.358974358974365, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Smallest Greater Multiple Made of Two Digits, slug: smallest-greater-multiple-made-of-two-digits, url: https://leetcode.com/problems/smallest-greater-multiple-made-of-two-digits, topics: ['Math', 'Enumeration'], hasSolution: False, hasVideoSolution: False, 2000: questionNo: 2000, acRate: 86.27066641179577, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Reverse Prefix of Word, slug: reverse-prefix-of-word, url: https://leetcode.com/problems/reverse-prefix-of-word, topics: ['Two Pointers', 'String'], hasSolution: True, hasVideoSolution: False, 2001: questionNo: 2001, acRate: 49.98402045381911, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Number of Pairs of Interchangeable Rectangles, slug: number-of-pairs-of-interchangeable-rectangles, url: https://leetcode.com/problems/number-of-pairs-of-interchangeable-rectangles, topics: ['Array', 'Hash Table', 'Math', 'Counting', 'Number Theory'], hasSolution: False, hasVideoSolution: False, 2002: questionNo: 2002, acRate: 60.06401426140508, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum Product of the Length of Two Palindromic Subsequences, slug: maximum-product-of-the-length-of-two-palindromic-subsequences, url: https://leetcode.com/problems/maximum-product-of-the-length-of-two-palindromic-subsequences, topics: ['String', 'Dynamic Programming', 'Backtracking', 'Bit Manipulation', 'Bitmask'], hasSolution: False, hasVideoSolution: False, 2003: questionNo: 2003, acRate: 46.65676894314308, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Smallest Missing Genetic Value in Each Subtree, slug: smallest-missing-genetic-value-in-each-subtree, url: https://leetcode.com/problems/smallest-missing-genetic-value-in-each-subtree, topics: ['Dynamic Programming', 'Tree', 'Depth-First Search', 'Union Find'], hasSolution: False, hasVideoSolution: False, 2004: questionNo: 2004, acRate: 43.29240563892679, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: The Number of Seniors and Juniors to Join the Company, slug: the-number-of-seniors-and-juniors-to-join-the-company, url: https://leetcode.com/problems/the-number-of-seniors-and-juniors-to-join-the-company, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 2005: questionNo: 2005, acRate: 58.88278388278388, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Subtree Removal Game with Fibonacci Tree, slug: subtree-removal-game-with-fibonacci-tree, url: https://leetcode.com/problems/subtree-removal-game-with-fibonacci-tree, topics: ['Math', 'Dynamic Programming', 'Tree', 'Binary Tree', 'Game Theory'], hasSolution: False, hasVideoSolution: False, 2006: questionNo: 2006, acRate: 84.01052136350027, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Count Number of Pairs With Absolute Difference K, slug: count-number-of-pairs-with-absolute-difference-k, url: https://leetcode.com/problems/count-number-of-pairs-with-absolute-difference-k, topics: ['Array', 'Hash Table', 'Counting'], hasSolution: False, hasVideoSolution: False, 2007: questionNo: 2007, acRate: 40.50727340544573, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Find Original Array From Doubled Array, slug: find-original-array-from-doubled-array, url: https://leetcode.com/problems/find-original-array-from-doubled-array, topics: ['Array', 'Hash Table', 'Greedy', 'Sorting'], hasSolution: True, hasVideoSolution: False, 2008: questionNo: 2008, acRate: 44.25475121300171, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum Earnings From Taxi, slug: maximum-earnings-from-taxi, url: https://leetcode.com/problems/maximum-earnings-from-taxi, topics: ['Array', 'Hash Table', 'Binary Search', 'Dynamic Programming', 'Sorting'], hasSolution: False, hasVideoSolution: False, 2009: questionNo: 2009, acRate: 52.69474589776678, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Minimum Number of Operations to Make Array Continuous, slug: minimum-number-of-operations-to-make-array-continuous, url: https://leetcode.com/problems/minimum-number-of-operations-to-make-array-continuous, topics: ['Array', 'Hash Table', 'Binary Search', 'Sliding Window'], hasSolution: True, hasVideoSolution: False, 2010: questionNo: 2010, acRate: 62.2180657938167, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: The Number of Seniors and Juniors to Join the Company II, slug: the-number-of-seniors-and-juniors-to-join-the-company-ii, url: https://leetcode.com/problems/the-number-of-seniors-and-juniors-to-join-the-company-ii, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 2011: questionNo: 2011, acRate: 89.26096299101272, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Final Value of Variable After Performing Operations, slug: final-value-of-variable-after-performing-operations, url: https://leetcode.com/problems/final-value-of-variable-after-performing-operations, topics: ['Array', 'String', 'Simulation'], hasSolution: False, hasVideoSolution: False, 2012: questionNo: 2012, acRate: 48.220012177795816, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Sum of Beauty in the Array, slug: sum-of-beauty-in-the-array, url: https://leetcode.com/problems/sum-of-beauty-in-the-array, topics: ['Array'], hasSolution: False, hasVideoSolution: False, 2013: questionNo: 2013, acRate: 51.17128609532645, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Detect Squares, slug: detect-squares, url: https://leetcode.com/problems/detect-squares, topics: ['Array', 'Hash Table', 'Design', 'Counting'], hasSolution: False, hasVideoSolution: False, 2014: questionNo: 2014, acRate: 55.63040076206028, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Longest Subsequence Repeated k Times, slug: longest-subsequence-repeated-k-times, url: https://leetcode.com/problems/longest-subsequence-repeated-k-times, topics: ['String', 'Backtracking', 'Greedy', 'Counting', 'Enumeration'], hasSolution: False, hasVideoSolution: False, 2015: questionNo: 2015, acRate: 58.85057471264368, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Average Height of Buildings in Each Segment, slug: average-height-of-buildings-in-each-segment, url: https://leetcode.com/problems/average-height-of-buildings-in-each-segment, topics: ['Array', 'Greedy', 'Sorting', 'Heap (Priority Queue)'], hasSolution: False, hasVideoSolution: False, 2016: questionNo: 2016, acRate: 56.483468877380226, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Maximum Difference Between Increasing Elements, slug: maximum-difference-between-increasing-elements, url: https://leetcode.com/problems/maximum-difference-between-increasing-elements, topics: ['Array'], hasSolution: False, hasVideoSolution: False, 2017: questionNo: 2017, acRate: 45.966062973266766, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Grid Game, slug: grid-game, url: https://leetcode.com/problems/grid-game, topics: ['Array', 'Matrix', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 2018: questionNo: 2018, acRate: 49.66816477656428, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Check if Word Can Be Placed In Crossword, slug: check-if-word-can-be-placed-in-crossword, url: https://leetcode.com/problems/check-if-word-can-be-placed-in-crossword, topics: ['Array', 'Matrix', 'Enumeration'], hasSolution: False, hasVideoSolution: False, 2019: questionNo: 2019, acRate: 33.66119709118031, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: The Score of Students Solving Math Expression, slug: the-score-of-students-solving-math-expression, url: https://leetcode.com/problems/the-score-of-students-solving-math-expression, topics: ['Array', 'Math', 'String', 'Dynamic Programming', 'Stack', 'Memoization'], hasSolution: False, hasVideoSolution: False, 2020: questionNo: 2020, acRate: 71.875, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Number of Accounts That Did Not Stream, slug: number-of-accounts-that-did-not-stream, url: https://leetcode.com/problems/number-of-accounts-that-did-not-stream, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 2021: questionNo: 2021, acRate: 61.720853178711955, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Brightest Position on Street, slug: brightest-position-on-street, url: https://leetcode.com/problems/brightest-position-on-street, topics: ['Array', 'Prefix Sum', 'Ordered Set'], hasSolution: False, hasVideoSolution: False, 2022: questionNo: 2022, acRate: 61.82680714244704, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Convert 1D Array Into 2D Array, slug: convert-1d-array-into-2d-array, url: https://leetcode.com/problems/convert-1d-array-into-2d-array, topics: ['Array', 'Matrix', 'Simulation'], hasSolution: False, hasVideoSolution: False, 2023: questionNo: 2023, acRate: 74.91969200471355, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Number of Pairs of Strings With Concatenation Equal to Target, slug: number-of-pairs-of-strings-with-concatenation-equal-to-target, url: https://leetcode.com/problems/number-of-pairs-of-strings-with-concatenation-equal-to-target, topics: ['Array', 'Hash Table', 'String', 'Counting'], hasSolution: False, hasVideoSolution: False, 2024: questionNo: 2024, acRate: 67.31237574552684, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximize the Confusion of an Exam, slug: maximize-the-confusion-of-an-exam, url: https://leetcode.com/problems/maximize-the-confusion-of-an-exam, topics: ['String', 'Binary Search', 'Sliding Window', 'Prefix Sum'], hasSolution: True, hasVideoSolution: False, 2025: questionNo: 2025, acRate: 34.39243269463982, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Maximum Number of Ways to Partition an Array, slug: maximum-number-of-ways-to-partition-an-array, url: https://leetcode.com/problems/maximum-number-of-ways-to-partition-an-array, topics: ['Array', 'Hash Table', 'Counting', 'Enumeration', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 2026: questionNo: 2026, acRate: 84.32113179039901, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Low-Quality Problems, slug: low-quality-problems, url: https://leetcode.com/problems/low-quality-problems, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 2027: questionNo: 2027, acRate: 54.90780754825698, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Minimum Moves to Convert String, slug: minimum-moves-to-convert-string, url: https://leetcode.com/problems/minimum-moves-to-convert-string, topics: ['String', 'Greedy'], hasSolution: False, hasVideoSolution: False, 2028: questionNo: 2028, acRate: 46.75006203564495, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Find Missing Observations, slug: find-missing-observations, url: https://leetcode.com/problems/find-missing-observations, topics: ['Array', 'Math', 'Simulation'], hasSolution: False, hasVideoSolution: False, 2029: questionNo: 2029, acRate: 28.376004863878947, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Stone Game IX, slug: stone-game-ix, url: https://leetcode.com/problems/stone-game-ix, topics: ['Array', 'Math', 'Greedy', 'Counting', 'Game Theory'], hasSolution: False, hasVideoSolution: False, 2030: questionNo: 2030, acRate: 39.271127866792334, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Smallest K-Length Subsequence With Occurrences of a Letter, slug: smallest-k-length-subsequence-with-occurrences-of-a-letter, url: https://leetcode.com/problems/smallest-k-length-subsequence-with-occurrences-of-a-letter, topics: ['String', 'Stack', 'Greedy', 'Monotonic Stack'], hasSolution: False, hasVideoSolution: False, 2031: questionNo: 2031, acRate: 52.04290091930541, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Count Subarrays With More Ones Than Zeros, slug: count-subarrays-with-more-ones-than-zeros, url: https://leetcode.com/problems/count-subarrays-with-more-ones-than-zeros, topics: ['Array', 'Binary Search', 'Divide and Conquer', 'Binary Indexed Tree', 'Segment Tree', 'Merge Sort', 'Ordered Set'], hasSolution: False, hasVideoSolution: False, 2032: questionNo: 2032, acRate: 75.33477184743289, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Two Out of Three, slug: two-out-of-three, url: https://leetcode.com/problems/two-out-of-three, topics: ['Array', 'Hash Table', 'Bit Manipulation'], hasSolution: False, hasVideoSolution: False, 2033: questionNo: 2033, acRate: 53.33745364647713, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Operations to Make a Uni-Value Grid, slug: minimum-operations-to-make-a-uni-value-grid, url: https://leetcode.com/problems/minimum-operations-to-make-a-uni-value-grid, topics: ['Array', 'Math', 'Sorting', 'Matrix'], hasSolution: False, hasVideoSolution: False, 2034: questionNo: 2034, acRate: 48.65886177934319, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Stock Price Fluctuation , slug: stock-price-fluctuation, url: https://leetcode.com/problems/stock-price-fluctuation, topics: ['Hash Table', 'Design', 'Heap (Priority Queue)', 'Data Stream', 'Ordered Set'], hasSolution: True, hasVideoSolution: False, 2035: questionNo: 2035, acRate: 20.429052883090833, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Partition Array Into Two Arrays to Minimize Sum Difference, slug: partition-array-into-two-arrays-to-minimize-sum-difference, url: https://leetcode.com/problems/partition-array-into-two-arrays-to-minimize-sum-difference, topics: ['Array', 'Two Pointers', 'Binary Search', 'Dynamic Programming', 'Bit Manipulation', 'Ordered Set', 'Bitmask'], hasSolution: False, hasVideoSolution: False, 2036: questionNo: 2036, acRate: 40.198511166253105, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Maximum Alternating Subarray Sum, slug: maximum-alternating-subarray-sum, url: https://leetcode.com/problems/maximum-alternating-subarray-sum, topics: ['Array', 'Dynamic Programming'], hasSolution: False, hasVideoSolution: False, 2037: questionNo: 2037, acRate: 87.72094018236757, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Minimum Number of Moves to Seat Everyone, slug: minimum-number-of-moves-to-seat-everyone, url: https://leetcode.com/problems/minimum-number-of-moves-to-seat-everyone, topics: ['Array', 'Greedy', 'Sorting'], hasSolution: True, hasVideoSolution: False, 2038: questionNo: 2038, acRate: 62.7859744752221, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Remove Colored Pieces if Both Neighbors are the Same Color, slug: remove-colored-pieces-if-both-neighbors-are-the-same-color, url: https://leetcode.com/problems/remove-colored-pieces-if-both-neighbors-are-the-same-color, topics: ['Math', 'String', 'Greedy', 'Game Theory'], hasSolution: True, hasVideoSolution: False, 2039: questionNo: 2039, acRate: 51.92869975693098, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: The Time When the Network Becomes Idle, slug: the-time-when-the-network-becomes-idle, url: https://leetcode.com/problems/the-time-when-the-network-becomes-idle, topics: ['Array', 'Breadth-First Search', 'Graph'], hasSolution: False, hasVideoSolution: False, 2040: questionNo: 2040, acRate: 29.045060145927827, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Kth Smallest Product of Two Sorted Arrays, slug: kth-smallest-product-of-two-sorted-arrays, url: https://leetcode.com/problems/kth-smallest-product-of-two-sorted-arrays, topics: ['Array', 'Binary Search'], hasSolution: False, hasVideoSolution: False, 2041: questionNo: 2041, acRate: 78.26542056074767, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Accepted Candidates From the Interviews, slug: accepted-candidates-from-the-interviews, url: https://leetcode.com/problems/accepted-candidates-from-the-interviews, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 2042: questionNo: 2042, acRate: 69.74503652369357, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Check if Numbers Are Ascending in a Sentence, slug: check-if-numbers-are-ascending-in-a-sentence, url: https://leetcode.com/problems/check-if-numbers-are-ascending-in-a-sentence, topics: ['String'], hasSolution: False, hasVideoSolution: False, 2043: questionNo: 2043, acRate: 63.981263597211736, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Simple Bank System, slug: simple-bank-system, url: https://leetcode.com/problems/simple-bank-system, topics: ['Array', 'Hash Table', 'Design', 'Simulation'], hasSolution: False, hasVideoSolution: False, 2044: questionNo: 2044, acRate: 77.73885350318471, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Count Number of Maximum Bitwise-OR Subsets, slug: count-number-of-maximum-bitwise-or-subsets, url: https://leetcode.com/problems/count-number-of-maximum-bitwise-or-subsets, topics: ['Array', 'Backtracking', 'Bit Manipulation', 'Enumeration'], hasSolution: False, hasVideoSolution: False, 2045: questionNo: 2045, acRate: 41.103443492735025, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Second Minimum Time to Reach Destination, slug: second-minimum-time-to-reach-destination, url: https://leetcode.com/problems/second-minimum-time-to-reach-destination, topics: ['Breadth-First Search', 'Graph', 'Shortest Path'], hasSolution: True, hasVideoSolution: False, 2046: questionNo: 2046, acRate: 67.13570981863664, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Sort Linked List Already Sorted Using Absolute Values, slug: sort-linked-list-already-sorted-using-absolute-values, url: https://leetcode.com/problems/sort-linked-list-already-sorted-using-absolute-values, topics: ['Linked List', 'Two Pointers', 'Sorting'], hasSolution: False, hasVideoSolution: False, 2047: questionNo: 2047, acRate: 29.128528946047194, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Number of Valid Words in a Sentence, slug: number-of-valid-words-in-a-sentence, url: https://leetcode.com/problems/number-of-valid-words-in-a-sentence, topics: ['String'], hasSolution: False, hasVideoSolution: False, 2048: questionNo: 2048, acRate: 48.586634710277735, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Next Greater Numerically Balanced Number, slug: next-greater-numerically-balanced-number, url: https://leetcode.com/problems/next-greater-numerically-balanced-number, topics: ['Math', 'Backtracking', 'Enumeration'], hasSolution: False, hasVideoSolution: False, 2049: questionNo: 2049, acRate: 49.85006142062288, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Count Nodes With the Highest Score, slug: count-nodes-with-the-highest-score, url: https://leetcode.com/problems/count-nodes-with-the-highest-score, topics: ['Array', 'Tree', 'Depth-First Search', 'Binary Tree'], hasSolution: False, hasVideoSolution: False, 2050: questionNo: 2050, acRate: 67.17603246997783, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Parallel Courses III, slug: parallel-courses-iii, url: https://leetcode.com/problems/parallel-courses-iii, topics: ['Array', 'Dynamic Programming', 'Graph', 'Topological Sort'], hasSolution: True, hasVideoSolution: False, 2051: questionNo: 2051, acRate: 70.1093560145808, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: The Category of Each Member in the Store, slug: the-category-of-each-member-in-the-store, url: https://leetcode.com/problems/the-category-of-each-member-in-the-store, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 2052: questionNo: 2052, acRate: 49.40700808625337, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Minimum Cost to Separate Sentence Into Rows, slug: minimum-cost-to-separate-sentence-into-rows, url: https://leetcode.com/problems/minimum-cost-to-separate-sentence-into-rows, topics: ['Array', 'Dynamic Programming'], hasSolution: False, hasVideoSolution: False, 2053: questionNo: 2053, acRate: 73.07760355618463, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Kth Distinct String in an Array, slug: kth-distinct-string-in-an-array, url: https://leetcode.com/problems/kth-distinct-string-in-an-array, topics: ['Array', 'Hash Table', 'String', 'Counting'], hasSolution: False, hasVideoSolution: False, 2054: questionNo: 2054, acRate: 46.6589834089654, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Two Best Non-Overlapping Events, slug: two-best-non-overlapping-events, url: https://leetcode.com/problems/two-best-non-overlapping-events, topics: ['Array', 'Binary Search', 'Dynamic Programming', 'Sorting', 'Heap (Priority Queue)'], hasSolution: False, hasVideoSolution: False, 2055: questionNo: 2055, acRate: 45.021595257254525, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Plates Between Candles, slug: plates-between-candles, url: https://leetcode.com/problems/plates-between-candles, topics: ['Array', 'String', 'Binary Search', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 2056: questionNo: 2056, acRate: 52.57214554579674, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Number of Valid Move Combinations On Chessboard, slug: number-of-valid-move-combinations-on-chessboard, url: https://leetcode.com/problems/number-of-valid-move-combinations-on-chessboard, topics: ['Array', 'String', 'Backtracking', 'Simulation'], hasSolution: False, hasVideoSolution: False, 2057: questionNo: 2057, acRate: 72.98448913337542, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Smallest Index With Equal Value, slug: smallest-index-with-equal-value, url: https://leetcode.com/problems/smallest-index-with-equal-value, topics: ['Array'], hasSolution: False, hasVideoSolution: False, 2058: questionNo: 2058, acRate: 69.7259127819792, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Find the Minimum and Maximum Number of Nodes Between Critical Points, slug: find-the-minimum-and-maximum-number-of-nodes-between-critical-points, url: https://leetcode.com/problems/find-the-minimum-and-maximum-number-of-nodes-between-critical-points, topics: ['Linked List'], hasSolution: True, hasVideoSolution: False, 2059: questionNo: 2059, acRate: 49.36764447567188, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Operations to Convert Number, slug: minimum-operations-to-convert-number, url: https://leetcode.com/problems/minimum-operations-to-convert-number, topics: ['Array', 'Breadth-First Search'], hasSolution: False, hasVideoSolution: False, 2060: questionNo: 2060, acRate: 43.764742884101274, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Check if an Original String Exists Given Two Encoded Strings, slug: check-if-an-original-string-exists-given-two-encoded-strings, url: https://leetcode.com/problems/check-if-an-original-string-exists-given-two-encoded-strings, topics: ['String', 'Dynamic Programming'], hasSolution: False, hasVideoSolution: False, 2061: questionNo: 2061, acRate: 62.524132999642475, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Number of Spaces Cleaning Robot Cleaned, slug: number-of-spaces-cleaning-robot-cleaned, url: https://leetcode.com/problems/number-of-spaces-cleaning-robot-cleaned, topics: ['Array', 'Matrix', 'Simulation'], hasSolution: True, hasVideoSolution: False, 2062: questionNo: 2062, acRate: 67.94571372778753, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Count Vowel Substrings of a String, slug: count-vowel-substrings-of-a-string, url: https://leetcode.com/problems/count-vowel-substrings-of-a-string, topics: ['Hash Table', 'String'], hasSolution: False, hasVideoSolution: False, 2063: questionNo: 2063, acRate: 54.04292374956913, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Vowels of All Substrings, slug: vowels-of-all-substrings, url: https://leetcode.com/problems/vowels-of-all-substrings, topics: ['Math', 'String', 'Dynamic Programming', 'Combinatorics'], hasSolution: False, hasVideoSolution: False, 2064: questionNo: 2064, acRate: 53.23498703310767, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimized Maximum of Products Distributed to Any Store, slug: minimized-maximum-of-products-distributed-to-any-store, url: https://leetcode.com/problems/minimized-maximum-of-products-distributed-to-any-store, topics: ['Array', 'Binary Search'], hasSolution: False, hasVideoSolution: False, 2065: questionNo: 2065, acRate: 58.71722276612071, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Maximum Path Quality of a Graph, slug: maximum-path-quality-of-a-graph, url: https://leetcode.com/problems/maximum-path-quality-of-a-graph, topics: ['Array', 'Backtracking', 'Graph'], hasSolution: False, hasVideoSolution: False, 2066: questionNo: 2066, acRate: 81.98689026985613, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Account Balance, slug: account-balance, url: https://leetcode.com/problems/account-balance, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 2067: questionNo: 2067, acRate: 46.90454950936664, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Number of Equal Count Substrings, slug: number-of-equal-count-substrings, url: https://leetcode.com/problems/number-of-equal-count-substrings, topics: ['String', 'Counting', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 2068: questionNo: 2068, acRate: 63.832115540255565, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Check Whether Two Strings are Almost Equivalent, slug: check-whether-two-strings-are-almost-equivalent, url: https://leetcode.com/problems/check-whether-two-strings-are-almost-equivalent, topics: ['Hash Table', 'String', 'Counting'], hasSolution: True, hasVideoSolution: False, 2069: questionNo: 2069, acRate: 26.302374457809773, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Walking Robot Simulation II, slug: walking-robot-simulation-ii, url: https://leetcode.com/problems/walking-robot-simulation-ii, topics: ['Design', 'Simulation'], hasSolution: False, hasVideoSolution: False, 2070: questionNo: 2070, acRate: 49.89230018093569, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Most Beautiful Item for Each Query, slug: most-beautiful-item-for-each-query, url: https://leetcode.com/problems/most-beautiful-item-for-each-query, topics: ['Array', 'Binary Search', 'Sorting'], hasSolution: False, hasVideoSolution: False, 2071: questionNo: 2071, acRate: 33.686149844664406, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Maximum Number of Tasks You Can Assign, slug: maximum-number-of-tasks-you-can-assign, url: https://leetcode.com/problems/maximum-number-of-tasks-you-can-assign, topics: ['Array', 'Binary Search', 'Greedy', 'Queue', 'Sorting', 'Monotonic Queue'], hasSolution: False, hasVideoSolution: False, 2072: questionNo: 2072, acRate: 73.86745796241345, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: The Winner University, slug: the-winner-university, url: https://leetcode.com/problems/the-winner-university, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 2073: questionNo: 2073, acRate: 69.91254210935476, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Time Needed to Buy Tickets, slug: time-needed-to-buy-tickets, url: https://leetcode.com/problems/time-needed-to-buy-tickets, topics: ['Array', 'Queue', 'Simulation'], hasSolution: True, hasVideoSolution: False, 2074: questionNo: 2074, acRate: 58.091411135225734, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Reverse Nodes in Even Length Groups, slug: reverse-nodes-in-even-length-groups, url: https://leetcode.com/problems/reverse-nodes-in-even-length-groups, topics: ['Linked List'], hasSolution: False, hasVideoSolution: False, 2075: questionNo: 2075, acRate: 48.96975163035937, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Decode the Slanted Ciphertext, slug: decode-the-slanted-ciphertext, url: https://leetcode.com/problems/decode-the-slanted-ciphertext, topics: ['String', 'Simulation'], hasSolution: False, hasVideoSolution: False, 2076: questionNo: 2076, acRate: 55.26332447145208, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Process Restricted Friend Requests, slug: process-restricted-friend-requests, url: https://leetcode.com/problems/process-restricted-friend-requests, topics: ['Union Find', 'Graph'], hasSolution: False, hasVideoSolution: False, 2077: questionNo: 2077, acRate: 55.192260592701444, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Paths in Maze That Lead to Same Room, slug: paths-in-maze-that-lead-to-same-room, url: https://leetcode.com/problems/paths-in-maze-that-lead-to-same-room, topics: ['Graph'], hasSolution: False, hasVideoSolution: False, 2078: questionNo: 2078, acRate: 66.08577021175634, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Two Furthest Houses With Different Colors, slug: two-furthest-houses-with-different-colors, url: https://leetcode.com/problems/two-furthest-houses-with-different-colors, topics: ['Array', 'Greedy'], hasSolution: False, hasVideoSolution: False, 2079: questionNo: 2079, acRate: 79.69913246785208, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Watering Plants, slug: watering-plants, url: https://leetcode.com/problems/watering-plants, topics: ['Array', 'Simulation'], hasSolution: False, hasVideoSolution: False, 2080: questionNo: 2080, acRate: 40.18342138551976, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Range Frequency Queries, slug: range-frequency-queries, url: https://leetcode.com/problems/range-frequency-queries, topics: ['Array', 'Hash Table', 'Binary Search', 'Design', 'Segment Tree'], hasSolution: False, hasVideoSolution: False, 2081: questionNo: 2081, acRate: 42.432338250667904, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Sum of k-Mirror Numbers, slug: sum-of-k-mirror-numbers, url: https://leetcode.com/problems/sum-of-k-mirror-numbers, topics: ['Math', 'Enumeration'], hasSolution: False, hasVideoSolution: False, 2082: questionNo: 2082, acRate: 77.23661716890692, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: The Number of Rich Customers, slug: the-number-of-rich-customers, url: https://leetcode.com/problems/the-number-of-rich-customers, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 2083: questionNo: 2083, acRate: 74.26401869158879, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Substrings That Begin and End With the Same Letter, slug: substrings-that-begin-and-end-with-the-same-letter, url: https://leetcode.com/problems/substrings-that-begin-and-end-with-the-same-letter, topics: ['Hash Table', 'Math', 'String', 'Counting', 'Prefix Sum'], hasSolution: True, hasVideoSolution: False, 2084: questionNo: 2084, acRate: 86.98568507157464, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Drop Type 1 Orders for Customers With Type 0 Orders, slug: drop-type-1-orders-for-customers-with-type-0-orders, url: https://leetcode.com/problems/drop-type-1-orders-for-customers-with-type-0-orders, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 2085: questionNo: 2085, acRate: 70.58493548880615, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Count Common Words With One Occurrence, slug: count-common-words-with-one-occurrence, url: https://leetcode.com/problems/count-common-words-with-one-occurrence, topics: ['Array', 'Hash Table', 'String', 'Counting'], hasSolution: False, hasVideoSolution: False, 2086: questionNo: 2086, acRate: 46.68651138536416, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Number of Food Buckets to Feed the Hamsters, slug: minimum-number-of-food-buckets-to-feed-the-hamsters, url: https://leetcode.com/problems/minimum-number-of-food-buckets-to-feed-the-hamsters, topics: ['String', 'Dynamic Programming', 'Greedy'], hasSolution: False, hasVideoSolution: False, 2087: questionNo: 2087, acRate: 51.0266138481281, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Cost Homecoming of a Robot in a Grid, slug: minimum-cost-homecoming-of-a-robot-in-a-grid, url: https://leetcode.com/problems/minimum-cost-homecoming-of-a-robot-in-a-grid, topics: ['Array', 'Greedy'], hasSolution: False, hasVideoSolution: False, 2088: questionNo: 2088, acRate: 64.95827583941126, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Count Fertile Pyramids in a Land, slug: count-fertile-pyramids-in-a-land, url: https://leetcode.com/problems/count-fertile-pyramids-in-a-land, topics: ['Array', 'Dynamic Programming', 'Matrix'], hasSolution: False, hasVideoSolution: False, 2089: questionNo: 2089, acRate: 76.45692628325023, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Find Target Indices After Sorting Array, slug: find-target-indices-after-sorting-array, url: https://leetcode.com/problems/find-target-indices-after-sorting-array, topics: ['Array', 'Binary Search', 'Sorting'], hasSolution: False, hasVideoSolution: False, 2090: questionNo: 2090, acRate: 46.11149220620001, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: K Radius Subarray Averages, slug: k-radius-subarray-averages, url: https://leetcode.com/problems/k-radius-subarray-averages, topics: ['Array', 'Sliding Window'], hasSolution: True, hasVideoSolution: False, 2091: questionNo: 2091, acRate: 54.96354179628201, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Removing Minimum and Maximum From Array, slug: removing-minimum-and-maximum-from-array, url: https://leetcode.com/problems/removing-minimum-and-maximum-from-array, topics: ['Array', 'Greedy'], hasSolution: False, hasVideoSolution: False, 2092: questionNo: 2092, acRate: 45.56355918428007, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Find All People With Secret, slug: find-all-people-with-secret, url: https://leetcode.com/problems/find-all-people-with-secret, topics: ['Depth-First Search', 'Breadth-First Search', 'Union Find', 'Graph', 'Sorting'], hasSolution: True, hasVideoSolution: False, 2093: questionNo: 2093, acRate: 58.45281988256179, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Minimum Cost to Reach City With Discounts, slug: minimum-cost-to-reach-city-with-discounts, url: https://leetcode.com/problems/minimum-cost-to-reach-city-with-discounts, topics: ['Graph', 'Heap (Priority Queue)', 'Shortest Path'], hasSolution: True, hasVideoSolution: False, 2094: questionNo: 2094, acRate: 60.698189739352514, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Finding 3-Digit Even Numbers, slug: finding-3-digit-even-numbers, url: https://leetcode.com/problems/finding-3-digit-even-numbers, topics: ['Array', 'Hash Table', 'Sorting', 'Enumeration'], hasSolution: False, hasVideoSolution: False, 2095: questionNo: 2095, acRate: 59.32780856903659, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Delete the Middle Node of a Linked List, slug: delete-the-middle-node-of-a-linked-list, url: https://leetcode.com/problems/delete-the-middle-node-of-a-linked-list, topics: ['Linked List', 'Two Pointers'], hasSolution: True, hasVideoSolution: False, 2096: questionNo: 2096, acRate: 56.344146290198275, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Step-By-Step Directions From a Binary Tree Node to Another, slug: step-by-step-directions-from-a-binary-tree-node-to-another, url: https://leetcode.com/problems/step-by-step-directions-from-a-binary-tree-node-to-another, topics: ['String', 'Tree', 'Depth-First Search', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 2097: questionNo: 2097, acRate: 43.89643861293346, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Valid Arrangement of Pairs, slug: valid-arrangement-of-pairs, url: https://leetcode.com/problems/valid-arrangement-of-pairs, topics: ['Depth-First Search', 'Graph', 'Eulerian Circuit'], hasSolution: False, hasVideoSolution: False, 2098: questionNo: 2098, acRate: 36.48899188876014, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Subsequence of Size K With the Largest Even Sum, slug: subsequence-of-size-k-with-the-largest-even-sum, url: https://leetcode.com/problems/subsequence-of-size-k-with-the-largest-even-sum, topics: ['Array', 'Greedy', 'Sorting'], hasSolution: False, hasVideoSolution: False, 2099: questionNo: 2099, acRate: 43.79388333783419, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Find Subsequence of Length K With the Largest Sum, slug: find-subsequence-of-length-k-with-the-largest-sum, url: https://leetcode.com/problems/find-subsequence-of-length-k-with-the-largest-sum, topics: ['Array', 'Hash Table', 'Sorting', 'Heap (Priority Queue)'], hasSolution: False, hasVideoSolution: False, 2100: questionNo: 2100, acRate: 49.552375710878735, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Find Good Days to Rob the Bank, slug: find-good-days-to-rob-the-bank, url: https://leetcode.com/problems/find-good-days-to-rob-the-bank, topics: ['Array', 'Dynamic Programming', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 2101: questionNo: 2101, acRate: 48.72478643079738, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Detonate the Maximum Bombs, slug: detonate-the-maximum-bombs, url: https://leetcode.com/problems/detonate-the-maximum-bombs, topics: ['Array', 'Math', 'Depth-First Search', 'Breadth-First Search', 'Graph', 'Geometry'], hasSolution: True, hasVideoSolution: False, 2102: questionNo: 2102, acRate: 64.61973495399678, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Sequentially Ordinal Rank Tracker, slug: sequentially-ordinal-rank-tracker, url: https://leetcode.com/problems/sequentially-ordinal-rank-tracker, topics: ['Design', 'Heap (Priority Queue)', 'Data Stream', 'Ordered Set'], hasSolution: False, hasVideoSolution: False, 2103: questionNo: 2103, acRate: 80.8268103853886, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Rings and Rods, slug: rings-and-rods, url: https://leetcode.com/problems/rings-and-rods, topics: ['Hash Table', 'String'], hasSolution: False, hasVideoSolution: False, 2104: questionNo: 2104, acRate: 61.14904484382349, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Sum of Subarray Ranges, slug: sum-of-subarray-ranges, url: https://leetcode.com/problems/sum-of-subarray-ranges, topics: ['Array', 'Stack', 'Monotonic Stack'], hasSolution: True, hasVideoSolution: False, 2105: questionNo: 2105, acRate: 48.34139102962998, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Watering Plants II, slug: watering-plants-ii, url: https://leetcode.com/problems/watering-plants-ii, topics: ['Array', 'Two Pointers', 'Simulation'], hasSolution: False, hasVideoSolution: False, 2106: questionNo: 2106, acRate: 36.29738562091504, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Maximum Fruits Harvested After at Most K Steps, slug: maximum-fruits-harvested-after-at-most-k-steps, url: https://leetcode.com/problems/maximum-fruits-harvested-after-at-most-k-steps, topics: ['Array', 'Binary Search', 'Sliding Window', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 2107: questionNo: 2107, acRate: 55.61825726141079, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Number of Unique Flavors After Sharing K Candies, slug: number-of-unique-flavors-after-sharing-k-candies, url: https://leetcode.com/problems/number-of-unique-flavors-after-sharing-k-candies, topics: ['Array', 'Hash Table', 'Sliding Window'], hasSolution: False, hasVideoSolution: False, 2108: questionNo: 2108, acRate: 83.8707847158983, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Find First Palindromic String in the Array, slug: find-first-palindromic-string-in-the-array, url: https://leetcode.com/problems/find-first-palindromic-string-in-the-array, topics: ['Array', 'Two Pointers', 'String'], hasSolution: True, hasVideoSolution: False, 2109: questionNo: 2109, acRate: 59.08311081872476, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Adding Spaces to a String, slug: adding-spaces-to-a-string, url: https://leetcode.com/problems/adding-spaces-to-a-string, topics: ['Array', 'Two Pointers', 'String', 'Simulation'], hasSolution: False, hasVideoSolution: False, 2110: questionNo: 2110, acRate: 59.0714229217749, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Number of Smooth Descent Periods of a Stock, slug: number-of-smooth-descent-periods-of-a-stock, url: https://leetcode.com/problems/number-of-smooth-descent-periods-of-a-stock, topics: ['Array', 'Math', 'Dynamic Programming'], hasSolution: False, hasVideoSolution: False, 2111: questionNo: 2111, acRate: 38.70089459354337, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Minimum Operations to Make the Array K-Increasing, slug: minimum-operations-to-make-the-array-k-increasing, url: https://leetcode.com/problems/minimum-operations-to-make-the-array-k-increasing, topics: ['Array', 'Binary Search'], hasSolution: False, hasVideoSolution: False, 2112: questionNo: 2112, acRate: 70.08236434108527, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: The Airport With the Most Traffic, slug: the-airport-with-the-most-traffic, url: https://leetcode.com/problems/the-airport-with-the-most-traffic, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 2113: questionNo: 2113, acRate: 73.79598028062192, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Elements in Array After Removing and Replacing Elements, slug: elements-in-array-after-removing-and-replacing-elements, url: https://leetcode.com/problems/elements-in-array-after-removing-and-replacing-elements, topics: ['Array'], hasSolution: False, hasVideoSolution: False, 2114: questionNo: 2114, acRate: 86.532723006055, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Maximum Number of Words Found in Sentences, slug: maximum-number-of-words-found-in-sentences, url: https://leetcode.com/problems/maximum-number-of-words-found-in-sentences, topics: ['Array', 'String'], hasSolution: False, hasVideoSolution: False, 2115: questionNo: 2115, acRate: 50.14798908943183, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Find All Possible Recipes from Given Supplies, slug: find-all-possible-recipes-from-given-supplies, url: https://leetcode.com/problems/find-all-possible-recipes-from-given-supplies, topics: ['Array', 'Hash Table', 'String', 'Graph', 'Topological Sort'], hasSolution: False, hasVideoSolution: False, 2116: questionNo: 2116, acRate: 31.988079725881956, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Check if a Parentheses String Can Be Valid, slug: check-if-a-parentheses-string-can-be-valid, url: https://leetcode.com/problems/check-if-a-parentheses-string-can-be-valid, topics: ['String', 'Stack', 'Greedy'], hasSolution: False, hasVideoSolution: False, 2117: questionNo: 2117, acRate: 26.18923157344485, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Abbreviating the Product of a Range, slug: abbreviating-the-product-of-a-range, url: https://leetcode.com/problems/abbreviating-the-product-of-a-range, topics: ['Math'], hasSolution: False, hasVideoSolution: False, 2118: questionNo: 2118, acRate: 55.499153976311334, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Build the Equation, slug: build-the-equation, url: https://leetcode.com/problems/build-the-equation, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 2119: questionNo: 2119, acRate: 80.09850307051164, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: A Number After a Double Reversal, slug: a-number-after-a-double-reversal, url: https://leetcode.com/problems/a-number-after-a-double-reversal, topics: ['Math'], hasSolution: False, hasVideoSolution: False, 2120: questionNo: 2120, acRate: 82.68598277212216, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Execution of All Suffix Instructions Staying in a Grid, slug: execution-of-all-suffix-instructions-staying-in-a-grid, url: https://leetcode.com/problems/execution-of-all-suffix-instructions-staying-in-a-grid, topics: ['String', 'Simulation'], hasSolution: False, hasVideoSolution: False, 2121: questionNo: 2121, acRate: 44.4605971185558, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Intervals Between Identical Elements, slug: intervals-between-identical-elements, url: https://leetcode.com/problems/intervals-between-identical-elements, topics: ['Array', 'Hash Table', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 2122: questionNo: 2122, acRate: 39.432233769055294, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Recover the Original Array, slug: recover-the-original-array, url: https://leetcode.com/problems/recover-the-original-array, topics: ['Array', 'Hash Table', 'Sorting', 'Enumeration'], hasSolution: False, hasVideoSolution: False, 2123: questionNo: 2123, acRate: 40.70441373160945, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Minimum Operations to Remove Adjacent Ones in Matrix, slug: minimum-operations-to-remove-adjacent-ones-in-matrix, url: https://leetcode.com/problems/minimum-operations-to-remove-adjacent-ones-in-matrix, topics: ['Array', 'Graph', 'Matrix'], hasSolution: False, hasVideoSolution: False, 2124: questionNo: 2124, acRate: 71.5827656374414, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Check if All A's Appears Before All B's, slug: check-if-all-as-appears-before-all-bs, url: https://leetcode.com/problems/check-if-all-as-appears-before-all-bs, topics: ['String'], hasSolution: False, hasVideoSolution: False, 2125: questionNo: 2125, acRate: 85.61544064093226, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Number of Laser Beams in a Bank, slug: number-of-laser-beams-in-a-bank, url: https://leetcode.com/problems/number-of-laser-beams-in-a-bank, topics: ['Array', 'Math', 'String', 'Matrix'], hasSolution: True, hasVideoSolution: False, 2126: questionNo: 2126, acRate: 51.69514388489208, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Destroying Asteroids, slug: destroying-asteroids, url: https://leetcode.com/problems/destroying-asteroids, topics: ['Array', 'Greedy', 'Sorting'], hasSolution: False, hasVideoSolution: False, 2127: questionNo: 2127, acRate: 37.30260588136823, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Maximum Employees to Be Invited to a Meeting, slug: maximum-employees-to-be-invited-to-a-meeting, url: https://leetcode.com/problems/maximum-employees-to-be-invited-to-a-meeting, topics: ['Depth-First Search', 'Graph', 'Topological Sort'], hasSolution: False, hasVideoSolution: False, 2128: questionNo: 2128, acRate: 76.25841798881406, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Remove All Ones With Row and Column Flips, slug: remove-all-ones-with-row-and-column-flips, url: https://leetcode.com/problems/remove-all-ones-with-row-and-column-flips, topics: ['Array', 'Math', 'Bit Manipulation', 'Matrix'], hasSolution: False, hasVideoSolution: False, 2129: questionNo: 2129, acRate: 64.54356039836904, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Capitalize the Title, slug: capitalize-the-title, url: https://leetcode.com/problems/capitalize-the-title, topics: ['String'], hasSolution: False, hasVideoSolution: False, 2130: questionNo: 2130, acRate: 80.93727873098264, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum Twin Sum of a Linked List, slug: maximum-twin-sum-of-a-linked-list, url: https://leetcode.com/problems/maximum-twin-sum-of-a-linked-list, topics: ['Linked List', 'Two Pointers', 'Stack'], hasSolution: True, hasVideoSolution: False, 2131: questionNo: 2131, acRate: 48.05421434353377, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Longest Palindrome by Concatenating Two Letter Words, slug: longest-palindrome-by-concatenating-two-letter-words, url: https://leetcode.com/problems/longest-palindrome-by-concatenating-two-letter-words, topics: ['Array', 'Hash Table', 'String', 'Greedy', 'Counting'], hasSolution: True, hasVideoSolution: False, 2132: questionNo: 2132, acRate: 32.33932704290547, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Stamping the Grid, slug: stamping-the-grid, url: https://leetcode.com/problems/stamping-the-grid, topics: ['Array', 'Greedy', 'Matrix', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 2133: questionNo: 2133, acRate: 51.75529853334149, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Check if Every Row and Column Contains All Numbers, slug: check-if-every-row-and-column-contains-all-numbers, url: https://leetcode.com/problems/check-if-every-row-and-column-contains-all-numbers, topics: ['Array', 'Hash Table', 'Matrix'], hasSolution: False, hasVideoSolution: False, 2134: questionNo: 2134, acRate: 52.69416774938646, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Swaps to Group All 1's Together II, slug: minimum-swaps-to-group-all-1s-together-ii, url: https://leetcode.com/problems/minimum-swaps-to-group-all-1s-together-ii, topics: ['Array', 'Sliding Window'], hasSolution: False, hasVideoSolution: False, 2135: questionNo: 2135, acRate: 43.10127676388512, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Count Words Obtained After Adding a Letter, slug: count-words-obtained-after-adding-a-letter, url: https://leetcode.com/problems/count-words-obtained-after-adding-a-letter, topics: ['Array', 'Hash Table', 'String', 'Bit Manipulation', 'Sorting'], hasSolution: False, hasVideoSolution: False, 2136: questionNo: 2136, acRate: 71.77864990090173, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Earliest Possible Day of Full Bloom, slug: earliest-possible-day-of-full-bloom, url: https://leetcode.com/problems/earliest-possible-day-of-full-bloom, topics: ['Array', 'Greedy', 'Sorting'], hasSolution: True, hasVideoSolution: False, 2137: questionNo: 2137, acRate: 67.61394101876675, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Pour Water Between Buckets to Make Water Levels Equal, slug: pour-water-between-buckets-to-make-water-levels-equal, url: https://leetcode.com/problems/pour-water-between-buckets-to-make-water-levels-equal, topics: ['Array', 'Binary Search'], hasSolution: False, hasVideoSolution: False, 2138: questionNo: 2138, acRate: 66.74936236045102, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Divide a String Into Groups of Size k, slug: divide-a-string-into-groups-of-size-k, url: https://leetcode.com/problems/divide-a-string-into-groups-of-size-k, topics: ['String', 'Simulation'], hasSolution: False, hasVideoSolution: False, 2139: questionNo: 2139, acRate: 50.88685575568813, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Moves to Reach Target Score, slug: minimum-moves-to-reach-target-score, url: https://leetcode.com/problems/minimum-moves-to-reach-target-score, topics: ['Math', 'Greedy'], hasSolution: False, hasVideoSolution: False, 2140: questionNo: 2140, acRate: 55.03286759813706, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Solving Questions With Brainpower, slug: solving-questions-with-brainpower, url: https://leetcode.com/problems/solving-questions-with-brainpower, topics: ['Array', 'Dynamic Programming'], hasSolution: True, hasVideoSolution: False, 2141: questionNo: 2141, acRate: 49.98517835380916, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Maximum Running Time of N Computers, slug: maximum-running-time-of-n-computers, url: https://leetcode.com/problems/maximum-running-time-of-n-computers, topics: ['Array', 'Binary Search', 'Greedy', 'Sorting'], hasSolution: True, hasVideoSolution: False, 2142: questionNo: 2142, acRate: 48.35595129539237, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: The Number of Passengers in Each Bus I, slug: the-number-of-passengers-in-each-bus-i, url: https://leetcode.com/problems/the-number-of-passengers-in-each-bus-i, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 2143: questionNo: 2143, acRate: 51.78826895565093, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Choose Numbers From Two Arrays in Range, slug: choose-numbers-from-two-arrays-in-range, url: https://leetcode.com/problems/choose-numbers-from-two-arrays-in-range, topics: ['Array', 'Dynamic Programming'], hasSolution: False, hasVideoSolution: False, 2144: questionNo: 2144, acRate: 61.33745129027977, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Minimum Cost of Buying Candies With Discount, slug: minimum-cost-of-buying-candies-with-discount, url: https://leetcode.com/problems/minimum-cost-of-buying-candies-with-discount, topics: ['Array', 'Greedy', 'Sorting'], hasSolution: False, hasVideoSolution: False, 2145: questionNo: 2145, acRate: 38.307689051620144, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Count the Hidden Sequences, slug: count-the-hidden-sequences, url: https://leetcode.com/problems/count-the-hidden-sequences, topics: ['Array', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 2146: questionNo: 2146, acRate: 43.25363286894408, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: K Highest Ranked Items Within a Price Range, slug: k-highest-ranked-items-within-a-price-range, url: https://leetcode.com/problems/k-highest-ranked-items-within-a-price-range, topics: ['Array', 'Breadth-First Search', 'Sorting', 'Heap (Priority Queue)', 'Matrix'], hasSolution: False, hasVideoSolution: False, 2147: questionNo: 2147, acRate: 49.38439596582888, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Number of Ways to Divide a Long Corridor, slug: number-of-ways-to-divide-a-long-corridor, url: https://leetcode.com/problems/number-of-ways-to-divide-a-long-corridor, topics: ['Math', 'String', 'Dynamic Programming'], hasSolution: True, hasVideoSolution: False, 2148: questionNo: 2148, acRate: 59.35527456793112, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Count Elements With Strictly Smaller and Greater Elements , slug: count-elements-with-strictly-smaller-and-greater-elements, url: https://leetcode.com/problems/count-elements-with-strictly-smaller-and-greater-elements, topics: ['Array', 'Sorting'], hasSolution: False, hasVideoSolution: False, 2149: questionNo: 2149, acRate: 84.01387555633126, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Rearrange Array Elements by Sign, slug: rearrange-array-elements-by-sign, url: https://leetcode.com/problems/rearrange-array-elements-by-sign, topics: ['Array', 'Two Pointers', 'Simulation'], hasSolution: True, hasVideoSolution: False, 2150: questionNo: 2150, acRate: 60.77057143916639, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Find All Lonely Numbers in the Array, slug: find-all-lonely-numbers-in-the-array, url: https://leetcode.com/problems/find-all-lonely-numbers-in-the-array, topics: ['Array', 'Hash Table', 'Counting'], hasSolution: False, hasVideoSolution: False, 2151: questionNo: 2151, acRate: 50.15645954403218, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Maximum Good People Based on Statements, slug: maximum-good-people-based-on-statements, url: https://leetcode.com/problems/maximum-good-people-based-on-statements, topics: ['Array', 'Backtracking', 'Bit Manipulation', 'Enumeration'], hasSolution: False, hasVideoSolution: False, 2152: questionNo: 2152, acRate: 43.62692057996105, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Minimum Number of Lines to Cover Points, slug: minimum-number-of-lines-to-cover-points, url: https://leetcode.com/problems/minimum-number-of-lines-to-cover-points, topics: ['Array', 'Hash Table', 'Math', 'Dynamic Programming', 'Backtracking', 'Bit Manipulation', 'Geometry', 'Bitmask'], hasSolution: False, hasVideoSolution: False, 2153: questionNo: 2153, acRate: 40.130701520405445, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: The Number of Passengers in Each Bus II, slug: the-number-of-passengers-in-each-bus-ii, url: https://leetcode.com/problems/the-number-of-passengers-in-each-bus-ii, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 2154: questionNo: 2154, acRate: 71.34217991033672, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Keep Multiplying Found Values by Two, slug: keep-multiplying-found-values-by-two, url: https://leetcode.com/problems/keep-multiplying-found-values-by-two, topics: ['Array', 'Hash Table', 'Sorting', 'Simulation'], hasSolution: False, hasVideoSolution: False, 2155: questionNo: 2155, acRate: 64.2904290429043, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: All Divisions With the Highest Score of a Binary Array, slug: all-divisions-with-the-highest-score-of-a-binary-array, url: https://leetcode.com/problems/all-divisions-with-the-highest-score-of-a-binary-array, topics: ['Array'], hasSolution: False, hasVideoSolution: False, 2156: questionNo: 2156, acRate: 23.626363909668065, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Find Substring With Given Hash Value, slug: find-substring-with-given-hash-value, url: https://leetcode.com/problems/find-substring-with-given-hash-value, topics: ['String', 'Sliding Window', 'Rolling Hash', 'Hash Function'], hasSolution: False, hasVideoSolution: False, 2157: questionNo: 2157, acRate: 26.154184175111915, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Groups of Strings, slug: groups-of-strings, url: https://leetcode.com/problems/groups-of-strings, topics: ['String', 'Bit Manipulation', 'Union Find'], hasSolution: False, hasVideoSolution: False, 2158: questionNo: 2158, acRate: 55.29154492162376, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Amount of New Area Painted Each Day, slug: amount-of-new-area-painted-each-day, url: https://leetcode.com/problems/amount-of-new-area-painted-each-day, topics: ['Array', 'Segment Tree', 'Ordered Set'], hasSolution: False, hasVideoSolution: False, 2159: questionNo: 2159, acRate: 60.29185867895546, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Order Two Columns Independently, slug: order-two-columns-independently, url: https://leetcode.com/problems/order-two-columns-independently, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 2160: questionNo: 2160, acRate: 86.21140304679423, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Minimum Sum of Four Digit Number After Splitting Digits, slug: minimum-sum-of-four-digit-number-after-splitting-digits, url: https://leetcode.com/problems/minimum-sum-of-four-digit-number-after-splitting-digits, topics: ['Math', 'Greedy', 'Sorting'], hasSolution: False, hasVideoSolution: False, 2161: questionNo: 2161, acRate: 85.0426474869793, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Partition Array According to Given Pivot, slug: partition-array-according-to-given-pivot, url: https://leetcode.com/problems/partition-array-according-to-given-pivot, topics: ['Array', 'Two Pointers', 'Simulation'], hasSolution: False, hasVideoSolution: False, 2162: questionNo: 2162, acRate: 41.13568409114342, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Cost to Set Cooking Time, slug: minimum-cost-to-set-cooking-time, url: https://leetcode.com/problems/minimum-cost-to-set-cooking-time, topics: ['Math', 'Enumeration'], hasSolution: False, hasVideoSolution: False, 2163: questionNo: 2163, acRate: 48.11298695225179, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Minimum Difference in Sums After Removal of Elements, slug: minimum-difference-in-sums-after-removal-of-elements, url: https://leetcode.com/problems/minimum-difference-in-sums-after-removal-of-elements, topics: ['Array', 'Dynamic Programming', 'Heap (Priority Queue)'], hasSolution: False, hasVideoSolution: False, 2164: questionNo: 2164, acRate: 62.61468342442239, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Sort Even and Odd Indices Independently, slug: sort-even-and-odd-indices-independently, url: https://leetcode.com/problems/sort-even-and-odd-indices-independently, topics: ['Array', 'Sorting'], hasSolution: False, hasVideoSolution: False, 2165: questionNo: 2165, acRate: 52.18153627682543, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Smallest Value of the Rearranged Number, slug: smallest-value-of-the-rearranged-number, url: https://leetcode.com/problems/smallest-value-of-the-rearranged-number, topics: ['Math', 'Sorting'], hasSolution: False, hasVideoSolution: False, 2166: questionNo: 2166, acRate: 32.513285623184295, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Design Bitset, slug: design-bitset, url: https://leetcode.com/problems/design-bitset, topics: ['Array', 'Hash Table', 'String', 'Design'], hasSolution: False, hasVideoSolution: False, 2167: questionNo: 2167, acRate: 41.46213585870171, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Minimum Time to Remove All Cars Containing Illegal Goods, slug: minimum-time-to-remove-all-cars-containing-illegal-goods, url: https://leetcode.com/problems/minimum-time-to-remove-all-cars-containing-illegal-goods, topics: ['String', 'Dynamic Programming'], hasSolution: False, hasVideoSolution: False, 2168: questionNo: 2168, acRate: 60.0, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Unique Substrings With Equal Digit Frequency, slug: unique-substrings-with-equal-digit-frequency, url: https://leetcode.com/problems/unique-substrings-with-equal-digit-frequency, topics: ['Hash Table', 'String', 'Rolling Hash', 'Counting', 'Hash Function'], hasSolution: False, hasVideoSolution: False, 2169: questionNo: 2169, acRate: 74.4915546363323, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Count Operations to Obtain Zero, slug: count-operations-to-obtain-zero, url: https://leetcode.com/problems/count-operations-to-obtain-zero, topics: ['Math', 'Simulation'], hasSolution: False, hasVideoSolution: False, 2170: questionNo: 2170, acRate: 33.34914048606994, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Operations to Make the Array Alternating, slug: minimum-operations-to-make-the-array-alternating, url: https://leetcode.com/problems/minimum-operations-to-make-the-array-alternating, topics: ['Array', 'Hash Table', 'Greedy', 'Counting'], hasSolution: False, hasVideoSolution: False, 2171: questionNo: 2171, acRate: 42.88372536857675, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Removing Minimum Number of Magic Beans, slug: removing-minimum-number-of-magic-beans, url: https://leetcode.com/problems/removing-minimum-number-of-magic-beans, topics: ['Array', 'Greedy', 'Sorting', 'Enumeration', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 2172: questionNo: 2172, acRate: 49.11697044770837, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Maximum AND Sum of Array, slug: maximum-and-sum-of-array, url: https://leetcode.com/problems/maximum-and-sum-of-array, topics: ['Array', 'Dynamic Programming', 'Bit Manipulation', 'Bitmask'], hasSolution: False, hasVideoSolution: False, 2173: questionNo: 2173, acRate: 52.81424820184952, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Longest Winning Streak, slug: longest-winning-streak, url: https://leetcode.com/problems/longest-winning-streak, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 2174: questionNo: 2174, acRate: 67.29399112783976, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Remove All Ones With Row and Column Flips II, slug: remove-all-ones-with-row-and-column-flips-ii, url: https://leetcode.com/problems/remove-all-ones-with-row-and-column-flips-ii, topics: ['Array', 'Bit Manipulation', 'Breadth-First Search', 'Matrix'], hasSolution: False, hasVideoSolution: False, 2175: questionNo: 2175, acRate: 60.37842951750236, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: The Change in Global Rankings, slug: the-change-in-global-rankings, url: https://leetcode.com/problems/the-change-in-global-rankings, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 2176: questionNo: 2176, acRate: 79.55489255332017, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Count Equal and Divisible Pairs in an Array, slug: count-equal-and-divisible-pairs-in-an-array, url: https://leetcode.com/problems/count-equal-and-divisible-pairs-in-an-array, topics: ['Array'], hasSolution: False, hasVideoSolution: False, 2177: questionNo: 2177, acRate: 64.53807478079389, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Find Three Consecutive Integers That Sum to a Given Number, slug: find-three-consecutive-integers-that-sum-to-a-given-number, url: https://leetcode.com/problems/find-three-consecutive-integers-that-sum-to-a-given-number, topics: ['Math', 'Simulation'], hasSolution: False, hasVideoSolution: False, 2178: questionNo: 2178, acRate: 59.24173646186305, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum Split of Positive Even Integers, slug: maximum-split-of-positive-even-integers, url: https://leetcode.com/problems/maximum-split-of-positive-even-integers, topics: ['Math', 'Backtracking', 'Greedy'], hasSolution: False, hasVideoSolution: False, 2179: questionNo: 2179, acRate: 41.328339575530585, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Count Good Triplets in an Array, slug: count-good-triplets-in-an-array, url: https://leetcode.com/problems/count-good-triplets-in-an-array, topics: ['Array', 'Binary Search', 'Divide and Conquer', 'Binary Indexed Tree', 'Segment Tree', 'Merge Sort', 'Ordered Set'], hasSolution: False, hasVideoSolution: False, 2180: questionNo: 2180, acRate: 67.14031396666127, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Count Integers With Even Digit Sum, slug: count-integers-with-even-digit-sum, url: https://leetcode.com/problems/count-integers-with-even-digit-sum, topics: ['Math', 'Simulation'], hasSolution: False, hasVideoSolution: False, 2181: questionNo: 2181, acRate: 89.84758607941656, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Merge Nodes in Between Zeros, slug: merge-nodes-in-between-zeros, url: https://leetcode.com/problems/merge-nodes-in-between-zeros, topics: ['Linked List', 'Simulation'], hasSolution: True, hasVideoSolution: False, 2182: questionNo: 2182, acRate: 54.29441918947674, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Construct String With Repeat Limit, slug: construct-string-with-repeat-limit, url: https://leetcode.com/problems/construct-string-with-repeat-limit, topics: ['Hash Table', 'String', 'Greedy', 'Heap (Priority Queue)', 'Counting'], hasSolution: False, hasVideoSolution: False, 2183: questionNo: 2183, acRate: 29.57084991968713, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Count Array Pairs Divisible by K, slug: count-array-pairs-divisible-by-k, url: https://leetcode.com/problems/count-array-pairs-divisible-by-k, topics: ['Array', 'Math', 'Number Theory'], hasSolution: False, hasVideoSolution: False, 2184: questionNo: 2184, acRate: 49.01513331731924, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Number of Ways to Build Sturdy Brick Wall, slug: number-of-ways-to-build-sturdy-brick-wall, url: https://leetcode.com/problems/number-of-ways-to-build-sturdy-brick-wall, topics: ['Array', 'Dynamic Programming', 'Bit Manipulation', 'Bitmask'], hasSolution: False, hasVideoSolution: False, 2185: questionNo: 2185, acRate: 78.18698688495871, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Counting Words With a Given Prefix, slug: counting-words-with-a-given-prefix, url: https://leetcode.com/problems/counting-words-with-a-given-prefix, topics: ['Array', 'String', 'String Matching'], hasSolution: False, hasVideoSolution: False, 2186: questionNo: 2186, acRate: 72.64269339535818, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Number of Steps to Make Two Strings Anagram II, slug: minimum-number-of-steps-to-make-two-strings-anagram-ii, url: https://leetcode.com/problems/minimum-number-of-steps-to-make-two-strings-anagram-ii, topics: ['Hash Table', 'String', 'Counting'], hasSolution: False, hasVideoSolution: False, 2187: questionNo: 2187, acRate: 38.80617461325136, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Time to Complete Trips, slug: minimum-time-to-complete-trips, url: https://leetcode.com/problems/minimum-time-to-complete-trips, topics: ['Array', 'Binary Search'], hasSolution: True, hasVideoSolution: False, 2188: questionNo: 2188, acRate: 41.74225509349707, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Minimum Time to Finish the Race, slug: minimum-time-to-finish-the-race, url: https://leetcode.com/problems/minimum-time-to-finish-the-race, topics: ['Array', 'Dynamic Programming'], hasSolution: False, hasVideoSolution: False, 2189: questionNo: 2189, acRate: 63.34684423856398, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Number of Ways to Build House of Cards, slug: number-of-ways-to-build-house-of-cards, url: https://leetcode.com/problems/number-of-ways-to-build-house-of-cards, topics: ['Math', 'Dynamic Programming'], hasSolution: False, hasVideoSolution: False, 2190: questionNo: 2190, acRate: 59.03049504950495, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Most Frequent Number Following Key In an Array, slug: most-frequent-number-following-key-in-an-array, url: https://leetcode.com/problems/most-frequent-number-following-key-in-an-array, topics: ['Array', 'Hash Table', 'Counting'], hasSolution: False, hasVideoSolution: False, 2191: questionNo: 2191, acRate: 60.31157397098371, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Sort the Jumbled Numbers, slug: sort-the-jumbled-numbers, url: https://leetcode.com/problems/sort-the-jumbled-numbers, topics: ['Array', 'Sorting'], hasSolution: True, hasVideoSolution: False, 2192: questionNo: 2192, acRate: 62.18882686894709, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: All Ancestors of a Node in a Directed Acyclic Graph, slug: all-ancestors-of-a-node-in-a-directed-acyclic-graph, url: https://leetcode.com/problems/all-ancestors-of-a-node-in-a-directed-acyclic-graph, topics: ['Depth-First Search', 'Breadth-First Search', 'Graph', 'Topological Sort'], hasSolution: True, hasVideoSolution: False, 2193: questionNo: 2193, acRate: 51.06848247342326, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Minimum Number of Moves to Make Palindrome, slug: minimum-number-of-moves-to-make-palindrome, url: https://leetcode.com/problems/minimum-number-of-moves-to-make-palindrome, topics: ['Two Pointers', 'String', 'Greedy', 'Binary Indexed Tree'], hasSolution: False, hasVideoSolution: False, 2194: questionNo: 2194, acRate: 84.1249080356413, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Cells in a Range on an Excel Sheet, slug: cells-in-a-range-on-an-excel-sheet, url: https://leetcode.com/problems/cells-in-a-range-on-an-excel-sheet, topics: ['String'], hasSolution: False, hasVideoSolution: False, 2195: questionNo: 2195, acRate: 25.428649471260776, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Append K Integers With Minimal Sum, slug: append-k-integers-with-minimal-sum, url: https://leetcode.com/problems/append-k-integers-with-minimal-sum, topics: ['Array', 'Math', 'Greedy', 'Sorting'], hasSolution: False, hasVideoSolution: False, 2196: questionNo: 2196, acRate: 81.79810897961414, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Create Binary Tree From Descriptions, slug: create-binary-tree-from-descriptions, url: https://leetcode.com/problems/create-binary-tree-from-descriptions, topics: ['Array', 'Hash Table', 'Tree', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 2197: questionNo: 2197, acRate: 39.16637307244098, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Replace Non-Coprime Numbers in Array, slug: replace-non-coprime-numbers-in-array, url: https://leetcode.com/problems/replace-non-coprime-numbers-in-array, topics: ['Array', 'Math', 'Stack', 'Number Theory'], hasSolution: False, hasVideoSolution: False, 2198: questionNo: 2198, acRate: 54.65230166503427, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Number of Single Divisor Triplets, slug: number-of-single-divisor-triplets, url: https://leetcode.com/problems/number-of-single-divisor-triplets, topics: ['Math'], hasSolution: False, hasVideoSolution: False, 2199: questionNo: 2199, acRate: 48.87449892075239, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Finding the Topic of Each Post, slug: finding-the-topic-of-each-post, url: https://leetcode.com/problems/finding-the-topic-of-each-post, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 2200: questionNo: 2200, acRate: 66.00104838973888, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Find All K-Distant Indices in an Array, slug: find-all-k-distant-indices-in-an-array, url: https://leetcode.com/problems/find-all-k-distant-indices-in-an-array, topics: ['Array', 'Two Pointers'], hasSolution: False, hasVideoSolution: False, 2201: questionNo: 2201, acRate: 56.478756535901034, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Count Artifacts That Can Be Extracted, slug: count-artifacts-that-can-be-extracted, url: https://leetcode.com/problems/count-artifacts-that-can-be-extracted, topics: ['Array', 'Hash Table', 'Simulation'], hasSolution: False, hasVideoSolution: False, 2202: questionNo: 2202, acRate: 22.9972217165201, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximize the Topmost Element After K Moves, slug: maximize-the-topmost-element-after-k-moves, url: https://leetcode.com/problems/maximize-the-topmost-element-after-k-moves, topics: ['Array', 'Greedy'], hasSolution: False, hasVideoSolution: False, 2203: questionNo: 2203, acRate: 37.04738797948466, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Minimum Weighted Subgraph With the Required Paths, slug: minimum-weighted-subgraph-with-the-required-paths, url: https://leetcode.com/problems/minimum-weighted-subgraph-with-the-required-paths, topics: ['Graph', 'Shortest Path'], hasSolution: False, hasVideoSolution: False, 2204: questionNo: 2204, acRate: 68.98592124056316, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Distance to a Cycle in Undirected Graph, slug: distance-to-a-cycle-in-undirected-graph, url: https://leetcode.com/problems/distance-to-a-cycle-in-undirected-graph, topics: ['Depth-First Search', 'Breadth-First Search', 'Union Find', 'Graph'], hasSolution: False, hasVideoSolution: False, 2205: questionNo: 2205, acRate: 49.91173166425935, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: The Number of Users That Are Eligible for Discount, slug: the-number-of-users-that-are-eligible-for-discount, url: https://leetcode.com/problems/the-number-of-users-that-are-eligible-for-discount, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 2206: questionNo: 2206, acRate: 73.68556540882179, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Divide Array Into Equal Pairs, slug: divide-array-into-equal-pairs, url: https://leetcode.com/problems/divide-array-into-equal-pairs, topics: ['Array', 'Hash Table', 'Bit Manipulation', 'Counting'], hasSolution: False, hasVideoSolution: False, 2207: questionNo: 2207, acRate: 34.731752408717604, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximize Number of Subsequences in a String, slug: maximize-number-of-subsequences-in-a-string, url: https://leetcode.com/problems/maximize-number-of-subsequences-in-a-string, topics: ['String', 'Greedy', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 2208: questionNo: 2208, acRate: 46.763356030836604, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Operations to Halve Array Sum, slug: minimum-operations-to-halve-array-sum, url: https://leetcode.com/problems/minimum-operations-to-halve-array-sum, topics: ['Array', 'Greedy', 'Heap (Priority Queue)'], hasSolution: False, hasVideoSolution: False, 2209: questionNo: 2209, acRate: 36.77677319249247, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Minimum White Tiles After Covering With Carpets, slug: minimum-white-tiles-after-covering-with-carpets, url: https://leetcode.com/problems/minimum-white-tiles-after-covering-with-carpets, topics: ['String', 'Dynamic Programming', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 2210: questionNo: 2210, acRate: 60.96932012628636, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Count Hills and Valleys in an Array, slug: count-hills-and-valleys-in-an-array, url: https://leetcode.com/problems/count-hills-and-valleys-in-an-array, topics: ['Array'], hasSolution: False, hasVideoSolution: False, 2211: questionNo: 2211, acRate: 43.85620317924356, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Count Collisions on a Road, slug: count-collisions-on-a-road, url: https://leetcode.com/problems/count-collisions-on-a-road, topics: ['String', 'Stack', 'Simulation'], hasSolution: False, hasVideoSolution: False, 2212: questionNo: 2212, acRate: 50.10615711252654, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum Points in an Archery Competition, slug: maximum-points-in-an-archery-competition, url: https://leetcode.com/problems/maximum-points-in-an-archery-competition, topics: ['Array', 'Backtracking', 'Bit Manipulation', 'Enumeration'], hasSolution: False, hasVideoSolution: False, 2213: questionNo: 2213, acRate: 32.22707423580786, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Longest Substring of One Repeating Character, slug: longest-substring-of-one-repeating-character, url: https://leetcode.com/problems/longest-substring-of-one-repeating-character, topics: ['Array', 'String', 'Segment Tree', 'Ordered Set'], hasSolution: False, hasVideoSolution: False, 2214: questionNo: 2214, acRate: 57.666592789598106, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Minimum Health to Beat Game, slug: minimum-health-to-beat-game, url: https://leetcode.com/problems/minimum-health-to-beat-game, topics: ['Array', 'Greedy'], hasSolution: True, hasVideoSolution: False, 2215: questionNo: 2215, acRate: 79.1240157480315, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Find the Difference of Two Arrays, slug: find-the-difference-of-two-arrays, url: https://leetcode.com/problems/find-the-difference-of-two-arrays, topics: ['Array', 'Hash Table'], hasSolution: True, hasVideoSolution: False, 2216: questionNo: 2216, acRate: 48.43747708641903, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Deletions to Make Array Beautiful, slug: minimum-deletions-to-make-array-beautiful, url: https://leetcode.com/problems/minimum-deletions-to-make-array-beautiful, topics: ['Array', 'Stack', 'Greedy'], hasSolution: False, hasVideoSolution: False, 2217: questionNo: 2217, acRate: 37.09338240126175, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Find Palindrome With Fixed Length, slug: find-palindrome-with-fixed-length, url: https://leetcode.com/problems/find-palindrome-with-fixed-length, topics: ['Array', 'Math'], hasSolution: False, hasVideoSolution: False, 2218: questionNo: 2218, acRate: 60.56914232162488, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Maximum Value of K Coins From Piles, slug: maximum-value-of-k-coins-from-piles, url: https://leetcode.com/problems/maximum-value-of-k-coins-from-piles, topics: ['Array', 'Dynamic Programming', 'Prefix Sum'], hasSolution: True, hasVideoSolution: False, 2219: questionNo: 2219, acRate: 62.00294550810015, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Maximum Sum Score of Array, slug: maximum-sum-score-of-array, url: https://leetcode.com/problems/maximum-sum-score-of-array, topics: ['Array', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 2220: questionNo: 2220, acRate: 85.12078902650526, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Minimum Bit Flips to Convert Number, slug: minimum-bit-flips-to-convert-number, url: https://leetcode.com/problems/minimum-bit-flips-to-convert-number, topics: ['Bit Manipulation'], hasSolution: False, hasVideoSolution: False, 2221: questionNo: 2221, acRate: 78.78962479735932, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Find Triangular Sum of an Array, slug: find-triangular-sum-of-an-array, url: https://leetcode.com/problems/find-triangular-sum-of-an-array, topics: ['Array', 'Math', 'Simulation', 'Combinatorics'], hasSolution: False, hasVideoSolution: False, 2222: questionNo: 2222, acRate: 50.70111409911641, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Number of Ways to Select Buildings, slug: number-of-ways-to-select-buildings, url: https://leetcode.com/problems/number-of-ways-to-select-buildings, topics: ['String', 'Dynamic Programming', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 2223: questionNo: 2223, acRate: 40.28877056650837, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Sum of Scores of Built Strings, slug: sum-of-scores-of-built-strings, url: https://leetcode.com/problems/sum-of-scores-of-built-strings, topics: ['String', 'Binary Search', 'Rolling Hash', 'Suffix Array', 'String Matching', 'Hash Function'], hasSolution: False, hasVideoSolution: False, 2224: questionNo: 2224, acRate: 65.25020709968398, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Minimum Number of Operations to Convert Time, slug: minimum-number-of-operations-to-convert-time, url: https://leetcode.com/problems/minimum-number-of-operations-to-convert-time, topics: ['String', 'Greedy'], hasSolution: False, hasVideoSolution: False, 2225: questionNo: 2225, acRate: 73.24786924755337, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Find Players With Zero or One Losses, slug: find-players-with-zero-or-one-losses, url: https://leetcode.com/problems/find-players-with-zero-or-one-losses, topics: ['Array', 'Hash Table', 'Sorting', 'Counting'], hasSolution: True, hasVideoSolution: False, 2226: questionNo: 2226, acRate: 38.18261093957164, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum Candies Allocated to K Children, slug: maximum-candies-allocated-to-k-children, url: https://leetcode.com/problems/maximum-candies-allocated-to-k-children, topics: ['Array', 'Binary Search'], hasSolution: False, hasVideoSolution: False, 2227: questionNo: 2227, acRate: 40.49805447470817, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Encrypt and Decrypt Strings, slug: encrypt-and-decrypt-strings, url: https://leetcode.com/problems/encrypt-and-decrypt-strings, topics: ['Array', 'Hash Table', 'String', 'Design', 'Trie'], hasSolution: False, hasVideoSolution: False, 2228: questionNo: 2228, acRate: 44.80416324294714, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Users With Two Purchases Within Seven Days, slug: users-with-two-purchases-within-seven-days, url: https://leetcode.com/problems/users-with-two-purchases-within-seven-days, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 2229: questionNo: 2229, acRate: 61.118012422360245, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Check if an Array Is Consecutive, slug: check-if-an-array-is-consecutive, url: https://leetcode.com/problems/check-if-an-array-is-consecutive, topics: ['Array', 'Hash Table', 'Sorting'], hasSolution: False, hasVideoSolution: False, 2230: questionNo: 2230, acRate: 49.828719563003425, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: The Users That Are Eligible for Discount, slug: the-users-that-are-eligible-for-discount, url: https://leetcode.com/problems/the-users-that-are-eligible-for-discount, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 2231: questionNo: 2231, acRate: 61.831021157107514, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Largest Number After Digit Swaps by Parity, slug: largest-number-after-digit-swaps-by-parity, url: https://leetcode.com/problems/largest-number-after-digit-swaps-by-parity, topics: ['Sorting', 'Heap (Priority Queue)'], hasSolution: False, hasVideoSolution: False, 2232: questionNo: 2232, acRate: 67.4312814556717, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimize Result by Adding Parentheses to Expression, slug: minimize-result-by-adding-parentheses-to-expression, url: https://leetcode.com/problems/minimize-result-by-adding-parentheses-to-expression, topics: ['String', 'Enumeration'], hasSolution: False, hasVideoSolution: False, 2233: questionNo: 2233, acRate: 41.66509273599516, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum Product After K Increments, slug: maximum-product-after-k-increments, url: https://leetcode.com/problems/maximum-product-after-k-increments, topics: ['Array', 'Greedy', 'Heap (Priority Queue)'], hasSolution: False, hasVideoSolution: False, 2234: questionNo: 2234, acRate: 29.490638212200526, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Maximum Total Beauty of the Gardens, slug: maximum-total-beauty-of-the-gardens, url: https://leetcode.com/problems/maximum-total-beauty-of-the-gardens, topics: ['Array', 'Two Pointers', 'Binary Search', 'Greedy', 'Sorting'], hasSolution: False, hasVideoSolution: False, 2235: questionNo: 2235, acRate: 87.85235021546194, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Add Two Integers, slug: add-two-integers, url: https://leetcode.com/problems/add-two-integers, topics: ['Math'], hasSolution: False, hasVideoSolution: False, 2236: questionNo: 2236, acRate: 84.49650457397368, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Root Equals Sum of Children, slug: root-equals-sum-of-children, url: https://leetcode.com/problems/root-equals-sum-of-children, topics: ['Tree', 'Binary Tree'], hasSolution: False, hasVideoSolution: False, 2237: questionNo: 2237, acRate: 63.44993968636912, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Count Positions on Street With Required Brightness, slug: count-positions-on-street-with-required-brightness, url: https://leetcode.com/problems/count-positions-on-street-with-required-brightness, topics: ['Array', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 2238: questionNo: 2238, acRate: 71.34140870345446, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Number of Times a Driver Was a Passenger, slug: number-of-times-a-driver-was-a-passenger, url: https://leetcode.com/problems/number-of-times-a-driver-was-a-passenger, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 2239: questionNo: 2239, acRate: 45.03040061168824, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Find Closest Number to Zero, slug: find-closest-number-to-zero, url: https://leetcode.com/problems/find-closest-number-to-zero, topics: ['Array'], hasSolution: False, hasVideoSolution: False, 2240: questionNo: 2240, acRate: 57.08839892849784, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Number of Ways to Buy Pens and Pencils, slug: number-of-ways-to-buy-pens-and-pencils, url: https://leetcode.com/problems/number-of-ways-to-buy-pens-and-pencils, topics: ['Math', 'Enumeration'], hasSolution: False, hasVideoSolution: False, 2241: questionNo: 2241, acRate: 41.933511654566296, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Design an ATM Machine, slug: design-an-atm-machine, url: https://leetcode.com/problems/design-an-atm-machine, topics: ['Array', 'Greedy', 'Design'], hasSolution: False, hasVideoSolution: False, 2242: questionNo: 2242, acRate: 38.68208458735942, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Maximum Score of a Node Sequence, slug: maximum-score-of-a-node-sequence, url: https://leetcode.com/problems/maximum-score-of-a-node-sequence, topics: ['Array', 'Graph', 'Sorting', 'Enumeration'], hasSolution: False, hasVideoSolution: False, 2243: questionNo: 2243, acRate: 66.13321870815216, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Calculate Digit Sum of a String, slug: calculate-digit-sum-of-a-string, url: https://leetcode.com/problems/calculate-digit-sum-of-a-string, topics: ['String', 'Simulation'], hasSolution: False, hasVideoSolution: False, 2244: questionNo: 2244, acRate: 62.89508104438816, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Rounds to Complete All Tasks, slug: minimum-rounds-to-complete-all-tasks, url: https://leetcode.com/problems/minimum-rounds-to-complete-all-tasks, topics: ['Array', 'Hash Table', 'Greedy', 'Counting'], hasSolution: True, hasVideoSolution: False, 2245: questionNo: 2245, acRate: 36.2668813165191, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum Trailing Zeros in a Cornered Path, slug: maximum-trailing-zeros-in-a-cornered-path, url: https://leetcode.com/problems/maximum-trailing-zeros-in-a-cornered-path, topics: ['Array', 'Matrix', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 2246: questionNo: 2246, acRate: 54.47143708214735, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Longest Path With Different Adjacent Characters, slug: longest-path-with-different-adjacent-characters, url: https://leetcode.com/problems/longest-path-with-different-adjacent-characters, topics: ['Array', 'String', 'Tree', 'Depth-First Search', 'Graph', 'Topological Sort'], hasSolution: True, hasVideoSolution: False, 2247: questionNo: 2247, acRate: 50.223713646532445, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Maximum Cost of Trip With K Highways, slug: maximum-cost-of-trip-with-k-highways, url: https://leetcode.com/problems/maximum-cost-of-trip-with-k-highways, topics: ['Dynamic Programming', 'Bit Manipulation', 'Graph', 'Bitmask'], hasSolution: False, hasVideoSolution: False, 2248: questionNo: 2248, acRate: 68.2151827736728, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Intersection of Multiple Arrays, slug: intersection-of-multiple-arrays, url: https://leetcode.com/problems/intersection-of-multiple-arrays, topics: ['Array', 'Hash Table', 'Sorting', 'Counting'], hasSolution: False, hasVideoSolution: False, 2249: questionNo: 2249, acRate: 53.06498628257887, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Count Lattice Points Inside a Circle, slug: count-lattice-points-inside-a-circle, url: https://leetcode.com/problems/count-lattice-points-inside-a-circle, topics: ['Array', 'Hash Table', 'Math', 'Geometry', 'Enumeration'], hasSolution: False, hasVideoSolution: False, 2250: questionNo: 2250, acRate: 35.19655763044659, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Count Number of Rectangles Containing Each Point, slug: count-number-of-rectangles-containing-each-point, url: https://leetcode.com/problems/count-number-of-rectangles-containing-each-point, topics: ['Array', 'Binary Search', 'Binary Indexed Tree', 'Sorting'], hasSolution: False, hasVideoSolution: False, 2251: questionNo: 2251, acRate: 56.705564839221665, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Number of Flowers in Full Bloom, slug: number-of-flowers-in-full-bloom, url: https://leetcode.com/problems/number-of-flowers-in-full-bloom, topics: ['Array', 'Hash Table', 'Binary Search', 'Sorting', 'Prefix Sum', 'Ordered Set'], hasSolution: True, hasVideoSolution: False, 2252: questionNo: 2252, acRate: 55.666074600355245, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Dynamic Pivoting of a Table, slug: dynamic-pivoting-of-a-table, url: https://leetcode.com/problems/dynamic-pivoting-of-a-table, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 2253: questionNo: 2253, acRate: 66.52512384996461, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Dynamic Unpivoting of a Table, slug: dynamic-unpivoting-of-a-table, url: https://leetcode.com/problems/dynamic-unpivoting-of-a-table, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 2254: questionNo: 2254, acRate: 64.2803738317757, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Design Video Sharing Platform, slug: design-video-sharing-platform, url: https://leetcode.com/problems/design-video-sharing-platform, topics: ['Hash Table', 'Stack', 'Design', 'Ordered Set'], hasSolution: False, hasVideoSolution: False, 2255: questionNo: 2255, acRate: 72.63366199937872, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Count Prefixes of a Given String, slug: count-prefixes-of-a-given-string, url: https://leetcode.com/problems/count-prefixes-of-a-given-string, topics: ['Array', 'String'], hasSolution: False, hasVideoSolution: False, 2256: questionNo: 2256, acRate: 43.197373125909664, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Average Difference, slug: minimum-average-difference, url: https://leetcode.com/problems/minimum-average-difference, topics: ['Array', 'Prefix Sum'], hasSolution: True, hasVideoSolution: False, 2257: questionNo: 2257, acRate: 52.568051018820974, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Count Unguarded Cells in the Grid, slug: count-unguarded-cells-in-the-grid, url: https://leetcode.com/problems/count-unguarded-cells-in-the-grid, topics: ['Array', 'Matrix', 'Simulation'], hasSolution: False, hasVideoSolution: False, 2258: questionNo: 2258, acRate: 35.1131221719457, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Escape the Spreading Fire, slug: escape-the-spreading-fire, url: https://leetcode.com/problems/escape-the-spreading-fire, topics: ['Array', 'Binary Search', 'Breadth-First Search', 'Matrix'], hasSolution: False, hasVideoSolution: False, 2259: questionNo: 2259, acRate: 45.61223900500334, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Remove Digit From Number to Maximize Result, slug: remove-digit-from-number-to-maximize-result, url: https://leetcode.com/problems/remove-digit-from-number-to-maximize-result, topics: ['String', 'Greedy', 'Enumeration'], hasSolution: False, hasVideoSolution: False, 2260: questionNo: 2260, acRate: 51.47786782829559, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Consecutive Cards to Pick Up, slug: minimum-consecutive-cards-to-pick-up, url: https://leetcode.com/problems/minimum-consecutive-cards-to-pick-up, topics: ['Array', 'Hash Table', 'Sliding Window'], hasSolution: False, hasVideoSolution: False, 2261: questionNo: 2261, acRate: 51.80121036507146, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: K Divisible Elements Subarrays, slug: k-divisible-elements-subarrays, url: https://leetcode.com/problems/k-divisible-elements-subarrays, topics: ['Array', 'Hash Table', 'Trie', 'Rolling Hash', 'Hash Function', 'Enumeration'], hasSolution: False, hasVideoSolution: False, 2262: questionNo: 2262, acRate: 55.70637849235636, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Total Appeal of A String, slug: total-appeal-of-a-string, url: https://leetcode.com/problems/total-appeal-of-a-string, topics: ['Hash Table', 'String', 'Dynamic Programming'], hasSolution: False, hasVideoSolution: False, 2263: questionNo: 2263, acRate: 66.13627854736053, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Make Array Non-decreasing or Non-increasing, slug: make-array-non-decreasing-or-non-increasing, url: https://leetcode.com/problems/make-array-non-decreasing-or-non-increasing, topics: ['Dynamic Programming', 'Greedy'], hasSolution: False, hasVideoSolution: False, 2264: questionNo: 2264, acRate: 68.99438994109904, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Largest 3-Same-Digit Number in String, slug: largest-3-same-digit-number-in-string, url: https://leetcode.com/problems/largest-3-same-digit-number-in-string, topics: ['String'], hasSolution: True, hasVideoSolution: False, 2265: questionNo: 2265, acRate: 86.30730461198564, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Count Nodes Equal to Average of Subtree, slug: count-nodes-equal-to-average-of-subtree, url: https://leetcode.com/problems/count-nodes-equal-to-average-of-subtree, topics: ['Tree', 'Depth-First Search', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 2266: questionNo: 2266, acRate: 47.83554794203435, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Count Number of Texts, slug: count-number-of-texts, url: https://leetcode.com/problems/count-number-of-texts, topics: ['Hash Table', 'Math', 'String', 'Dynamic Programming'], hasSolution: False, hasVideoSolution: False, 2267: questionNo: 2267, acRate: 38.82367447595561, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Check if There Is a Valid Parentheses String Path, slug: check-if-there-is-a-valid-parentheses-string-path, url: https://leetcode.com/problems/check-if-there-is-a-valid-parentheses-string-path, topics: ['Array', 'Dynamic Programming', 'Matrix'], hasSolution: False, hasVideoSolution: False, 2268: questionNo: 2268, acRate: 71.31826103795508, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Minimum Number of Keypresses, slug: minimum-number-of-keypresses, url: https://leetcode.com/problems/minimum-number-of-keypresses, topics: ['Hash Table', 'String', 'Greedy', 'Sorting', 'Counting'], hasSolution: False, hasVideoSolution: False, 2269: questionNo: 2269, acRate: 60.053209442690644, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Find the K-Beauty of a Number, slug: find-the-k-beauty-of-a-number, url: https://leetcode.com/problems/find-the-k-beauty-of-a-number, topics: ['Math', 'String', 'Sliding Window'], hasSolution: False, hasVideoSolution: False, 2270: questionNo: 2270, acRate: 47.96057104010877, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Number of Ways to Split Array, slug: number-of-ways-to-split-array, url: https://leetcode.com/problems/number-of-ways-to-split-array, topics: ['Array', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 2271: questionNo: 2271, acRate: 33.762116685972074, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum White Tiles Covered by a Carpet, slug: maximum-white-tiles-covered-by-a-carpet, url: https://leetcode.com/problems/maximum-white-tiles-covered-by-a-carpet, topics: ['Array', 'Binary Search', 'Greedy', 'Sorting', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 2272: questionNo: 2272, acRate: 46.259594455264065, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Substring With Largest Variance, slug: substring-with-largest-variance, url: https://leetcode.com/problems/substring-with-largest-variance, topics: ['Array', 'Dynamic Programming'], hasSolution: True, hasVideoSolution: False, 2273: questionNo: 2273, acRate: 58.31069561796279, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Find Resultant Array After Removing Anagrams, slug: find-resultant-array-after-removing-anagrams, url: https://leetcode.com/problems/find-resultant-array-after-removing-anagrams, topics: ['Array', 'Hash Table', 'String', 'Sorting'], hasSolution: False, hasVideoSolution: False, 2274: questionNo: 2274, acRate: 51.781840224604395, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum Consecutive Floors Without Special Floors, slug: maximum-consecutive-floors-without-special-floors, url: https://leetcode.com/problems/maximum-consecutive-floors-without-special-floors, topics: ['Array', 'Sorting'], hasSolution: False, hasVideoSolution: False, 2275: questionNo: 2275, acRate: 72.94629062246314, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Largest Combination With Bitwise AND Greater Than Zero, slug: largest-combination-with-bitwise-and-greater-than-zero, url: https://leetcode.com/problems/largest-combination-with-bitwise-and-greater-than-zero, topics: ['Array', 'Hash Table', 'Bit Manipulation', 'Counting'], hasSolution: False, hasVideoSolution: False, 2276: questionNo: 2276, acRate: 35.253275025413814, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Count Integers in Intervals, slug: count-integers-in-intervals, url: https://leetcode.com/problems/count-integers-in-intervals, topics: ['Design', 'Segment Tree', 'Ordered Set'], hasSolution: False, hasVideoSolution: False, 2277: questionNo: 2277, acRate: 62.47938078923995, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Closest Node to Path in Tree, slug: closest-node-to-path-in-tree, url: https://leetcode.com/problems/closest-node-to-path-in-tree, topics: ['Array', 'Tree', 'Depth-First Search', 'Breadth-First Search'], hasSolution: False, hasVideoSolution: False, 2278: questionNo: 2278, acRate: 74.13893122265375, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Percentage of Letter in String, slug: percentage-of-letter-in-string, url: https://leetcode.com/problems/percentage-of-letter-in-string, topics: ['String'], hasSolution: False, hasVideoSolution: False, 2279: questionNo: 2279, acRate: 67.50209738936712, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum Bags With Full Capacity of Rocks, slug: maximum-bags-with-full-capacity-of-rocks, url: https://leetcode.com/problems/maximum-bags-with-full-capacity-of-rocks, topics: ['Array', 'Greedy', 'Sorting'], hasSolution: True, hasVideoSolution: False, 2280: questionNo: 2280, acRate: 25.306056394341525, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Lines to Represent a Line Chart, slug: minimum-lines-to-represent-a-line-chart, url: https://leetcode.com/problems/minimum-lines-to-represent-a-line-chart, topics: ['Array', 'Math', 'Geometry', 'Sorting', 'Number Theory'], hasSolution: False, hasVideoSolution: False, 2281: questionNo: 2281, acRate: 27.86415368697743, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Sum of Total Strength of Wizards, slug: sum-of-total-strength-of-wizards, url: https://leetcode.com/problems/sum-of-total-strength-of-wizards, topics: ['Array', 'Stack', 'Monotonic Stack', 'Prefix Sum'], hasSolution: True, hasVideoSolution: False, 2282: questionNo: 2282, acRate: 48.33958221746117, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Number of People That Can Be Seen in a Grid, slug: number-of-people-that-can-be-seen-in-a-grid, url: https://leetcode.com/problems/number-of-people-that-can-be-seen-in-a-grid, topics: ['Array', 'Stack', 'Matrix', 'Monotonic Stack'], hasSolution: False, hasVideoSolution: False, 2283: questionNo: 2283, acRate: 72.32134031827617, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Check if Number Has Equal Digit Count and Digit Value, slug: check-if-number-has-equal-digit-count-and-digit-value, url: https://leetcode.com/problems/check-if-number-has-equal-digit-count-and-digit-value, topics: ['Hash Table', 'String', 'Counting'], hasSolution: False, hasVideoSolution: False, 2284: questionNo: 2284, acRate: 56.975063545595006, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Sender With Largest Word Count, slug: sender-with-largest-word-count, url: https://leetcode.com/problems/sender-with-largest-word-count, topics: ['Array', 'Hash Table', 'String', 'Counting'], hasSolution: False, hasVideoSolution: False, 2285: questionNo: 2285, acRate: 69.38869130711443, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum Total Importance of Roads, slug: maximum-total-importance-of-roads, url: https://leetcode.com/problems/maximum-total-importance-of-roads, topics: ['Greedy', 'Graph', 'Sorting', 'Heap (Priority Queue)'], hasSolution: True, hasVideoSolution: False, 2286: questionNo: 2286, acRate: 17.80131371251082, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Booking Concert Tickets in Groups, slug: booking-concert-tickets-in-groups, url: https://leetcode.com/problems/booking-concert-tickets-in-groups, topics: ['Binary Search', 'Design', 'Binary Indexed Tree', 'Segment Tree'], hasSolution: False, hasVideoSolution: False, 2287: questionNo: 2287, acRate: 59.188779595104656, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Rearrange Characters to Make Target String, slug: rearrange-characters-to-make-target-string, url: https://leetcode.com/problems/rearrange-characters-to-make-target-string, topics: ['Hash Table', 'String', 'Counting'], hasSolution: False, hasVideoSolution: False, 2288: questionNo: 2288, acRate: 31.036237785016286, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Apply Discount to Prices, slug: apply-discount-to-prices, url: https://leetcode.com/problems/apply-discount-to-prices, topics: ['String'], hasSolution: False, hasVideoSolution: False, 2289: questionNo: 2289, acRate: 21.937721146382525, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Steps to Make Array Non-decreasing, slug: steps-to-make-array-non-decreasing, url: https://leetcode.com/problems/steps-to-make-array-non-decreasing, topics: ['Array', 'Linked List', 'Stack', 'Monotonic Stack'], hasSolution: False, hasVideoSolution: False, 2290: questionNo: 2290, acRate: 54.37222922682719, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Minimum Obstacle Removal to Reach Corner, slug: minimum-obstacle-removal-to-reach-corner, url: https://leetcode.com/problems/minimum-obstacle-removal-to-reach-corner, topics: ['Array', 'Breadth-First Search', 'Graph', 'Heap (Priority Queue)', 'Matrix', 'Shortest Path'], hasSolution: False, hasVideoSolution: False, 2291: questionNo: 2291, acRate: 45.39576802507837, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Maximum Profit From Trading Stocks, slug: maximum-profit-from-trading-stocks, url: https://leetcode.com/problems/maximum-profit-from-trading-stocks, topics: ['Array', 'Dynamic Programming'], hasSolution: False, hasVideoSolution: False, 2292: questionNo: 2292, acRate: 39.28392728081393, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Products With Three or More Orders in Two Consecutive Years, slug: products-with-three-or-more-orders-in-two-consecutive-years, url: https://leetcode.com/problems/products-with-three-or-more-orders-in-two-consecutive-years, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 2293: questionNo: 2293, acRate: 63.14500116042188, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Min Max Game, slug: min-max-game, url: https://leetcode.com/problems/min-max-game, topics: ['Array', 'Simulation'], hasSolution: False, hasVideoSolution: False, 2294: questionNo: 2294, acRate: 73.93126571668064, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Partition Array Such That Maximum Difference Is K, slug: partition-array-such-that-maximum-difference-is-k, url: https://leetcode.com/problems/partition-array-such-that-maximum-difference-is-k, topics: ['Array', 'Greedy', 'Sorting'], hasSolution: False, hasVideoSolution: False, 2295: questionNo: 2295, acRate: 57.96085352157869, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Replace Elements in an Array, slug: replace-elements-in-an-array, url: https://leetcode.com/problems/replace-elements-in-an-array, topics: ['Array', 'Hash Table', 'Simulation'], hasSolution: False, hasVideoSolution: False, 2296: questionNo: 2296, acRate: 45.113080519105466, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Design a Text Editor, slug: design-a-text-editor, url: https://leetcode.com/problems/design-a-text-editor, topics: ['Linked List', 'String', 'Stack', 'Design', 'Simulation', 'Doubly-Linked List'], hasSolution: False, hasVideoSolution: False, 2297: questionNo: 2297, acRate: 45.43273666728179, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Jump Game VIII, slug: jump-game-viii, url: https://leetcode.com/problems/jump-game-viii, topics: ['Array', 'Dynamic Programming', 'Stack', 'Graph', 'Monotonic Stack', 'Shortest Path'], hasSolution: False, hasVideoSolution: False, 2298: questionNo: 2298, acRate: 81.43023406181301, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Tasks Count in the Weekend, slug: tasks-count-in-the-weekend, url: https://leetcode.com/problems/tasks-count-in-the-weekend, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 2299: questionNo: 2299, acRate: 54.81591143151391, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Strong Password Checker II, slug: strong-password-checker-ii, url: https://leetcode.com/problems/strong-password-checker-ii, topics: ['String'], hasSolution: False, hasVideoSolution: False, 2300: questionNo: 2300, acRate: 43.351245331685426, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Successful Pairs of Spells and Potions, slug: successful-pairs-of-spells-and-potions, url: https://leetcode.com/problems/successful-pairs-of-spells-and-potions, topics: ['Array', 'Two Pointers', 'Binary Search', 'Sorting'], hasSolution: True, hasVideoSolution: False, 2301: questionNo: 2301, acRate: 40.97115548728452, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Match Substring After Replacement, slug: match-substring-after-replacement, url: https://leetcode.com/problems/match-substring-after-replacement, topics: ['Array', 'Hash Table', 'String', 'String Matching'], hasSolution: False, hasVideoSolution: False, 2302: questionNo: 2302, acRate: 54.85984513473999, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Count Subarrays With Score Less Than K, slug: count-subarrays-with-score-less-than-k, url: https://leetcode.com/problems/count-subarrays-with-score-less-than-k, topics: ['Array', 'Binary Search', 'Sliding Window', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 2303: questionNo: 2303, acRate: 65.69942744858895, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Calculate Amount Paid in Taxes, slug: calculate-amount-paid-in-taxes, url: https://leetcode.com/problems/calculate-amount-paid-in-taxes, topics: ['Array', 'Simulation'], hasSolution: False, hasVideoSolution: False, 2304: questionNo: 2304, acRate: 66.7956739555785, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Path Cost in a Grid, slug: minimum-path-cost-in-a-grid, url: https://leetcode.com/problems/minimum-path-cost-in-a-grid, topics: ['Array', 'Dynamic Programming', 'Matrix'], hasSolution: False, hasVideoSolution: False, 2305: questionNo: 2305, acRate: 69.23489337975109, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Fair Distribution of Cookies, slug: fair-distribution-of-cookies, url: https://leetcode.com/problems/fair-distribution-of-cookies, topics: ['Array', 'Dynamic Programming', 'Backtracking', 'Bit Manipulation', 'Bitmask'], hasSolution: True, hasVideoSolution: False, 2306: questionNo: 2306, acRate: 46.423030775462166, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Naming a Company, slug: naming-a-company, url: https://leetcode.com/problems/naming-a-company, topics: ['Array', 'Hash Table', 'String', 'Bit Manipulation', 'Enumeration'], hasSolution: True, hasVideoSolution: False, 2307: questionNo: 2307, acRate: 43.48568426582611, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Check for Contradictions in Equations, slug: check-for-contradictions-in-equations, url: https://leetcode.com/problems/check-for-contradictions-in-equations, topics: ['Array', 'Depth-First Search', 'Union Find', 'Graph'], hasSolution: False, hasVideoSolution: False, 2308: questionNo: 2308, acRate: 69.04734209608003, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Arrange Table by Gender, slug: arrange-table-by-gender, url: https://leetcode.com/problems/arrange-table-by-gender, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 2309: questionNo: 2309, acRate: 69.98202516476933, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Greatest English Letter in Upper and Lower Case, slug: greatest-english-letter-in-upper-and-lower-case, url: https://leetcode.com/problems/greatest-english-letter-in-upper-and-lower-case, topics: ['Hash Table', 'String', 'Enumeration'], hasSolution: False, hasVideoSolution: False, 2310: questionNo: 2310, acRate: 26.74925280011271, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Sum of Numbers With Units Digit K, slug: sum-of-numbers-with-units-digit-k, url: https://leetcode.com/problems/sum-of-numbers-with-units-digit-k, topics: ['Math', 'Dynamic Programming', 'Greedy', 'Enumeration'], hasSolution: False, hasVideoSolution: False, 2311: questionNo: 2311, acRate: 37.961878574944414, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Longest Binary Subsequence Less Than or Equal to K, slug: longest-binary-subsequence-less-than-or-equal-to-k, url: https://leetcode.com/problems/longest-binary-subsequence-less-than-or-equal-to-k, topics: ['String', 'Dynamic Programming', 'Greedy', 'Memoization'], hasSolution: False, hasVideoSolution: False, 2312: questionNo: 2312, acRate: 50.08304881424749, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Selling Pieces of Wood, slug: selling-pieces-of-wood, url: https://leetcode.com/problems/selling-pieces-of-wood, topics: ['Array', 'Dynamic Programming', 'Memoization'], hasSolution: False, hasVideoSolution: False, 2313: questionNo: 2313, acRate: 58.877374784110536, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Minimum Flips in Binary Tree to Get Result, slug: minimum-flips-in-binary-tree-to-get-result, url: https://leetcode.com/problems/minimum-flips-in-binary-tree-to-get-result, topics: ['Dynamic Programming', 'Tree', 'Depth-First Search', 'Binary Tree'], hasSolution: False, hasVideoSolution: False, 2314: questionNo: 2314, acRate: 71.72136300767006, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: The First Day of the Maximum Recorded Degree in Each City, slug: the-first-day-of-the-maximum-recorded-degree-in-each-city, url: https://leetcode.com/problems/the-first-day-of-the-maximum-recorded-degree-in-each-city, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 2315: questionNo: 2315, acRate: 82.3592854735423, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Count Asterisks, slug: count-asterisks, url: https://leetcode.com/problems/count-asterisks, topics: ['String'], hasSolution: False, hasVideoSolution: False, 2316: questionNo: 2316, acRate: 49.20897778063603, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Count Unreachable Pairs of Nodes in an Undirected Graph, slug: count-unreachable-pairs-of-nodes-in-an-undirected-graph, url: https://leetcode.com/problems/count-unreachable-pairs-of-nodes-in-an-undirected-graph, topics: ['Depth-First Search', 'Breadth-First Search', 'Union Find', 'Graph'], hasSolution: True, hasVideoSolution: False, 2317: questionNo: 2317, acRate: 79.60828413457033, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum XOR After Operations , slug: maximum-xor-after-operations, url: https://leetcode.com/problems/maximum-xor-after-operations, topics: ['Array', 'Math', 'Bit Manipulation'], hasSolution: False, hasVideoSolution: False, 2318: questionNo: 2318, acRate: 57.19728601252609, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Number of Distinct Roll Sequences, slug: number-of-distinct-roll-sequences, url: https://leetcode.com/problems/number-of-distinct-roll-sequences, topics: ['Dynamic Programming', 'Memoization'], hasSolution: False, hasVideoSolution: False, 2319: questionNo: 2319, acRate: 65.19964312340353, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Check if Matrix Is X-Matrix, slug: check-if-matrix-is-x-matrix, url: https://leetcode.com/problems/check-if-matrix-is-x-matrix, topics: ['Array', 'Matrix'], hasSolution: False, hasVideoSolution: False, 2320: questionNo: 2320, acRate: 41.9346508483845, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Count Number of Ways to Place Houses, slug: count-number-of-ways-to-place-houses, url: https://leetcode.com/problems/count-number-of-ways-to-place-houses, topics: ['Dynamic Programming'], hasSolution: False, hasVideoSolution: False, 2321: questionNo: 2321, acRate: 56.86837586594825, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Maximum Score Of Spliced Array, slug: maximum-score-of-spliced-array, url: https://leetcode.com/problems/maximum-score-of-spliced-array, topics: ['Array', 'Dynamic Programming'], hasSolution: False, hasVideoSolution: False, 2322: questionNo: 2322, acRate: 52.40725007080147, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Minimum Score After Removals on a Tree, slug: minimum-score-after-removals-on-a-tree, url: https://leetcode.com/problems/minimum-score-after-removals-on-a-tree, topics: ['Array', 'Bit Manipulation', 'Tree', 'Depth-First Search'], hasSolution: False, hasVideoSolution: False, 2323: questionNo: 2323, acRate: 65.96265187963793, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Find Minimum Time to Finish All Jobs II, slug: find-minimum-time-to-finish-all-jobs-ii, url: https://leetcode.com/problems/find-minimum-time-to-finish-all-jobs-ii, topics: ['Array', 'Greedy', 'Sorting'], hasSolution: False, hasVideoSolution: False, 2324: questionNo: 2324, acRate: 74.11354581673308, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Product Sales Analysis IV, slug: product-sales-analysis-iv, url: https://leetcode.com/problems/product-sales-analysis-iv, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 2325: questionNo: 2325, acRate: 84.50465504893769, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Decode the Message, slug: decode-the-message, url: https://leetcode.com/problems/decode-the-message, topics: ['Hash Table', 'String'], hasSolution: False, hasVideoSolution: False, 2326: questionNo: 2326, acRate: 75.29669011973408, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Spiral Matrix IV, slug: spiral-matrix-iv, url: https://leetcode.com/problems/spiral-matrix-iv, topics: ['Array', 'Linked List', 'Matrix', 'Simulation'], hasSolution: False, hasVideoSolution: False, 2327: questionNo: 2327, acRate: 45.98485133963899, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Number of People Aware of a Secret, slug: number-of-people-aware-of-a-secret, url: https://leetcode.com/problems/number-of-people-aware-of-a-secret, topics: ['Dynamic Programming', 'Queue', 'Simulation'], hasSolution: False, hasVideoSolution: False, 2328: questionNo: 2328, acRate: 58.25805902866378, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Number of Increasing Paths in a Grid, slug: number-of-increasing-paths-in-a-grid, url: https://leetcode.com/problems/number-of-increasing-paths-in-a-grid, topics: ['Array', 'Dynamic Programming', 'Depth-First Search', 'Breadth-First Search', 'Graph', 'Topological Sort', 'Memoization', 'Matrix'], hasSolution: True, hasVideoSolution: False, 2329: questionNo: 2329, acRate: 69.59491509344464, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Product Sales Analysis V, slug: product-sales-analysis-v, url: https://leetcode.com/problems/product-sales-analysis-v, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 2330: questionNo: 2330, acRate: 76.10761446377884, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Valid Palindrome IV, slug: valid-palindrome-iv, url: https://leetcode.com/problems/valid-palindrome-iv, topics: ['Two Pointers', 'String'], hasSolution: False, hasVideoSolution: False, 2331: questionNo: 2331, acRate: 82.85344051305704, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Evaluate Boolean Binary Tree, slug: evaluate-boolean-binary-tree, url: https://leetcode.com/problems/evaluate-boolean-binary-tree, topics: ['Tree', 'Depth-First Search', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 2332: questionNo: 2332, acRate: 27.256153144940747, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: The Latest Time to Catch a Bus, slug: the-latest-time-to-catch-a-bus, url: https://leetcode.com/problems/the-latest-time-to-catch-a-bus, topics: ['Array', 'Two Pointers', 'Binary Search', 'Sorting'], hasSolution: False, hasVideoSolution: False, 2333: questionNo: 2333, acRate: 25.440493494522638, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Sum of Squared Difference, slug: minimum-sum-of-squared-difference, url: https://leetcode.com/problems/minimum-sum-of-squared-difference, topics: ['Array', 'Math', 'Sorting', 'Heap (Priority Queue)'], hasSolution: False, hasVideoSolution: False, 2334: questionNo: 2334, acRate: 42.980759934255055, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Subarray With Elements Greater Than Varying Threshold, slug: subarray-with-elements-greater-than-varying-threshold, url: https://leetcode.com/problems/subarray-with-elements-greater-than-varying-threshold, topics: ['Array', 'Stack', 'Union Find', 'Monotonic Stack'], hasSolution: False, hasVideoSolution: False, 2335: questionNo: 2335, acRate: 57.855334797974976, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Minimum Amount of Time to Fill Cups, slug: minimum-amount-of-time-to-fill-cups, url: https://leetcode.com/problems/minimum-amount-of-time-to-fill-cups, topics: ['Array', 'Greedy', 'Sorting', 'Heap (Priority Queue)'], hasSolution: False, hasVideoSolution: False, 2336: questionNo: 2336, acRate: 71.64848693768006, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Smallest Number in Infinite Set, slug: smallest-number-in-infinite-set, url: https://leetcode.com/problems/smallest-number-in-infinite-set, topics: ['Hash Table', 'Design', 'Heap (Priority Queue)'], hasSolution: True, hasVideoSolution: False, 2337: questionNo: 2337, acRate: 47.6274391027406, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Move Pieces to Obtain a String, slug: move-pieces-to-obtain-a-string, url: https://leetcode.com/problems/move-pieces-to-obtain-a-string, topics: ['Two Pointers', 'String'], hasSolution: False, hasVideoSolution: False, 2338: questionNo: 2338, acRate: 26.845781377212152, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Count the Number of Ideal Arrays, slug: count-the-number-of-ideal-arrays, url: https://leetcode.com/problems/count-the-number-of-ideal-arrays, topics: ['Math', 'Dynamic Programming', 'Combinatorics', 'Number Theory'], hasSolution: False, hasVideoSolution: False, 2339: questionNo: 2339, acRate: 87.65607886089813, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: All the Matches of the League, slug: all-the-matches-of-the-league, url: https://leetcode.com/problems/all-the-matches-of-the-league, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 2340: questionNo: 2340, acRate: 72.47765310003804, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Minimum Adjacent Swaps to Make a Valid Array, slug: minimum-adjacent-swaps-to-make-a-valid-array, url: https://leetcode.com/problems/minimum-adjacent-swaps-to-make-a-valid-array, topics: ['Array', 'Greedy'], hasSolution: False, hasVideoSolution: False, 2341: questionNo: 2341, acRate: 75.30925019545684, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Maximum Number of Pairs in Array, slug: maximum-number-of-pairs-in-array, url: https://leetcode.com/problems/maximum-number-of-pairs-in-array, topics: ['Array', 'Hash Table', 'Counting'], hasSolution: False, hasVideoSolution: False, 2342: questionNo: 2342, acRate: 55.033791788426164, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Max Sum of a Pair With Equal Sum of Digits, slug: max-sum-of-a-pair-with-equal-sum-of-digits, url: https://leetcode.com/problems/max-sum-of-a-pair-with-equal-sum-of-digits, topics: ['Array', 'Hash Table', 'Sorting', 'Heap (Priority Queue)'], hasSolution: False, hasVideoSolution: False, 2343: questionNo: 2343, acRate: 44.117085212995754, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Query Kth Smallest Trimmed Number, slug: query-kth-smallest-trimmed-number, url: https://leetcode.com/problems/query-kth-smallest-trimmed-number, topics: ['Array', 'String', 'Divide and Conquer', 'Sorting', 'Heap (Priority Queue)', 'Radix Sort', 'Quickselect'], hasSolution: False, hasVideoSolution: False, 2344: questionNo: 2344, acRate: 56.19489282089047, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Minimum Deletions to Make Array Divisible, slug: minimum-deletions-to-make-array-divisible, url: https://leetcode.com/problems/minimum-deletions-to-make-array-divisible, topics: ['Array', 'Math', 'Sorting', 'Heap (Priority Queue)', 'Number Theory'], hasSolution: False, hasVideoSolution: False, 2345: questionNo: 2345, acRate: 37.92678091545883, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Finding the Number of Visible Mountains, slug: finding-the-number-of-visible-mountains, url: https://leetcode.com/problems/finding-the-number-of-visible-mountains, topics: ['Array', 'Stack', 'Sorting', 'Monotonic Stack'], hasSolution: False, hasVideoSolution: False, 2346: questionNo: 2346, acRate: 33.62591431556949, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Compute the Rank as a Percentage, slug: compute-the-rank-as-a-percentage, url: https://leetcode.com/problems/compute-the-rank-as-a-percentage, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 2347: questionNo: 2347, acRate: 60.60658830358439, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Best Poker Hand, slug: best-poker-hand, url: https://leetcode.com/problems/best-poker-hand, topics: ['Array', 'Hash Table', 'Counting'], hasSolution: False, hasVideoSolution: False, 2348: questionNo: 2348, acRate: 66.75065622320531, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Number of Zero-Filled Subarrays, slug: number-of-zero-filled-subarrays, url: https://leetcode.com/problems/number-of-zero-filled-subarrays, topics: ['Array', 'Math'], hasSolution: True, hasVideoSolution: False, 2349: questionNo: 2349, acRate: 44.820101043087384, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Design a Number Container System, slug: design-a-number-container-system, url: https://leetcode.com/problems/design-a-number-container-system, topics: ['Hash Table', 'Design', 'Heap (Priority Queue)', 'Ordered Set'], hasSolution: False, hasVideoSolution: False, 2350: questionNo: 2350, acRate: 68.53428752604403, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Shortest Impossible Sequence of Rolls, slug: shortest-impossible-sequence-of-rolls, url: https://leetcode.com/problems/shortest-impossible-sequence-of-rolls, topics: ['Array', 'Hash Table', 'Greedy'], hasSolution: False, hasVideoSolution: False, 2351: questionNo: 2351, acRate: 73.61853193244164, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: First Letter to Appear Twice, slug: first-letter-to-appear-twice, url: https://leetcode.com/problems/first-letter-to-appear-twice, topics: ['Hash Table', 'String', 'Bit Manipulation', 'Counting'], hasSolution: False, hasVideoSolution: False, 2352: questionNo: 2352, acRate: 70.43016708206406, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Equal Row and Column Pairs, slug: equal-row-and-column-pairs, url: https://leetcode.com/problems/equal-row-and-column-pairs, topics: ['Array', 'Hash Table', 'Matrix', 'Simulation'], hasSolution: True, hasVideoSolution: False, 2353: questionNo: 2353, acRate: 45.24207190999168, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Design a Food Rating System, slug: design-a-food-rating-system, url: https://leetcode.com/problems/design-a-food-rating-system, topics: ['Hash Table', 'Design', 'Heap (Priority Queue)', 'Ordered Set'], hasSolution: True, hasVideoSolution: False, 2354: questionNo: 2354, acRate: 47.4329091596321, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Number of Excellent Pairs, slug: number-of-excellent-pairs, url: https://leetcode.com/problems/number-of-excellent-pairs, topics: ['Array', 'Hash Table', 'Binary Search', 'Bit Manipulation'], hasSolution: False, hasVideoSolution: False, 2355: questionNo: 2355, acRate: 40.369727226684034, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Maximum Number of Books You Can Take, slug: maximum-number-of-books-you-can-take, url: https://leetcode.com/problems/maximum-number-of-books-you-can-take, topics: ['Array', 'Dynamic Programming', 'Stack', 'Monotonic Stack'], hasSolution: True, hasVideoSolution: False, 2356: questionNo: 2356, acRate: 88.35213558241665, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Number of Unique Subjects Taught by Each Teacher, slug: number-of-unique-subjects-taught-by-each-teacher, url: https://leetcode.com/problems/number-of-unique-subjects-taught-by-each-teacher, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 2357: questionNo: 2357, acRate: 72.43800017869223, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Make Array Zero by Subtracting Equal Amounts, slug: make-array-zero-by-subtracting-equal-amounts, url: https://leetcode.com/problems/make-array-zero-by-subtracting-equal-amounts, topics: ['Array', 'Hash Table', 'Greedy', 'Sorting', 'Heap (Priority Queue)', 'Simulation'], hasSolution: False, hasVideoSolution: False, 2358: questionNo: 2358, acRate: 68.01195547123886, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum Number of Groups Entering a Competition, slug: maximum-number-of-groups-entering-a-competition, url: https://leetcode.com/problems/maximum-number-of-groups-entering-a-competition, topics: ['Array', 'Math', 'Binary Search', 'Greedy'], hasSolution: False, hasVideoSolution: False, 2359: questionNo: 2359, acRate: 45.4797592007614, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Find Closest Node to Given Two Nodes, slug: find-closest-node-to-given-two-nodes, url: https://leetcode.com/problems/find-closest-node-to-given-two-nodes, topics: ['Depth-First Search', 'Graph'], hasSolution: True, hasVideoSolution: False, 2360: questionNo: 2360, acRate: 49.80641864669929, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Longest Cycle in a Graph, slug: longest-cycle-in-a-graph, url: https://leetcode.com/problems/longest-cycle-in-a-graph, topics: ['Depth-First Search', 'Graph', 'Topological Sort'], hasSolution: True, hasVideoSolution: False, 2361: questionNo: 2361, acRate: 78.85680083794703, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Minimum Costs Using the Train Line, slug: minimum-costs-using-the-train-line, url: https://leetcode.com/problems/minimum-costs-using-the-train-line, topics: ['Array', 'Dynamic Programming'], hasSolution: True, hasVideoSolution: False, 2362: questionNo: 2362, acRate: 74.1326216382673, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Generate the Invoice, slug: generate-the-invoice, url: https://leetcode.com/problems/generate-the-invoice, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 2363: questionNo: 2363, acRate: 75.71498949879431, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Merge Similar Items, slug: merge-similar-items, url: https://leetcode.com/problems/merge-similar-items, topics: ['Array', 'Hash Table', 'Sorting', 'Ordered Set'], hasSolution: False, hasVideoSolution: False, 2364: questionNo: 2364, acRate: 41.78521402778313, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Count Number of Bad Pairs, slug: count-number-of-bad-pairs, url: https://leetcode.com/problems/count-number-of-bad-pairs, topics: ['Array', 'Hash Table'], hasSolution: False, hasVideoSolution: False, 2365: questionNo: 2365, acRate: 52.43398392652124, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Task Scheduler II, slug: task-scheduler-ii, url: https://leetcode.com/problems/task-scheduler-ii, topics: ['Array', 'Hash Table', 'Simulation'], hasSolution: False, hasVideoSolution: False, 2366: questionNo: 2366, acRate: 53.58606557377049, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Minimum Replacements to Sort the Array, slug: minimum-replacements-to-sort-the-array, url: https://leetcode.com/problems/minimum-replacements-to-sort-the-array, topics: ['Array', 'Math', 'Greedy'], hasSolution: True, hasVideoSolution: False, 2367: questionNo: 2367, acRate: 84.2813188507268, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Number of Arithmetic Triplets, slug: number-of-arithmetic-triplets, url: https://leetcode.com/problems/number-of-arithmetic-triplets, topics: ['Array', 'Hash Table', 'Two Pointers', 'Enumeration'], hasSolution: False, hasVideoSolution: False, 2368: questionNo: 2368, acRate: 58.87894687036705, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Reachable Nodes With Restrictions, slug: reachable-nodes-with-restrictions, url: https://leetcode.com/problems/reachable-nodes-with-restrictions, topics: ['Array', 'Hash Table', 'Tree', 'Depth-First Search', 'Breadth-First Search', 'Union Find', 'Graph'], hasSolution: True, hasVideoSolution: False, 2369: questionNo: 2369, acRate: 51.85344244356722, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Check if There is a Valid Partition For The Array, slug: check-if-there-is-a-valid-partition-for-the-array, url: https://leetcode.com/problems/check-if-there-is-a-valid-partition-for-the-array, topics: ['Array', 'Dynamic Programming'], hasSolution: True, hasVideoSolution: False, 2370: questionNo: 2370, acRate: 47.37080821068488, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Longest Ideal Subsequence, slug: longest-ideal-subsequence, url: https://leetcode.com/problems/longest-ideal-subsequence, topics: ['Hash Table', 'String', 'Dynamic Programming'], hasSolution: True, hasVideoSolution: False, 2371: questionNo: 2371, acRate: 66.04166666666667, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Minimize Maximum Value in a Grid, slug: minimize-maximum-value-in-a-grid, url: https://leetcode.com/problems/minimize-maximum-value-in-a-grid, topics: ['Array', 'Union Find', 'Graph', 'Topological Sort', 'Sorting', 'Matrix'], hasSolution: False, hasVideoSolution: False, 2372: questionNo: 2372, acRate: 83.12921004286589, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Calculate the Influence of Each Salesperson, slug: calculate-the-influence-of-each-salesperson, url: https://leetcode.com/problems/calculate-the-influence-of-each-salesperson, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 2373: questionNo: 2373, acRate: 88.05448600331911, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Largest Local Values in a Matrix, slug: largest-local-values-in-a-matrix, url: https://leetcode.com/problems/largest-local-values-in-a-matrix, topics: ['Array', 'Matrix'], hasSolution: True, hasVideoSolution: False, 2374: questionNo: 2374, acRate: 47.72730409816832, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Node With Highest Edge Score, slug: node-with-highest-edge-score, url: https://leetcode.com/problems/node-with-highest-edge-score, topics: ['Hash Table', 'Graph'], hasSolution: False, hasVideoSolution: False, 2375: questionNo: 2375, acRate: 76.15436241610738, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Construct Smallest Number From DI String, slug: construct-smallest-number-from-di-string, url: https://leetcode.com/problems/construct-smallest-number-from-di-string, topics: ['String', 'Backtracking', 'Stack', 'Greedy'], hasSolution: False, hasVideoSolution: False, 2376: questionNo: 2376, acRate: 38.78133213667543, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Count Special Integers, slug: count-special-integers, url: https://leetcode.com/problems/count-special-integers, topics: ['Math', 'Dynamic Programming'], hasSolution: False, hasVideoSolution: False, 2377: questionNo: 2377, acRate: 78.78865979381443, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Sort the Olympic Table, slug: sort-the-olympic-table, url: https://leetcode.com/problems/sort-the-olympic-table, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 2378: questionNo: 2378, acRate: 58.47389558232932, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Choose Edges to Maximize Score in a Tree, slug: choose-edges-to-maximize-score-in-a-tree, url: https://leetcode.com/problems/choose-edges-to-maximize-score-in-a-tree, topics: ['Dynamic Programming', 'Tree', 'Depth-First Search'], hasSolution: False, hasVideoSolution: False, 2379: questionNo: 2379, acRate: 58.987510193570536, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Minimum Recolors to Get K Consecutive Black Blocks, slug: minimum-recolors-to-get-k-consecutive-black-blocks, url: https://leetcode.com/problems/minimum-recolors-to-get-k-consecutive-black-blocks, topics: ['String', 'Sliding Window'], hasSolution: False, hasVideoSolution: False, 2380: questionNo: 2380, acRate: 49.967813815300815, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Time Needed to Rearrange a Binary String, slug: time-needed-to-rearrange-a-binary-string, url: https://leetcode.com/problems/time-needed-to-rearrange-a-binary-string, topics: ['String', 'Dynamic Programming', 'Simulation'], hasSolution: False, hasVideoSolution: False, 2381: questionNo: 2381, acRate: 37.629549084236636, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Shifting Letters II, slug: shifting-letters-ii, url: https://leetcode.com/problems/shifting-letters-ii, topics: ['Array', 'String', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 2382: questionNo: 2382, acRate: 49.13479793870355, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Maximum Segment Sum After Removals, slug: maximum-segment-sum-after-removals, url: https://leetcode.com/problems/maximum-segment-sum-after-removals, topics: ['Array', 'Union Find', 'Prefix Sum', 'Ordered Set'], hasSolution: False, hasVideoSolution: False, 2383: questionNo: 2383, acRate: 41.20664758189142, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Minimum Hours of Training to Win a Competition, slug: minimum-hours-of-training-to-win-a-competition, url: https://leetcode.com/problems/minimum-hours-of-training-to-win-a-competition, topics: ['Array', 'Greedy'], hasSolution: False, hasVideoSolution: False, 2384: questionNo: 2384, acRate: 35.363468240984425, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Largest Palindromic Number, slug: largest-palindromic-number, url: https://leetcode.com/problems/largest-palindromic-number, topics: ['Hash Table', 'String', 'Greedy', 'Counting'], hasSolution: False, hasVideoSolution: False, 2385: questionNo: 2385, acRate: 62.719528678494605, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Amount of Time for Binary Tree to Be Infected, slug: amount-of-time-for-binary-tree-to-be-infected, url: https://leetcode.com/problems/amount-of-time-for-binary-tree-to-be-infected, topics: ['Hash Table', 'Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree'], hasSolution: True, hasVideoSolution: False, 2386: questionNo: 2386, acRate: 38.982832064024784, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Find the K-Sum of an Array, slug: find-the-k-sum-of-an-array, url: https://leetcode.com/problems/find-the-k-sum-of-an-array, topics: ['Array', 'Sorting', 'Heap (Priority Queue)'], hasSolution: False, hasVideoSolution: False, 2387: questionNo: 2387, acRate: 69.6247892074199, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Median of a Row Wise Sorted Matrix, slug: median-of-a-row-wise-sorted-matrix, url: https://leetcode.com/problems/median-of-a-row-wise-sorted-matrix, topics: ['Array', 'Binary Search', 'Matrix'], hasSolution: False, hasVideoSolution: False, 2388: questionNo: 2388, acRate: 50.61842561553578, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Change Null Values in a Table to the Previous Value, slug: change-null-values-in-a-table-to-the-previous-value, url: https://leetcode.com/problems/change-null-values-in-a-table-to-the-previous-value, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 2389: questionNo: 2389, acRate: 71.85045574311972, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Longest Subsequence With Limited Sum, slug: longest-subsequence-with-limited-sum, url: https://leetcode.com/problems/longest-subsequence-with-limited-sum, topics: ['Array', 'Binary Search', 'Greedy', 'Sorting', 'Prefix Sum'], hasSolution: True, hasVideoSolution: False, 2390: questionNo: 2390, acRate: 75.77192386828932, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Removing Stars From a String, slug: removing-stars-from-a-string, url: https://leetcode.com/problems/removing-stars-from-a-string, topics: ['String', 'Stack', 'Simulation'], hasSolution: True, hasVideoSolution: False, 2391: questionNo: 2391, acRate: 85.24128823815995, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Amount of Time to Collect Garbage, slug: minimum-amount-of-time-to-collect-garbage, url: https://leetcode.com/problems/minimum-amount-of-time-to-collect-garbage, topics: ['Array', 'String', 'Prefix Sum'], hasSolution: True, hasVideoSolution: False, 2392: questionNo: 2392, acRate: 79.59957435773623, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Build a Matrix With Conditions, slug: build-a-matrix-with-conditions, url: https://leetcode.com/problems/build-a-matrix-with-conditions, topics: ['Array', 'Graph', 'Topological Sort', 'Matrix'], hasSolution: True, hasVideoSolution: False, 2393: questionNo: 2393, acRate: 74.83016304347827, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Count Strictly Increasing Subarrays, slug: count-strictly-increasing-subarrays, url: https://leetcode.com/problems/count-strictly-increasing-subarrays, topics: ['Array', 'Math', 'Dynamic Programming'], hasSolution: True, hasVideoSolution: False, 2394: questionNo: 2394, acRate: 40.53554939981533, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Employees With Deductions, slug: employees-with-deductions, url: https://leetcode.com/problems/employees-with-deductions, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 2395: questionNo: 2395, acRate: 65.25350428655015, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Find Subarrays With Equal Sum, slug: find-subarrays-with-equal-sum, url: https://leetcode.com/problems/find-subarrays-with-equal-sum, topics: ['Array', 'Hash Table'], hasSolution: False, hasVideoSolution: False, 2396: questionNo: 2396, acRate: 87.64518310947918, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Strictly Palindromic Number, slug: strictly-palindromic-number, url: https://leetcode.com/problems/strictly-palindromic-number, topics: ['Math', 'Two Pointers', 'Brainteaser'], hasSolution: False, hasVideoSolution: False, 2397: questionNo: 2397, acRate: 55.11877310493759, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum Rows Covered by Columns, slug: maximum-rows-covered-by-columns, url: https://leetcode.com/problems/maximum-rows-covered-by-columns, topics: ['Array', 'Backtracking', 'Bit Manipulation', 'Matrix', 'Enumeration'], hasSolution: False, hasVideoSolution: False, 2398: questionNo: 2398, acRate: 34.629924553190804, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Maximum Number of Robots Within Budget, slug: maximum-number-of-robots-within-budget, url: https://leetcode.com/problems/maximum-number-of-robots-within-budget, topics: ['Array', 'Binary Search', 'Queue', 'Sliding Window', 'Heap (Priority Queue)', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 2399: questionNo: 2399, acRate: 70.66142203599983, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Check Distances Between Same Letters, slug: check-distances-between-same-letters, url: https://leetcode.com/problems/check-distances-between-same-letters, topics: ['Array', 'Hash Table', 'String'], hasSolution: False, hasVideoSolution: False, 2400: questionNo: 2400, acRate: 35.258006015071466, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Number of Ways to Reach a Position After Exactly k Steps, slug: number-of-ways-to-reach-a-position-after-exactly-k-steps, url: https://leetcode.com/problems/number-of-ways-to-reach-a-position-after-exactly-k-steps, topics: ['Math', 'Dynamic Programming', 'Combinatorics'], hasSolution: False, hasVideoSolution: False, 2401: questionNo: 2401, acRate: 51.4118897601405, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Longest Nice Subarray, slug: longest-nice-subarray, url: https://leetcode.com/problems/longest-nice-subarray, topics: ['Array', 'Bit Manipulation', 'Sliding Window'], hasSolution: False, hasVideoSolution: False, 2402: questionNo: 2402, acRate: 44.27375713884468, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Meeting Rooms III, slug: meeting-rooms-iii, url: https://leetcode.com/problems/meeting-rooms-iii, topics: ['Array', 'Hash Table', 'Sorting', 'Heap (Priority Queue)', 'Simulation'], hasSolution: True, hasVideoSolution: False, 2403: questionNo: 2403, acRate: 55.767634854771785, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Minimum Time to Kill All Monsters, slug: minimum-time-to-kill-all-monsters, url: https://leetcode.com/problems/minimum-time-to-kill-all-monsters, topics: ['Array', 'Dynamic Programming', 'Bit Manipulation', 'Bitmask'], hasSolution: False, hasVideoSolution: False, 2404: questionNo: 2404, acRate: 50.639962219827325, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Most Frequent Even Element, slug: most-frequent-even-element, url: https://leetcode.com/problems/most-frequent-even-element, topics: ['Array', 'Hash Table', 'Counting'], hasSolution: False, hasVideoSolution: False, 2405: questionNo: 2405, acRate: 77.98264725879226, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Optimal Partition of String, slug: optimal-partition-of-string, url: https://leetcode.com/problems/optimal-partition-of-string, topics: ['Hash Table', 'String', 'Greedy'], hasSolution: True, hasVideoSolution: False, 2406: questionNo: 2406, acRate: 47.25716282320056, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Divide Intervals Into Minimum Number of Groups, slug: divide-intervals-into-minimum-number-of-groups, url: https://leetcode.com/problems/divide-intervals-into-minimum-number-of-groups, topics: ['Array', 'Two Pointers', 'Greedy', 'Sorting', 'Heap (Priority Queue)', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 2407: questionNo: 2407, acRate: 24.144352108341028, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Longest Increasing Subsequence II, slug: longest-increasing-subsequence-ii, url: https://leetcode.com/problems/longest-increasing-subsequence-ii, topics: ['Array', 'Divide and Conquer', 'Dynamic Programming', 'Binary Indexed Tree', 'Segment Tree', 'Queue', 'Monotonic Queue'], hasSolution: False, hasVideoSolution: False, 2408: questionNo: 2408, acRate: 78.3768182867698, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Design SQL, slug: design-sql, url: https://leetcode.com/problems/design-sql, topics: ['Array', 'Hash Table', 'String', 'Design'], hasSolution: False, hasVideoSolution: False, 2409: questionNo: 2409, acRate: 45.14798310988306, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Count Days Spent Together, slug: count-days-spent-together, url: https://leetcode.com/problems/count-days-spent-together, topics: ['Math', 'String'], hasSolution: False, hasVideoSolution: False, 2410: questionNo: 2410, acRate: 63.29914677238645, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum Matching of Players With Trainers, slug: maximum-matching-of-players-with-trainers, url: https://leetcode.com/problems/maximum-matching-of-players-with-trainers, topics: ['Array', 'Two Pointers', 'Greedy', 'Sorting'], hasSolution: False, hasVideoSolution: False, 2411: questionNo: 2411, acRate: 44.28924975421229, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Smallest Subarrays With Maximum Bitwise OR, slug: smallest-subarrays-with-maximum-bitwise-or, url: https://leetcode.com/problems/smallest-subarrays-with-maximum-bitwise-or, topics: ['Array', 'Binary Search', 'Bit Manipulation', 'Sliding Window'], hasSolution: False, hasVideoSolution: False, 2412: questionNo: 2412, acRate: 40.430639957986344, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Minimum Money Required Before Transactions, slug: minimum-money-required-before-transactions, url: https://leetcode.com/problems/minimum-money-required-before-transactions, topics: ['Array', 'Greedy', 'Sorting'], hasSolution: False, hasVideoSolution: False, 2413: questionNo: 2413, acRate: 87.8229165636038, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Smallest Even Multiple, slug: smallest-even-multiple, url: https://leetcode.com/problems/smallest-even-multiple, topics: ['Math', 'Number Theory'], hasSolution: False, hasVideoSolution: False, 2414: questionNo: 2414, acRate: 58.36312418680444, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Length of the Longest Alphabetical Continuous Substring, slug: length-of-the-longest-alphabetical-continuous-substring, url: https://leetcode.com/problems/length-of-the-longest-alphabetical-continuous-substring, topics: ['String'], hasSolution: False, hasVideoSolution: False, 2415: questionNo: 2415, acRate: 77.94210057139517, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Reverse Odd Levels of Binary Tree, slug: reverse-odd-levels-of-binary-tree, url: https://leetcode.com/problems/reverse-odd-levels-of-binary-tree, topics: ['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree'], hasSolution: False, hasVideoSolution: False, 2416: questionNo: 2416, acRate: 46.225769669327256, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Sum of Prefix Scores of Strings, slug: sum-of-prefix-scores-of-strings, url: https://leetcode.com/problems/sum-of-prefix-scores-of-strings, topics: ['Array', 'String', 'Trie', 'Counting'], hasSolution: False, hasVideoSolution: False, 2417: questionNo: 2417, acRate: 45.10045100451004, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Closest Fair Integer, slug: closest-fair-integer, url: https://leetcode.com/problems/closest-fair-integer, topics: ['Math', 'Enumeration'], hasSolution: False, hasVideoSolution: False, 2418: questionNo: 2418, acRate: 85.06010169709212, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Sort the People, slug: sort-the-people, url: https://leetcode.com/problems/sort-the-people, topics: ['Array', 'Hash Table', 'String', 'Sorting'], hasSolution: True, hasVideoSolution: False, 2419: questionNo: 2419, acRate: 49.60551230801599, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Longest Subarray With Maximum Bitwise AND, slug: longest-subarray-with-maximum-bitwise-and, url: https://leetcode.com/problems/longest-subarray-with-maximum-bitwise-and, topics: ['Array', 'Bit Manipulation', 'Brainteaser'], hasSolution: False, hasVideoSolution: False, 2420: questionNo: 2420, acRate: 38.8042013669053, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Find All Good Indices, slug: find-all-good-indices, url: https://leetcode.com/problems/find-all-good-indices, topics: ['Array', 'Dynamic Programming', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 2421: questionNo: 2421, acRate: 56.334264301070945, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Number of Good Paths, slug: number-of-good-paths, url: https://leetcode.com/problems/number-of-good-paths, topics: ['Array', 'Hash Table', 'Tree', 'Union Find', 'Graph', 'Sorting'], hasSolution: True, hasVideoSolution: False, 2422: questionNo: 2422, acRate: 69.18271142159368, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Merge Operations to Turn Array Into a Palindrome, slug: merge-operations-to-turn-array-into-a-palindrome, url: https://leetcode.com/problems/merge-operations-to-turn-array-into-a-palindrome, topics: ['Array', 'Two Pointers', 'Greedy'], hasSolution: False, hasVideoSolution: False, 2423: questionNo: 2423, acRate: 17.389089983083835, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Remove Letter To Equalize Frequency, slug: remove-letter-to-equalize-frequency, url: https://leetcode.com/problems/remove-letter-to-equalize-frequency, topics: ['Hash Table', 'String', 'Counting'], hasSolution: False, hasVideoSolution: False, 2424: questionNo: 2424, acRate: 55.43102327395657, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Longest Uploaded Prefix, slug: longest-uploaded-prefix, url: https://leetcode.com/problems/longest-uploaded-prefix, topics: ['Binary Search', 'Union Find', 'Design', 'Binary Indexed Tree', 'Segment Tree', 'Heap (Priority Queue)', 'Ordered Set'], hasSolution: False, hasVideoSolution: False, 2425: questionNo: 2425, acRate: 58.1253402871307, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Bitwise XOR of All Pairings, slug: bitwise-xor-of-all-pairings, url: https://leetcode.com/problems/bitwise-xor-of-all-pairings, topics: ['Array', 'Bit Manipulation', 'Brainteaser'], hasSolution: False, hasVideoSolution: False, 2426: questionNo: 2426, acRate: 44.24242424242424, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Number of Pairs Satisfying Inequality, slug: number-of-pairs-satisfying-inequality, url: https://leetcode.com/problems/number-of-pairs-satisfying-inequality, topics: ['Array', 'Binary Search', 'Divide and Conquer', 'Binary Indexed Tree', 'Segment Tree', 'Merge Sort', 'Ordered Set'], hasSolution: False, hasVideoSolution: False, 2427: questionNo: 2427, acRate: 79.090378389853, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Number of Common Factors, slug: number-of-common-factors, url: https://leetcode.com/problems/number-of-common-factors, topics: ['Math', 'Enumeration', 'Number Theory'], hasSolution: False, hasVideoSolution: False, 2428: questionNo: 2428, acRate: 74.89918776875298, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum Sum of an Hourglass, slug: maximum-sum-of-an-hourglass, url: https://leetcode.com/problems/maximum-sum-of-an-hourglass, topics: ['Array', 'Matrix', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 2429: questionNo: 2429, acRate: 44.260595670029105, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimize XOR, slug: minimize-xor, url: https://leetcode.com/problems/minimize-xor, topics: ['Greedy', 'Bit Manipulation'], hasSolution: False, hasVideoSolution: False, 2430: questionNo: 2430, acRate: 33.53442947212263, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Maximum Deletions on a String, slug: maximum-deletions-on-a-string, url: https://leetcode.com/problems/maximum-deletions-on-a-string, topics: ['String', 'Dynamic Programming', 'Rolling Hash', 'String Matching', 'Hash Function'], hasSolution: False, hasVideoSolution: False, 2431: questionNo: 2431, acRate: 63.90977443609023, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Maximize Total Tastiness of Purchased Fruits, slug: maximize-total-tastiness-of-purchased-fruits, url: https://leetcode.com/problems/maximize-total-tastiness-of-purchased-fruits, topics: ['Array', 'Dynamic Programming'], hasSolution: False, hasVideoSolution: False, 2432: questionNo: 2432, acRate: 50.18023280664511, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: The Employee That Worked on the Longest Task, slug: the-employee-that-worked-on-the-longest-task, url: https://leetcode.com/problems/the-employee-that-worked-on-the-longest-task, topics: ['Array'], hasSolution: False, hasVideoSolution: False, 2433: questionNo: 2433, acRate: 88.07742450758154, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Find The Original Array of Prefix Xor, slug: find-the-original-array-of-prefix-xor, url: https://leetcode.com/problems/find-the-original-array-of-prefix-xor, topics: ['Array', 'Bit Manipulation'], hasSolution: True, hasVideoSolution: False, 2434: questionNo: 2434, acRate: 39.973391899311565, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Using a Robot to Print the Lexicographically Smallest String, slug: using-a-robot-to-print-the-lexicographically-smallest-string, url: https://leetcode.com/problems/using-a-robot-to-print-the-lexicographically-smallest-string, topics: ['Hash Table', 'String', 'Stack', 'Greedy'], hasSolution: False, hasVideoSolution: False, 2435: questionNo: 2435, acRate: 42.913422235374625, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Paths in Matrix Whose Sum Is Divisible by K, slug: paths-in-matrix-whose-sum-is-divisible-by-k, url: https://leetcode.com/problems/paths-in-matrix-whose-sum-is-divisible-by-k, topics: ['Array', 'Dynamic Programming', 'Matrix'], hasSolution: False, hasVideoSolution: False, 2436: questionNo: 2436, acRate: 71.08024691358025, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Minimum Split Into Subarrays With GCD Greater Than One, slug: minimum-split-into-subarrays-with-gcd-greater-than-one, url: https://leetcode.com/problems/minimum-split-into-subarrays-with-gcd-greater-than-one, topics: ['Array', 'Math', 'Dynamic Programming', 'Greedy', 'Number Theory'], hasSolution: False, hasVideoSolution: False, 2437: questionNo: 2437, acRate: 46.75941585658191, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Number of Valid Clock Times, slug: number-of-valid-clock-times, url: https://leetcode.com/problems/number-of-valid-clock-times, topics: ['String', 'Enumeration'], hasSolution: False, hasVideoSolution: False, 2438: questionNo: 2438, acRate: 40.4289412054727, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Range Product Queries of Powers, slug: range-product-queries-of-powers, url: https://leetcode.com/problems/range-product-queries-of-powers, topics: ['Array', 'Bit Manipulation', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 2439: questionNo: 2439, acRate: 46.5097074288796, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimize Maximum of Array, slug: minimize-maximum-of-array, url: https://leetcode.com/problems/minimize-maximum-of-array, topics: ['Array', 'Binary Search', 'Dynamic Programming', 'Greedy', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 2440: questionNo: 2440, acRate: 52.967857980761714, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Create Components With Same Value, slug: create-components-with-same-value, url: https://leetcode.com/problems/create-components-with-same-value, topics: ['Array', 'Math', 'Tree', 'Depth-First Search', 'Enumeration'], hasSolution: False, hasVideoSolution: False, 2441: questionNo: 2441, acRate: 75.10377491775375, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Largest Positive Integer That Exists With Its Negative, slug: largest-positive-integer-that-exists-with-its-negative, url: https://leetcode.com/problems/largest-positive-integer-that-exists-with-its-negative, topics: ['Array', 'Hash Table', 'Two Pointers', 'Sorting'], hasSolution: True, hasVideoSolution: False, 2442: questionNo: 2442, acRate: 79.6351981784658, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Count Number of Distinct Integers After Reverse Operations, slug: count-number-of-distinct-integers-after-reverse-operations, url: https://leetcode.com/problems/count-number-of-distinct-integers-after-reverse-operations, topics: ['Array', 'Hash Table', 'Math'], hasSolution: False, hasVideoSolution: False, 2443: questionNo: 2443, acRate: 47.4047404740474, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Sum of Number and Its Reverse, slug: sum-of-number-and-its-reverse, url: https://leetcode.com/problems/sum-of-number-and-its-reverse, topics: ['Math', 'Enumeration'], hasSolution: False, hasVideoSolution: False, 2444: questionNo: 2444, acRate: 67.9252027014316, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Count Subarrays With Fixed Bounds, slug: count-subarrays-with-fixed-bounds, url: https://leetcode.com/problems/count-subarrays-with-fixed-bounds, topics: ['Array', 'Queue', 'Sliding Window', 'Monotonic Queue'], hasSolution: True, hasVideoSolution: False, 2445: questionNo: 2445, acRate: 68.8413183826028, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Number of Nodes With Value One, slug: number-of-nodes-with-value-one, url: https://leetcode.com/problems/number-of-nodes-with-value-one, topics: ['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree'], hasSolution: False, hasVideoSolution: False, 2446: questionNo: 2446, acRate: 51.00552984990407, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Determine if Two Events Have Conflict, slug: determine-if-two-events-have-conflict, url: https://leetcode.com/problems/determine-if-two-events-have-conflict, topics: ['Array', 'String'], hasSolution: False, hasVideoSolution: False, 2447: questionNo: 2447, acRate: 50.15793403143366, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Number of Subarrays With GCD Equal to K, slug: number-of-subarrays-with-gcd-equal-to-k, url: https://leetcode.com/problems/number-of-subarrays-with-gcd-equal-to-k, topics: ['Array', 'Math', 'Number Theory'], hasSolution: False, hasVideoSolution: False, 2448: questionNo: 2448, acRate: 45.93172776601833, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Minimum Cost to Make Array Equal, slug: minimum-cost-to-make-array-equal, url: https://leetcode.com/problems/minimum-cost-to-make-array-equal, topics: ['Array', 'Binary Search', 'Greedy', 'Sorting', 'Prefix Sum'], hasSolution: True, hasVideoSolution: False, 2449: questionNo: 2449, acRate: 61.973945469514256, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Minimum Number of Operations to Make Arrays Similar, slug: minimum-number-of-operations-to-make-arrays-similar, url: https://leetcode.com/problems/minimum-number-of-operations-to-make-arrays-similar, topics: ['Array', 'Greedy', 'Sorting'], hasSolution: False, hasVideoSolution: False, 2450: questionNo: 2450, acRate: 63.074901445466494, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Number of Distinct Binary Strings After Applying Operations, slug: number-of-distinct-binary-strings-after-applying-operations, url: https://leetcode.com/problems/number-of-distinct-binary-strings-after-applying-operations, topics: ['Math', 'String'], hasSolution: False, hasVideoSolution: False, 2451: questionNo: 2451, acRate: 59.16721428998149, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Odd String Difference, slug: odd-string-difference, url: https://leetcode.com/problems/odd-string-difference, topics: ['Array', 'Hash Table', 'String'], hasSolution: False, hasVideoSolution: False, 2452: questionNo: 2452, acRate: 60.7522849126316, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Words Within Two Edits of Dictionary, slug: words-within-two-edits-of-dictionary, url: https://leetcode.com/problems/words-within-two-edits-of-dictionary, topics: ['Array', 'String'], hasSolution: False, hasVideoSolution: False, 2453: questionNo: 2453, acRate: 39.389415041782726, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Destroy Sequential Targets, slug: destroy-sequential-targets, url: https://leetcode.com/problems/destroy-sequential-targets, topics: ['Array', 'Hash Table', 'Counting'], hasSolution: False, hasVideoSolution: False, 2454: questionNo: 2454, acRate: 38.801633133482916, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Next Greater Element IV, slug: next-greater-element-iv, url: https://leetcode.com/problems/next-greater-element-iv, topics: ['Array', 'Binary Search', 'Stack', 'Sorting', 'Heap (Priority Queue)', 'Monotonic Stack'], hasSolution: False, hasVideoSolution: False, 2455: questionNo: 2455, acRate: 60.49762021308727, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Average Value of Even Numbers That Are Divisible by Three, slug: average-value-of-even-numbers-that-are-divisible-by-three, url: https://leetcode.com/problems/average-value-of-even-numbers-that-are-divisible-by-three, topics: ['Array', 'Math'], hasSolution: False, hasVideoSolution: False, 2456: questionNo: 2456, acRate: 43.791659293340416, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Most Popular Video Creator, slug: most-popular-video-creator, url: https://leetcode.com/problems/most-popular-video-creator, topics: ['Array', 'Hash Table', 'String', 'Sorting', 'Heap (Priority Queue)'], hasSolution: False, hasVideoSolution: False, 2457: questionNo: 2457, acRate: 37.609768966946824, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Addition to Make Integer Beautiful, slug: minimum-addition-to-make-integer-beautiful, url: https://leetcode.com/problems/minimum-addition-to-make-integer-beautiful, topics: ['Math', 'Greedy'], hasSolution: False, hasVideoSolution: False, 2458: questionNo: 2458, acRate: 40.90236340692041, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Height of Binary Tree After Subtree Removal Queries, slug: height-of-binary-tree-after-subtree-removal-queries, url: https://leetcode.com/problems/height-of-binary-tree-after-subtree-removal-queries, topics: ['Array', 'Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree'], hasSolution: False, hasVideoSolution: False, 2459: questionNo: 2459, acRate: 45.99338590689392, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Sort Array by Moving Items to Empty Space, slug: sort-array-by-moving-items-to-empty-space, url: https://leetcode.com/problems/sort-array-by-moving-items-to-empty-space, topics: ['Array', 'Greedy', 'Sorting'], hasSolution: False, hasVideoSolution: False, 2460: questionNo: 2460, acRate: 67.64983235540653, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Apply Operations to an Array, slug: apply-operations-to-an-array, url: https://leetcode.com/problems/apply-operations-to-an-array, topics: ['Array', 'Two Pointers', 'Simulation'], hasSolution: False, hasVideoSolution: False, 2461: questionNo: 2461, acRate: 34.176156542859104, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum Sum of Distinct Subarrays With Length K, slug: maximum-sum-of-distinct-subarrays-with-length-k, url: https://leetcode.com/problems/maximum-sum-of-distinct-subarrays-with-length-k, topics: ['Array', 'Hash Table', 'Sliding Window'], hasSolution: False, hasVideoSolution: False, 2462: questionNo: 2462, acRate: 42.91524127233708, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Total Cost to Hire K Workers, slug: total-cost-to-hire-k-workers, url: https://leetcode.com/problems/total-cost-to-hire-k-workers, topics: ['Array', 'Two Pointers', 'Heap (Priority Queue)', 'Simulation'], hasSolution: True, hasVideoSolution: False, 2463: questionNo: 2463, acRate: 40.87386165471808, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Minimum Total Distance Traveled, slug: minimum-total-distance-traveled, url: https://leetcode.com/problems/minimum-total-distance-traveled, topics: ['Array', 'Dynamic Programming', 'Sorting'], hasSolution: False, hasVideoSolution: False, 2464: questionNo: 2464, acRate: 54.400000000000006, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Minimum Subarrays in a Valid Split, slug: minimum-subarrays-in-a-valid-split, url: https://leetcode.com/problems/minimum-subarrays-in-a-valid-split, topics: ['Array', 'Math', 'Dynamic Programming', 'Number Theory'], hasSolution: False, hasVideoSolution: False, 2465: questionNo: 2465, acRate: 58.03356372395015, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Number of Distinct Averages, slug: number-of-distinct-averages, url: https://leetcode.com/problems/number-of-distinct-averages, topics: ['Array', 'Hash Table', 'Two Pointers', 'Sorting'], hasSolution: False, hasVideoSolution: False, 2466: questionNo: 2466, acRate: 54.50383524443907, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Count Ways To Build Good Strings, slug: count-ways-to-build-good-strings, url: https://leetcode.com/problems/count-ways-to-build-good-strings, topics: ['Dynamic Programming'], hasSolution: True, hasVideoSolution: False, 2467: questionNo: 2467, acRate: 49.38087023193406, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Most Profitable Path in a Tree, slug: most-profitable-path-in-a-tree, url: https://leetcode.com/problems/most-profitable-path-in-a-tree, topics: ['Array', 'Tree', 'Depth-First Search', 'Breadth-First Search', 'Graph'], hasSolution: False, hasVideoSolution: False, 2468: questionNo: 2468, acRate: 44.65515158835608, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Split Message Based on Limit, slug: split-message-based-on-limit, url: https://leetcode.com/problems/split-message-based-on-limit, topics: ['String', 'Binary Search'], hasSolution: False, hasVideoSolution: False, 2469: questionNo: 2469, acRate: 89.60020991364915, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Convert the Temperature, slug: convert-the-temperature, url: https://leetcode.com/problems/convert-the-temperature, topics: ['Math'], hasSolution: False, hasVideoSolution: False, 2470: questionNo: 2470, acRate: 38.89300546259758, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Number of Subarrays With LCM Equal to K, slug: number-of-subarrays-with-lcm-equal-to-k, url: https://leetcode.com/problems/number-of-subarrays-with-lcm-equal-to-k, topics: ['Array', 'Math', 'Number Theory'], hasSolution: False, hasVideoSolution: False, 2471: questionNo: 2471, acRate: 61.96244184727108, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Number of Operations to Sort a Binary Tree by Level, slug: minimum-number-of-operations-to-sort-a-binary-tree-by-level, url: https://leetcode.com/problems/minimum-number-of-operations-to-sort-a-binary-tree-by-level, topics: ['Tree', 'Breadth-First Search', 'Binary Tree'], hasSolution: False, hasVideoSolution: False, 2472: questionNo: 2472, acRate: 40.41316813434364, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Maximum Number of Non-overlapping Palindrome Substrings, slug: maximum-number-of-non-overlapping-palindrome-substrings, url: https://leetcode.com/problems/maximum-number-of-non-overlapping-palindrome-substrings, topics: ['String', 'Dynamic Programming'], hasSolution: False, hasVideoSolution: False, 2473: questionNo: 2473, acRate: 67.69570011025358, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Minimum Cost to Buy Apples, slug: minimum-cost-to-buy-apples, url: https://leetcode.com/problems/minimum-cost-to-buy-apples, topics: ['Array', 'Graph', 'Heap (Priority Queue)', 'Shortest Path'], hasSolution: True, hasVideoSolution: False, 2474: questionNo: 2474, acRate: 44.489567287494744, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Customers With Strictly Increasing Purchases, slug: customers-with-strictly-increasing-purchases, url: https://leetcode.com/problems/customers-with-strictly-increasing-purchases, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 2475: questionNo: 2475, acRate: 71.4936886395512, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Number of Unequal Triplets in Array, slug: number-of-unequal-triplets-in-array, url: https://leetcode.com/problems/number-of-unequal-triplets-in-array, topics: ['Array', 'Hash Table', 'Sorting'], hasSolution: False, hasVideoSolution: False, 2476: questionNo: 2476, acRate: 41.58706964145698, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Closest Nodes Queries in a Binary Search Tree, slug: closest-nodes-queries-in-a-binary-search-tree, url: https://leetcode.com/problems/closest-nodes-queries-in-a-binary-search-tree, topics: ['Array', 'Binary Search', 'Tree', 'Depth-First Search', 'Binary Search Tree', 'Binary Tree'], hasSolution: False, hasVideoSolution: False, 2477: questionNo: 2477, acRate: 64.476351974048, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Fuel Cost to Report to the Capital, slug: minimum-fuel-cost-to-report-to-the-capital, url: https://leetcode.com/problems/minimum-fuel-cost-to-report-to-the-capital, topics: ['Tree', 'Depth-First Search', 'Breadth-First Search', 'Graph'], hasSolution: True, hasVideoSolution: False, 2478: questionNo: 2478, acRate: 31.0441803501769, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Number of Beautiful Partitions, slug: number-of-beautiful-partitions, url: https://leetcode.com/problems/number-of-beautiful-partitions, topics: ['String', 'Dynamic Programming'], hasSolution: False, hasVideoSolution: False, 2479: questionNo: 2479, acRate: 49.55223880597015, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Maximum XOR of Two Non-Overlapping Subtrees, slug: maximum-xor-of-two-non-overlapping-subtrees, url: https://leetcode.com/problems/maximum-xor-of-two-non-overlapping-subtrees, topics: ['Tree', 'Depth-First Search', 'Graph', 'Trie'], hasSolution: False, hasVideoSolution: False, 2480: questionNo: 2480, acRate: 75.96202746228174, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Form a Chemical Bond, slug: form-a-chemical-bond, url: https://leetcode.com/problems/form-a-chemical-bond, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 2481: questionNo: 2481, acRate: 53.38518622017294, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Minimum Cuts to Divide a Circle, slug: minimum-cuts-to-divide-a-circle, url: https://leetcode.com/problems/minimum-cuts-to-divide-a-circle, topics: ['Math', 'Geometry'], hasSolution: False, hasVideoSolution: False, 2482: questionNo: 2482, acRate: 84.46339351142495, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Difference Between Ones and Zeros in Row and Column, slug: difference-between-ones-and-zeros-in-row-and-column, url: https://leetcode.com/problems/difference-between-ones-and-zeros-in-row-and-column, topics: ['Array', 'Matrix', 'Simulation'], hasSolution: True, hasVideoSolution: False, 2483: questionNo: 2483, acRate: 67.33857277585665, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Penalty for a Shop, slug: minimum-penalty-for-a-shop, url: https://leetcode.com/problems/minimum-penalty-for-a-shop, topics: ['String', 'Prefix Sum'], hasSolution: True, hasVideoSolution: True, 2484: questionNo: 2484, acRate: 38.178226204755525, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Count Palindromic Subsequences, slug: count-palindromic-subsequences, url: https://leetcode.com/problems/count-palindromic-subsequences, topics: ['String', 'Dynamic Programming'], hasSolution: False, hasVideoSolution: False, 2485: questionNo: 2485, acRate: 83.9480655370479, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Find the Pivot Integer, slug: find-the-pivot-integer, url: https://leetcode.com/problems/find-the-pivot-integer, topics: ['Math', 'Prefix Sum'], hasSolution: True, hasVideoSolution: False, 2486: questionNo: 2486, acRate: 73.04105678214984, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Append Characters to String to Make Subsequence, slug: append-characters-to-string-to-make-subsequence, url: https://leetcode.com/problems/append-characters-to-string-to-make-subsequence, topics: ['Two Pointers', 'String', 'Greedy'], hasSolution: True, hasVideoSolution: False, 2487: questionNo: 2487, acRate: 74.35306573661758, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Remove Nodes From Linked List, slug: remove-nodes-from-linked-list, url: https://leetcode.com/problems/remove-nodes-from-linked-list, topics: ['Linked List', 'Stack', 'Recursion', 'Monotonic Stack'], hasSolution: True, hasVideoSolution: False, 2488: questionNo: 2488, acRate: 44.41720445614162, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Count Subarrays With Median K, slug: count-subarrays-with-median-k, url: https://leetcode.com/problems/count-subarrays-with-median-k, topics: ['Array', 'Hash Table', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 2489: questionNo: 2489, acRate: 57.95795795795796, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Number of Substrings With Fixed Ratio, slug: number-of-substrings-with-fixed-ratio, url: https://leetcode.com/problems/number-of-substrings-with-fixed-ratio, topics: ['Hash Table', 'Math', 'String', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 2490: questionNo: 2490, acRate: 62.76819848638527, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Circular Sentence, slug: circular-sentence, url: https://leetcode.com/problems/circular-sentence, topics: ['String'], hasSolution: False, hasVideoSolution: False, 2491: questionNo: 2491, acRate: 59.994457033861, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Divide Players Into Teams of Equal Skill, slug: divide-players-into-teams-of-equal-skill, url: https://leetcode.com/problems/divide-players-into-teams-of-equal-skill, topics: ['Array', 'Hash Table', 'Two Pointers', 'Sorting'], hasSolution: False, hasVideoSolution: False, 2492: questionNo: 2492, acRate: 57.427160855747516, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Score of a Path Between Two Cities, slug: minimum-score-of-a-path-between-two-cities, url: https://leetcode.com/problems/minimum-score-of-a-path-between-two-cities, topics: ['Depth-First Search', 'Breadth-First Search', 'Union Find', 'Graph'], hasSolution: True, hasVideoSolution: False, 2493: questionNo: 2493, acRate: 38.76269185360094, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Divide Nodes Into the Maximum Number of Groups, slug: divide-nodes-into-the-maximum-number-of-groups, url: https://leetcode.com/problems/divide-nodes-into-the-maximum-number-of-groups, topics: ['Breadth-First Search', 'Union Find', 'Graph'], hasSolution: False, hasVideoSolution: False, 2494: questionNo: 2494, acRate: 31.284626038781166, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Merge Overlapping Events in the Same Hall, slug: merge-overlapping-events-in-the-same-hall, url: https://leetcode.com/problems/merge-overlapping-events-in-the-same-hall, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 2495: questionNo: 2495, acRate: 64.15428167020524, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Number of Subarrays Having Even Product, slug: number-of-subarrays-having-even-product, url: https://leetcode.com/problems/number-of-subarrays-having-even-product, topics: ['Array', 'Math', 'Dynamic Programming'], hasSolution: False, hasVideoSolution: False, 2496: questionNo: 2496, acRate: 72.3021582733813, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Maximum Value of a String in an Array, slug: maximum-value-of-a-string-in-an-array, url: https://leetcode.com/problems/maximum-value-of-a-string-in-an-array, topics: ['Array', 'String'], hasSolution: False, hasVideoSolution: False, 2497: questionNo: 2497, acRate: 39.42467768787022, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum Star Sum of a Graph, slug: maximum-star-sum-of-a-graph, url: https://leetcode.com/problems/maximum-star-sum-of-a-graph, topics: ['Array', 'Greedy', 'Graph', 'Sorting', 'Heap (Priority Queue)'], hasSolution: False, hasVideoSolution: False, 2498: questionNo: 2498, acRate: 61.7531592973608, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Frog Jump II, slug: frog-jump-ii, url: https://leetcode.com/problems/frog-jump-ii, topics: ['Array', 'Binary Search', 'Greedy'], hasSolution: False, hasVideoSolution: False, 2499: questionNo: 2499, acRate: 43.04962520163203, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Minimum Total Cost to Make Arrays Unequal, slug: minimum-total-cost-to-make-arrays-unequal, url: https://leetcode.com/problems/minimum-total-cost-to-make-arrays-unequal, topics: ['Array', 'Hash Table', 'Greedy', 'Counting'], hasSolution: False, hasVideoSolution: False, 2500: questionNo: 2500, acRate: 78.22990974406177, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Delete Greatest Value in Each Row, slug: delete-greatest-value-in-each-row, url: https://leetcode.com/problems/delete-greatest-value-in-each-row, topics: ['Array', 'Sorting', 'Heap (Priority Queue)', 'Matrix', 'Simulation'], hasSolution: False, hasVideoSolution: False, 2501: questionNo: 2501, acRate: 39.75053737398201, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Longest Square Streak in an Array, slug: longest-square-streak-in-an-array, url: https://leetcode.com/problems/longest-square-streak-in-an-array, topics: ['Array', 'Hash Table', 'Binary Search', 'Dynamic Programming', 'Sorting'], hasSolution: False, hasVideoSolution: False, 2502: questionNo: 2502, acRate: 53.2681847515442, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Design Memory Allocator, slug: design-memory-allocator, url: https://leetcode.com/problems/design-memory-allocator, topics: ['Array', 'Hash Table', 'Design', 'Simulation'], hasSolution: False, hasVideoSolution: False, 2503: questionNo: 2503, acRate: 37.59007205764612, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Maximum Number of Points From Grid Queries, slug: maximum-number-of-points-from-grid-queries, url: https://leetcode.com/problems/maximum-number-of-points-from-grid-queries, topics: ['Array', 'Two Pointers', 'Breadth-First Search', 'Union Find', 'Sorting', 'Heap (Priority Queue)', 'Matrix'], hasSolution: False, hasVideoSolution: False, 2504: questionNo: 2504, acRate: 75.49692172383466, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Concatenate the Name and the Profession, slug: concatenate-the-name-and-the-profession, url: https://leetcode.com/problems/concatenate-the-name-and-the-profession, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 2505: questionNo: 2505, acRate: 66.91397279632574, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Bitwise OR of All Subsequence Sums, slug: bitwise-or-of-all-subsequence-sums, url: https://leetcode.com/problems/bitwise-or-of-all-subsequence-sums, topics: ['Array', 'Math', 'Bit Manipulation', 'Brainteaser'], hasSolution: False, hasVideoSolution: False, 2506: questionNo: 2506, acRate: 70.26380746683122, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Count Pairs Of Similar Strings, slug: count-pairs-of-similar-strings, url: https://leetcode.com/problems/count-pairs-of-similar-strings, topics: ['Array', 'Hash Table', 'String', 'Bit Manipulation'], hasSolution: False, hasVideoSolution: False, 2507: questionNo: 2507, acRate: 48.58220631416508, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Smallest Value After Replacing With Sum of Prime Factors, slug: smallest-value-after-replacing-with-sum-of-prime-factors, url: https://leetcode.com/problems/smallest-value-after-replacing-with-sum-of-prime-factors, topics: ['Math', 'Simulation', 'Number Theory'], hasSolution: False, hasVideoSolution: False, 2508: questionNo: 2508, acRate: 32.31223110018439, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Add Edges to Make Degrees of All Nodes Even, slug: add-edges-to-make-degrees-of-all-nodes-even, url: https://leetcode.com/problems/add-edges-to-make-degrees-of-all-nodes-even, topics: ['Hash Table', 'Graph'], hasSolution: False, hasVideoSolution: False, 2509: questionNo: 2509, acRate: 56.38557309716339, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Cycle Length Queries in a Tree, slug: cycle-length-queries-in-a-tree, url: https://leetcode.com/problems/cycle-length-queries-in-a-tree, topics: ['Array', 'Tree', 'Binary Tree'], hasSolution: False, hasVideoSolution: False, 2510: questionNo: 2510, acRate: 50.41567019701628, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Check if There is a Path With Equal Number of 0's And 1's, slug: check-if-there-is-a-path-with-equal-number-of-0s-and-1s, url: https://leetcode.com/problems/check-if-there-is-a-path-with-equal-number-of-0s-and-1s, topics: ['Array', 'Dynamic Programming', 'Matrix'], hasSolution: False, hasVideoSolution: False, 2511: questionNo: 2511, acRate: 38.422326181642205, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Maximum Enemy Forts That Can Be Captured, slug: maximum-enemy-forts-that-can-be-captured, url: https://leetcode.com/problems/maximum-enemy-forts-that-can-be-captured, topics: ['Array', 'Two Pointers'], hasSolution: False, hasVideoSolution: False, 2512: questionNo: 2512, acRate: 45.18109135392547, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Reward Top K Students, slug: reward-top-k-students, url: https://leetcode.com/problems/reward-top-k-students, topics: ['Array', 'Hash Table', 'String', 'Sorting', 'Heap (Priority Queue)'], hasSolution: False, hasVideoSolution: False, 2513: questionNo: 2513, acRate: 30.536983110075717, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimize the Maximum of Two Arrays, slug: minimize-the-maximum-of-two-arrays, url: https://leetcode.com/problems/minimize-the-maximum-of-two-arrays, topics: ['Math', 'Binary Search', 'Number Theory'], hasSolution: False, hasVideoSolution: False, 2514: questionNo: 2514, acRate: 33.45242145854599, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Count Anagrams, slug: count-anagrams, url: https://leetcode.com/problems/count-anagrams, topics: ['Hash Table', 'Math', 'String', 'Combinatorics', 'Counting'], hasSolution: False, hasVideoSolution: False, 2515: questionNo: 2515, acRate: 49.35155049645624, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Shortest Distance to Target String in a Circular Array, slug: shortest-distance-to-target-string-in-a-circular-array, url: https://leetcode.com/problems/shortest-distance-to-target-string-in-a-circular-array, topics: ['Array', 'String'], hasSolution: False, hasVideoSolution: False, 2516: questionNo: 2516, acRate: 34.42753365294031, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Take K of Each Character From Left and Right, slug: take-k-of-each-character-from-left-and-right, url: https://leetcode.com/problems/take-k-of-each-character-from-left-and-right, topics: ['Hash Table', 'String', 'Sliding Window'], hasSolution: False, hasVideoSolution: False, 2517: questionNo: 2517, acRate: 63.83066903493191, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum Tastiness of Candy Basket, slug: maximum-tastiness-of-candy-basket, url: https://leetcode.com/problems/maximum-tastiness-of-candy-basket, topics: ['Array', 'Binary Search', 'Greedy', 'Sorting'], hasSolution: False, hasVideoSolution: False, 2518: questionNo: 2518, acRate: 31.405677821688844, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Number of Great Partitions, slug: number-of-great-partitions, url: https://leetcode.com/problems/number-of-great-partitions, topics: ['Array', 'Dynamic Programming'], hasSolution: False, hasVideoSolution: False, 2519: questionNo: 2519, acRate: 53.5575012876168, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Count the Number of K-Big Indices, slug: count-the-number-of-k-big-indices, url: https://leetcode.com/problems/count-the-number-of-k-big-indices, topics: ['Array', 'Binary Search', 'Divide and Conquer', 'Binary Indexed Tree', 'Segment Tree', 'Merge Sort', 'Ordered Set'], hasSolution: False, hasVideoSolution: False, 2520: questionNo: 2520, acRate: 84.65364120781528, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Count the Digits That Divide a Number, slug: count-the-digits-that-divide-a-number, url: https://leetcode.com/problems/count-the-digits-that-divide-a-number, topics: ['Math'], hasSolution: False, hasVideoSolution: False, 2521: questionNo: 2521, acRate: 51.30527876142633, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Distinct Prime Factors of Product of Array, slug: distinct-prime-factors-of-product-of-array, url: https://leetcode.com/problems/distinct-prime-factors-of-product-of-array, topics: ['Array', 'Hash Table', 'Math', 'Number Theory'], hasSolution: False, hasVideoSolution: False, 2522: questionNo: 2522, acRate: 46.28355795148248, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Partition String Into Substrings With Values at Most K, slug: partition-string-into-substrings-with-values-at-most-k, url: https://leetcode.com/problems/partition-string-into-substrings-with-values-at-most-k, topics: ['String', 'Dynamic Programming', 'Greedy'], hasSolution: False, hasVideoSolution: False, 2523: questionNo: 2523, acRate: 37.475781451821234, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Closest Prime Numbers in Range, slug: closest-prime-numbers-in-range, url: https://leetcode.com/problems/closest-prime-numbers-in-range, topics: ['Math', 'Number Theory'], hasSolution: False, hasVideoSolution: False, 2524: questionNo: 2524, acRate: 40.202108963093146, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Maximum Frequency Score of a Subarray, slug: maximum-frequency-score-of-a-subarray, url: https://leetcode.com/problems/maximum-frequency-score-of-a-subarray, topics: ['Array', 'Hash Table', 'Math', 'Sliding Window'], hasSolution: False, hasVideoSolution: False, 2525: questionNo: 2525, acRate: 35.721456798034815, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Categorize Box According to Criteria, slug: categorize-box-according-to-criteria, url: https://leetcode.com/problems/categorize-box-according-to-criteria, topics: ['Math'], hasSolution: False, hasVideoSolution: False, 2526: questionNo: 2526, acRate: 49.416474676134, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Find Consecutive Integers from a Data Stream, slug: find-consecutive-integers-from-a-data-stream, url: https://leetcode.com/problems/find-consecutive-integers-from-a-data-stream, topics: ['Hash Table', 'Design', 'Queue', 'Counting', 'Data Stream'], hasSolution: False, hasVideoSolution: False, 2527: questionNo: 2527, acRate: 68.728474996556, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Find Xor-Beauty of Array, slug: find-xor-beauty-of-array, url: https://leetcode.com/problems/find-xor-beauty-of-array, topics: ['Array', 'Math', 'Bit Manipulation'], hasSolution: False, hasVideoSolution: False, 2528: questionNo: 2528, acRate: 32.54898327852147, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Maximize the Minimum Powered City, slug: maximize-the-minimum-powered-city, url: https://leetcode.com/problems/maximize-the-minimum-powered-city, topics: ['Array', 'Binary Search', 'Greedy', 'Queue', 'Sliding Window', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 2529: questionNo: 2529, acRate: 70.97300436550145, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Maximum Count of Positive Integer and Negative Integer, slug: maximum-count-of-positive-integer-and-negative-integer, url: https://leetcode.com/problems/maximum-count-of-positive-integer-and-negative-integer, topics: ['Array', 'Binary Search', 'Counting'], hasSolution: False, hasVideoSolution: False, 2530: questionNo: 2530, acRate: 46.01623912269919, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximal Score After Applying K Operations, slug: maximal-score-after-applying-k-operations, url: https://leetcode.com/problems/maximal-score-after-applying-k-operations, topics: ['Array', 'Greedy', 'Heap (Priority Queue)'], hasSolution: False, hasVideoSolution: False, 2531: questionNo: 2531, acRate: 26.401967084858473, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Make Number of Distinct Characters Equal, slug: make-number-of-distinct-characters-equal, url: https://leetcode.com/problems/make-number-of-distinct-characters-equal, topics: ['Hash Table', 'String', 'Counting'], hasSolution: False, hasVideoSolution: False, 2532: questionNo: 2532, acRate: 43.84623667492193, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Time to Cross a Bridge, slug: time-to-cross-a-bridge, url: https://leetcode.com/problems/time-to-cross-a-bridge, topics: ['Array', 'Heap (Priority Queue)', 'Simulation'], hasSolution: False, hasVideoSolution: False, 2533: questionNo: 2533, acRate: 51.882081812944115, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Number of Good Binary Strings, slug: number-of-good-binary-strings, url: https://leetcode.com/problems/number-of-good-binary-strings, topics: ['Dynamic Programming'], hasSolution: False, hasVideoSolution: False, 2534: questionNo: 2534, acRate: 49.51602938147868, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Time Taken to Cross the Door, slug: time-taken-to-cross-the-door, url: https://leetcode.com/problems/time-taken-to-cross-the-door, topics: ['Array', 'Queue', 'Simulation'], hasSolution: False, hasVideoSolution: False, 2535: questionNo: 2535, acRate: 84.41881263645212, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Difference Between Element Sum and Digit Sum of an Array, slug: difference-between-element-sum-and-digit-sum-of-an-array, url: https://leetcode.com/problems/difference-between-element-sum-and-digit-sum-of-an-array, topics: ['Array', 'Math'], hasSolution: False, hasVideoSolution: False, 2536: questionNo: 2536, acRate: 49.668717463322295, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Increment Submatrices by One, slug: increment-submatrices-by-one, url: https://leetcode.com/problems/increment-submatrices-by-one, topics: ['Array', 'Matrix', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 2537: questionNo: 2537, acRate: 50.96659943922476, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Count the Number of Good Subarrays, slug: count-the-number-of-good-subarrays, url: https://leetcode.com/problems/count-the-number-of-good-subarrays, topics: ['Array', 'Hash Table', 'Sliding Window'], hasSolution: False, hasVideoSolution: False, 2538: questionNo: 2538, acRate: 31.96734965850408, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Difference Between Maximum and Minimum Price Sum, slug: difference-between-maximum-and-minimum-price-sum, url: https://leetcode.com/problems/difference-between-maximum-and-minimum-price-sum, topics: ['Array', 'Dynamic Programming', 'Tree', 'Depth-First Search'], hasSolution: False, hasVideoSolution: False, 2539: questionNo: 2539, acRate: 52.78757939308398, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Count the Number of Good Subsequences, slug: count-the-number-of-good-subsequences, url: https://leetcode.com/problems/count-the-number-of-good-subsequences, topics: ['Hash Table', 'Math', 'String', 'Combinatorics', 'Counting'], hasSolution: False, hasVideoSolution: False, 2540: questionNo: 2540, acRate: 58.93321205821206, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Minimum Common Value, slug: minimum-common-value, url: https://leetcode.com/problems/minimum-common-value, topics: ['Array', 'Hash Table', 'Two Pointers', 'Binary Search'], hasSolution: True, hasVideoSolution: False, 2541: questionNo: 2541, acRate: 31.50789933143125, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Operations to Make Array Equal II, slug: minimum-operations-to-make-array-equal-ii, url: https://leetcode.com/problems/minimum-operations-to-make-array-equal-ii, topics: ['Array', 'Math', 'Greedy'], hasSolution: False, hasVideoSolution: False, 2542: questionNo: 2542, acRate: 53.76086880609002, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum Subsequence Score, slug: maximum-subsequence-score, url: https://leetcode.com/problems/maximum-subsequence-score, topics: ['Array', 'Greedy', 'Sorting', 'Heap (Priority Queue)'], hasSolution: True, hasVideoSolution: False, 2543: questionNo: 2543, acRate: 42.43256339848166, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Check if Point Is Reachable, slug: check-if-point-is-reachable, url: https://leetcode.com/problems/check-if-point-is-reachable, topics: ['Math', 'Number Theory'], hasSolution: False, hasVideoSolution: False, 2544: questionNo: 2544, acRate: 68.24441859176777, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Alternating Digit Sum, slug: alternating-digit-sum, url: https://leetcode.com/problems/alternating-digit-sum, topics: ['Math'], hasSolution: False, hasVideoSolution: False, 2545: questionNo: 2545, acRate: 85.51201315631141, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Sort the Students by Their Kth Score, slug: sort-the-students-by-their-kth-score, url: https://leetcode.com/problems/sort-the-students-by-their-kth-score, topics: ['Array', 'Sorting', 'Matrix'], hasSolution: False, hasVideoSolution: False, 2546: questionNo: 2546, acRate: 41.13211647109952, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Apply Bitwise Operations to Make Strings Equal, slug: apply-bitwise-operations-to-make-strings-equal, url: https://leetcode.com/problems/apply-bitwise-operations-to-make-strings-equal, topics: ['String', 'Bit Manipulation'], hasSolution: False, hasVideoSolution: False, 2547: questionNo: 2547, acRate: 40.533689126084056, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Minimum Cost to Split an Array, slug: minimum-cost-to-split-an-array, url: https://leetcode.com/problems/minimum-cost-to-split-an-array, topics: ['Array', 'Hash Table', 'Dynamic Programming', 'Counting'], hasSolution: False, hasVideoSolution: False, 2548: questionNo: 2548, acRate: 65.73705179282868, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Maximum Price to Fill a Bag, slug: maximum-price-to-fill-a-bag, url: https://leetcode.com/problems/maximum-price-to-fill-a-bag, topics: ['Array', 'Greedy', 'Sorting'], hasSolution: False, hasVideoSolution: False, 2549: questionNo: 2549, acRate: 60.3124413450571, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Count Distinct Numbers on Board, slug: count-distinct-numbers-on-board, url: https://leetcode.com/problems/count-distinct-numbers-on-board, topics: ['Array', 'Hash Table', 'Math', 'Simulation'], hasSolution: False, hasVideoSolution: False, 2550: questionNo: 2550, acRate: 27.663374225543663, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Count Collisions of Monkeys on a Polygon, slug: count-collisions-of-monkeys-on-a-polygon, url: https://leetcode.com/problems/count-collisions-of-monkeys-on-a-polygon, topics: ['Math', 'Recursion'], hasSolution: False, hasVideoSolution: False, 2551: questionNo: 2551, acRate: 66.57753399611474, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Put Marbles in Bags, slug: put-marbles-in-bags, url: https://leetcode.com/problems/put-marbles-in-bags, topics: ['Array', 'Greedy', 'Sorting', 'Heap (Priority Queue)'], hasSolution: True, hasVideoSolution: False, 2552: questionNo: 2552, acRate: 33.467581002140705, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Count Increasing Quadruplets, slug: count-increasing-quadruplets, url: https://leetcode.com/problems/count-increasing-quadruplets, topics: ['Array', 'Dynamic Programming', 'Binary Indexed Tree', 'Enumeration', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 2553: questionNo: 2553, acRate: 79.37563579483925, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Separate the Digits in an Array, slug: separate-the-digits-in-an-array, url: https://leetcode.com/problems/separate-the-digits-in-an-array, topics: ['Array', 'Simulation'], hasSolution: False, hasVideoSolution: False, 2554: questionNo: 2554, acRate: 54.00520381613183, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum Number of Integers to Choose From a Range I, slug: maximum-number-of-integers-to-choose-from-a-range-i, url: https://leetcode.com/problems/maximum-number-of-integers-to-choose-from-a-range-i, topics: ['Array', 'Hash Table', 'Binary Search', 'Greedy', 'Sorting'], hasSolution: False, hasVideoSolution: False, 2555: questionNo: 2555, acRate: 33.18705430608887, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximize Win From Two Segments, slug: maximize-win-from-two-segments, url: https://leetcode.com/problems/maximize-win-from-two-segments, topics: ['Array', 'Binary Search', 'Sliding Window'], hasSolution: False, hasVideoSolution: False, 2556: questionNo: 2556, acRate: 27.239969229523464, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Disconnect Path in a Binary Matrix by at Most One Flip, slug: disconnect-path-in-a-binary-matrix-by-at-most-one-flip, url: https://leetcode.com/problems/disconnect-path-in-a-binary-matrix-by-at-most-one-flip, topics: ['Array', 'Dynamic Programming', 'Depth-First Search', 'Breadth-First Search', 'Matrix'], hasSolution: False, hasVideoSolution: False, 2557: questionNo: 2557, acRate: 40.92119275825346, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Maximum Number of Integers to Choose From a Range II, slug: maximum-number-of-integers-to-choose-from-a-range-ii, url: https://leetcode.com/problems/maximum-number-of-integers-to-choose-from-a-range-ii, topics: ['Array', 'Binary Search', 'Greedy', 'Sorting'], hasSolution: False, hasVideoSolution: False, 2558: questionNo: 2558, acRate: 66.87486841181838, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Take Gifts From the Richest Pile, slug: take-gifts-from-the-richest-pile, url: https://leetcode.com/problems/take-gifts-from-the-richest-pile, topics: ['Array', 'Heap (Priority Queue)', 'Simulation'], hasSolution: False, hasVideoSolution: False, 2559: questionNo: 2559, acRate: 52.16565137204493, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Count Vowel Strings in Ranges, slug: count-vowel-strings-in-ranges, url: https://leetcode.com/problems/count-vowel-strings-in-ranges, topics: ['Array', 'String', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 2560: questionNo: 2560, acRate: 43.56197076439406, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: House Robber IV, slug: house-robber-iv, url: https://leetcode.com/problems/house-robber-iv, topics: ['Array', 'Binary Search'], hasSolution: False, hasVideoSolution: False, 2561: questionNo: 2561, acRate: 34.03579777397858, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Rearranging Fruits, slug: rearranging-fruits, url: https://leetcode.com/problems/rearranging-fruits, topics: ['Array', 'Hash Table', 'Greedy'], hasSolution: False, hasVideoSolution: False, 2562: questionNo: 2562, acRate: 69.82829689854167, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Find the Array Concatenation Value, slug: find-the-array-concatenation-value, url: https://leetcode.com/problems/find-the-array-concatenation-value, topics: ['Array', 'Two Pointers', 'Simulation'], hasSolution: False, hasVideoSolution: False, 2563: questionNo: 2563, acRate: 32.908773517812115, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Count the Number of Fair Pairs, slug: count-the-number-of-fair-pairs, url: https://leetcode.com/problems/count-the-number-of-fair-pairs, topics: ['Array', 'Two Pointers', 'Binary Search', 'Sorting'], hasSolution: False, hasVideoSolution: False, 2564: questionNo: 2564, acRate: 33.561442433638966, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Substring XOR Queries, slug: substring-xor-queries, url: https://leetcode.com/problems/substring-xor-queries, topics: ['Array', 'Hash Table', 'String', 'Bit Manipulation'], hasSolution: False, hasVideoSolution: False, 2565: questionNo: 2565, acRate: 31.4962372731297, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Subsequence With the Minimum Score, slug: subsequence-with-the-minimum-score, url: https://leetcode.com/problems/subsequence-with-the-minimum-score, topics: ['Two Pointers', 'String', 'Binary Search'], hasSolution: False, hasVideoSolution: False, 2566: questionNo: 2566, acRate: 59.9139161038714, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Maximum Difference by Remapping a Digit, slug: maximum-difference-by-remapping-a-digit, url: https://leetcode.com/problems/maximum-difference-by-remapping-a-digit, topics: ['Math', 'Greedy'], hasSolution: False, hasVideoSolution: False, 2567: questionNo: 2567, acRate: 47.92435814333624, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Score by Changing Two Elements, slug: minimum-score-by-changing-two-elements, url: https://leetcode.com/problems/minimum-score-by-changing-two-elements, topics: ['Array', 'Greedy', 'Sorting'], hasSolution: False, hasVideoSolution: False, 2568: questionNo: 2568, acRate: 57.608695652173914, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Impossible OR, slug: minimum-impossible-or, url: https://leetcode.com/problems/minimum-impossible-or, topics: ['Array', 'Bit Manipulation', 'Brainteaser'], hasSolution: False, hasVideoSolution: False, 2569: questionNo: 2569, acRate: 28.26229178199386, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Handling Sum Queries After Update, slug: handling-sum-queries-after-update, url: https://leetcode.com/problems/handling-sum-queries-after-update, topics: ['Array', 'Segment Tree'], hasSolution: False, hasVideoSolution: False, 2570: questionNo: 2570, acRate: 73.63717758875994, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Merge Two 2D Arrays by Summing Values, slug: merge-two-2d-arrays-by-summing-values, url: https://leetcode.com/problems/merge-two-2d-arrays-by-summing-values, topics: ['Array', 'Hash Table', 'Two Pointers'], hasSolution: False, hasVideoSolution: False, 2571: questionNo: 2571, acRate: 55.158052319444174, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Operations to Reduce an Integer to 0, slug: minimum-operations-to-reduce-an-integer-to-0, url: https://leetcode.com/problems/minimum-operations-to-reduce-an-integer-to-0, topics: ['Dynamic Programming', 'Greedy', 'Bit Manipulation'], hasSolution: False, hasVideoSolution: False, 2572: questionNo: 2572, acRate: 23.0859375, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Count the Number of Square-Free Subsets, slug: count-the-number-of-square-free-subsets, url: https://leetcode.com/problems/count-the-number-of-square-free-subsets, topics: ['Array', 'Math', 'Dynamic Programming', 'Bit Manipulation', 'Bitmask'], hasSolution: False, hasVideoSolution: False, 2573: questionNo: 2573, acRate: 31.340778516558, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Find the String with LCP, slug: find-the-string-with-lcp, url: https://leetcode.com/problems/find-the-string-with-lcp, topics: ['Array', 'String', 'Dynamic Programming', 'Greedy', 'Union Find', 'Matrix'], hasSolution: False, hasVideoSolution: False, 2574: questionNo: 2574, acRate: 86.7016514126542, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Left and Right Sum Differences, slug: left-and-right-sum-differences, url: https://leetcode.com/problems/left-and-right-sum-differences, topics: ['Array', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 2575: questionNo: 2575, acRate: 32.81844272814243, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Find the Divisibility Array of a String, slug: find-the-divisibility-array-of-a-string, url: https://leetcode.com/problems/find-the-divisibility-array-of-a-string, topics: ['Array', 'Math', 'String'], hasSolution: False, hasVideoSolution: False, 2576: questionNo: 2576, acRate: 38.60221450365566, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Find the Maximum Number of Marked Indices, slug: find-the-maximum-number-of-marked-indices, url: https://leetcode.com/problems/find-the-maximum-number-of-marked-indices, topics: ['Array', 'Two Pointers', 'Binary Search', 'Greedy', 'Sorting'], hasSolution: False, hasVideoSolution: False, 2577: questionNo: 2577, acRate: 35.5262354162849, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Minimum Time to Visit a Cell In a Grid, slug: minimum-time-to-visit-a-cell-in-a-grid, url: https://leetcode.com/problems/minimum-time-to-visit-a-cell-in-a-grid, topics: ['Array', 'Breadth-First Search', 'Graph', 'Heap (Priority Queue)', 'Matrix', 'Shortest Path'], hasSolution: False, hasVideoSolution: False, 2578: questionNo: 2578, acRate: 70.74760080565538, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Split With Minimum Sum, slug: split-with-minimum-sum, url: https://leetcode.com/problems/split-with-minimum-sum, topics: ['Math', 'Greedy', 'Sorting'], hasSolution: False, hasVideoSolution: False, 2579: questionNo: 2579, acRate: 57.72606295229087, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Count Total Number of Colored Cells, slug: count-total-number-of-colored-cells, url: https://leetcode.com/problems/count-total-number-of-colored-cells, topics: ['Math'], hasSolution: False, hasVideoSolution: False, 2580: questionNo: 2580, acRate: 36.1126162738192, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Count Ways to Group Overlapping Ranges, slug: count-ways-to-group-overlapping-ranges, url: https://leetcode.com/problems/count-ways-to-group-overlapping-ranges, topics: ['Array', 'Sorting'], hasSolution: False, hasVideoSolution: False, 2581: questionNo: 2581, acRate: 45.8543565027487, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Count Number of Possible Root Nodes, slug: count-number-of-possible-root-nodes, url: https://leetcode.com/problems/count-number-of-possible-root-nodes, topics: ['Hash Table', 'Dynamic Programming', 'Tree', 'Depth-First Search'], hasSolution: False, hasVideoSolution: False, 2582: questionNo: 2582, acRate: 57.01022864941956, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Pass the Pillow, slug: pass-the-pillow, url: https://leetcode.com/problems/pass-the-pillow, topics: ['Math', 'Simulation'], hasSolution: True, hasVideoSolution: False, 2583: questionNo: 2583, acRate: 47.58792862912108, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Kth Largest Sum in a Binary Tree, slug: kth-largest-sum-in-a-binary-tree, url: https://leetcode.com/problems/kth-largest-sum-in-a-binary-tree, topics: ['Tree', 'Breadth-First Search', 'Sorting', 'Binary Tree'], hasSolution: False, hasVideoSolution: False, 2584: questionNo: 2584, acRate: 23.10491326068998, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Split the Array to Make Coprime Products, slug: split-the-array-to-make-coprime-products, url: https://leetcode.com/problems/split-the-array-to-make-coprime-products, topics: ['Array', 'Hash Table', 'Math', 'Number Theory'], hasSolution: False, hasVideoSolution: False, 2585: questionNo: 2585, acRate: 57.47106581447573, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Number of Ways to Earn Points, slug: number-of-ways-to-earn-points, url: https://leetcode.com/problems/number-of-ways-to-earn-points, topics: ['Array', 'Dynamic Programming'], hasSolution: False, hasVideoSolution: False, 2586: questionNo: 2586, acRate: 74.1203495509073, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Count the Number of Vowel Strings in Range, slug: count-the-number-of-vowel-strings-in-range, url: https://leetcode.com/problems/count-the-number-of-vowel-strings-in-range, topics: ['Array', 'String'], hasSolution: False, hasVideoSolution: False, 2587: questionNo: 2587, acRate: 41.0604838138916, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Rearrange Array to Maximize Prefix Score, slug: rearrange-array-to-maximize-prefix-score, url: https://leetcode.com/problems/rearrange-array-to-maximize-prefix-score, topics: ['Array', 'Greedy', 'Sorting', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 2588: questionNo: 2588, acRate: 50.5338078291815, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Count the Number of Beautiful Subarrays, slug: count-the-number-of-beautiful-subarrays, url: https://leetcode.com/problems/count-the-number-of-beautiful-subarrays, topics: ['Array', 'Hash Table', 'Bit Manipulation', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 2589: questionNo: 2589, acRate: 39.253676319993446, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Minimum Time to Complete All Tasks, slug: minimum-time-to-complete-all-tasks, url: https://leetcode.com/problems/minimum-time-to-complete-all-tasks, topics: ['Array', 'Binary Search', 'Stack', 'Greedy', 'Sorting'], hasSolution: False, hasVideoSolution: False, 2590: questionNo: 2590, acRate: 58.82527439928804, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Design a Todo List, slug: design-a-todo-list, url: https://leetcode.com/problems/design-a-todo-list, topics: ['Array', 'Hash Table', 'String', 'Design', 'Sorting'], hasSolution: False, hasVideoSolution: False, 2591: questionNo: 2591, acRate: 19.148174659985685, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Distribute Money to Maximum Children, slug: distribute-money-to-maximum-children, url: https://leetcode.com/problems/distribute-money-to-maximum-children, topics: ['Math', 'Greedy'], hasSolution: False, hasVideoSolution: False, 2592: questionNo: 2592, acRate: 57.89852983568752, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximize Greatness of an Array, slug: maximize-greatness-of-an-array, url: https://leetcode.com/problems/maximize-greatness-of-an-array, topics: ['Array', 'Two Pointers', 'Greedy', 'Sorting'], hasSolution: False, hasVideoSolution: False, 2593: questionNo: 2593, acRate: 52.55839032834805, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Find Score of an Array After Marking All Elements, slug: find-score-of-an-array-after-marking-all-elements, url: https://leetcode.com/problems/find-score-of-an-array-after-marking-all-elements, topics: ['Array', 'Hash Table', 'Sorting', 'Heap (Priority Queue)', 'Simulation'], hasSolution: False, hasVideoSolution: False, 2594: questionNo: 2594, acRate: 44.702723436900655, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Time to Repair Cars, slug: minimum-time-to-repair-cars, url: https://leetcode.com/problems/minimum-time-to-repair-cars, topics: ['Array', 'Binary Search'], hasSolution: False, hasVideoSolution: False, 2595: questionNo: 2595, acRate: 73.38527783473447, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Number of Even and Odd Bits, slug: number-of-even-and-odd-bits, url: https://leetcode.com/problems/number-of-even-and-odd-bits, topics: ['Bit Manipulation'], hasSolution: False, hasVideoSolution: False, 2596: questionNo: 2596, acRate: 56.928313976772124, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Check Knight Tour Configuration, slug: check-knight-tour-configuration, url: https://leetcode.com/problems/check-knight-tour-configuration, topics: ['Array', 'Depth-First Search', 'Breadth-First Search', 'Matrix', 'Simulation'], hasSolution: False, hasVideoSolution: False, 2597: questionNo: 2597, acRate: 51.185573694259254, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: The Number of Beautiful Subsets, slug: the-number-of-beautiful-subsets, url: https://leetcode.com/problems/the-number-of-beautiful-subsets, topics: ['Array', 'Hash Table', 'Math', 'Dynamic Programming', 'Backtracking', 'Sorting', 'Combinatorics'], hasSolution: True, hasVideoSolution: False, 2598: questionNo: 2598, acRate: 39.28553057970269, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Smallest Missing Non-negative Integer After Operations, slug: smallest-missing-non-negative-integer-after-operations, url: https://leetcode.com/problems/smallest-missing-non-negative-integer-after-operations, topics: ['Array', 'Hash Table', 'Math', 'Greedy'], hasSolution: False, hasVideoSolution: False, 2599: questionNo: 2599, acRate: 51.205156950672645, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Make the Prefix Sum Non-negative, slug: make-the-prefix-sum-non-negative, url: https://leetcode.com/problems/make-the-prefix-sum-non-negative, topics: ['Array', 'Greedy', 'Heap (Priority Queue)'], hasSolution: False, hasVideoSolution: False, 2600: questionNo: 2600, acRate: 61.76739787045794, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: K Items With the Maximum Sum, slug: k-items-with-the-maximum-sum, url: https://leetcode.com/problems/k-items-with-the-maximum-sum, topics: ['Math', 'Greedy'], hasSolution: False, hasVideoSolution: False, 2601: questionNo: 2601, acRate: 37.77395788568973, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Prime Subtraction Operation, slug: prime-subtraction-operation, url: https://leetcode.com/problems/prime-subtraction-operation, topics: ['Array', 'Math', 'Binary Search', 'Greedy', 'Number Theory'], hasSolution: False, hasVideoSolution: False, 2602: questionNo: 2602, acRate: 35.47840812870449, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Operations to Make All Array Elements Equal, slug: minimum-operations-to-make-all-array-elements-equal, url: https://leetcode.com/problems/minimum-operations-to-make-all-array-elements-equal, topics: ['Array', 'Binary Search', 'Sorting', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 2603: questionNo: 2603, acRate: 37.29694279083846, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Collect Coins in a Tree, slug: collect-coins-in-a-tree, url: https://leetcode.com/problems/collect-coins-in-a-tree, topics: ['Array', 'Tree', 'Graph', 'Topological Sort'], hasSolution: False, hasVideoSolution: False, 2604: questionNo: 2604, acRate: 41.296156744536546, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Minimum Time to Eat All Grains, slug: minimum-time-to-eat-all-grains, url: https://leetcode.com/problems/minimum-time-to-eat-all-grains, topics: ['Array', 'Two Pointers', 'Binary Search', 'Sorting'], hasSolution: False, hasVideoSolution: False, 2605: questionNo: 2605, acRate: 53.996607269722055, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Form Smallest Number From Two Digit Arrays, slug: form-smallest-number-from-two-digit-arrays, url: https://leetcode.com/problems/form-smallest-number-from-two-digit-arrays, topics: ['Array', 'Hash Table', 'Enumeration'], hasSolution: False, hasVideoSolution: False, 2606: questionNo: 2606, acRate: 56.80192588134534, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Find the Substring With Maximum Cost, slug: find-the-substring-with-maximum-cost, url: https://leetcode.com/problems/find-the-substring-with-maximum-cost, topics: ['Array', 'Hash Table', 'String', 'Dynamic Programming'], hasSolution: False, hasVideoSolution: False, 2607: questionNo: 2607, acRate: 36.867324483566414, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Make K-Subarray Sums Equal, slug: make-k-subarray-sums-equal, url: https://leetcode.com/problems/make-k-subarray-sums-equal, topics: ['Array', 'Math', 'Sorting', 'Number Theory'], hasSolution: False, hasVideoSolution: False, 2608: questionNo: 2608, acRate: 36.342477140482124, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Shortest Cycle in a Graph, slug: shortest-cycle-in-a-graph, url: https://leetcode.com/problems/shortest-cycle-in-a-graph, topics: ['Breadth-First Search', 'Graph'], hasSolution: False, hasVideoSolution: False, 2609: questionNo: 2609, acRate: 46.42814567562735, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Find the Longest Balanced Substring of a Binary String, slug: find-the-longest-balanced-substring-of-a-binary-string, url: https://leetcode.com/problems/find-the-longest-balanced-substring-of-a-binary-string, topics: ['String'], hasSolution: False, hasVideoSolution: False, 2610: questionNo: 2610, acRate: 87.18639923658415, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Convert an Array Into a 2D Array With Conditions, slug: convert-an-array-into-a-2d-array-with-conditions, url: https://leetcode.com/problems/convert-an-array-into-a-2d-array-with-conditions, topics: ['Array', 'Hash Table'], hasSolution: True, hasVideoSolution: False, 2611: questionNo: 2611, acRate: 45.89317694981915, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Mice and Cheese, slug: mice-and-cheese, url: https://leetcode.com/problems/mice-and-cheese, topics: ['Array', 'Greedy', 'Sorting', 'Heap (Priority Queue)'], hasSolution: False, hasVideoSolution: False, 2612: questionNo: 2612, acRate: 16.491287430214854, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Minimum Reverse Operations, slug: minimum-reverse-operations, url: https://leetcode.com/problems/minimum-reverse-operations, topics: ['Array', 'Breadth-First Search', 'Ordered Set'], hasSolution: False, hasVideoSolution: False, 2613: questionNo: 2613, acRate: 43.287225386493084, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Beautiful Pairs, slug: beautiful-pairs, url: https://leetcode.com/problems/beautiful-pairs, topics: ['Array', 'Math', 'Divide and Conquer', 'Geometry', 'Sorting', 'Ordered Set'], hasSolution: False, hasVideoSolution: False, 2614: questionNo: 2614, acRate: 34.02695617881087, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Prime In Diagonal, slug: prime-in-diagonal, url: https://leetcode.com/problems/prime-in-diagonal, topics: ['Array', 'Math', 'Matrix', 'Number Theory'], hasSolution: False, hasVideoSolution: False, 2615: questionNo: 2615, acRate: 30.992863791498603, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Sum of Distances, slug: sum-of-distances, url: https://leetcode.com/problems/sum-of-distances, topics: ['Array', 'Hash Table', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 2616: questionNo: 2616, acRate: 43.90237998705016, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimize the Maximum Difference of Pairs, slug: minimize-the-maximum-difference-of-pairs, url: https://leetcode.com/problems/minimize-the-maximum-difference-of-pairs, topics: ['Array', 'Binary Search', 'Greedy'], hasSolution: True, hasVideoSolution: False, 2617: questionNo: 2617, acRate: 24.945870261843588, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Minimum Number of Visited Cells in a Grid, slug: minimum-number-of-visited-cells-in-a-grid, url: https://leetcode.com/problems/minimum-number-of-visited-cells-in-a-grid, topics: ['Array', 'Dynamic Programming', 'Stack', 'Breadth-First Search', 'Union Find', 'Heap (Priority Queue)', 'Matrix', 'Monotonic Stack'], hasSolution: False, hasVideoSolution: False, 2618: questionNo: 2618, acRate: 27.598078751911014, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Check if Object Instance of Class, slug: check-if-object-instance-of-class, url: https://leetcode.com/problems/check-if-object-instance-of-class, topics: [], hasSolution: True, hasVideoSolution: False, 2619: questionNo: 2619, acRate: 73.39285519021115, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Array Prototype Last, slug: array-prototype-last, url: https://leetcode.com/problems/array-prototype-last, topics: [], hasSolution: True, hasVideoSolution: False, 2620: questionNo: 2620, acRate: 81.03883198287724, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Counter, slug: counter, url: https://leetcode.com/problems/counter, topics: [], hasSolution: True, hasVideoSolution: False, 2621: questionNo: 2621, acRate: 86.8102944669487, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Sleep, slug: sleep, url: https://leetcode.com/problems/sleep, topics: [], hasSolution: True, hasVideoSolution: False, 2622: questionNo: 2622, acRate: 74.21581357206315, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Cache With Time Limit, slug: cache-with-time-limit, url: https://leetcode.com/problems/cache-with-time-limit, topics: [], hasSolution: True, hasVideoSolution: False, 2623: questionNo: 2623, acRate: 62.53596082889313, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Memoize, slug: memoize, url: https://leetcode.com/problems/memoize, topics: [], hasSolution: True, hasVideoSolution: False, 2624: questionNo: 2624, acRate: 65.3742223339408, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Snail Traversal, slug: snail-traversal, url: https://leetcode.com/problems/snail-traversal, topics: [], hasSolution: True, hasVideoSolution: False, 2625: questionNo: 2625, acRate: 63.50965084829112, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Flatten Deeply Nested Array, slug: flatten-deeply-nested-array, url: https://leetcode.com/problems/flatten-deeply-nested-array, topics: [], hasSolution: True, hasVideoSolution: False, 2626: questionNo: 2626, acRate: 84.61931666784488, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Array Reduce Transformation, slug: array-reduce-transformation, url: https://leetcode.com/problems/array-reduce-transformation, topics: [], hasSolution: True, hasVideoSolution: False, 2627: questionNo: 2627, acRate: 90.78270324848062, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Debounce, slug: debounce, url: https://leetcode.com/problems/debounce, topics: [], hasSolution: True, hasVideoSolution: False, 2628: questionNo: 2628, acRate: 38.70490286771508, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: JSON Deep Equal, slug: json-deep-equal, url: https://leetcode.com/problems/json-deep-equal, topics: [], hasSolution: True, hasVideoSolution: False, 2629: questionNo: 2629, acRate: 86.14322952574179, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Function Composition, slug: function-composition, url: https://leetcode.com/problems/function-composition, topics: [], hasSolution: True, hasVideoSolution: False, 2630: questionNo: 2630, acRate: 30.71798227351139, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Memoize II, slug: memoize-ii, url: https://leetcode.com/problems/memoize-ii, topics: [], hasSolution: True, hasVideoSolution: False, 2631: questionNo: 2631, acRate: 80.7333759714712, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Group By, slug: group-by, url: https://leetcode.com/problems/group-by, topics: [], hasSolution: True, hasVideoSolution: False, 2632: questionNo: 2632, acRate: 89.43067284118769, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Curry, slug: curry, url: https://leetcode.com/problems/curry, topics: [], hasSolution: True, hasVideoSolution: False, 2633: questionNo: 2633, acRate: 77.5222060188254, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Convert Object to JSON String, slug: convert-object-to-json-string, url: https://leetcode.com/problems/convert-object-to-json-string, topics: [], hasSolution: True, hasVideoSolution: False, 2634: questionNo: 2634, acRate: 84.6758899108691, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Filter Elements from Array, slug: filter-elements-from-array, url: https://leetcode.com/problems/filter-elements-from-array, topics: [], hasSolution: True, hasVideoSolution: False, 2635: questionNo: 2635, acRate: 85.72966848785329, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Apply Transform Over Each Element in Array, slug: apply-transform-over-each-element-in-array, url: https://leetcode.com/problems/apply-transform-over-each-element-in-array, topics: [], hasSolution: True, hasVideoSolution: False, 2636: questionNo: 2636, acRate: 80.04405857198394, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Promise Pool, slug: promise-pool, url: https://leetcode.com/problems/promise-pool, topics: [], hasSolution: True, hasVideoSolution: False, 2637: questionNo: 2637, acRate: 81.60029726884251, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Promise Time Limit, slug: promise-time-limit, url: https://leetcode.com/problems/promise-time-limit, topics: [], hasSolution: True, hasVideoSolution: False, 2638: questionNo: 2638, acRate: 47.20367278797997, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Count the Number of K-Free Subsets, slug: count-the-number-of-k-free-subsets, url: https://leetcode.com/problems/count-the-number-of-k-free-subsets, topics: ['Array', 'Math', 'Dynamic Programming', 'Sorting', 'Combinatorics'], hasSolution: False, hasVideoSolution: False, 2639: questionNo: 2639, acRate: 67.67221310069351, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Find the Width of Columns of a Grid, slug: find-the-width-of-columns-of-a-grid, url: https://leetcode.com/problems/find-the-width-of-columns-of-a-grid, topics: ['Array', 'Matrix'], hasSolution: False, hasVideoSolution: False, 2640: questionNo: 2640, acRate: 70.56447803495513, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Find the Score of All Prefixes of an Array, slug: find-the-score-of-all-prefixes-of-an-array, url: https://leetcode.com/problems/find-the-score-of-all-prefixes-of-an-array, topics: ['Array', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 2641: questionNo: 2641, acRate: 67.66848816029145, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Cousins in Binary Tree II, slug: cousins-in-binary-tree-ii, url: https://leetcode.com/problems/cousins-in-binary-tree-ii, topics: ['Hash Table', 'Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree'], hasSolution: False, hasVideoSolution: False, 2642: questionNo: 2642, acRate: 70.59718883511962, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Design Graph With Shortest Path Calculator, slug: design-graph-with-shortest-path-calculator, url: https://leetcode.com/problems/design-graph-with-shortest-path-calculator, topics: ['Graph', 'Design', 'Heap (Priority Queue)', 'Shortest Path'], hasSolution: True, hasVideoSolution: False, 2643: questionNo: 2643, acRate: 75.43467761410287, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Row With Maximum Ones, slug: row-with-maximum-ones, url: https://leetcode.com/problems/row-with-maximum-ones, topics: ['Array', 'Matrix'], hasSolution: False, hasVideoSolution: False, 2644: questionNo: 2644, acRate: 49.26397813143135, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Find the Maximum Divisibility Score, slug: find-the-maximum-divisibility-score, url: https://leetcode.com/problems/find-the-maximum-divisibility-score, topics: ['Array'], hasSolution: False, hasVideoSolution: False, 2645: questionNo: 2645, acRate: 50.51337570720123, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Additions to Make Valid String, slug: minimum-additions-to-make-valid-string, url: https://leetcode.com/problems/minimum-additions-to-make-valid-string, topics: ['String', 'Dynamic Programming', 'Stack', 'Greedy'], hasSolution: False, hasVideoSolution: False, 2646: questionNo: 2646, acRate: 45.48842773662173, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Minimize the Total Price of the Trips, slug: minimize-the-total-price-of-the-trips, url: https://leetcode.com/problems/minimize-the-total-price-of-the-trips, topics: ['Array', 'Dynamic Programming', 'Tree', 'Depth-First Search', 'Graph'], hasSolution: False, hasVideoSolution: False, 2647: questionNo: 2647, acRate: 66.16702355460386, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Color the Triangle Red, slug: color-the-triangle-red, url: https://leetcode.com/problems/color-the-triangle-red, topics: ['Array', 'Math'], hasSolution: False, hasVideoSolution: False, 2648: questionNo: 2648, acRate: 83.07140315502312, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Generate Fibonacci Sequence, slug: generate-fibonacci-sequence, url: https://leetcode.com/problems/generate-fibonacci-sequence, topics: [], hasSolution: True, hasVideoSolution: False, 2649: questionNo: 2649, acRate: 79.05597111168429, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Nested Array Generator, slug: nested-array-generator, url: https://leetcode.com/problems/nested-array-generator, topics: [], hasSolution: True, hasVideoSolution: False, 2650: questionNo: 2650, acRate: 51.64531524742527, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Design Cancellable Function, slug: design-cancellable-function, url: https://leetcode.com/problems/design-cancellable-function, topics: [], hasSolution: False, hasVideoSolution: False, 2651: questionNo: 2651, acRate: 78.51559216609229, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Calculate Delayed Arrival Time, slug: calculate-delayed-arrival-time, url: https://leetcode.com/problems/calculate-delayed-arrival-time, topics: ['Math'], hasSolution: False, hasVideoSolution: False, 2652: questionNo: 2652, acRate: 85.59284186443732, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Sum Multiples, slug: sum-multiples, url: https://leetcode.com/problems/sum-multiples, topics: ['Math'], hasSolution: False, hasVideoSolution: False, 2653: questionNo: 2653, acRate: 33.28113901982307, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Sliding Subarray Beauty, slug: sliding-subarray-beauty, url: https://leetcode.com/problems/sliding-subarray-beauty, topics: ['Array', 'Hash Table', 'Sliding Window'], hasSolution: False, hasVideoSolution: False, 2654: questionNo: 2654, acRate: 35.26104864744518, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Number of Operations to Make All Array Elements Equal to 1, slug: minimum-number-of-operations-to-make-all-array-elements-equal-to-1, url: https://leetcode.com/problems/minimum-number-of-operations-to-make-all-array-elements-equal-to-1, topics: ['Array', 'Math', 'Number Theory'], hasSolution: False, hasVideoSolution: False, 2655: questionNo: 2655, acRate: 52.16150081566069, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Find Maximal Uncovered Ranges, slug: find-maximal-uncovered-ranges, url: https://leetcode.com/problems/find-maximal-uncovered-ranges, topics: ['Array', 'Sorting'], hasSolution: False, hasVideoSolution: False, 2656: questionNo: 2656, acRate: 82.20498328022788, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Maximum Sum With Exactly K Elements , slug: maximum-sum-with-exactly-k-elements, url: https://leetcode.com/problems/maximum-sum-with-exactly-k-elements, topics: ['Array', 'Greedy'], hasSolution: False, hasVideoSolution: False, 2657: questionNo: 2657, acRate: 81.34773682291767, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Find the Prefix Common Array of Two Arrays, slug: find-the-prefix-common-array-of-two-arrays, url: https://leetcode.com/problems/find-the-prefix-common-array-of-two-arrays, topics: ['Array', 'Hash Table', 'Bit Manipulation'], hasSolution: False, hasVideoSolution: False, 2658: questionNo: 2658, acRate: 59.92895766872554, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum Number of Fish in a Grid, slug: maximum-number-of-fish-in-a-grid, url: https://leetcode.com/problems/maximum-number-of-fish-in-a-grid, topics: ['Array', 'Depth-First Search', 'Breadth-First Search', 'Union Find', 'Matrix'], hasSolution: False, hasVideoSolution: False, 2659: questionNo: 2659, acRate: 25.452958384448426, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Make Array Empty, slug: make-array-empty, url: https://leetcode.com/problems/make-array-empty, topics: ['Array', 'Binary Search', 'Greedy', 'Binary Indexed Tree', 'Segment Tree', 'Sorting', 'Ordered Set'], hasSolution: False, hasVideoSolution: False, 2660: questionNo: 2660, acRate: 34.02076124567474, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Determine the Winner of a Bowling Game, slug: determine-the-winner-of-a-bowling-game, url: https://leetcode.com/problems/determine-the-winner-of-a-bowling-game, topics: ['Array', 'Simulation'], hasSolution: False, hasVideoSolution: False, 2661: questionNo: 2661, acRate: 50.44534063706355, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: First Completely Painted Row or Column, slug: first-completely-painted-row-or-column, url: https://leetcode.com/problems/first-completely-painted-row-or-column, topics: ['Array', 'Hash Table', 'Matrix'], hasSolution: False, hasVideoSolution: False, 2662: questionNo: 2662, acRate: 38.975932324556176, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Cost of a Path With Special Roads, slug: minimum-cost-of-a-path-with-special-roads, url: https://leetcode.com/problems/minimum-cost-of-a-path-with-special-roads, topics: ['Array', 'Graph', 'Heap (Priority Queue)', 'Shortest Path'], hasSolution: False, hasVideoSolution: False, 2663: questionNo: 2663, acRate: 37.50271286985459, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Lexicographically Smallest Beautiful String, slug: lexicographically-smallest-beautiful-string, url: https://leetcode.com/problems/lexicographically-smallest-beautiful-string, topics: ['String', 'Greedy'], hasSolution: False, hasVideoSolution: False, 2664: questionNo: 2664, acRate: 66.39924492685229, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: The Knight’s Tour, slug: the-knights-tour, url: https://leetcode.com/problems/the-knights-tour, topics: ['Array', 'Backtracking', 'Matrix'], hasSolution: False, hasVideoSolution: False, 2665: questionNo: 2665, acRate: 80.11321025673756, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Counter II, slug: counter-ii, url: https://leetcode.com/problems/counter-ii, topics: [], hasSolution: True, hasVideoSolution: False, 2666: questionNo: 2666, acRate: 86.10536632364057, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Allow One Function Call, slug: allow-one-function-call, url: https://leetcode.com/problems/allow-one-function-call, topics: [], hasSolution: True, hasVideoSolution: False, 2667: questionNo: 2667, acRate: 81.26959970919447, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Create Hello World Function, slug: create-hello-world-function, url: https://leetcode.com/problems/create-hello-world-function, topics: [], hasSolution: True, hasVideoSolution: False, 2668: questionNo: 2668, acRate: 71.71595252464293, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Find Latest Salaries, slug: find-latest-salaries, url: https://leetcode.com/problems/find-latest-salaries, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 2669: questionNo: 2669, acRate: 71.86734920988204, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Count Artist Occurrences On Spotify Ranking List, slug: count-artist-occurrences-on-spotify-ranking-list, url: https://leetcode.com/problems/count-artist-occurrences-on-spotify-ranking-list, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 2670: questionNo: 2670, acRate: 77.64658309745248, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Find the Distinct Difference Array, slug: find-the-distinct-difference-array, url: https://leetcode.com/problems/find-the-distinct-difference-array, topics: ['Array', 'Hash Table'], hasSolution: False, hasVideoSolution: False, 2671: questionNo: 2671, acRate: 29.84288909497572, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Frequency Tracker, slug: frequency-tracker, url: https://leetcode.com/problems/frequency-tracker, topics: ['Hash Table', 'Design'], hasSolution: False, hasVideoSolution: False, 2672: questionNo: 2672, acRate: 54.78642995254, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Number of Adjacent Elements With the Same Color, slug: number-of-adjacent-elements-with-the-same-color, url: https://leetcode.com/problems/number-of-adjacent-elements-with-the-same-color, topics: ['Array'], hasSolution: False, hasVideoSolution: False, 2673: questionNo: 2673, acRate: 59.038586838485486, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Make Costs of Paths Equal in a Binary Tree, slug: make-costs-of-paths-equal-in-a-binary-tree, url: https://leetcode.com/problems/make-costs-of-paths-equal-in-a-binary-tree, topics: ['Array', 'Dynamic Programming', 'Greedy', 'Tree', 'Binary Tree'], hasSolution: False, hasVideoSolution: False, 2674: questionNo: 2674, acRate: 73.75, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Split a Circular Linked List, slug: split-a-circular-linked-list, url: https://leetcode.com/problems/split-a-circular-linked-list, topics: ['Linked List', 'Two Pointers'], hasSolution: False, hasVideoSolution: False, 2675: questionNo: 2675, acRate: 69.15557649275704, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Array of Objects to Matrix, slug: array-of-objects-to-matrix, url: https://leetcode.com/problems/array-of-objects-to-matrix, topics: [], hasSolution: True, hasVideoSolution: False, 2676: questionNo: 2676, acRate: 82.82214074935169, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Throttle, slug: throttle, url: https://leetcode.com/problems/throttle, topics: [], hasSolution: True, hasVideoSolution: False, 2677: questionNo: 2677, acRate: 83.32435902746138, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Chunk Array, slug: chunk-array, url: https://leetcode.com/problems/chunk-array, topics: [], hasSolution: True, hasVideoSolution: False, 2678: questionNo: 2678, acRate: 76.65890716127257, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Number of Senior Citizens, slug: number-of-senior-citizens, url: https://leetcode.com/problems/number-of-senior-citizens, topics: ['Array', 'String'], hasSolution: False, hasVideoSolution: False, 2679: questionNo: 2679, acRate: 59.97402506230475, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Sum in a Matrix, slug: sum-in-a-matrix, url: https://leetcode.com/problems/sum-in-a-matrix, topics: ['Array', 'Sorting', 'Heap (Priority Queue)', 'Matrix', 'Simulation'], hasSolution: False, hasVideoSolution: False, 2680: questionNo: 2680, acRate: 40.7432959385686, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum OR, slug: maximum-or, url: https://leetcode.com/problems/maximum-or, topics: ['Array', 'Greedy', 'Bit Manipulation', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 2681: questionNo: 2681, acRate: 30.78055460458747, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Power of Heroes, slug: power-of-heroes, url: https://leetcode.com/problems/power-of-heroes, topics: ['Array', 'Math', 'Dynamic Programming', 'Sorting', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 2682: questionNo: 2682, acRate: 49.03823745585573, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Find the Losers of the Circular Game, slug: find-the-losers-of-the-circular-game, url: https://leetcode.com/problems/find-the-losers-of-the-circular-game, topics: ['Array', 'Hash Table', 'Simulation'], hasSolution: False, hasVideoSolution: False, 2683: questionNo: 2683, acRate: 61.837038702605476, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Neighboring Bitwise XOR, slug: neighboring-bitwise-xor, url: https://leetcode.com/problems/neighboring-bitwise-xor, topics: ['Array', 'Bit Manipulation'], hasSolution: False, hasVideoSolution: False, 2684: questionNo: 2684, acRate: 45.90060809394003, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum Number of Moves in a Grid, slug: maximum-number-of-moves-in-a-grid, url: https://leetcode.com/problems/maximum-number-of-moves-in-a-grid, topics: ['Array', 'Dynamic Programming', 'Matrix'], hasSolution: False, hasVideoSolution: False, 2685: questionNo: 2685, acRate: 65.77744438453784, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Count the Number of Complete Components, slug: count-the-number-of-complete-components, url: https://leetcode.com/problems/count-the-number-of-complete-components, topics: ['Depth-First Search', 'Breadth-First Search', 'Graph'], hasSolution: False, hasVideoSolution: False, 2686: questionNo: 2686, acRate: 67.09965928449745, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Immediate Food Delivery III, slug: immediate-food-delivery-iii, url: https://leetcode.com/problems/immediate-food-delivery-iii, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 2687: questionNo: 2687, acRate: 80.29060229669557, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Bikes Last Time Used , slug: bikes-last-time-used, url: https://leetcode.com/problems/bikes-last-time-used, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 2688: questionNo: 2688, acRate: 41.93244516215853, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Find Active Users, slug: find-active-users, url: https://leetcode.com/problems/find-active-users, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 2689: questionNo: 2689, acRate: 74.26772515740487, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Extract Kth Character From The Rope Tree, slug: extract-kth-character-from-the-rope-tree, url: https://leetcode.com/problems/extract-kth-character-from-the-rope-tree, topics: ['Tree', 'Depth-First Search', 'Binary Tree'], hasSolution: False, hasVideoSolution: False, 2690: questionNo: 2690, acRate: 92.95665634674923, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Infinite Method Object, slug: infinite-method-object, url: https://leetcode.com/problems/infinite-method-object, topics: [], hasSolution: True, hasVideoSolution: False, 2691: questionNo: 2691, acRate: 37.93103448275862, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Immutability Helper, slug: immutability-helper, url: https://leetcode.com/problems/immutability-helper, topics: [], hasSolution: False, hasVideoSolution: False, 2692: questionNo: 2692, acRate: 62.764227642276424, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Make Object Immutable, slug: make-object-immutable, url: https://leetcode.com/problems/make-object-immutable, topics: [], hasSolution: True, hasVideoSolution: False, 2693: questionNo: 2693, acRate: 80.07626310772163, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Call Function with Custom Context, slug: call-function-with-custom-context, url: https://leetcode.com/problems/call-function-with-custom-context, topics: [], hasSolution: True, hasVideoSolution: False, 2694: questionNo: 2694, acRate: 74.38852015732547, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Event Emitter, slug: event-emitter, url: https://leetcode.com/problems/event-emitter, topics: [], hasSolution: True, hasVideoSolution: False, 2695: questionNo: 2695, acRate: 88.00709530281739, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Array Wrapper, slug: array-wrapper, url: https://leetcode.com/problems/array-wrapper, topics: [], hasSolution: True, hasVideoSolution: False, 2696: questionNo: 2696, acRate: 69.70838017581167, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Minimum String Length After Removing Substrings, slug: minimum-string-length-after-removing-substrings, url: https://leetcode.com/problems/minimum-string-length-after-removing-substrings, topics: ['String', 'Stack', 'Simulation'], hasSolution: False, hasVideoSolution: False, 2697: questionNo: 2697, acRate: 81.8735696171213, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Lexicographically Smallest Palindrome, slug: lexicographically-smallest-palindrome, url: https://leetcode.com/problems/lexicographically-smallest-palindrome, topics: ['Two Pointers', 'String', 'Greedy'], hasSolution: False, hasVideoSolution: False, 2698: questionNo: 2698, acRate: 62.582249787488585, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Find the Punishment Number of an Integer, slug: find-the-punishment-number-of-an-integer, url: https://leetcode.com/problems/find-the-punishment-number-of-an-integer, topics: ['Math', 'Backtracking'], hasSolution: False, hasVideoSolution: False, 2699: questionNo: 2699, acRate: 24.42409923213231, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Modify Graph Edge Weights, slug: modify-graph-edge-weights, url: https://leetcode.com/problems/modify-graph-edge-weights, topics: ['Graph', 'Heap (Priority Queue)', 'Shortest Path'], hasSolution: False, hasVideoSolution: False, 2700: questionNo: 2700, acRate: 76.47058823529412, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Differences Between Two Objects, slug: differences-between-two-objects, url: https://leetcode.com/problems/differences-between-two-objects, topics: [], hasSolution: True, hasVideoSolution: False, 2701: questionNo: 2701, acRate: 32.41311313778654, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Consecutive Transactions with Increasing Amounts, slug: consecutive-transactions-with-increasing-amounts, url: https://leetcode.com/problems/consecutive-transactions-with-increasing-amounts, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 2702: questionNo: 2702, acRate: 48.02101576182137, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Minimum Operations to Make Numbers Non-positive, slug: minimum-operations-to-make-numbers-non-positive, url: https://leetcode.com/problems/minimum-operations-to-make-numbers-non-positive, topics: ['Array', 'Binary Search'], hasSolution: False, hasVideoSolution: False, 2703: questionNo: 2703, acRate: 94.24189833075637, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Return Length of Arguments Passed, slug: return-length-of-arguments-passed, url: https://leetcode.com/problems/return-length-of-arguments-passed, topics: [], hasSolution: True, hasVideoSolution: False, 2704: questionNo: 2704, acRate: 62.29547435659269, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: To Be Or Not To Be, slug: to-be-or-not-to-be, url: https://leetcode.com/problems/to-be-or-not-to-be, topics: [], hasSolution: True, hasVideoSolution: False, 2705: questionNo: 2705, acRate: 64.90165086055497, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Compact Object, slug: compact-object, url: https://leetcode.com/problems/compact-object, topics: [], hasSolution: True, hasVideoSolution: False, 2706: questionNo: 2706, acRate: 69.209255602105, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Buy Two Chocolates, slug: buy-two-chocolates, url: https://leetcode.com/problems/buy-two-chocolates, topics: ['Array', 'Sorting'], hasSolution: True, hasVideoSolution: False, 2707: questionNo: 2707, acRate: 52.52437663723683, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Extra Characters in a String, slug: extra-characters-in-a-string, url: https://leetcode.com/problems/extra-characters-in-a-string, topics: ['Array', 'Hash Table', 'String', 'Dynamic Programming', 'Trie'], hasSolution: True, hasVideoSolution: False, 2708: questionNo: 2708, acRate: 24.17773045016574, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum Strength of a Group, slug: maximum-strength-of-a-group, url: https://leetcode.com/problems/maximum-strength-of-a-group, topics: ['Array', 'Dynamic Programming', 'Backtracking', 'Greedy', 'Bit Manipulation', 'Sorting', 'Enumeration'], hasSolution: False, hasVideoSolution: False, 2709: questionNo: 2709, acRate: 42.498881242365236, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Greatest Common Divisor Traversal, slug: greatest-common-divisor-traversal, url: https://leetcode.com/problems/greatest-common-divisor-traversal, topics: ['Array', 'Math', 'Union Find', 'Number Theory'], hasSolution: True, hasVideoSolution: False, 2710: questionNo: 2710, acRate: 78.72742240085225, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Remove Trailing Zeros From a String, slug: remove-trailing-zeros-from-a-string, url: https://leetcode.com/problems/remove-trailing-zeros-from-a-string, topics: ['String'], hasSolution: False, hasVideoSolution: False, 2711: questionNo: 2711, acRate: 71.09988368711835, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Difference of Number of Distinct Values on Diagonals, slug: difference-of-number-of-distinct-values-on-diagonals, url: https://leetcode.com/problems/difference-of-number-of-distinct-values-on-diagonals, topics: ['Array', 'Hash Table', 'Matrix'], hasSolution: False, hasVideoSolution: False, 2712: questionNo: 2712, acRate: 54.447303812819825, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Cost to Make All Characters Equal, slug: minimum-cost-to-make-all-characters-equal, url: https://leetcode.com/problems/minimum-cost-to-make-all-characters-equal, topics: ['String', 'Dynamic Programming', 'Greedy'], hasSolution: False, hasVideoSolution: False, 2713: questionNo: 2713, acRate: 30.633575945591218, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Maximum Strictly Increasing Cells in a Matrix, slug: maximum-strictly-increasing-cells-in-a-matrix, url: https://leetcode.com/problems/maximum-strictly-increasing-cells-in-a-matrix, topics: ['Array', 'Hash Table', 'Binary Search', 'Dynamic Programming', 'Memoization', 'Sorting', 'Matrix', 'Ordered Set'], hasSolution: False, hasVideoSolution: False, 2714: questionNo: 2714, acRate: 61.78548490687219, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Find Shortest Path with K Hops, slug: find-shortest-path-with-k-hops, url: https://leetcode.com/problems/find-shortest-path-with-k-hops, topics: ['Graph', 'Heap (Priority Queue)', 'Shortest Path'], hasSolution: False, hasVideoSolution: False, 2715: questionNo: 2715, acRate: 88.67224458749978, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Timeout Cancellation, slug: timeout-cancellation, url: https://leetcode.com/problems/timeout-cancellation, topics: [], hasSolution: True, hasVideoSolution: False, 2716: questionNo: 2716, acRate: 76.06789522071435, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Minimize String Length, slug: minimize-string-length, url: https://leetcode.com/problems/minimize-string-length, topics: ['Hash Table', 'String'], hasSolution: False, hasVideoSolution: False, 2717: questionNo: 2717, acRate: 63.85764337082796, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Semi-Ordered Permutation, slug: semi-ordered-permutation, url: https://leetcode.com/problems/semi-ordered-permutation, topics: ['Array', 'Simulation'], hasSolution: False, hasVideoSolution: False, 2718: questionNo: 2718, acRate: 30.875127263069363, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Sum of Matrix After Queries, slug: sum-of-matrix-after-queries, url: https://leetcode.com/problems/sum-of-matrix-after-queries, topics: ['Array', 'Hash Table'], hasSolution: False, hasVideoSolution: False, 2719: questionNo: 2719, acRate: 34.65211891208096, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Count of Integers, slug: count-of-integers, url: https://leetcode.com/problems/count-of-integers, topics: ['Math', 'String', 'Dynamic Programming'], hasSolution: False, hasVideoSolution: False, 2720: questionNo: 2720, acRate: 50.72170900692841, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Popularity Percentage, slug: popularity-percentage, url: https://leetcode.com/problems/popularity-percentage, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 2721: questionNo: 2721, acRate: 74.84908849450682, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Execute Asynchronous Functions in Parallel, slug: execute-asynchronous-functions-in-parallel, url: https://leetcode.com/problems/execute-asynchronous-functions-in-parallel, topics: [], hasSolution: True, hasVideoSolution: False, 2722: questionNo: 2722, acRate: 54.382779597566675, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Join Two Arrays by ID, slug: join-two-arrays-by-id, url: https://leetcode.com/problems/join-two-arrays-by-id, topics: [], hasSolution: True, hasVideoSolution: False, 2723: questionNo: 2723, acRate: 91.29187666016907, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Add Two Promises, slug: add-two-promises, url: https://leetcode.com/problems/add-two-promises, topics: [], hasSolution: True, hasVideoSolution: False, 2724: questionNo: 2724, acRate: 82.39681857265693, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Sort By, slug: sort-by, url: https://leetcode.com/problems/sort-by, topics: [], hasSolution: True, hasVideoSolution: False, 2725: questionNo: 2725, acRate: 80.30045938004386, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Interval Cancellation, slug: interval-cancellation, url: https://leetcode.com/problems/interval-cancellation, topics: [], hasSolution: True, hasVideoSolution: False, 2726: questionNo: 2726, acRate: 75.24845249588279, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Calculator with Method Chaining, slug: calculator-with-method-chaining, url: https://leetcode.com/problems/calculator-with-method-chaining, topics: [], hasSolution: True, hasVideoSolution: False, 2727: questionNo: 2727, acRate: 80.05502977456402, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Is Object Empty, slug: is-object-empty, url: https://leetcode.com/problems/is-object-empty, topics: [], hasSolution: True, hasVideoSolution: False, 2728: questionNo: 2728, acRate: 84.82180293501048, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Count Houses in a Circular Street, slug: count-houses-in-a-circular-street, url: https://leetcode.com/problems/count-houses-in-a-circular-street, topics: ['Array', 'Interactive'], hasSolution: False, hasVideoSolution: False, 2729: questionNo: 2729, acRate: 52.09755412193095, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Check if The Number is Fascinating, slug: check-if-the-number-is-fascinating, url: https://leetcode.com/problems/check-if-the-number-is-fascinating, topics: ['Hash Table', 'Math'], hasSolution: False, hasVideoSolution: False, 2730: questionNo: 2730, acRate: 36.8201166640391, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Find the Longest Semi-Repetitive Substring, slug: find-the-longest-semi-repetitive-substring, url: https://leetcode.com/problems/find-the-longest-semi-repetitive-substring, topics: ['String', 'Sliding Window'], hasSolution: False, hasVideoSolution: False, 2731: questionNo: 2731, acRate: 28.018960512852637, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Movement of Robots, slug: movement-of-robots, url: https://leetcode.com/problems/movement-of-robots, topics: ['Array', 'Brainteaser', 'Sorting', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 2732: questionNo: 2732, acRate: 45.63569272056357, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Find a Good Subset of the Matrix, slug: find-a-good-subset-of-the-matrix, url: https://leetcode.com/problems/find-a-good-subset-of-the-matrix, topics: ['Array', 'Hash Table', 'Bit Manipulation', 'Matrix'], hasSolution: False, hasVideoSolution: False, 2733: questionNo: 2733, acRate: 76.56079042472066, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Neither Minimum nor Maximum, slug: neither-minimum-nor-maximum, url: https://leetcode.com/problems/neither-minimum-nor-maximum, topics: ['Array', 'Sorting'], hasSolution: False, hasVideoSolution: False, 2734: questionNo: 2734, acRate: 30.916633058708303, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Lexicographically Smallest String After Substring Operation, slug: lexicographically-smallest-string-after-substring-operation, url: https://leetcode.com/problems/lexicographically-smallest-string-after-substring-operation, topics: ['String', 'Greedy'], hasSolution: False, hasVideoSolution: False, 2735: questionNo: 2735, acRate: 33.180229936880075, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Collecting Chocolates, slug: collecting-chocolates, url: https://leetcode.com/problems/collecting-chocolates, topics: ['Array', 'Enumeration'], hasSolution: False, hasVideoSolution: False, 2736: questionNo: 2736, acRate: 29.09425045943817, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Maximum Sum Queries, slug: maximum-sum-queries, url: https://leetcode.com/problems/maximum-sum-queries, topics: ['Array', 'Binary Search', 'Stack', 'Binary Indexed Tree', 'Segment Tree', 'Sorting', 'Monotonic Stack'], hasSolution: False, hasVideoSolution: False, 2737: questionNo: 2737, acRate: 57.16783216783217, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Find the Closest Marked Node, slug: find-the-closest-marked-node, url: https://leetcode.com/problems/find-the-closest-marked-node, topics: ['Array', 'Graph', 'Heap (Priority Queue)', 'Shortest Path'], hasSolution: False, hasVideoSolution: False, 2738: questionNo: 2738, acRate: 55.758575975480376, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Count Occurrences in Text, slug: count-occurrences-in-text, url: https://leetcode.com/problems/count-occurrences-in-text, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 2739: questionNo: 2739, acRate: 39.25987934595682, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Total Distance Traveled, slug: total-distance-traveled, url: https://leetcode.com/problems/total-distance-traveled, topics: ['Math', 'Simulation'], hasSolution: False, hasVideoSolution: False, 2740: questionNo: 2740, acRate: 65.29976539242553, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Find the Value of the Partition, slug: find-the-value-of-the-partition, url: https://leetcode.com/problems/find-the-value-of-the-partition, topics: ['Array', 'Sorting'], hasSolution: False, hasVideoSolution: False, 2741: questionNo: 2741, acRate: 28.408295502269866, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Special Permutations, slug: special-permutations, url: https://leetcode.com/problems/special-permutations, topics: ['Array', 'Dynamic Programming', 'Bit Manipulation', 'Bitmask'], hasSolution: False, hasVideoSolution: False, 2742: questionNo: 2742, acRate: 50.87057595597305, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Painting the Walls, slug: painting-the-walls, url: https://leetcode.com/problems/painting-the-walls, topics: ['Array', 'Dynamic Programming'], hasSolution: True, hasVideoSolution: False, 2743: questionNo: 2743, acRate: 76.63871501122003, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Count Substrings Without Repeating Character, slug: count-substrings-without-repeating-character, url: https://leetcode.com/problems/count-substrings-without-repeating-character, topics: ['Hash Table', 'String', 'Sliding Window'], hasSolution: True, hasVideoSolution: False, 2744: questionNo: 2744, acRate: 81.44853875476493, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Find Maximum Number of String Pairs, slug: find-maximum-number-of-string-pairs, url: https://leetcode.com/problems/find-maximum-number-of-string-pairs, topics: ['Array', 'Hash Table', 'String', 'Simulation'], hasSolution: False, hasVideoSolution: False, 2745: questionNo: 2745, acRate: 53.875757410338984, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Construct the Longest New String, slug: construct-the-longest-new-string, url: https://leetcode.com/problems/construct-the-longest-new-string, topics: ['Math', 'Dynamic Programming', 'Greedy', 'Brainteaser'], hasSolution: False, hasVideoSolution: False, 2746: questionNo: 2746, acRate: 26.762622652544028, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Decremental String Concatenation, slug: decremental-string-concatenation, url: https://leetcode.com/problems/decremental-string-concatenation, topics: ['Array', 'String', 'Dynamic Programming'], hasSolution: False, hasVideoSolution: False, 2747: questionNo: 2747, acRate: 32.24250052443885, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Count Zero Request Servers, slug: count-zero-request-servers, url: https://leetcode.com/problems/count-zero-request-servers, topics: ['Array', 'Hash Table', 'Sliding Window', 'Sorting'], hasSolution: False, hasVideoSolution: False, 2748: questionNo: 2748, acRate: 50.16848710202184, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Number of Beautiful Pairs, slug: number-of-beautiful-pairs, url: https://leetcode.com/problems/number-of-beautiful-pairs, topics: ['Array', 'Hash Table', 'Math', 'Counting', 'Number Theory'], hasSolution: False, hasVideoSolution: False, 2749: questionNo: 2749, acRate: 29.788439743105403, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Operations to Make the Integer Zero, slug: minimum-operations-to-make-the-integer-zero, url: https://leetcode.com/problems/minimum-operations-to-make-the-integer-zero, topics: ['Bit Manipulation', 'Brainteaser'], hasSolution: False, hasVideoSolution: False, 2750: questionNo: 2750, acRate: 34.08343788213248, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Ways to Split Array Into Good Subarrays, slug: ways-to-split-array-into-good-subarrays, url: https://leetcode.com/problems/ways-to-split-array-into-good-subarrays, topics: ['Array', 'Math', 'Dynamic Programming'], hasSolution: False, hasVideoSolution: False, 2751: questionNo: 2751, acRate: 57.1413485958067, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Robot Collisions, slug: robot-collisions, url: https://leetcode.com/problems/robot-collisions, topics: ['Array', 'Stack', 'Sorting', 'Simulation'], hasSolution: True, hasVideoSolution: False, 2752: questionNo: 2752, acRate: 37.57313660646146, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Customers with Maximum Number of Transactions on Consecutive Days, slug: customers-with-maximum-number-of-transactions-on-consecutive-days, url: https://leetcode.com/problems/customers-with-maximum-number-of-transactions-on-consecutive-days, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 2753: questionNo: 2753, acRate: 67.31707317073172, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Count Houses in a Circular Street II, slug: count-houses-in-a-circular-street-ii, url: https://leetcode.com/problems/count-houses-in-a-circular-street-ii, topics: [], hasSolution: True, hasVideoSolution: False, 2754: questionNo: 2754, acRate: 86.54970760233918, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Bind Function to Context, slug: bind-function-to-context, url: https://leetcode.com/problems/bind-function-to-context, topics: [], hasSolution: True, hasVideoSolution: False, 2755: questionNo: 2755, acRate: 64.8124191461837, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Deep Merge of Two Objects, slug: deep-merge-of-two-objects, url: https://leetcode.com/problems/deep-merge-of-two-objects, topics: [], hasSolution: True, hasVideoSolution: False, 2756: questionNo: 2756, acRate: 62.66666666666667, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Query Batching, slug: query-batching, url: https://leetcode.com/problems/query-batching, topics: [], hasSolution: True, hasVideoSolution: False, 2757: questionNo: 2757, acRate: 71.1645101663586, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Generate Circular Array Values, slug: generate-circular-array-values, url: https://leetcode.com/problems/generate-circular-array-values, topics: [], hasSolution: True, hasVideoSolution: False, 2758: questionNo: 2758, acRate: 83.80603842634949, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Next Day, slug: next-day, url: https://leetcode.com/problems/next-day, topics: [], hasSolution: True, hasVideoSolution: False, 2759: questionNo: 2759, acRate: 60.898282694848085, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Convert JSON String to Object, slug: convert-json-string-to-object, url: https://leetcode.com/problems/convert-json-string-to-object, topics: [], hasSolution: True, hasVideoSolution: False, 2760: questionNo: 2760, acRate: 29.642434643517667, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Longest Even Odd Subarray With Threshold, slug: longest-even-odd-subarray-with-threshold, url: https://leetcode.com/problems/longest-even-odd-subarray-with-threshold, topics: ['Array', 'Sliding Window'], hasSolution: False, hasVideoSolution: False, 2761: questionNo: 2761, acRate: 34.181759229237116, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Prime Pairs With Target Sum, slug: prime-pairs-with-target-sum, url: https://leetcode.com/problems/prime-pairs-with-target-sum, topics: ['Array', 'Math', 'Enumeration', 'Number Theory'], hasSolution: False, hasVideoSolution: False, 2762: questionNo: 2762, acRate: 41.136302125621974, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Continuous Subarrays, slug: continuous-subarrays, url: https://leetcode.com/problems/continuous-subarrays, topics: ['Array', 'Queue', 'Sliding Window', 'Heap (Priority Queue)', 'Ordered Set', 'Monotonic Queue'], hasSolution: False, hasVideoSolution: False, 2763: questionNo: 2763, acRate: 46.53489507076623, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Sum of Imbalance Numbers of All Subarrays, slug: sum-of-imbalance-numbers-of-all-subarrays, url: https://leetcode.com/problems/sum-of-imbalance-numbers-of-all-subarrays, topics: ['Array', 'Hash Table', 'Ordered Set'], hasSolution: False, hasVideoSolution: False, 2764: questionNo: 2764, acRate: 66.54366543665436, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Is Array a Preorder of Some ‌Binary Tree, slug: is-array-a-preorder-of-some-binary-tree, url: https://leetcode.com/problems/is-array-a-preorder-of-some-binary-tree, topics: ['Stack', 'Tree', 'Depth-First Search', 'Binary Tree'], hasSolution: False, hasVideoSolution: False, 2765: questionNo: 2765, acRate: 34.099532278315095, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Longest Alternating Subarray, slug: longest-alternating-subarray, url: https://leetcode.com/problems/longest-alternating-subarray, topics: ['Array', 'Enumeration'], hasSolution: False, hasVideoSolution: False, 2766: questionNo: 2766, acRate: 51.78182004772045, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Relocate Marbles, slug: relocate-marbles, url: https://leetcode.com/problems/relocate-marbles, topics: ['Array', 'Hash Table', 'Sorting', 'Simulation'], hasSolution: False, hasVideoSolution: False, 2767: questionNo: 2767, acRate: 53.34712915517015, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Partition String Into Minimum Beautiful Substrings, slug: partition-string-into-minimum-beautiful-substrings, url: https://leetcode.com/problems/partition-string-into-minimum-beautiful-substrings, topics: ['Hash Table', 'String', 'Dynamic Programming', 'Backtracking'], hasSolution: False, hasVideoSolution: False, 2768: questionNo: 2768, acRate: 36.291099188334016, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Number of Black Blocks, slug: number-of-black-blocks, url: https://leetcode.com/problems/number-of-black-blocks, topics: ['Array', 'Hash Table', 'Enumeration'], hasSolution: False, hasVideoSolution: False, 2769: questionNo: 2769, acRate: 90.48183254344391, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Find the Maximum Achievable Number, slug: find-the-maximum-achievable-number, url: https://leetcode.com/problems/find-the-maximum-achievable-number, topics: ['Math'], hasSolution: False, hasVideoSolution: False, 2770: questionNo: 2770, acRate: 31.12995327911403, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum Number of Jumps to Reach the Last Index, slug: maximum-number-of-jumps-to-reach-the-last-index, url: https://leetcode.com/problems/maximum-number-of-jumps-to-reach-the-last-index, topics: ['Array', 'Dynamic Programming'], hasSolution: False, hasVideoSolution: False, 2771: questionNo: 2771, acRate: 29.41105303910182, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Longest Non-decreasing Subarray From Two Arrays, slug: longest-non-decreasing-subarray-from-two-arrays, url: https://leetcode.com/problems/longest-non-decreasing-subarray-from-two-arrays, topics: ['Array', 'Dynamic Programming'], hasSolution: False, hasVideoSolution: False, 2772: questionNo: 2772, acRate: 33.250141511861266, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Apply Operations to Make All Array Elements Equal to Zero, slug: apply-operations-to-make-all-array-elements-equal-to-zero, url: https://leetcode.com/problems/apply-operations-to-make-all-array-elements-equal-to-zero, topics: ['Array', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 2773: questionNo: 2773, acRate: 74.37437437437437, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Height of Special Binary Tree, slug: height-of-special-binary-tree, url: https://leetcode.com/problems/height-of-special-binary-tree, topics: ['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree'], hasSolution: False, hasVideoSolution: False, 2774: questionNo: 2774, acRate: 81.6, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Array Upper Bound, slug: array-upper-bound, url: https://leetcode.com/problems/array-upper-bound, topics: [], hasSolution: True, hasVideoSolution: False, 2775: questionNo: 2775, acRate: 68.375, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Undefined to Null, slug: undefined-to-null, url: https://leetcode.com/problems/undefined-to-null, topics: [], hasSolution: True, hasVideoSolution: False, 2776: questionNo: 2776, acRate: 91.8075422626788, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Convert Callback Based Function to Promise Based Function, slug: convert-callback-based-function-to-promise-based-function, url: https://leetcode.com/problems/convert-callback-based-function-to-promise-based-function, topics: [], hasSolution: True, hasVideoSolution: False, 2777: questionNo: 2777, acRate: 80.64516129032258, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Date Range Generator, slug: date-range-generator, url: https://leetcode.com/problems/date-range-generator, topics: [], hasSolution: True, hasVideoSolution: False, 2778: questionNo: 2778, acRate: 81.41728209229032, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Sum of Squares of Special Elements , slug: sum-of-squares-of-special-elements, url: https://leetcode.com/problems/sum-of-squares-of-special-elements, topics: ['Array', 'Enumeration'], hasSolution: False, hasVideoSolution: False, 2779: questionNo: 2779, acRate: 38.31891410366747, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum Beauty of an Array After Applying Operation, slug: maximum-beauty-of-an-array-after-applying-operation, url: https://leetcode.com/problems/maximum-beauty-of-an-array-after-applying-operation, topics: ['Array', 'Binary Search', 'Sliding Window', 'Sorting'], hasSolution: False, hasVideoSolution: False, 2780: questionNo: 2780, acRate: 62.18367400904356, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Index of a Valid Split, slug: minimum-index-of-a-valid-split, url: https://leetcode.com/problems/minimum-index-of-a-valid-split, topics: ['Array', 'Hash Table', 'Sorting'], hasSolution: False, hasVideoSolution: False, 2781: questionNo: 2781, acRate: 37.78500429500552, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Length of the Longest Valid Substring, slug: length-of-the-longest-valid-substring, url: https://leetcode.com/problems/length-of-the-longest-valid-substring, topics: ['Array', 'Hash Table', 'String', 'Sliding Window'], hasSolution: False, hasVideoSolution: False, 2782: questionNo: 2782, acRate: 83.35955940204563, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Number of Unique Categories, slug: number-of-unique-categories, url: https://leetcode.com/problems/number-of-unique-categories, topics: ['Union Find', 'Interactive', 'Counting'], hasSolution: True, hasVideoSolution: False, 2783: questionNo: 2783, acRate: 37.20538720538721, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Flight Occupancy and Waitlist Analysis, slug: flight-occupancy-and-waitlist-analysis, url: https://leetcode.com/problems/flight-occupancy-and-waitlist-analysis, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 2784: questionNo: 2784, acRate: 49.33405652986199, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Check if Array is Good, slug: check-if-array-is-good, url: https://leetcode.com/problems/check-if-array-is-good, topics: ['Array', 'Hash Table', 'Sorting'], hasSolution: False, hasVideoSolution: False, 2785: questionNo: 2785, acRate: 81.33638432705344, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Sort Vowels in a String, slug: sort-vowels-in-a-string, url: https://leetcode.com/problems/sort-vowels-in-a-string, topics: ['String', 'Sorting'], hasSolution: True, hasVideoSolution: False, 2786: questionNo: 2786, acRate: 36.07046824292999, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Visit Array Positions to Maximize Score, slug: visit-array-positions-to-maximize-score, url: https://leetcode.com/problems/visit-array-positions-to-maximize-score, topics: ['Array', 'Dynamic Programming'], hasSolution: False, hasVideoSolution: False, 2787: questionNo: 2787, acRate: 33.79963981008168, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Ways to Express an Integer as Sum of Powers, slug: ways-to-express-an-integer-as-sum-of-powers, url: https://leetcode.com/problems/ways-to-express-an-integer-as-sum-of-powers, topics: ['Dynamic Programming'], hasSolution: False, hasVideoSolution: False, 2788: questionNo: 2788, acRate: 74.17550099172423, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Split Strings by Separator, slug: split-strings-by-separator, url: https://leetcode.com/problems/split-strings-by-separator, topics: ['Array', 'String'], hasSolution: False, hasVideoSolution: False, 2789: questionNo: 2789, acRate: 47.16325924072017, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Largest Element in an Array after Merge Operations, slug: largest-element-in-an-array-after-merge-operations, url: https://leetcode.com/problems/largest-element-in-an-array-after-merge-operations, topics: ['Array', 'Greedy'], hasSolution: False, hasVideoSolution: False, 2790: questionNo: 2790, acRate: 20.00657894736842, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Maximum Number of Groups With Increasing Length, slug: maximum-number-of-groups-with-increasing-length, url: https://leetcode.com/problems/maximum-number-of-groups-with-increasing-length, topics: ['Array', 'Math', 'Binary Search', 'Greedy', 'Sorting'], hasSolution: False, hasVideoSolution: False, 2791: questionNo: 2791, acRate: 48.11911044101018, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Count Paths That Can Form a Palindrome in a Tree, slug: count-paths-that-can-form-a-palindrome-in-a-tree, url: https://leetcode.com/problems/count-paths-that-can-form-a-palindrome-in-a-tree, topics: ['Dynamic Programming', 'Bit Manipulation', 'Tree', 'Depth-First Search', 'Bitmask'], hasSolution: False, hasVideoSolution: False, 2792: questionNo: 2792, acRate: 58.18735719725818, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Count Nodes That Are Great Enough, slug: count-nodes-that-are-great-enough, url: https://leetcode.com/problems/count-nodes-that-are-great-enough, topics: ['Divide and Conquer', 'Tree', 'Depth-First Search', 'Binary Tree'], hasSolution: False, hasVideoSolution: False, 2793: questionNo: 2793, acRate: 74.34325744308231, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Status of Flight Tickets, slug: status-of-flight-tickets, url: https://leetcode.com/problems/status-of-flight-tickets, topics: [], hasSolution: False, hasVideoSolution: False, 2794: questionNo: 2794, acRate: 63.6245110821382, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Create Object from Two Arrays, slug: create-object-from-two-arrays, url: https://leetcode.com/problems/create-object-from-two-arrays, topics: [], hasSolution: True, hasVideoSolution: False, 2795: questionNo: 2795, acRate: 87.8740157480315, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Parallel Execution of Promises for Individual Results Retrieval, slug: parallel-execution-of-promises-for-individual-results-retrieval, url: https://leetcode.com/problems/parallel-execution-of-promises-for-individual-results-retrieval, topics: [], hasSolution: True, hasVideoSolution: False, 2796: questionNo: 2796, acRate: 92.8308070462925, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Repeat String, slug: repeat-string, url: https://leetcode.com/problems/repeat-string, topics: [], hasSolution: True, hasVideoSolution: False, 2797: questionNo: 2797, acRate: 90.45837231057062, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Partial Function with Placeholders, slug: partial-function-with-placeholders, url: https://leetcode.com/problems/partial-function-with-placeholders, topics: [], hasSolution: False, hasVideoSolution: False, 2798: questionNo: 2798, acRate: 87.73394364496548, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Number of Employees Who Met the Target, slug: number-of-employees-who-met-the-target, url: https://leetcode.com/problems/number-of-employees-who-met-the-target, topics: ['Array'], hasSolution: False, hasVideoSolution: False, 2799: questionNo: 2799, acRate: 65.02737615160159, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Count Complete Subarrays in an Array, slug: count-complete-subarrays-in-an-array, url: https://leetcode.com/problems/count-complete-subarrays-in-an-array, topics: ['Array', 'Hash Table', 'Sliding Window'], hasSolution: False, hasVideoSolution: False, 2800: questionNo: 2800, acRate: 30.506709629251233, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Shortest String That Contains Three Strings, slug: shortest-string-that-contains-three-strings, url: https://leetcode.com/problems/shortest-string-that-contains-three-strings, topics: ['String', 'Greedy', 'Enumeration'], hasSolution: False, hasVideoSolution: False, 2801: questionNo: 2801, acRate: 27.925111398591344, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Count Stepping Numbers in Range, slug: count-stepping-numbers-in-range, url: https://leetcode.com/problems/count-stepping-numbers-in-range, topics: ['String', 'Dynamic Programming'], hasSolution: False, hasVideoSolution: False, 2802: questionNo: 2802, acRate: 77.44924977934686, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Find The K-th Lucky Number, slug: find-the-k-th-lucky-number, url: https://leetcode.com/problems/find-the-k-th-lucky-number, topics: ['Math', 'String', 'Bit Manipulation'], hasSolution: True, hasVideoSolution: False, 2803: questionNo: 2803, acRate: 86.39593908629442, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Factorial Generator, slug: factorial-generator, url: https://leetcode.com/problems/factorial-generator, topics: [], hasSolution: True, hasVideoSolution: False, 2804: questionNo: 2804, acRate: 88.87711864406779, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Array Prototype ForEach, slug: array-prototype-foreach, url: https://leetcode.com/problems/array-prototype-foreach, topics: [], hasSolution: True, hasVideoSolution: False, 2805: questionNo: 2805, acRate: 81.48893360160966, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Custom Interval, slug: custom-interval, url: https://leetcode.com/problems/custom-interval, topics: [], hasSolution: True, hasVideoSolution: False, 2806: questionNo: 2806, acRate: 52.60979166151793, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Account Balance After Rounded Purchase, slug: account-balance-after-rounded-purchase, url: https://leetcode.com/problems/account-balance-after-rounded-purchase, topics: ['Math'], hasSolution: False, hasVideoSolution: False, 2807: questionNo: 2807, acRate: 88.72774450635374, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Insert Greatest Common Divisors in Linked List, slug: insert-greatest-common-divisors-in-linked-list, url: https://leetcode.com/problems/insert-greatest-common-divisors-in-linked-list, topics: ['Linked List', 'Math', 'Number Theory'], hasSolution: False, hasVideoSolution: False, 2808: questionNo: 2808, acRate: 26.825688073394495, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Seconds to Equalize a Circular Array, slug: minimum-seconds-to-equalize-a-circular-array, url: https://leetcode.com/problems/minimum-seconds-to-equalize-a-circular-array, topics: ['Array', 'Hash Table'], hasSolution: False, hasVideoSolution: False, 2809: questionNo: 2809, acRate: 26.063938098147016, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Minimum Time to Make Array Sum At Most x, slug: minimum-time-to-make-array-sum-at-most-x, url: https://leetcode.com/problems/minimum-time-to-make-array-sum-at-most-x, topics: ['Array', 'Dynamic Programming', 'Sorting'], hasSolution: False, hasVideoSolution: False, 2810: questionNo: 2810, acRate: 83.79061066604663, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Faulty Keyboard, slug: faulty-keyboard, url: https://leetcode.com/problems/faulty-keyboard, topics: ['String', 'Simulation'], hasSolution: False, hasVideoSolution: False, 2811: questionNo: 2811, acRate: 33.740516461335005, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Check if it is Possible to Split Array, slug: check-if-it-is-possible-to-split-array, url: https://leetcode.com/problems/check-if-it-is-possible-to-split-array, topics: ['Array', 'Dynamic Programming', 'Greedy'], hasSolution: False, hasVideoSolution: False, 2812: questionNo: 2812, acRate: 49.05924008828059, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Find the Safest Path in a Grid, slug: find-the-safest-path-in-a-grid, url: https://leetcode.com/problems/find-the-safest-path-in-a-grid, topics: ['Array', 'Binary Search', 'Breadth-First Search', 'Union Find', 'Matrix'], hasSolution: True, hasVideoSolution: False, 2813: questionNo: 2813, acRate: 32.93189155947317, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Maximum Elegance of a K-Length Subsequence, slug: maximum-elegance-of-a-k-length-subsequence, url: https://leetcode.com/problems/maximum-elegance-of-a-k-length-subsequence, topics: ['Array', 'Hash Table', 'Stack', 'Greedy', 'Sorting', 'Heap (Priority Queue)'], hasSolution: False, hasVideoSolution: False, 2814: questionNo: 2814, acRate: 63.59583952451708, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Minimum Time Takes to Reach Destination Without Drowning, slug: minimum-time-takes-to-reach-destination-without-drowning, url: https://leetcode.com/problems/minimum-time-takes-to-reach-destination-without-drowning, topics: ['Array', 'Breadth-First Search', 'Matrix'], hasSolution: False, hasVideoSolution: False, 2815: questionNo: 2815, acRate: 58.02491216863622, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Max Pair Sum in an Array, slug: max-pair-sum-in-an-array, url: https://leetcode.com/problems/max-pair-sum-in-an-array, topics: ['Array', 'Hash Table'], hasSolution: False, hasVideoSolution: False, 2816: questionNo: 2816, acRate: 61.54850289630416, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Double a Number Represented as a Linked List, slug: double-a-number-represented-as-a-linked-list, url: https://leetcode.com/problems/double-a-number-represented-as-a-linked-list, topics: ['Linked List', 'Math', 'Stack'], hasSolution: True, hasVideoSolution: False, 2817: questionNo: 2817, acRate: 33.83478386431956, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Absolute Difference Between Elements With Constraint, slug: minimum-absolute-difference-between-elements-with-constraint, url: https://leetcode.com/problems/minimum-absolute-difference-between-elements-with-constraint, topics: ['Array', 'Binary Search', 'Ordered Set'], hasSolution: False, hasVideoSolution: False, 2818: questionNo: 2818, acRate: 32.65462559287117, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Apply Operations to Maximize Score, slug: apply-operations-to-maximize-score, url: https://leetcode.com/problems/apply-operations-to-maximize-score, topics: ['Array', 'Math', 'Stack', 'Greedy', 'Monotonic Stack', 'Number Theory'], hasSolution: False, hasVideoSolution: False, 2819: questionNo: 2819, acRate: 52.04513399153738, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Minimum Relative Loss After Buying Chocolates, slug: minimum-relative-loss-after-buying-chocolates, url: https://leetcode.com/problems/minimum-relative-loss-after-buying-chocolates, topics: ['Array', 'Binary Search', 'Sorting', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 2820: questionNo: 2820, acRate: 65.87708066581305, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Election Results, slug: election-results, url: https://leetcode.com/problems/election-results, topics: [], hasSolution: False, hasVideoSolution: False, 2821: questionNo: 2821, acRate: 65.92178770949721, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Delay the Resolution of Each Promise, slug: delay-the-resolution-of-each-promise, url: https://leetcode.com/problems/delay-the-resolution-of-each-promise, topics: [], hasSolution: True, hasVideoSolution: False, 2822: questionNo: 2822, acRate: 57.83040488922842, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Inversion of Object, slug: inversion-of-object, url: https://leetcode.com/problems/inversion-of-object, topics: [], hasSolution: False, hasVideoSolution: False, 2823: questionNo: 2823, acRate: 55.007704160246526, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Deep Object Filter, slug: deep-object-filter, url: https://leetcode.com/problems/deep-object-filter, topics: [], hasSolution: True, hasVideoSolution: False, 2824: questionNo: 2824, acRate: 87.30422131799686, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Count Pairs Whose Sum is Less than Target, slug: count-pairs-whose-sum-is-less-than-target, url: https://leetcode.com/problems/count-pairs-whose-sum-is-less-than-target, topics: ['Array', 'Two Pointers', 'Binary Search', 'Sorting'], hasSolution: False, hasVideoSolution: False, 2825: questionNo: 2825, acRate: 49.34384688344966, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Make String a Subsequence Using Cyclic Increments, slug: make-string-a-subsequence-using-cyclic-increments, url: https://leetcode.com/problems/make-string-a-subsequence-using-cyclic-increments, topics: ['Two Pointers', 'String'], hasSolution: False, hasVideoSolution: False, 2826: questionNo: 2826, acRate: 42.135864221281686, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Sorting Three Groups, slug: sorting-three-groups, url: https://leetcode.com/problems/sorting-three-groups, topics: ['Array', 'Binary Search', 'Dynamic Programming'], hasSolution: False, hasVideoSolution: False, 2827: questionNo: 2827, acRate: 18.056597071476496, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Number of Beautiful Integers in the Range, slug: number-of-beautiful-integers-in-the-range, url: https://leetcode.com/problems/number-of-beautiful-integers-in-the-range, topics: ['Math', 'Dynamic Programming'], hasSolution: False, hasVideoSolution: False, 2828: questionNo: 2828, acRate: 83.08766833431957, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Check if a String Is an Acronym of Words, slug: check-if-a-string-is-an-acronym-of-words, url: https://leetcode.com/problems/check-if-a-string-is-an-acronym-of-words, topics: ['Array', 'String'], hasSolution: False, hasVideoSolution: False, 2829: questionNo: 2829, acRate: 61.33097345132743, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Determine the Minimum Sum of a k-avoiding Array, slug: determine-the-minimum-sum-of-a-k-avoiding-array, url: https://leetcode.com/problems/determine-the-minimum-sum-of-a-k-avoiding-array, topics: ['Math', 'Greedy'], hasSolution: False, hasVideoSolution: False, 2830: questionNo: 2830, acRate: 36.37019634166806, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximize the Profit as the Salesman, slug: maximize-the-profit-as-the-salesman, url: https://leetcode.com/problems/maximize-the-profit-as-the-salesman, topics: ['Array', 'Hash Table', 'Binary Search', 'Dynamic Programming', 'Sorting'], hasSolution: False, hasVideoSolution: False, 2831: questionNo: 2831, acRate: 35.81678399740732, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Find the Longest Equal Subarray, slug: find-the-longest-equal-subarray, url: https://leetcode.com/problems/find-the-longest-equal-subarray, topics: ['Array', 'Hash Table', 'Binary Search', 'Sliding Window'], hasSolution: False, hasVideoSolution: False, 2832: questionNo: 2832, acRate: 74.26257952573742, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Maximal Range That Each Element Is Maximum in It, slug: maximal-range-that-each-element-is-maximum-in-it, url: https://leetcode.com/problems/maximal-range-that-each-element-is-maximum-in-it, topics: ['Array', 'Stack', 'Monotonic Stack'], hasSolution: False, hasVideoSolution: False, 2833: questionNo: 2833, acRate: 64.76802751730068, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Furthest Point From Origin, slug: furthest-point-from-origin, url: https://leetcode.com/problems/furthest-point-from-origin, topics: ['String', 'Counting'], hasSolution: False, hasVideoSolution: False, 2834: questionNo: 2834, acRate: 38.36852645187457, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Find the Minimum Possible Sum of a Beautiful Array, slug: find-the-minimum-possible-sum-of-a-beautiful-array, url: https://leetcode.com/problems/find-the-minimum-possible-sum-of-a-beautiful-array, topics: ['Math', 'Greedy'], hasSolution: False, hasVideoSolution: False, 2835: questionNo: 2835, acRate: 32.3892796046379, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Minimum Operations to Form Subsequence With Target Sum, slug: minimum-operations-to-form-subsequence-with-target-sum, url: https://leetcode.com/problems/minimum-operations-to-form-subsequence-with-target-sum, topics: ['Array', 'Greedy', 'Bit Manipulation'], hasSolution: False, hasVideoSolution: False, 2836: questionNo: 2836, acRate: 31.142191142191145, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Maximize Value of Function in a Ball Passing Game, slug: maximize-value-of-function-in-a-ball-passing-game, url: https://leetcode.com/problems/maximize-value-of-function-in-a-ball-passing-game, topics: ['Array', 'Dynamic Programming', 'Bit Manipulation'], hasSolution: False, hasVideoSolution: False, 2837: questionNo: 2837, acRate: 74.83669412098835, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Total Traveled Distance, slug: total-traveled-distance, url: https://leetcode.com/problems/total-traveled-distance, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 2838: questionNo: 2838, acRate: 68.83333333333333, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Maximum Coins Heroes Can Collect, slug: maximum-coins-heroes-can-collect, url: https://leetcode.com/problems/maximum-coins-heroes-can-collect, topics: ['Array', 'Two Pointers', 'Binary Search', 'Sorting', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 2839: questionNo: 2839, acRate: 47.10767648128866, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Check if Strings Can be Made Equal With Operations I, slug: check-if-strings-can-be-made-equal-with-operations-i, url: https://leetcode.com/problems/check-if-strings-can-be-made-equal-with-operations-i, topics: ['String'], hasSolution: False, hasVideoSolution: False, 2840: questionNo: 2840, acRate: 55.74162679425837, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Check if Strings Can be Made Equal With Operations II, slug: check-if-strings-can-be-made-equal-with-operations-ii, url: https://leetcode.com/problems/check-if-strings-can-be-made-equal-with-operations-ii, topics: ['Hash Table', 'String', 'Sorting'], hasSolution: False, hasVideoSolution: False, 2841: questionNo: 2841, acRate: 38.0584496529648, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum Sum of Almost Unique Subarray, slug: maximum-sum-of-almost-unique-subarray, url: https://leetcode.com/problems/maximum-sum-of-almost-unique-subarray, topics: ['Array', 'Hash Table', 'Sliding Window'], hasSolution: False, hasVideoSolution: False, 2842: questionNo: 2842, acRate: 29.40135794204839, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Count K-Subsequences of a String With Maximum Beauty, slug: count-k-subsequences-of-a-string-with-maximum-beauty, url: https://leetcode.com/problems/count-k-subsequences-of-a-string-with-maximum-beauty, topics: ['Hash Table', 'Math', 'String', 'Greedy', 'Combinatorics'], hasSolution: False, hasVideoSolution: False, 2843: questionNo: 2843, acRate: 74.43316743111805, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Count Symmetric Integers, slug: count-symmetric-integers, url: https://leetcode.com/problems/count-symmetric-integers, topics: ['Math', 'Enumeration'], hasSolution: False, hasVideoSolution: False, 2844: questionNo: 2844, acRate: 38.18997001098607, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Operations to Make a Special Number, slug: minimum-operations-to-make-a-special-number, url: https://leetcode.com/problems/minimum-operations-to-make-a-special-number, topics: ['Math', 'String', 'Greedy', 'Enumeration'], hasSolution: False, hasVideoSolution: False, 2845: questionNo: 2845, acRate: 35.38337246585372, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Count of Interesting Subarrays, slug: count-of-interesting-subarrays, url: https://leetcode.com/problems/count-of-interesting-subarrays, topics: ['Array', 'Hash Table', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 2846: questionNo: 2846, acRate: 44.516771327921575, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Minimum Edge Weight Equilibrium Queries in a Tree, slug: minimum-edge-weight-equilibrium-queries-in-a-tree, url: https://leetcode.com/problems/minimum-edge-weight-equilibrium-queries-in-a-tree, topics: ['Array', 'Tree', 'Graph', 'Strongly Connected Component'], hasSolution: False, hasVideoSolution: False, 2847: questionNo: 2847, acRate: 43.27163581790895, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Smallest Number With Given Digit Product, slug: smallest-number-with-given-digit-product, url: https://leetcode.com/problems/smallest-number-with-given-digit-product, topics: ['Math', 'Greedy'], hasSolution: False, hasVideoSolution: False, 2848: questionNo: 2848, acRate: 75.25615154785928, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Points That Intersect With Cars, slug: points-that-intersect-with-cars, url: https://leetcode.com/problems/points-that-intersect-with-cars, topics: ['Array', 'Hash Table', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 2849: questionNo: 2849, acRate: 35.683964401587794, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Determine if a Cell Is Reachable at a Given Time, slug: determine-if-a-cell-is-reachable-at-a-given-time, url: https://leetcode.com/problems/determine-if-a-cell-is-reachable-at-a-given-time, topics: ['Math'], hasSolution: True, hasVideoSolution: False, 2850: questionNo: 2850, acRate: 44.291214275529114, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Moves to Spread Stones Over Grid, slug: minimum-moves-to-spread-stones-over-grid, url: https://leetcode.com/problems/minimum-moves-to-spread-stones-over-grid, topics: ['Array', 'Dynamic Programming', 'Breadth-First Search', 'Matrix'], hasSolution: False, hasVideoSolution: False, 2851: questionNo: 2851, acRate: 29.342669979670205, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: String Transformation, slug: string-transformation, url: https://leetcode.com/problems/string-transformation, topics: ['Math', 'String', 'Dynamic Programming', 'String Matching'], hasSolution: False, hasVideoSolution: False, 2852: questionNo: 2852, acRate: 64.2567958357432, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Sum of Remoteness of All Cells, slug: sum-of-remoteness-of-all-cells, url: https://leetcode.com/problems/sum-of-remoteness-of-all-cells, topics: ['Array', 'Hash Table', 'Depth-First Search', 'Breadth-First Search', 'Union Find', 'Matrix'], hasSolution: False, hasVideoSolution: False, 2853: questionNo: 2853, acRate: 73.74707868086212, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Highest Salaries Difference, slug: highest-salaries-difference, url: https://leetcode.com/problems/highest-salaries-difference, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 2854: questionNo: 2854, acRate: 66.58438753471151, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Rolling Average Steps, slug: rolling-average-steps, url: https://leetcode.com/problems/rolling-average-steps, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 2855: questionNo: 2855, acRate: 57.94975116667528, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Minimum Right Shifts to Sort the Array, slug: minimum-right-shifts-to-sort-the-array, url: https://leetcode.com/problems/minimum-right-shifts-to-sort-the-array, topics: ['Array'], hasSolution: False, hasVideoSolution: False, 2856: questionNo: 2856, acRate: 22.388281141817174, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Array Length After Pair Removals, slug: minimum-array-length-after-pair-removals, url: https://leetcode.com/problems/minimum-array-length-after-pair-removals, topics: ['Array', 'Hash Table', 'Two Pointers', 'Binary Search', 'Greedy', 'Counting'], hasSolution: False, hasVideoSolution: False, 2857: questionNo: 2857, acRate: 32.123837891506454, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Count Pairs of Points With Distance k, slug: count-pairs-of-points-with-distance-k, url: https://leetcode.com/problems/count-pairs-of-points-with-distance-k, topics: ['Array', 'Hash Table', 'Bit Manipulation'], hasSolution: False, hasVideoSolution: False, 2858: questionNo: 2858, acRate: 58.67121201131501, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Minimum Edge Reversals So Every Node Is Reachable, slug: minimum-edge-reversals-so-every-node-is-reachable, url: https://leetcode.com/problems/minimum-edge-reversals-so-every-node-is-reachable, topics: ['Dynamic Programming', 'Depth-First Search', 'Breadth-First Search', 'Graph'], hasSolution: False, hasVideoSolution: False, 2859: questionNo: 2859, acRate: 86.63077056685236, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Sum of Values at Indices With K Set Bits, slug: sum-of-values-at-indices-with-k-set-bits, url: https://leetcode.com/problems/sum-of-values-at-indices-with-k-set-bits, topics: ['Array', 'Bit Manipulation'], hasSolution: False, hasVideoSolution: False, 2860: questionNo: 2860, acRate: 52.14313327534551, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Happy Students, slug: happy-students, url: https://leetcode.com/problems/happy-students, topics: ['Array', 'Sorting', 'Enumeration'], hasSolution: False, hasVideoSolution: False, 2861: questionNo: 2861, acRate: 38.438751440013164, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum Number of Alloys, slug: maximum-number-of-alloys, url: https://leetcode.com/problems/maximum-number-of-alloys, topics: ['Array', 'Binary Search'], hasSolution: False, hasVideoSolution: False, 2862: questionNo: 2862, acRate: 44.094073597379044, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Maximum Element-Sum of a Complete Subset of Indices, slug: maximum-element-sum-of-a-complete-subset-of-indices, url: https://leetcode.com/problems/maximum-element-sum-of-a-complete-subset-of-indices, topics: ['Array', 'Math', 'Number Theory'], hasSolution: False, hasVideoSolution: False, 2863: questionNo: 2863, acRate: 70.93279361866777, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Maximum Length of Semi-Decreasing Subarrays, slug: maximum-length-of-semi-decreasing-subarrays, url: https://leetcode.com/problems/maximum-length-of-semi-decreasing-subarrays, topics: ['Array', 'Hash Table', 'Sorting'], hasSolution: False, hasVideoSolution: False, 2864: questionNo: 2864, acRate: 83.15883924214982, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Maximum Odd Binary Number, slug: maximum-odd-binary-number, url: https://leetcode.com/problems/maximum-odd-binary-number, topics: ['Math', 'String', 'Greedy'], hasSolution: True, hasVideoSolution: False, 2865: questionNo: 2865, acRate: 43.54357071758212, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Beautiful Towers I, slug: beautiful-towers-i, url: https://leetcode.com/problems/beautiful-towers-i, topics: ['Array', 'Stack', 'Monotonic Stack'], hasSolution: False, hasVideoSolution: False, 2866: questionNo: 2866, acRate: 34.795305969349485, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Beautiful Towers II, slug: beautiful-towers-ii, url: https://leetcode.com/problems/beautiful-towers-ii, topics: ['Array', 'Stack', 'Monotonic Stack'], hasSolution: False, hasVideoSolution: False, 2867: questionNo: 2867, acRate: 35.12269938650307, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Count Valid Paths in a Tree, slug: count-valid-paths-in-a-tree, url: https://leetcode.com/problems/count-valid-paths-in-a-tree, topics: ['Math', 'Dynamic Programming', 'Tree', 'Depth-First Search', 'Number Theory'], hasSolution: False, hasVideoSolution: False, 2868: questionNo: 2868, acRate: 59.8937583001328, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: The Wording Game, slug: the-wording-game, url: https://leetcode.com/problems/the-wording-game, topics: ['Array', 'Math', 'Two Pointers', 'String', 'Game Theory'], hasSolution: False, hasVideoSolution: False, 2869: questionNo: 2869, acRate: 60.255133894672895, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Minimum Operations to Collect Elements, slug: minimum-operations-to-collect-elements, url: https://leetcode.com/problems/minimum-operations-to-collect-elements, topics: ['Array', 'Hash Table', 'Bit Manipulation'], hasSolution: False, hasVideoSolution: False, 2870: questionNo: 2870, acRate: 62.00393549097314, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Number of Operations to Make Array Empty, slug: minimum-number-of-operations-to-make-array-empty, url: https://leetcode.com/problems/minimum-number-of-operations-to-make-array-empty, topics: ['Array', 'Hash Table', 'Greedy', 'Counting'], hasSolution: True, hasVideoSolution: False, 2871: questionNo: 2871, acRate: 43.95535250184663, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Split Array Into Maximum Number of Subarrays, slug: split-array-into-maximum-number-of-subarrays, url: https://leetcode.com/problems/split-array-into-maximum-number-of-subarrays, topics: ['Array', 'Greedy', 'Bit Manipulation'], hasSolution: False, hasVideoSolution: False, 2872: questionNo: 2872, acRate: 57.86118590976535, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Maximum Number of K-Divisible Components, slug: maximum-number-of-k-divisible-components, url: https://leetcode.com/problems/maximum-number-of-k-divisible-components, topics: ['Tree', 'Depth-First Search'], hasSolution: False, hasVideoSolution: False, 2873: questionNo: 2873, acRate: 45.72307391856264, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Maximum Value of an Ordered Triplet I, slug: maximum-value-of-an-ordered-triplet-i, url: https://leetcode.com/problems/maximum-value-of-an-ordered-triplet-i, topics: ['Array'], hasSolution: False, hasVideoSolution: False, 2874: questionNo: 2874, acRate: 41.3826617593168, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum Value of an Ordered Triplet II, slug: maximum-value-of-an-ordered-triplet-ii, url: https://leetcode.com/problems/maximum-value-of-an-ordered-triplet-ii, topics: ['Array'], hasSolution: False, hasVideoSolution: False, 2875: questionNo: 2875, acRate: 30.813730503707493, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Size Subarray in Infinite Array, slug: minimum-size-subarray-in-infinite-array, url: https://leetcode.com/problems/minimum-size-subarray-in-infinite-array, topics: ['Array', 'Hash Table', 'Sliding Window', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 2876: questionNo: 2876, acRate: 32.78948561069567, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Count Visited Nodes in a Directed Graph, slug: count-visited-nodes-in-a-directed-graph, url: https://leetcode.com/problems/count-visited-nodes-in-a-directed-graph, topics: ['Dynamic Programming', 'Graph', 'Memoization'], hasSolution: False, hasVideoSolution: False, 2877: questionNo: 2877, acRate: 80.99364212930017, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Create a DataFrame from List, slug: create-a-dataframe-from-list, url: https://leetcode.com/problems/create-a-dataframe-from-list, topics: [], hasSolution: True, hasVideoSolution: False, 2878: questionNo: 2878, acRate: 84.73220496174356, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Get the Size of a DataFrame, slug: get-the-size-of-a-dataframe, url: https://leetcode.com/problems/get-the-size-of-a-dataframe, topics: [], hasSolution: True, hasVideoSolution: False, 2879: questionNo: 2879, acRate: 92.82440404394833, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Display the First Three Rows, slug: display-the-first-three-rows, url: https://leetcode.com/problems/display-the-first-three-rows, topics: [], hasSolution: True, hasVideoSolution: False, 2880: questionNo: 2880, acRate: 78.98142770791604, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Select Data, slug: select-data, url: https://leetcode.com/problems/select-data, topics: [], hasSolution: True, hasVideoSolution: False, 2881: questionNo: 2881, acRate: 90.01663654877665, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Create a New Column, slug: create-a-new-column, url: https://leetcode.com/problems/create-a-new-column, topics: [], hasSolution: True, hasVideoSolution: False, 2882: questionNo: 2882, acRate: 85.13029291127275, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Drop Duplicate Rows, slug: drop-duplicate-rows, url: https://leetcode.com/problems/drop-duplicate-rows, topics: [], hasSolution: True, hasVideoSolution: False, 2883: questionNo: 2883, acRate: 63.91818551017143, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Drop Missing Data, slug: drop-missing-data, url: https://leetcode.com/problems/drop-missing-data, topics: [], hasSolution: True, hasVideoSolution: False, 2884: questionNo: 2884, acRate: 91.75624939832494, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Modify Columns, slug: modify-columns, url: https://leetcode.com/problems/modify-columns, topics: [], hasSolution: True, hasVideoSolution: False, 2885: questionNo: 2885, acRate: 85.03738058978264, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Rename Columns, slug: rename-columns, url: https://leetcode.com/problems/rename-columns, topics: [], hasSolution: True, hasVideoSolution: False, 2886: questionNo: 2886, acRate: 87.00395744835349, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Change Data Type, slug: change-data-type, url: https://leetcode.com/problems/change-data-type, topics: [], hasSolution: True, hasVideoSolution: False, 2887: questionNo: 2887, acRate: 71.81591263650546, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Fill Missing Data, slug: fill-missing-data, url: https://leetcode.com/problems/fill-missing-data, topics: [], hasSolution: True, hasVideoSolution: False, 2888: questionNo: 2888, acRate: 90.39044092898014, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Reshape Data: Concatenate, slug: reshape-data-concatenate, url: https://leetcode.com/problems/reshape-data-concatenate, topics: [], hasSolution: True, hasVideoSolution: False, 2889: questionNo: 2889, acRate: 81.530523812403, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Reshape Data: Pivot, slug: reshape-data-pivot, url: https://leetcode.com/problems/reshape-data-pivot, topics: [], hasSolution: True, hasVideoSolution: False, 2890: questionNo: 2890, acRate: 85.54866721872831, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Reshape Data: Melt, slug: reshape-data-melt, url: https://leetcode.com/problems/reshape-data-melt, topics: [], hasSolution: True, hasVideoSolution: False, 2891: questionNo: 2891, acRate: 75.67976688300631, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Method Chaining, slug: method-chaining, url: https://leetcode.com/problems/method-chaining, topics: [], hasSolution: True, hasVideoSolution: False, 2892: questionNo: 2892, acRate: 40.55348589675359, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Minimizing Array After Replacing Pairs With Their Product, slug: minimizing-array-after-replacing-pairs-with-their-product, url: https://leetcode.com/problems/minimizing-array-after-replacing-pairs-with-their-product, topics: ['Array', 'Dynamic Programming', 'Greedy'], hasSolution: False, hasVideoSolution: False, 2893: questionNo: 2893, acRate: 67.87423103212576, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Calculate Orders Within Each Interval, slug: calculate-orders-within-each-interval, url: https://leetcode.com/problems/calculate-orders-within-each-interval, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 2894: questionNo: 2894, acRate: 88.99450093053088, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Divisible and Non-divisible Sums Difference, slug: divisible-and-non-divisible-sums-difference, url: https://leetcode.com/problems/divisible-and-non-divisible-sums-difference, topics: ['Math'], hasSolution: False, hasVideoSolution: False, 2895: questionNo: 2895, acRate: 69.03155283681235, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Processing Time, slug: minimum-processing-time, url: https://leetcode.com/problems/minimum-processing-time, topics: ['Array', 'Greedy', 'Sorting'], hasSolution: False, hasVideoSolution: False, 2896: questionNo: 2896, acRate: 26.845319006623946, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Apply Operations to Make Two Strings Equal, slug: apply-operations-to-make-two-strings-equal, url: https://leetcode.com/problems/apply-operations-to-make-two-strings-equal, topics: ['String', 'Dynamic Programming'], hasSolution: False, hasVideoSolution: False, 2897: questionNo: 2897, acRate: 46.97642163661581, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Apply Operations on Array to Maximize Sum of Squares, slug: apply-operations-on-array-to-maximize-sum-of-squares, url: https://leetcode.com/problems/apply-operations-on-array-to-maximize-sum-of-squares, topics: ['Array', 'Hash Table', 'Greedy', 'Bit Manipulation'], hasSolution: False, hasVideoSolution: False, 2898: questionNo: 2898, acRate: 67.41154562383612, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Maximum Linear Stock Score, slug: maximum-linear-stock-score, url: https://leetcode.com/problems/maximum-linear-stock-score, topics: ['Array', 'Hash Table'], hasSolution: False, hasVideoSolution: False, 2899: questionNo: 2899, acRate: 66.07455154149802, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Last Visited Integers, slug: last-visited-integers, url: https://leetcode.com/problems/last-visited-integers, topics: ['Array', 'Simulation'], hasSolution: False, hasVideoSolution: False, 2900: questionNo: 2900, acRate: 62.97539149888143, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Longest Unequal Adjacent Groups Subsequence I, slug: longest-unequal-adjacent-groups-subsequence-i, url: https://leetcode.com/problems/longest-unequal-adjacent-groups-subsequence-i, topics: ['Array', 'String', 'Dynamic Programming', 'Greedy'], hasSolution: False, hasVideoSolution: False, 2901: questionNo: 2901, acRate: 27.229734911424114, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Longest Unequal Adjacent Groups Subsequence II, slug: longest-unequal-adjacent-groups-subsequence-ii, url: https://leetcode.com/problems/longest-unequal-adjacent-groups-subsequence-ii, topics: ['Array', 'String', 'Dynamic Programming'], hasSolution: False, hasVideoSolution: False, 2902: questionNo: 2902, acRate: 20.967001581067986, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Count of Sub-Multisets With Bounded Sum, slug: count-of-sub-multisets-with-bounded-sum, url: https://leetcode.com/problems/count-of-sub-multisets-with-bounded-sum, topics: ['Array', 'Hash Table', 'Dynamic Programming', 'Sliding Window'], hasSolution: False, hasVideoSolution: False, 2903: questionNo: 2903, acRate: 61.90416240459516, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Find Indices With Index and Value Difference I, slug: find-indices-with-index-and-value-difference-i, url: https://leetcode.com/problems/find-indices-with-index-and-value-difference-i, topics: ['Array', 'Two Pointers'], hasSolution: False, hasVideoSolution: False, 2904: questionNo: 2904, acRate: 39.01255619283832, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Shortest and Lexicographically Smallest Beautiful String, slug: shortest-and-lexicographically-smallest-beautiful-string, url: https://leetcode.com/problems/shortest-and-lexicographically-smallest-beautiful-string, topics: ['String', 'Sliding Window'], hasSolution: False, hasVideoSolution: False, 2905: questionNo: 2905, acRate: 32.15114709851552, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Find Indices With Index and Value Difference II, slug: find-indices-with-index-and-value-difference-ii, url: https://leetcode.com/problems/find-indices-with-index-and-value-difference-ii, topics: ['Array', 'Two Pointers'], hasSolution: False, hasVideoSolution: False, 2906: questionNo: 2906, acRate: 30.888451171470038, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Construct Product Matrix, slug: construct-product-matrix, url: https://leetcode.com/problems/construct-product-matrix, topics: ['Array', 'Matrix', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 2907: questionNo: 2907, acRate: 56.610703043022035, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Maximum Profitable Triplets With Increasing Prices I, slug: maximum-profitable-triplets-with-increasing-prices-i, url: https://leetcode.com/problems/maximum-profitable-triplets-with-increasing-prices-i, topics: ['Array', 'Binary Indexed Tree', 'Segment Tree'], hasSolution: False, hasVideoSolution: False, 2908: questionNo: 2908, acRate: 64.99360674822039, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Minimum Sum of Mountain Triplets I, slug: minimum-sum-of-mountain-triplets-i, url: https://leetcode.com/problems/minimum-sum-of-mountain-triplets-i, topics: ['Array'], hasSolution: False, hasVideoSolution: False, 2909: questionNo: 2909, acRate: 54.186315302820155, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Sum of Mountain Triplets II, slug: minimum-sum-of-mountain-triplets-ii, url: https://leetcode.com/problems/minimum-sum-of-mountain-triplets-ii, topics: ['Array'], hasSolution: False, hasVideoSolution: False, 2910: questionNo: 2910, acRate: 25.052079160323693, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Number of Groups to Create a Valid Assignment, slug: minimum-number-of-groups-to-create-a-valid-assignment, url: https://leetcode.com/problems/minimum-number-of-groups-to-create-a-valid-assignment, topics: ['Array', 'Hash Table', 'Greedy'], hasSolution: False, hasVideoSolution: False, 2911: questionNo: 2911, acRate: 36.35933358576297, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Minimum Changes to Make K Semi-palindromes, slug: minimum-changes-to-make-k-semi-palindromes, url: https://leetcode.com/problems/minimum-changes-to-make-k-semi-palindromes, topics: ['Two Pointers', 'String', 'Dynamic Programming'], hasSolution: False, hasVideoSolution: False, 2912: questionNo: 2912, acRate: 64.1065830721003, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Number of Ways to Reach Destination in the Grid, slug: number-of-ways-to-reach-destination-in-the-grid, url: https://leetcode.com/problems/number-of-ways-to-reach-destination-in-the-grid, topics: ['Math', 'Dynamic Programming', 'Combinatorics'], hasSolution: False, hasVideoSolution: False, 2913: questionNo: 2913, acRate: 82.8503204725399, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Subarrays Distinct Element Sum of Squares I, slug: subarrays-distinct-element-sum-of-squares-i, url: https://leetcode.com/problems/subarrays-distinct-element-sum-of-squares-i, topics: ['Array', 'Hash Table'], hasSolution: False, hasVideoSolution: False, 2914: questionNo: 2914, acRate: 59.92050874403816, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Number of Changes to Make Binary String Beautiful, slug: minimum-number-of-changes-to-make-binary-string-beautiful, url: https://leetcode.com/problems/minimum-number-of-changes-to-make-binary-string-beautiful, topics: ['String'], hasSolution: False, hasVideoSolution: False, 2915: questionNo: 2915, acRate: 35.58087444223002, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Length of the Longest Subsequence That Sums to Target, slug: length-of-the-longest-subsequence-that-sums-to-target, url: https://leetcode.com/problems/length-of-the-longest-subsequence-that-sums-to-target, topics: ['Array', 'Dynamic Programming'], hasSolution: False, hasVideoSolution: False, 2916: questionNo: 2916, acRate: 21.21730795563467, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Subarrays Distinct Element Sum of Squares II, slug: subarrays-distinct-element-sum-of-squares-ii, url: https://leetcode.com/problems/subarrays-distinct-element-sum-of-squares-ii, topics: ['Array', 'Dynamic Programming', 'Binary Indexed Tree', 'Segment Tree'], hasSolution: False, hasVideoSolution: False, 2917: questionNo: 2917, acRate: 74.68299208934388, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Find the K-or of an Array, slug: find-the-k-or-of-an-array, url: https://leetcode.com/problems/find-the-k-or-of-an-array, topics: ['Array', 'Bit Manipulation'], hasSolution: False, hasVideoSolution: False, 2918: questionNo: 2918, acRate: 35.14748316768195, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Equal Sum of Two Arrays After Replacing Zeros, slug: minimum-equal-sum-of-two-arrays-after-replacing-zeros, url: https://leetcode.com/problems/minimum-equal-sum-of-two-arrays-after-replacing-zeros, topics: ['Array', 'Greedy'], hasSolution: False, hasVideoSolution: False, 2919: questionNo: 2919, acRate: 34.32850874981088, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Increment Operations to Make Array Beautiful, slug: minimum-increment-operations-to-make-array-beautiful, url: https://leetcode.com/problems/minimum-increment-operations-to-make-array-beautiful, topics: ['Array', 'Dynamic Programming'], hasSolution: False, hasVideoSolution: False, 2920: questionNo: 2920, acRate: 37.445725407995205, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Maximum Points After Collecting Coins From All Nodes, slug: maximum-points-after-collecting-coins-from-all-nodes, url: https://leetcode.com/problems/maximum-points-after-collecting-coins-from-all-nodes, topics: ['Array', 'Dynamic Programming', 'Bit Manipulation', 'Tree', 'Depth-First Search'], hasSolution: False, hasVideoSolution: False, 2921: questionNo: 2921, acRate: 49.326805385556916, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Maximum Profitable Triplets With Increasing Prices II, slug: maximum-profitable-triplets-with-increasing-prices-ii, url: https://leetcode.com/problems/maximum-profitable-triplets-with-increasing-prices-ii, topics: ['Array', 'Binary Indexed Tree', 'Segment Tree'], hasSolution: False, hasVideoSolution: False, 2922: questionNo: 2922, acRate: 40.28964862298196, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Market Analysis III, slug: market-analysis-iii, url: https://leetcode.com/problems/market-analysis-iii, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 2923: questionNo: 2923, acRate: 73.34134615384616, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Find Champion I, slug: find-champion-i, url: https://leetcode.com/problems/find-champion-i, topics: ['Array', 'Matrix'], hasSolution: False, hasVideoSolution: False, 2924: questionNo: 2924, acRate: 58.321637162131566, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Find Champion II, slug: find-champion-ii, url: https://leetcode.com/problems/find-champion-ii, topics: ['Graph'], hasSolution: False, hasVideoSolution: False, 2925: questionNo: 2925, acRate: 49.49017462983944, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum Score After Applying Operations on a Tree, slug: maximum-score-after-applying-operations-on-a-tree, url: https://leetcode.com/problems/maximum-score-after-applying-operations-on-a-tree, topics: ['Dynamic Programming', 'Tree', 'Depth-First Search'], hasSolution: False, hasVideoSolution: False, 2926: questionNo: 2926, acRate: 23.955479452054796, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Maximum Balanced Subsequence Sum, slug: maximum-balanced-subsequence-sum, url: https://leetcode.com/problems/maximum-balanced-subsequence-sum, topics: ['Array', 'Binary Search', 'Dynamic Programming', 'Binary Indexed Tree', 'Segment Tree'], hasSolution: False, hasVideoSolution: False, 2927: questionNo: 2927, acRate: 44.483058210251954, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Distribute Candies Among Children III, slug: distribute-candies-among-children-iii, url: https://leetcode.com/problems/distribute-candies-among-children-iii, topics: ['Math', 'Combinatorics'], hasSolution: False, hasVideoSolution: False, 2928: questionNo: 2928, acRate: 75.8706917329477, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Distribute Candies Among Children I, slug: distribute-candies-among-children-i, url: https://leetcode.com/problems/distribute-candies-among-children-i, topics: ['Math', 'Combinatorics', 'Enumeration'], hasSolution: False, hasVideoSolution: False, 2929: questionNo: 2929, acRate: 35.19663328979829, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Distribute Candies Among Children II, slug: distribute-candies-among-children-ii, url: https://leetcode.com/problems/distribute-candies-among-children-ii, topics: ['Math', 'Combinatorics', 'Enumeration'], hasSolution: False, hasVideoSolution: False, 2930: questionNo: 2930, acRate: 56.23568221387336, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Number of Strings Which Can Be Rearranged to Contain Substring, slug: number-of-strings-which-can-be-rearranged-to-contain-substring, url: https://leetcode.com/problems/number-of-strings-which-can-be-rearranged-to-contain-substring, topics: ['Math', 'Dynamic Programming', 'Combinatorics'], hasSolution: False, hasVideoSolution: False, 2931: questionNo: 2931, acRate: 65.42566549472627, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Maximum Spending After Buying Items, slug: maximum-spending-after-buying-items, url: https://leetcode.com/problems/maximum-spending-after-buying-items, topics: ['Array', 'Greedy', 'Sorting', 'Heap (Priority Queue)', 'Matrix'], hasSolution: False, hasVideoSolution: False, 2932: questionNo: 2932, acRate: 76.26548307184146, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Maximum Strong Pair XOR I, slug: maximum-strong-pair-xor-i, url: https://leetcode.com/problems/maximum-strong-pair-xor-i, topics: ['Array', 'Hash Table', 'Bit Manipulation', 'Trie', 'Sliding Window'], hasSolution: False, hasVideoSolution: False, 2933: questionNo: 2933, acRate: 44.239207655982284, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: High-Access Employees, slug: high-access-employees, url: https://leetcode.com/problems/high-access-employees, topics: ['Array', 'Hash Table', 'String', 'Sorting'], hasSolution: False, hasVideoSolution: False, 2934: questionNo: 2934, acRate: 44.908248378127894, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Operations to Maximize Last Elements in Arrays, slug: minimum-operations-to-maximize-last-elements-in-arrays, url: https://leetcode.com/problems/minimum-operations-to-maximize-last-elements-in-arrays, topics: ['Array', 'Enumeration'], hasSolution: False, hasVideoSolution: False, 2935: questionNo: 2935, acRate: 30.38145100972326, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Maximum Strong Pair XOR II, slug: maximum-strong-pair-xor-ii, url: https://leetcode.com/problems/maximum-strong-pair-xor-ii, topics: ['Array', 'Hash Table', 'Bit Manipulation', 'Trie', 'Sliding Window'], hasSolution: False, hasVideoSolution: False, 2936: questionNo: 2936, acRate: 67.27132381319953, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Number of Equal Numbers Blocks, slug: number-of-equal-numbers-blocks, url: https://leetcode.com/problems/number-of-equal-numbers-blocks, topics: ['Array', 'Binary Search', 'Interactive'], hasSolution: False, hasVideoSolution: False, 2937: questionNo: 2937, acRate: 43.16352230411471, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Make Three Strings Equal, slug: make-three-strings-equal, url: https://leetcode.com/problems/make-three-strings-equal, topics: ['String'], hasSolution: False, hasVideoSolution: False, 2938: questionNo: 2938, acRate: 53.357849182680454, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Separate Black and White Balls, slug: separate-black-and-white-balls, url: https://leetcode.com/problems/separate-black-and-white-balls, topics: ['Two Pointers', 'String', 'Greedy'], hasSolution: False, hasVideoSolution: False, 2939: questionNo: 2939, acRate: 26.089266737513285, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum Xor Product, slug: maximum-xor-product, url: https://leetcode.com/problems/maximum-xor-product, topics: ['Math', 'Greedy', 'Bit Manipulation'], hasSolution: False, hasVideoSolution: False, 2940: questionNo: 2940, acRate: 35.33901874078754, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Find Building Where Alice and Bob Can Meet, slug: find-building-where-alice-and-bob-can-meet, url: https://leetcode.com/problems/find-building-where-alice-and-bob-can-meet, topics: ['Array', 'Binary Search', 'Stack', 'Binary Indexed Tree', 'Segment Tree', 'Heap (Priority Queue)', 'Monotonic Stack'], hasSolution: False, hasVideoSolution: False, 2941: questionNo: 2941, acRate: 47.570332480818415, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Maximum GCD-Sum of a Subarray, slug: maximum-gcd-sum-of-a-subarray, url: https://leetcode.com/problems/maximum-gcd-sum-of-a-subarray, topics: ['Array', 'Math', 'Binary Search', 'Number Theory'], hasSolution: False, hasVideoSolution: False, 2942: questionNo: 2942, acRate: 88.58932637021982, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Find Words Containing Character, slug: find-words-containing-character, url: https://leetcode.com/problems/find-words-containing-character, topics: ['Array', 'String'], hasSolution: False, hasVideoSolution: False, 2943: questionNo: 2943, acRate: 36.6701994411793, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximize Area of Square Hole in Grid, slug: maximize-area-of-square-hole-in-grid, url: https://leetcode.com/problems/maximize-area-of-square-hole-in-grid, topics: ['Array', 'Sorting'], hasSolution: False, hasVideoSolution: False, 2944: questionNo: 2944, acRate: 45.71258021190867, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Number of Coins for Fruits, slug: minimum-number-of-coins-for-fruits, url: https://leetcode.com/problems/minimum-number-of-coins-for-fruits, topics: ['Array', 'Dynamic Programming', 'Queue', 'Heap (Priority Queue)', 'Monotonic Queue'], hasSolution: False, hasVideoSolution: False, 2945: questionNo: 2945, acRate: 15.94629855645806, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Find Maximum Non-decreasing Array Length, slug: find-maximum-non-decreasing-array-length, url: https://leetcode.com/problems/find-maximum-non-decreasing-array-length, topics: ['Array', 'Binary Search', 'Dynamic Programming', 'Stack', 'Queue', 'Monotonic Stack', 'Monotonic Queue'], hasSolution: False, hasVideoSolution: False, 2946: questionNo: 2946, acRate: 58.11813364353109, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Matrix Similarity After Cyclic Shifts, slug: matrix-similarity-after-cyclic-shifts, url: https://leetcode.com/problems/matrix-similarity-after-cyclic-shifts, topics: ['Array', 'Math', 'Matrix', 'Simulation'], hasSolution: False, hasVideoSolution: False, 2947: questionNo: 2947, acRate: 61.84873433275989, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Count Beautiful Substrings I, slug: count-beautiful-substrings-i, url: https://leetcode.com/problems/count-beautiful-substrings-i, topics: ['Hash Table', 'Math', 'String', 'Enumeration', 'Number Theory', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 2948: questionNo: 2948, acRate: 39.37335868876211, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Make Lexicographically Smallest Array by Swapping Elements, slug: make-lexicographically-smallest-array-by-swapping-elements, url: https://leetcode.com/problems/make-lexicographically-smallest-array-by-swapping-elements, topics: ['Array', 'Union Find', 'Sorting'], hasSolution: False, hasVideoSolution: False, 2949: questionNo: 2949, acRate: 25.161487208178627, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Count Beautiful Substrings II, slug: count-beautiful-substrings-ii, url: https://leetcode.com/problems/count-beautiful-substrings-ii, topics: ['Hash Table', 'Math', 'String', 'Number Theory', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 2950: questionNo: 2950, acRate: 76.20841180163214, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Number of Divisible Substrings, slug: number-of-divisible-substrings, url: https://leetcode.com/problems/number-of-divisible-substrings, topics: ['Hash Table', 'String', 'Counting', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 2951: questionNo: 2951, acRate: 75.7002710726733, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Find the Peaks, slug: find-the-peaks, url: https://leetcode.com/problems/find-the-peaks, topics: ['Array', 'Enumeration'], hasSolution: False, hasVideoSolution: False, 2952: questionNo: 2952, acRate: 56.045876223154146, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Number of Coins to be Added, slug: minimum-number-of-coins-to-be-added, url: https://leetcode.com/problems/minimum-number-of-coins-to-be-added, topics: ['Array', 'Greedy', 'Sorting'], hasSolution: False, hasVideoSolution: False, 2953: questionNo: 2953, acRate: 27.725856697819314, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Count Complete Substrings, slug: count-complete-substrings, url: https://leetcode.com/problems/count-complete-substrings, topics: ['Hash Table', 'String', 'Sliding Window'], hasSolution: False, hasVideoSolution: False, 2954: questionNo: 2954, acRate: 36.5296803652968, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Count the Number of Infection Sequences, slug: count-the-number-of-infection-sequences, url: https://leetcode.com/problems/count-the-number-of-infection-sequences, topics: ['Array', 'Math', 'Combinatorics'], hasSolution: False, hasVideoSolution: False, 2955: questionNo: 2955, acRate: 70.73906485671192, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Number of Same-End Substrings, slug: number-of-same-end-substrings, url: https://leetcode.com/problems/number-of-same-end-substrings, topics: ['Array', 'Hash Table', 'String', 'Counting', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 2956: questionNo: 2956, acRate: 83.54618526054519, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Find Common Elements Between Two Arrays, slug: find-common-elements-between-two-arrays, url: https://leetcode.com/problems/find-common-elements-between-two-arrays, topics: ['Array', 'Hash Table'], hasSolution: False, hasVideoSolution: False, 2957: questionNo: 2957, acRate: 52.40392816239003, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Remove Adjacent Almost-Equal Characters, slug: remove-adjacent-almost-equal-characters, url: https://leetcode.com/problems/remove-adjacent-almost-equal-characters, topics: ['String', 'Dynamic Programming', 'Greedy'], hasSolution: False, hasVideoSolution: False, 2958: questionNo: 2958, acRate: 55.8182430467327, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Length of Longest Subarray With at Most K Frequency, slug: length-of-longest-subarray-with-at-most-k-frequency, url: https://leetcode.com/problems/length-of-longest-subarray-with-at-most-k-frequency, topics: ['Array', 'Hash Table', 'Sliding Window'], hasSolution: True, hasVideoSolution: False, 2959: questionNo: 2959, acRate: 51.145904243249376, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Number of Possible Sets of Closing Branches, slug: number-of-possible-sets-of-closing-branches, url: https://leetcode.com/problems/number-of-possible-sets-of-closing-branches, topics: ['Bit Manipulation', 'Graph', 'Heap (Priority Queue)', 'Enumeration', 'Shortest Path'], hasSolution: False, hasVideoSolution: False, 2960: questionNo: 2960, acRate: 80.71718129197507, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Count Tested Devices After Test Operations, slug: count-tested-devices-after-test-operations, url: https://leetcode.com/problems/count-tested-devices-after-test-operations, topics: ['Array', 'Simulation'], hasSolution: False, hasVideoSolution: False, 2961: questionNo: 2961, acRate: 47.870421753607104, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Double Modular Exponentiation, slug: double-modular-exponentiation, url: https://leetcode.com/problems/double-modular-exponentiation, topics: ['Array', 'Math', 'Simulation'], hasSolution: False, hasVideoSolution: False, 2962: questionNo: 2962, acRate: 58.98094257368251, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Count Subarrays Where Max Element Appears at Least K Times, slug: count-subarrays-where-max-element-appears-at-least-k-times, url: https://leetcode.com/problems/count-subarrays-where-max-element-appears-at-least-k-times, topics: ['Array', 'Sliding Window'], hasSolution: True, hasVideoSolution: False, 2963: questionNo: 2963, acRate: 49.727959940295634, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Count the Number of Good Partitions, slug: count-the-number-of-good-partitions, url: https://leetcode.com/problems/count-the-number-of-good-partitions, topics: ['Array', 'Hash Table', 'Math', 'Combinatorics'], hasSolution: False, hasVideoSolution: False, 2964: questionNo: 2964, acRate: 66.96982224059529, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Number of Divisible Triplet Sums, slug: number-of-divisible-triplet-sums, url: https://leetcode.com/problems/number-of-divisible-triplet-sums, topics: ['Array', 'Hash Table'], hasSolution: False, hasVideoSolution: False, 2965: questionNo: 2965, acRate: 75.75149052756115, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Find Missing and Repeated Values, slug: find-missing-and-repeated-values, url: https://leetcode.com/problems/find-missing-and-repeated-values, topics: ['Array', 'Hash Table', 'Math', 'Matrix'], hasSolution: False, hasVideoSolution: False, 2966: questionNo: 2966, acRate: 71.5907902119849, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Divide Array Into Arrays With Max Difference, slug: divide-array-into-arrays-with-max-difference, url: https://leetcode.com/problems/divide-array-into-arrays-with-max-difference, topics: ['Array', 'Greedy', 'Sorting'], hasSolution: True, hasVideoSolution: False, 2967: questionNo: 2967, acRate: 22.100888556573754, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Cost to Make Array Equalindromic, slug: minimum-cost-to-make-array-equalindromic, url: https://leetcode.com/problems/minimum-cost-to-make-array-equalindromic, topics: ['Array', 'Math', 'Greedy', 'Sorting'], hasSolution: False, hasVideoSolution: False, 2968: questionNo: 2968, acRate: 38.364896645624455, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Apply Operations to Maximize Frequency Score, slug: apply-operations-to-maximize-frequency-score, url: https://leetcode.com/problems/apply-operations-to-maximize-frequency-score, topics: ['Array', 'Binary Search', 'Sliding Window', 'Sorting', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 2969: questionNo: 2969, acRate: 54.99524262607041, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Minimum Number of Coins for Fruits II, slug: minimum-number-of-coins-for-fruits-ii, url: https://leetcode.com/problems/minimum-number-of-coins-for-fruits-ii, topics: ['Array', 'Dynamic Programming', 'Queue', 'Heap (Priority Queue)', 'Monotonic Queue'], hasSolution: False, hasVideoSolution: False, 2970: questionNo: 2970, acRate: 51.73631867833271, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Count the Number of Incremovable Subarrays I, slug: count-the-number-of-incremovable-subarrays-i, url: https://leetcode.com/problems/count-the-number-of-incremovable-subarrays-i, topics: ['Array', 'Two Pointers', 'Binary Search', 'Enumeration'], hasSolution: False, hasVideoSolution: False, 2971: questionNo: 2971, acRate: 66.0613421811431, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Find Polygon With the Largest Perimeter, slug: find-polygon-with-the-largest-perimeter, url: https://leetcode.com/problems/find-polygon-with-the-largest-perimeter, topics: ['Array', 'Greedy', 'Sorting', 'Prefix Sum'], hasSolution: True, hasVideoSolution: False, 2972: questionNo: 2972, acRate: 39.710295475530934, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Count the Number of Incremovable Subarrays II, slug: count-the-number-of-incremovable-subarrays-ii, url: https://leetcode.com/problems/count-the-number-of-incremovable-subarrays-ii, topics: ['Array', 'Two Pointers', 'Binary Search'], hasSolution: False, hasVideoSolution: False, 2973: questionNo: 2973, acRate: 36.60435410936553, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Find Number of Coins to Place in Tree Nodes, slug: find-number-of-coins-to-place-in-tree-nodes, url: https://leetcode.com/problems/find-number-of-coins-to-place-in-tree-nodes, topics: ['Dynamic Programming', 'Tree', 'Depth-First Search', 'Sorting', 'Heap (Priority Queue)'], hasSolution: False, hasVideoSolution: False, 2974: questionNo: 2974, acRate: 85.8654677872345, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Minimum Number Game, slug: minimum-number-game, url: https://leetcode.com/problems/minimum-number-game, topics: ['Array', 'Sorting', 'Heap (Priority Queue)', 'Simulation'], hasSolution: False, hasVideoSolution: False, 2975: questionNo: 2975, acRate: 22.76965158363494, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum Square Area by Removing Fences From a Field, slug: maximum-square-area-by-removing-fences-from-a-field, url: https://leetcode.com/problems/maximum-square-area-by-removing-fences-from-a-field, topics: ['Array', 'Hash Table', 'Enumeration'], hasSolution: False, hasVideoSolution: False, 2976: questionNo: 2976, acRate: 40.176746901621506, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Cost to Convert String I, slug: minimum-cost-to-convert-string-i, url: https://leetcode.com/problems/minimum-cost-to-convert-string-i, topics: ['Array', 'String', 'Graph', 'Shortest Path'], hasSolution: True, hasVideoSolution: False, 2977: questionNo: 2977, acRate: 24.730015427689846, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Minimum Cost to Convert String II, slug: minimum-cost-to-convert-string-ii, url: https://leetcode.com/problems/minimum-cost-to-convert-string-ii, topics: ['Array', 'String', 'Dynamic Programming', 'Graph', 'Trie', 'Shortest Path'], hasSolution: False, hasVideoSolution: False, 2978: questionNo: 2978, acRate: 42.4757281553398, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Symmetric Coordinates, slug: symmetric-coordinates, url: https://leetcode.com/problems/symmetric-coordinates, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 2979: questionNo: 2979, acRate: 77.10159876224859, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Most Expensive Item That Can Not Be Bought, slug: most-expensive-item-that-can-not-be-bought, url: https://leetcode.com/problems/most-expensive-item-that-can-not-be-bought, topics: ['Math', 'Dynamic Programming', 'Number Theory'], hasSolution: False, hasVideoSolution: False, 2980: questionNo: 2980, acRate: 70.59909416790092, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Check if Bitwise OR Has Trailing Zeros, slug: check-if-bitwise-or-has-trailing-zeros, url: https://leetcode.com/problems/check-if-bitwise-or-has-trailing-zeros, topics: ['Array', 'Bit Manipulation'], hasSolution: False, hasVideoSolution: False, 2981: questionNo: 2981, acRate: 42.853564346101656, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Find Longest Special Substring That Occurs Thrice I, slug: find-longest-special-substring-that-occurs-thrice-i, url: https://leetcode.com/problems/find-longest-special-substring-that-occurs-thrice-i, topics: ['Hash Table', 'String', 'Binary Search', 'Sliding Window', 'Counting'], hasSolution: False, hasVideoSolution: False, 2982: questionNo: 2982, acRate: 33.935952486054816, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Find Longest Special Substring That Occurs Thrice II, slug: find-longest-special-substring-that-occurs-thrice-ii, url: https://leetcode.com/problems/find-longest-special-substring-that-occurs-thrice-ii, topics: ['Hash Table', 'String', 'Binary Search', 'Sliding Window', 'Counting'], hasSolution: False, hasVideoSolution: False, 2983: questionNo: 2983, acRate: 25.877894736842105, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Palindrome Rearrangement Queries, slug: palindrome-rearrangement-queries, url: https://leetcode.com/problems/palindrome-rearrangement-queries, topics: ['Hash Table', 'String', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 2984: questionNo: 2984, acRate: 60.630888979926254, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Find Peak Calling Hours for Each City, slug: find-peak-calling-hours-for-each-city, url: https://leetcode.com/problems/find-peak-calling-hours-for-each-city, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 2985: questionNo: 2985, acRate: 86.8596881959911, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Calculate Compressed Mean, slug: calculate-compressed-mean, url: https://leetcode.com/problems/calculate-compressed-mean, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 2986: questionNo: 2986, acRate: 51.37524557956779, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Find Third Transaction, slug: find-third-transaction, url: https://leetcode.com/problems/find-third-transaction, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 2987: questionNo: 2987, acRate: 78.61562258313998, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Find Expensive Cities, slug: find-expensive-cities, url: https://leetcode.com/problems/find-expensive-cities, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 2988: questionNo: 2988, acRate: 79.19200695047785, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Manager of the Largest Department, slug: manager-of-the-largest-department, url: https://leetcode.com/problems/manager-of-the-largest-department, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 2989: questionNo: 2989, acRate: 88.823297914207, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Class Performance, slug: class-performance, url: https://leetcode.com/problems/class-performance, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 2990: questionNo: 2990, acRate: 61.07938320959452, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Loan Types, slug: loan-types, url: https://leetcode.com/problems/loan-types, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 2991: questionNo: 2991, acRate: 52.691605839416056, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Top Three Wineries , slug: top-three-wineries, url: https://leetcode.com/problems/top-three-wineries, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 2992: questionNo: 2992, acRate: 73.47447073474471, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Number of Self-Divisible Permutations, slug: number-of-self-divisible-permutations, url: https://leetcode.com/problems/number-of-self-divisible-permutations, topics: ['Array', 'Dynamic Programming', 'Bit Manipulation', 'Recursion', 'Bitmask'], hasSolution: False, hasVideoSolution: False, 2993: questionNo: 2993, acRate: 80.6910569105691, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Friday Purchases I, slug: friday-purchases-i, url: https://leetcode.com/problems/friday-purchases-i, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 2994: questionNo: 2994, acRate: 73.11608961303462, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Friday Purchases II , slug: friday-purchases-ii, url: https://leetcode.com/problems/friday-purchases-ii, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 2995: questionNo: 2995, acRate: 42.81391830559758, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Viewers Turned Streamers, slug: viewers-turned-streamers, url: https://leetcode.com/problems/viewers-turned-streamers, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 2996: questionNo: 2996, acRate: 32.52809418240196, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Smallest Missing Integer Greater Than Sequential Prefix Sum, slug: smallest-missing-integer-greater-than-sequential-prefix-sum, url: https://leetcode.com/problems/smallest-missing-integer-greater-than-sequential-prefix-sum, topics: ['Array', 'Hash Table', 'Sorting'], hasSolution: False, hasVideoSolution: False, 2997: questionNo: 2997, acRate: 86.42746581135206, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Number of Operations to Make Array XOR Equal to K, slug: minimum-number-of-operations-to-make-array-xor-equal-to-k, url: https://leetcode.com/problems/minimum-number-of-operations-to-make-array-xor-equal-to-k, topics: ['Array', 'Bit Manipulation'], hasSolution: True, hasVideoSolution: False, 2998: questionNo: 2998, acRate: 46.32773963265003, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Number of Operations to Make X and Y Equal, slug: minimum-number-of-operations-to-make-x-and-y-equal, url: https://leetcode.com/problems/minimum-number-of-operations-to-make-x-and-y-equal, topics: ['Dynamic Programming', 'Breadth-First Search', 'Memoization'], hasSolution: False, hasVideoSolution: False, 2999: questionNo: 2999, acRate: 26.211402798658494, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Count the Number of Powerful Integers, slug: count-the-number-of-powerful-integers, url: https://leetcode.com/problems/count-the-number-of-powerful-integers, topics: ['Math', 'String', 'Dynamic Programming'], hasSolution: False, hasVideoSolution: False, 3000: questionNo: 3000, acRate: 36.05833429716004, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Maximum Area of Longest Diagonal Rectangle, slug: maximum-area-of-longest-diagonal-rectangle, url: https://leetcode.com/problems/maximum-area-of-longest-diagonal-rectangle, topics: ['Array'], hasSolution: False, hasVideoSolution: False, 3001: questionNo: 3001, acRate: 20.916818457802062, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Moves to Capture The Queen, slug: minimum-moves-to-capture-the-queen, url: https://leetcode.com/problems/minimum-moves-to-capture-the-queen, topics: ['Array', 'Enumeration'], hasSolution: False, hasVideoSolution: False, 3002: questionNo: 3002, acRate: 45.6024043136215, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum Size of a Set After Removals, slug: maximum-size-of-a-set-after-removals, url: https://leetcode.com/problems/maximum-size-of-a-set-after-removals, topics: ['Array', 'Hash Table', 'Greedy'], hasSolution: False, hasVideoSolution: False, 3003: questionNo: 3003, acRate: 28.104121475054228, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Maximize the Number of Partitions After Operations, slug: maximize-the-number-of-partitions-after-operations, url: https://leetcode.com/problems/maximize-the-number-of-partitions-after-operations, topics: ['String', 'Dynamic Programming', 'Bit Manipulation', 'Bitmask'], hasSolution: False, hasVideoSolution: False, 3004: questionNo: 3004, acRate: 65.18678938819707, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Maximum Subtree of the Same Color, slug: maximum-subtree-of-the-same-color, url: https://leetcode.com/problems/maximum-subtree-of-the-same-color, topics: ['Array', 'Dynamic Programming', 'Tree', 'Depth-First Search'], hasSolution: False, hasVideoSolution: False, 3005: questionNo: 3005, acRate: 78.91395602921163, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Count Elements With Maximum Frequency, slug: count-elements-with-maximum-frequency, url: https://leetcode.com/problems/count-elements-with-maximum-frequency, topics: ['Array', 'Hash Table', 'Counting'], hasSolution: True, hasVideoSolution: False, 3006: questionNo: 3006, acRate: 36.359796682250476, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Find Beautiful Indices in the Given Array I, slug: find-beautiful-indices-in-the-given-array-i, url: https://leetcode.com/problems/find-beautiful-indices-in-the-given-array-i, topics: ['Two Pointers', 'String', 'Binary Search', 'Rolling Hash', 'String Matching', 'Hash Function'], hasSolution: False, hasVideoSolution: False, 3007: questionNo: 3007, acRate: 36.34376051126808, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum Number That Sum of the Prices Is Less Than or Equal to K, slug: maximum-number-that-sum-of-the-prices-is-less-than-or-equal-to-k, url: https://leetcode.com/problems/maximum-number-that-sum-of-the-prices-is-less-than-or-equal-to-k, topics: ['Binary Search', 'Dynamic Programming', 'Bit Manipulation'], hasSolution: False, hasVideoSolution: False, 3008: questionNo: 3008, acRate: 24.534869469297707, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Find Beautiful Indices in the Given Array II, slug: find-beautiful-indices-in-the-given-array-ii, url: https://leetcode.com/problems/find-beautiful-indices-in-the-given-array-ii, topics: ['Two Pointers', 'String', 'Binary Search', 'Rolling Hash', 'String Matching', 'Hash Function'], hasSolution: False, hasVideoSolution: False, 3009: questionNo: 3009, acRate: 45.80779762680923, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Maximum Number of Intersections on the Chart, slug: maximum-number-of-intersections-on-the-chart, url: https://leetcode.com/problems/maximum-number-of-intersections-on-the-chart, topics: ['Array', 'Math', 'Binary Indexed Tree', 'Geometry'], hasSolution: False, hasVideoSolution: False, 3010: questionNo: 3010, acRate: 66.23363359682986, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Divide an Array Into Subarrays With Minimum Cost I, slug: divide-an-array-into-subarrays-with-minimum-cost-i, url: https://leetcode.com/problems/divide-an-array-into-subarrays-with-minimum-cost-i, topics: ['Array', 'Sorting', 'Enumeration'], hasSolution: False, hasVideoSolution: False, 3011: questionNo: 3011, acRate: 51.41538391578181, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Find if Array Can Be Sorted, slug: find-if-array-can-be-sorted, url: https://leetcode.com/problems/find-if-array-can-be-sorted, topics: ['Array', 'Bit Manipulation', 'Sorting'], hasSolution: False, hasVideoSolution: False, 3012: questionNo: 3012, acRate: 35.22836569705477, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimize Length of Array Using Operations, slug: minimize-length-of-array-using-operations, url: https://leetcode.com/problems/minimize-length-of-array-using-operations, topics: ['Array', 'Math', 'Greedy', 'Number Theory'], hasSolution: False, hasVideoSolution: False, 3013: questionNo: 3013, acRate: 31.836839404822985, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Divide an Array Into Subarrays With Minimum Cost II, slug: divide-an-array-into-subarrays-with-minimum-cost-ii, url: https://leetcode.com/problems/divide-an-array-into-subarrays-with-minimum-cost-ii, topics: ['Array', 'Hash Table', 'Sliding Window', 'Heap (Priority Queue)'], hasSolution: False, hasVideoSolution: False, 3014: questionNo: 3014, acRate: 64.0745248572231, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Minimum Number of Pushes to Type Word I, slug: minimum-number-of-pushes-to-type-word-i, url: https://leetcode.com/problems/minimum-number-of-pushes-to-type-word-i, topics: ['Math', 'String', 'Greedy'], hasSolution: False, hasVideoSolution: False, 3015: questionNo: 3015, acRate: 56.01012231126107, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Count the Number of Houses at a Certain Distance I, slug: count-the-number-of-houses-at-a-certain-distance-i, url: https://leetcode.com/problems/count-the-number-of-houses-at-a-certain-distance-i, topics: ['Breadth-First Search', 'Graph', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 3016: questionNo: 3016, acRate: 70.87372987451597, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Number of Pushes to Type Word II, slug: minimum-number-of-pushes-to-type-word-ii, url: https://leetcode.com/problems/minimum-number-of-pushes-to-type-word-ii, topics: ['Hash Table', 'String', 'Greedy', 'Sorting', 'Counting'], hasSolution: False, hasVideoSolution: False, 3017: questionNo: 3017, acRate: 21.576576576576574, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Count the Number of Houses at a Certain Distance II, slug: count-the-number-of-houses-at-a-certain-distance-ii, url: https://leetcode.com/problems/count-the-number-of-houses-at-a-certain-distance-ii, topics: ['Graph', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 3018: questionNo: 3018, acRate: 44.983818770226534, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Maximum Number of Removal Queries That Can Be Processed I, slug: maximum-number-of-removal-queries-that-can-be-processed-i, url: https://leetcode.com/problems/maximum-number-of-removal-queries-that-can-be-processed-i, topics: ['Array', 'Dynamic Programming'], hasSolution: False, hasVideoSolution: False, 3019: questionNo: 3019, acRate: 80.83083497589982, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Number of Changing Keys, slug: number-of-changing-keys, url: https://leetcode.com/problems/number-of-changing-keys, topics: ['String'], hasSolution: False, hasVideoSolution: False, 3020: questionNo: 3020, acRate: 24.630054254532695, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Find the Maximum Number of Elements in Subset, slug: find-the-maximum-number-of-elements-in-subset, url: https://leetcode.com/problems/find-the-maximum-number-of-elements-in-subset, topics: ['Array', 'Hash Table', 'Enumeration'], hasSolution: False, hasVideoSolution: False, 3021: questionNo: 3021, acRate: 47.698559290727744, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Alice and Bob Playing Flower Game, slug: alice-and-bob-playing-flower-game, url: https://leetcode.com/problems/alice-and-bob-playing-flower-game, topics: ['Math'], hasSolution: False, hasVideoSolution: False, 3022: questionNo: 3022, acRate: 33.59242987495776, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Minimize OR of Remaining Elements Using Operations, slug: minimize-or-of-remaining-elements-using-operations, url: https://leetcode.com/problems/minimize-or-of-remaining-elements-using-operations, topics: ['Array', 'Greedy', 'Bit Manipulation'], hasSolution: False, hasVideoSolution: False, 3023: questionNo: 3023, acRate: 59.474522292993626, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Find Pattern in Infinite Stream I, slug: find-pattern-in-infinite-stream-i, url: https://leetcode.com/problems/find-pattern-in-infinite-stream-i, topics: ['Array', 'Sliding Window', 'Rolling Hash', 'String Matching', 'Hash Function'], hasSolution: False, hasVideoSolution: False, 3024: questionNo: 3024, acRate: 38.27220453934416, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Type of Triangle, slug: type-of-triangle, url: https://leetcode.com/problems/type-of-triangle, topics: ['Array', 'Math', 'Sorting'], hasSolution: False, hasVideoSolution: False, 3025: questionNo: 3025, acRate: 41.09977666445343, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Find the Number of Ways to Place People I, slug: find-the-number-of-ways-to-place-people-i, url: https://leetcode.com/problems/find-the-number-of-ways-to-place-people-i, topics: ['Array', 'Math', 'Geometry', 'Sorting', 'Enumeration'], hasSolution: False, hasVideoSolution: False, 3026: questionNo: 3026, acRate: 18.26833205879854, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum Good Subarray Sum, slug: maximum-good-subarray-sum, url: https://leetcode.com/problems/maximum-good-subarray-sum, topics: ['Array', 'Hash Table', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 3027: questionNo: 3027, acRate: 47.83274956217163, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Find the Number of Ways to Place People II, slug: find-the-number-of-ways-to-place-people-ii, url: https://leetcode.com/problems/find-the-number-of-ways-to-place-people-ii, topics: ['Array', 'Math', 'Geometry', 'Sorting', 'Enumeration'], hasSolution: False, hasVideoSolution: False, 3028: questionNo: 3028, acRate: 74.91383675536171, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Ant on the Boundary, slug: ant-on-the-boundary, url: https://leetcode.com/problems/ant-on-the-boundary, topics: ['Array', 'Simulation', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 3029: questionNo: 3029, acRate: 40.78906168458407, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Time to Revert Word to Initial State I, slug: minimum-time-to-revert-word-to-initial-state-i, url: https://leetcode.com/problems/minimum-time-to-revert-word-to-initial-state-i, topics: ['String', 'Rolling Hash', 'String Matching', 'Hash Function'], hasSolution: False, hasVideoSolution: False, 3030: questionNo: 3030, acRate: 44.05974828269789, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Find the Grid of Region Average, slug: find-the-grid-of-region-average, url: https://leetcode.com/problems/find-the-grid-of-region-average, topics: ['Array', 'Matrix'], hasSolution: False, hasVideoSolution: False, 3031: questionNo: 3031, acRate: 35.57692307692308, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Minimum Time to Revert Word to Initial State II, slug: minimum-time-to-revert-word-to-initial-state-ii, url: https://leetcode.com/problems/minimum-time-to-revert-word-to-initial-state-ii, topics: ['String', 'Rolling Hash', 'String Matching', 'Hash Function'], hasSolution: False, hasVideoSolution: False, 3032: questionNo: 3032, acRate: 87.40439770554494, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Count Numbers With Unique Digits II, slug: count-numbers-with-unique-digits-ii, url: https://leetcode.com/problems/count-numbers-with-unique-digits-ii, topics: ['Hash Table', 'Math', 'Dynamic Programming'], hasSolution: False, hasVideoSolution: False, 3033: questionNo: 3033, acRate: 68.45079905035257, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Modify the Matrix, slug: modify-the-matrix, url: https://leetcode.com/problems/modify-the-matrix, topics: ['Array', 'Matrix'], hasSolution: False, hasVideoSolution: False, 3034: questionNo: 3034, acRate: 66.61068542038417, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Number of Subarrays That Match a Pattern I, slug: number-of-subarrays-that-match-a-pattern-i, url: https://leetcode.com/problems/number-of-subarrays-that-match-a-pattern-i, topics: ['Array', 'Rolling Hash', 'String Matching', 'Hash Function'], hasSolution: False, hasVideoSolution: False, 3035: questionNo: 3035, acRate: 42.48737185043488, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum Palindromes After Operations, slug: maximum-palindromes-after-operations, url: https://leetcode.com/problems/maximum-palindromes-after-operations, topics: ['Array', 'Hash Table', 'String', 'Greedy', 'Sorting', 'Counting'], hasSolution: False, hasVideoSolution: False, 3036: questionNo: 3036, acRate: 32.41883996868036, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Number of Subarrays That Match a Pattern II, slug: number-of-subarrays-that-match-a-pattern-ii, url: https://leetcode.com/problems/number-of-subarrays-that-match-a-pattern-ii, topics: ['Array', 'Rolling Hash', 'String Matching', 'Hash Function'], hasSolution: False, hasVideoSolution: False, 3037: questionNo: 3037, acRate: 74.79253112033194, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Find Pattern in Infinite Stream II, slug: find-pattern-in-infinite-stream-ii, url: https://leetcode.com/problems/find-pattern-in-infinite-stream-ii, topics: ['Array', 'Sliding Window', 'Rolling Hash', 'String Matching', 'Hash Function'], hasSolution: False, hasVideoSolution: False, 3038: questionNo: 3038, acRate: 51.97215410173246, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Maximum Number of Operations With the Same Score I, slug: maximum-number-of-operations-with-the-same-score-i, url: https://leetcode.com/problems/maximum-number-of-operations-with-the-same-score-i, topics: ['Array', 'Simulation'], hasSolution: False, hasVideoSolution: False, 3039: questionNo: 3039, acRate: 56.72799182331245, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Apply Operations to Make String Empty, slug: apply-operations-to-make-string-empty, url: https://leetcode.com/problems/apply-operations-to-make-string-empty, topics: ['Array', 'Hash Table', 'Sorting', 'Counting'], hasSolution: False, hasVideoSolution: False, 3040: questionNo: 3040, acRate: 33.19020301604205, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum Number of Operations With the Same Score II, slug: maximum-number-of-operations-with-the-same-score-ii, url: https://leetcode.com/problems/maximum-number-of-operations-with-the-same-score-ii, topics: ['Array', 'Dynamic Programming', 'Memoization'], hasSolution: False, hasVideoSolution: False, 3041: questionNo: 3041, acRate: 32.04345755962429, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Maximize Consecutive Elements in an Array After Modification, slug: maximize-consecutive-elements-in-an-array-after-modification, url: https://leetcode.com/problems/maximize-consecutive-elements-in-an-array-after-modification, topics: ['Array', 'Dynamic Programming', 'Sorting'], hasSolution: False, hasVideoSolution: False, 3042: questionNo: 3042, acRate: 65.19033350472509, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Count Prefix and Suffix Pairs I, slug: count-prefix-and-suffix-pairs-i, url: https://leetcode.com/problems/count-prefix-and-suffix-pairs-i, topics: ['Array', 'String', 'Trie', 'Rolling Hash', 'String Matching', 'Hash Function'], hasSolution: False, hasVideoSolution: False, 3043: questionNo: 3043, acRate: 34.55462389111678, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Find the Length of the Longest Common Prefix, slug: find-the-length-of-the-longest-common-prefix, url: https://leetcode.com/problems/find-the-length-of-the-longest-common-prefix, topics: ['Array', 'Hash Table', 'String', 'Trie'], hasSolution: False, hasVideoSolution: False, 3044: questionNo: 3044, acRate: 48.25027861805445, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Most Frequent Prime, slug: most-frequent-prime, url: https://leetcode.com/problems/most-frequent-prime, topics: ['Array', 'Hash Table', 'Math', 'Matrix', 'Counting', 'Enumeration', 'Number Theory'], hasSolution: False, hasVideoSolution: False, 3045: questionNo: 3045, acRate: 24.765204705024164, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Count Prefix and Suffix Pairs II, slug: count-prefix-and-suffix-pairs-ii, url: https://leetcode.com/problems/count-prefix-and-suffix-pairs-ii, topics: ['Array', 'String', 'Trie', 'Rolling Hash', 'String Matching', 'Hash Function'], hasSolution: False, hasVideoSolution: False, 3046: questionNo: 3046, acRate: 58.46020697977742, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Split the Array, slug: split-the-array, url: https://leetcode.com/problems/split-the-array, topics: ['Array', 'Hash Table', 'Counting'], hasSolution: False, hasVideoSolution: False, 3047: questionNo: 3047, acRate: 45.21851503759399, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Find the Largest Area of Square Inside Two Rectangles, slug: find-the-largest-area-of-square-inside-two-rectangles, url: https://leetcode.com/problems/find-the-largest-area-of-square-inside-two-rectangles, topics: ['Array', 'Math', 'Geometry'], hasSolution: False, hasVideoSolution: False, 3048: questionNo: 3048, acRate: 35.78886824174852, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Earliest Second to Mark Indices I, slug: earliest-second-to-mark-indices-i, url: https://leetcode.com/problems/earliest-second-to-mark-indices-i, topics: ['Array', 'Binary Search'], hasSolution: False, hasVideoSolution: False, 3049: questionNo: 3049, acRate: 22.58603736479843, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Earliest Second to Mark Indices II, slug: earliest-second-to-mark-indices-ii, url: https://leetcode.com/problems/earliest-second-to-mark-indices-ii, topics: ['Array', 'Binary Search', 'Greedy', 'Heap (Priority Queue)'], hasSolution: False, hasVideoSolution: False, 3050: questionNo: 3050, acRate: 68.72146118721462, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Pizza Toppings Cost Analysis, slug: pizza-toppings-cost-analysis, url: https://leetcode.com/problems/pizza-toppings-cost-analysis, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 3051: questionNo: 3051, acRate: 74.05365674384417, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Find Candidates for Data Scientist Position, slug: find-candidates-for-data-scientist-position, url: https://leetcode.com/problems/find-candidates-for-data-scientist-position, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 3052: questionNo: 3052, acRate: 72.68993839835728, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Maximize Items, slug: maximize-items, url: https://leetcode.com/problems/maximize-items, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 3053: questionNo: 3053, acRate: 50.65079955373745, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Classifying Triangles by Lengths, slug: classifying-triangles-by-lengths, url: https://leetcode.com/problems/classifying-triangles-by-lengths, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 3054: questionNo: 3054, acRate: 79.45762711864407, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Binary Tree Nodes, slug: binary-tree-nodes, url: https://leetcode.com/problems/binary-tree-nodes, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 3055: questionNo: 3055, acRate: 60.28861571352218, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Top Percentile Fraud, slug: top-percentile-fraud, url: https://leetcode.com/problems/top-percentile-fraud, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 3056: questionNo: 3056, acRate: 58.853633572159666, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Snaps Analysis, slug: snaps-analysis, url: https://leetcode.com/problems/snaps-analysis, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 3057: questionNo: 3057, acRate: 68.77380045696877, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Employees Project Allocation, slug: employees-project-allocation, url: https://leetcode.com/problems/employees-project-allocation, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 3058: questionNo: 3058, acRate: 52.18284540318439, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Friends With No Mutual Friends, slug: friends-with-no-mutual-friends, url: https://leetcode.com/problems/friends-with-no-mutual-friends, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 3059: questionNo: 3059, acRate: 67.42656729504604, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Find All Unique Email Domains, slug: find-all-unique-email-domains, url: https://leetcode.com/problems/find-all-unique-email-domains, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 3060: questionNo: 3060, acRate: 40.05819592628516, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: User Activities within Time Bounds, slug: user-activities-within-time-bounds, url: https://leetcode.com/problems/user-activities-within-time-bounds, topics: ['Database'], hasSolution: True, hasVideoSolution: False, 3061: questionNo: 3061, acRate: 77.70360480640855, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Calculate Trapping Rain Water, slug: calculate-trapping-rain-water, url: https://leetcode.com/problems/calculate-trapping-rain-water, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 3062: questionNo: 3062, acRate: 81.10274237157203, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Winner of the Linked List Game, slug: winner-of-the-linked-list-game, url: https://leetcode.com/problems/winner-of-the-linked-list-game, topics: ['Linked List'], hasSolution: True, hasVideoSolution: False, 3063: questionNo: 3063, acRate: 86.16691015339664, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Linked List Frequency, slug: linked-list-frequency, url: https://leetcode.com/problems/linked-list-frequency, topics: ['Hash Table', 'Linked List', 'Counting'], hasSolution: True, hasVideoSolution: False, 3064: questionNo: 3064, acRate: 91.08061749571183, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Guess the Number Using Bitwise Questions I, slug: guess-the-number-using-bitwise-questions-i, url: https://leetcode.com/problems/guess-the-number-using-bitwise-questions-i, topics: ['Bit Manipulation', 'Interactive'], hasSolution: False, hasVideoSolution: False, 3065: questionNo: 3065, acRate: 86.01751920834704, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Minimum Operations to Exceed Threshold Value I, slug: minimum-operations-to-exceed-threshold-value-i, url: https://leetcode.com/problems/minimum-operations-to-exceed-threshold-value-i, topics: ['Array'], hasSolution: False, hasVideoSolution: False, 3066: questionNo: 3066, acRate: 27.619038134031808, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Operations to Exceed Threshold Value II, slug: minimum-operations-to-exceed-threshold-value-ii, url: https://leetcode.com/problems/minimum-operations-to-exceed-threshold-value-ii, topics: ['Array', 'Heap (Priority Queue)', 'Simulation'], hasSolution: False, hasVideoSolution: False, 3067: questionNo: 3067, acRate: 57.81425023133493, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Count Pairs of Connectable Servers in a Weighted Tree Network, slug: count-pairs-of-connectable-servers-in-a-weighted-tree-network, url: https://leetcode.com/problems/count-pairs-of-connectable-servers-in-a-weighted-tree-network, topics: ['Array', 'Tree', 'Depth-First Search'], hasSolution: False, hasVideoSolution: False, 3068: questionNo: 3068, acRate: 67.01704138622368, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Find the Maximum Sum of Node Values, slug: find-the-maximum-sum-of-node-values, url: https://leetcode.com/problems/find-the-maximum-sum-of-node-values, topics: ['Array', 'Dynamic Programming', 'Greedy', 'Bit Manipulation', 'Tree', 'Sorting'], hasSolution: True, hasVideoSolution: False, 3069: questionNo: 3069, acRate: 72.54647867855415, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Distribute Elements Into Two Arrays I, slug: distribute-elements-into-two-arrays-i, url: https://leetcode.com/problems/distribute-elements-into-two-arrays-i, topics: ['Array', 'Simulation'], hasSolution: False, hasVideoSolution: False, 3070: questionNo: 3070, acRate: 59.40040532041277, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Count Submatrices with Top-Left Element and Sum Less Than k, slug: count-submatrices-with-top-left-element-and-sum-less-than-k, url: https://leetcode.com/problems/count-submatrices-with-top-left-element-and-sum-less-than-k, topics: ['Array', 'Matrix', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 3071: questionNo: 3071, acRate: 62.69389497651914, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Operations to Write the Letter Y on a Grid, slug: minimum-operations-to-write-the-letter-y-on-a-grid, url: https://leetcode.com/problems/minimum-operations-to-write-the-letter-y-on-a-grid, topics: ['Array', 'Hash Table', 'Matrix', 'Counting'], hasSolution: False, hasVideoSolution: False, 3072: questionNo: 3072, acRate: 27.533876831552274, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Distribute Elements Into Two Arrays II, slug: distribute-elements-into-two-arrays-ii, url: https://leetcode.com/problems/distribute-elements-into-two-arrays-ii, topics: ['Array', 'Binary Indexed Tree', 'Segment Tree', 'Simulation'], hasSolution: False, hasVideoSolution: False, 3073: questionNo: 3073, acRate: 42.5237053245806, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Maximum Increasing Triplet Value, slug: maximum-increasing-triplet-value, url: https://leetcode.com/problems/maximum-increasing-triplet-value, topics: ['Array', 'Ordered Set'], hasSolution: False, hasVideoSolution: False, 3074: questionNo: 3074, acRate: 66.86274509803921, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Apple Redistribution into Boxes, slug: apple-redistribution-into-boxes, url: https://leetcode.com/problems/apple-redistribution-into-boxes, topics: ['Array', 'Greedy', 'Sorting'], hasSolution: False, hasVideoSolution: False, 3075: questionNo: 3075, acRate: 55.03978272511667, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximize Happiness of Selected Children, slug: maximize-happiness-of-selected-children, url: https://leetcode.com/problems/maximize-happiness-of-selected-children, topics: ['Array', 'Greedy', 'Sorting'], hasSolution: True, hasVideoSolution: False, 3076: questionNo: 3076, acRate: 45.566657274756714, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Shortest Uncommon Substring in an Array, slug: shortest-uncommon-substring-in-an-array, url: https://leetcode.com/problems/shortest-uncommon-substring-in-an-array, topics: ['Array', 'Hash Table', 'String', 'Trie'], hasSolution: False, hasVideoSolution: False, 3077: questionNo: 3077, acRate: 27.85219609987243, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Maximum Strength of K Disjoint Subarrays, slug: maximum-strength-of-k-disjoint-subarrays, url: https://leetcode.com/problems/maximum-strength-of-k-disjoint-subarrays, topics: ['Array', 'Dynamic Programming', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 3078: questionNo: 3078, acRate: 66.9710806697108, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Match Alphanumerical Pattern in Matrix I, slug: match-alphanumerical-pattern-in-matrix-i, url: https://leetcode.com/problems/match-alphanumerical-pattern-in-matrix-i, topics: ['Array', 'Hash Table', 'String', 'Matrix'], hasSolution: False, hasVideoSolution: False, 3079: questionNo: 3079, acRate: 74.26675491152292, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Find the Sum of Encrypted Integers, slug: find-the-sum-of-encrypted-integers, url: https://leetcode.com/problems/find-the-sum-of-encrypted-integers, topics: ['Array', 'Math'], hasSolution: False, hasVideoSolution: False, 3080: questionNo: 3080, acRate: 49.14673883028663, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Mark Elements on Array by Performing Queries, slug: mark-elements-on-array-by-performing-queries, url: https://leetcode.com/problems/mark-elements-on-array-by-performing-queries, topics: ['Array', 'Hash Table', 'Sorting', 'Heap (Priority Queue)', 'Simulation'], hasSolution: False, hasVideoSolution: False, 3081: questionNo: 3081, acRate: 27.12349366136881, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Replace Question Marks in String to Minimize Its Value, slug: replace-question-marks-in-string-to-minimize-its-value, url: https://leetcode.com/problems/replace-question-marks-in-string-to-minimize-its-value, topics: ['Hash Table', 'String', 'Greedy', 'Sorting', 'Heap (Priority Queue)', 'Counting'], hasSolution: False, hasVideoSolution: False, 3082: questionNo: 3082, acRate: 38.72592924317062, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Find the Sum of the Power of All Subsequences, slug: find-the-sum-of-the-power-of-all-subsequences, url: https://leetcode.com/problems/find-the-sum-of-the-power-of-all-subsequences, topics: ['Array', 'Dynamic Programming'], hasSolution: False, hasVideoSolution: False, 3083: questionNo: 3083, acRate: 66.04444855149471, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Existence of a Substring in a String and Its Reverse, slug: existence-of-a-substring-in-a-string-and-its-reverse, url: https://leetcode.com/problems/existence-of-a-substring-in-a-string-and-its-reverse, topics: ['Hash Table', 'String'], hasSolution: False, hasVideoSolution: False, 3084: questionNo: 3084, acRate: 48.71983941665643, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Count Substrings Starting and Ending with Given Character, slug: count-substrings-starting-and-ending-with-given-character, url: https://leetcode.com/problems/count-substrings-starting-and-ending-with-given-character, topics: ['Math', 'String', 'Counting'], hasSolution: False, hasVideoSolution: False, 3085: questionNo: 3085, acRate: 43.785233053760486, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Deletions to Make String K-Special, slug: minimum-deletions-to-make-string-k-special, url: https://leetcode.com/problems/minimum-deletions-to-make-string-k-special, topics: ['Hash Table', 'String', 'Greedy', 'Sorting', 'Counting'], hasSolution: False, hasVideoSolution: False, 3086: questionNo: 3086, acRate: 22.599190283400812, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Minimum Moves to Pick K Ones, slug: minimum-moves-to-pick-k-ones, url: https://leetcode.com/problems/minimum-moves-to-pick-k-ones, topics: ['Array', 'Greedy', 'Sliding Window', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 3087: questionNo: 3087, acRate: 64.59985580389329, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Find Trending Hashtags, slug: find-trending-hashtags, url: https://leetcode.com/problems/find-trending-hashtags, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 3088: questionNo: 3088, acRate: 53.98230088495575, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Make String Anti-palindrome, slug: make-string-anti-palindrome, url: https://leetcode.com/problems/make-string-anti-palindrome, topics: ['String', 'Greedy', 'Sorting'], hasSolution: False, hasVideoSolution: False, 3089: questionNo: 3089, acRate: 39.98917748917749, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Find Bursty Behavior, slug: find-bursty-behavior, url: https://leetcode.com/problems/find-bursty-behavior, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 3090: questionNo: 3090, acRate: 63.51780638689183, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Maximum Length Substring With Two Occurrences, slug: maximum-length-substring-with-two-occurrences, url: https://leetcode.com/problems/maximum-length-substring-with-two-occurrences, topics: ['Hash Table', 'String', 'Sliding Window'], hasSolution: False, hasVideoSolution: False, 3091: questionNo: 3091, acRate: 44.5119942006063, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Apply Operations to Make Sum of Array Greater Than or Equal to k, slug: apply-operations-to-make-sum-of-array-greater-than-or-equal-to-k, url: https://leetcode.com/problems/apply-operations-to-make-sum-of-array-greater-than-or-equal-to-k, topics: ['Math', 'Greedy', 'Enumeration'], hasSolution: False, hasVideoSolution: False, 3092: questionNo: 3092, acRate: 42.476653219515455, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Most Frequent IDs, slug: most-frequent-ids, url: https://leetcode.com/problems/most-frequent-ids, topics: ['Array', 'Hash Table', 'Heap (Priority Queue)', 'Ordered Set'], hasSolution: False, hasVideoSolution: False, 3093: questionNo: 3093, acRate: 40.72457838992681, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Longest Common Suffix Queries, slug: longest-common-suffix-queries, url: https://leetcode.com/problems/longest-common-suffix-queries, topics: ['Array', 'String', 'Trie'], hasSolution: False, hasVideoSolution: False, 3094: questionNo: 3094, acRate: 80.29315960912052, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Guess the Number Using Bitwise Questions II, slug: guess-the-number-using-bitwise-questions-ii, url: https://leetcode.com/problems/guess-the-number-using-bitwise-questions-ii, topics: ['Bit Manipulation', 'Interactive'], hasSolution: False, hasVideoSolution: False, 3095: questionNo: 3095, acRate: 40.82570895352543, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Shortest Subarray With OR at Least K I, slug: shortest-subarray-with-or-at-least-k-i, url: https://leetcode.com/problems/shortest-subarray-with-or-at-least-k-i, topics: ['Array', 'Bit Manipulation', 'Sliding Window'], hasSolution: False, hasVideoSolution: False, 3096: questionNo: 3096, acRate: 40.45533818622991, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Levels to Gain More Points, slug: minimum-levels-to-gain-more-points, url: https://leetcode.com/problems/minimum-levels-to-gain-more-points, topics: ['Array', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 3097: questionNo: 3097, acRate: 29.981988638987666, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Shortest Subarray With OR at Least K II, slug: shortest-subarray-with-or-at-least-k-ii, url: https://leetcode.com/problems/shortest-subarray-with-or-at-least-k-ii, topics: ['Array', 'Bit Manipulation', 'Sliding Window'], hasSolution: False, hasVideoSolution: False, 3098: questionNo: 3098, acRate: 24.339973439575033, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Find the Sum of Subsequence Powers, slug: find-the-sum-of-subsequence-powers, url: https://leetcode.com/problems/find-the-sum-of-subsequence-powers, topics: ['Array', 'Dynamic Programming', 'Sorting'], hasSolution: False, hasVideoSolution: False, 3099: questionNo: 3099, acRate: 83.02827138153015, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Harshad Number, slug: harshad-number, url: https://leetcode.com/problems/harshad-number, topics: ['Math'], hasSolution: False, hasVideoSolution: False, 3100: questionNo: 3100, acRate: 63.61326957561268, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Water Bottles II, slug: water-bottles-ii, url: https://leetcode.com/problems/water-bottles-ii, topics: ['Math', 'Simulation'], hasSolution: False, hasVideoSolution: False, 3101: questionNo: 3101, acRate: 57.00416325416325, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Count Alternating Subarrays, slug: count-alternating-subarrays, url: https://leetcode.com/problems/count-alternating-subarrays, topics: ['Array', 'Math'], hasSolution: False, hasVideoSolution: False, 3102: questionNo: 3102, acRate: 32.199707706284315, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Minimize Manhattan Distances, slug: minimize-manhattan-distances, url: https://leetcode.com/problems/minimize-manhattan-distances, topics: ['Array', 'Math', 'Geometry', 'Sorting', 'Ordered Set'], hasSolution: False, hasVideoSolution: False, 3103: questionNo: 3103, acRate: 66.03518267929634, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Find Trending Hashtags II , slug: find-trending-hashtags-ii, url: https://leetcode.com/problems/find-trending-hashtags-ii, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 3104: questionNo: 3104, acRate: 57.947434292866085, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Find Longest Self-Contained Substring, slug: find-longest-self-contained-substring, url: https://leetcode.com/problems/find-longest-self-contained-substring, topics: ['Hash Table', 'String', 'Binary Search', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 3105: questionNo: 3105, acRate: 56.866209933228085, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Longest Strictly Increasing or Strictly Decreasing Subarray, slug: longest-strictly-increasing-or-strictly-decreasing-subarray, url: https://leetcode.com/problems/longest-strictly-increasing-or-strictly-decreasing-subarray, topics: ['Array'], hasSolution: False, hasVideoSolution: False, 3106: questionNo: 3106, acRate: 63.334363411619286, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Lexicographically Smallest String After Operations With Constraint, slug: lexicographically-smallest-string-after-operations-with-constraint, url: https://leetcode.com/problems/lexicographically-smallest-string-after-operations-with-constraint, topics: ['String', 'Greedy'], hasSolution: False, hasVideoSolution: False, 3107: questionNo: 3107, acRate: 48.36458079701323, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Operations to Make Median of Array Equal to K, slug: minimum-operations-to-make-median-of-array-equal-to-k, url: https://leetcode.com/problems/minimum-operations-to-make-median-of-array-equal-to-k, topics: ['Array', 'Greedy', 'Sorting'], hasSolution: False, hasVideoSolution: False, 3108: questionNo: 3108, acRate: 45.53007115315817, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Minimum Cost Walk in Weighted Graph, slug: minimum-cost-walk-in-weighted-graph, url: https://leetcode.com/problems/minimum-cost-walk-in-weighted-graph, topics: ['Array', 'Bit Manipulation', 'Union Find', 'Graph'], hasSolution: False, hasVideoSolution: False, 3109: questionNo: 3109, acRate: 41.23831775700935, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Find the Index of Permutation, slug: find-the-index-of-permutation, url: https://leetcode.com/problems/find-the-index-of-permutation, topics: ['Array', 'Binary Search', 'Divide and Conquer', 'Binary Indexed Tree', 'Segment Tree', 'Merge Sort', 'Ordered Set'], hasSolution: False, hasVideoSolution: False, 3110: questionNo: 3110, acRate: 93.4378587419575, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Score of a String, slug: score-of-a-string, url: https://leetcode.com/problems/score-of-a-string, topics: ['String'], hasSolution: True, hasVideoSolution: False, 3111: questionNo: 3111, acRate: 63.478304065969546, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Rectangles to Cover Points, slug: minimum-rectangles-to-cover-points, url: https://leetcode.com/problems/minimum-rectangles-to-cover-points, topics: ['Array', 'Greedy', 'Sorting'], hasSolution: False, hasVideoSolution: False, 3112: questionNo: 3112, acRate: 34.45069120874889, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Time to Visit Disappearing Nodes, slug: minimum-time-to-visit-disappearing-nodes, url: https://leetcode.com/problems/minimum-time-to-visit-disappearing-nodes, topics: ['Array', 'Graph', 'Heap (Priority Queue)', 'Shortest Path'], hasSolution: False, hasVideoSolution: False, 3113: questionNo: 3113, acRate: 29.531906883353205, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Find the Number of Subarrays Where Boundary Elements Are Maximum, slug: find-the-number-of-subarrays-where-boundary-elements-are-maximum, url: https://leetcode.com/problems/find-the-number-of-subarrays-where-boundary-elements-are-maximum, topics: ['Array', 'Binary Search', 'Stack', 'Monotonic Stack'], hasSolution: False, hasVideoSolution: False, 3114: questionNo: 3114, acRate: 35.48117154811716, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Latest Time You Can Obtain After Replacing Characters, slug: latest-time-you-can-obtain-after-replacing-characters, url: https://leetcode.com/problems/latest-time-you-can-obtain-after-replacing-characters, topics: ['String', 'Enumeration'], hasSolution: False, hasVideoSolution: False, 3115: questionNo: 3115, acRate: 58.258015338425395, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum Prime Difference, slug: maximum-prime-difference, url: https://leetcode.com/problems/maximum-prime-difference, topics: ['Array', 'Math', 'Number Theory'], hasSolution: False, hasVideoSolution: False, 3116: questionNo: 3116, acRate: 16.333520144467276, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Kth Smallest Amount With Single Denomination Combination, slug: kth-smallest-amount-with-single-denomination-combination, url: https://leetcode.com/problems/kth-smallest-amount-with-single-denomination-combination, topics: ['Array', 'Math', 'Binary Search', 'Bit Manipulation', 'Combinatorics', 'Number Theory'], hasSolution: False, hasVideoSolution: False, 3117: questionNo: 3117, acRate: 27.48249619482496, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Minimum Sum of Values by Dividing Array, slug: minimum-sum-of-values-by-dividing-array, url: https://leetcode.com/problems/minimum-sum-of-values-by-dividing-array, topics: ['Array', 'Binary Search', 'Dynamic Programming', 'Bit Manipulation', 'Segment Tree', 'Queue'], hasSolution: False, hasVideoSolution: False, 3118: questionNo: 3118, acRate: 62.476547842401494, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Friday Purchase III , slug: friday-purchase-iii, url: https://leetcode.com/problems/friday-purchase-iii, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 3119: questionNo: 3119, acRate: 62.13511259382819, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Maximum Number of Potholes That Can Be Fixed, slug: maximum-number-of-potholes-that-can-be-fixed, url: https://leetcode.com/problems/maximum-number-of-potholes-that-can-be-fixed, topics: ['String', 'Greedy', 'Sorting'], hasSolution: False, hasVideoSolution: False, 3120: questionNo: 3120, acRate: 65.284178187404, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Count the Number of Special Characters I, slug: count-the-number-of-special-characters-i, url: https://leetcode.com/problems/count-the-number-of-special-characters-i, topics: ['Hash Table', 'String'], hasSolution: False, hasVideoSolution: False, 3121: questionNo: 3121, acRate: 41.29517368413818, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Count the Number of Special Characters II, slug: count-the-number-of-special-characters-ii, url: https://leetcode.com/problems/count-the-number-of-special-characters-ii, topics: ['Hash Table', 'String'], hasSolution: False, hasVideoSolution: False, 3122: questionNo: 3122, acRate: 41.074599062781964, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Number of Operations to Satisfy Conditions, slug: minimum-number-of-operations-to-satisfy-conditions, url: https://leetcode.com/problems/minimum-number-of-operations-to-satisfy-conditions, topics: ['Array', 'Dynamic Programming', 'Matrix'], hasSolution: False, hasVideoSolution: False, 3123: questionNo: 3123, acRate: 48.95998589811387, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Find Edges in Shortest Paths, slug: find-edges-in-shortest-paths, url: https://leetcode.com/problems/find-edges-in-shortest-paths, topics: ['Depth-First Search', 'Breadth-First Search', 'Graph', 'Heap (Priority Queue)', 'Shortest Path'], hasSolution: False, hasVideoSolution: False, 3124: questionNo: 3124, acRate: 71.29228100607112, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Find Longest Calls, slug: find-longest-calls, url: https://leetcode.com/problems/find-longest-calls, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 3125: questionNo: 3125, acRate: 68.96551724137932, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Maximum Number That Makes Result of Bitwise AND Zero, slug: maximum-number-that-makes-result-of-bitwise-and-zero, url: https://leetcode.com/problems/maximum-number-that-makes-result-of-bitwise-and-zero, topics: ['String', 'Greedy', 'Sorting'], hasSolution: False, hasVideoSolution: False, 3126: questionNo: 3126, acRate: 55.533596837944664, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Server Utilization Time, slug: server-utilization-time, url: https://leetcode.com/problems/server-utilization-time, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 3127: questionNo: 3127, acRate: 50.89115016959605, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Make a Square with the Same Color, slug: make-a-square-with-the-same-color, url: https://leetcode.com/problems/make-a-square-with-the-same-color, topics: ['Array', 'Matrix', 'Enumeration'], hasSolution: False, hasVideoSolution: False, 3128: questionNo: 3128, acRate: 47.166801767643754, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Right Triangles, slug: right-triangles, url: https://leetcode.com/problems/right-triangles, topics: ['Array', 'Hash Table', 'Math', 'Combinatorics', 'Counting'], hasSolution: False, hasVideoSolution: False, 3129: questionNo: 3129, acRate: 26.78766276278461, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Find All Possible Stable Binary Arrays I, slug: find-all-possible-stable-binary-arrays-i, url: https://leetcode.com/problems/find-all-possible-stable-binary-arrays-i, topics: ['Dynamic Programming', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 3130: questionNo: 3130, acRate: 27.649589362534222, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Find All Possible Stable Binary Arrays II, slug: find-all-possible-stable-binary-arrays-ii, url: https://leetcode.com/problems/find-all-possible-stable-binary-arrays-ii, topics: ['Dynamic Programming', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 3131: questionNo: 3131, acRate: 81.90505251662223, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Find the Integer Added to Array I, slug: find-the-integer-added-to-array-i, url: https://leetcode.com/problems/find-the-integer-added-to-array-i, topics: ['Array'], hasSolution: False, hasVideoSolution: False, 3132: questionNo: 3132, acRate: 30.99000418986054, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Find the Integer Added to Array II, slug: find-the-integer-added-to-array-ii, url: https://leetcode.com/problems/find-the-integer-added-to-array-ii, topics: ['Array', 'Two Pointers', 'Sorting', 'Enumeration'], hasSolution: False, hasVideoSolution: False, 3133: questionNo: 3133, acRate: 37.743179706635885, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Array End, slug: minimum-array-end, url: https://leetcode.com/problems/minimum-array-end, topics: ['Bit Manipulation'], hasSolution: False, hasVideoSolution: False, 3134: questionNo: 3134, acRate: 28.057037340993023, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Find the Median of the Uniqueness Array, slug: find-the-median-of-the-uniqueness-array, url: https://leetcode.com/problems/find-the-median-of-the-uniqueness-array, topics: ['Array', 'Hash Table', 'Binary Search', 'Sliding Window'], hasSolution: False, hasVideoSolution: False, 3135: questionNo: 3135, acRate: 55.83075335397317, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Equalize Strings by Adding or Removing Characters at Ends, slug: equalize-strings-by-adding-or-removing-characters-at-ends, url: https://leetcode.com/problems/equalize-strings-by-adding-or-removing-characters-at-ends, topics: ['String', 'Binary Search', 'Dynamic Programming', 'Sliding Window', 'Hash Function'], hasSolution: False, hasVideoSolution: False, 3136: questionNo: 3136, acRate: 37.34102934102934, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Valid Word, slug: valid-word, url: https://leetcode.com/problems/valid-word, topics: ['String'], hasSolution: False, hasVideoSolution: False, 3137: questionNo: 3137, acRate: 62.420042643923246, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Number of Operations to Make Word K-Periodic, slug: minimum-number-of-operations-to-make-word-k-periodic, url: https://leetcode.com/problems/minimum-number-of-operations-to-make-word-k-periodic, topics: ['Hash Table', 'String', 'Counting'], hasSolution: False, hasVideoSolution: False, 3138: questionNo: 3138, acRate: 42.02347215377033, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Length of Anagram Concatenation, slug: minimum-length-of-anagram-concatenation, url: https://leetcode.com/problems/minimum-length-of-anagram-concatenation, topics: ['Hash Table', 'String', 'Counting'], hasSolution: False, hasVideoSolution: False, 3139: questionNo: 3139, acRate: 16.337719298245617, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Minimum Cost to Equalize Array, slug: minimum-cost-to-equalize-array, url: https://leetcode.com/problems/minimum-cost-to-equalize-array, topics: ['Array', 'Greedy', 'Enumeration'], hasSolution: False, hasVideoSolution: False, 3140: questionNo: 3140, acRate: 63.81638163816382, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Consecutive Available Seats II, slug: consecutive-available-seats-ii, url: https://leetcode.com/problems/consecutive-available-seats-ii, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 3141: questionNo: 3141, acRate: 72.56317689530685, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Maximum Hamming Distances, slug: maximum-hamming-distances, url: https://leetcode.com/problems/maximum-hamming-distances, topics: ['Array', 'Bit Manipulation', 'Breadth-First Search'], hasSolution: False, hasVideoSolution: False, 3142: questionNo: 3142, acRate: 42.87653025533403, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Check if Grid Satisfies Conditions, slug: check-if-grid-satisfies-conditions, url: https://leetcode.com/problems/check-if-grid-satisfies-conditions, topics: ['Array', 'Matrix'], hasSolution: False, hasVideoSolution: False, 3143: questionNo: 3143, acRate: 38.570593051818925, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum Points Inside the Square, slug: maximum-points-inside-the-square, url: https://leetcode.com/problems/maximum-points-inside-the-square, topics: ['Array', 'Hash Table', 'String', 'Binary Search', 'Sorting'], hasSolution: False, hasVideoSolution: False, 3144: questionNo: 3144, acRate: 40.51873017866675, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Substring Partition of Equal Character Frequency, slug: minimum-substring-partition-of-equal-character-frequency, url: https://leetcode.com/problems/minimum-substring-partition-of-equal-character-frequency, topics: ['Hash Table', 'String', 'Dynamic Programming', 'Counting'], hasSolution: False, hasVideoSolution: False, 3145: questionNo: 3145, acRate: 24.118346321489895, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Find Products of Elements of Big Array, slug: find-products-of-elements-of-big-array, url: https://leetcode.com/problems/find-products-of-elements-of-big-array, topics: ['Array', 'Binary Search', 'Bit Manipulation'], hasSolution: False, hasVideoSolution: False, 3146: questionNo: 3146, acRate: 88.88888888888889, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Permutation Difference between Two Strings, slug: permutation-difference-between-two-strings, url: https://leetcode.com/problems/permutation-difference-between-two-strings, topics: ['Hash Table', 'String'], hasSolution: False, hasVideoSolution: False, 3147: questionNo: 3147, acRate: 40.35617564904221, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Taking Maximum Energy From the Mystic Dungeon, slug: taking-maximum-energy-from-the-mystic-dungeon, url: https://leetcode.com/problems/taking-maximum-energy-from-the-mystic-dungeon, topics: ['Array', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 3148: questionNo: 3148, acRate: 47.68806461599077, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum Difference Score in a Grid, slug: maximum-difference-score-in-a-grid, url: https://leetcode.com/problems/maximum-difference-score-in-a-grid, topics: ['Array', 'Dynamic Programming', 'Matrix'], hasSolution: False, hasVideoSolution: False, 3149: questionNo: 3149, acRate: 22.64065335753176, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Find the Minimum Cost Array Permutation, slug: find-the-minimum-cost-array-permutation, url: https://leetcode.com/problems/find-the-minimum-cost-array-permutation, topics: ['Array', 'Dynamic Programming', 'Bit Manipulation', 'Bitmask'], hasSolution: False, hasVideoSolution: False, 3150: questionNo: 3150, acRate: 89.29481733220051, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Invalid Tweets II, slug: invalid-tweets-ii, url: https://leetcode.com/problems/invalid-tweets-ii, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 3151: questionNo: 3151, acRate: 75.5819497419789, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Special Array I, slug: special-array-i, url: https://leetcode.com/problems/special-array-i, topics: ['Array'], hasSolution: False, hasVideoSolution: False, 3152: questionNo: 3152, acRate: 29.777966957365297, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Special Array II, slug: special-array-ii, url: https://leetcode.com/problems/special-array-ii, topics: ['Array', 'Binary Search', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 3153: questionNo: 3153, acRate: 43.808632223587466, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Sum of Digit Differences of All Pairs, slug: sum-of-digit-differences-of-all-pairs, url: https://leetcode.com/problems/sum-of-digit-differences-of-all-pairs, topics: ['Array', 'Hash Table', 'Math', 'Counting'], hasSolution: False, hasVideoSolution: False, 3154: questionNo: 3154, acRate: 36.109018694788745, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Find Number of Ways to Reach the K-th Stair, slug: find-number-of-ways-to-reach-the-k-th-stair, url: https://leetcode.com/problems/find-number-of-ways-to-reach-the-k-th-stair, topics: ['Math', 'Dynamic Programming', 'Bit Manipulation', 'Memoization', 'Combinatorics'], hasSolution: False, hasVideoSolution: False, 3155: questionNo: 3155, acRate: 52.593266606005464, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Maximum Number of Upgradable Servers, slug: maximum-number-of-upgradable-servers, url: https://leetcode.com/problems/maximum-number-of-upgradable-servers, topics: ['Array', 'Math', 'Binary Search'], hasSolution: False, hasVideoSolution: False, 3156: questionNo: 3156, acRate: 57.27002967359051, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Employee Task Duration and Concurrent Tasks, slug: employee-task-duration-and-concurrent-tasks, url: https://leetcode.com/problems/employee-task-duration-and-concurrent-tasks, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 3157: questionNo: 3157, acRate: 69.99226604795051, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Find the Level of Tree with Minimum Sum, slug: find-the-level-of-tree-with-minimum-sum, url: https://leetcode.com/problems/find-the-level-of-tree-with-minimum-sum, topics: ['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree'], hasSolution: False, hasVideoSolution: False, 3158: questionNo: 3158, acRate: 82.08531726751531, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Find the XOR of Numbers Which Appear Twice, slug: find-the-xor-of-numbers-which-appear-twice, url: https://leetcode.com/problems/find-the-xor-of-numbers-which-appear-twice, topics: ['Array', 'Hash Table', 'Bit Manipulation'], hasSolution: False, hasVideoSolution: False, 3159: questionNo: 3159, acRate: 73.68444306985376, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Find Occurrences of an Element in an Array, slug: find-occurrences-of-an-element-in-an-array, url: https://leetcode.com/problems/find-occurrences-of-an-element-in-an-array, topics: ['Array', 'Hash Table'], hasSolution: False, hasVideoSolution: False, 3160: questionNo: 3160, acRate: 40.98892334957909, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Find the Number of Distinct Colors Among the Balls, slug: find-the-number-of-distinct-colors-among-the-balls, url: https://leetcode.com/problems/find-the-number-of-distinct-colors-among-the-balls, topics: ['Array', 'Hash Table', 'Simulation'], hasSolution: False, hasVideoSolution: False, 3161: questionNo: 3161, acRate: 13.385826771653544, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Block Placement Queries, slug: block-placement-queries, url: https://leetcode.com/problems/block-placement-queries, topics: ['Array', 'Binary Search', 'Binary Indexed Tree', 'Segment Tree'], hasSolution: False, hasVideoSolution: False, 3162: questionNo: 3162, acRate: 86.46763137852247, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Find the Number of Good Pairs I, slug: find-the-number-of-good-pairs-i, url: https://leetcode.com/problems/find-the-number-of-good-pairs-i, topics: ['Array', 'Hash Table'], hasSolution: False, hasVideoSolution: False, 3163: questionNo: 3163, acRate: 55.63463301750863, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: String Compression III, slug: string-compression-iii, url: https://leetcode.com/problems/string-compression-iii, topics: ['String'], hasSolution: False, hasVideoSolution: False, 3164: questionNo: 3164, acRate: 25.517921736270964, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Find the Number of Good Pairs II, slug: find-the-number-of-good-pairs-ii, url: https://leetcode.com/problems/find-the-number-of-good-pairs-ii, topics: ['Array', 'Hash Table'], hasSolution: False, hasVideoSolution: False, 3165: questionNo: 3165, acRate: 17.13266097750194, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Maximum Sum of Subsequence With Non-adjacent Elements, slug: maximum-sum-of-subsequence-with-non-adjacent-elements, url: https://leetcode.com/problems/maximum-sum-of-subsequence-with-non-adjacent-elements, topics: ['Array', 'Divide and Conquer', 'Dynamic Programming', 'Segment Tree'], hasSolution: False, hasVideoSolution: False, 3166: questionNo: 3166, acRate: 62.883720930232556, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Calculate Parking Fees and Duration, slug: calculate-parking-fees-and-duration, url: https://leetcode.com/problems/calculate-parking-fees-and-duration, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 3167: questionNo: 3167, acRate: 79.95391705069125, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Better Compression of String, slug: better-compression-of-string, url: https://leetcode.com/problems/better-compression-of-string, topics: ['Hash Table', 'String', 'Sorting', 'Counting'], hasSolution: False, hasVideoSolution: False, 3168: questionNo: 3168, acRate: 80.24877558301709, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Minimum Number of Chairs in a Waiting Room, slug: minimum-number-of-chairs-in-a-waiting-room, url: https://leetcode.com/problems/minimum-number-of-chairs-in-a-waiting-room, topics: ['String', 'Simulation'], hasSolution: False, hasVideoSolution: False, 3169: questionNo: 3169, acRate: 33.513010467344834, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Count Days Without Meetings, slug: count-days-without-meetings, url: https://leetcode.com/problems/count-days-without-meetings, topics: ['Array', 'Sorting'], hasSolution: False, hasVideoSolution: False, 3170: questionNo: 3170, acRate: 35.71551329055912, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Lexicographically Minimum String After Removing Stars, slug: lexicographically-minimum-string-after-removing-stars, url: https://leetcode.com/problems/lexicographically-minimum-string-after-removing-stars, topics: ['Hash Table', 'String', 'Stack', 'Greedy', 'Heap (Priority Queue)'], hasSolution: False, hasVideoSolution: False, 3171: questionNo: 3171, acRate: 30.93606690045859, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Find Subarray With Bitwise OR Closest to K, slug: find-subarray-with-bitwise-or-closest-to-k, url: https://leetcode.com/problems/find-subarray-with-bitwise-or-closest-to-k, topics: ['Array', 'Binary Search', 'Bit Manipulation', 'Segment Tree'], hasSolution: False, hasVideoSolution: False, 3172: questionNo: 3172, acRate: 74.28833792470157, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Second Day Verification, slug: second-day-verification, url: https://leetcode.com/problems/second-day-verification, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 3173: questionNo: 3173, acRate: 95.08506616257088, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Bitwise OR of Adjacent Elements, slug: bitwise-or-of-adjacent-elements, url: https://leetcode.com/problems/bitwise-or-of-adjacent-elements, topics: ['Array', 'Bit Manipulation'], hasSolution: False, hasVideoSolution: False, 3174: questionNo: 3174, acRate: 72.29552306545207, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Clear Digits, slug: clear-digits, url: https://leetcode.com/problems/clear-digits, topics: ['Hash Table', 'String', 'Simulation'], hasSolution: False, hasVideoSolution: False, 3175: questionNo: 3175, acRate: 39.33777099557988, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Find The First Player to win K Games in a Row, slug: find-the-first-player-to-win-k-games-in-a-row, url: https://leetcode.com/problems/find-the-first-player-to-win-k-games-in-a-row, topics: ['Array', 'Simulation'], hasSolution: False, hasVideoSolution: False, 3176: questionNo: 3176, acRate: 30.02192430722783, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Find the Maximum Length of a Good Subsequence I, slug: find-the-maximum-length-of-a-good-subsequence-i, url: https://leetcode.com/problems/find-the-maximum-length-of-a-good-subsequence-i, topics: ['Array', 'Hash Table', 'Dynamic Programming'], hasSolution: False, hasVideoSolution: False, 3177: questionNo: 3177, acRate: 23.611542041576172, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Find the Maximum Length of a Good Subsequence II, slug: find-the-maximum-length-of-a-good-subsequence-ii, url: https://leetcode.com/problems/find-the-maximum-length-of-a-good-subsequence-ii, topics: ['Array', 'Hash Table', 'Dynamic Programming'], hasSolution: False, hasVideoSolution: False, 3178: questionNo: 3178, acRate: 61.83410949568378, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Find the Child Who Has the Ball After K Seconds, slug: find-the-child-who-has-the-ball-after-k-seconds, url: https://leetcode.com/problems/find-the-child-who-has-the-ball-after-k-seconds, topics: ['Math', 'Simulation'], hasSolution: False, hasVideoSolution: False, 3179: questionNo: 3179, acRate: 54.662808139270616, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Find the N-th Value After K Seconds, slug: find-the-n-th-value-after-k-seconds, url: https://leetcode.com/problems/find-the-n-th-value-after-k-seconds, topics: ['Array', 'Math', 'Simulation', 'Combinatorics', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 3180: questionNo: 3180, acRate: 29.09547497176363, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum Total Reward Using Operations I, slug: maximum-total-reward-using-operations-i, url: https://leetcode.com/problems/maximum-total-reward-using-operations-i, topics: ['Array', 'Dynamic Programming'], hasSolution: False, hasVideoSolution: False, 3181: questionNo: 3181, acRate: 20.41931637519873, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Maximum Total Reward Using Operations II, slug: maximum-total-reward-using-operations-ii, url: https://leetcode.com/problems/maximum-total-reward-using-operations-ii, topics: ['Array', 'Dynamic Programming', 'Bit Manipulation'], hasSolution: False, hasVideoSolution: False, 3182: questionNo: 3182, acRate: 57.00525394045533, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Find Top Scoring Students, slug: find-top-scoring-students, url: https://leetcode.com/problems/find-top-scoring-students, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 3183: questionNo: 3183, acRate: 60.07428040854224, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: The Number of Ways to Make the Sum, slug: the-number-of-ways-to-make-the-sum, url: https://leetcode.com/problems/the-number-of-ways-to-make-the-sum, topics: ['Array', 'Dynamic Programming'], hasSolution: False, hasVideoSolution: False, 3184: questionNo: 3184, acRate: 79.1129242519516, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Count Pairs That Form a Complete Day I, slug: count-pairs-that-form-a-complete-day-i, url: https://leetcode.com/problems/count-pairs-that-form-a-complete-day-i, topics: ['Array', 'Hash Table', 'Counting'], hasSolution: False, hasVideoSolution: False, 3185: questionNo: 3185, acRate: 42.749661826027655, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Count Pairs That Form a Complete Day II, slug: count-pairs-that-form-a-complete-day-ii, url: https://leetcode.com/problems/count-pairs-that-form-a-complete-day-ii, topics: ['Array', 'Hash Table', 'Counting'], hasSolution: False, hasVideoSolution: False, 3186: questionNo: 3186, acRate: 25.698845022597382, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum Total Damage With Spell Casting, slug: maximum-total-damage-with-spell-casting, url: https://leetcode.com/problems/maximum-total-damage-with-spell-casting, topics: ['Array', 'Hash Table', 'Two Pointers', 'Binary Search', 'Dynamic Programming', 'Sorting', 'Counting'], hasSolution: False, hasVideoSolution: False, 3187: questionNo: 3187, acRate: 26.62512257615538, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Peaks in Array, slug: peaks-in-array, url: https://leetcode.com/problems/peaks-in-array, topics: ['Array', 'Binary Indexed Tree', 'Segment Tree'], hasSolution: False, hasVideoSolution: False, 3188: questionNo: 3188, acRate: 52.11062590975255, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Find Top Scoring Students II, slug: find-top-scoring-students-ii, url: https://leetcode.com/problems/find-top-scoring-students-ii, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 3189: questionNo: 3189, acRate: 74.41016333938293, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Minimum Moves to Get a Peaceful Board, slug: minimum-moves-to-get-a-peaceful-board, url: https://leetcode.com/problems/minimum-moves-to-get-a-peaceful-board, topics: ['Array', 'Greedy', 'Sorting', 'Counting Sort'], hasSolution: False, hasVideoSolution: False, 3190: questionNo: 3190, acRate: 89.52943368641336, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Find Minimum Operations to Make All Elements Divisible by Three, slug: find-minimum-operations-to-make-all-elements-divisible-by-three, url: https://leetcode.com/problems/find-minimum-operations-to-make-all-elements-divisible-by-three, topics: ['Array', 'Math'], hasSolution: False, hasVideoSolution: False, 3191: questionNo: 3191, acRate: 70.58166125066624, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Operations to Make Binary Array Elements Equal to One I, slug: minimum-operations-to-make-binary-array-elements-equal-to-one-i, url: https://leetcode.com/problems/minimum-operations-to-make-binary-array-elements-equal-to-one-i, topics: ['Array', 'Bit Manipulation', 'Queue', 'Sliding Window', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 3192: questionNo: 3192, acRate: 64.82399313143927, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Operations to Make Binary Array Elements Equal to One II, slug: minimum-operations-to-make-binary-array-elements-equal-to-one-ii, url: https://leetcode.com/problems/minimum-operations-to-make-binary-array-elements-equal-to-one-ii, topics: ['Array', 'Dynamic Programming', 'Greedy'], hasSolution: False, hasVideoSolution: False, 3193: questionNo: 3193, acRate: 32.725779967159276, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Count the Number of Inversions, slug: count-the-number-of-inversions, url: https://leetcode.com/problems/count-the-number-of-inversions, topics: ['Array', 'Dynamic Programming'], hasSolution: False, hasVideoSolution: False, 3194: questionNo: 3194, acRate: 84.81527475939149, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Minimum Average of Smallest and Largest Elements, slug: minimum-average-of-smallest-and-largest-elements, url: https://leetcode.com/problems/minimum-average-of-smallest-and-largest-elements, topics: ['Array', 'Two Pointers', 'Sorting'], hasSolution: False, hasVideoSolution: False, 3195: questionNo: 3195, acRate: 74.06932462889563, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Find the Minimum Area to Cover All Ones I, slug: find-the-minimum-area-to-cover-all-ones-i, url: https://leetcode.com/problems/find-the-minimum-area-to-cover-all-ones-i, topics: ['Array', 'Matrix'], hasSolution: False, hasVideoSolution: False, 3196: questionNo: 3196, acRate: 28.191920037970796, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximize Total Cost of Alternating Subarrays, slug: maximize-total-cost-of-alternating-subarrays, url: https://leetcode.com/problems/maximize-total-cost-of-alternating-subarrays, topics: ['Array', 'Dynamic Programming'], hasSolution: False, hasVideoSolution: False, 3197: questionNo: 3197, acRate: 35.94095288606029, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Find the Minimum Area to Cover All Ones II, slug: find-the-minimum-area-to-cover-all-ones-ii, url: https://leetcode.com/problems/find-the-minimum-area-to-cover-all-ones-ii, topics: ['Array', 'Matrix', 'Enumeration'], hasSolution: False, hasVideoSolution: False, 3198: questionNo: 3198, acRate: 84.73895582329317, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Find Cities in Each State, slug: find-cities-in-each-state, url: https://leetcode.com/problems/find-cities-in-each-state, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 3199: questionNo: 3199, acRate: 85.05942275042445, difficulty: Easy, level: Easy, isFavor: False, paidOnly: True, title: Count Triplets with Even XOR Set Bits I, slug: count-triplets-with-even-xor-set-bits-i, url: https://leetcode.com/problems/count-triplets-with-even-xor-set-bits-i, topics: ['Array', 'Bit Manipulation'], hasSolution: False, hasVideoSolution: False, 3200: questionNo: 3200, acRate: 42.03990794365342, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Maximum Height of a Triangle, slug: maximum-height-of-a-triangle, url: https://leetcode.com/problems/maximum-height-of-a-triangle, topics: ['Array', 'Enumeration'], hasSolution: False, hasVideoSolution: False, 3201: questionNo: 3201, acRate: 36.99791891595863, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Find the Maximum Length of Valid Subsequence I, slug: find-the-maximum-length-of-valid-subsequence-i, url: https://leetcode.com/problems/find-the-maximum-length-of-valid-subsequence-i, topics: ['Array', 'Dynamic Programming'], hasSolution: False, hasVideoSolution: False, 3202: questionNo: 3202, acRate: 38.62352466458186, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Find the Maximum Length of Valid Subsequence II, slug: find-the-maximum-length-of-valid-subsequence-ii, url: https://leetcode.com/problems/find-the-maximum-length-of-valid-subsequence-ii, topics: ['Array', 'Dynamic Programming'], hasSolution: False, hasVideoSolution: False, 3203: questionNo: 3203, acRate: 34.92278515307505, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Find Minimum Diameter After Merging Two Trees, slug: find-minimum-diameter-after-merging-two-trees, url: https://leetcode.com/problems/find-minimum-diameter-after-merging-two-trees, topics: ['Tree', 'Depth-First Search', 'Breadth-First Search', 'Graph'], hasSolution: False, hasVideoSolution: False, 3204: questionNo: 3204, acRate: 95.7983193277311, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Bitwise User Permissions Analysis, slug: bitwise-user-permissions-analysis, url: https://leetcode.com/problems/bitwise-user-permissions-analysis, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 3205: questionNo: 3205, acRate: 81.82926829268293, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Maximum Array Hopping Score I, slug: maximum-array-hopping-score-i, url: https://leetcode.com/problems/maximum-array-hopping-score-i, topics: ['Array', 'Dynamic Programming', 'Stack', 'Greedy', 'Monotonic Stack'], hasSolution: False, hasVideoSolution: False, 3206: questionNo: 3206, acRate: 66.38189980943768, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Alternating Groups I, slug: alternating-groups-i, url: https://leetcode.com/problems/alternating-groups-i, topics: ['Array', 'Sliding Window'], hasSolution: False, hasVideoSolution: False, 3207: questionNo: 3207, acRate: 31.330241576272073, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum Points After Enemy Battles, slug: maximum-points-after-enemy-battles, url: https://leetcode.com/problems/maximum-points-after-enemy-battles, topics: ['Array', 'Greedy'], hasSolution: False, hasVideoSolution: False, 3208: questionNo: 3208, acRate: 39.49041013945489, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Alternating Groups II, slug: alternating-groups-ii, url: https://leetcode.com/problems/alternating-groups-ii, topics: ['Array', 'Sliding Window'], hasSolution: False, hasVideoSolution: False, 3209: questionNo: 3209, acRate: 33.43869796220324, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Number of Subarrays With AND Value of K, slug: number-of-subarrays-with-and-value-of-k, url: https://leetcode.com/problems/number-of-subarrays-with-and-value-of-k, topics: ['Array', 'Binary Search', 'Bit Manipulation', 'Segment Tree'], hasSolution: False, hasVideoSolution: False, 3210: questionNo: 3210, acRate: 69.53570218969503, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Find the Encrypted String, slug: find-the-encrypted-string, url: https://leetcode.com/problems/find-the-encrypted-string, topics: ['String'], hasSolution: False, hasVideoSolution: False, 3211: questionNo: 3211, acRate: 86.22243682600997, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Generate Binary Strings Without Adjacent Zeros, slug: generate-binary-strings-without-adjacent-zeros, url: https://leetcode.com/problems/generate-binary-strings-without-adjacent-zeros, topics: ['String', 'Bit Manipulation', 'Recursion'], hasSolution: False, hasVideoSolution: False, 3212: questionNo: 3212, acRate: 51.307158247546084, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Count Submatrices With Equal Frequency of X and Y, slug: count-submatrices-with-equal-frequency-of-x-and-y, url: https://leetcode.com/problems/count-submatrices-with-equal-frequency-of-x-and-y, topics: ['Array', 'Matrix', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 3213: questionNo: 3213, acRate: 20.832459035156326, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Construct String with Minimum Cost, slug: construct-string-with-minimum-cost, url: https://leetcode.com/problems/construct-string-with-minimum-cost, topics: ['Array', 'String', 'Dynamic Programming', 'Suffix Array'], hasSolution: False, hasVideoSolution: False, 3214: questionNo: 3214, acRate: 59.88483685220729, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Year on Year Growth Rate, slug: year-on-year-growth-rate, url: https://leetcode.com/problems/year-on-year-growth-rate, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 3215: questionNo: 3215, acRate: 74.47447447447448, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Count Triplets with Even XOR Set Bits II, slug: count-triplets-with-even-xor-set-bits-ii, url: https://leetcode.com/problems/count-triplets-with-even-xor-set-bits-ii, topics: ['Array', 'Bit Manipulation'], hasSolution: False, hasVideoSolution: False, 3216: questionNo: 3216, acRate: 52.87046768260642, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Lexicographically Smallest String After a Swap, slug: lexicographically-smallest-string-after-a-swap, url: https://leetcode.com/problems/lexicographically-smallest-string-after-a-swap, topics: ['String', 'Greedy'], hasSolution: False, hasVideoSolution: False, 3217: questionNo: 3217, acRate: 61.47209132541316, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Delete Nodes From Linked List Present in Array, slug: delete-nodes-from-linked-list-present-in-array, url: https://leetcode.com/problems/delete-nodes-from-linked-list-present-in-array, topics: ['Array', 'Hash Table', 'Linked List'], hasSolution: False, hasVideoSolution: False, 3218: questionNo: 3218, acRate: 57.50517724448776, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Cost for Cutting Cake I, slug: minimum-cost-for-cutting-cake-i, url: https://leetcode.com/problems/minimum-cost-for-cutting-cake-i, topics: ['Array', 'Dynamic Programming', 'Greedy', 'Sorting'], hasSolution: False, hasVideoSolution: False, 3219: questionNo: 3219, acRate: 55.736109472690806, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Minimum Cost for Cutting Cake II, slug: minimum-cost-for-cutting-cake-ii, url: https://leetcode.com/problems/minimum-cost-for-cutting-cake-ii, topics: ['Array', 'Greedy', 'Sorting'], hasSolution: False, hasVideoSolution: False, 3220: questionNo: 3220, acRate: 71.5503462972829, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Odd and Even Transactions, slug: odd-and-even-transactions, url: https://leetcode.com/problems/odd-and-even-transactions, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 3221: questionNo: 3221, acRate: 68.86543535620054, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Maximum Array Hopping Score II, slug: maximum-array-hopping-score-ii, url: https://leetcode.com/problems/maximum-array-hopping-score-ii, topics: ['Array', 'Stack', 'Greedy', 'Monotonic Stack'], hasSolution: False, hasVideoSolution: False, 3222: questionNo: 3222, acRate: 49.7744714173845, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Find the Winning Player in Coin Game, slug: find-the-winning-player-in-coin-game, url: https://leetcode.com/problems/find-the-winning-player-in-coin-game, topics: ['Math', 'Simulation', 'Game Theory'], hasSolution: False, hasVideoSolution: False, 3223: questionNo: 3223, acRate: 53.152063168619456, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Length of String After Operations, slug: minimum-length-of-string-after-operations, url: https://leetcode.com/problems/minimum-length-of-string-after-operations, topics: ['Hash Table', 'String', 'Counting'], hasSolution: False, hasVideoSolution: False, 3224: questionNo: 3224, acRate: 21.58902519893899, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Minimum Array Changes to Make Differences Equal, slug: minimum-array-changes-to-make-differences-equal, url: https://leetcode.com/problems/minimum-array-changes-to-make-differences-equal, topics: ['Array', 'Hash Table', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 3225: questionNo: 3225, acRate: 22.52208047105005, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Maximum Score From Grid Operations, slug: maximum-score-from-grid-operations, url: https://leetcode.com/problems/maximum-score-from-grid-operations, topics: ['Array', 'Dynamic Programming', 'Matrix', 'Prefix Sum'], hasSolution: False, hasVideoSolution: False, 3226: questionNo: 3226, acRate: 63.567561595403824, difficulty: Easy, level: Easy, isFavor: False, paidOnly: False, title: Number of Bit Changes to Make Two Integers Equal, slug: number-of-bit-changes-to-make-two-integers-equal, url: https://leetcode.com/problems/number-of-bit-changes-to-make-two-integers-equal, topics: ['Bit Manipulation'], hasSolution: False, hasVideoSolution: False, 3227: questionNo: 3227, acRate: 60.69921398427969, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Vowels Game in a String, slug: vowels-game-in-a-string, url: https://leetcode.com/problems/vowels-game-in-a-string, topics: ['Math', 'String', 'Brainteaser', 'Game Theory'], hasSolution: False, hasVideoSolution: False, 3228: questionNo: 3228, acRate: 52.326152550698204, difficulty: Medium, level: Medium, isFavor: False, paidOnly: False, title: Maximum Number of Operations to Move Ones to the End, slug: maximum-number-of-operations-to-move-ones-to-the-end, url: https://leetcode.com/problems/maximum-number-of-operations-to-move-ones-to-the-end, topics: ['String', 'Greedy', 'Counting'], hasSolution: False, hasVideoSolution: False, 3229: questionNo: 3229, acRate: 36.2215628090999, difficulty: Hard, level: Hard, isFavor: False, paidOnly: False, title: Minimum Operations to Make Array Equal to Target, slug: minimum-operations-to-make-array-equal-to-target, url: https://leetcode.com/problems/minimum-operations-to-make-array-equal-to-target, topics: ['Array', 'Dynamic Programming', 'Stack', 'Greedy', 'Monotonic Stack'], hasSolution: False, hasVideoSolution: False, 3230: questionNo: 3230, acRate: 46.95121951219512, difficulty: Medium, level: Medium, isFavor: False, paidOnly: True, title: Customer Purchasing Behavior Analysis, slug: customer-purchasing-behavior-analysis, url: https://leetcode.com/problems/customer-purchasing-behavior-analysis, topics: ['Database'], hasSolution: False, hasVideoSolution: False, 3231: questionNo: 3231, acRate: 58.75912408759124, difficulty: Hard, level: Hard, isFavor: False, paidOnly: True, title: Minimum Number of Increasing Subsequence to Be Removed, slug: minimum-number-of-increasing-subsequence-to-be-removed, url: https://leetcode.com/problems/minimum-number-of-increasing-subsequence-to-be-removed, topics: [], hasSolution: False, hasVideoSolution: False}\n", - "Total of 6 files found.\n", - "Total of 0 contest files found.\n", - "Parsing code files...\n", - "Error in parsing .adsfsdf: group encountered while trying to extract question number int(...). \n", - "parseCase(...) \n", - "Skipping\n", - "Error in parsing asdf.asdfadsaf: group encountered while trying to extract question number int(...). \n", - "parseCase(...) \n", - "Skipping\n", - "Parsing contest files...\n", - "Parsing additional information/context files...\n", - "Error in parsing gasd: Attribute Error encountered while trying to extract question number int(...). \n", - "parseContextFiles(...) \n", - "Skipping\n", - "Sorting questions to their lists...\n", - "Generating markdowns for each individual question...\n", - "Generating category lists...\n", - "sortBy = 'bytes'\n", - "dataframe_array = [[1234, '[Replace the Substring for Balanced String]()', 'Medium', '', '[solution](<_1234. Replace the Substring for Balanced String.md>)', 'js', 'Jul 25, 2024'], [2222, '[Number of Ways to Select Buildings]()', 'Medium', '', '[solution](<_2222. Number of Ways to Select Buildings.md>)', 'py', 'Jul 15, 2024'], [1334, '[Find the City With the Smallest Number of Neighbors at a Threshold Distance]()', 'Medium', '', '[solution](<_1334. Find the City With the Smallest Number of Neighbors at a Threshold Distance.md>)', 'js', 'Jul 25, 2024'], [1111, '[Maximum Nesting Depth of Two Valid Parentheses Strings]()', 'Medium', '', '[solution](<_1111. Maximum Nesting Depth of Two Valid Parentheses Strings.md>)', 'py', 'Jul 19, 2024']]\n", - "sortBy = 'date_done'\n", - "dataframe_array = [[1234, '[Replace the Substring for Balanced String]()', 'Medium', '', '[solution](<_1234. Replace the Substring for Balanced String.md>)', 'js', 'Jul 25, 2024'], [2222, '[Number of Ways to Select Buildings]()', 'Medium', '', '[solution](<_2222. Number of Ways to Select Buildings.md>)', 'py', 'Jul 15, 2024'], [1334, '[Find the City With the Smallest Number of Neighbors at a Threshold Distance]()', 'Medium', '', '[solution](<_1334. Find the City With the Smallest Number of Neighbors at a Threshold Distance.md>)', 'js', 'Jul 25, 2024'], [1111, '[Maximum Nesting Depth of Two Valid Parentheses Strings]()', 'Medium', '', '[solution](<_1111. Maximum Nesting Depth of Two Valid Parentheses Strings.md>)', 'py', 'Jul 19, 2024']]\n", - "dailies: output = [(datetime.datetime(2024, 7, 23, 0, 0), 1636), (datetime.datetime(2024, 7, 24, 0, 0), 2191), (datetime.datetime(2024, 7, 25, 0, 0), 912), (datetime.datetime(2024, 7, 26, 0, 0), 1334)]\n", - "\n", - "\n", - "hi\n", - "bool(qNo in questionData) = True\n", - "questionData[qNo]['date_done'] = datetime.datetime(2024, 7, 25, 23, 6, 10)\n", - "date + timedelta(days=1, hours=12) = datetime.datetime(2024, 7, 27, 12, 0)\n", - "dailyQuestionData = {datetime.datetime(2024, 7, 26, 0, 0): {'level': 'Medium', 'number': 1334, 'title': '[Find the City With the Smallest Number of Neighbors at a Threshold Distance]()', 'categories': set(), 'contestTitle': None, 'contestQNo': None, 'date_done': datetime.datetime(2024, 7, 26, 0, 0), 'date_modified': datetime.datetime(2024, 7, 25, 23, 13, 18), 'solution': '_1334. Find the City With the Smallest Number of Neighbors at a Threshold Distance.md', 'solutions': {'js': ['my-submissions/m1334.js']}, 'languages': {'js'}, 'bytes': 37}}\n", - "_OLDEST_DATE = datetime.datetime(2024, 7, 23, 0, 0)\n", - "sortBy = 'date_done'\n", - "dataframe_array = [[1334, '[Find the City With the Smallest Number of Neighbors at a Threshold Distance]()', 'Medium', '', '[solution](<_1334. Find the City With the Smallest Number of Neighbors at a Threshold Distance.md>)', 'js', 'Jul 26, 2024']]\n", - "sortBy = 'number'\n", - "dataframe_array = []\n", - "sortBy = 'number'\n", - "dataframe_array = [[1234, '[Replace the Substring for Balanced String]()', 'Medium', '', '[solution](<_1234. Replace the Substring for Balanced String.md>)', 'js', 'Jul 25, 2024'], [2222, '[Number of Ways to Select Buildings]()', 'Medium', '', '[solution](<_2222. Number of Ways to Select Buildings.md>)', 'py', 'Jul 15, 2024'], [1334, '[Find the City With the Smallest Number of Neighbors at a Threshold Distance]()', 'Medium', '', '[solution](<_1334. Find the City With the Smallest Number of Neighbors at a Threshold Distance.md>)', 'js', 'Jul 25, 2024'], [1111, '[Maximum Nesting Depth of Two Valid Parentheses Strings]()', 'Medium', '', '[solution](<_1111. Maximum Nesting Depth of Two Valid Parentheses Strings.md>)', 'py', 'Jul 19, 2024']]\n", - "sortBy = 'number'\n", - "dataframe_array = []\n", - "sortBy = 'number'\n", - "dataframe_array = [[1234, '[Replace the Substring for Balanced String]()', 'Medium', '', '[solution](<../_1234. Replace the Substring for Balanced String.md>)', 'js', 'Jul 25, 2024'], [2222, '[Number of Ways to Select Buildings]()', 'Medium', '', '[solution](<../_2222. Number of Ways to Select Buildings.md>)', 'py', 'Jul 15, 2024'], [1111, '[Maximum Nesting Depth of Two Valid Parentheses Strings]()', 'Medium', '', '[solution](<../_1111. Maximum Nesting Depth of Two Valid Parentheses Strings.md>)', 'py', 'Jul 19, 2024']]\n", - "sortBy = 'number'\n", - "dataframe_array = [[1234, '[Replace the Substring for Balanced String]()', 'Medium', '', '[solution](<../_1234. Replace the Substring for Balanced String.md>)', 'js', 'Jul 25, 2024']]\n", - "sortBy = 'number'\n", - "dataframe_array = [[2222, '[Number of Ways to Select Buildings]()', 'Medium', '', '[solution](<../_2222. Number of Ways to Select Buildings.md>)', 'py', 'Jul 15, 2024'], [1334, '[Find the City With the Smallest Number of Neighbors at a Threshold Distance]()', 'Medium', '', '[solution](<../_1334. Find the City With the Smallest Number of Neighbors at a Threshold Distance.md>)', 'js', 'Jul 25, 2024']]\n", - "sortBy = 'number'\n", - "dataframe_array = [[2222, '[Number of Ways to Select Buildings]()', 'Medium', '', '[solution](<../_2222. Number of Ways to Select Buildings.md>)', 'py', 'Jul 15, 2024']]\n", - "sortBy = 'number'\n", - "dataframe_array = [[1334, '[Find the City With the Smallest Number of Neighbors at a Threshold Distance]()', 'Medium', '', '[solution](<../_1334. Find the City With the Smallest Number of Neighbors at a Threshold Distance.md>)', 'js', 'Jul 25, 2024']]\n", - "sortBy = 'number'\n", - "dataframe_array = [[1334, '[Find the City With the Smallest Number of Neighbors at a Threshold Distance]()', 'Medium', '', '[solution](<../_1334. Find the City With the Smallest Number of Neighbors at a Threshold Distance.md>)', 'js', 'Jul 25, 2024']]\n", - "sortBy = 'number'\n", - "dataframe_array = [[1111, '[Maximum Nesting Depth of Two Valid Parentheses Strings]()', 'Medium', '', '[solution](<../_1111. Maximum Nesting Depth of Two Valid Parentheses Strings.md>)', 'py', 'Jul 19, 2024']]\n", - "Exporting primary README.md file...\n", - "sortBy = 'number'\n", - "dataframe_array = [[1234, '[Replace the Substring for Balanced String]()', 'Medium', '', '[solution]()', 'js'], [2222, '[Number of Ways to Select Buildings]()', 'Medium', '', '[solution]()', 'py'], [1334, '[Find the City With the Smallest Number of Neighbors at a Threshold Distance]()', 'Medium', '', '[solution]()', 'js'], [1111, '[Maximum Nesting Depth of Two Valid Parentheses Strings]()', 'Medium', '', '[solution]()', 'py']]\n", - "../README.md\n", - "((0, 'markdowns/Easy.md'), (4, 'markdowns/Medium.md'), (0, 'markdowns/Hard.md'))\n", - "Number of individual questions updated/added: 0\n", - "Pickling most recent modification times for future reference...\n", - "All processes complete. Exiting...\n" - ] - } - ], + "execution_count": null, + "metadata": {}, + "outputs": [], "source": [ "if __name__ == '__main__' :\n", " '''\n", diff --git a/main.py b/main.py index 9c25a9d..d0da901 100644 --- a/main.py +++ b/main.py @@ -3,7 +3,7 @@ # Data management imports -# In[401]: +# In[ ]: import pandas as kungfupanda # pandas for data manipulation and markdown @@ -19,7 +19,7 @@ # OS and directory management imports -# In[402]: +# In[ ]: from os import listdir # for file retrieval and path calculations @@ -41,7 +41,7 @@ # Environment variable imports + file log and creation time imports -# In[403]: +# In[ ]: from os import getenv, environ # for environment variables @@ -50,7 +50,7 @@ import subprocess # tracing git log history for ctimes and mtimes -# In[404]: +# In[ ]: from os.path import getmtime, getctime # retreiving file creation/modification times @@ -60,7 +60,7 @@ # QOL and anti-reundancy imports -# In[405]: +# In[ ]: from typing import Set, Dict, List, Tuple # misc. QOL imports @@ -80,7 +80,7 @@ # 2. If failure, use the `.env` found in the current script directory (in the updater). # 2. If is a script run, denotes it as such for script flag references and ensures working directory is the script's location rather than the calling directory. -# In[406]: +# In[ ]: # loading env variables @@ -92,7 +92,7 @@ load_dotenv(find_dotenv('../.env'), override=True) -# In[407]: +# In[ ]: # NOTE: if the script is being run from a jupyter notebook, then it should @@ -110,7 +110,7 @@ pass -# In[408]: +# In[ ]: # TQDM import based off if current running script is a jupyter notebook @@ -124,7 +124,7 @@ from tqdm import tqdm -# In[409]: +# In[ ]: # README_ABS_DIR will get confirmed in if name==main prior to running @@ -135,7 +135,7 @@ print(f'{NOTEBOOK_ABS_DIR = }') -# In[410]: +# In[ ]: README_PATH = getenv('README_PATH') @@ -149,16 +149,16 @@ # # UpdateLanguage $\rightarrow$ if a question already has a solution, this is called instead to insert the new file link to the existing row details. -# In[411]: +# In[ ]: # Categories besides those in lists PRIMARY_CATEGORIES = set(['Daily', 'Weekly Premium', 'Contest', 'Favourite']) -# _OLDEST_DATE = datetime.now() -_OLDEST_DATE = datetime(2024, 7, 23) +_oldest_date = datetime.now() +# _oldest_date = datetime(2024, 7, 23) -# In[412]: +# In[ ]: def individualCTimeViaGit(cmd: List[str]) -> Tuple[datetime, datetime] : @@ -182,10 +182,6 @@ def individualCTimeViaGit(cmd: List[str]) -> Tuple[datetime, datetime] : creationDate = datetime.strptime(time.ctime(int(modifiedTimes[0])), '%a %b %d %H:%M:%S %Y') modifiedDate = datetime.strptime(time.ctime(int(modifiedTimes[-1])), '%a %b %d %H:%M:%S %Y') - global _OLDEST_DATE - if creationDate <_OLDEST_DATE: - _OLDEST_DATE = creationDate.replace(hour=0, minute=0, second=0, microsecond=0) - except ValueError as ve: print(f'Error in parsing {path}') print(f'{modifiedTimes}') @@ -195,7 +191,7 @@ def individualCTimeViaGit(cmd: List[str]) -> Tuple[datetime, datetime] : return (creationDate, modifiedDate) -# In[413]: +# In[ ]: _ALL_GIT_CM_TIMES = {} @@ -218,14 +214,42 @@ def getAllCTimesViaGit(paths: List[str]) -> Dict[str, Tuple[datetime, datetime]] cmd = r"git log --follow --format=%ct --reverse --".split() output = {} - + + oldest_date = datetime.now() + + # if getenv("GITHUB_ACTIONS") == 'true' : + # print('\n') + # print('/' + '=' * 15 + '\\') + # print(' ', end='') + # pqBarsPrinted = 0 + # for i, path in enumerate(paths) : + # path = join(LEETCODE_PATH_FROM_README, path) + # output[path] = individualCTimeViaGit(cmd + [path]) + + # if output[path][0] < oldest_date : + # oldest_date = output[path][0] + + # curChunk = int((i / len(paths)) * 15) + # if curChunk > pqBarsPrinted : + # print('=' * (curChunk - pqBarsPrinted), end='') + # pqBarsPrinted = curChunk + + # print((15 - pqBarsPrinted) * '=', '\n\n') + # else : with tqdm(total=len(paths)) as pbar : # with tqdm(total=len(paths), position=0, leave=True) as pbar : for i, path in enumerate(paths) : path = join(LEETCODE_PATH_FROM_README, path) output[path] = individualCTimeViaGit(cmd + [path]) + + if output[path][0] < oldest_date : + oldest_date = output[path][0] + pbar.update(1) + global _oldest_date + _oldest_date = oldest_date.replace(hour=0, minute=0, second=0, microsecond=0) + # Usually I'd avoid using global for this but this is a personal project so it should be fine. _ALL_GIT_CM_TIMES.update(output) print(f'{_ALL_GIT_CM_TIMES = }') @@ -234,7 +258,7 @@ def getAllCTimesViaGit(paths: List[str]) -> Dict[str, Tuple[datetime, datetime]] return output -# In[414]: +# In[ ]: @cache @@ -259,7 +283,7 @@ def getCtimesMtimesGitHistory(path: str) -> Tuple[datetime, datetime] : return cmDates -# In[415]: +# In[ ]: USE_GIT_DATES = False @@ -292,7 +316,7 @@ def getCtimeMtimesMain(path: str) -> Tuple[datetime, datetime] : return (creation_date, modification_date) -# In[416]: +# In[ ]: def getCtimeMtimes(path: str, *, preCalculated: Dict[str, Tuple[datetime, datetime]] = None) -> Tuple[datetime, datetime] : @@ -307,7 +331,7 @@ def getCtimeMtimes(path: str, *, preCalculated: Dict[str, Tuple[datetime, dateti return getCtimeMtimesMain(path) -# In[417]: +# In[ ]: def addCase(level: str, @@ -397,7 +421,7 @@ def addCase(level: str, return output -# In[418]: +# In[ ]: def updateQuestion(orig: dict, @@ -464,7 +488,7 @@ def updateQuestion(orig: dict, # # Pickle Processes # -# In[419]: +# In[ ]: QUESTION_DATA_FOLDER = join(getenv('SUBMODULE_DATA_PATH'), getenv('LEETCODE_QUESTION_DETAILS')) @@ -501,13 +525,13 @@ def retrieveQuestionDetails() -> dict : return questionDetailsDict -# In[420]: +# In[ ]: HISTORY_PATH = join(getenv('USER_DATA_PATH'), getenv('FILE_MODIFICATION_NAME')) -# In[421]: +# In[ ]: def writeRecentFileTimes(fileLatestTimes: dict) -> bool : @@ -519,7 +543,7 @@ def writeRecentFileTimes(fileLatestTimes: dict) -> bool : return True -# In[422]: +# In[ ]: def getRecentFileTimes() -> dict : @@ -534,17 +558,17 @@ def getRecentFileTimes() -> dict : # # Daily and Weekly Challenges -# In[423]: +# In[ ]: DAILIES_DATA_PATH = join(getenv('SUBMODULE_DATA_PATH'), getenv('DAILIES_FOLDER'), getenv('DAILIES_FILE')) WEEKLIES_DATA_PATH = join(getenv('SUBMODULE_DATA_PATH'), getenv('DAILIES_FOLDER'), getenv('WEEKLIES_FILE')) -# In[424]: +# In[ ]: -def getDailies(firstDate: datetime = _OLDEST_DATE) -> List[Tuple[datetime, int]] : +def getDailies(firstDate: datetime = None) -> List[Tuple[datetime, int]] : ''' Retrieves the daily questions from the official LeetCode json data and returns them as a set of strings @@ -552,6 +576,11 @@ def getDailies(firstDate: datetime = _OLDEST_DATE) -> List[Tuple[datetime, int]] ### Returns : dailies : List[Tuple[date, questionNo]] ''' + if not firstDate : + global _oldest_date + firstDate = _oldest_date + + print('Oldest date found:', firstDate) with open(DAILIES_DATA_PATH, 'rb') as fp: dailies = json.load(fp) @@ -564,14 +593,16 @@ def getDailies(firstDate: datetime = _OLDEST_DATE) -> List[Tuple[datetime, int]] continue output.append((newK, int(dailies[k]['question']['questionFrontendId']))) - print(f'dailies: {output = }') + + # print(f'{firstDate = }') + # print(f'dailies: {output = }') return sorted(output, key=lambda x: x[0], reverse=True) -# In[425]: +# In[ ]: -def getWeeklies(firstDate: datetime = _OLDEST_DATE) -> List[Tuple[datetime, int]] : +def getWeeklies(firstDate: datetime = None) -> List[Tuple[datetime, int]] : ''' Retrieves the weekly premium questions from the official LeetCode json data and returns them as a set of strings @@ -579,6 +610,11 @@ def getWeeklies(firstDate: datetime = _OLDEST_DATE) -> List[Tuple[datetime, int] ### Returns : weeklies : List[Tuple[date, questionNo]] ''' + if not firstDate : + global _oldest_date + firstDate = _oldest_date + + print('Oldest date found:', firstDate) with open(WEEKLIES_DATA_PATH, 'rb') as fp: weeklies = json.load(fp) @@ -595,7 +631,7 @@ def getWeeklies(firstDate: datetime = _OLDEST_DATE) -> List[Tuple[datetime, int] return sorted(output, key=lambda x: x[0], reverse=True) -# In[426]: +# In[ ]: # # NOTE: TESTING @@ -603,7 +639,7 @@ def getWeeklies(firstDate: datetime = _OLDEST_DATE) -> List[Tuple[datetime, int] # ic(temp) -# In[427]: +# In[ ]: def parseQuestionsForDailies(questionData: dict) -> Dict[int, Question] : @@ -622,19 +658,22 @@ def parseQuestionsForDailies(questionData: dict) -> Dict[int, Question] : # I have ~12 hours of leeway due to potential to forget to commit for date, qNo in dailies : - if qNo == 1334 : - print('\n\nhi') - print(f'{bool(qNo in questionData) = }') - print(f"{questionData[qNo]['date_done'] = }") - print(f"{date + timedelta(days=1, hours=12) = }") + # if qNo == 1334 : + # print('\n\nhi') + # print(f'{bool(qNo in questionData) = }') + # print(f"{questionData[qNo]['date_done'] = }") + # print(f"{date + timedelta(days=1, hours=12) = }") if qNo in questionData and questionData[qNo]['date_done'] <= date + timedelta(days=1, hours=12) : dailiesDict[date] = questionData[qNo].copy() dailiesDict[date]['date_done'] = date + # print(f'{dailiesDict[date] = }') + + # print(f'{dailiesDict = }') return dailiesDict -# In[428]: +# In[ ]: def parseQuestionsForWeeklies(questionData: dict) -> Dict[int, Question] : @@ -663,7 +702,7 @@ def parseQuestionsForWeeklies(questionData: dict) -> Dict[int, Question] : # # Parsing Files # Question file parsing occurs here. It organizes it into 3 different lists, separated by difficulty and sorted by question number afterwards. -# In[429]: +# In[ ]: # Parse one leetcode answer file in the submissions folder @@ -757,7 +796,7 @@ def parseCase(leetcodeFile: str, # file name return True -# In[430]: +# In[ ]: @cache @@ -806,7 +845,7 @@ def getContestFiles(contestFolders: List[str]) -> List[Tuple[str, str]] : # # Sort TXT Context # If .txt notes are placed, this adds them to their respective entry. -# In[431]: +# In[ ]: def parseContextFiles(txtFiles: str, @@ -845,7 +884,7 @@ def parseContextFiles(txtFiles: str, # # List-Based Categories # Updating `Category` columns based on the lists in the `Lists` directory. -# In[432]: +# In[ ]: LISTSDIR = getenv('LISTS_LOCATION') @@ -861,7 +900,7 @@ def getLists() -> List[str] : return listFileNames -# In[433]: +# In[ ]: ''' Format for lists file is as follows: @@ -891,7 +930,7 @@ def getList(fileName, filePath) -> Set[int] : -# In[434]: +# In[ ]: def processListData(questionData: dict, @@ -913,7 +952,7 @@ def processListData(questionData: dict, # # Question Topic Grouping # Parses the questions in `questionData` and adds their numbers to appropriate lists so that they can be parsed into their own lists as well as counted. -# In[435]: +# In[ ]: def getCompletedQuestionsTopicLists(questionData: dict, @@ -935,7 +974,7 @@ def getCompletedQuestionsTopicLists(questionData: dict, # # Individual Markdown Generation # -# In[436]: +# In[ ]: README_PATH = getenv('README_PATH') @@ -955,7 +994,7 @@ def getCompletedQuestionsTopicLists(questionData: dict, BY_TOPIC_FOLDER_PATH = getenv('TOPIC_MARKDOWN_PATH_IN_MARKDOWNS_FOLDER') -# In[437]: +# In[ ]: # MARKDOWN_TO_SUBMISSIONS @@ -1050,7 +1089,7 @@ def generate_markdown(questionNo: int, return output_path -# In[438]: +# In[ ]: def processMarkdownGeneration(questionData: dict, @@ -1079,7 +1118,7 @@ def processMarkdownGeneration(questionData: dict, # # DataFrames # Conversion into DataFrames and declaration of respective column headers occurs here. -# In[439]: +# In[ ]: COLUMNS = [ @@ -1103,7 +1142,7 @@ def processMarkdownGeneration(questionData: dict, } -# In[440]: +# In[ ]: def convertDataToMatrix(questionData: dict, @@ -1146,14 +1185,14 @@ def convertDataToMatrix(questionData: dict, # Usually, x[0] is the question number but the qustionData set might be keyed by the date if it's a daily case if sortBy == 'date_done' and type(list(questionData.keys())[0]) == datetime : - dataframe_array.sort(key=lambda x: x[-1]) + dataframe_array.sort(key=lambda x: datetime.strptime(x[-1], '%b %d, %Y')) else : dataframe_array.sort(key=lambda x: questionData.get(x[0])[sortBy]) return dataframe_array -# In[441]: +# In[ ]: def convertQuestionDataToDataframe(questionData: dict, @@ -1186,7 +1225,7 @@ def convertQuestionDataToDataframe(questionData: dict, # ## Sorted by Most Recent # Using creation dates of code files only; not modification dates. -# In[442]: +# In[ ]: # NOTE: Reversed due to default sorting being in ascending order @@ -1197,7 +1236,7 @@ def byRecentQuestionDataDataframe(questionData: dict) -> DataFrame : # ## Sorted by Amount of Code # Questions with more files on the question and longer submissions will be prioritized. -# In[443]: +# In[ ]: def byCodeLengthDataDataframe(questionData: dict) -> DataFrame : @@ -1207,7 +1246,7 @@ def byCodeLengthDataDataframe(questionData: dict) -> DataFrame : # # Generation of Markdowns for Each Related Topic # -# In[444]: +# In[ ]: def questionTopicDataframes(questionData: dict, @@ -1232,7 +1271,7 @@ def questionTopicDataframes(questionData: dict, # Note: Topic based markdown generation and any of the large list markdowns in general sometimes suddenly show massive edits for what should be a regular usual question update. This is likely due to the dataframe.to_markdown method increasing the width of the table due to a larger than before seen input. -# In[445]: +# In[ ]: TOPIC_FOLDER = getenv('TOPIC_MARKDOWN_PATH_IN_MARKDOWNS_FOLDER') @@ -1283,7 +1322,7 @@ def topicBasedMarkdowns(questionData: dict, # # Markdowns for Easy/Medium/Hard -# In[446]: +# In[ ]: DIFFICULTY_MARKDOWNS_PATH = MARKDOWN_PATH @@ -1353,7 +1392,7 @@ def generateDifficultyLevelMarkdowns(questionData: dict) -> Tuple[Tuple[int, str # ## Dailies, Recents, etc. -# In[447]: +# In[ ]: DAILY_URL = '' @@ -1382,9 +1421,9 @@ def miscMarkdownGenerations(questionData: dict, details = 'Calculations are based on the date of the first solve.\n\n' elif daily : dailyQuestionData = parseQuestionsForDailies(questionData) - global _OLDEST_DATE + global _oldest_date print(f'{dailyQuestionData = }') - print(f'{_OLDEST_DATE = }') + print(f'{_oldest_date = }') # for qNo, qData in questionData.items() : # if 'Daily' in qData['categories'] : # dailyQuestionData[qNo] = qData @@ -1425,7 +1464,7 @@ def miscMarkdownGenerations(questionData: dict, # # Uses the built-in DataFrame `.to_markdown()` for outputting. -# In[448]: +# In[ ]: def exportPrimaryReadme(dfQuestions: DataFrame, @@ -1500,7 +1539,7 @@ def exportPrimaryReadme(dfQuestions: DataFrame, file.write('

This README was generated using WikiLeet

\n') -# In[449]: +# In[ ]: # recalculateAll: forces recalcualtion markdowns for each question irregardless if its @@ -1519,7 +1558,7 @@ def main(*, recalculateAll: bool = False, noRecord: bool = False) -> None : questionDetailsDict = retrieveQuestionDetails() - print(questionDetailsDict) + # print(questionDetailsDict) leetcodeFiles.sort() contestLeetcodeFiles.sort() @@ -1621,7 +1660,7 @@ def main(*, recalculateAll: bool = False, noRecord: bool = False) -> None : return questionData, reprocessMarkdown -# In[450]: +# In[ ]: if __name__ == '__main__' : diff --git a/question_data/question_data b/question_data/question_data index f309b3f..05c0c06 160000 --- a/question_data/question_data +++ b/question_data/question_data @@ -1 +1 @@ -Subproject commit f309b3f2873457dccf261673dda2594399346095 +Subproject commit 05c0c06641d1ee81d124b7aa2bf72c77c4f37691