diff --git a/problems_all.json b/problems_all.json
index d5080a8..608ad17 100644
--- a/problems_all.json
+++ b/problems_all.json
@@ -1 +1 @@
-{"1": {"acRate": 53.42231800377374, "difficulty": "Easy", "likes": 57586, "dislikes": 2022, "categoryTitle": "Algorithms", "frontendQuestionId": "1", "paidOnly": false, "title": "Two Sum", "titleSlug": "two-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 14157359, "totalSubmissionRaw": 26500880}, "2": {"acRate": 43.76181609911992, "difficulty": "Medium", "likes": 31425, "dislikes": 6284, "categoryTitle": "Algorithms", "frontendQuestionId": "2", "paidOnly": false, "title": "Add Two Numbers", "titleSlug": "add-two-numbers", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 4856070, "totalSubmissionRaw": 11096599}, "3": {"acRate": 35.24992887187821, "difficulty": "Medium", "likes": 39951, "dislikes": 1914, "categoryTitle": "Algorithms", "frontendQuestionId": "3", "paidOnly": false, "title": "Longest Substring Without Repeating Characters", "titleSlug": "longest-substring-without-repeating-characters", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 6155114, "totalSubmissionRaw": 17461364}, "4": {"acRate": 41.084302008718296, "difficulty": "Hard", "likes": 28518, "dislikes": 3184, "categoryTitle": "Algorithms", "frontendQuestionId": "4", "paidOnly": false, "title": "Median of Two Sorted Arrays", "titleSlug": "median-of-two-sorted-arrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 2781637, "totalSubmissionRaw": 6770575}, "5": {"acRate": 34.2646102903061, "difficulty": "Medium", "likes": 29471, "dislikes": 1798, "categoryTitle": "Algorithms", "frontendQuestionId": "5", "paidOnly": false, "title": "Longest Palindromic Substring", "titleSlug": "longest-palindromic-substring", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 3237600, "totalSubmissionRaw": 9448813}, "6": {"acRate": 48.95005699588175, "difficulty": "Medium", "likes": 7747, "dislikes": 14753, "categoryTitle": "Algorithms", "frontendQuestionId": "6", "paidOnly": false, "title": "Zigzag Conversion", "titleSlug": "zigzag-conversion", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 1433819, "totalSubmissionRaw": 2929149}, "7": {"acRate": 28.994398779851338, "difficulty": "Medium", "likes": 13175, "dislikes": 13565, "categoryTitle": "Algorithms", "frontendQuestionId": "7", "paidOnly": false, "title": "Reverse Integer", "titleSlug": "reverse-integer", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 3420538, "totalSubmissionRaw": 11797245}, "8": {"acRate": 17.740260266143043, "difficulty": "Medium", "likes": 4638, "dislikes": 13846, "categoryTitle": "Algorithms", "frontendQuestionId": "8", "paidOnly": false, "title": "String to Integer (atoi)", "titleSlug": "string-to-integer-atoi", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1638517, "totalSubmissionRaw": 9236148}, "9": {"acRate": 57.223040078114884, "difficulty": "Easy", "likes": 12809, "dislikes": 2746, "categoryTitle": "Algorithms", "frontendQuestionId": "9", "paidOnly": false, "title": "Palindrome Number", "titleSlug": "palindrome-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 5044604, "totalSubmissionRaw": 8815688}, "10": {"acRate": 28.3133606927024, "difficulty": "Hard", "likes": 12203, "dislikes": 2177, "categoryTitle": "Algorithms", "frontendQuestionId": "10", "paidOnly": false, "title": "Regular Expression Matching", "titleSlug": "regular-expression-matching", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1002643, "totalSubmissionRaw": 3541245}, "11": {"acRate": 55.91495668110079, "difficulty": "Medium", "likes": 29329, "dislikes": 1800, "categoryTitle": "Algorithms", "frontendQuestionId": "11", "paidOnly": false, "title": "Container With Most Water", "titleSlug": "container-with-most-water", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 3211494, "totalSubmissionRaw": 5743541}, "12": {"acRate": 65.88370720244126, "difficulty": "Medium", "likes": 7226, "dislikes": 5565, "categoryTitle": "Algorithms", "frontendQuestionId": "12", "paidOnly": false, "title": "Integer to Roman", "titleSlug": "integer-to-roman", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 1408529, "totalSubmissionRaw": 2137905}, "13": {"acRate": 62.283495433190275, "difficulty": "Easy", "likes": 14408, "dislikes": 955, "categoryTitle": "Algorithms", "frontendQuestionId": "13", "paidOnly": false, "title": "Roman to Integer", "titleSlug": "roman-to-integer", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 3919702, "totalSubmissionRaw": 6293327}, "14": {"acRate": 43.52358206693915, "difficulty": "Easy", "likes": 17745, "dislikes": 4571, "categoryTitle": "Algorithms", "frontendQuestionId": "14", "paidOnly": false, "title": "Longest Common Prefix", "titleSlug": "longest-common-prefix", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 3608101, "totalSubmissionRaw": 8289993}, "15": {"acRate": 35.12035058445678, "difficulty": "Medium", "likes": 31085, "dislikes": 2895, "categoryTitle": "Algorithms", "frontendQuestionId": "15", "paidOnly": false, "title": "3Sum", "titleSlug": "3sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 3801638, "totalSubmissionRaw": 10824618}, "16": {"acRate": 45.987926266320265, "difficulty": "Medium", "likes": 10498, "dislikes": 571, "categoryTitle": "Algorithms", "frontendQuestionId": "16", "paidOnly": false, "title": "3Sum Closest", "titleSlug": "3sum-closest", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 1279263, "totalSubmissionRaw": 2781739}, "17": {"acRate": 61.38881991831981, "difficulty": "Medium", "likes": 18709, "dislikes": 1009, "categoryTitle": "Algorithms", "frontendQuestionId": "17", "paidOnly": false, "title": "Letter Combinations of a Phone Number", "titleSlug": "letter-combinations-of-a-phone-number", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 2151000, "totalSubmissionRaw": 3503901}, "18": {"acRate": 36.57925676565267, "difficulty": "Medium", "likes": 11378, "dislikes": 1403, "categoryTitle": "Algorithms", "frontendQuestionId": "18", "paidOnly": false, "title": "4Sum", "titleSlug": "4sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1030754, "totalSubmissionRaw": 2817865}, "19": {"acRate": 46.353898125057945, "difficulty": "Medium", "likes": 18973, "dislikes": 815, "categoryTitle": "Algorithms", "frontendQuestionId": "19", "paidOnly": false, "title": "Remove Nth Node From End of List", "titleSlug": "remove-nth-node-from-end-of-list", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 2904761, "totalSubmissionRaw": 6266487}, "20": {"acRate": 40.867825427717726, "difficulty": "Easy", "likes": 24210, "dislikes": 1787, "categoryTitle": "Algorithms", "frontendQuestionId": "20", "paidOnly": false, "title": "Valid Parentheses", "titleSlug": "valid-parentheses", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 4945365, "totalSubmissionRaw": 12100873}, "21": {"acRate": 65.01370701556985, "difficulty": "Easy", "likes": 21931, "dislikes": 2140, "categoryTitle": "Algorithms", "frontendQuestionId": "21", "paidOnly": false, "title": "Merge Two Sorted Lists", "titleSlug": "merge-two-sorted-lists", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 4428861, "totalSubmissionRaw": 6812197}, "22": {"acRate": 75.26973160329045, "difficulty": "Medium", "likes": 21225, "dislikes": 962, "categoryTitle": "Algorithms", "frontendQuestionId": "22", "paidOnly": false, "title": "Generate Parentheses", "titleSlug": "generate-parentheses", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 1948136, "totalSubmissionRaw": 2588206}, "23": {"acRate": 53.78418240842514, "difficulty": "Hard", "likes": 19549, "dislikes": 721, "categoryTitle": "Algorithms", "frontendQuestionId": "23", "paidOnly": false, "title": "Merge k Sorted Lists", "titleSlug": "merge-k-sorted-lists", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Merge Sort", "id": "VG9waWNUYWdOb2RlOjYxMDUx", "slug": "merge-sort"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 2104081, "totalSubmissionRaw": 3912088}, "24": {"acRate": 65.03265799129424, "difficulty": "Medium", "likes": 11991, "dislikes": 450, "categoryTitle": "Algorithms", "frontendQuestionId": "24", "paidOnly": false, "title": "Swap Nodes in Pairs", "titleSlug": "swap-nodes-in-pairs", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1426780, "totalSubmissionRaw": 2193946}, "25": {"acRate": 59.98584256501102, "difficulty": "Hard", "likes": 13797, "dislikes": 708, "categoryTitle": "Algorithms", "frontendQuestionId": "25", "paidOnly": false, "title": "Reverse Nodes in k-Group", "titleSlug": "reverse-nodes-in-k-group", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1001639, "totalSubmissionRaw": 1669793}, "26": {"acRate": 57.14730303058454, "difficulty": "Easy", "likes": 14865, "dislikes": 18812, "categoryTitle": "Algorithms", "frontendQuestionId": "26", "paidOnly": false, "title": "Remove Duplicates from Sorted Array", "titleSlug": "remove-duplicates-from-sorted-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 4798203, "totalSubmissionRaw": 8396202}, "27": {"acRate": 57.83417175822444, "difficulty": "Easy", "likes": 2707, "dislikes": 3796, "categoryTitle": "Algorithms", "frontendQuestionId": "27", "paidOnly": false, "title": "Remove Element", "titleSlug": "remove-element", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 3224679, "totalSubmissionRaw": 5575733}, "28": {"acRate": 43.151283135786564, "difficulty": "Easy", "likes": 5944, "dislikes": 427, "categoryTitle": "Algorithms", "frontendQuestionId": "28", "paidOnly": false, "title": "Find the Index of the First Occurrence in a String", "titleSlug": "find-the-index-of-the-first-occurrence-in-a-string", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 2670941, "totalSubmissionRaw": 6189725}, "29": {"acRate": 17.690770591142556, "difficulty": "Medium", "likes": 5202, "dislikes": 14842, "categoryTitle": "Algorithms", "frontendQuestionId": "29", "paidOnly": false, "title": "Divide Two Integers", "titleSlug": "divide-two-integers", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 789264, "totalSubmissionRaw": 4461437}, "30": {"acRate": 32.58395732126919, "difficulty": "Hard", "likes": 1893, "dislikes": 272, "categoryTitle": "Algorithms", "frontendQuestionId": "30", "paidOnly": false, "title": "Substring with Concatenation of All Words", "titleSlug": "substring-with-concatenation-of-all-words", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 478237, "totalSubmissionRaw": 1467701}, "31": {"acRate": 40.79919933849629, "difficulty": "Medium", "likes": 18527, "dislikes": 4711, "categoryTitle": "Algorithms", "frontendQuestionId": "31", "paidOnly": false, "title": "Next Permutation", "titleSlug": "next-permutation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 1456551, "totalSubmissionRaw": 3570048}, "32": {"acRate": 34.60548439117295, "difficulty": "Hard", "likes": 12392, "dislikes": 411, "categoryTitle": "Algorithms", "frontendQuestionId": "32", "paidOnly": false, "title": "Longest Valid Parentheses", "titleSlug": "longest-valid-parentheses", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 775311, "totalSubmissionRaw": 2240426}, "33": {"acRate": 41.31921127793067, "difficulty": "Medium", "likes": 26427, "dislikes": 1596, "categoryTitle": "Algorithms", "frontendQuestionId": "33", "paidOnly": false, "title": "Search in Rotated Sorted Array", "titleSlug": "search-in-rotated-sorted-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 2939926, "totalSubmissionRaw": 7115154}, "34": {"acRate": 44.96128406544917, "difficulty": "Medium", "likes": 20610, "dislikes": 525, "categoryTitle": "Algorithms", "frontendQuestionId": "34", "paidOnly": false, "title": "Find First and Last Position of Element in Sorted Array", "titleSlug": "find-first-and-last-position-of-element-in-sorted-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 2182562, "totalSubmissionRaw": 4854316}, "35": {"acRate": 46.82964363650428, "difficulty": "Easy", "likes": 16287, "dislikes": 755, "categoryTitle": "Algorithms", "frontendQuestionId": "35", "paidOnly": false, "title": "Search Insert Position", "titleSlug": "search-insert-position", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 3099623, "totalSubmissionRaw": 6618945}, "36": {"acRate": 60.34742586255742, "difficulty": "Medium", "likes": 10776, "dislikes": 1137, "categoryTitle": "Algorithms", "frontendQuestionId": "36", "paidOnly": false, "title": "Valid Sudoku", "titleSlug": "valid-sudoku", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1627408, "totalSubmissionRaw": 2696737}, "37": {"acRate": 62.41814835585817, "difficulty": "Hard", "likes": 9583, "dislikes": 264, "categoryTitle": "Algorithms", "frontendQuestionId": "37", "paidOnly": false, "title": "Sudoku Solver", "titleSlug": "sudoku-solver", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 632174, "totalSubmissionRaw": 1012806}, "38": {"acRate": 56.06501460581582, "difficulty": "Medium", "likes": 4041, "dislikes": 8362, "categoryTitle": "Algorithms", "frontendQuestionId": "38", "paidOnly": false, "title": "Count and Say", "titleSlug": "count-and-say", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 973070, "totalSubmissionRaw": 1735610}, "39": {"acRate": 72.42568191180382, "difficulty": "Medium", "likes": 18935, "dislikes": 426, "categoryTitle": "Algorithms", "frontendQuestionId": "39", "paidOnly": false, "title": "Combination Sum", "titleSlug": "combination-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 2083419, "totalSubmissionRaw": 2876635}, "40": {"acRate": 56.24877419253611, "difficulty": "Medium", "likes": 10990, "dislikes": 320, "categoryTitle": "Algorithms", "frontendQuestionId": "40", "paidOnly": false, "title": "Combination Sum II", "titleSlug": "combination-sum-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1147177, "totalSubmissionRaw": 2039471}, "41": {"acRate": 39.830062717490094, "difficulty": "Hard", "likes": 16894, "dislikes": 1864, "categoryTitle": "Algorithms", "frontendQuestionId": "41", "paidOnly": false, "title": "First Missing Positive", "titleSlug": "first-missing-positive", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1269122, "totalSubmissionRaw": 3186347}, "42": {"acRate": 62.81038191794257, "difficulty": "Hard", "likes": 32228, "dislikes": 525, "categoryTitle": "Algorithms", "frontendQuestionId": "42", "paidOnly": false, "title": "Trapping Rain Water", "titleSlug": "trapping-rain-water", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 2267168, "totalSubmissionRaw": 3609541}, "43": {"acRate": 40.822418644775674, "difficulty": "Medium", "likes": 7093, "dislikes": 3361, "categoryTitle": "Algorithms", "frontendQuestionId": "43", "paidOnly": false, "title": "Multiply Strings", "titleSlug": "multiply-strings", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 834726, "totalSubmissionRaw": 2044788}, "44": {"acRate": 28.437041083783093, "difficulty": "Hard", "likes": 8295, "dislikes": 354, "categoryTitle": "Algorithms", "frontendQuestionId": "44", "paidOnly": false, "title": "Wildcard Matching", "titleSlug": "wildcard-matching", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 607456, "totalSubmissionRaw": 2136146}, "45": {"acRate": 40.63920797988311, "difficulty": "Medium", "likes": 14662, "dislikes": 589, "categoryTitle": "Algorithms", "frontendQuestionId": "45", "paidOnly": false, "title": "Jump Game II", "titleSlug": "jump-game-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1356412, "totalSubmissionRaw": 3337693}, "46": {"acRate": 79.02093756455973, "difficulty": "Medium", "likes": 19152, "dislikes": 329, "categoryTitle": "Algorithms", "frontendQuestionId": "46", "paidOnly": false, "title": "Permutations", "titleSlug": "permutations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 2199369, "totalSubmissionRaw": 2783274}, "47": {"acRate": 59.82770748686252, "difficulty": "Medium", "likes": 8541, "dislikes": 146, "categoryTitle": "Algorithms", "frontendQuestionId": "47", "paidOnly": false, "title": "Permutations II", "titleSlug": "permutations-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 968743, "totalSubmissionRaw": 1619222}, "48": {"acRate": 75.49969611836983, "difficulty": "Medium", "likes": 17703, "dislikes": 822, "categoryTitle": "Algorithms", "frontendQuestionId": "48", "paidOnly": false, "title": "Rotate Image", "titleSlug": "rotate-image", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1855920, "totalSubmissionRaw": 2458183}, "49": {"acRate": 69.17610846681285, "difficulty": "Medium", "likes": 19358, "dislikes": 631, "categoryTitle": "Algorithms", "frontendQuestionId": "49", "paidOnly": false, "title": "Group Anagrams", "titleSlug": "group-anagrams", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 3078491, "totalSubmissionRaw": 4450229}, "50": {"acRate": 35.33899571412597, "difficulty": "Medium", "likes": 9848, "dislikes": 9573, "categoryTitle": "Algorithms", "frontendQuestionId": "50", "paidOnly": false, "title": "Pow(x, n)", "titleSlug": "powx-n", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1785544, "totalSubmissionRaw": 5052606}, "51": {"acRate": 69.5736322323987, "difficulty": "Hard", "likes": 12454, "dislikes": 291, "categoryTitle": "Algorithms", "frontendQuestionId": "51", "paidOnly": false, "title": "N-Queens", "titleSlug": "n-queens", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 784019, "totalSubmissionRaw": 1126891}, "52": {"acRate": 74.7067703044648, "difficulty": "Hard", "likes": 3875, "dislikes": 266, "categoryTitle": "Algorithms", "frontendQuestionId": "52", "paidOnly": false, "title": "N-Queens II", "titleSlug": "n-queens-ii", "topicTags": [{"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 411266, "totalSubmissionRaw": 550507}, "53": {"acRate": 51.0484515290368, "difficulty": "Medium", "likes": 34192, "dislikes": 1448, "categoryTitle": "Algorithms", "frontendQuestionId": "53", "paidOnly": false, "title": "Maximum Subarray", "titleSlug": "maximum-subarray", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 4137101, "totalSubmissionRaw": 8104270}, "54": {"acRate": 50.79706707050738, "difficulty": "Medium", "likes": 14940, "dislikes": 1326, "categoryTitle": "Algorithms", "frontendQuestionId": "54", "paidOnly": false, "title": "Spiral Matrix", "titleSlug": "spiral-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1538599, "totalSubmissionRaw": 3028911}, "55": {"acRate": 38.700414552612756, "difficulty": "Medium", "likes": 19493, "dislikes": 1256, "categoryTitle": "Algorithms", "frontendQuestionId": "55", "paidOnly": false, "title": "Jump Game", "titleSlug": "jump-game", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 2071345, "totalSubmissionRaw": 5352256}, "56": {"acRate": 47.80373757574116, "difficulty": "Medium", "likes": 22312, "dislikes": 785, "categoryTitle": "Algorithms", "frontendQuestionId": "56", "paidOnly": false, "title": "Merge Intervals", "titleSlug": "merge-intervals", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 2558899, "totalSubmissionRaw": 5352924}, "57": {"acRate": 42.01800148247503, "difficulty": "Medium", "likes": 10442, "dislikes": 821, "categoryTitle": "Algorithms", "frontendQuestionId": "57", "paidOnly": false, "title": "Insert Interval", "titleSlug": "insert-interval", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1190412, "totalSubmissionRaw": 2833100}, "58": {"acRate": 53.17203725354148, "difficulty": "Easy", "likes": 5271, "dislikes": 290, "categoryTitle": "Algorithms", "frontendQuestionId": "58", "paidOnly": false, "title": "Length of Last Word", "titleSlug": "length-of-last-word", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 2174861, "totalSubmissionRaw": 4090238}, "59": {"acRate": 71.81121825116104, "difficulty": "Medium", "likes": 6419, "dislikes": 265, "categoryTitle": "Algorithms", "frontendQuestionId": "59", "paidOnly": false, "title": "Spiral Matrix II", "titleSlug": "spiral-matrix-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 601964, "totalSubmissionRaw": 838259}, "60": {"acRate": 47.837086483267726, "difficulty": "Hard", "likes": 6701, "dislikes": 481, "categoryTitle": "Algorithms", "frontendQuestionId": "60", "paidOnly": false, "title": "Permutation Sequence", "titleSlug": "permutation-sequence", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 416937, "totalSubmissionRaw": 871578}, "61": {"acRate": 38.43419353075803, "difficulty": "Medium", "likes": 9761, "dislikes": 1453, "categoryTitle": "Algorithms", "frontendQuestionId": "61", "paidOnly": false, "title": "Rotate List", "titleSlug": "rotate-list", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1040850, "totalSubmissionRaw": 2708137}, "62": {"acRate": 64.67091974574286, "difficulty": "Medium", "likes": 16718, "dislikes": 449, "categoryTitle": "Algorithms", "frontendQuestionId": "62", "paidOnly": false, "title": "Unique Paths", "titleSlug": "unique-paths", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1952097, "totalSubmissionRaw": 3018509}, "63": {"acRate": 42.04214876623259, "difficulty": "Medium", "likes": 8794, "dislikes": 510, "categoryTitle": "Algorithms", "frontendQuestionId": "63", "paidOnly": false, "title": "Unique Paths II", "titleSlug": "unique-paths-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1000791, "totalSubmissionRaw": 2380453}, "64": {"acRate": 64.67110635940901, "difficulty": "Medium", "likes": 12503, "dislikes": 171, "categoryTitle": "Algorithms", "frontendQuestionId": "64", "paidOnly": false, "title": "Minimum Path Sum", "titleSlug": "minimum-path-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1255147, "totalSubmissionRaw": 1940812}, "65": {"acRate": 20.220784459012883, "difficulty": "Hard", "likes": 1265, "dislikes": 2010, "categoryTitle": "Algorithms", "frontendQuestionId": "65", "paidOnly": false, "title": "Valid Number", "titleSlug": "valid-number", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 381510, "totalSubmissionRaw": 1886726}, "66": {"acRate": 45.92163888688292, "difficulty": "Easy", "likes": 9434, "dislikes": 5410, "categoryTitle": "Algorithms", "frontendQuestionId": "66", "paidOnly": false, "title": "Plus One", "titleSlug": "plus-one", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 2403709, "totalSubmissionRaw": 5234362}, "67": {"acRate": 54.13774689283812, "difficulty": "Easy", "likes": 9460, "dislikes": 982, "categoryTitle": "Algorithms", "frontendQuestionId": "67", "paidOnly": false, "title": "Add Binary", "titleSlug": "add-binary", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1553131, "totalSubmissionRaw": 2868843}, "68": {"acRate": 44.65557166009111, "difficulty": "Hard", "likes": 3736, "dislikes": 4762, "categoryTitle": "Algorithms", "frontendQuestionId": "68", "paidOnly": false, "title": "Text Justification", "titleSlug": "text-justification", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 443340, "totalSubmissionRaw": 992805}, "69": {"acRate": 39.20883664177969, "difficulty": "Easy", "likes": 8242, "dislikes": 4516, "categoryTitle": "Algorithms", "frontendQuestionId": "69", "paidOnly": false, "title": "Sqrt(x)", "titleSlug": "sqrtx", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 2105705, "totalSubmissionRaw": 5370499}, "70": {"acRate": 53.058651167807135, "difficulty": "Easy", "likes": 22046, "dislikes": 850, "categoryTitle": "Algorithms", "frontendQuestionId": "70", "paidOnly": false, "title": "Climbing Stairs", "titleSlug": "climbing-stairs", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 3487925, "totalSubmissionRaw": 6573718}, "71": {"acRate": 43.711292688482914, "difficulty": "Medium", "likes": 5632, "dislikes": 1291, "categoryTitle": "Algorithms", "frontendQuestionId": "71", "paidOnly": false, "title": "Simplify Path", "titleSlug": "simplify-path", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 821262, "totalSubmissionRaw": 1878824}, "72": {"acRate": 57.131878172091476, "difficulty": "Medium", "likes": 14915, "dislikes": 235, "categoryTitle": "Algorithms", "frontendQuestionId": "72", "paidOnly": false, "title": "Edit Distance", "titleSlug": "edit-distance", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 932958, "totalSubmissionRaw": 1632990}, "73": {"acRate": 56.987155419714774, "difficulty": "Medium", "likes": 14624, "dislikes": 743, "categoryTitle": "Algorithms", "frontendQuestionId": "73", "paidOnly": false, "title": "Set Matrix Zeroes", "titleSlug": "set-matrix-zeroes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1554254, "totalSubmissionRaw": 2727376}, "74": {"acRate": 50.8097622770729, "difficulty": "Medium", "likes": 15859, "dislikes": 421, "categoryTitle": "Algorithms", "frontendQuestionId": "74", "paidOnly": false, "title": "Search a 2D Matrix", "titleSlug": "search-a-2d-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1925215, "totalSubmissionRaw": 3789068}, "75": {"acRate": 64.63256704524238, "difficulty": "Medium", "likes": 18659, "dislikes": 661, "categoryTitle": "Algorithms", "frontendQuestionId": "75", "paidOnly": false, "title": "Sort Colors", "titleSlug": "sort-colors", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 2277821, "totalSubmissionRaw": 3524262}, "76": {"acRate": 43.510908214443845, "difficulty": "Hard", "likes": 17965, "dislikes": 741, "categoryTitle": "Algorithms", "frontendQuestionId": "76", "paidOnly": false, "title": "Minimum Window Substring", "titleSlug": "minimum-window-substring", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1439662, "totalSubmissionRaw": 3308740}, "77": {"acRate": 71.04552793411499, "difficulty": "Medium", "likes": 8257, "dislikes": 229, "categoryTitle": "Algorithms", "frontendQuestionId": "77", "paidOnly": false, "title": "Combinations", "titleSlug": "combinations", "topicTags": [{"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 950907, "totalSubmissionRaw": 1338449}, "78": {"acRate": 78.97465847090567, "difficulty": "Medium", "likes": 17347, "dislikes": 284, "categoryTitle": "Algorithms", "frontendQuestionId": "78", "paidOnly": false, "title": "Subsets", "titleSlug": "subsets", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 2078417, "totalSubmissionRaw": 2631752}, "79": {"acRate": 43.40619579684196, "difficulty": "Medium", "likes": 15952, "dislikes": 675, "categoryTitle": "Algorithms", "frontendQuestionId": "79", "paidOnly": false, "title": "Word Search", "titleSlug": "word-search", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1768275, "totalSubmissionRaw": 4073785}, "80": {"acRate": 59.71159459246649, "difficulty": "Medium", "likes": 6986, "dislikes": 1348, "categoryTitle": "Algorithms", "frontendQuestionId": "80", "paidOnly": false, "title": "Remove Duplicates from Sorted Array II", "titleSlug": "remove-duplicates-from-sorted-array-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1099590, "totalSubmissionRaw": 1841502}, "81": {"acRate": 38.03787619765481, "difficulty": "Medium", "likes": 8538, "dislikes": 1049, "categoryTitle": "Algorithms", "frontendQuestionId": "81", "paidOnly": false, "title": "Search in Rotated Sorted Array II", "titleSlug": "search-in-rotated-sorted-array-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 783206, "totalSubmissionRaw": 2059019}, "82": {"acRate": 48.074833172390484, "difficulty": "Medium", "likes": 8858, "dislikes": 244, "categoryTitle": "Algorithms", "frontendQuestionId": "82", "paidOnly": false, "title": "Remove Duplicates from Sorted List II", "titleSlug": "remove-duplicates-from-sorted-list-ii", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 778130, "totalSubmissionRaw": 1618578}, "83": {"acRate": 53.17432252746927, "difficulty": "Easy", "likes": 8742, "dislikes": 310, "categoryTitle": "Algorithms", "frontendQuestionId": "83", "paidOnly": false, "title": "Remove Duplicates from Sorted List", "titleSlug": "remove-duplicates-from-sorted-list", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 1618012, "totalSubmissionRaw": 3042846}, "84": {"acRate": 45.22662610743655, "difficulty": "Hard", "likes": 17332, "dislikes": 292, "categoryTitle": "Algorithms", "frontendQuestionId": "84", "paidOnly": false, "title": "Largest Rectangle in Histogram", "titleSlug": "largest-rectangle-in-histogram", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 962829, "totalSubmissionRaw": 2128898}, "85": {"acRate": 51.347584108768714, "difficulty": "Hard", "likes": 10609, "dislikes": 185, "categoryTitle": "Algorithms", "frontendQuestionId": "85", "paidOnly": false, "title": "Maximal Rectangle", "titleSlug": "maximal-rectangle", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 512414, "totalSubmissionRaw": 997932}, "86": {"acRate": 56.961427141987585, "difficulty": "Medium", "likes": 7370, "dislikes": 881, "categoryTitle": "Algorithms", "frontendQuestionId": "86", "paidOnly": false, "title": "Partition List", "titleSlug": "partition-list", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 656933, "totalSubmissionRaw": 1153295}, "87": {"acRate": 40.568048552914284, "difficulty": "Hard", "likes": 3337, "dislikes": 1281, "categoryTitle": "Algorithms", "frontendQuestionId": "87", "paidOnly": false, "title": "Scramble String", "titleSlug": "scramble-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 236960, "totalSubmissionRaw": 584105}, "88": {"acRate": 50.663970973199234, "difficulty": "Easy", "likes": 15160, "dislikes": 1995, "categoryTitle": "Algorithms", "frontendQuestionId": "88", "paidOnly": false, "title": "Merge Sorted Array", "titleSlug": "merge-sorted-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 3497256, "totalSubmissionRaw": 6902850}, "89": {"acRate": 59.83725948222096, "difficulty": "Medium", "likes": 2259, "dislikes": 2725, "categoryTitle": "Algorithms", "frontendQuestionId": "89", "paidOnly": false, "title": "Gray Code", "titleSlug": "gray-code", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 308929, "totalSubmissionRaw": 516282}, "90": {"acRate": 57.89569084344301, "difficulty": "Medium", "likes": 9805, "dislikes": 321, "categoryTitle": "Algorithms", "frontendQuestionId": "90", "paidOnly": false, "title": "Subsets II", "titleSlug": "subsets-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 993340, "totalSubmissionRaw": 1715745}, "91": {"acRate": 35.30503132269643, "difficulty": "Medium", "likes": 11968, "dislikes": 4526, "categoryTitle": "Algorithms", "frontendQuestionId": "91", "paidOnly": false, "title": "Decode Ways", "titleSlug": "decode-ways", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 1299872, "totalSubmissionRaw": 3681834}, "92": {"acRate": 48.1469217516883, "difficulty": "Medium", "likes": 11675, "dislikes": 626, "categoryTitle": "Algorithms", "frontendQuestionId": "92", "paidOnly": false, "title": "Reverse Linked List II", "titleSlug": "reverse-linked-list-ii", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 917490, "totalSubmissionRaw": 1905603}, "93": {"acRate": 50.76232122602489, "difficulty": "Medium", "likes": 5242, "dislikes": 791, "categoryTitle": "Algorithms", "frontendQuestionId": "93", "paidOnly": false, "title": "Restore IP Addresses", "titleSlug": "restore-ip-addresses", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 476173, "totalSubmissionRaw": 938050}, "94": {"acRate": 76.83406656066828, "difficulty": "Easy", "likes": 13543, "dislikes": 798, "categoryTitle": "Algorithms", "frontendQuestionId": "94", "paidOnly": false, "title": "Binary Tree Inorder Traversal", "titleSlug": "binary-tree-inorder-traversal", "topicTags": [{"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 2674736, "totalSubmissionRaw": 3481185}, "95": {"acRate": 58.43440632157984, "difficulty": "Medium", "likes": 7578, "dislikes": 525, "categoryTitle": "Algorithms", "frontendQuestionId": "95", "paidOnly": false, "title": "Unique Binary Search Trees II", "titleSlug": "unique-binary-search-trees-ii", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 465065, "totalSubmissionRaw": 795876}, "96": {"acRate": 61.41180081194295, "difficulty": "Medium", "likes": 10380, "dislikes": 407, "categoryTitle": "Algorithms", "frontendQuestionId": "96", "paidOnly": false, "title": "Unique Binary Search Trees", "titleSlug": "unique-binary-search-trees", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 684350, "totalSubmissionRaw": 1114363}, "97": {"acRate": 40.44384959564892, "difficulty": "Medium", "likes": 8244, "dislikes": 487, "categoryTitle": "Algorithms", "frontendQuestionId": "97", "paidOnly": false, "title": "Interleaving String", "titleSlug": "interleaving-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 550569, "totalSubmissionRaw": 1361317}, "98": {"acRate": 33.28480978386, "difficulty": "Medium", "likes": 16902, "dislikes": 1382, "categoryTitle": "Algorithms", "frontendQuestionId": "98", "paidOnly": false, "title": "Validate Binary Search Tree", "titleSlug": "validate-binary-search-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 2464848, "totalSubmissionRaw": 7405312}, "99": {"acRate": 53.979951189652844, "difficulty": "Medium", "likes": 7944, "dislikes": 258, "categoryTitle": "Algorithms", "frontendQuestionId": "99", "paidOnly": false, "title": "Recover Binary Search Tree", "titleSlug": "recover-binary-search-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 475319, "totalSubmissionRaw": 880549}, "100": {"acRate": 63.00987070989963, "difficulty": "Easy", "likes": 11622, "dislikes": 242, "categoryTitle": "Algorithms", "frontendQuestionId": "100", "paidOnly": false, "title": "Same Tree", "titleSlug": "same-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 2318214, "totalSubmissionRaw": 3679141}, "101": {"acRate": 57.285310455922975, "difficulty": "Easy", "likes": 15361, "dislikes": 385, "categoryTitle": "Algorithms", "frontendQuestionId": "101", "paidOnly": false, "title": "Symmetric Tree", "titleSlug": "symmetric-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 2103094, "totalSubmissionRaw": 3671269}, "102": {"acRate": 68.18459507877566, "difficulty": "Medium", "likes": 15394, "dislikes": 318, "categoryTitle": "Algorithms", "frontendQuestionId": "102", "paidOnly": false, "title": "Binary Tree Level Order Traversal", "titleSlug": "binary-tree-level-order-traversal", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 2378385, "totalSubmissionRaw": 3488167}, "103": {"acRate": 59.74278812947984, "difficulty": "Medium", "likes": 10885, "dislikes": 304, "categoryTitle": "Algorithms", "frontendQuestionId": "103", "paidOnly": false, "title": "Binary Tree Zigzag Level Order Traversal", "titleSlug": "binary-tree-zigzag-level-order-traversal", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1245570, "totalSubmissionRaw": 2084888}, "104": {"acRate": 75.92089075889716, "difficulty": "Easy", "likes": 12911, "dislikes": 232, "categoryTitle": "Algorithms", "frontendQuestionId": "104", "paidOnly": false, "title": "Maximum Depth of Binary Tree", "titleSlug": "maximum-depth-of-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 3309601, "totalSubmissionRaw": 4359286}, "105": {"acRate": 64.71091218679665, "difficulty": "Medium", "likes": 15081, "dislikes": 511, "categoryTitle": "Algorithms", "frontendQuestionId": "105", "paidOnly": false, "title": "Construct Binary Tree from Preorder and Inorder Traversal", "titleSlug": "construct-binary-tree-from-preorder-and-inorder-traversal", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1310748, "totalSubmissionRaw": 2025548}, "106": {"acRate": 63.921548715171205, "difficulty": "Medium", "likes": 8048, "dislikes": 132, "categoryTitle": "Algorithms", "frontendQuestionId": "106", "paidOnly": false, "title": "Construct Binary Tree from Inorder and Postorder Traversal", "titleSlug": "construct-binary-tree-from-inorder-and-postorder-traversal", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 679797, "totalSubmissionRaw": 1063487}, "107": {"acRate": 64.07186376828308, "difficulty": "Medium", "likes": 4875, "dislikes": 323, "categoryTitle": "Algorithms", "frontendQuestionId": "107", "paidOnly": false, "title": "Binary Tree Level Order Traversal II", "titleSlug": "binary-tree-level-order-traversal-ii", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 666719, "totalSubmissionRaw": 1040580}, "108": {"acRate": 72.37486157316879, "difficulty": "Easy", "likes": 11007, "dislikes": 564, "categoryTitle": "Algorithms", "frontendQuestionId": "108", "paidOnly": false, "title": "Convert Sorted Array to Binary Search Tree", "titleSlug": "convert-sorted-array-to-binary-search-tree", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 1266573, "totalSubmissionRaw": 1750017}, "109": {"acRate": 62.54921900282502, "difficulty": "Medium", "likes": 7469, "dislikes": 162, "categoryTitle": "Algorithms", "frontendQuestionId": "109", "paidOnly": false, "title": "Convert Sorted List to Binary Search Tree", "titleSlug": "convert-sorted-list-to-binary-search-tree", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 543122, "totalSubmissionRaw": 868312}, "110": {"acRate": 53.069199165850236, "difficulty": "Easy", "likes": 10784, "dislikes": 703, "categoryTitle": "Algorithms", "frontendQuestionId": "110", "paidOnly": false, "title": "Balanced Binary Tree", "titleSlug": "balanced-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1601200, "totalSubmissionRaw": 3017197}, "111": {"acRate": 48.71478646196682, "difficulty": "Easy", "likes": 7312, "dislikes": 1312, "categoryTitle": "Algorithms", "frontendQuestionId": "111", "paidOnly": false, "title": "Minimum Depth of Binary Tree", "titleSlug": "minimum-depth-of-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1254130, "totalSubmissionRaw": 2574432}, "112": {"acRate": 51.1142754577796, "difficulty": "Easy", "likes": 9726, "dislikes": 1119, "categoryTitle": "Algorithms", "frontendQuestionId": "112", "paidOnly": false, "title": "Path Sum", "titleSlug": "path-sum", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1539213, "totalSubmissionRaw": 3011318}, "113": {"acRate": 58.99087074096968, "difficulty": "Medium", "likes": 7978, "dislikes": 155, "categoryTitle": "Algorithms", "frontendQuestionId": "113", "paidOnly": false, "title": "Path Sum II", "titleSlug": "path-sum-ii", "topicTags": [{"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 891332, "totalSubmissionRaw": 1510966}, "114": {"acRate": 66.00306529256397, "difficulty": "Medium", "likes": 12322, "dislikes": 564, "categoryTitle": "Algorithms", "frontendQuestionId": "114", "paidOnly": false, "title": "Flatten Binary Tree to Linked List", "titleSlug": "flatten-binary-tree-to-linked-list", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1008572, "totalSubmissionRaw": 1528071}, "115": {"acRate": 47.96512583225434, "difficulty": "Hard", "likes": 6668, "dislikes": 291, "categoryTitle": "Algorithms", "frontendQuestionId": "115", "paidOnly": false, "title": "Distinct Subsequences", "titleSlug": "distinct-subsequences", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 437862, "totalSubmissionRaw": 912879}, "116": {"acRate": 63.41021171019832, "difficulty": "Medium", "likes": 9753, "dislikes": 304, "categoryTitle": "Algorithms", "frontendQuestionId": "116", "paidOnly": false, "title": "Populating Next Right Pointers in Each Node", "titleSlug": "populating-next-right-pointers-in-each-node", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1079569, "totalSubmissionRaw": 1702516}, "117": {"acRate": 53.29445397925894, "difficulty": "Medium", "likes": 5859, "dislikes": 322, "categoryTitle": "Algorithms", "frontendQuestionId": "117", "paidOnly": false, "title": "Populating Next Right Pointers in Each Node II", "titleSlug": "populating-next-right-pointers-in-each-node-ii", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 657691, "totalSubmissionRaw": 1234072}, "118": {"acRate": 75.10997863368814, "difficulty": "Easy", "likes": 12940, "dislikes": 458, "categoryTitle": "Algorithms", "frontendQuestionId": "118", "paidOnly": false, "title": "Pascal's Triangle", "titleSlug": "pascals-triangle", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 1778057, "totalSubmissionRaw": 2367273}, "119": {"acRate": 64.50324324626845, "difficulty": "Easy", "likes": 4848, "dislikes": 344, "categoryTitle": "Algorithms", "frontendQuestionId": "119", "paidOnly": false, "title": "Pascal's Triangle II", "titleSlug": "pascals-triangle-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 922030, "totalSubmissionRaw": 1429432}, "120": {"acRate": 57.44041149710068, "difficulty": "Medium", "likes": 9576, "dislikes": 561, "categoryTitle": "Algorithms", "frontendQuestionId": "120", "paidOnly": false, "title": "Triangle", "titleSlug": "triangle", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 816537, "totalSubmissionRaw": 1421538}, "121": {"acRate": 54.00915255418154, "difficulty": "Easy", "likes": 31186, "dislikes": 1174, "categoryTitle": "Algorithms", "frontendQuestionId": "121", "paidOnly": false, "title": "Best Time to Buy and Sell Stock", "titleSlug": "best-time-to-buy-and-sell-stock", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 5054320, "totalSubmissionRaw": 9358266}, "122": {"acRate": 67.37327940900367, "difficulty": "Medium", "likes": 13686, "dislikes": 2710, "categoryTitle": "Algorithms", "frontendQuestionId": "122", "paidOnly": false, "title": "Best Time to Buy and Sell Stock II", "titleSlug": "best-time-to-buy-and-sell-stock-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 2056177, "totalSubmissionRaw": 3051920}, "123": {"acRate": 48.9165531763365, "difficulty": "Hard", "likes": 9707, "dislikes": 195, "categoryTitle": "Algorithms", "frontendQuestionId": "123", "paidOnly": false, "title": "Best Time to Buy and Sell Stock III", "titleSlug": "best-time-to-buy-and-sell-stock-iii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 649762, "totalSubmissionRaw": 1328307}, "124": {"acRate": 40.2982492836975, "difficulty": "Hard", "likes": 16751, "dislikes": 737, "categoryTitle": "Algorithms", "frontendQuestionId": "124", "paidOnly": false, "title": "Binary Tree Maximum Path Sum", "titleSlug": "binary-tree-maximum-path-sum", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1313916, "totalSubmissionRaw": 3260482}, "125": {"acRate": 48.42182675753738, "difficulty": "Easy", "likes": 9462, "dislikes": 8387, "categoryTitle": "Algorithms", "frontendQuestionId": "125", "paidOnly": false, "title": "Valid Palindrome", "titleSlug": "valid-palindrome", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 3267099, "totalSubmissionRaw": 6747161}, "126": {"acRate": 27.188376047094554, "difficulty": "Hard", "likes": 6032, "dislikes": 753, "categoryTitle": "Algorithms", "frontendQuestionId": "126", "paidOnly": false, "title": "Word Ladder II", "titleSlug": "word-ladder-ii", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 375623, "totalSubmissionRaw": 1381560}, "127": {"acRate": 40.09302150523126, "difficulty": "Hard", "likes": 12126, "dislikes": 1881, "categoryTitle": "Algorithms", "frontendQuestionId": "127", "paidOnly": false, "title": "Word Ladder", "titleSlug": "word-ladder", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 1129137, "totalSubmissionRaw": 2816306}, "128": {"acRate": 47.36125019024086, "difficulty": "Medium", "likes": 20152, "dislikes": 1033, "categoryTitle": "Algorithms", "frontendQuestionId": "128", "paidOnly": false, "title": "Longest Consecutive Sequence", "titleSlug": "longest-consecutive-sequence", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1954274, "totalSubmissionRaw": 4126323}, "129": {"acRate": 66.48289203760389, "difficulty": "Medium", "likes": 8070, "dislikes": 144, "categoryTitle": "Algorithms", "frontendQuestionId": "129", "paidOnly": false, "title": "Sum Root to Leaf Numbers", "titleSlug": "sum-root-to-leaf-numbers", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 927199, "totalSubmissionRaw": 1394643}, "130": {"acRate": 40.446462153236425, "difficulty": "Medium", "likes": 8695, "dislikes": 1877, "categoryTitle": "Algorithms", "frontendQuestionId": "130", "paidOnly": false, "title": "Surrounded Regions", "titleSlug": "surrounded-regions", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 764586, "totalSubmissionRaw": 1890361}, "131": {"acRate": 70.03030365957851, "difficulty": "Medium", "likes": 12920, "dislikes": 502, "categoryTitle": "Algorithms", "frontendQuestionId": "131", "paidOnly": false, "title": "Palindrome Partitioning", "titleSlug": "palindrome-partitioning", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 944255, "totalSubmissionRaw": 1348352}, "132": {"acRate": 34.23321607144098, "difficulty": "Hard", "likes": 5475, "dislikes": 138, "categoryTitle": "Algorithms", "frontendQuestionId": "132", "paidOnly": false, "title": "Palindrome Partitioning II", "titleSlug": "palindrome-partitioning-ii", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 295636, "totalSubmissionRaw": 863594}, "133": {"acRate": 58.624630015904124, "difficulty": "Medium", "likes": 9544, "dislikes": 3850, "categoryTitle": "Algorithms", "frontendQuestionId": "133", "paidOnly": false, "title": "Clone Graph", "titleSlug": "clone-graph", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1313355, "totalSubmissionRaw": 2240287}, "134": {"acRate": 45.5712760514324, "difficulty": "Medium", "likes": 12051, "dislikes": 1176, "categoryTitle": "Algorithms", "frontendQuestionId": "134", "paidOnly": false, "title": "Gas Station", "titleSlug": "gas-station", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 873738, "totalSubmissionRaw": 1917284}, "135": {"acRate": 43.702149640642524, "difficulty": "Hard", "likes": 7905, "dislikes": 669, "categoryTitle": "Algorithms", "frontendQuestionId": "135", "paidOnly": false, "title": "Candy", "titleSlug": "candy", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 577838, "totalSubmissionRaw": 1322217}, "136": {"acRate": 73.79247716175776, "difficulty": "Easy", "likes": 16568, "dislikes": 732, "categoryTitle": "Algorithms", "frontendQuestionId": "136", "paidOnly": false, "title": "Single Number", "titleSlug": "single-number", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 2998439, "totalSubmissionRaw": 4063345}, "137": {"acRate": 63.50132663644686, "difficulty": "Medium", "likes": 7967, "dislikes": 694, "categoryTitle": "Algorithms", "frontendQuestionId": "137", "paidOnly": false, "title": "Single Number II", "titleSlug": "single-number-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 626332, "totalSubmissionRaw": 986329}, "138": {"acRate": 57.26750851164427, "difficulty": "Medium", "likes": 13941, "dislikes": 1487, "categoryTitle": "Algorithms", "frontendQuestionId": "138", "paidOnly": false, "title": "Copy List with Random Pointer", "titleSlug": "copy-list-with-random-pointer", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1326279, "totalSubmissionRaw": 2315939}, "139": {"acRate": 47.11061182016124, "difficulty": "Medium", "likes": 17253, "dislikes": 796, "categoryTitle": "Algorithms", "frontendQuestionId": "139", "paidOnly": false, "title": "Word Break", "titleSlug": "word-break", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 1763810, "totalSubmissionRaw": 3743975}, "140": {"acRate": 51.466487250054804, "difficulty": "Hard", "likes": 7210, "dislikes": 538, "categoryTitle": "Algorithms", "frontendQuestionId": "140", "paidOnly": false, "title": "Word Break II", "titleSlug": "word-break-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 676205, "totalSubmissionRaw": 1313880}, "141": {"acRate": 50.944601882527905, "difficulty": "Easy", "likes": 15591, "dislikes": 1387, "categoryTitle": "Algorithms", "frontendQuestionId": "141", "paidOnly": false, "title": "Linked List Cycle", "titleSlug": "linked-list-cycle", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 3189820, "totalSubmissionRaw": 6261344}, "142": {"acRate": 52.28506274066167, "difficulty": "Medium", "likes": 13653, "dislikes": 968, "categoryTitle": "Algorithms", "frontendQuestionId": "142", "paidOnly": false, "title": "Linked List Cycle II", "titleSlug": "linked-list-cycle-ii", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1375901, "totalSubmissionRaw": 2631540}, "143": {"acRate": 59.7383552700973, "difficulty": "Medium", "likes": 11166, "dislikes": 411, "categoryTitle": "Algorithms", "frontendQuestionId": "143", "paidOnly": false, "title": "Reorder List", "titleSlug": "reorder-list", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1047746, "totalSubmissionRaw": 1753896}, "144": {"acRate": 70.48675833552113, "difficulty": "Easy", "likes": 8019, "dislikes": 211, "categoryTitle": "Algorithms", "frontendQuestionId": "144", "paidOnly": false, "title": "Binary Tree Preorder Traversal", "titleSlug": "binary-tree-preorder-traversal", "topicTags": [{"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1718294, "totalSubmissionRaw": 2437756}, "145": {"acRate": 72.02607192897881, "difficulty": "Easy", "likes": 6923, "dislikes": 193, "categoryTitle": "Algorithms", "frontendQuestionId": "145", "paidOnly": false, "title": "Binary Tree Postorder Traversal", "titleSlug": "binary-tree-postorder-traversal", "topicTags": [{"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1277421, "totalSubmissionRaw": 1773554}, "146": {"acRate": 43.0353014399583, "difficulty": "Medium", "likes": 20825, "dislikes": 1047, "categoryTitle": "Algorithms", "frontendQuestionId": "146", "paidOnly": false, "title": "LRU Cache", "titleSlug": "lru-cache", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Doubly-Linked List", "id": "VG9waWNUYWdOb2RlOjYxMDU4", "slug": "doubly-linked-list"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1727219, "totalSubmissionRaw": 4013503}, "147": {"acRate": 54.30879293177514, "difficulty": "Medium", "likes": 3116, "dislikes": 867, "categoryTitle": "Algorithms", "frontendQuestionId": "147", "paidOnly": false, "title": "Insertion Sort List", "titleSlug": "insertion-sort-list", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 383438, "totalSubmissionRaw": 706033}, "148": {"acRate": 59.11911877128362, "difficulty": "Medium", "likes": 11691, "dislikes": 352, "categoryTitle": "Algorithms", "frontendQuestionId": "148", "paidOnly": false, "title": "Sort List", "titleSlug": "sort-list", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Merge Sort", "id": "VG9waWNUYWdOb2RlOjYxMDUx", "slug": "merge-sort"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 850662, "totalSubmissionRaw": 1438897}, "149": {"acRate": 27.322220782465006, "difficulty": "Hard", "likes": 4202, "dislikes": 503, "categoryTitle": "Algorithms", "frontendQuestionId": "149", "paidOnly": false, "title": "Max Points on a Line", "titleSlug": "max-points-on-a-line", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 409056, "totalSubmissionRaw": 1497158}, "150": {"acRate": 52.38452822064866, "difficulty": "Medium", "likes": 7694, "dislikes": 1096, "categoryTitle": "Algorithms", "frontendQuestionId": "150", "paidOnly": false, "title": "Evaluate Reverse Polish Notation", "titleSlug": "evaluate-reverse-polish-notation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1126618, "totalSubmissionRaw": 2150671}, "151": {"acRate": 45.27577023181022, "difficulty": "Medium", "likes": 8547, "dislikes": 5198, "categoryTitle": "Algorithms", "frontendQuestionId": "151", "paidOnly": false, "title": "Reverse Words in a String", "titleSlug": "reverse-words-in-a-string", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1719201, "totalSubmissionRaw": 3797190}, "152": {"acRate": 33.84913907154967, "difficulty": "Medium", "likes": 18587, "dislikes": 703, "categoryTitle": "Algorithms", "frontendQuestionId": "152", "paidOnly": false, "title": "Maximum Product Subarray", "titleSlug": "maximum-product-subarray", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1347060, "totalSubmissionRaw": 3979599}, "153": {"acRate": 51.07487327720375, "difficulty": "Medium", "likes": 13313, "dislikes": 592, "categoryTitle": "Algorithms", "frontendQuestionId": "153", "paidOnly": false, "title": "Find Minimum in Rotated Sorted Array", "titleSlug": "find-minimum-in-rotated-sorted-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1954249, "totalSubmissionRaw": 3826237}, "154": {"acRate": 43.71412604456174, "difficulty": "Hard", "likes": 4692, "dislikes": 489, "categoryTitle": "Algorithms", "frontendQuestionId": "154", "paidOnly": false, "title": "Find Minimum in Rotated Sorted Array II", "titleSlug": "find-minimum-in-rotated-sorted-array-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 467770, "totalSubmissionRaw": 1070064}, "155": {"acRate": 54.781784417629844, "difficulty": "Medium", "likes": 14215, "dislikes": 881, "categoryTitle": "Algorithms", "frontendQuestionId": "155", "paidOnly": false, "title": "Min Stack", "titleSlug": "min-stack", "topicTags": [{"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1792693, "totalSubmissionRaw": 3272425}, "156": {"acRate": 63.09512933423475, "difficulty": "Medium", "likes": 263, "dislikes": 350, "categoryTitle": "Algorithms", "frontendQuestionId": "156", "paidOnly": true, "title": "Binary Tree Upside Down", "titleSlug": "binary-tree-upside-down", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 103594, "totalSubmissionRaw": 164187}, "157": {"acRate": 41.703278716769184, "difficulty": "Easy", "likes": 580, "dislikes": 3505, "categoryTitle": "Algorithms", "frontendQuestionId": "157", "paidOnly": true, "title": "Read N Characters Given Read4", "titleSlug": "read-n-characters-given-read4", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 193640, "totalSubmissionRaw": 464325}, "158": {"acRate": 42.45549166805856, "difficulty": "Hard", "likes": 869, "dislikes": 1804, "categoryTitle": "Algorithms", "frontendQuestionId": "158", "paidOnly": true, "title": "Read N Characters Given read4 II - Call Multiple Times", "titleSlug": "read-n-characters-given-read4-ii-call-multiple-times", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 185553, "totalSubmissionRaw": 437053}, "159": {"acRate": 55.619196900391024, "difficulty": "Medium", "likes": 2215, "dislikes": 36, "categoryTitle": "Algorithms", "frontendQuestionId": "159", "paidOnly": true, "title": "Longest Substring with At Most Two Distinct Characters", "titleSlug": "longest-substring-with-at-most-two-distinct-characters", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 264709, "totalSubmissionRaw": 475931}, "160": {"acRate": 58.5122747001527, "difficulty": "Easy", "likes": 15047, "dislikes": 1365, "categoryTitle": "Algorithms", "frontendQuestionId": "160", "paidOnly": false, "title": "Intersection of Two Linked Lists", "titleSlug": "intersection-of-two-linked-lists", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 1668009, "totalSubmissionRaw": 2850697}, "161": {"acRate": 34.35970729476332, "difficulty": "Medium", "likes": 1391, "dislikes": 187, "categoryTitle": "Algorithms", "frontendQuestionId": "161", "paidOnly": true, "title": "One Edit Distance", "titleSlug": "one-edit-distance", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 210356, "totalSubmissionRaw": 612218}, "162": {"acRate": 45.998086081986976, "difficulty": "Medium", "likes": 12155, "dislikes": 4699, "categoryTitle": "Algorithms", "frontendQuestionId": "162", "paidOnly": false, "title": "Find Peak Element", "titleSlug": "find-peak-element", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 1494399, "totalSubmissionRaw": 3248814}, "163": {"acRate": 34.08410370321977, "difficulty": "Easy", "likes": 1100, "dislikes": 2980, "categoryTitle": "Algorithms", "frontendQuestionId": "163", "paidOnly": true, "title": "Missing Ranges", "titleSlug": "missing-ranges", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 250420, "totalSubmissionRaw": 734712}, "164": {"acRate": 46.89825321969658, "difficulty": "Medium", "likes": 3284, "dislikes": 402, "categoryTitle": "Algorithms", "frontendQuestionId": "164", "paidOnly": false, "title": "Maximum Gap", "titleSlug": "maximum-gap", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Bucket Sort", "id": "VG9waWNUYWdOb2RlOjYxMDYw", "slug": "bucket-sort"}, {"name": "Radix Sort", "id": "VG9waWNUYWdOb2RlOjYxMDYx", "slug": "radix-sort"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 225446, "totalSubmissionRaw": 480713}, "165": {"acRate": 41.17325368956018, "difficulty": "Medium", "likes": 2642, "dislikes": 2736, "categoryTitle": "Algorithms", "frontendQuestionId": "165", "paidOnly": false, "title": "Compare Version Numbers", "titleSlug": "compare-version-numbers", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 505937, "totalSubmissionRaw": 1228801}, "166": {"acRate": 25.289035218130163, "difficulty": "Medium", "likes": 2090, "dislikes": 3676, "categoryTitle": "Algorithms", "frontendQuestionId": "166", "paidOnly": false, "title": "Fraction to Recurring Decimal", "titleSlug": "fraction-to-recurring-decimal", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 233042, "totalSubmissionRaw": 921514}, "167": {"acRate": 61.87163326899734, "difficulty": "Medium", "likes": 11797, "dislikes": 1421, "categoryTitle": "Algorithms", "frontendQuestionId": "167", "paidOnly": false, "title": "Two Sum II - Input Array Is Sorted", "titleSlug": "two-sum-ii-input-array-is-sorted", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 2183687, "totalSubmissionRaw": 3529378}, "168": {"acRate": 41.37741998241521, "difficulty": "Easy", "likes": 5582, "dislikes": 819, "categoryTitle": "Algorithms", "frontendQuestionId": "168", "paidOnly": false, "title": "Excel Sheet Column Title", "titleSlug": "excel-sheet-column-title", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 548724, "totalSubmissionRaw": 1326144}, "169": {"acRate": 65.11096091067526, "difficulty": "Easy", "likes": 19341, "dislikes": 642, "categoryTitle": "Algorithms", "frontendQuestionId": "169", "paidOnly": false, "title": "Majority Element", "titleSlug": "majority-element", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 3203985, "totalSubmissionRaw": 4920804}, "170": {"acRate": 38.26157654420465, "difficulty": "Easy", "likes": 670, "dislikes": 448, "categoryTitle": "Algorithms", "frontendQuestionId": "170", "paidOnly": true, "title": "Two Sum III - Data structure design", "titleSlug": "two-sum-iii-data-structure-design", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Data Stream", "id": "VG9waWNUYWdOb2RlOjYxMDYz", "slug": "data-stream"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 158124, "totalSubmissionRaw": 413271}, "171": {"acRate": 64.28788424016332, "difficulty": "Easy", "likes": 4781, "dislikes": 371, "categoryTitle": "Algorithms", "frontendQuestionId": "171", "paidOnly": false, "title": "Excel Sheet Column Number", "titleSlug": "excel-sheet-column-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 711032, "totalSubmissionRaw": 1106013}, "172": {"acRate": 43.70272380689909, "difficulty": "Medium", "likes": 3214, "dislikes": 1957, "categoryTitle": "Algorithms", "frontendQuestionId": "172", "paidOnly": false, "title": "Factorial Trailing Zeroes", "titleSlug": "factorial-trailing-zeroes", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 475726, "totalSubmissionRaw": 1088550}, "173": {"acRate": 72.8209317008773, "difficulty": "Medium", "likes": 8579, "dislikes": 512, "categoryTitle": "Algorithms", "frontendQuestionId": "173", "paidOnly": false, "title": "Binary Search Tree Iterator", "titleSlug": "binary-search-tree-iterator", "topicTags": [{"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}, {"name": "Iterator", "id": "VG9waWNUYWdOb2RlOjYxMDY0", "slug": "iterator"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 824656, "totalSubmissionRaw": 1132444}, "174": {"acRate": 38.37283369582796, "difficulty": "Hard", "likes": 5816, "dislikes": 109, "categoryTitle": "Algorithms", "frontendQuestionId": "174", "paidOnly": false, "title": "Dungeon Game", "titleSlug": "dungeon-game", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 232534, "totalSubmissionRaw": 605986}, "175": {"acRate": 76.53022432424915, "difficulty": "Easy", "likes": 3537, "dislikes": 226, "categoryTitle": "Database", "frontendQuestionId": "175", "paidOnly": false, "title": "Combine Two Tables", "titleSlug": "combine-two-tables", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1072975, "totalSubmissionRaw": 1402029}, "176": {"acRate": 41.27769084226117, "difficulty": "Medium", "likes": 3610, "dislikes": 959, "categoryTitle": "Database", "frontendQuestionId": "176", "paidOnly": false, "title": "Second Highest Salary", "titleSlug": "second-highest-salary", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 926931, "totalSubmissionRaw": 2245598}, "177": {"acRate": 37.94318516715144, "difficulty": "Medium", "likes": 1984, "dislikes": 1034, "categoryTitle": "Database", "frontendQuestionId": "177", "paidOnly": false, "title": "Nth Highest Salary", "titleSlug": "nth-highest-salary", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 414567, "totalSubmissionRaw": 1092596}, "178": {"acRate": 63.10575095456763, "difficulty": "Medium", "likes": 2171, "dislikes": 274, "categoryTitle": "Database", "frontendQuestionId": "178", "paidOnly": false, "title": "Rank Scores", "titleSlug": "rank-scores", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 412686, "totalSubmissionRaw": 653960}, "179": {"acRate": 36.739019215543465, "difficulty": "Medium", "likes": 8076, "dislikes": 673, "categoryTitle": "Algorithms", "frontendQuestionId": "179", "paidOnly": false, "title": "Largest Number", "titleSlug": "largest-number", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 498367, "totalSubmissionRaw": 1356505}, "180": {"acRate": 44.16896225208484, "difficulty": "Medium", "likes": 2133, "dislikes": 315, "categoryTitle": "Database", "frontendQuestionId": "180", "paidOnly": false, "title": "Consecutive Numbers", "titleSlug": "consecutive-numbers", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 410949, "totalSubmissionRaw": 930404}, "181": {"acRate": 70.04217536071032, "difficulty": "Easy", "likes": 2615, "dislikes": 256, "categoryTitle": "Database", "frontendQuestionId": "181", "paidOnly": false, "title": "Employees Earning More Than Their Managers", "titleSlug": "employees-earning-more-than-their-managers", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 678408, "totalSubmissionRaw": 968572}, "182": {"acRate": 71.41096846826306, "difficulty": "Easy", "likes": 2086, "dislikes": 71, "categoryTitle": "Database", "frontendQuestionId": "182", "paidOnly": false, "title": "Duplicate Emails", "titleSlug": "duplicate-emails", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 704717, "totalSubmissionRaw": 986847}, "183": {"acRate": 69.48786943204604, "difficulty": "Easy", "likes": 2640, "dislikes": 138, "categoryTitle": "Database", "frontendQuestionId": "183", "paidOnly": false, "title": "Customers Who Never Order", "titleSlug": "customers-who-never-order", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 851427, "totalSubmissionRaw": 1225290}, "184": {"acRate": 52.418440893204234, "difficulty": "Medium", "likes": 2067, "dislikes": 186, "categoryTitle": "Database", "frontendQuestionId": "184", "paidOnly": false, "title": "Department Highest Salary", "titleSlug": "department-highest-salary", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 407491, "totalSubmissionRaw": 777381}, "185": {"acRate": 54.554140271595664, "difficulty": "Hard", "likes": 2118, "dislikes": 243, "categoryTitle": "Database", "frontendQuestionId": "185", "paidOnly": false, "title": "Department Top Three Salaries", "titleSlug": "department-top-three-salaries", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 361434, "totalSubmissionRaw": 662526}, "186": {"acRate": 55.03117809863617, "difficulty": "Medium", "likes": 1074, "dislikes": 144, "categoryTitle": "Algorithms", "frontendQuestionId": "186", "paidOnly": true, "title": "Reverse Words in a String II", "titleSlug": "reverse-words-in-a-string-ii", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 165033, "totalSubmissionRaw": 299890}, "187": {"acRate": 49.43863782825842, "difficulty": "Medium", "likes": 3340, "dislikes": 537, "categoryTitle": "Algorithms", "frontendQuestionId": "187", "paidOnly": false, "title": "Repeated DNA Sequences", "titleSlug": "repeated-dna-sequences", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 392788, "totalSubmissionRaw": 794496}, "188": {"acRate": 44.12497762602954, "difficulty": "Hard", "likes": 7452, "dislikes": 210, "categoryTitle": "Algorithms", "frontendQuestionId": "188", "paidOnly": false, "title": "Best Time to Buy and Sell Stock IV", "titleSlug": "best-time-to-buy-and-sell-stock-iv", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 490571, "totalSubmissionRaw": 1111779}, "189": {"acRate": 41.287170626631564, "difficulty": "Medium", "likes": 18121, "dislikes": 1987, "categoryTitle": "Algorithms", "frontendQuestionId": "189", "paidOnly": false, "title": "Rotate Array", "titleSlug": "rotate-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 2406045, "totalSubmissionRaw": 5827589}, "190": {"acRate": 59.78570845126945, "difficulty": "Easy", "likes": 5125, "dislikes": 1450, "categoryTitle": "Algorithms", "frontendQuestionId": "190", "paidOnly": false, "title": "Reverse Bits", "titleSlug": "reverse-bits", "topicTags": [{"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 841716, "totalSubmissionRaw": 1407888}, "191": {"acRate": 72.07509784122271, "difficulty": "Easy", "likes": 6539, "dislikes": 1339, "categoryTitle": "Algorithms", "frontendQuestionId": "191", "paidOnly": false, "title": "Number of 1 Bits", "titleSlug": "number-of-1-bits", "topicTags": [{"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1551756, "totalSubmissionRaw": 2152973}, "192": {"acRate": 25.94194910914172, "difficulty": "Medium", "likes": 543, "dislikes": 307, "categoryTitle": "Shell", "frontendQuestionId": "192", "paidOnly": false, "title": "Word Frequency", "titleSlug": "word-frequency", "topicTags": [{"name": "Shell", "id": "VG9waWNUYWdOb2RlOjYxMDQ0", "slug": "shell"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 53188, "totalSubmissionRaw": 205027}, "193": {"acRate": 26.22466102127379, "difficulty": "Easy", "likes": 423, "dislikes": 967, "categoryTitle": "Shell", "frontendQuestionId": "193", "paidOnly": false, "title": "Valid Phone Numbers", "titleSlug": "valid-phone-numbers", "topicTags": [{"name": "Shell", "id": "VG9waWNUYWdOb2RlOjYxMDQ0", "slug": "shell"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 87363, "totalSubmissionRaw": 333133}, "194": {"acRate": 26.722180916976455, "difficulty": "Medium", "likes": 146, "dislikes": 287, "categoryTitle": "Shell", "frontendQuestionId": "194", "paidOnly": false, "title": "Transpose File", "titleSlug": "transpose-file", "topicTags": [{"name": "Shell", "id": "VG9waWNUYWdOb2RlOjYxMDQ0", "slug": "shell"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26956, "totalSubmissionRaw": 100875}, "195": {"acRate": 33.55507816731054, "difficulty": "Easy", "likes": 391, "dislikes": 468, "categoryTitle": "Shell", "frontendQuestionId": "195", "paidOnly": false, "title": "Tenth Line", "titleSlug": "tenth-line", "topicTags": [{"name": "Shell", "id": "VG9waWNUYWdOb2RlOjYxMDQ0", "slug": "shell"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 111525, "totalSubmissionRaw": 332364}, "196": {"acRate": 62.639519692771714, "difficulty": "Easy", "likes": 1626, "dislikes": 333, "categoryTitle": "Database", "frontendQuestionId": "196", "paidOnly": false, "title": "Delete Duplicate Emails", "titleSlug": "delete-duplicate-emails", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 571532, "totalSubmissionRaw": 912413}, "197": {"acRate": 48.46440051503055, "difficulty": "Easy", "likes": 3001, "dislikes": 622, "categoryTitle": "Database", "frontendQuestionId": "197", "paidOnly": false, "title": "Rising Temperature", "titleSlug": "rising-temperature", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 750530, "totalSubmissionRaw": 1548625}, "198": {"acRate": 51.3788361602169, "difficulty": "Medium", "likes": 21170, "dislikes": 431, "categoryTitle": "Algorithms", "frontendQuestionId": "198", "paidOnly": false, "title": "House Robber", "titleSlug": "house-robber", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 2374023, "totalSubmissionRaw": 4620614}, "199": {"acRate": 63.64833889453069, "difficulty": "Medium", "likes": 12063, "dislikes": 978, "categoryTitle": "Algorithms", "frontendQuestionId": "199", "paidOnly": false, "title": "Binary Tree Right Side View", "titleSlug": "binary-tree-right-side-view", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 1425841, "totalSubmissionRaw": 2240187}, "200": {"acRate": 60.14686778140259, "difficulty": "Medium", "likes": 22879, "dislikes": 522, "categoryTitle": "Algorithms", "frontendQuestionId": "200", "paidOnly": false, "title": "Number of Islands", "titleSlug": "number-of-islands", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 2879814, "totalSubmissionRaw": 4787973}, "201": {"acRate": 47.170501361938854, "difficulty": "Medium", "likes": 4018, "dislikes": 303, "categoryTitle": "Algorithms", "frontendQuestionId": "201", "paidOnly": false, "title": "Bitwise AND of Numbers Range", "titleSlug": "bitwise-and-of-numbers-range", "topicTags": [{"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 408864, "totalSubmissionRaw": 866775}, "202": {"acRate": 56.62326238002419, "difficulty": "Easy", "likes": 10415, "dislikes": 1463, "categoryTitle": "Algorithms", "frontendQuestionId": "202", "paidOnly": false, "title": "Happy Number", "titleSlug": "happy-number", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1553844, "totalSubmissionRaw": 2744183}, "203": {"acRate": 49.61069988694298, "difficulty": "Easy", "likes": 8340, "dislikes": 247, "categoryTitle": "Algorithms", "frontendQuestionId": "203", "paidOnly": false, "title": "Remove Linked List Elements", "titleSlug": "remove-linked-list-elements", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1186107, "totalSubmissionRaw": 2390829}, "204": {"acRate": 33.89381899505139, "difficulty": "Medium", "likes": 7991, "dislikes": 1458, "categoryTitle": "Algorithms", "frontendQuestionId": "204", "paidOnly": false, "title": "Count Primes", "titleSlug": "count-primes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 911758, "totalSubmissionRaw": 2690039}, "205": {"acRate": 45.56579574245212, "difficulty": "Easy", "likes": 9077, "dislikes": 2108, "categoryTitle": "Algorithms", "frontendQuestionId": "205", "paidOnly": false, "title": "Isomorphic Strings", "titleSlug": "isomorphic-strings", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1444170, "totalSubmissionRaw": 3169419}, "206": {"acRate": 77.36127831796509, "difficulty": "Easy", "likes": 21690, "dislikes": 448, "categoryTitle": "Algorithms", "frontendQuestionId": "206", "paidOnly": false, "title": "Reverse Linked List", "titleSlug": "reverse-linked-list", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 4419098, "totalSubmissionRaw": 5712292}, "207": {"acRate": 47.29522183096107, "difficulty": "Medium", "likes": 16276, "dislikes": 728, "categoryTitle": "Algorithms", "frontendQuestionId": "207", "paidOnly": false, "title": "Course Schedule", "titleSlug": "course-schedule", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1675501, "totalSubmissionRaw": 3542633}, "208": {"acRate": 66.00118422176853, "difficulty": "Medium", "likes": 11595, "dislikes": 143, "categoryTitle": "Algorithms", "frontendQuestionId": "208", "paidOnly": false, "title": "Implement Trie (Prefix Tree)", "titleSlug": "implement-trie-prefix-tree", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1104644, "totalSubmissionRaw": 1673673}, "209": {"acRate": 47.635463149738925, "difficulty": "Medium", "likes": 12663, "dislikes": 440, "categoryTitle": "Algorithms", "frontendQuestionId": "209", "paidOnly": false, "title": "Minimum Size Subarray Sum", "titleSlug": "minimum-size-subarray-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1131855, "totalSubmissionRaw": 2376072}, "210": {"acRate": 51.21486323089699, "difficulty": "Medium", "likes": 10823, "dislikes": 349, "categoryTitle": "Algorithms", "frontendQuestionId": "210", "paidOnly": false, "title": "Course Schedule II", "titleSlug": "course-schedule-ii", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 1108889, "totalSubmissionRaw": 2165175}, "211": {"acRate": 45.74333554265301, "difficulty": "Medium", "likes": 7604, "dislikes": 457, "categoryTitle": "Algorithms", "frontendQuestionId": "211", "paidOnly": false, "title": "Design Add and Search Words Data Structure", "titleSlug": "design-add-and-search-words-data-structure", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 667375, "totalSubmissionRaw": 1458947}, "212": {"acRate": 36.5178250043997, "difficulty": "Hard", "likes": 9456, "dislikes": 463, "categoryTitle": "Algorithms", "frontendQuestionId": "212", "paidOnly": false, "title": "Word Search II", "titleSlug": "word-search-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 686832, "totalSubmissionRaw": 1880813}, "213": {"acRate": 42.39151928791083, "difficulty": "Medium", "likes": 9888, "dislikes": 154, "categoryTitle": "Algorithms", "frontendQuestionId": "213", "paidOnly": false, "title": "House Robber II", "titleSlug": "house-robber-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 816768, "totalSubmissionRaw": 1926725}, "214": {"acRate": 33.87142166448977, "difficulty": "Hard", "likes": 3629, "dislikes": 246, "categoryTitle": "Algorithms", "frontendQuestionId": "214", "paidOnly": false, "title": "Shortest Palindrome", "titleSlug": "shortest-palindrome", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 187752, "totalSubmissionRaw": 554308}, "215": {"acRate": 67.00745905893018, "difficulty": "Medium", "likes": 17153, "dislikes": 885, "categoryTitle": "Algorithms", "frontendQuestionId": "215", "paidOnly": false, "title": "Kth Largest Element in an Array", "titleSlug": "kth-largest-element-in-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Quickselect", "id": "VG9waWNUYWdOb2RlOjYxMDY5", "slug": "quickselect"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 2448142, "totalSubmissionRaw": 3653538}, "216": {"acRate": 70.34322916200072, "difficulty": "Medium", "likes": 6024, "dislikes": 112, "categoryTitle": "Algorithms", "frontendQuestionId": "216", "paidOnly": false, "title": "Combination Sum III", "titleSlug": "combination-sum-iii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 549642, "totalSubmissionRaw": 781372}, "217": {"acRate": 62.09453116063229, "difficulty": "Easy", "likes": 12075, "dislikes": 1303, "categoryTitle": "Algorithms", "frontendQuestionId": "217", "paidOnly": false, "title": "Contains Duplicate", "titleSlug": "contains-duplicate", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 4244906, "totalSubmissionRaw": 6836206}, "218": {"acRate": 42.96189877150448, "difficulty": "Hard", "likes": 5906, "dislikes": 266, "categoryTitle": "Algorithms", "frontendQuestionId": "218", "paidOnly": false, "title": "The Skyline Problem", "titleSlug": "the-skyline-problem", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Line Sweep", "id": "VG9waWNUYWdOb2RlOjU2MTE5", "slug": "line-sweep"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 295751, "totalSubmissionRaw": 688403}, "219": {"acRate": 46.09449479592634, "difficulty": "Easy", "likes": 6178, "dislikes": 3104, "categoryTitle": "Algorithms", "frontendQuestionId": "219", "paidOnly": false, "title": "Contains Duplicate II", "titleSlug": "contains-duplicate-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1020677, "totalSubmissionRaw": 2214319}, "220": {"acRate": 22.93049512145408, "difficulty": "Hard", "likes": 1016, "dislikes": 89, "categoryTitle": "Algorithms", "frontendQuestionId": "220", "paidOnly": false, "title": "Contains Duplicate III", "titleSlug": "contains-duplicate-iii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Bucket Sort", "id": "VG9waWNUYWdOb2RlOjYxMDYw", "slug": "bucket-sort"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 258749, "totalSubmissionRaw": 1128409}, "221": {"acRate": 47.10232480764681, "difficulty": "Medium", "likes": 10147, "dislikes": 227, "categoryTitle": "Algorithms", "frontendQuestionId": "221", "paidOnly": false, "title": "Maximal Square", "titleSlug": "maximal-square", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 710686, "totalSubmissionRaw": 1508812}, "222": {"acRate": 66.73870215074939, "difficulty": "Easy", "likes": 8692, "dislikes": 523, "categoryTitle": "Algorithms", "frontendQuestionId": "222", "paidOnly": false, "title": "Count Complete Tree Nodes", "titleSlug": "count-complete-tree-nodes", "topicTags": [{"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 782867, "totalSubmissionRaw": 1173033}, "223": {"acRate": 46.5269217469132, "difficulty": "Medium", "likes": 1997, "dislikes": 1646, "categoryTitle": "Algorithms", "frontendQuestionId": "223", "paidOnly": false, "title": "Rectangle Area", "titleSlug": "rectangle-area", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 228731, "totalSubmissionRaw": 491610}, "224": {"acRate": 43.7977407015923, "difficulty": "Hard", "likes": 6331, "dislikes": 502, "categoryTitle": "Algorithms", "frontendQuestionId": "224", "paidOnly": false, "title": "Basic Calculator", "titleSlug": "basic-calculator", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 490180, "totalSubmissionRaw": 1119193}, "225": {"acRate": 64.85351072796526, "difficulty": "Easy", "likes": 6111, "dislikes": 1212, "categoryTitle": "Algorithms", "frontendQuestionId": "225", "paidOnly": false, "title": "Implement Stack using Queues", "titleSlug": "implement-stack-using-queues", "topicTags": [{"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 729422, "totalSubmissionRaw": 1124721}, "226": {"acRate": 77.61128474584056, "difficulty": "Easy", "likes": 14010, "dislikes": 229, "categoryTitle": "Algorithms", "frontendQuestionId": "226", "paidOnly": false, "title": "Invert Binary Tree", "titleSlug": "invert-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 2196396, "totalSubmissionRaw": 2829997}, "227": {"acRate": 44.0741368143092, "difficulty": "Medium", "likes": 6157, "dislikes": 848, "categoryTitle": "Algorithms", "frontendQuestionId": "227", "paidOnly": false, "title": "Basic Calculator II", "titleSlug": "basic-calculator-ii", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 663459, "totalSubmissionRaw": 1505316}, "228": {"acRate": 51.320344759947226, "difficulty": "Easy", "likes": 3979, "dislikes": 2177, "categoryTitle": "Algorithms", "frontendQuestionId": "228", "paidOnly": false, "title": "Summary Ranges", "titleSlug": "summary-ranges", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 612221, "totalSubmissionRaw": 1192939}, "229": {"acRate": 52.34546878819529, "difficulty": "Medium", "likes": 9740, "dislikes": 431, "categoryTitle": "Algorithms", "frontendQuestionId": "229", "paidOnly": false, "title": "Majority Element II", "titleSlug": "majority-element-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 753754, "totalSubmissionRaw": 1439964}, "230": {"acRate": 73.3804636570434, "difficulty": "Medium", "likes": 11528, "dislikes": 232, "categoryTitle": "Algorithms", "frontendQuestionId": "230", "paidOnly": false, "title": "Kth Smallest Element in a BST", "titleSlug": "kth-smallest-element-in-a-bst", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1538077, "totalSubmissionRaw": 2096030}, "231": {"acRate": 47.914863445092244, "difficulty": "Easy", "likes": 6852, "dislikes": 437, "categoryTitle": "Algorithms", "frontendQuestionId": "231", "paidOnly": false, "title": "Power of Two", "titleSlug": "power-of-two", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1408305, "totalSubmissionRaw": 2939182}, "232": {"acRate": 66.80927128881692, "difficulty": "Easy", "likes": 7679, "dislikes": 435, "categoryTitle": "Algorithms", "frontendQuestionId": "232", "paidOnly": false, "title": "Implement Queue using Stacks", "titleSlug": "implement-queue-using-stacks", "topicTags": [{"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 996795, "totalSubmissionRaw": 1492000}, "233": {"acRate": 34.822264547250754, "difficulty": "Hard", "likes": 1567, "dislikes": 1477, "categoryTitle": "Algorithms", "frontendQuestionId": "233", "paidOnly": false, "title": "Number of Digit One", "titleSlug": "number-of-digit-one", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 97814, "totalSubmissionRaw": 280895}, "234": {"acRate": 53.900527574752935, "difficulty": "Easy", "likes": 16562, "dislikes": 887, "categoryTitle": "Algorithms", "frontendQuestionId": "234", "paidOnly": false, "title": "Palindrome Linked List", "titleSlug": "palindrome-linked-list", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 2045573, "totalSubmissionRaw": 3795093}, "235": {"acRate": 65.74259560919243, "difficulty": "Medium", "likes": 11180, "dislikes": 320, "categoryTitle": "Algorithms", "frontendQuestionId": "235", "paidOnly": false, "title": "Lowest Common Ancestor of a Binary Search Tree", "titleSlug": "lowest-common-ancestor-of-a-binary-search-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1591336, "totalSubmissionRaw": 2420555}, "236": {"acRate": 63.47396224110554, "difficulty": "Medium", "likes": 16658, "dislikes": 420, "categoryTitle": "Algorithms", "frontendQuestionId": "236", "paidOnly": false, "title": "Lowest Common Ancestor of a Binary Tree", "titleSlug": "lowest-common-ancestor-of-a-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1746112, "totalSubmissionRaw": 2750917}, "237": {"acRate": 80.5067763625812, "difficulty": "Medium", "likes": 5138, "dislikes": 1581, "categoryTitle": "Algorithms", "frontendQuestionId": "237", "paidOnly": false, "title": "Delete Node in a Linked List", "titleSlug": "delete-node-in-a-linked-list", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1476034, "totalSubmissionRaw": 1833429}, "238": {"acRate": 66.56858559561579, "difficulty": "Medium", "likes": 22725, "dislikes": 1430, "categoryTitle": "Algorithms", "frontendQuestionId": "238", "paidOnly": false, "title": "Product of Array Except Self", "titleSlug": "product-of-array-except-self", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 2862776, "totalSubmissionRaw": 4300477}, "239": {"acRate": 46.774263933894595, "difficulty": "Hard", "likes": 18294, "dislikes": 692, "categoryTitle": "Algorithms", "frontendQuestionId": "239", "paidOnly": false, "title": "Sliding Window Maximum", "titleSlug": "sliding-window-maximum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Monotonic Queue", "id": "VG9waWNUYWdOb2RlOjYxMDcx", "slug": "monotonic-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1093282, "totalSubmissionRaw": 2337358}, "240": {"acRate": 53.309223250969936, "difficulty": "Medium", "likes": 11960, "dislikes": 205, "categoryTitle": "Algorithms", "frontendQuestionId": "240", "paidOnly": false, "title": "Search a 2D Matrix II", "titleSlug": "search-a-2d-matrix-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 978178, "totalSubmissionRaw": 1834915}, "241": {"acRate": 65.82991564524397, "difficulty": "Medium", "likes": 5381, "dislikes": 278, "categoryTitle": "Algorithms", "frontendQuestionId": "241", "paidOnly": false, "title": "Different Ways to Add Parentheses", "titleSlug": "different-ways-to-add-parentheses", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 226002, "totalSubmissionRaw": 343312}, "242": {"acRate": 65.10890285695879, "difficulty": "Easy", "likes": 12210, "dislikes": 406, "categoryTitle": "Algorithms", "frontendQuestionId": "242", "paidOnly": false, "title": "Valid Anagram", "titleSlug": "valid-anagram", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 3800048, "totalSubmissionRaw": 5836452}, "243": {"acRate": 65.4409127757871, "difficulty": "Easy", "likes": 1266, "dislikes": 114, "categoryTitle": "Algorithms", "frontendQuestionId": "243", "paidOnly": true, "title": "Shortest Word Distance", "titleSlug": "shortest-word-distance", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 217148, "totalSubmissionRaw": 331823}, "244": {"acRate": 61.354748162866244, "difficulty": "Medium", "likes": 1051, "dislikes": 339, "categoryTitle": "Algorithms", "frontendQuestionId": "244", "paidOnly": true, "title": "Shortest Word Distance II", "titleSlug": "shortest-word-distance-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 155630, "totalSubmissionRaw": 253656}, "245": {"acRate": 58.577998126720985, "difficulty": "Medium", "likes": 504, "dislikes": 100, "categoryTitle": "Algorithms", "frontendQuestionId": "245", "paidOnly": true, "title": "Shortest Word Distance III", "titleSlug": "shortest-word-distance-iii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 83178, "totalSubmissionRaw": 141996}, "246": {"acRate": 47.68012813426055, "difficulty": "Easy", "likes": 595, "dislikes": 1017, "categoryTitle": "Algorithms", "frontendQuestionId": "246", "paidOnly": true, "title": "Strobogrammatic Number", "titleSlug": "strobogrammatic-number", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 176827, "totalSubmissionRaw": 370861}, "247": {"acRate": 52.56716297874985, "difficulty": "Medium", "likes": 926, "dislikes": 251, "categoryTitle": "Algorithms", "frontendQuestionId": "247", "paidOnly": true, "title": "Strobogrammatic Number II", "titleSlug": "strobogrammatic-number-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 143798, "totalSubmissionRaw": 273551}, "248": {"acRate": 42.18863153054773, "difficulty": "Hard", "likes": 301, "dislikes": 188, "categoryTitle": "Algorithms", "frontendQuestionId": "248", "paidOnly": true, "title": "Strobogrammatic Number III", "titleSlug": "strobogrammatic-number-iii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 36702, "totalSubmissionRaw": 86995}, "249": {"acRate": 65.97219629034925, "difficulty": "Medium", "likes": 1670, "dislikes": 386, "categoryTitle": "Algorithms", "frontendQuestionId": "249", "paidOnly": true, "title": "Group Shifted Strings", "titleSlug": "group-shifted-strings", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 247338, "totalSubmissionRaw": 374913}, "250": {"acRate": 56.57855397965509, "difficulty": "Medium", "likes": 1205, "dislikes": 429, "categoryTitle": "Algorithms", "frontendQuestionId": "250", "paidOnly": true, "title": "Count Univalue Subtrees", "titleSlug": "count-univalue-subtrees", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 155177, "totalSubmissionRaw": 274268}, "251": {"acRate": 49.64066419414906, "difficulty": "Medium", "likes": 716, "dislikes": 404, "categoryTitle": "Algorithms", "frontendQuestionId": "251", "paidOnly": true, "title": "Flatten 2D Vector", "titleSlug": "flatten-2d-vector", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Iterator", "id": "VG9waWNUYWdOb2RlOjYxMDY0", "slug": "iterator"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 129028, "totalSubmissionRaw": 259924}, "252": {"acRate": 58.309969649551796, "difficulty": "Easy", "likes": 2036, "dislikes": 103, "categoryTitle": "Algorithms", "frontendQuestionId": "252", "paidOnly": true, "title": "Meeting Rooms", "titleSlug": "meeting-rooms", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 413255, "totalSubmissionRaw": 708721}, "253": {"acRate": 51.44898534464233, "difficulty": "Medium", "likes": 6952, "dislikes": 161, "categoryTitle": "Algorithms", "frontendQuestionId": "253", "paidOnly": true, "title": "Meeting Rooms II", "titleSlug": "meeting-rooms-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 921704, "totalSubmissionRaw": 1791490}, "254": {"acRate": 49.67774494658618, "difficulty": "Medium", "likes": 1132, "dislikes": 71, "categoryTitle": "Algorithms", "frontendQuestionId": "254", "paidOnly": true, "title": "Factor Combinations", "titleSlug": "factor-combinations", "topicTags": [{"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 128952, "totalSubmissionRaw": 259577}, "255": {"acRate": 50.15177929218429, "difficulty": "Medium", "likes": 1203, "dislikes": 89, "categoryTitle": "Algorithms", "frontendQuestionId": "255", "paidOnly": true, "title": "Verify Preorder Sequence in Binary Search Tree", "titleSlug": "verify-preorder-sequence-in-binary-search-tree", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 82276, "totalSubmissionRaw": 164054}, "256": {"acRate": 62.78961960806314, "difficulty": "Medium", "likes": 2296, "dislikes": 130, "categoryTitle": "Algorithms", "frontendQuestionId": "256", "paidOnly": true, "title": "Paint House", "titleSlug": "paint-house", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 212651, "totalSubmissionRaw": 338674}, "257": {"acRate": 64.43209680608824, "difficulty": "Easy", "likes": 6592, "dislikes": 300, "categoryTitle": "Algorithms", "frontendQuestionId": "257", "paidOnly": false, "title": "Binary Tree Paths", "titleSlug": "binary-tree-paths", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 759185, "totalSubmissionRaw": 1178272}, "258": {"acRate": 66.99548079073648, "difficulty": "Easy", "likes": 4852, "dislikes": 1938, "categoryTitle": "Algorithms", "frontendQuestionId": "258", "paidOnly": false, "title": "Add Digits", "titleSlug": "add-digits", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 829733, "totalSubmissionRaw": 1238491}, "259": {"acRate": 50.822738458899366, "difficulty": "Medium", "likes": 1558, "dislikes": 160, "categoryTitle": "Algorithms", "frontendQuestionId": "259", "paidOnly": true, "title": "3Sum Smaller", "titleSlug": "3sum-smaller", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 154061, "totalSubmissionRaw": 303134}, "260": {"acRate": 70.78451632225217, "difficulty": "Medium", "likes": 6364, "dislikes": 266, "categoryTitle": "Algorithms", "frontendQuestionId": "260", "paidOnly": false, "title": "Single Number III", "titleSlug": "single-number-iii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 472699, "totalSubmissionRaw": 667800}, "261": {"acRate": 48.41674894658527, "difficulty": "Medium", "likes": 3285, "dislikes": 104, "categoryTitle": "Algorithms", "frontendQuestionId": "261", "paidOnly": true, "title": "Graph Valid Tree", "titleSlug": "graph-valid-tree", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 417789, "totalSubmissionRaw": 862903}, "262": {"acRate": 36.53720475163051, "difficulty": "Hard", "likes": 1245, "dislikes": 669, "categoryTitle": "Database", "frontendQuestionId": "262", "paidOnly": false, "title": "Trips and Users", "titleSlug": "trips-and-users", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 192881, "totalSubmissionRaw": 527903}, "263": {"acRate": 42.01733587281844, "difficulty": "Easy", "likes": 3366, "dislikes": 1708, "categoryTitle": "Algorithms", "frontendQuestionId": "263", "paidOnly": false, "title": "Ugly Number", "titleSlug": "ugly-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 540490, "totalSubmissionRaw": 1286350}, "264": {"acRate": 46.29227138735986, "difficulty": "Medium", "likes": 5984, "dislikes": 317, "categoryTitle": "Algorithms", "frontendQuestionId": "264", "paidOnly": false, "title": "Ugly Number II", "titleSlug": "ugly-number-ii", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 352711, "totalSubmissionRaw": 761922}, "265": {"acRate": 54.99177865959266, "difficulty": "Hard", "likes": 1306, "dislikes": 37, "categoryTitle": "Algorithms", "frontendQuestionId": "265", "paidOnly": true, "title": "Paint House II", "titleSlug": "paint-house-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 125417, "totalSubmissionRaw": 228065}, "266": {"acRate": 67.61020278936857, "difficulty": "Easy", "likes": 1057, "dislikes": 72, "categoryTitle": "Algorithms", "frontendQuestionId": "266", "paidOnly": true, "title": "Palindrome Permutation", "titleSlug": "palindrome-permutation", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 208209, "totalSubmissionRaw": 307955}, "267": {"acRate": 41.78911799350363, "difficulty": "Medium", "likes": 885, "dislikes": 96, "categoryTitle": "Algorithms", "frontendQuestionId": "267", "paidOnly": true, "title": "Palindrome Permutation II", "titleSlug": "palindrome-permutation-ii", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 70245, "totalSubmissionRaw": 168094}, "268": {"acRate": 67.77647938424866, "difficulty": "Easy", "likes": 12212, "dislikes": 3339, "categoryTitle": "Algorithms", "frontendQuestionId": "268", "paidOnly": false, "title": "Missing Number", "titleSlug": "missing-number", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 2412223, "totalSubmissionRaw": 3559090}, "269": {"acRate": 35.91598835209685, "difficulty": "Hard", "likes": 4433, "dislikes": 994, "categoryTitle": "Algorithms", "frontendQuestionId": "269", "paidOnly": true, "title": "Alien Dictionary", "titleSlug": "alien-dictionary", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 391601, "totalSubmissionRaw": 1090325}, "270": {"acRate": 51.206120056758586, "difficulty": "Easy", "likes": 1812, "dislikes": 142, "categoryTitle": "Algorithms", "frontendQuestionId": "270", "paidOnly": true, "title": "Closest Binary Search Tree Value", "titleSlug": "closest-binary-search-tree-value", "topicTags": [{"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 356900, "totalSubmissionRaw": 696987}, "271": {"acRate": 47.39706799750468, "difficulty": "Medium", "likes": 1465, "dislikes": 411, "categoryTitle": "Algorithms", "frontendQuestionId": "271", "paidOnly": true, "title": "Encode and Decode Strings", "titleSlug": "encode-and-decode-strings", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 212737, "totalSubmissionRaw": 448840}, "272": {"acRate": 59.38673218673218, "difficulty": "Hard", "likes": 1294, "dislikes": 46, "categoryTitle": "Algorithms", "frontendQuestionId": "272", "paidOnly": true, "title": "Closest Binary Search Tree Value II", "titleSlug": "closest-binary-search-tree-value-ii", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 120852, "totalSubmissionRaw": 203500}, "273": {"acRate": 33.926777648342956, "difficulty": "Hard", "likes": 3593, "dislikes": 6686, "categoryTitle": "Algorithms", "frontendQuestionId": "273", "paidOnly": false, "title": "Integer to English Words", "titleSlug": "integer-to-english-words", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 499177, "totalSubmissionRaw": 1471326}, "274": {"acRate": 39.237491489860375, "difficulty": "Medium", "likes": 1321, "dislikes": 603, "categoryTitle": "Algorithms", "frontendQuestionId": "274", "paidOnly": false, "title": "H-Index", "titleSlug": "h-index", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting Sort", "id": "VG9waWNUYWdOb2RlOjYxMDcy", "slug": "counting-sort"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 527343, "totalSubmissionRaw": 1343972}, "275": {"acRate": 38.3474587730068, "difficulty": "Medium", "likes": 352, "dislikes": 99, "categoryTitle": "Algorithms", "frontendQuestionId": "275", "paidOnly": false, "title": "H-Index II", "titleSlug": "h-index-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 212703, "totalSubmissionRaw": 554670}, "276": {"acRate": 46.934601026408465, "difficulty": "Medium", "likes": 1559, "dislikes": 388, "categoryTitle": "Algorithms", "frontendQuestionId": "276", "paidOnly": true, "title": "Paint Fence", "titleSlug": "paint-fence", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 115415, "totalSubmissionRaw": 245906}, "277": {"acRate": 47.5010597160826, "difficulty": "Medium", "likes": 2842, "dislikes": 282, "categoryTitle": "Algorithms", "frontendQuestionId": "277", "paidOnly": true, "title": "Find the Celebrity", "titleSlug": "find-the-celebrity", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 274545, "totalSubmissionRaw": 577964}, "278": {"acRate": 44.739772358728054, "difficulty": "Easy", "likes": 8392, "dislikes": 3311, "categoryTitle": "Algorithms", "frontendQuestionId": "278", "paidOnly": false, "title": "First Bad Version", "titleSlug": "first-bad-version", "topicTags": [{"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 1738161, "totalSubmissionRaw": 3885048}, "279": {"acRate": 55.035566828330275, "difficulty": "Medium", "likes": 11213, "dislikes": 472, "categoryTitle": "Algorithms", "frontendQuestionId": "279", "paidOnly": false, "title": "Perfect Squares", "titleSlug": "perfect-squares", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 879224, "totalSubmissionRaw": 1597556}, "280": {"acRate": 67.80052498377066, "difficulty": "Medium", "likes": 1211, "dislikes": 102, "categoryTitle": "Algorithms", "frontendQuestionId": "280", "paidOnly": true, "title": "Wiggle Sort", "titleSlug": "wiggle-sort", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 144127, "totalSubmissionRaw": 212576}, "281": {"acRate": 64.2301532830016, "difficulty": "Medium", "likes": 681, "dislikes": 40, "categoryTitle": "Algorithms", "frontendQuestionId": "281", "paidOnly": true, "title": "Zigzag Iterator", "titleSlug": "zigzag-iterator", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Iterator", "id": "VG9waWNUYWdOb2RlOjYxMDY0", "slug": "iterator"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 95455, "totalSubmissionRaw": 148614}, "282": {"acRate": 40.1719277402164, "difficulty": "Hard", "likes": 3401, "dislikes": 629, "categoryTitle": "Algorithms", "frontendQuestionId": "282", "paidOnly": false, "title": "Expression Add Operators", "titleSlug": "expression-add-operators", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 233983, "totalSubmissionRaw": 582454}, "283": {"acRate": 61.9947214890957, "difficulty": "Easy", "likes": 16830, "dislikes": 467, "categoryTitle": "Algorithms", "frontendQuestionId": "283", "paidOnly": false, "title": "Move Zeroes", "titleSlug": "move-zeroes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 3226744, "totalSubmissionRaw": 5204870}, "284": {"acRate": 59.78817473581913, "difficulty": "Medium", "likes": 1857, "dislikes": 1038, "categoryTitle": "Algorithms", "frontendQuestionId": "284", "paidOnly": false, "title": "Peeking Iterator", "titleSlug": "peeking-iterator", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Iterator", "id": "VG9waWNUYWdOb2RlOjYxMDY0", "slug": "iterator"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 223939, "totalSubmissionRaw": 374554}, "285": {"acRate": 50.03392321206896, "difficulty": "Medium", "likes": 2572, "dislikes": 92, "categoryTitle": "Algorithms", "frontendQuestionId": "285", "paidOnly": true, "title": "Inorder Successor in BST", "titleSlug": "inorder-successor-in-bst", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 337755, "totalSubmissionRaw": 675053}, "286": {"acRate": 61.71361374875711, "difficulty": "Medium", "likes": 3137, "dislikes": 65, "categoryTitle": "Algorithms", "frontendQuestionId": "286", "paidOnly": true, "title": "Walls and Gates", "titleSlug": "walls-and-gates", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 329576, "totalSubmissionRaw": 534041}, "287": {"acRate": 61.384074038818056, "difficulty": "Medium", "likes": 23379, "dislikes": 4689, "categoryTitle": "Algorithms", "frontendQuestionId": "287", "paidOnly": false, "title": "Find the Duplicate Number", "titleSlug": "find-the-duplicate-number", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1844270, "totalSubmissionRaw": 3004476}, "288": {"acRate": 26.452307297532325, "difficulty": "Medium", "likes": 203, "dislikes": 1822, "categoryTitle": "Algorithms", "frontendQuestionId": "288", "paidOnly": true, "title": "Unique Word Abbreviation", "titleSlug": "unique-word-abbreviation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 74222, "totalSubmissionRaw": 280588}, "289": {"acRate": 69.82931918656057, "difficulty": "Medium", "likes": 6369, "dislikes": 575, "categoryTitle": "Algorithms", "frontendQuestionId": "289", "paidOnly": false, "title": "Game of Life", "titleSlug": "game-of-life", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 493601, "totalSubmissionRaw": 706869}, "290": {"acRate": 42.31451430607965, "difficulty": "Easy", "likes": 7283, "dislikes": 1037, "categoryTitle": "Algorithms", "frontendQuestionId": "290", "paidOnly": false, "title": "Word Pattern", "titleSlug": "word-pattern", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 769365, "totalSubmissionRaw": 1818210}, "291": {"acRate": 48.32346649420427, "difficulty": "Medium", "likes": 917, "dislikes": 74, "categoryTitle": "Algorithms", "frontendQuestionId": "291", "paidOnly": true, "title": "Word Pattern II", "titleSlug": "word-pattern-ii", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 77708, "totalSubmissionRaw": 160808}, "292": {"acRate": 57.14804770500332, "difficulty": "Easy", "likes": 1731, "dislikes": 2694, "categoryTitle": "Algorithms", "frontendQuestionId": "292", "paidOnly": false, "title": "Nim Game", "titleSlug": "nim-game", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Brainteaser", "id": "VG9waWNUYWdOb2RlOjMy", "slug": "brainteaser"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 393214, "totalSubmissionRaw": 688062}, "293": {"acRate": 64.67712754853524, "difficulty": "Easy", "likes": 227, "dislikes": 466, "categoryTitle": "Algorithms", "frontendQuestionId": "293", "paidOnly": true, "title": "Flip Game", "titleSlug": "flip-game", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 74358, "totalSubmissionRaw": 114968}, "294": {"acRate": 52.149360882507445, "difficulty": "Medium", "likes": 621, "dislikes": 63, "categoryTitle": "Algorithms", "frontendQuestionId": "294", "paidOnly": true, "title": "Flip Game II", "titleSlug": "flip-game-ii", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 71478, "totalSubmissionRaw": 137064}, "295": {"acRate": 52.228625058657904, "difficulty": "Hard", "likes": 11960, "dislikes": 243, "categoryTitle": "Algorithms", "frontendQuestionId": "295", "paidOnly": false, "title": "Find Median from Data Stream", "titleSlug": "find-median-from-data-stream", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Data Stream", "id": "VG9waWNUYWdOb2RlOjYxMDYz", "slug": "data-stream"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 834743, "totalSubmissionRaw": 1598244}, "296": {"acRate": 60.97312471500228, "difficulty": "Hard", "likes": 1181, "dislikes": 104, "categoryTitle": "Algorithms", "frontendQuestionId": "296", "paidOnly": true, "title": "Best Meeting Point", "titleSlug": "best-meeting-point", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 85577, "totalSubmissionRaw": 140352}, "297": {"acRate": 57.32847885208766, "difficulty": "Hard", "likes": 10208, "dislikes": 398, "categoryTitle": "Algorithms", "frontendQuestionId": "297", "paidOnly": false, "title": "Serialize and Deserialize Binary Tree", "titleSlug": "serialize-and-deserialize-binary-tree", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 908524, "totalSubmissionRaw": 1584776}, "298": {"acRate": 53.68388675088342, "difficulty": "Medium", "likes": 1140, "dislikes": 238, "categoryTitle": "Algorithms", "frontendQuestionId": "298", "paidOnly": true, "title": "Binary Tree Longest Consecutive Sequence", "titleSlug": "binary-tree-longest-consecutive-sequence", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 150098, "totalSubmissionRaw": 279596}, "299": {"acRate": 50.54315701502327, "difficulty": "Medium", "likes": 2440, "dislikes": 1783, "categoryTitle": "Algorithms", "frontendQuestionId": "299", "paidOnly": false, "title": "Bulls and Cows", "titleSlug": "bulls-and-cows", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 382221, "totalSubmissionRaw": 756227}, "300": {"acRate": 56.05950657644549, "difficulty": "Medium", "likes": 20942, "dislikes": 447, "categoryTitle": "Algorithms", "frontendQuestionId": "300", "paidOnly": false, "title": "Longest Increasing Subsequence", "titleSlug": "longest-increasing-subsequence", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1798449, "totalSubmissionRaw": 3208110}, "301": {"acRate": 48.459827888035896, "difficulty": "Hard", "likes": 5862, "dislikes": 286, "categoryTitle": "Algorithms", "frontendQuestionId": "301", "paidOnly": false, "title": "Remove Invalid Parentheses", "titleSlug": "remove-invalid-parentheses", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 440416, "totalSubmissionRaw": 908827}, "302": {"acRate": 59.066521723884, "difficulty": "Hard", "likes": 528, "dislikes": 101, "categoryTitle": "Algorithms", "frontendQuestionId": "302", "paidOnly": true, "title": "Smallest Rectangle Enclosing Black Pixels", "titleSlug": "smallest-rectangle-enclosing-black-pixels", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 50532, "totalSubmissionRaw": 85551}, "303": {"acRate": 64.4935698595258, "difficulty": "Easy", "likes": 3258, "dislikes": 1913, "categoryTitle": "Algorithms", "frontendQuestionId": "303", "paidOnly": false, "title": "Range Sum Query - Immutable", "titleSlug": "range-sum-query-immutable", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 562827, "totalSubmissionRaw": 872687}, "304": {"acRate": 55.09237590746516, "difficulty": "Medium", "likes": 4974, "dislikes": 345, "categoryTitle": "Algorithms", "frontendQuestionId": "304", "paidOnly": false, "title": "Range Sum Query 2D - Immutable", "titleSlug": "range-sum-query-2d-immutable", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 377845, "totalSubmissionRaw": 685839}, "305": {"acRate": 39.90564214865387, "difficulty": "Hard", "likes": 1867, "dislikes": 72, "categoryTitle": "Algorithms", "frontendQuestionId": "305", "paidOnly": true, "title": "Number of Islands II", "titleSlug": "number-of-islands-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 148697, "totalSubmissionRaw": 372623}, "306": {"acRate": 31.912807875066374, "difficulty": "Medium", "likes": 1175, "dislikes": 802, "categoryTitle": "Algorithms", "frontendQuestionId": "306", "paidOnly": false, "title": "Additive Number", "titleSlug": "additive-number", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 93756, "totalSubmissionRaw": 293788}, "307": {"acRate": 41.21709975846377, "difficulty": "Medium", "likes": 4764, "dislikes": 256, "categoryTitle": "Algorithms", "frontendQuestionId": "307", "paidOnly": false, "title": "Range Sum Query - Mutable", "titleSlug": "range-sum-query-mutable", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 278323, "totalSubmissionRaw": 675261}, "308": {"acRate": 44.22453651239744, "difficulty": "Hard", "likes": 800, "dislikes": 93, "categoryTitle": "Algorithms", "frontendQuestionId": "308", "paidOnly": true, "title": "Range Sum Query 2D - Mutable", "titleSlug": "range-sum-query-2d-mutable", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 78051, "totalSubmissionRaw": 176488}, "309": {"acRate": 58.896943516337984, "difficulty": "Medium", "likes": 9412, "dislikes": 324, "categoryTitle": "Algorithms", "frontendQuestionId": "309", "paidOnly": false, "title": "Best Time to Buy and Sell Stock with Cooldown", "titleSlug": "best-time-to-buy-and-sell-stock-with-cooldown", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 543456, "totalSubmissionRaw": 922724}, "310": {"acRate": 41.83201661756142, "difficulty": "Medium", "likes": 8262, "dislikes": 383, "categoryTitle": "Algorithms", "frontendQuestionId": "310", "paidOnly": false, "title": "Minimum Height Trees", "titleSlug": "minimum-height-trees", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 385051, "totalSubmissionRaw": 920467}, "311": {"acRate": 68.21620633016907, "difficulty": "Medium", "likes": 1063, "dislikes": 360, "categoryTitle": "Algorithms", "frontendQuestionId": "311", "paidOnly": true, "title": "Sparse Matrix Multiplication", "titleSlug": "sparse-matrix-multiplication", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 193953, "totalSubmissionRaw": 284321}, "312": {"acRate": 59.59074343807836, "difficulty": "Hard", "likes": 8994, "dislikes": 252, "categoryTitle": "Algorithms", "frontendQuestionId": "312", "paidOnly": false, "title": "Burst Balloons", "titleSlug": "burst-balloons", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 302338, "totalSubmissionRaw": 507358}, "313": {"acRate": 45.30038692976054, "difficulty": "Medium", "likes": 2162, "dislikes": 387, "categoryTitle": "Algorithms", "frontendQuestionId": "313", "paidOnly": false, "title": "Super Ugly Number", "titleSlug": "super-ugly-number", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 131594, "totalSubmissionRaw": 290492}, "314": {"acRate": 54.92492469573005, "difficulty": "Medium", "likes": 3258, "dislikes": 331, "categoryTitle": "Algorithms", "frontendQuestionId": "314", "paidOnly": true, "title": "Binary Tree Vertical Order Traversal", "titleSlug": "binary-tree-vertical-order-traversal", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 431789, "totalSubmissionRaw": 786144}, "315": {"acRate": 42.55958780085331, "difficulty": "Hard", "likes": 8845, "dislikes": 244, "categoryTitle": "Algorithms", "frontendQuestionId": "315", "paidOnly": false, "title": "Count of Smaller Numbers After Self", "titleSlug": "count-of-smaller-numbers-after-self", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Merge Sort", "id": "VG9waWNUYWdOb2RlOjYxMDUx", "slug": "merge-sort"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 328583, "totalSubmissionRaw": 772055}, "316": {"acRate": 50.017124760071184, "difficulty": "Medium", "likes": 8675, "dislikes": 634, "categoryTitle": "Algorithms", "frontendQuestionId": "316", "paidOnly": false, "title": "Remove Duplicate Letters", "titleSlug": "remove-duplicate-letters", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 343187, "totalSubmissionRaw": 686140}, "317": {"acRate": 43.42550452481109, "difficulty": "Hard", "likes": 1875, "dislikes": 302, "categoryTitle": "Algorithms", "frontendQuestionId": "317", "paidOnly": true, "title": "Shortest Distance from All Buildings", "titleSlug": "shortest-distance-from-all-buildings", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 181483, "totalSubmissionRaw": 417918}, "318": {"acRate": 60.08217798881618, "difficulty": "Medium", "likes": 3508, "dislikes": 140, "categoryTitle": "Algorithms", "frontendQuestionId": "318", "paidOnly": false, "title": "Maximum Product of Word Lengths", "titleSlug": "maximum-product-of-word-lengths", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 220799, "totalSubmissionRaw": 367495}, "319": {"acRate": 53.00893211128991, "difficulty": "Medium", "likes": 2666, "dislikes": 3120, "categoryTitle": "Algorithms", "frontendQuestionId": "319", "paidOnly": false, "title": "Bulb Switcher", "titleSlug": "bulb-switcher", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Brainteaser", "id": "VG9waWNUYWdOb2RlOjMy", "slug": "brainteaser"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 227297, "totalSubmissionRaw": 428790}, "320": {"acRate": 58.6428158082854, "difficulty": "Medium", "likes": 683, "dislikes": 226, "categoryTitle": "Algorithms", "frontendQuestionId": "320", "paidOnly": true, "title": "Generalized Abbreviation", "titleSlug": "generalized-abbreviation", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 68910, "totalSubmissionRaw": 117508}, "321": {"acRate": 30.58680731583668, "difficulty": "Hard", "likes": 1937, "dislikes": 354, "categoryTitle": "Algorithms", "frontendQuestionId": "321", "paidOnly": false, "title": "Create Maximum Number", "titleSlug": "create-maximum-number", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 62747, "totalSubmissionRaw": 205144}, "322": {"acRate": 44.59637044048263, "difficulty": "Medium", "likes": 19003, "dislikes": 455, "categoryTitle": "Algorithms", "frontendQuestionId": "322", "paidOnly": false, "title": "Coin Change", "titleSlug": "coin-change", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 1914322, "totalSubmissionRaw": 4292564}, "323": {"acRate": 63.13885900119097, "difficulty": "Medium", "likes": 2677, "dislikes": 103, "categoryTitle": "Algorithms", "frontendQuestionId": "323", "paidOnly": true, "title": "Number of Connected Components in an Undirected Graph", "titleSlug": "number-of-connected-components-in-an-undirected-graph", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 417224, "totalSubmissionRaw": 660803}, "324": {"acRate": 34.66738022663285, "difficulty": "Medium", "likes": 3077, "dislikes": 960, "categoryTitle": "Algorithms", "frontendQuestionId": "324", "paidOnly": false, "title": "Wiggle Sort II", "titleSlug": "wiggle-sort-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Quickselect", "id": "VG9waWNUYWdOb2RlOjYxMDY5", "slug": "quickselect"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 163889, "totalSubmissionRaw": 472745}, "325": {"acRate": 49.59078684301335, "difficulty": "Medium", "likes": 2040, "dislikes": 64, "categoryTitle": "Algorithms", "frontendQuestionId": "325", "paidOnly": true, "title": "Maximum Size Subarray Sum Equals k", "titleSlug": "maximum-size-subarray-sum-equals-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 188261, "totalSubmissionRaw": 379630}, "326": {"acRate": 46.90905740979975, "difficulty": "Easy", "likes": 3103, "dislikes": 278, "categoryTitle": "Algorithms", "frontendQuestionId": "326", "paidOnly": false, "title": "Power of Three", "titleSlug": "power-of-three", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 875823, "totalSubmissionRaw": 1867054}, "327": {"acRate": 36.06413623270057, "difficulty": "Hard", "likes": 2311, "dislikes": 244, "categoryTitle": "Algorithms", "frontendQuestionId": "327", "paidOnly": false, "title": "Count of Range Sum", "titleSlug": "count-of-range-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Merge Sort", "id": "VG9waWNUYWdOb2RlOjYxMDUx", "slug": "merge-sort"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 79375, "totalSubmissionRaw": 220094}, "328": {"acRate": 61.5530711655277, "difficulty": "Medium", "likes": 10036, "dislikes": 534, "categoryTitle": "Algorithms", "frontendQuestionId": "328", "paidOnly": false, "title": "Odd Even Linked List", "titleSlug": "odd-even-linked-list", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 998523, "totalSubmissionRaw": 1622215}, "329": {"acRate": 53.96436338057472, "difficulty": "Hard", "likes": 8981, "dislikes": 136, "categoryTitle": "Algorithms", "frontendQuestionId": "329", "paidOnly": false, "title": "Longest Increasing Path in a Matrix", "titleSlug": "longest-increasing-path-in-a-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 544691, "totalSubmissionRaw": 1009354}, "330": {"acRate": 53.141068260560154, "difficulty": "Hard", "likes": 2306, "dislikes": 192, "categoryTitle": "Algorithms", "frontendQuestionId": "330", "paidOnly": false, "title": "Patching Array", "titleSlug": "patching-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 159056, "totalSubmissionRaw": 299309}, "331": {"acRate": 45.4497883219272, "difficulty": "Medium", "likes": 2335, "dislikes": 124, "categoryTitle": "Algorithms", "frontendQuestionId": "331", "paidOnly": false, "title": "Verify Preorder Serialization of a Binary Tree", "titleSlug": "verify-preorder-serialization-of-a-binary-tree", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 144179, "totalSubmissionRaw": 317227}, "332": {"acRate": 43.26300901932573, "difficulty": "Hard", "likes": 5897, "dislikes": 1873, "categoryTitle": "Algorithms", "frontendQuestionId": "332", "paidOnly": false, "title": "Reconstruct Itinerary", "titleSlug": "reconstruct-itinerary", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Eulerian Circuit", "id": "VG9waWNUYWdOb2RlOjYxMDc0", "slug": "eulerian-circuit"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 442015, "totalSubmissionRaw": 1021692}, "333": {"acRate": 44.17535279025016, "difficulty": "Medium", "likes": 1490, "dislikes": 131, "categoryTitle": "Algorithms", "frontendQuestionId": "333", "paidOnly": true, "title": "Largest BST Subtree", "titleSlug": "largest-bst-subtree", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 110191, "totalSubmissionRaw": 249440}, "334": {"acRate": 39.50035212902873, "difficulty": "Medium", "likes": 8141, "dislikes": 549, "categoryTitle": "Algorithms", "frontendQuestionId": "334", "paidOnly": false, "title": "Increasing Triplet Subsequence", "titleSlug": "increasing-triplet-subsequence", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 620893, "totalSubmissionRaw": 1571866}, "335": {"acRate": 30.824283025709203, "difficulty": "Hard", "likes": 386, "dislikes": 510, "categoryTitle": "Algorithms", "frontendQuestionId": "335", "paidOnly": false, "title": "Self Crossing", "titleSlug": "self-crossing", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 35705, "totalSubmissionRaw": 115834}, "336": {"acRate": 35.512362412044325, "difficulty": "Hard", "likes": 4469, "dislikes": 468, "categoryTitle": "Algorithms", "frontendQuestionId": "336", "paidOnly": false, "title": "Palindrome Pairs", "titleSlug": "palindrome-pairs", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 210002, "totalSubmissionRaw": 591349}, "337": {"acRate": 54.37775798131306, "difficulty": "Medium", "likes": 8543, "dislikes": 143, "categoryTitle": "Algorithms", "frontendQuestionId": "337", "paidOnly": false, "title": "House Robber III", "titleSlug": "house-robber-iii", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 393714, "totalSubmissionRaw": 724035}, "338": {"acRate": 78.70898423580005, "difficulty": "Easy", "likes": 11141, "dislikes": 544, "categoryTitle": "Algorithms", "frontendQuestionId": "338", "paidOnly": false, "title": "Counting Bits", "titleSlug": "counting-bits", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1170624, "totalSubmissionRaw": 1487280}, "339": {"acRate": 84.0693704921586, "difficulty": "Medium", "likes": 1732, "dislikes": 424, "categoryTitle": "Algorithms", "frontendQuestionId": "339", "paidOnly": true, "title": "Nested List Weight Sum", "titleSlug": "nested-list-weight-sum", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 294779, "totalSubmissionRaw": 350638}, "340": {"acRate": 48.967164262240296, "difficulty": "Medium", "likes": 2834, "dislikes": 78, "categoryTitle": "Algorithms", "frontendQuestionId": "340", "paidOnly": true, "title": "Longest Substring with At Most K Distinct Characters", "titleSlug": "longest-substring-with-at-most-k-distinct-characters", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 351643, "totalSubmissionRaw": 718120}, "341": {"acRate": 64.7016241821108, "difficulty": "Medium", "likes": 4892, "dislikes": 1757, "categoryTitle": "Algorithms", "frontendQuestionId": "341", "paidOnly": false, "title": "Flatten Nested List Iterator", "titleSlug": "flatten-nested-list-iterator", "topicTags": [{"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Iterator", "id": "VG9waWNUYWdOb2RlOjYxMDY0", "slug": "iterator"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 460310, "totalSubmissionRaw": 711435}, "342": {"acRate": 48.29604388921057, "difficulty": "Easy", "likes": 3933, "dislikes": 398, "categoryTitle": "Algorithms", "frontendQuestionId": "342", "paidOnly": false, "title": "Power of Four", "titleSlug": "power-of-four", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 695634, "totalSubmissionRaw": 1440354}, "343": {"acRate": 60.554552863501534, "difficulty": "Medium", "likes": 5115, "dislikes": 448, "categoryTitle": "Algorithms", "frontendQuestionId": "343", "paidOnly": false, "title": "Integer Break", "titleSlug": "integer-break", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 367048, "totalSubmissionRaw": 606145}, "344": {"acRate": 78.89325246244161, "difficulty": "Easy", "likes": 8672, "dislikes": 1180, "categoryTitle": "Algorithms", "frontendQuestionId": "344", "paidOnly": false, "title": "Reverse String", "titleSlug": "reverse-string", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 2785111, "totalSubmissionRaw": 3530229}, "345": {"acRate": 53.95475738647072, "difficulty": "Easy", "likes": 4602, "dislikes": 2791, "categoryTitle": "Algorithms", "frontendQuestionId": "345", "paidOnly": false, "title": "Reverse Vowels of a String", "titleSlug": "reverse-vowels-of-a-string", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 947634, "totalSubmissionRaw": 1756347}, "346": {"acRate": 78.72036097099004, "difficulty": "Easy", "likes": 1660, "dislikes": 171, "categoryTitle": "Algorithms", "frontendQuestionId": "346", "paidOnly": true, "title": "Moving Average from Data Stream", "titleSlug": "moving-average-from-data-stream", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Data Stream", "id": "VG9waWNUYWdOb2RlOjYxMDYz", "slug": "data-stream"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 402313, "totalSubmissionRaw": 511066}, "347": {"acRate": 63.13413724376746, "difficulty": "Medium", "likes": 17415, "dislikes": 662, "categoryTitle": "Algorithms", "frontendQuestionId": "347", "paidOnly": false, "title": "Top K Frequent Elements", "titleSlug": "top-k-frequent-elements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Bucket Sort", "id": "VG9waWNUYWdOb2RlOjYxMDYw", "slug": "bucket-sort"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}, {"name": "Quickselect", "id": "VG9waWNUYWdOb2RlOjYxMDY5", "slug": "quickselect"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 2268056, "totalSubmissionRaw": 3592440}, "348": {"acRate": 58.161167773844404, "difficulty": "Medium", "likes": 2068, "dislikes": 116, "categoryTitle": "Algorithms", "frontendQuestionId": "348", "paidOnly": true, "title": "Design Tic-Tac-Toe", "titleSlug": "design-tic-tac-toe", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 251535, "totalSubmissionRaw": 432480}, "349": {"acRate": 75.03140815623152, "difficulty": "Easy", "likes": 6105, "dislikes": 2295, "categoryTitle": "Algorithms", "frontendQuestionId": "349", "paidOnly": false, "title": "Intersection of Two Arrays", "titleSlug": "intersection-of-two-arrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1282250, "totalSubmissionRaw": 1708951}, "350": {"acRate": 58.61429679552865, "difficulty": "Easy", "likes": 7693, "dislikes": 976, "categoryTitle": "Algorithms", "frontendQuestionId": "350", "paidOnly": false, "title": "Intersection of Two Arrays II", "titleSlug": "intersection-of-two-arrays-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1412295, "totalSubmissionRaw": 2409470}, "351": {"acRate": 52.83176550218944, "difficulty": "Medium", "likes": 182, "dislikes": 206, "categoryTitle": "Algorithms", "frontendQuestionId": "351", "paidOnly": true, "title": "Android Unlock Patterns", "titleSlug": "android-unlock-patterns", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 76493, "totalSubmissionRaw": 144786}, "352": {"acRate": 60.143308128749496, "difficulty": "Hard", "likes": 1737, "dislikes": 364, "categoryTitle": "Algorithms", "frontendQuestionId": "352", "paidOnly": false, "title": "Data Stream as Disjoint Intervals", "titleSlug": "data-stream-as-disjoint-intervals", "topicTags": [{"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 110879, "totalSubmissionRaw": 184358}, "353": {"acRate": 38.85017892715817, "difficulty": "Medium", "likes": 945, "dislikes": 334, "categoryTitle": "Algorithms", "frontendQuestionId": "353", "paidOnly": true, "title": "Design Snake Game", "titleSlug": "design-snake-game", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 86200, "totalSubmissionRaw": 221878}, "354": {"acRate": 37.07625758072245, "difficulty": "Hard", "likes": 5987, "dislikes": 148, "categoryTitle": "Algorithms", "frontendQuestionId": "354", "paidOnly": false, "title": "Russian Doll Envelopes", "titleSlug": "russian-doll-envelopes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 225162, "totalSubmissionRaw": 607296}, "355": {"acRate": 40.32345816413289, "difficulty": "Medium", "likes": 3935, "dislikes": 536, "categoryTitle": "Algorithms", "frontendQuestionId": "355", "paidOnly": false, "title": "Design Twitter", "titleSlug": "design-twitter", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 194924, "totalSubmissionRaw": 483401}, "356": {"acRate": 35.683442142600114, "difficulty": "Medium", "likes": 300, "dislikes": 622, "categoryTitle": "Algorithms", "frontendQuestionId": "356", "paidOnly": true, "title": "Line Reflection", "titleSlug": "line-reflection", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 41649, "totalSubmissionRaw": 116718}, "357": {"acRate": 53.293772280856324, "difficulty": "Medium", "likes": 1537, "dislikes": 1496, "categoryTitle": "Algorithms", "frontendQuestionId": "357", "paidOnly": false, "title": "Count Numbers with Unique Digits", "titleSlug": "count-numbers-with-unique-digits", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 143963, "totalSubmissionRaw": 270129}, "358": {"acRate": 38.93118049690835, "difficulty": "Hard", "likes": 963, "dislikes": 39, "categoryTitle": "Algorithms", "frontendQuestionId": "358", "paidOnly": true, "title": "Rearrange String k Distance Apart", "titleSlug": "rearrange-string-k-distance-apart", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 65921, "totalSubmissionRaw": 169327}, "359": {"acRate": 76.05520022278942, "difficulty": "Easy", "likes": 1736, "dislikes": 191, "categoryTitle": "Algorithms", "frontendQuestionId": "359", "paidOnly": true, "title": "Logger Rate Limiter", "titleSlug": "logger-rate-limiter", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Data Stream", "id": "VG9waWNUYWdOb2RlOjYxMDYz", "slug": "data-stream"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 330453, "totalSubmissionRaw": 434491}, "360": {"acRate": 56.00469202271749, "difficulty": "Medium", "likes": 673, "dislikes": 212, "categoryTitle": "Algorithms", "frontendQuestionId": "360", "paidOnly": true, "title": "Sort Transformed Array", "titleSlug": "sort-transformed-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 66365, "totalSubmissionRaw": 118499}, "361": {"acRate": 51.8467636444906, "difficulty": "Medium", "likes": 961, "dislikes": 116, "categoryTitle": "Algorithms", "frontendQuestionId": "361", "paidOnly": true, "title": "Bomb Enemy", "titleSlug": "bomb-enemy", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 78875, "totalSubmissionRaw": 152131}, "362": {"acRate": 68.80556789248207, "difficulty": "Medium", "likes": 2036, "dislikes": 232, "categoryTitle": "Algorithms", "frontendQuestionId": "362", "paidOnly": true, "title": "Design Hit Counter", "titleSlug": "design-hit-counter", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Data Stream", "id": "VG9waWNUYWdOb2RlOjYxMDYz", "slug": "data-stream"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 249425, "totalSubmissionRaw": 362507}, "363": {"acRate": 44.25006780580418, "difficulty": "Hard", "likes": 3460, "dislikes": 172, "categoryTitle": "Algorithms", "frontendQuestionId": "363", "paidOnly": false, "title": "Max Sum of Rectangle No Larger Than K", "titleSlug": "max-sum-of-rectangle-no-larger-than-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 127257, "totalSubmissionRaw": 287586}, "364": {"acRate": 64.81843939902323, "difficulty": "Medium", "likes": 1126, "dislikes": 455, "categoryTitle": "Algorithms", "frontendQuestionId": "364", "paidOnly": true, "title": "Nested List Weight Sum II", "titleSlug": "nested-list-weight-sum-ii", "topicTags": [{"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 139090, "totalSubmissionRaw": 214584}, "365": {"acRate": 41.3083154927842, "difficulty": "Medium", "likes": 1517, "dislikes": 1473, "categoryTitle": "Algorithms", "frontendQuestionId": "365", "paidOnly": false, "title": "Water and Jug Problem", "titleSlug": "water-and-jug-problem", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 107281, "totalSubmissionRaw": 259708}, "366": {"acRate": 80.6897257787802, "difficulty": "Medium", "likes": 3225, "dislikes": 58, "categoryTitle": "Algorithms", "frontendQuestionId": "366", "paidOnly": true, "title": "Find Leaves of Binary Tree", "titleSlug": "find-leaves-of-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 260088, "totalSubmissionRaw": 322331}, "367": {"acRate": 43.813986254132274, "difficulty": "Easy", "likes": 4255, "dislikes": 309, "categoryTitle": "Algorithms", "frontendQuestionId": "367", "paidOnly": false, "title": "Valid Perfect Square", "titleSlug": "valid-perfect-square", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 645582, "totalSubmissionRaw": 1473461}, "368": {"acRate": 45.58103520863449, "difficulty": "Medium", "likes": 5962, "dislikes": 283, "categoryTitle": "Algorithms", "frontendQuestionId": "368", "paidOnly": false, "title": "Largest Divisible Subset", "titleSlug": "largest-divisible-subset", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 309642, "totalSubmissionRaw": 679322}, "369": {"acRate": 61.097198545717866, "difficulty": "Medium", "likes": 943, "dislikes": 46, "categoryTitle": "Algorithms", "frontendQuestionId": "369", "paidOnly": true, "title": "Plus One Linked List", "titleSlug": "plus-one-linked-list", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 80999, "totalSubmissionRaw": 132574}, "370": {"acRate": 71.76072967039599, "difficulty": "Medium", "likes": 1640, "dislikes": 83, "categoryTitle": "Algorithms", "frontendQuestionId": "370", "paidOnly": true, "title": "Range Addition", "titleSlug": "range-addition", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 95121, "totalSubmissionRaw": 132553}, "371": {"acRate": 52.35916765632261, "difficulty": "Medium", "likes": 4226, "dislikes": 5554, "categoryTitle": "Algorithms", "frontendQuestionId": "371", "paidOnly": false, "title": "Sum of Two Integers", "titleSlug": "sum-of-two-integers", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 507013, "totalSubmissionRaw": 968330}, "372": {"acRate": 35.06637636314901, "difficulty": "Medium", "likes": 942, "dislikes": 1441, "categoryTitle": "Algorithms", "frontendQuestionId": "372", "paidOnly": false, "title": "Super Pow", "titleSlug": "super-pow", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 74569, "totalSubmissionRaw": 212651}, "373": {"acRate": 40.08691233956069, "difficulty": "Medium", "likes": 6281, "dislikes": 451, "categoryTitle": "Algorithms", "frontendQuestionId": "373", "paidOnly": false, "title": "Find K Pairs with Smallest Sums", "titleSlug": "find-k-pairs-with-smallest-sums", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 314002, "totalSubmissionRaw": 783307}, "374": {"acRate": 54.04709393901332, "difficulty": "Easy", "likes": 3768, "dislikes": 543, "categoryTitle": "Algorithms", "frontendQuestionId": "374", "paidOnly": false, "title": "Guess Number Higher or Lower", "titleSlug": "guess-number-higher-or-lower", "topicTags": [{"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 692786, "totalSubmissionRaw": 1281820}, "375": {"acRate": 49.67079820372415, "difficulty": "Medium", "likes": 2158, "dislikes": 2125, "categoryTitle": "Algorithms", "frontendQuestionId": "375", "paidOnly": false, "title": "Guess Number Higher or Lower II", "titleSlug": "guess-number-higher-or-lower-ii", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 129080, "totalSubmissionRaw": 259871}, "376": {"acRate": 48.57421875, "difficulty": "Medium", "likes": 5119, "dislikes": 165, "categoryTitle": "Algorithms", "frontendQuestionId": "376", "paidOnly": false, "title": "Wiggle Subsequence", "titleSlug": "wiggle-subsequence", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 251186, "totalSubmissionRaw": 517119}, "377": {"acRate": 54.257218828477335, "difficulty": "Medium", "likes": 7405, "dislikes": 664, "categoryTitle": "Algorithms", "frontendQuestionId": "377", "paidOnly": false, "title": "Combination Sum IV", "titleSlug": "combination-sum-iv", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 499516, "totalSubmissionRaw": 920643}, "378": {"acRate": 62.699194810694436, "difficulty": "Medium", "likes": 9947, "dislikes": 353, "categoryTitle": "Algorithms", "frontendQuestionId": "378", "paidOnly": false, "title": "Kth Smallest Element in a Sorted Matrix", "titleSlug": "kth-smallest-element-in-a-sorted-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 633697, "totalSubmissionRaw": 1010694}, "379": {"acRate": 51.84878373565799, "difficulty": "Medium", "likes": 353, "dislikes": 470, "categoryTitle": "Algorithms", "frontendQuestionId": "379", "paidOnly": true, "title": "Design Phone Directory", "titleSlug": "design-phone-directory", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 66971, "totalSubmissionRaw": 129166}, "380": {"acRate": 54.5914256624438, "difficulty": "Medium", "likes": 9241, "dislikes": 628, "categoryTitle": "Algorithms", "frontendQuestionId": "380", "paidOnly": false, "title": "Insert Delete GetRandom O(1)", "titleSlug": "insert-delete-getrandom-o1", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Randomized", "id": "VG9waWNUYWdOb2RlOjYxMDc1", "slug": "randomized"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 966188, "totalSubmissionRaw": 1769860}, "381": {"acRate": 35.56779720474279, "difficulty": "Hard", "likes": 2295, "dislikes": 151, "categoryTitle": "Algorithms", "frontendQuestionId": "381", "paidOnly": false, "title": "Insert Delete GetRandom O(1) - Duplicates allowed", "titleSlug": "insert-delete-getrandom-o1-duplicates-allowed", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Randomized", "id": "VG9waWNUYWdOb2RlOjYxMDc1", "slug": "randomized"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 147017, "totalSubmissionRaw": 413343}, "382": {"acRate": 63.35340105656435, "difficulty": "Medium", "likes": 3080, "dislikes": 705, "categoryTitle": "Algorithms", "frontendQuestionId": "382", "paidOnly": false, "title": "Linked List Random Node", "titleSlug": "linked-list-random-node", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Reservoir Sampling", "id": "VG9waWNUYWdOb2RlOjM2", "slug": "reservoir-sampling"}, {"name": "Randomized", "id": "VG9waWNUYWdOb2RlOjYxMDc1", "slug": "randomized"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 247401, "totalSubmissionRaw": 390510}, "383": {"acRate": 62.306859345775344, "difficulty": "Easy", "likes": 5023, "dislikes": 502, "categoryTitle": "Algorithms", "frontendQuestionId": "383", "paidOnly": false, "title": "Ransom Note", "titleSlug": "ransom-note", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 1253209, "totalSubmissionRaw": 2011353}, "384": {"acRate": 58.480875978753176, "difficulty": "Medium", "likes": 1351, "dislikes": 930, "categoryTitle": "Algorithms", "frontendQuestionId": "384", "paidOnly": false, "title": "Shuffle an Array", "titleSlug": "shuffle-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Randomized", "id": "VG9waWNUYWdOb2RlOjYxMDc1", "slug": "randomized"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 342295, "totalSubmissionRaw": 585311}, "385": {"acRate": 38.628524788710145, "difficulty": "Medium", "likes": 458, "dislikes": 1387, "categoryTitle": "Algorithms", "frontendQuestionId": "385", "paidOnly": false, "title": "Mini Parser", "titleSlug": "mini-parser", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 58686, "totalSubmissionRaw": 151924}, "386": {"acRate": 64.55048760666395, "difficulty": "Medium", "likes": 1974, "dislikes": 146, "categoryTitle": "Algorithms", "frontendQuestionId": "386", "paidOnly": false, "title": "Lexicographical Numbers", "titleSlug": "lexicographical-numbers", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 127087, "totalSubmissionRaw": 196880}, "387": {"acRate": 62.44893601853878, "difficulty": "Easy", "likes": 8988, "dislikes": 297, "categoryTitle": "Algorithms", "frontendQuestionId": "387", "paidOnly": false, "title": "First Unique Character in a String", "titleSlug": "first-unique-character-in-a-string", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 1778327, "totalSubmissionRaw": 2847651}, "388": {"acRate": 47.73275562010154, "difficulty": "Medium", "likes": 1291, "dislikes": 2500, "categoryTitle": "Algorithms", "frontendQuestionId": "388", "paidOnly": false, "title": "Longest Absolute File Path", "titleSlug": "longest-absolute-file-path", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 159078, "totalSubmissionRaw": 333268}, "389": {"acRate": 59.59374186833203, "difficulty": "Easy", "likes": 5007, "dislikes": 481, "categoryTitle": "Algorithms", "frontendQuestionId": "389", "paidOnly": false, "title": "Find the Difference", "titleSlug": "find-the-difference", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 769500, "totalSubmissionRaw": 1291241}, "390": {"acRate": 45.82750554644545, "difficulty": "Medium", "likes": 1559, "dislikes": 709, "categoryTitle": "Algorithms", "frontendQuestionId": "390", "paidOnly": false, "title": "Elimination Game", "titleSlug": "elimination-game", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 76015, "totalSubmissionRaw": 165871}, "391": {"acRate": 33.9821397930484, "difficulty": "Hard", "likes": 882, "dislikes": 119, "categoryTitle": "Algorithms", "frontendQuestionId": "391", "paidOnly": false, "title": "Perfect Rectangle", "titleSlug": "perfect-rectangle", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Line Sweep", "id": "VG9waWNUYWdOb2RlOjU2MTE5", "slug": "line-sweep"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 45550, "totalSubmissionRaw": 134041}, "392": {"acRate": 48.086797967474226, "difficulty": "Easy", "likes": 9676, "dislikes": 540, "categoryTitle": "Algorithms", "frontendQuestionId": "392", "paidOnly": false, "title": "Is Subsequence", "titleSlug": "is-subsequence", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1578124, "totalSubmissionRaw": 3281825}, "393": {"acRate": 45.22181770854046, "difficulty": "Medium", "likes": 905, "dislikes": 2865, "categoryTitle": "Algorithms", "frontendQuestionId": "393", "paidOnly": false, "title": "UTF-8 Validation", "titleSlug": "utf-8-validation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 125084, "totalSubmissionRaw": 276601}, "394": {"acRate": 59.642204664960396, "difficulty": "Medium", "likes": 12726, "dislikes": 620, "categoryTitle": "Algorithms", "frontendQuestionId": "394", "paidOnly": false, "title": "Decode String", "titleSlug": "decode-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 846837, "totalSubmissionRaw": 1419862}, "395": {"acRate": 45.035169132883865, "difficulty": "Medium", "likes": 6236, "dislikes": 517, "categoryTitle": "Algorithms", "frontendQuestionId": "395", "paidOnly": false, "title": "Longest Substring with At Least K Repeating Characters", "titleSlug": "longest-substring-with-at-least-k-repeating-characters", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 231456, "totalSubmissionRaw": 513945}, "396": {"acRate": 42.85998158290118, "difficulty": "Medium", "likes": 1565, "dislikes": 268, "categoryTitle": "Algorithms", "frontendQuestionId": "396", "paidOnly": false, "title": "Rotate Function", "titleSlug": "rotate-function", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 88433, "totalSubmissionRaw": 206330}, "397": {"acRate": 36.019201246743584, "difficulty": "Medium", "likes": 1334, "dislikes": 479, "categoryTitle": "Algorithms", "frontendQuestionId": "397", "paidOnly": false, "title": "Integer Replacement", "titleSlug": "integer-replacement", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 123883, "totalSubmissionRaw": 343936}, "398": {"acRate": 63.7070375326062, "difficulty": "Medium", "likes": 1288, "dislikes": 1287, "categoryTitle": "Algorithms", "frontendQuestionId": "398", "paidOnly": false, "title": "Random Pick Index", "titleSlug": "random-pick-index", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Reservoir Sampling", "id": "VG9waWNUYWdOb2RlOjM2", "slug": "reservoir-sampling"}, {"name": "Randomized", "id": "VG9waWNUYWdOb2RlOjYxMDc1", "slug": "randomized"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 235681, "totalSubmissionRaw": 369945}, "399": {"acRate": 62.0730542595451, "difficulty": "Medium", "likes": 9324, "dislikes": 944, "categoryTitle": "Algorithms", "frontendQuestionId": "399", "paidOnly": false, "title": "Evaluate Division", "titleSlug": "evaluate-division", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 497846, "totalSubmissionRaw": 802032}, "400": {"acRate": 35.04422420955579, "difficulty": "Medium", "likes": 1078, "dislikes": 2060, "categoryTitle": "Algorithms", "frontendQuestionId": "400", "paidOnly": false, "title": "Nth Digit", "titleSlug": "nth-digit", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 99964, "totalSubmissionRaw": 285251}, "401": {"acRate": 54.96252161505477, "difficulty": "Easy", "likes": 1400, "dislikes": 2572, "categoryTitle": "Algorithms", "frontendQuestionId": "401", "paidOnly": false, "title": "Binary Watch", "titleSlug": "binary-watch", "topicTags": [{"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 149071, "totalSubmissionRaw": 271223}, "402": {"acRate": 33.80978251812349, "difficulty": "Medium", "likes": 9514, "dislikes": 493, "categoryTitle": "Algorithms", "frontendQuestionId": "402", "paidOnly": false, "title": "Remove K Digits", "titleSlug": "remove-k-digits", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 507189, "totalSubmissionRaw": 1500125}, "403": {"acRate": 46.1717642806106, "difficulty": "Hard", "likes": 5588, "dislikes": 253, "categoryTitle": "Algorithms", "frontendQuestionId": "403", "paidOnly": false, "title": "Frog Jump", "titleSlug": "frog-jump", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 273341, "totalSubmissionRaw": 592009}, "404": {"acRate": 60.884700022338514, "difficulty": "Easy", "likes": 5490, "dislikes": 310, "categoryTitle": "Algorithms", "frontendQuestionId": "404", "paidOnly": false, "title": "Sum of Left Leaves", "titleSlug": "sum-of-left-leaves", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 640504, "totalSubmissionRaw": 1051995}, "405": {"acRate": 49.07279082405373, "difficulty": "Easy", "likes": 1313, "dislikes": 221, "categoryTitle": "Algorithms", "frontendQuestionId": "405", "paidOnly": false, "title": "Convert a Number to Hexadecimal", "titleSlug": "convert-a-number-to-hexadecimal", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 152610, "totalSubmissionRaw": 310987}, "406": {"acRate": 73.65673896260208, "difficulty": "Medium", "likes": 7083, "dislikes": 719, "categoryTitle": "Algorithms", "frontendQuestionId": "406", "paidOnly": false, "title": "Queue Reconstruction by Height", "titleSlug": "queue-reconstruction-by-height", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 307209, "totalSubmissionRaw": 417082}, "407": {"acRate": 48.172079488171654, "difficulty": "Hard", "likes": 3753, "dislikes": 95, "categoryTitle": "Algorithms", "frontendQuestionId": "407", "paidOnly": false, "title": "Trapping Rain Water II", "titleSlug": "trapping-rain-water-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 90879, "totalSubmissionRaw": 188654}, "408": {"acRate": 36.01864485455466, "difficulty": "Easy", "likes": 741, "dislikes": 2219, "categoryTitle": "Algorithms", "frontendQuestionId": "408", "paidOnly": true, "title": "Valid Word Abbreviation", "titleSlug": "valid-word-abbreviation", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 204848, "totalSubmissionRaw": 568733}, "409": {"acRate": 55.35175738626968, "difficulty": "Easy", "likes": 5918, "dislikes": 411, "categoryTitle": "Algorithms", "frontendQuestionId": "409", "paidOnly": false, "title": "Longest Palindrome", "titleSlug": "longest-palindrome", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 810123, "totalSubmissionRaw": 1463587}, "410": {"acRate": 56.14355685584248, "difficulty": "Hard", "likes": 9881, "dislikes": 226, "categoryTitle": "Algorithms", "frontendQuestionId": "410", "paidOnly": false, "title": "Split Array Largest Sum", "titleSlug": "split-array-largest-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 375743, "totalSubmissionRaw": 669254}, "411": {"acRate": 39.79852249832102, "difficulty": "Hard", "likes": 181, "dislikes": 146, "categoryTitle": "Algorithms", "frontendQuestionId": "411", "paidOnly": true, "title": "Minimum Unique Word Abbreviation", "titleSlug": "minimum-unique-word-abbreviation", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14815, "totalSubmissionRaw": 37225}, "412": {"acRate": 72.76405677599374, "difficulty": "Easy", "likes": 2788, "dislikes": 382, "categoryTitle": "Algorithms", "frontendQuestionId": "412", "paidOnly": false, "title": "Fizz Buzz", "titleSlug": "fizz-buzz", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 1301796, "totalSubmissionRaw": 1789065}, "413": {"acRate": 65.0231015677403, "difficulty": "Medium", "likes": 5351, "dislikes": 295, "categoryTitle": "Algorithms", "frontendQuestionId": "413", "paidOnly": false, "title": "Arithmetic Slices", "titleSlug": "arithmetic-slices", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 312146, "totalSubmissionRaw": 480054}, "414": {"acRate": 35.41810985897369, "difficulty": "Easy", "likes": 3044, "dislikes": 3183, "categoryTitle": "Algorithms", "frontendQuestionId": "414", "paidOnly": false, "title": "Third Maximum Number", "titleSlug": "third-maximum-number", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 567011, "totalSubmissionRaw": 1600906}, "415": {"acRate": 51.66276343140596, "difficulty": "Easy", "likes": 5046, "dislikes": 755, "categoryTitle": "Algorithms", "frontendQuestionId": "415", "paidOnly": false, "title": "Add Strings", "titleSlug": "add-strings", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 698635, "totalSubmissionRaw": 1352298}, "416": {"acRate": 46.63222884492456, "difficulty": "Medium", "likes": 12316, "dislikes": 252, "categoryTitle": "Algorithms", "frontendQuestionId": "416", "paidOnly": false, "title": "Partition Equal Subset Sum", "titleSlug": "partition-equal-subset-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 899480, "totalSubmissionRaw": 1928882}, "417": {"acRate": 55.78666630852894, "difficulty": "Medium", "likes": 7431, "dislikes": 1486, "categoryTitle": "Algorithms", "frontendQuestionId": "417", "paidOnly": false, "title": "Pacific Atlantic Water Flow", "titleSlug": "pacific-atlantic-water-flow", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 498460, "totalSubmissionRaw": 893511}, "418": {"acRate": 36.23918441848784, "difficulty": "Medium", "likes": 1119, "dislikes": 542, "categoryTitle": "Algorithms", "frontendQuestionId": "418", "paidOnly": true, "title": "Sentence Screen Fitting", "titleSlug": "sentence-screen-fitting", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 102446, "totalSubmissionRaw": 282694}, "419": {"acRate": 75.57898893319373, "difficulty": "Medium", "likes": 2300, "dislikes": 972, "categoryTitle": "Algorithms", "frontendQuestionId": "419", "paidOnly": false, "title": "Battleships in a Board", "titleSlug": "battleships-in-a-board", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 214373, "totalSubmissionRaw": 283641}, "420": {"acRate": 13.956142678564007, "difficulty": "Hard", "likes": 882, "dislikes": 1732, "categoryTitle": "Algorithms", "frontendQuestionId": "420", "paidOnly": false, "title": "Strong Password Checker", "titleSlug": "strong-password-checker", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 43653, "totalSubmissionRaw": 312787}, "421": {"acRate": 53.317635503956986, "difficulty": "Medium", "likes": 5528, "dislikes": 395, "categoryTitle": "Algorithms", "frontendQuestionId": "421", "paidOnly": false, "title": "Maximum XOR of Two Numbers in an Array", "titleSlug": "maximum-xor-of-two-numbers-in-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 169372, "totalSubmissionRaw": 317666}, "422": {"acRate": 41.34017982404611, "difficulty": "Easy", "likes": 429, "dislikes": 270, "categoryTitle": "Algorithms", "frontendQuestionId": "422", "paidOnly": true, "title": "Valid Word Square", "titleSlug": "valid-word-square", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 59818, "totalSubmissionRaw": 144697}, "423": {"acRate": 51.222566236614064, "difficulty": "Medium", "likes": 828, "dislikes": 2730, "categoryTitle": "Algorithms", "frontendQuestionId": "423", "paidOnly": false, "title": "Reconstruct Original Digits from English", "titleSlug": "reconstruct-original-digits-from-english", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 82224, "totalSubmissionRaw": 160523}, "424": {"acRate": 54.90353660344347, "difficulty": "Medium", "likes": 10757, "dislikes": 545, "categoryTitle": "Algorithms", "frontendQuestionId": "424", "paidOnly": false, "title": "Longest Repeating Character Replacement", "titleSlug": "longest-repeating-character-replacement", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 825929, "totalSubmissionRaw": 1504334}, "425": {"acRate": 53.505010205315294, "difficulty": "Hard", "likes": 1093, "dislikes": 73, "categoryTitle": "Algorithms", "frontendQuestionId": "425", "paidOnly": true, "title": "Word Squares", "titleSlug": "word-squares", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 75235, "totalSubmissionRaw": 140613}, "426": {"acRate": 64.89078397469872, "difficulty": "Medium", "likes": 2610, "dislikes": 214, "categoryTitle": "Algorithms", "frontendQuestionId": "426", "paidOnly": true, "title": "Convert Binary Search Tree to Sorted Doubly Linked List", "titleSlug": "convert-binary-search-tree-to-sorted-doubly-linked-list", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}, {"name": "Doubly-Linked List", "id": "VG9waWNUYWdOb2RlOjYxMDU4", "slug": "doubly-linked-list"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 298737, "totalSubmissionRaw": 460370}, "427": {"acRate": 75.82766702352363, "difficulty": "Medium", "likes": 1519, "dislikes": 1838, "categoryTitle": "Algorithms", "frontendQuestionId": "427", "paidOnly": false, "title": "Construct Quad Tree", "titleSlug": "construct-quad-tree", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 131034, "totalSubmissionRaw": 172805}, "428": {"acRate": 67.46742762737956, "difficulty": "Hard", "likes": 1050, "dislikes": 57, "categoryTitle": "Algorithms", "frontendQuestionId": "428", "paidOnly": true, "title": "Serialize and Deserialize N-ary Tree", "titleSlug": "serialize-and-deserialize-n-ary-tree", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 89843, "totalSubmissionRaw": 133165}, "429": {"acRate": 70.92122182484516, "difficulty": "Medium", "likes": 3622, "dislikes": 137, "categoryTitle": "Algorithms", "frontendQuestionId": "429", "paidOnly": false, "title": "N-ary Tree Level Order Traversal", "titleSlug": "n-ary-tree-level-order-traversal", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 312725, "totalSubmissionRaw": 440947}, "430": {"acRate": 60.36217412231234, "difficulty": "Medium", "likes": 5041, "dislikes": 326, "categoryTitle": "Algorithms", "frontendQuestionId": "430", "paidOnly": false, "title": "Flatten a Multilevel Doubly Linked List", "titleSlug": "flatten-a-multilevel-doubly-linked-list", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Doubly-Linked List", "id": "VG9waWNUYWdOb2RlOjYxMDU4", "slug": "doubly-linked-list"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 336099, "totalSubmissionRaw": 556804}, "431": {"acRate": 79.63236619210669, "difficulty": "Hard", "likes": 519, "dislikes": 29, "categoryTitle": "Algorithms", "frontendQuestionId": "431", "paidOnly": true, "title": "Encode N-ary Tree to Binary Tree", "titleSlug": "encode-n-ary-tree-to-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 22094, "totalSubmissionRaw": 27745}, "432": {"acRate": 37.04487981589563, "difficulty": "Hard", "likes": 1576, "dislikes": 174, "categoryTitle": "Algorithms", "frontendQuestionId": "432", "paidOnly": false, "title": "All O`one Data Structure", "titleSlug": "all-oone-data-structure", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Doubly-Linked List", "id": "VG9waWNUYWdOb2RlOjYxMDU4", "slug": "doubly-linked-list"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 84672, "totalSubmissionRaw": 228566}, "433": {"acRate": 54.24920185476615, "difficulty": "Medium", "likes": 2988, "dislikes": 323, "categoryTitle": "Algorithms", "frontendQuestionId": "433", "paidOnly": false, "title": "Minimum Genetic Mutation", "titleSlug": "minimum-genetic-mutation", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 180286, "totalSubmissionRaw": 332331}, "434": {"acRate": 36.37285772842239, "difficulty": "Easy", "likes": 791, "dislikes": 1265, "categoryTitle": "Algorithms", "frontendQuestionId": "434", "paidOnly": false, "title": "Number of Segments in a String", "titleSlug": "number-of-segments-in-a-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 192559, "totalSubmissionRaw": 529403}, "435": {"acRate": 53.88188807269286, "difficulty": "Medium", "likes": 8196, "dislikes": 222, "categoryTitle": "Algorithms", "frontendQuestionId": "435", "paidOnly": false, "title": "Non-overlapping Intervals", "titleSlug": "non-overlapping-intervals", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 617173, "totalSubmissionRaw": 1145419}, "436": {"acRate": 52.52227223137502, "difficulty": "Medium", "likes": 2155, "dislikes": 359, "categoryTitle": "Algorithms", "frontendQuestionId": "436", "paidOnly": false, "title": "Find Right Interval", "titleSlug": "find-right-interval", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 118909, "totalSubmissionRaw": 226398}, "437": {"acRate": 46.125357614586854, "difficulty": "Medium", "likes": 10990, "dislikes": 521, "categoryTitle": "Algorithms", "frontendQuestionId": "437", "paidOnly": false, "title": "Path Sum III", "titleSlug": "path-sum-iii", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 591215, "totalSubmissionRaw": 1281742}, "438": {"acRate": 51.17733525548252, "difficulty": "Medium", "likes": 12351, "dislikes": 341, "categoryTitle": "Algorithms", "frontendQuestionId": "438", "paidOnly": false, "title": "Find All Anagrams in a String", "titleSlug": "find-all-anagrams-in-a-string", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 903474, "totalSubmissionRaw": 1765381}, "439": {"acRate": 61.09925001368588, "difficulty": "Medium", "likes": 495, "dislikes": 68, "categoryTitle": "Algorithms", "frontendQuestionId": "439", "paidOnly": true, "title": "Ternary Expression Parser", "titleSlug": "ternary-expression-parser", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 33483, "totalSubmissionRaw": 54800}, "440": {"acRate": 32.59382183712611, "difficulty": "Hard", "likes": 769, "dislikes": 89, "categoryTitle": "Algorithms", "frontendQuestionId": "440", "paidOnly": false, "title": "K-th Smallest in Lexicographical Order", "titleSlug": "k-th-smallest-in-lexicographical-order", "topicTags": [{"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23962, "totalSubmissionRaw": 73517}, "441": {"acRate": 46.77876077391112, "difficulty": "Easy", "likes": 3889, "dislikes": 1330, "categoryTitle": "Algorithms", "frontendQuestionId": "441", "paidOnly": false, "title": "Arranging Coins", "titleSlug": "arranging-coins", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 459910, "totalSubmissionRaw": 983161}, "442": {"acRate": 75.87674167934854, "difficulty": "Medium", "likes": 10466, "dislikes": 405, "categoryTitle": "Algorithms", "frontendQuestionId": "442", "paidOnly": false, "title": "Find All Duplicates in an Array", "titleSlug": "find-all-duplicates-in-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 806720, "totalSubmissionRaw": 1063198}, "443": {"acRate": 55.40632907773647, "difficulty": "Medium", "likes": 5088, "dislikes": 7972, "categoryTitle": "Algorithms", "frontendQuestionId": "443", "paidOnly": false, "title": "String Compression", "titleSlug": "string-compression", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 639565, "totalSubmissionRaw": 1154317}, "444": {"acRate": 28.451815148144405, "difficulty": "Medium", "likes": 571, "dislikes": 1510, "categoryTitle": "Algorithms", "frontendQuestionId": "444", "paidOnly": true, "title": "Sequence Reconstruction", "titleSlug": "sequence-reconstruction", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 56272, "totalSubmissionRaw": 197780}, "445": {"acRate": 61.31937793013056, "difficulty": "Medium", "likes": 5894, "dislikes": 289, "categoryTitle": "Algorithms", "frontendQuestionId": "445", "paidOnly": false, "title": "Add Two Numbers II", "titleSlug": "add-two-numbers-ii", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 486556, "totalSubmissionRaw": 793478}, "446": {"acRate": 54.58686501758635, "difficulty": "Hard", "likes": 3353, "dislikes": 155, "categoryTitle": "Algorithms", "frontendQuestionId": "446", "paidOnly": false, "title": "Arithmetic Slices II - Subsequence", "titleSlug": "arithmetic-slices-ii-subsequence", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 151472, "totalSubmissionRaw": 277488}, "447": {"acRate": 55.66053183128111, "difficulty": "Medium", "likes": 838, "dislikes": 1015, "categoryTitle": "Algorithms", "frontendQuestionId": "447", "paidOnly": false, "title": "Number of Boomerangs", "titleSlug": "number-of-boomerangs", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 101979, "totalSubmissionRaw": 183216}, "448": {"acRate": 61.24986009572433, "difficulty": "Easy", "likes": 9440, "dislikes": 493, "categoryTitle": "Algorithms", "frontendQuestionId": "448", "paidOnly": false, "title": "Find All Numbers Disappeared in an Array", "titleSlug": "find-all-numbers-disappeared-in-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 924847, "totalSubmissionRaw": 1509959}, "449": {"acRate": 57.8845267594963, "difficulty": "Medium", "likes": 3489, "dislikes": 171, "categoryTitle": "Algorithms", "frontendQuestionId": "449", "paidOnly": false, "title": "Serialize and Deserialize BST", "titleSlug": "serialize-and-deserialize-bst", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 239903, "totalSubmissionRaw": 414451}, "450": {"acRate": 51.79797719878644, "difficulty": "Medium", "likes": 9176, "dislikes": 284, "categoryTitle": "Algorithms", "frontendQuestionId": "450", "paidOnly": false, "title": "Delete Node in a BST", "titleSlug": "delete-node-in-a-bst", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 547523, "totalSubmissionRaw": 1057042}, "451": {"acRate": 72.89838367432479, "difficulty": "Medium", "likes": 8332, "dislikes": 293, "categoryTitle": "Algorithms", "frontendQuestionId": "451", "paidOnly": false, "title": "Sort Characters By Frequency", "titleSlug": "sort-characters-by-frequency", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Bucket Sort", "id": "VG9waWNUYWdOb2RlOjYxMDYw", "slug": "bucket-sort"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 779169, "totalSubmissionRaw": 1068843}, "452": {"acRate": 59.24126910681523, "difficulty": "Medium", "likes": 7483, "dislikes": 242, "categoryTitle": "Algorithms", "frontendQuestionId": "452", "paidOnly": false, "title": "Minimum Number of Arrows to Burst Balloons", "titleSlug": "minimum-number-of-arrows-to-burst-balloons", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 550538, "totalSubmissionRaw": 929315}, "453": {"acRate": 56.92959769652192, "difficulty": "Medium", "likes": 2579, "dislikes": 1893, "categoryTitle": "Algorithms", "frontendQuestionId": "453", "paidOnly": false, "title": "Minimum Moves to Equal Array Elements", "titleSlug": "minimum-moves-to-equal-array-elements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 176759, "totalSubmissionRaw": 310487}, "454": {"acRate": 57.341575974058436, "difficulty": "Medium", "likes": 4909, "dislikes": 143, "categoryTitle": "Algorithms", "frontendQuestionId": "454", "paidOnly": false, "title": "4Sum II", "titleSlug": "4sum-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 332620, "totalSubmissionRaw": 580069}, "455": {"acRate": 52.94203698972696, "difficulty": "Easy", "likes": 3969, "dislikes": 375, "categoryTitle": "Algorithms", "frontendQuestionId": "455", "paidOnly": false, "title": "Assign Cookies", "titleSlug": "assign-cookies", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 499425, "totalSubmissionRaw": 943343}, "456": {"acRate": 33.792732764861114, "difficulty": "Medium", "likes": 7218, "dislikes": 437, "categoryTitle": "Algorithms", "frontendQuestionId": "456", "paidOnly": false, "title": "132 Pattern", "titleSlug": "132-pattern", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 264688, "totalSubmissionRaw": 783267}, "457": {"acRate": 34.41289711544401, "difficulty": "Medium", "likes": 692, "dislikes": 788, "categoryTitle": "Algorithms", "frontendQuestionId": "457", "paidOnly": false, "title": "Circular Array Loop", "titleSlug": "circular-array-loop", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 83570, "totalSubmissionRaw": 242845}, "458": {"acRate": 59.55748411652326, "difficulty": "Hard", "likes": 1788, "dislikes": 3356, "categoryTitle": "Algorithms", "frontendQuestionId": "458", "paidOnly": false, "title": "Poor Pigs", "titleSlug": "poor-pigs", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 120645, "totalSubmissionRaw": 202569}, "459": {"acRate": 46.227468653980814, "difficulty": "Easy", "likes": 6407, "dislikes": 522, "categoryTitle": "Algorithms", "frontendQuestionId": "459", "paidOnly": false, "title": "Repeated Substring Pattern", "titleSlug": "repeated-substring-pattern", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 466092, "totalSubmissionRaw": 1008256}, "460": {"acRate": 44.70199750248129, "difficulty": "Hard", "likes": 5688, "dislikes": 330, "categoryTitle": "Algorithms", "frontendQuestionId": "460", "paidOnly": false, "title": "LFU Cache", "titleSlug": "lfu-cache", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Doubly-Linked List", "id": "VG9waWNUYWdOb2RlOjYxMDU4", "slug": "doubly-linked-list"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 261677, "totalSubmissionRaw": 585380}, "461": {"acRate": 75.5389119699797, "difficulty": "Easy", "likes": 3840, "dislikes": 218, "categoryTitle": "Algorithms", "frontendQuestionId": "461", "paidOnly": false, "title": "Hamming Distance", "titleSlug": "hamming-distance", "topicTags": [{"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 586186, "totalSubmissionRaw": 776006}, "462": {"acRate": 60.305427592149854, "difficulty": "Medium", "likes": 3356, "dislikes": 124, "categoryTitle": "Algorithms", "frontendQuestionId": "462", "paidOnly": false, "title": "Minimum Moves to Equal Array Elements II", "titleSlug": "minimum-moves-to-equal-array-elements-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 186152, "totalSubmissionRaw": 308682}, "463": {"acRate": 73.01678127457377, "difficulty": "Easy", "likes": 6846, "dislikes": 387, "categoryTitle": "Algorithms", "frontendQuestionId": "463", "paidOnly": false, "title": "Island Perimeter", "titleSlug": "island-perimeter", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 654621, "totalSubmissionRaw": 896534}, "464": {"acRate": 29.764833188544955, "difficulty": "Medium", "likes": 2662, "dislikes": 400, "categoryTitle": "Algorithms", "frontendQuestionId": "464", "paidOnly": false, "title": "Can I Win", "titleSlug": "can-i-win", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 97648, "totalSubmissionRaw": 328065}, "465": {"acRate": 49.60433610001881, "difficulty": "Hard", "likes": 1460, "dislikes": 151, "categoryTitle": "Algorithms", "frontendQuestionId": "465", "paidOnly": true, "title": "Optimal Account Balancing", "titleSlug": "optimal-account-balancing", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 94904, "totalSubmissionRaw": 191323}, "466": {"acRate": 30.579931919677712, "difficulty": "Hard", "likes": 406, "dislikes": 359, "categoryTitle": "Algorithms", "frontendQuestionId": "466", "paidOnly": false, "title": "Count The Repetitions", "titleSlug": "count-the-repetitions", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19584, "totalSubmissionRaw": 64042}, "467": {"acRate": 40.059176245712344, "difficulty": "Medium", "likes": 1442, "dislikes": 175, "categoryTitle": "Algorithms", "frontendQuestionId": "467", "paidOnly": false, "title": "Unique Substrings in Wraparound String", "titleSlug": "unique-substrings-in-wraparound-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 45897, "totalSubmissionRaw": 114573}, "468": {"acRate": 27.29215106124047, "difficulty": "Medium", "likes": 1022, "dislikes": 2711, "categoryTitle": "Algorithms", "frontendQuestionId": "468", "paidOnly": false, "title": "Validate IP Address", "titleSlug": "validate-ip-address", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 167972, "totalSubmissionRaw": 615459}, "469": {"acRate": 39.53106168511012, "difficulty": "Medium", "likes": 99, "dislikes": 237, "categoryTitle": "Algorithms", "frontendQuestionId": "469", "paidOnly": true, "title": "Convex Polygon", "titleSlug": "convex-polygon", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10824, "totalSubmissionRaw": 27381}, "470": {"acRate": 45.81174438687392, "difficulty": "Medium", "likes": 1109, "dislikes": 376, "categoryTitle": "Algorithms", "frontendQuestionId": "470", "paidOnly": false, "title": "Implement Rand10() Using Rand7()", "titleSlug": "implement-rand10-using-rand7", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Rejection Sampling", "id": "VG9waWNUYWdOb2RlOjU0NTY5", "slug": "rejection-sampling"}, {"name": "Randomized", "id": "VG9waWNUYWdOb2RlOjYxMDc1", "slug": "randomized"}, {"name": "Probability and Statistics", "id": "VG9waWNUYWdOb2RlOjYxMDc5", "slug": "probability-and-statistics"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 85941, "totalSubmissionRaw": 187596}, "471": {"acRate": 50.45925346882939, "difficulty": "Hard", "likes": 625, "dislikes": 53, "categoryTitle": "Algorithms", "frontendQuestionId": "471", "paidOnly": true, "title": "Encode String with Shortest Length", "titleSlug": "encode-string-with-shortest-length", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30984, "totalSubmissionRaw": 61404}, "472": {"acRate": 49.36211235067288, "difficulty": "Hard", "likes": 3871, "dislikes": 283, "categoryTitle": "Algorithms", "frontendQuestionId": "472", "paidOnly": false, "title": "Concatenated Words", "titleSlug": "concatenated-words", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 229907, "totalSubmissionRaw": 465753}, "473": {"acRate": 40.39193844109091, "difficulty": "Medium", "likes": 3827, "dislikes": 297, "categoryTitle": "Algorithms", "frontendQuestionId": "473", "paidOnly": false, "title": "Matchsticks to Square", "titleSlug": "matchsticks-to-square", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 168972, "totalSubmissionRaw": 418331}, "474": {"acRate": 47.873193768147054, "difficulty": "Medium", "likes": 5443, "dislikes": 461, "categoryTitle": "Algorithms", "frontendQuestionId": "474", "paidOnly": false, "title": "Ones and Zeroes", "titleSlug": "ones-and-zeroes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 211870, "totalSubmissionRaw": 442567}, "475": {"acRate": 38.37582589868976, "difficulty": "Medium", "likes": 2112, "dislikes": 1166, "categoryTitle": "Algorithms", "frontendQuestionId": "475", "paidOnly": false, "title": "Heaters", "titleSlug": "heaters", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 123366, "totalSubmissionRaw": 321468}, "476": {"acRate": 67.71251433131424, "difficulty": "Easy", "likes": 2672, "dislikes": 124, "categoryTitle": "Algorithms", "frontendQuestionId": "476", "paidOnly": false, "title": "Number Complement", "titleSlug": "number-complement", "topicTags": [{"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 341957, "totalSubmissionRaw": 505013}, "477": {"acRate": 52.92653609559499, "difficulty": "Medium", "likes": 2214, "dislikes": 91, "categoryTitle": "Algorithms", "frontendQuestionId": "477", "paidOnly": false, "title": "Total Hamming Distance", "titleSlug": "total-hamming-distance", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 112281, "totalSubmissionRaw": 212145}, "478": {"acRate": 40.02019778586536, "difficulty": "Medium", "likes": 456, "dislikes": 771, "categoryTitle": "Algorithms", "frontendQuestionId": "478", "paidOnly": false, "title": "Generate Random Point in a Circle", "titleSlug": "generate-random-point-in-a-circle", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}, {"name": "Rejection Sampling", "id": "VG9waWNUYWdOb2RlOjU0NTY5", "slug": "rejection-sampling"}, {"name": "Randomized", "id": "VG9waWNUYWdOb2RlOjYxMDc1", "slug": "randomized"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 42006, "totalSubmissionRaw": 104962}, "479": {"acRate": 33.59918774130629, "difficulty": "Hard", "likes": 177, "dislikes": 1560, "categoryTitle": "Algorithms", "frontendQuestionId": "479", "paidOnly": false, "title": "Largest Palindrome Product", "titleSlug": "largest-palindrome-product", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25150, "totalSubmissionRaw": 74853}, "480": {"acRate": 38.94380603611567, "difficulty": "Hard", "likes": 3221, "dislikes": 200, "categoryTitle": "Algorithms", "frontendQuestionId": "480", "paidOnly": false, "title": "Sliding Window Median", "titleSlug": "sliding-window-median", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 154198, "totalSubmissionRaw": 395950}, "481": {"acRate": 51.527869917818606, "difficulty": "Medium", "likes": 319, "dislikes": 1304, "categoryTitle": "Algorithms", "frontendQuestionId": "481", "paidOnly": false, "title": "Magical String", "titleSlug": "magical-string", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 38059, "totalSubmissionRaw": 73861}, "482": {"acRate": 44.002936741493784, "difficulty": "Easy", "likes": 1105, "dislikes": 1416, "categoryTitle": "Algorithms", "frontendQuestionId": "482", "paidOnly": false, "title": "License Key Formatting", "titleSlug": "license-key-formatting", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 289482, "totalSubmissionRaw": 657871}, "483": {"acRate": 41.321647488977305, "difficulty": "Hard", "likes": 387, "dislikes": 506, "categoryTitle": "Algorithms", "frontendQuestionId": "483", "paidOnly": false, "title": "Smallest Good Base", "titleSlug": "smallest-good-base", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23055, "totalSubmissionRaw": 55794}, "484": {"acRate": 66.93812725982495, "difficulty": "Medium", "likes": 701, "dislikes": 148, "categoryTitle": "Algorithms", "frontendQuestionId": "484", "paidOnly": true, "title": "Find Permutation", "titleSlug": "find-permutation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 39618, "totalSubmissionRaw": 59186}, "485": {"acRate": 60.13215539059692, "difficulty": "Easy", "likes": 5790, "dislikes": 457, "categoryTitle": "Algorithms", "frontendQuestionId": "485", "paidOnly": false, "title": "Max Consecutive Ones", "titleSlug": "max-consecutive-ones", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1283220, "totalSubmissionRaw": 2133999}, "486": {"acRate": 55.42641199690117, "difficulty": "Medium", "likes": 5842, "dislikes": 284, "categoryTitle": "Algorithms", "frontendQuestionId": "486", "paidOnly": false, "title": "Predict the Winner", "titleSlug": "predict-the-winner", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 240391, "totalSubmissionRaw": 433712}, "487": {"acRate": 50.48209273453524, "difficulty": "Medium", "likes": 1543, "dislikes": 26, "categoryTitle": "Algorithms", "frontendQuestionId": "487", "paidOnly": true, "title": "Max Consecutive Ones II", "titleSlug": "max-consecutive-ones-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 149637, "totalSubmissionRaw": 296416}, "488": {"acRate": 32.61471919983781, "difficulty": "Hard", "likes": 455, "dislikes": 493, "categoryTitle": "Algorithms", "frontendQuestionId": "488", "paidOnly": false, "title": "Zuma Game", "titleSlug": "zuma-game", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24130, "totalSubmissionRaw": 73985}, "489": {"acRate": 76.83677818993117, "difficulty": "Hard", "likes": 2774, "dislikes": 177, "categoryTitle": "Algorithms", "frontendQuestionId": "489", "paidOnly": true, "title": "Robot Room Cleaner", "titleSlug": "robot-room-cleaner", "topicTags": [{"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 169439, "totalSubmissionRaw": 220519}, "490": {"acRate": 58.30476341465026, "difficulty": "Medium", "likes": 1847, "dislikes": 184, "categoryTitle": "Algorithms", "frontendQuestionId": "490", "paidOnly": true, "title": "The Maze", "titleSlug": "the-maze", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 176527, "totalSubmissionRaw": 302766}, "491": {"acRate": 60.97406214087804, "difficulty": "Medium", "likes": 3649, "dislikes": 230, "categoryTitle": "Algorithms", "frontendQuestionId": "491", "paidOnly": false, "title": "Non-decreasing Subsequences", "titleSlug": "non-decreasing-subsequences", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 172970, "totalSubmissionRaw": 283678}, "492": {"acRate": 58.448753462603875, "difficulty": "Easy", "likes": 703, "dislikes": 389, "categoryTitle": "Algorithms", "frontendQuestionId": "492", "paidOnly": false, "title": "Construct the Rectangle", "titleSlug": "construct-the-rectangle", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 123224, "totalSubmissionRaw": 210824}, "493": {"acRate": 30.878740284322014, "difficulty": "Hard", "likes": 6197, "dislikes": 269, "categoryTitle": "Algorithms", "frontendQuestionId": "493", "paidOnly": false, "title": "Reverse Pairs", "titleSlug": "reverse-pairs", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Merge Sort", "id": "VG9waWNUYWdOb2RlOjYxMDUx", "slug": "merge-sort"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 199355, "totalSubmissionRaw": 645603}, "494": {"acRate": 47.31053446877475, "difficulty": "Medium", "likes": 10936, "dislikes": 362, "categoryTitle": "Algorithms", "frontendQuestionId": "494", "paidOnly": false, "title": "Target Sum", "titleSlug": "target-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 641064, "totalSubmissionRaw": 1355011}, "495": {"acRate": 56.66750286697248, "difficulty": "Easy", "likes": 1153, "dislikes": 129, "categoryTitle": "Algorithms", "frontendQuestionId": "495", "paidOnly": false, "title": "Teemo Attacking", "titleSlug": "teemo-attacking", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 158125, "totalSubmissionRaw": 279040}, "496": {"acRate": 72.83086720982337, "difficulty": "Easy", "likes": 8068, "dislikes": 770, "categoryTitle": "Algorithms", "frontendQuestionId": "496", "paidOnly": false, "title": "Next Greater Element I", "titleSlug": "next-greater-element-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 788617, "totalSubmissionRaw": 1082806}, "497": {"acRate": 40.18421303808342, "difficulty": "Medium", "likes": 482, "dislikes": 674, "categoryTitle": "Algorithms", "frontendQuestionId": "497", "paidOnly": false, "title": "Random Point in Non-overlapping Rectangles", "titleSlug": "random-point-in-non-overlapping-rectangles", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Reservoir Sampling", "id": "VG9waWNUYWdOb2RlOjM2", "slug": "reservoir-sampling"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}, {"name": "Randomized", "id": "VG9waWNUYWdOb2RlOjYxMDc1", "slug": "randomized"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 42101, "totalSubmissionRaw": 104770}, "498": {"acRate": 60.76281319375316, "difficulty": "Medium", "likes": 3454, "dislikes": 688, "categoryTitle": "Algorithms", "frontendQuestionId": "498", "paidOnly": false, "title": "Diagonal Traverse", "titleSlug": "diagonal-traverse", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 315582, "totalSubmissionRaw": 519367}, "499": {"acRate": 49.135095626751124, "difficulty": "Hard", "likes": 484, "dislikes": 72, "categoryTitle": "Algorithms", "frontendQuestionId": "499", "paidOnly": true, "title": "The Maze III", "titleSlug": "the-maze-iii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 32268, "totalSubmissionRaw": 65672}, "500": {"acRate": 71.09866998253813, "difficulty": "Easy", "likes": 1610, "dislikes": 1136, "categoryTitle": "Algorithms", "frontendQuestionId": "500", "paidOnly": false, "title": "Keyboard Row", "titleSlug": "keyboard-row", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 239006, "totalSubmissionRaw": 336161}, "501": {"acRate": 56.494254001852575, "difficulty": "Easy", "likes": 3898, "dislikes": 783, "categoryTitle": "Algorithms", "frontendQuestionId": "501", "paidOnly": false, "title": "Find Mode in Binary Search Tree", "titleSlug": "find-mode-in-binary-search-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 316539, "totalSubmissionRaw": 560303}, "502": {"acRate": 53.16110181154525, "difficulty": "Hard", "likes": 3795, "dislikes": 257, "categoryTitle": "Algorithms", "frontendQuestionId": "502", "paidOnly": false, "title": "IPO", "titleSlug": "ipo", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 232153, "totalSubmissionRaw": 436698}, "503": {"acRate": 64.49733080968149, "difficulty": "Medium", "likes": 8010, "dislikes": 196, "categoryTitle": "Algorithms", "frontendQuestionId": "503", "paidOnly": false, "title": "Next Greater Element II", "titleSlug": "next-greater-element-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 436516, "totalSubmissionRaw": 676797}, "504": {"acRate": 50.51411323158439, "difficulty": "Easy", "likes": 804, "dislikes": 230, "categoryTitle": "Algorithms", "frontendQuestionId": "504", "paidOnly": false, "title": "Base 7", "titleSlug": "base-7", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 139571, "totalSubmissionRaw": 276301}, "505": {"acRate": 53.547580318195365, "difficulty": "Medium", "likes": 1326, "dislikes": 57, "categoryTitle": "Algorithms", "frontendQuestionId": "505", "paidOnly": true, "title": "The Maze II", "titleSlug": "the-maze-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 109621, "totalSubmissionRaw": 204717}, "506": {"acRate": 71.98111767343785, "difficulty": "Easy", "likes": 1917, "dislikes": 126, "categoryTitle": "Algorithms", "frontendQuestionId": "506", "paidOnly": false, "title": "Relative Ranks", "titleSlug": "relative-ranks", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 301765, "totalSubmissionRaw": 419228}, "507": {"acRate": 41.65386739551965, "difficulty": "Easy", "likes": 1090, "dislikes": 1231, "categoryTitle": "Algorithms", "frontendQuestionId": "507", "paidOnly": false, "title": "Perfect Number", "titleSlug": "perfect-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 206654, "totalSubmissionRaw": 496122}, "508": {"acRate": 66.90058532932764, "difficulty": "Medium", "likes": 2260, "dislikes": 317, "categoryTitle": "Algorithms", "frontendQuestionId": "508", "paidOnly": false, "title": "Most Frequent Subtree Sum", "titleSlug": "most-frequent-subtree-sum", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 146527, "totalSubmissionRaw": 219022}, "509": {"acRate": 71.59396716284154, "difficulty": "Easy", "likes": 8207, "dislikes": 365, "categoryTitle": "Algorithms", "frontendQuestionId": "509", "paidOnly": false, "title": "Fibonacci Number", "titleSlug": "fibonacci-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1934903, "totalSubmissionRaw": 2702607}, "510": {"acRate": 60.89948054315138, "difficulty": "Medium", "likes": 863, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "510", "paidOnly": true, "title": "Inorder Successor in BST II", "titleSlug": "inorder-successor-in-bst-ii", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 66825, "totalSubmissionRaw": 109730}, "511": {"acRate": 74.88755336933993, "difficulty": "Easy", "likes": 859, "dislikes": 29, "categoryTitle": "Database", "frontendQuestionId": "511", "paidOnly": false, "title": "Game Play Analysis I", "titleSlug": "game-play-analysis-i", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 295197, "totalSubmissionRaw": 394187}, "512": {"acRate": 53.04338460986161, "difficulty": "Easy", "likes": 266, "dislikes": 43, "categoryTitle": "Database", "frontendQuestionId": "512", "paidOnly": true, "title": "Game Play Analysis II", "titleSlug": "game-play-analysis-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 88653, "totalSubmissionRaw": 167133}, "513": {"acRate": 71.32649442169946, "difficulty": "Medium", "likes": 3803, "dislikes": 295, "categoryTitle": "Algorithms", "frontendQuestionId": "513", "paidOnly": false, "title": "Find Bottom Left Tree Value", "titleSlug": "find-bottom-left-tree-value", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 370039, "totalSubmissionRaw": 518796}, "514": {"acRate": 58.98996633938077, "difficulty": "Hard", "likes": 1484, "dislikes": 79, "categoryTitle": "Algorithms", "frontendQuestionId": "514", "paidOnly": false, "title": "Freedom Trail", "titleSlug": "freedom-trail", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 109705, "totalSubmissionRaw": 185973}, "515": {"acRate": 65.69415432347925, "difficulty": "Medium", "likes": 3617, "dislikes": 113, "categoryTitle": "Algorithms", "frontendQuestionId": "515", "paidOnly": false, "title": "Find Largest Value in Each Tree Row", "titleSlug": "find-largest-value-in-each-tree-row", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 353179, "totalSubmissionRaw": 537611}, "516": {"acRate": 63.04338352254156, "difficulty": "Medium", "likes": 9576, "dislikes": 330, "categoryTitle": "Algorithms", "frontendQuestionId": "516", "paidOnly": false, "title": "Longest Palindromic Subsequence", "titleSlug": "longest-palindromic-subsequence", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 520785, "totalSubmissionRaw": 826075}, "517": {"acRate": 41.50539977393128, "difficulty": "Hard", "likes": 770, "dislikes": 217, "categoryTitle": "Algorithms", "frontendQuestionId": "517", "paidOnly": false, "title": "Super Washing Machines", "titleSlug": "super-washing-machines", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 30477, "totalSubmissionRaw": 73429}, "518": {"acRate": 64.53390771846114, "difficulty": "Medium", "likes": 9381, "dislikes": 169, "categoryTitle": "Algorithms", "frontendQuestionId": "518", "paidOnly": false, "title": "Coin Change II", "titleSlug": "coin-change-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 668125, "totalSubmissionRaw": 1035306}, "519": {"acRate": 42.315213882929235, "difficulty": "Medium", "likes": 432, "dislikes": 129, "categoryTitle": "Algorithms", "frontendQuestionId": "519", "paidOnly": false, "title": "Random Flip Matrix", "titleSlug": "random-flip-matrix", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Reservoir Sampling", "id": "VG9waWNUYWdOb2RlOjM2", "slug": "reservoir-sampling"}, {"name": "Randomized", "id": "VG9waWNUYWdOb2RlOjYxMDc1", "slug": "randomized"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22287, "totalSubmissionRaw": 52669}, "520": {"acRate": 56.409132099739836, "difficulty": "Easy", "likes": 3404, "dislikes": 461, "categoryTitle": "Algorithms", "frontendQuestionId": "520", "paidOnly": false, "title": "Detect Capital", "titleSlug": "detect-capital", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 443829, "totalSubmissionRaw": 786805}, "521": {"acRate": 60.89315136630709, "difficulty": "Easy", "likes": 40, "dislikes": 132, "categoryTitle": "Algorithms", "frontendQuestionId": "521", "paidOnly": false, "title": "Longest Uncommon Subsequence I", "titleSlug": "longest-uncommon-subsequence-i", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 117525, "totalSubmissionRaw": 193002}, "522": {"acRate": 41.96958356802802, "difficulty": "Medium", "likes": 515, "dislikes": 1308, "categoryTitle": "Algorithms", "frontendQuestionId": "522", "paidOnly": false, "title": "Longest Uncommon Subsequence II", "titleSlug": "longest-uncommon-subsequence-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 54393, "totalSubmissionRaw": 129601}, "523": {"acRate": 30.297989128001035, "difficulty": "Medium", "likes": 6278, "dislikes": 652, "categoryTitle": "Algorithms", "frontendQuestionId": "523", "paidOnly": false, "title": "Continuous Subarray Sum", "titleSlug": "continuous-subarray-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 588626, "totalSubmissionRaw": 1942789}, "524": {"acRate": 51.31659482477959, "difficulty": "Medium", "likes": 1797, "dislikes": 359, "categoryTitle": "Algorithms", "frontendQuestionId": "524", "paidOnly": false, "title": "Longest Word in Dictionary through Deleting", "titleSlug": "longest-word-in-dictionary-through-deleting", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 157622, "totalSubmissionRaw": 307156}, "525": {"acRate": 48.942893112913545, "difficulty": "Medium", "likes": 7979, "dislikes": 383, "categoryTitle": "Algorithms", "frontendQuestionId": "525", "paidOnly": false, "title": "Contiguous Array", "titleSlug": "contiguous-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 474286, "totalSubmissionRaw": 969059}, "526": {"acRate": 64.32043352518397, "difficulty": "Medium", "likes": 3221, "dislikes": 370, "categoryTitle": "Algorithms", "frontendQuestionId": "526", "paidOnly": false, "title": "Beautiful Arrangement", "titleSlug": "beautiful-arrangement", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 179701, "totalSubmissionRaw": 279384}, "527": {"acRate": 61.18166758696852, "difficulty": "Hard", "likes": 387, "dislikes": 291, "categoryTitle": "Algorithms", "frontendQuestionId": "527", "paidOnly": true, "title": "Word Abbreviation", "titleSlug": "word-abbreviation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 27700, "totalSubmissionRaw": 45275}, "528": {"acRate": 47.11249485435491, "difficulty": "Medium", "likes": 1913, "dislikes": 847, "categoryTitle": "Algorithms", "frontendQuestionId": "528", "paidOnly": false, "title": "Random Pick with Weight", "titleSlug": "random-pick-with-weight", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}, {"name": "Randomized", "id": "VG9waWNUYWdOb2RlOjYxMDc1", "slug": "randomized"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 479534, "totalSubmissionRaw": 1017850}, "529": {"acRate": 66.9826503214576, "difficulty": "Medium", "likes": 1964, "dislikes": 1064, "categoryTitle": "Algorithms", "frontendQuestionId": "529", "paidOnly": false, "title": "Minesweeper", "titleSlug": "minesweeper", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 163155, "totalSubmissionRaw": 243578}, "530": {"acRate": 58.500620233161996, "difficulty": "Easy", "likes": 4397, "dislikes": 228, "categoryTitle": "Algorithms", "frontendQuestionId": "530", "paidOnly": false, "title": "Minimum Absolute Difference in BST", "titleSlug": "minimum-absolute-difference-in-bst", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 409822, "totalSubmissionRaw": 700543}, "531": {"acRate": 62.35263857332705, "difficulty": "Medium", "likes": 433, "dislikes": 41, "categoryTitle": "Algorithms", "frontendQuestionId": "531", "paidOnly": true, "title": "Lonely Pixel I", "titleSlug": "lonely-pixel-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 43634, "totalSubmissionRaw": 69980}, "532": {"acRate": 43.265262765238674, "difficulty": "Medium", "likes": 3883, "dislikes": 2254, "categoryTitle": "Algorithms", "frontendQuestionId": "532", "paidOnly": false, "title": "K-diff Pairs in an Array", "titleSlug": "k-diff-pairs-in-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 350276, "totalSubmissionRaw": 809601}, "533": {"acRate": 48.63431643178846, "difficulty": "Medium", "likes": 87, "dislikes": 774, "categoryTitle": "Algorithms", "frontendQuestionId": "533", "paidOnly": true, "title": "Lonely Pixel II", "titleSlug": "lonely-pixel-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13390, "totalSubmissionRaw": 27532}, "534": {"acRate": 80.95615479621243, "difficulty": "Medium", "likes": 399, "dislikes": 16, "categoryTitle": "Database", "frontendQuestionId": "534", "paidOnly": true, "title": "Game Play Analysis III", "titleSlug": "game-play-analysis-iii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 78657, "totalSubmissionRaw": 97160}, "535": {"acRate": 86.46777429813693, "difficulty": "Medium", "likes": 2025, "dislikes": 3784, "categoryTitle": "Algorithms", "frontendQuestionId": "535", "paidOnly": false, "title": "Encode and Decode TinyURL", "titleSlug": "encode-and-decode-tinyurl", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 265891, "totalSubmissionRaw": 307503}, "536": {"acRate": 57.19993607159981, "difficulty": "Medium", "likes": 1063, "dislikes": 169, "categoryTitle": "Algorithms", "frontendQuestionId": "536", "paidOnly": true, "title": "Construct Binary Tree from String", "titleSlug": "construct-binary-tree-from-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 96632, "totalSubmissionRaw": 168938}, "537": {"acRate": 72.00604987457578, "difficulty": "Medium", "likes": 715, "dislikes": 1251, "categoryTitle": "Algorithms", "frontendQuestionId": "537", "paidOnly": false, "title": "Complex Number Multiplication", "titleSlug": "complex-number-multiplication", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 97597, "totalSubmissionRaw": 135540}, "538": {"acRate": 69.6548401761421, "difficulty": "Medium", "likes": 5243, "dislikes": 175, "categoryTitle": "Algorithms", "frontendQuestionId": "538", "paidOnly": false, "title": "Convert BST to Greater Tree", "titleSlug": "convert-bst-to-greater-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 307974, "totalSubmissionRaw": 442143}, "539": {"acRate": 56.97476125511596, "difficulty": "Medium", "likes": 1871, "dislikes": 264, "categoryTitle": "Algorithms", "frontendQuestionId": "539", "paidOnly": false, "title": "Minimum Time Difference", "titleSlug": "minimum-time-difference", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 153686, "totalSubmissionRaw": 269743}, "540": {"acRate": 59.223492724359005, "difficulty": "Medium", "likes": 11278, "dislikes": 196, "categoryTitle": "Algorithms", "frontendQuestionId": "540", "paidOnly": false, "title": "Single Element in a Sorted Array", "titleSlug": "single-element-in-a-sorted-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 710654, "totalSubmissionRaw": 1199956}, "541": {"acRate": 50.99709927580559, "difficulty": "Easy", "likes": 1999, "dislikes": 3846, "categoryTitle": "Algorithms", "frontendQuestionId": "541", "paidOnly": false, "title": "Reverse String II", "titleSlug": "reverse-string-ii", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 258438, "totalSubmissionRaw": 506770}, "542": {"acRate": 49.238994548887085, "difficulty": "Medium", "likes": 9544, "dislikes": 423, "categoryTitle": "Algorithms", "frontendQuestionId": "542", "paidOnly": false, "title": "01 Matrix", "titleSlug": "01-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 602217, "totalSubmissionRaw": 1223050}, "543": {"acRate": 61.20798954825249, "difficulty": "Easy", "likes": 13933, "dislikes": 1037, "categoryTitle": "Algorithms", "frontendQuestionId": "543", "paidOnly": false, "title": "Diameter of Binary Tree", "titleSlug": "diameter-of-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1617722, "totalSubmissionRaw": 2642993}, "544": {"acRate": 77.18185422212154, "difficulty": "Medium", "likes": 390, "dislikes": 134, "categoryTitle": "Algorithms", "frontendQuestionId": "544", "paidOnly": true, "title": "Output Contest Matches", "titleSlug": "output-contest-matches", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 27256, "totalSubmissionRaw": 35314}, "545": {"acRate": 45.76216457335362, "difficulty": "Medium", "likes": 1331, "dislikes": 2200, "categoryTitle": "Algorithms", "frontendQuestionId": "545", "paidOnly": true, "title": "Boundary of Binary Tree", "titleSlug": "boundary-of-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 137470, "totalSubmissionRaw": 300401}, "546": {"acRate": 47.92243203646427, "difficulty": "Hard", "likes": 2264, "dislikes": 125, "categoryTitle": "Algorithms", "frontendQuestionId": "546", "paidOnly": false, "title": "Remove Boxes", "titleSlug": "remove-boxes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 47102, "totalSubmissionRaw": 98288}, "547": {"acRate": 66.93761331863604, "difficulty": "Medium", "likes": 9789, "dislikes": 365, "categoryTitle": "Algorithms", "frontendQuestionId": "547", "paidOnly": false, "title": "Number of Provinces", "titleSlug": "number-of-provinces", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 964318, "totalSubmissionRaw": 1440624}, "548": {"acRate": 50.11989407619007, "difficulty": "Hard", "likes": 414, "dislikes": 131, "categoryTitle": "Algorithms", "frontendQuestionId": "548", "paidOnly": true, "title": "Split Array with Equal Sum", "titleSlug": "split-array-with-equal-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 24037, "totalSubmissionRaw": 47959}, "549": {"acRate": 49.507420443412315, "difficulty": "Medium", "likes": 1157, "dislikes": 95, "categoryTitle": "Algorithms", "frontendQuestionId": "549", "paidOnly": true, "title": "Binary Tree Longest Consecutive Sequence II", "titleSlug": "binary-tree-longest-consecutive-sequence-ii", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 54575, "totalSubmissionRaw": 110236}, "550": {"acRate": 37.33091664538624, "difficulty": "Medium", "likes": 932, "dislikes": 195, "categoryTitle": "Database", "frontendQuestionId": "550", "paidOnly": false, "title": "Game Play Analysis IV", "titleSlug": "game-play-analysis-iv", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 194428, "totalSubmissionRaw": 520821}, "551": {"acRate": 49.23426483130389, "difficulty": "Easy", "likes": 772, "dislikes": 51, "categoryTitle": "Algorithms", "frontendQuestionId": "551", "paidOnly": false, "title": "Student Attendance Record I", "titleSlug": "student-attendance-record-i", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 226871, "totalSubmissionRaw": 460799}, "552": {"acRate": 55.218078719939136, "difficulty": "Hard", "likes": 2274, "dislikes": 286, "categoryTitle": "Algorithms", "frontendQuestionId": "552", "paidOnly": false, "title": "Student Attendance Record II", "titleSlug": "student-attendance-record-ii", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 139350, "totalSubmissionRaw": 252363}, "553": {"acRate": 61.07040599074958, "difficulty": "Medium", "likes": 378, "dislikes": 1601, "categoryTitle": "Algorithms", "frontendQuestionId": "553", "paidOnly": false, "title": "Optimal Division", "titleSlug": "optimal-division", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 41592, "totalSubmissionRaw": 68105}, "554": {"acRate": 55.228690547355185, "difficulty": "Medium", "likes": 2528, "dislikes": 172, "categoryTitle": "Algorithms", "frontendQuestionId": "554", "paidOnly": false, "title": "Brick Wall", "titleSlug": "brick-wall", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 144127, "totalSubmissionRaw": 260964}, "555": {"acRate": 43.37380029237908, "difficulty": "Medium", "likes": 76, "dislikes": 260, "categoryTitle": "Algorithms", "frontendQuestionId": "555", "paidOnly": true, "title": "Split Concatenated Strings", "titleSlug": "split-concatenated-strings", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6824, "totalSubmissionRaw": 15733}, "556": {"acRate": 34.17158754910231, "difficulty": "Medium", "likes": 3687, "dislikes": 470, "categoryTitle": "Algorithms", "frontendQuestionId": "556", "paidOnly": false, "title": "Next Greater Element III", "titleSlug": "next-greater-element-iii", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 160411, "totalSubmissionRaw": 469428}, "557": {"acRate": 83.2365136315756, "difficulty": "Easy", "likes": 5930, "dislikes": 250, "categoryTitle": "Algorithms", "frontendQuestionId": "557", "paidOnly": false, "title": "Reverse Words in a String III", "titleSlug": "reverse-words-in-a-string-iii", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 930059, "totalSubmissionRaw": 1117369}, "558": {"acRate": 50.00657721652196, "difficulty": "Medium", "likes": 190, "dislikes": 472, "categoryTitle": "Algorithms", "frontendQuestionId": "558", "paidOnly": false, "title": "Logical OR of Two Binary Grids Represented as Quad-Trees", "titleSlug": "logical-or-of-two-binary-grids-represented-as-quad-trees", "topicTags": [{"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15206, "totalSubmissionRaw": 30408}, "559": {"acRate": 72.344932523147, "difficulty": "Easy", "likes": 2771, "dislikes": 88, "categoryTitle": "Algorithms", "frontendQuestionId": "559", "paidOnly": false, "title": "Maximum Depth of N-ary Tree", "titleSlug": "maximum-depth-of-n-ary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 290979, "totalSubmissionRaw": 402211}, "560": {"acRate": 43.970933468548736, "difficulty": "Medium", "likes": 21734, "dislikes": 666, "categoryTitle": "Algorithms", "frontendQuestionId": "560", "paidOnly": false, "title": "Subarray Sum Equals K", "titleSlug": "subarray-sum-equals-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 1349325, "totalSubmissionRaw": 3068677}, "561": {"acRate": 79.20453208050104, "difficulty": "Easy", "likes": 2066, "dislikes": 263, "categoryTitle": "Algorithms", "frontendQuestionId": "561", "paidOnly": false, "title": "Array Partition", "titleSlug": "array-partition", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting Sort", "id": "VG9waWNUYWdOb2RlOjYxMDcy", "slug": "counting-sort"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 498007, "totalSubmissionRaw": 628761}, "562": {"acRate": 50.41166661217016, "difficulty": "Medium", "likes": 890, "dislikes": 117, "categoryTitle": "Algorithms", "frontendQuestionId": "562", "paidOnly": true, "title": "Longest Line of Consecutive One in Matrix", "titleSlug": "longest-line-of-consecutive-one-in-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 77087, "totalSubmissionRaw": 152915}, "563": {"acRate": 62.389916665953926, "difficulty": "Easy", "likes": 2241, "dislikes": 2186, "categoryTitle": "Algorithms", "frontendQuestionId": "563", "paidOnly": false, "title": "Binary Tree Tilt", "titleSlug": "binary-tree-tilt", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 218837, "totalSubmissionRaw": 350757}, "564": {"acRate": 22.58822651645154, "difficulty": "Hard", "likes": 779, "dislikes": 1450, "categoryTitle": "Algorithms", "frontendQuestionId": "564", "paidOnly": false, "title": "Find the Closest Palindrome", "titleSlug": "find-the-closest-palindrome", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 48440, "totalSubmissionRaw": 214448}, "565": {"acRate": 56.33963161829675, "difficulty": "Medium", "likes": 2210, "dislikes": 154, "categoryTitle": "Algorithms", "frontendQuestionId": "565", "paidOnly": false, "title": "Array Nesting", "titleSlug": "array-nesting", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 132628, "totalSubmissionRaw": 235408}, "566": {"acRate": 63.22672678827629, "difficulty": "Easy", "likes": 3499, "dislikes": 411, "categoryTitle": "Algorithms", "frontendQuestionId": "566", "paidOnly": false, "title": "Reshape the Matrix", "titleSlug": "reshape-the-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 385604, "totalSubmissionRaw": 609875}, "567": {"acRate": 44.661185561559144, "difficulty": "Medium", "likes": 11328, "dislikes": 420, "categoryTitle": "Algorithms", "frontendQuestionId": "567", "paidOnly": false, "title": "Permutation in String", "titleSlug": "permutation-in-string", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 907979, "totalSubmissionRaw": 2033041}, "568": {"acRate": 45.81711830010743, "difficulty": "Hard", "likes": 570, "dislikes": 113, "categoryTitle": "Algorithms", "frontendQuestionId": "568", "paidOnly": true, "title": "Maximum Vacation Days", "titleSlug": "maximum-vacation-days", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 38381, "totalSubmissionRaw": 83770}, "569": {"acRate": 65.85296126296396, "difficulty": "Hard", "likes": 323, "dislikes": 152, "categoryTitle": "Database", "frontendQuestionId": "569", "paidOnly": true, "title": "Median Employee Salary", "titleSlug": "median-employee-salary", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 41463, "totalSubmissionRaw": 62963}, "570": {"acRate": 49.70956724616779, "difficulty": "Medium", "likes": 1157, "dislikes": 128, "categoryTitle": "Database", "frontendQuestionId": "570", "paidOnly": false, "title": "Managers with at Least 5 Direct Reports", "titleSlug": "managers-with-at-least-5-direct-reports", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 412907, "totalSubmissionRaw": 830633}, "571": {"acRate": 42.35028829137409, "difficulty": "Hard", "likes": 308, "dislikes": 78, "categoryTitle": "Database", "frontendQuestionId": "571", "paidOnly": true, "title": "Find Median Given Frequency of Numbers", "titleSlug": "find-median-given-frequency-of-numbers", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29674, "totalSubmissionRaw": 70068}, "572": {"acRate": 48.4687141132159, "difficulty": "Easy", "likes": 8237, "dislikes": 517, "categoryTitle": "Algorithms", "frontendQuestionId": "572", "paidOnly": false, "title": "Subtree of Another Tree", "titleSlug": "subtree-of-another-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 901946, "totalSubmissionRaw": 1860883}, "573": {"acRate": 57.11602406274589, "difficulty": "Medium", "likes": 411, "dislikes": 39, "categoryTitle": "Algorithms", "frontendQuestionId": "573", "paidOnly": true, "title": "Squirrel Simulation", "titleSlug": "squirrel-simulation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 22502, "totalSubmissionRaw": 39397}, "574": {"acRate": 61.037927108115866, "difficulty": "Medium", "likes": 174, "dislikes": 413, "categoryTitle": "Database", "frontendQuestionId": "574", "paidOnly": true, "title": "Winning Candidate", "titleSlug": "winning-candidate", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 65935, "totalSubmissionRaw": 108023}, "575": {"acRate": 68.13124207127206, "difficulty": "Easy", "likes": 1533, "dislikes": 1371, "categoryTitle": "Algorithms", "frontendQuestionId": "575", "paidOnly": false, "title": "Distribute Candies", "titleSlug": "distribute-candies", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 295383, "totalSubmissionRaw": 433550}, "576": {"acRate": 48.10001599890293, "difficulty": "Medium", "likes": 3881, "dislikes": 293, "categoryTitle": "Algorithms", "frontendQuestionId": "576", "paidOnly": false, "title": "Out of Boundary Paths", "titleSlug": "out-of-boundary-paths", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 210452, "totalSubmissionRaw": 437530}, "577": {"acRate": 75.97825508380137, "difficulty": "Easy", "likes": 960, "dislikes": 223, "categoryTitle": "Database", "frontendQuestionId": "577", "paidOnly": false, "title": "Employee Bonus", "titleSlug": "employee-bonus", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 442487, "totalSubmissionRaw": 582387}, "578": {"acRate": 40.239844773359295, "difficulty": "Medium", "likes": 129, "dislikes": 914, "categoryTitle": "Database", "frontendQuestionId": "578", "paidOnly": true, "title": "Get Highest Answer Rate Question", "titleSlug": "get-highest-answer-rate-question", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 57446, "totalSubmissionRaw": 142759}, "579": {"acRate": 47.271053842613895, "difficulty": "Hard", "likes": 239, "dislikes": 403, "categoryTitle": "Database", "frontendQuestionId": "579", "paidOnly": true, "title": "Find Cumulative Salary of an Employee", "titleSlug": "find-cumulative-salary-of-an-employee", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 35952, "totalSubmissionRaw": 76055}, "580": {"acRate": 59.134694159142455, "difficulty": "Medium", "likes": 245, "dislikes": 36, "categoryTitle": "Database", "frontendQuestionId": "580", "paidOnly": true, "title": "Count Student Number in Departments", "titleSlug": "count-student-number-in-departments", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 68572, "totalSubmissionRaw": 115959}, "581": {"acRate": 37.00455383173045, "difficulty": "Medium", "likes": 7760, "dislikes": 261, "categoryTitle": "Algorithms", "frontendQuestionId": "581", "paidOnly": false, "title": "Shortest Unsorted Continuous Subarray", "titleSlug": "shortest-unsorted-continuous-subarray", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 334704, "totalSubmissionRaw": 904506}, "582": {"acRate": 69.57519449264005, "difficulty": "Medium", "likes": 1107, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "582", "paidOnly": true, "title": "Kill Process", "titleSlug": "kill-process", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 87017, "totalSubmissionRaw": 125069}, "583": {"acRate": 62.40489714372002, "difficulty": "Medium", "likes": 5788, "dislikes": 87, "categoryTitle": "Algorithms", "frontendQuestionId": "583", "paidOnly": false, "title": "Delete Operation for Two Strings", "titleSlug": "delete-operation-for-two-strings", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 268625, "totalSubmissionRaw": 430454}, "584": {"acRate": 70.52845444379639, "difficulty": "Easy", "likes": 2101, "dislikes": 368, "categoryTitle": "Database", "frontendQuestionId": "584", "paidOnly": false, "title": "Find Customer Referee", "titleSlug": "find-customer-referee", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1023003, "totalSubmissionRaw": 1450484}, "585": {"acRate": 48.49482982437816, "difficulty": "Medium", "likes": 581, "dislikes": 493, "categoryTitle": "Database", "frontendQuestionId": "585", "paidOnly": false, "title": "Investments in 2016", "titleSlug": "investments-in-2016", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 130001, "totalSubmissionRaw": 268074}, "586": {"acRate": 64.6793417434033, "difficulty": "Easy", "likes": 992, "dislikes": 74, "categoryTitle": "Database", "frontendQuestionId": "586", "paidOnly": false, "title": "Customer Placing the Largest Number of Orders", "titleSlug": "customer-placing-the-largest-number-of-orders", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 276812, "totalSubmissionRaw": 427964}, "587": {"acRate": 51.971056337404455, "difficulty": "Hard", "likes": 1478, "dislikes": 643, "categoryTitle": "Algorithms", "frontendQuestionId": "587", "paidOnly": false, "title": "Erect the Fence", "titleSlug": "erect-the-fence", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 58680, "totalSubmissionRaw": 112909}, "588": {"acRate": 48.06824867621102, "difficulty": "Hard", "likes": 1493, "dislikes": 167, "categoryTitle": "Algorithms", "frontendQuestionId": "588", "paidOnly": true, "title": "Design In-Memory File System", "titleSlug": "design-in-memory-file-system", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 107844, "totalSubmissionRaw": 224356}, "589": {"acRate": 75.64537647613399, "difficulty": "Easy", "likes": 3141, "dislikes": 202, "categoryTitle": "Algorithms", "frontendQuestionId": "589", "paidOnly": false, "title": "N-ary Tree Preorder Traversal", "titleSlug": "n-ary-tree-preorder-traversal", "topicTags": [{"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 434883, "totalSubmissionRaw": 574892}, "590": {"acRate": 78.06702706553975, "difficulty": "Easy", "likes": 2338, "dislikes": 99, "categoryTitle": "Algorithms", "frontendQuestionId": "590", "paidOnly": false, "title": "N-ary Tree Postorder Traversal", "titleSlug": "n-ary-tree-postorder-traversal", "topicTags": [{"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 262968, "totalSubmissionRaw": 336849}, "591": {"acRate": 39.0317367029092, "difficulty": "Hard", "likes": 170, "dislikes": 648, "categoryTitle": "Algorithms", "frontendQuestionId": "591", "paidOnly": false, "title": "Tag Validator", "titleSlug": "tag-validator", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 15939, "totalSubmissionRaw": 40836}, "592": {"acRate": 53.60797956031583, "difficulty": "Medium", "likes": 400, "dislikes": 508, "categoryTitle": "Algorithms", "frontendQuestionId": "592", "paidOnly": false, "title": "Fraction Addition and Subtraction", "titleSlug": "fraction-addition-and-subtraction", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 37138, "totalSubmissionRaw": 69277}, "593": {"acRate": 44.10673305996477, "difficulty": "Medium", "likes": 1052, "dislikes": 908, "categoryTitle": "Algorithms", "frontendQuestionId": "593", "paidOnly": false, "title": "Valid Square", "titleSlug": "valid-square", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 110898, "totalSubmissionRaw": 251429}, "594": {"acRate": 55.112077651307324, "difficulty": "Easy", "likes": 2161, "dislikes": 247, "categoryTitle": "Algorithms", "frontendQuestionId": "594", "paidOnly": false, "title": "Longest Harmonious Subsequence", "titleSlug": "longest-harmonious-subsequence", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 165738, "totalSubmissionRaw": 300729}, "595": {"acRate": 68.10062482595825, "difficulty": "Easy", "likes": 2729, "dislikes": 1323, "categoryTitle": "Database", "frontendQuestionId": "595", "paidOnly": false, "title": "Big Countries", "titleSlug": "big-countries", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1323044, "totalSubmissionRaw": 1942779}, "596": {"acRate": 56.64701438002403, "difficulty": "Easy", "likes": 1053, "dislikes": 1078, "categoryTitle": "Database", "frontendQuestionId": "596", "paidOnly": false, "title": "Classes More Than 5 Students", "titleSlug": "classes-more-than-5-students", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 457351, "totalSubmissionRaw": 807369}, "597": {"acRate": 41.786275194136635, "difficulty": "Easy", "likes": 306, "dislikes": 767, "categoryTitle": "Database", "frontendQuestionId": "597", "paidOnly": true, "title": "Friend Requests I: Overall Acceptance Rate", "titleSlug": "friend-requests-i-overall-acceptance-rate", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 76626, "totalSubmissionRaw": 183376}, "598": {"acRate": 56.358830845771145, "difficulty": "Easy", "likes": 942, "dislikes": 969, "categoryTitle": "Algorithms", "frontendQuestionId": "598", "paidOnly": false, "title": "Range Addition II", "titleSlug": "range-addition-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 105125, "totalSubmissionRaw": 186528}, "599": {"acRate": 56.04564699811172, "difficulty": "Easy", "likes": 1943, "dislikes": 396, "categoryTitle": "Algorithms", "frontendQuestionId": "599", "paidOnly": false, "title": "Minimum Index Sum of Two Lists", "titleSlug": "minimum-index-sum-of-two-lists", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 238931, "totalSubmissionRaw": 426315}, "600": {"acRate": 40.041506077675656, "difficulty": "Hard", "likes": 1532, "dislikes": 135, "categoryTitle": "Algorithms", "frontendQuestionId": "600", "paidOnly": false, "title": "Non-negative Integers without Consecutive Ones", "titleSlug": "non-negative-integers-without-consecutive-ones", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 40518, "totalSubmissionRaw": 101190}, "601": {"acRate": 48.82924433043146, "difficulty": "Hard", "likes": 681, "dislikes": 568, "categoryTitle": "Database", "frontendQuestionId": "601", "paidOnly": false, "title": "Human Traffic of Stadium", "titleSlug": "human-traffic-of-stadium", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 107355, "totalSubmissionRaw": 219858}, "602": {"acRate": 57.954592495305334, "difficulty": "Medium", "likes": 649, "dislikes": 131, "categoryTitle": "Database", "frontendQuestionId": "602", "paidOnly": false, "title": "Friend Requests II: Who Has the Most Friends", "titleSlug": "friend-requests-ii-who-has-the-most-friends", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 154001, "totalSubmissionRaw": 265727}, "603": {"acRate": 65.93695336633296, "difficulty": "Easy", "likes": 642, "dislikes": 75, "categoryTitle": "Database", "frontendQuestionId": "603", "paidOnly": true, "title": "Consecutive Available Seats", "titleSlug": "consecutive-available-seats", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 88583, "totalSubmissionRaw": 134345}, "604": {"acRate": 39.946981337900134, "difficulty": "Easy", "likes": 441, "dislikes": 159, "categoryTitle": "Algorithms", "frontendQuestionId": "604", "paidOnly": true, "title": "Design Compressed String Iterator", "titleSlug": "design-compressed-string-iterator", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Iterator", "id": "VG9waWNUYWdOb2RlOjYxMDY0", "slug": "iterator"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 34056, "totalSubmissionRaw": 85253}, "605": {"acRate": 28.96649349669216, "difficulty": "Easy", "likes": 6581, "dislikes": 1188, "categoryTitle": "Algorithms", "frontendQuestionId": "605", "paidOnly": false, "title": "Can Place Flowers", "titleSlug": "can-place-flowers", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 867413, "totalSubmissionRaw": 2994542}, "606": {"acRate": 69.44785513119935, "difficulty": "Medium", "likes": 77, "dislikes": 38, "categoryTitle": "Algorithms", "frontendQuestionId": "606", "paidOnly": false, "title": "Construct String from Binary Tree", "titleSlug": "construct-string-from-binary-tree", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 323527, "totalSubmissionRaw": 465856}, "607": {"acRate": 65.7860279718659, "difficulty": "Easy", "likes": 1172, "dislikes": 101, "categoryTitle": "Database", "frontendQuestionId": "607", "paidOnly": false, "title": "Sales Person", "titleSlug": "sales-person", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 227096, "totalSubmissionRaw": 345204}, "608": {"acRate": 72.66099316819869, "difficulty": "Medium", "likes": 1238, "dislikes": 127, "categoryTitle": "Database", "frontendQuestionId": "608", "paidOnly": false, "title": "Tree Node", "titleSlug": "tree-node", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 166236, "totalSubmissionRaw": 228783}, "609": {"acRate": 67.6478895616714, "difficulty": "Medium", "likes": 1514, "dislikes": 1649, "categoryTitle": "Algorithms", "frontendQuestionId": "609", "paidOnly": false, "title": "Find Duplicate File in System", "titleSlug": "find-duplicate-file-in-system", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 153282, "totalSubmissionRaw": 226588}, "610": {"acRate": 72.18029407534739, "difficulty": "Easy", "likes": 597, "dislikes": 169, "categoryTitle": "Database", "frontendQuestionId": "610", "paidOnly": false, "title": "Triangle Judgement", "titleSlug": "triangle-judgement", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 210790, "totalSubmissionRaw": 292033}, "611": {"acRate": 51.37309568346424, "difficulty": "Medium", "likes": 3823, "dislikes": 215, "categoryTitle": "Algorithms", "frontendQuestionId": "611", "paidOnly": false, "title": "Valid Triangle Number", "titleSlug": "valid-triangle-number", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 201587, "totalSubmissionRaw": 392398}, "612": {"acRate": 61.33157547791694, "difficulty": "Medium", "likes": 218, "dislikes": 70, "categoryTitle": "Database", "frontendQuestionId": "612", "paidOnly": true, "title": "Shortest Distance in a Plane", "titleSlug": "shortest-distance-in-a-plane", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 41868, "totalSubmissionRaw": 68265}, "613": {"acRate": 80.17632214295858, "difficulty": "Easy", "likes": 329, "dislikes": 40, "categoryTitle": "Database", "frontendQuestionId": "613", "paidOnly": true, "title": "Shortest Distance in a Line", "titleSlug": "shortest-distance-in-a-line", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 73391, "totalSubmissionRaw": 91537}, "614": {"acRate": 38.89682397272564, "difficulty": "Medium", "likes": 158, "dislikes": 744, "categoryTitle": "Database", "frontendQuestionId": "614", "paidOnly": true, "title": "Second Degree Follower", "titleSlug": "second-degree-follower", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 54193, "totalSubmissionRaw": 139325}, "615": {"acRate": 56.180574472592994, "difficulty": "Hard", "likes": 236, "dislikes": 74, "categoryTitle": "Database", "frontendQuestionId": "615", "paidOnly": true, "title": "Average Salary: Departments VS Company", "titleSlug": "average-salary-departments-vs-company", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 37122, "totalSubmissionRaw": 66077}, "616": {"acRate": 49.95631623787843, "difficulty": "Medium", "likes": 1078, "dislikes": 192, "categoryTitle": "Algorithms", "frontendQuestionId": "616", "paidOnly": true, "title": "Add Bold Tag in String", "titleSlug": "add-bold-tag-in-string", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 92060, "totalSubmissionRaw": 184280}, "617": {"acRate": 79.0637302075504, "difficulty": "Easy", "likes": 8786, "dislikes": 301, "categoryTitle": "Algorithms", "frontendQuestionId": "617", "paidOnly": false, "title": "Merge Two Binary Trees", "titleSlug": "merge-two-binary-trees", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 787892, "totalSubmissionRaw": 996528}, "618": {"acRate": 63.45205057045945, "difficulty": "Hard", "likes": 186, "dislikes": 170, "categoryTitle": "Database", "frontendQuestionId": "618", "paidOnly": true, "title": "Students Report By Geography", "titleSlug": "students-report-by-geography", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 24693, "totalSubmissionRaw": 38916}, "619": {"acRate": 65.24460577170129, "difficulty": "Easy", "likes": 644, "dislikes": 182, "categoryTitle": "Database", "frontendQuestionId": "619", "paidOnly": false, "title": "Biggest Single Number", "titleSlug": "biggest-single-number", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 238700, "totalSubmissionRaw": 365854}, "620": {"acRate": 74.05844542638681, "difficulty": "Easy", "likes": 1147, "dislikes": 543, "categoryTitle": "Database", "frontendQuestionId": "620", "paidOnly": false, "title": "Not Boring Movies", "titleSlug": "not-boring-movies", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 547049, "totalSubmissionRaw": 738672}, "621": {"acRate": 60.24108965186632, "difficulty": "Medium", "likes": 10534, "dislikes": 2080, "categoryTitle": "Algorithms", "frontendQuestionId": "621", "paidOnly": false, "title": "Task Scheduler", "titleSlug": "task-scheduler", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 663505, "totalSubmissionRaw": 1101414}, "622": {"acRate": 51.718599623514194, "difficulty": "Medium", "likes": 3538, "dislikes": 290, "categoryTitle": "Algorithms", "frontendQuestionId": "622", "paidOnly": false, "title": "Design Circular Queue", "titleSlug": "design-circular-queue", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 329418, "totalSubmissionRaw": 636943}, "623": {"acRate": 64.05483891818022, "difficulty": "Medium", "likes": 3555, "dislikes": 265, "categoryTitle": "Algorithms", "frontendQuestionId": "623", "paidOnly": false, "title": "Add One Row to Tree", "titleSlug": "add-one-row-to-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 277483, "totalSubmissionRaw": 433196}, "624": {"acRate": 45.87378503696424, "difficulty": "Medium", "likes": 1334, "dislikes": 107, "categoryTitle": "Algorithms", "frontendQuestionId": "624", "paidOnly": false, "title": "Maximum Distance in Arrays", "titleSlug": "maximum-distance-in-arrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 161997, "totalSubmissionRaw": 353334}, "625": {"acRate": 33.68043299211672, "difficulty": "Medium", "likes": 129, "dislikes": 112, "categoryTitle": "Algorithms", "frontendQuestionId": "625", "paidOnly": true, "title": "Minimum Factorization", "titleSlug": "minimum-factorization", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 11450, "totalSubmissionRaw": 33996}, "626": {"acRate": 70.52722734154557, "difficulty": "Medium", "likes": 1459, "dislikes": 588, "categoryTitle": "Database", "frontendQuestionId": "626", "paidOnly": false, "title": "Exchange Seats", "titleSlug": "exchange-seats", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 242699, "totalSubmissionRaw": 344121}, "627": {"acRate": 83.40574889402586, "difficulty": "Easy", "likes": 1728, "dislikes": 565, "categoryTitle": "Database", "frontendQuestionId": "627", "paidOnly": false, "title": "Swap Salary", "titleSlug": "swap-salary", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 422506, "totalSubmissionRaw": 506567}, "628": {"acRate": 45.18062639744029, "difficulty": "Easy", "likes": 4220, "dislikes": 677, "categoryTitle": "Algorithms", "frontendQuestionId": "628", "paidOnly": false, "title": "Maximum Product of Three Numbers", "titleSlug": "maximum-product-of-three-numbers", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 341293, "totalSubmissionRaw": 755398}, "629": {"acRate": 49.452120779964574, "difficulty": "Hard", "likes": 2682, "dislikes": 324, "categoryTitle": "Algorithms", "frontendQuestionId": "629", "paidOnly": false, "title": "K Inverse Pairs Array", "titleSlug": "k-inverse-pairs-array", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 130382, "totalSubmissionRaw": 263653}, "630": {"acRate": 40.2792096826585, "difficulty": "Hard", "likes": 3795, "dislikes": 98, "categoryTitle": "Algorithms", "frontendQuestionId": "630", "paidOnly": false, "title": "Course Schedule III", "titleSlug": "course-schedule-iii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 114082, "totalSubmissionRaw": 283228}, "631": {"acRate": 44.14046549612087, "difficulty": "Hard", "likes": 237, "dislikes": 275, "categoryTitle": "Algorithms", "frontendQuestionId": "631", "paidOnly": true, "title": "Design Excel Sum Formula", "titleSlug": "design-excel-sum-formula", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 18377, "totalSubmissionRaw": 41633}, "632": {"acRate": 63.042927943385294, "difficulty": "Hard", "likes": 3469, "dislikes": 75, "categoryTitle": "Algorithms", "frontendQuestionId": "632", "paidOnly": false, "title": "Smallest Range Covering Elements from K Lists", "titleSlug": "smallest-range-covering-elements-from-k-lists", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 112066, "totalSubmissionRaw": 177762}, "633": {"acRate": 36.60874830753035, "difficulty": "Medium", "likes": 3205, "dislikes": 607, "categoryTitle": "Algorithms", "frontendQuestionId": "633", "paidOnly": false, "title": "Sum of Square Numbers", "titleSlug": "sum-of-square-numbers", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 356090, "totalSubmissionRaw": 972691}, "634": {"acRate": 41.88815571202124, "difficulty": "Medium", "likes": 218, "dislikes": 163, "categoryTitle": "Algorithms", "frontendQuestionId": "634", "paidOnly": true, "title": "Find the Derangement of An Array", "titleSlug": "find-the-derangement-of-an-array", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 11363, "totalSubmissionRaw": 27127}, "635": {"acRate": 60.52058878969105, "difficulty": "Medium", "likes": 472, "dislikes": 212, "categoryTitle": "Algorithms", "frontendQuestionId": "635", "paidOnly": true, "title": "Design Log Storage System", "titleSlug": "design-log-storage-system", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 35318, "totalSubmissionRaw": 58357}, "636": {"acRate": 62.34033414585436, "difficulty": "Medium", "likes": 1951, "dislikes": 2796, "categoryTitle": "Algorithms", "frontendQuestionId": "636", "paidOnly": false, "title": "Exclusive Time of Functions", "titleSlug": "exclusive-time-of-functions", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 227872, "totalSubmissionRaw": 365529}, "637": {"acRate": 73.08818717607947, "difficulty": "Easy", "likes": 5280, "dislikes": 327, "categoryTitle": "Algorithms", "frontendQuestionId": "637", "paidOnly": false, "title": "Average of Levels in Binary Tree", "titleSlug": "average-of-levels-in-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 542792, "totalSubmissionRaw": 742654}, "638": {"acRate": 51.90343854991911, "difficulty": "Medium", "likes": 1506, "dislikes": 761, "categoryTitle": "Algorithms", "frontendQuestionId": "638", "paidOnly": false, "title": "Shopping Offers", "titleSlug": "shopping-offers", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 62567, "totalSubmissionRaw": 120545}, "639": {"acRate": 30.812363404258758, "difficulty": "Hard", "likes": 1572, "dislikes": 818, "categoryTitle": "Algorithms", "frontendQuestionId": "639", "paidOnly": false, "title": "Decode Ways II", "titleSlug": "decode-ways-ii", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 76272, "totalSubmissionRaw": 247537}, "640": {"acRate": 43.93379957430172, "difficulty": "Medium", "likes": 495, "dislikes": 834, "categoryTitle": "Algorithms", "frontendQuestionId": "640", "paidOnly": false, "title": "Solve the Equation", "titleSlug": "solve-the-equation", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 40456, "totalSubmissionRaw": 92084}, "641": {"acRate": 57.22902158042397, "difficulty": "Medium", "likes": 1180, "dislikes": 76, "categoryTitle": "Algorithms", "frontendQuestionId": "641", "paidOnly": false, "title": "Design Circular Deque", "titleSlug": "design-circular-deque", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 74863, "totalSubmissionRaw": 130813}, "642": {"acRate": 49.079476691119304, "difficulty": "Hard", "likes": 2110, "dislikes": 179, "categoryTitle": "Algorithms", "frontendQuestionId": "642", "paidOnly": true, "title": "Design Search Autocomplete System", "titleSlug": "design-search-autocomplete-system", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Data Stream", "id": "VG9waWNUYWdOb2RlOjYxMDYz", "slug": "data-stream"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 145182, "totalSubmissionRaw": 295810}, "643": {"acRate": 43.649604888429245, "difficulty": "Easy", "likes": 3530, "dislikes": 323, "categoryTitle": "Algorithms", "frontendQuestionId": "643", "paidOnly": false, "title": "Maximum Average Subarray I", "titleSlug": "maximum-average-subarray-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 534742, "totalSubmissionRaw": 1225074}, "644": {"acRate": 36.804803097856016, "difficulty": "Hard", "likes": 622, "dislikes": 71, "categoryTitle": "Algorithms", "frontendQuestionId": "644", "paidOnly": true, "title": "Maximum Average Subarray II", "titleSlug": "maximum-average-subarray-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 20720, "totalSubmissionRaw": 56297}, "645": {"acRate": 44.51908205254057, "difficulty": "Easy", "likes": 4749, "dislikes": 1162, "categoryTitle": "Algorithms", "frontendQuestionId": "645", "paidOnly": false, "title": "Set Mismatch", "titleSlug": "set-mismatch", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 468030, "totalSubmissionRaw": 1051302}, "646": {"acRate": 60.117630926845514, "difficulty": "Medium", "likes": 4601, "dislikes": 132, "categoryTitle": "Algorithms", "frontendQuestionId": "646", "paidOnly": false, "title": "Maximum Length of Pair Chain", "titleSlug": "maximum-length-of-pair-chain", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 245518, "totalSubmissionRaw": 408396}, "647": {"acRate": 70.51180790101587, "difficulty": "Medium", "likes": 10801, "dislikes": 239, "categoryTitle": "Algorithms", "frontendQuestionId": "647", "paidOnly": false, "title": "Palindromic Substrings", "titleSlug": "palindromic-substrings", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 853454, "totalSubmissionRaw": 1210371}, "648": {"acRate": 68.05723478452023, "difficulty": "Medium", "likes": 2933, "dislikes": 215, "categoryTitle": "Algorithms", "frontendQuestionId": "648", "paidOnly": false, "title": "Replace Words", "titleSlug": "replace-words", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 272444, "totalSubmissionRaw": 400316}, "649": {"acRate": 47.87634034257067, "difficulty": "Medium", "likes": 2381, "dislikes": 1826, "categoryTitle": "Algorithms", "frontendQuestionId": "649", "paidOnly": false, "title": "Dota2 Senate", "titleSlug": "dota2-senate", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 165024, "totalSubmissionRaw": 344688}, "650": {"acRate": 54.351798552813044, "difficulty": "Medium", "likes": 3526, "dislikes": 214, "categoryTitle": "Algorithms", "frontendQuestionId": "650", "paidOnly": false, "title": "2 Keys Keyboard", "titleSlug": "2-keys-keyboard", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 140688, "totalSubmissionRaw": 258847}, "651": {"acRate": 55.8625785001847, "difficulty": "Medium", "likes": 709, "dislikes": 93, "categoryTitle": "Algorithms", "frontendQuestionId": "651", "paidOnly": true, "title": "4 Keys Keyboard", "titleSlug": "4-keys-keyboard", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 30244, "totalSubmissionRaw": 54140}, "652": {"acRate": 59.58147735708983, "difficulty": "Medium", "likes": 5839, "dislikes": 474, "categoryTitle": "Algorithms", "frontendQuestionId": "652", "paidOnly": false, "title": "Find Duplicate Subtrees", "titleSlug": "find-duplicate-subtrees", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 269661, "totalSubmissionRaw": 452592}, "653": {"acRate": 61.47988594570381, "difficulty": "Easy", "likes": 6759, "dislikes": 272, "categoryTitle": "Algorithms", "frontendQuestionId": "653", "paidOnly": false, "title": "Two Sum IV - Input is a BST", "titleSlug": "two-sum-iv-input-is-a-bst", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 566855, "totalSubmissionRaw": 922017}, "654": {"acRate": 85.54056960449164, "difficulty": "Medium", "likes": 5224, "dislikes": 341, "categoryTitle": "Algorithms", "frontendQuestionId": "654", "paidOnly": false, "title": "Maximum Binary Tree", "titleSlug": "maximum-binary-tree", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 302271, "totalSubmissionRaw": 353366}, "655": {"acRate": 64.4428857895636, "difficulty": "Medium", "likes": 492, "dislikes": 453, "categoryTitle": "Algorithms", "frontendQuestionId": "655", "paidOnly": false, "title": "Print Binary Tree", "titleSlug": "print-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 71665, "totalSubmissionRaw": 111207}, "656": {"acRate": 32.158114853622344, "difficulty": "Hard", "likes": 246, "dislikes": 110, "categoryTitle": "Algorithms", "frontendQuestionId": "656", "paidOnly": true, "title": "Coin Path", "titleSlug": "coin-path", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 14302, "totalSubmissionRaw": 44474}, "657": {"acRate": 75.89177153821292, "difficulty": "Easy", "likes": 2430, "dislikes": 747, "categoryTitle": "Algorithms", "frontendQuestionId": "657", "paidOnly": false, "title": "Robot Return to Origin", "titleSlug": "robot-return-to-origin", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 443787, "totalSubmissionRaw": 584763}, "658": {"acRate": 47.69834064972911, "difficulty": "Medium", "likes": 8223, "dislikes": 700, "categoryTitle": "Algorithms", "frontendQuestionId": "658", "paidOnly": false, "title": "Find K Closest Elements", "titleSlug": "find-k-closest-elements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 575331, "totalSubmissionRaw": 1206187}, "659": {"acRate": 51.15128198167101, "difficulty": "Medium", "likes": 4434, "dislikes": 804, "categoryTitle": "Algorithms", "frontendQuestionId": "659", "paidOnly": false, "title": "Split Array into Consecutive Subsequences", "titleSlug": "split-array-into-consecutive-subsequences", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 131890, "totalSubmissionRaw": 257843}, "660": {"acRate": 57.44172463229438, "difficulty": "Hard", "likes": 162, "dislikes": 204, "categoryTitle": "Algorithms", "frontendQuestionId": "660", "paidOnly": true, "title": "Remove 9", "titleSlug": "remove-9", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 10818, "totalSubmissionRaw": 18833}, "661": {"acRate": 67.51268225760137, "difficulty": "Easy", "likes": 1132, "dislikes": 2914, "categoryTitle": "Algorithms", "frontendQuestionId": "661", "paidOnly": false, "title": "Image Smoother", "titleSlug": "image-smoother", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 169284, "totalSubmissionRaw": 250744}, "662": {"acRate": 43.13516885425212, "difficulty": "Medium", "likes": 8797, "dislikes": 1216, "categoryTitle": "Algorithms", "frontendQuestionId": "662", "paidOnly": false, "title": "Maximum Width of Binary Tree", "titleSlug": "maximum-width-of-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 403828, "totalSubmissionRaw": 936192}, "663": {"acRate": 41.5761013624556, "difficulty": "Medium", "likes": 483, "dislikes": 37, "categoryTitle": "Algorithms", "frontendQuestionId": "663", "paidOnly": true, "title": "Equal Tree Partition", "titleSlug": "equal-tree-partition", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 31370, "totalSubmissionRaw": 75452}, "664": {"acRate": 55.01701240259027, "difficulty": "Hard", "likes": 2208, "dislikes": 210, "categoryTitle": "Algorithms", "frontendQuestionId": "664", "paidOnly": false, "title": "Strange Printer", "titleSlug": "strange-printer", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 75189, "totalSubmissionRaw": 136665}, "665": {"acRate": 24.804358666955164, "difficulty": "Medium", "likes": 5722, "dislikes": 778, "categoryTitle": "Algorithms", "frontendQuestionId": "665", "paidOnly": false, "title": "Non-decreasing Array", "titleSlug": "non-decreasing-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 267104, "totalSubmissionRaw": 1076843}, "666": {"acRate": 61.4360041623309, "difficulty": "Medium", "likes": 399, "dislikes": 509, "categoryTitle": "Algorithms", "frontendQuestionId": "666", "paidOnly": true, "title": "Path Sum IV", "titleSlug": "path-sum-iv", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 35424, "totalSubmissionRaw": 57660}, "667": {"acRate": 60.26172469296408, "difficulty": "Medium", "likes": 794, "dislikes": 1053, "categoryTitle": "Algorithms", "frontendQuestionId": "667", "paidOnly": false, "title": "Beautiful Arrangement II", "titleSlug": "beautiful-arrangement-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 54661, "totalSubmissionRaw": 90706}, "668": {"acRate": 51.981037027780594, "difficulty": "Hard", "likes": 2158, "dislikes": 58, "categoryTitle": "Algorithms", "frontendQuestionId": "668", "paidOnly": false, "title": "Kth Smallest Number in Multiplication Table", "titleSlug": "kth-smallest-number-in-multiplication-table", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 66556, "totalSubmissionRaw": 128039}, "669": {"acRate": 66.287112978838, "difficulty": "Medium", "likes": 5850, "dislikes": 260, "categoryTitle": "Algorithms", "frontendQuestionId": "669", "paidOnly": false, "title": "Trim a Binary Search Tree", "titleSlug": "trim-a-binary-search-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 300331, "totalSubmissionRaw": 453076}, "670": {"acRate": 48.94314800430771, "difficulty": "Medium", "likes": 3388, "dislikes": 207, "categoryTitle": "Algorithms", "frontendQuestionId": "670", "paidOnly": false, "title": "Maximum Swap", "titleSlug": "maximum-swap", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 260866, "totalSubmissionRaw": 532998}, "671": {"acRate": 44.680817482435494, "difficulty": "Easy", "likes": 1858, "dislikes": 1878, "categoryTitle": "Algorithms", "frontendQuestionId": "671", "paidOnly": false, "title": "Second Minimum Node In a Binary Tree", "titleSlug": "second-minimum-node-in-a-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 198163, "totalSubmissionRaw": 443508}, "672": {"acRate": 50.160812526449426, "difficulty": "Medium", "likes": 163, "dislikes": 224, "categoryTitle": "Algorithms", "frontendQuestionId": "672", "paidOnly": false, "title": "Bulb Switcher II", "titleSlug": "bulb-switcher-ii", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 23706, "totalSubmissionRaw": 47260}, "673": {"acRate": 48.557565381569155, "difficulty": "Medium", "likes": 6807, "dislikes": 270, "categoryTitle": "Algorithms", "frontendQuestionId": "673", "paidOnly": false, "title": "Number of Longest Increasing Subsequence", "titleSlug": "number-of-longest-increasing-subsequence", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 242782, "totalSubmissionRaw": 499988}, "674": {"acRate": 50.45675151389985, "difficulty": "Easy", "likes": 2345, "dislikes": 181, "categoryTitle": "Algorithms", "frontendQuestionId": "674", "paidOnly": false, "title": "Longest Continuous Increasing Subsequence", "titleSlug": "longest-continuous-increasing-subsequence", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 273630, "totalSubmissionRaw": 542306}, "675": {"acRate": 34.52269324234763, "difficulty": "Hard", "likes": 1232, "dislikes": 673, "categoryTitle": "Algorithms", "frontendQuestionId": "675", "paidOnly": false, "title": "Cut Off Trees for Golf Event", "titleSlug": "cut-off-trees-for-golf-event", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 70321, "totalSubmissionRaw": 203695}, "676": {"acRate": 57.64092472859189, "difficulty": "Medium", "likes": 1407, "dislikes": 210, "categoryTitle": "Algorithms", "frontendQuestionId": "676", "paidOnly": false, "title": "Implement Magic Dictionary", "titleSlug": "implement-magic-dictionary", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 86119, "totalSubmissionRaw": 149406}, "677": {"acRate": 56.836105143854354, "difficulty": "Medium", "likes": 1654, "dislikes": 156, "categoryTitle": "Algorithms", "frontendQuestionId": "677", "paidOnly": false, "title": "Map Sum Pairs", "titleSlug": "map-sum-pairs", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 119852, "totalSubmissionRaw": 210873}, "678": {"acRate": 38.155848593632804, "difficulty": "Medium", "likes": 6192, "dislikes": 192, "categoryTitle": "Algorithms", "frontendQuestionId": "678", "paidOnly": false, "title": "Valid Parenthesis String", "titleSlug": "valid-parenthesis-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 395282, "totalSubmissionRaw": 1035967}, "679": {"acRate": 49.44651259936358, "difficulty": "Hard", "likes": 1470, "dislikes": 251, "categoryTitle": "Algorithms", "frontendQuestionId": "679", "paidOnly": false, "title": "24 Game", "titleSlug": "24-game", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 80492, "totalSubmissionRaw": 162786}, "680": {"acRate": 41.15942105124905, "difficulty": "Easy", "likes": 8262, "dislikes": 445, "categoryTitle": "Algorithms", "frontendQuestionId": "680", "paidOnly": false, "title": "Valid Palindrome II", "titleSlug": "valid-palindrome-ii", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 783449, "totalSubmissionRaw": 1903450}, "681": {"acRate": 46.77718810403879, "difficulty": "Medium", "likes": 730, "dislikes": 1065, "categoryTitle": "Algorithms", "frontendQuestionId": "681", "paidOnly": true, "title": "Next Closest Time", "titleSlug": "next-closest-time", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 110353, "totalSubmissionRaw": 235910}, "682": {"acRate": 77.06122597450889, "difficulty": "Easy", "likes": 2867, "dislikes": 1909, "categoryTitle": "Algorithms", "frontendQuestionId": "682", "paidOnly": false, "title": "Baseball Game", "titleSlug": "baseball-game", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 381329, "totalSubmissionRaw": 494839}, "683": {"acRate": 37.16022631515589, "difficulty": "Hard", "likes": 800, "dislikes": 693, "categoryTitle": "Algorithms", "frontendQuestionId": "683", "paidOnly": true, "title": "K Empty Slots", "titleSlug": "k-empty-slots", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}, {"name": "Monotonic Queue", "id": "VG9waWNUYWdOb2RlOjYxMDcx", "slug": "monotonic-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 61738, "totalSubmissionRaw": 166140}, "684": {"acRate": 63.30460655580185, "difficulty": "Medium", "likes": 6213, "dislikes": 404, "categoryTitle": "Algorithms", "frontendQuestionId": "684", "paidOnly": false, "title": "Redundant Connection", "titleSlug": "redundant-connection", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 382116, "totalSubmissionRaw": 603616}, "685": {"acRate": 34.58345996049233, "difficulty": "Hard", "likes": 2342, "dislikes": 317, "categoryTitle": "Algorithms", "frontendQuestionId": "685", "paidOnly": false, "title": "Redundant Connection II", "titleSlug": "redundant-connection-ii", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 72830, "totalSubmissionRaw": 210592}, "686": {"acRate": 35.42764337052146, "difficulty": "Medium", "likes": 2561, "dislikes": 983, "categoryTitle": "Algorithms", "frontendQuestionId": "686", "paidOnly": false, "title": "Repeated String Match", "titleSlug": "repeated-string-match", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 176909, "totalSubmissionRaw": 499353}, "687": {"acRate": 41.78337981136433, "difficulty": "Medium", "likes": 4248, "dislikes": 673, "categoryTitle": "Algorithms", "frontendQuestionId": "687", "paidOnly": false, "title": "Longest Univalue Path", "titleSlug": "longest-univalue-path", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 188189, "totalSubmissionRaw": 450392}, "688": {"acRate": 56.28115160329271, "difficulty": "Medium", "likes": 3845, "dislikes": 475, "categoryTitle": "Algorithms", "frontendQuestionId": "688", "paidOnly": false, "title": "Knight Probability in Chessboard", "titleSlug": "knight-probability-in-chessboard", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 159440, "totalSubmissionRaw": 283292}, "689": {"acRate": 50.24424329452793, "difficulty": "Hard", "likes": 1971, "dislikes": 116, "categoryTitle": "Algorithms", "frontendQuestionId": "689", "paidOnly": false, "title": "Maximum Sum of 3 Non-Overlapping Subarrays", "titleSlug": "maximum-sum-of-3-non-overlapping-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 78377, "totalSubmissionRaw": 155992}, "690": {"acRate": 67.31960234324579, "difficulty": "Medium", "likes": 2105, "dislikes": 1338, "categoryTitle": "Algorithms", "frontendQuestionId": "690", "paidOnly": false, "title": "Employee Importance", "titleSlug": "employee-importance", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 216962, "totalSubmissionRaw": 322287}, "691": {"acRate": 48.99377189567925, "difficulty": "Hard", "likes": 1225, "dislikes": 114, "categoryTitle": "Algorithms", "frontendQuestionId": "691", "paidOnly": false, "title": "Stickers to Spell Word", "titleSlug": "stickers-to-spell-word", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 75519, "totalSubmissionRaw": 154139}, "692": {"acRate": 58.3233680667751, "difficulty": "Medium", "likes": 7663, "dislikes": 346, "categoryTitle": "Algorithms", "frontendQuestionId": "692", "paidOnly": false, "title": "Top K Frequent Words", "titleSlug": "top-k-frequent-words", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Bucket Sort", "id": "VG9waWNUYWdOb2RlOjYxMDYw", "slug": "bucket-sort"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 633550, "totalSubmissionRaw": 1086269}, "693": {"acRate": 62.788632326820604, "difficulty": "Easy", "likes": 1361, "dislikes": 111, "categoryTitle": "Algorithms", "frontendQuestionId": "693", "paidOnly": false, "title": "Binary Number with Alternating Bits", "titleSlug": "binary-number-with-alternating-bits", "topicTags": [{"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 138572, "totalSubmissionRaw": 220696}, "694": {"acRate": 61.50993690682201, "difficulty": "Medium", "likes": 2234, "dislikes": 142, "categoryTitle": "Algorithms", "frontendQuestionId": "694", "paidOnly": true, "title": "Number of Distinct Islands", "titleSlug": "number-of-distinct-islands", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 171681, "totalSubmissionRaw": 279111}, "695": {"acRate": 72.39451549608006, "difficulty": "Medium", "likes": 9982, "dislikes": 203, "categoryTitle": "Algorithms", "frontendQuestionId": "695", "paidOnly": false, "title": "Max Area of Island", "titleSlug": "max-area-of-island", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 912422, "totalSubmissionRaw": 1260345}, "696": {"acRate": 65.6343173249883, "difficulty": "Easy", "likes": 3985, "dislikes": 868, "categoryTitle": "Algorithms", "frontendQuestionId": "696", "paidOnly": false, "title": "Count Binary Substrings", "titleSlug": "count-binary-substrings", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 213091, "totalSubmissionRaw": 324664}, "697": {"acRate": 56.69677107093758, "difficulty": "Easy", "likes": 3039, "dislikes": 1736, "categoryTitle": "Algorithms", "frontendQuestionId": "697", "paidOnly": false, "title": "Degree of an Array", "titleSlug": "degree-of-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 220225, "totalSubmissionRaw": 388426}, "698": {"acRate": 38.184768270648355, "difficulty": "Medium", "likes": 7138, "dislikes": 512, "categoryTitle": "Algorithms", "frontendQuestionId": "698", "paidOnly": false, "title": "Partition to K Equal Sum Subsets", "titleSlug": "partition-to-k-equal-sum-subsets", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 275581, "totalSubmissionRaw": 721704}, "699": {"acRate": 45.38701408956589, "difficulty": "Hard", "likes": 632, "dislikes": 75, "categoryTitle": "Algorithms", "frontendQuestionId": "699", "paidOnly": false, "title": "Falling Squares", "titleSlug": "falling-squares", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 27800, "totalSubmissionRaw": 61251}, "700": {"acRate": 80.40867616865027, "difficulty": "Easy", "likes": 5967, "dislikes": 194, "categoryTitle": "Algorithms", "frontendQuestionId": "700", "paidOnly": false, "title": "Search in a Binary Search Tree", "titleSlug": "search-in-a-binary-search-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 943828, "totalSubmissionRaw": 1173789}, "701": {"acRate": 73.68391053998562, "difficulty": "Medium", "likes": 5863, "dislikes": 177, "categoryTitle": "Algorithms", "frontendQuestionId": "701", "paidOnly": false, "title": "Insert into a Binary Search Tree", "titleSlug": "insert-into-a-binary-search-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 568814, "totalSubmissionRaw": 771965}, "702": {"acRate": 72.2699564586357, "difficulty": "Medium", "likes": 910, "dislikes": 49, "categoryTitle": "Algorithms", "frontendQuestionId": "702", "paidOnly": true, "title": "Search in a Sorted Array of Unknown Size", "titleSlug": "search-in-a-sorted-array-of-unknown-size", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 99588, "totalSubmissionRaw": 137800}, "703": {"acRate": 59.111368224453074, "difficulty": "Easy", "likes": 5831, "dislikes": 3713, "categoryTitle": "Algorithms", "frontendQuestionId": "703", "paidOnly": false, "title": "Kth Largest Element in a Stream", "titleSlug": "kth-largest-element-in-a-stream", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}, {"name": "Data Stream", "id": "VG9waWNUYWdOb2RlOjYxMDYz", "slug": "data-stream"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 688688, "totalSubmissionRaw": 1165070}, "704": {"acRate": 58.16892561716311, "difficulty": "Easy", "likes": 11903, "dislikes": 253, "categoryTitle": "Algorithms", "frontendQuestionId": "704", "paidOnly": false, "title": "Binary Search", "titleSlug": "binary-search", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 2591179, "totalSubmissionRaw": 4454574}, "705": {"acRate": 67.1351639612091, "difficulty": "Easy", "likes": 3784, "dislikes": 309, "categoryTitle": "Algorithms", "frontendQuestionId": "705", "paidOnly": false, "title": "Design HashSet", "titleSlug": "design-hashset", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 435581, "totalSubmissionRaw": 648811}, "706": {"acRate": 65.59347614570758, "difficulty": "Easy", "likes": 5112, "dislikes": 467, "categoryTitle": "Algorithms", "frontendQuestionId": "706", "paidOnly": false, "title": "Design HashMap", "titleSlug": "design-hashmap", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 599323, "totalSubmissionRaw": 913693}, "707": {"acRate": 28.384412587218282, "difficulty": "Medium", "likes": 2660, "dislikes": 1622, "categoryTitle": "Algorithms", "frontendQuestionId": "707", "paidOnly": false, "title": "Design Linked List", "titleSlug": "design-linked-list", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 347327, "totalSubmissionRaw": 1223654}, "708": {"acRate": 36.48759545456383, "difficulty": "Medium", "likes": 1221, "dislikes": 777, "categoryTitle": "Algorithms", "frontendQuestionId": "708", "paidOnly": true, "title": "Insert into a Sorted Circular Linked List", "titleSlug": "insert-into-a-sorted-circular-linked-list", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 180516, "totalSubmissionRaw": 494735}, "709": {"acRate": 83.57880127306588, "difficulty": "Easy", "likes": 1851, "dislikes": 2774, "categoryTitle": "Algorithms", "frontendQuestionId": "709", "paidOnly": false, "title": "To Lower Case", "titleSlug": "to-lower-case", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 544380, "totalSubmissionRaw": 651338}, "710": {"acRate": 33.523670044948545, "difficulty": "Hard", "likes": 866, "dislikes": 119, "categoryTitle": "Algorithms", "frontendQuestionId": "710", "paidOnly": false, "title": "Random Pick with Blacklist", "titleSlug": "random-pick-with-blacklist", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Randomized", "id": "VG9waWNUYWdOb2RlOjYxMDc1", "slug": "randomized"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 43034, "totalSubmissionRaw": 128368}, "711": {"acRate": 53.0823507566614, "difficulty": "Hard", "likes": 263, "dislikes": 272, "categoryTitle": "Algorithms", "frontendQuestionId": "711", "paidOnly": true, "title": "Number of Distinct Islands II", "titleSlug": "number-of-distinct-islands-ii", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11435, "totalSubmissionRaw": 21542}, "712": {"acRate": 65.2228389680144, "difficulty": "Medium", "likes": 3986, "dislikes": 107, "categoryTitle": "Algorithms", "frontendQuestionId": "712", "paidOnly": false, "title": "Minimum ASCII Delete Sum for Two Strings", "titleSlug": "minimum-ascii-delete-sum-for-two-strings", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 148876, "totalSubmissionRaw": 228258}, "713": {"acRate": 51.6729813782148, "difficulty": "Medium", "likes": 6860, "dislikes": 217, "categoryTitle": "Algorithms", "frontendQuestionId": "713", "paidOnly": false, "title": "Subarray Product Less Than K", "titleSlug": "subarray-product-less-than-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 423192, "totalSubmissionRaw": 818984}, "714": {"acRate": 69.13095908877878, "difficulty": "Medium", "likes": 7172, "dislikes": 214, "categoryTitle": "Algorithms", "frontendQuestionId": "714", "paidOnly": false, "title": "Best Time to Buy and Sell Stock with Transaction Fee", "titleSlug": "best-time-to-buy-and-sell-stock-with-transaction-fee", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 393832, "totalSubmissionRaw": 569692}, "715": {"acRate": 43.88201569100785, "difficulty": "Hard", "likes": 1494, "dislikes": 126, "categoryTitle": "Algorithms", "frontendQuestionId": "715", "paidOnly": false, "title": "Range Module", "titleSlug": "range-module", "topicTags": [{"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 75621, "totalSubmissionRaw": 172328}, "716": {"acRate": 45.06732914629144, "difficulty": "Hard", "likes": 1922, "dislikes": 510, "categoryTitle": "Algorithms", "frontendQuestionId": "716", "paidOnly": true, "title": "Max Stack", "titleSlug": "max-stack", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Doubly-Linked List", "id": "VG9waWNUYWdOb2RlOjYxMDU4", "slug": "doubly-linked-list"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 154923, "totalSubmissionRaw": 343757}, "717": {"acRate": 45.23050900794588, "difficulty": "Easy", "likes": 869, "dislikes": 2113, "categoryTitle": "Algorithms", "frontendQuestionId": "717", "paidOnly": false, "title": "1-bit and 2-bit Characters", "titleSlug": "1-bit-and-2-bit-characters", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 137981, "totalSubmissionRaw": 305063}, "718": {"acRate": 50.95316218776718, "difficulty": "Medium", "likes": 6803, "dislikes": 169, "categoryTitle": "Algorithms", "frontendQuestionId": "718", "paidOnly": false, "title": "Maximum Length of Repeated Subarray", "titleSlug": "maximum-length-of-repeated-subarray", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 308714, "totalSubmissionRaw": 605878}, "719": {"acRate": 45.15618216358786, "difficulty": "Hard", "likes": 3678, "dislikes": 117, "categoryTitle": "Algorithms", "frontendQuestionId": "719", "paidOnly": false, "title": "Find K-th Smallest Pair Distance", "titleSlug": "find-k-th-smallest-pair-distance", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 179934, "totalSubmissionRaw": 398465}, "720": {"acRate": 52.6638062637444, "difficulty": "Medium", "likes": 1967, "dislikes": 1493, "categoryTitle": "Algorithms", "frontendQuestionId": "720", "paidOnly": false, "title": "Longest Word in Dictionary", "titleSlug": "longest-word-in-dictionary", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 156619, "totalSubmissionRaw": 297394}, "721": {"acRate": 57.73811841805143, "difficulty": "Medium", "likes": 6795, "dislikes": 1167, "categoryTitle": "Algorithms", "frontendQuestionId": "721", "paidOnly": false, "title": "Accounts Merge", "titleSlug": "accounts-merge", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 415144, "totalSubmissionRaw": 719012}, "722": {"acRate": 38.907021112214814, "difficulty": "Medium", "likes": 719, "dislikes": 1813, "categoryTitle": "Algorithms", "frontendQuestionId": "722", "paidOnly": false, "title": "Remove Comments", "titleSlug": "remove-comments", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 74028, "totalSubmissionRaw": 190269}, "723": {"acRate": 76.9075651434153, "difficulty": "Medium", "likes": 1016, "dislikes": 525, "categoryTitle": "Algorithms", "frontendQuestionId": "723", "paidOnly": true, "title": "Candy Crush", "titleSlug": "candy-crush", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 73225, "totalSubmissionRaw": 95212}, "724": {"acRate": 58.374772095194785, "difficulty": "Easy", "likes": 8390, "dislikes": 854, "categoryTitle": "Algorithms", "frontendQuestionId": "724", "paidOnly": false, "title": "Find Pivot Index", "titleSlug": "find-pivot-index", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1160299, "totalSubmissionRaw": 1987672}, "725": {"acRate": 64.27257259492457, "difficulty": "Medium", "likes": 3958, "dislikes": 317, "categoryTitle": "Algorithms", "frontendQuestionId": "725", "paidOnly": false, "title": "Split Linked List in Parts", "titleSlug": "split-linked-list-in-parts", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 204363, "totalSubmissionRaw": 317963}, "726": {"acRate": 65.20570793180134, "difficulty": "Hard", "likes": 1874, "dislikes": 406, "categoryTitle": "Algorithms", "frontendQuestionId": "726", "paidOnly": false, "title": "Number of Atoms", "titleSlug": "number-of-atoms", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 147777, "totalSubmissionRaw": 226632}, "727": {"acRate": 43.52315086156371, "difficulty": "Hard", "likes": 1456, "dislikes": 91, "categoryTitle": "Algorithms", "frontendQuestionId": "727", "paidOnly": true, "title": "Minimum Window Subsequence", "titleSlug": "minimum-window-subsequence", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 92824, "totalSubmissionRaw": 213275}, "728": {"acRate": 78.89667496649349, "difficulty": "Easy", "likes": 1785, "dislikes": 375, "categoryTitle": "Algorithms", "frontendQuestionId": "728", "paidOnly": false, "title": "Self Dividing Numbers", "titleSlug": "self-dividing-numbers", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 252538, "totalSubmissionRaw": 320087}, "729": {"acRate": 56.58804638297207, "difficulty": "Medium", "likes": 4218, "dislikes": 112, "categoryTitle": "Algorithms", "frontendQuestionId": "729", "paidOnly": false, "title": "My Calendar I", "titleSlug": "my-calendar-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 289681, "totalSubmissionRaw": 511912}, "730": {"acRate": 45.79049466537342, "difficulty": "Hard", "likes": 1926, "dislikes": 98, "categoryTitle": "Algorithms", "frontendQuestionId": "730", "paidOnly": false, "title": "Count Different Palindromic Subsequences", "titleSlug": "count-different-palindromic-subsequences", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 37768, "totalSubmissionRaw": 82480}, "731": {"acRate": 55.744575271978036, "difficulty": "Medium", "likes": 1752, "dislikes": 148, "categoryTitle": "Algorithms", "frontendQuestionId": "731", "paidOnly": false, "title": "My Calendar II", "titleSlug": "my-calendar-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 103351, "totalSubmissionRaw": 185401}, "732": {"acRate": 71.66071151157371, "difficulty": "Hard", "likes": 1962, "dislikes": 269, "categoryTitle": "Algorithms", "frontendQuestionId": "732", "paidOnly": false, "title": "My Calendar III", "titleSlug": "my-calendar-iii", "topicTags": [{"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 92256, "totalSubmissionRaw": 128740}, "733": {"acRate": 64.6213711886069, "difficulty": "Easy", "likes": 8467, "dislikes": 878, "categoryTitle": "Algorithms", "frontendQuestionId": "733", "paidOnly": false, "title": "Flood Fill", "titleSlug": "flood-fill", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 962690, "totalSubmissionRaw": 1489741}, "734": {"acRate": 44.36947295113202, "difficulty": "Easy", "likes": 47, "dislikes": 58, "categoryTitle": "Algorithms", "frontendQuestionId": "734", "paidOnly": true, "title": "Sentence Similarity", "titleSlug": "sentence-similarity", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 67533, "totalSubmissionRaw": 152206}, "735": {"acRate": 44.634797768370156, "difficulty": "Medium", "likes": 8024, "dislikes": 1095, "categoryTitle": "Algorithms", "frontendQuestionId": "735", "paidOnly": false, "title": "Asteroid Collision", "titleSlug": "asteroid-collision", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 567863, "totalSubmissionRaw": 1272244}, "736": {"acRate": 52.00164424855558, "difficulty": "Hard", "likes": 476, "dislikes": 363, "categoryTitle": "Algorithms", "frontendQuestionId": "736", "paidOnly": false, "title": "Parse Lisp Expression", "titleSlug": "parse-lisp-expression", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22771, "totalSubmissionRaw": 43789}, "737": {"acRate": 50.14842171277263, "difficulty": "Medium", "likes": 840, "dislikes": 43, "categoryTitle": "Algorithms", "frontendQuestionId": "737", "paidOnly": true, "title": "Sentence Similarity II", "titleSlug": "sentence-similarity-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 71968, "totalSubmissionRaw": 143510}, "738": {"acRate": 48.28822385234677, "difficulty": "Medium", "likes": 1324, "dislikes": 105, "categoryTitle": "Algorithms", "frontendQuestionId": "738", "paidOnly": false, "title": "Monotone Increasing Digits", "titleSlug": "monotone-increasing-digits", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 55361, "totalSubmissionRaw": 114647}, "739": {"acRate": 66.25670267121116, "difficulty": "Medium", "likes": 13235, "dislikes": 326, "categoryTitle": "Algorithms", "frontendQuestionId": "739", "paidOnly": false, "title": "Daily Temperatures", "titleSlug": "daily-temperatures", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1048546, "totalSubmissionRaw": 1582553}, "740": {"acRate": 56.51643460889256, "difficulty": "Medium", "likes": 7543, "dislikes": 382, "categoryTitle": "Algorithms", "frontendQuestionId": "740", "paidOnly": false, "title": "Delete and Earn", "titleSlug": "delete-and-earn", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 353910, "totalSubmissionRaw": 626206}, "741": {"acRate": 37.157298683778436, "difficulty": "Hard", "likes": 4290, "dislikes": 159, "categoryTitle": "Algorithms", "frontendQuestionId": "741", "paidOnly": false, "title": "Cherry Pickup", "titleSlug": "cherry-pickup", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 83731, "totalSubmissionRaw": 225341}, "742": {"acRate": 46.43377145630491, "difficulty": "Medium", "likes": 859, "dislikes": 178, "categoryTitle": "Algorithms", "frontendQuestionId": "742", "paidOnly": true, "title": "Closest Leaf in a Binary Tree", "titleSlug": "closest-leaf-in-a-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 46880, "totalSubmissionRaw": 100961}, "743": {"acRate": 54.76602708780348, "difficulty": "Medium", "likes": 7469, "dislikes": 367, "categoryTitle": "Algorithms", "frontendQuestionId": "743", "paidOnly": false, "title": "Network Delay Time", "titleSlug": "network-delay-time", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 531409, "totalSubmissionRaw": 970326}, "744": {"acRate": 52.607164448566856, "difficulty": "Easy", "likes": 4451, "dislikes": 2196, "categoryTitle": "Algorithms", "frontendQuestionId": "744", "paidOnly": false, "title": "Find Smallest Letter Greater Than Target", "titleSlug": "find-smallest-letter-greater-than-target", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 508181, "totalSubmissionRaw": 965991}, "745": {"acRate": 41.15726555829022, "difficulty": "Hard", "likes": 2279, "dislikes": 484, "categoryTitle": "Algorithms", "frontendQuestionId": "745", "paidOnly": false, "title": "Prefix and Suffix Search", "titleSlug": "prefix-and-suffix-search", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 98328, "totalSubmissionRaw": 238908}, "746": {"acRate": 66.1070832163702, "difficulty": "Easy", "likes": 11460, "dislikes": 1771, "categoryTitle": "Algorithms", "frontendQuestionId": "746", "paidOnly": false, "title": "Min Cost Climbing Stairs", "titleSlug": "min-cost-climbing-stairs", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1245785, "totalSubmissionRaw": 1884496}, "747": {"acRate": 49.29092863359275, "difficulty": "Easy", "likes": 1204, "dislikes": 906, "categoryTitle": "Algorithms", "frontendQuestionId": "747", "paidOnly": false, "title": "Largest Number At Least Twice of Others", "titleSlug": "largest-number-at-least-twice-of-others", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 255431, "totalSubmissionRaw": 518212}, "748": {"acRate": 60.36795532188483, "difficulty": "Easy", "likes": 549, "dislikes": 1107, "categoryTitle": "Algorithms", "frontendQuestionId": "748", "paidOnly": false, "title": "Shortest Completing Word", "titleSlug": "shortest-completing-word", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 79341, "totalSubmissionRaw": 131429}, "749": {"acRate": 51.3957755827119, "difficulty": "Hard", "likes": 395, "dislikes": 458, "categoryTitle": "Algorithms", "frontendQuestionId": "749", "paidOnly": false, "title": "Contain Virus", "titleSlug": "contain-virus", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13164, "totalSubmissionRaw": 25613}, "750": {"acRate": 67.79435688421643, "difficulty": "Medium", "likes": 622, "dislikes": 92, "categoryTitle": "Algorithms", "frontendQuestionId": "750", "paidOnly": true, "title": "Number Of Corner Rectangles", "titleSlug": "number-of-corner-rectangles", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 38756, "totalSubmissionRaw": 57167}, "751": {"acRate": 55.618890694929966, "difficulty": "Medium", "likes": 89, "dislikes": 318, "categoryTitle": "Algorithms", "frontendQuestionId": "751", "paidOnly": true, "title": "IP to CIDR", "titleSlug": "ip-to-cidr", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24979, "totalSubmissionRaw": 44911}, "752": {"acRate": 60.352970558037576, "difficulty": "Medium", "likes": 4771, "dislikes": 220, "categoryTitle": "Algorithms", "frontendQuestionId": "752", "paidOnly": false, "title": "Open the Lock", "titleSlug": "open-the-lock", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 326238, "totalSubmissionRaw": 540550}, "753": {"acRate": 57.080481808776206, "difficulty": "Hard", "likes": 565, "dislikes": 103, "categoryTitle": "Algorithms", "frontendQuestionId": "753", "paidOnly": false, "title": "Cracking the Safe", "titleSlug": "cracking-the-safe", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Eulerian Circuit", "id": "VG9waWNUYWdOb2RlOjYxMDc0", "slug": "eulerian-circuit"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 60136, "totalSubmissionRaw": 105353}, "754": {"acRate": 43.3273360640049, "difficulty": "Medium", "likes": 1818, "dislikes": 812, "categoryTitle": "Algorithms", "frontendQuestionId": "754", "paidOnly": false, "title": "Reach a Number", "titleSlug": "reach-a-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 56592, "totalSubmissionRaw": 130615}, "755": {"acRate": 47.10189806550329, "difficulty": "Medium", "likes": 301, "dislikes": 764, "categoryTitle": "Algorithms", "frontendQuestionId": "755", "paidOnly": true, "title": "Pour Water", "titleSlug": "pour-water", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 38787, "totalSubmissionRaw": 82347}, "756": {"acRate": 52.93073372543571, "difficulty": "Medium", "likes": 537, "dislikes": 480, "categoryTitle": "Algorithms", "frontendQuestionId": "756", "paidOnly": false, "title": "Pyramid Transition Matrix", "titleSlug": "pyramid-transition-matrix", "topicTags": [{"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34288, "totalSubmissionRaw": 64779}, "757": {"acRate": 44.713466511749935, "difficulty": "Hard", "likes": 713, "dislikes": 83, "categoryTitle": "Algorithms", "frontendQuestionId": "757", "paidOnly": false, "title": "Set Intersection Size At Least Two", "titleSlug": "set-intersection-size-at-least-two", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23860, "totalSubmissionRaw": 53362}, "758": {"acRate": 51.55623705377559, "difficulty": "Medium", "likes": 269, "dislikes": 124, "categoryTitle": "Algorithms", "frontendQuestionId": "758", "paidOnly": true, "title": "Bold Words in String", "titleSlug": "bold-words-in-string", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19165, "totalSubmissionRaw": 37173}, "759": {"acRate": 72.24511617564262, "difficulty": "Hard", "likes": 1900, "dislikes": 135, "categoryTitle": "Algorithms", "frontendQuestionId": "759", "paidOnly": true, "title": "Employee Free Time", "titleSlug": "employee-free-time", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 152698, "totalSubmissionRaw": 211361}, "760": {"acRate": 83.69692532942899, "difficulty": "Easy", "likes": 612, "dislikes": 231, "categoryTitle": "Algorithms", "frontendQuestionId": "760", "paidOnly": true, "title": "Find Anagram Mappings", "titleSlug": "find-anagram-mappings", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 102896, "totalSubmissionRaw": 122939}, "761": {"acRate": 61.42774899251583, "difficulty": "Hard", "likes": 705, "dislikes": 218, "categoryTitle": "Algorithms", "frontendQuestionId": "761", "paidOnly": false, "title": "Special Binary String", "titleSlug": "special-binary-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 18139, "totalSubmissionRaw": 29529}, "762": {"acRate": 69.84007138444642, "difficulty": "Easy", "likes": 716, "dislikes": 509, "categoryTitle": "Algorithms", "frontendQuestionId": "762", "paidOnly": false, "title": "Prime Number of Set Bits in Binary Representation", "titleSlug": "prime-number-of-set-bits-in-binary-representation", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 101750, "totalSubmissionRaw": 145690}, "763": {"acRate": 79.95999335629743, "difficulty": "Medium", "likes": 10299, "dislikes": 401, "categoryTitle": "Algorithms", "frontendQuestionId": "763", "paidOnly": false, "title": "Partition Labels", "titleSlug": "partition-labels", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 553630, "totalSubmissionRaw": 692384}, "764": {"acRate": 48.37775015738245, "difficulty": "Medium", "likes": 1464, "dislikes": 233, "categoryTitle": "Algorithms", "frontendQuestionId": "764", "paidOnly": false, "title": "Largest Plus Sign", "titleSlug": "largest-plus-sign", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 59941, "totalSubmissionRaw": 123902}, "765": {"acRate": 57.57993707800344, "difficulty": "Hard", "likes": 2350, "dislikes": 118, "categoryTitle": "Algorithms", "frontendQuestionId": "765", "paidOnly": false, "title": "Couples Holding Hands", "titleSlug": "couples-holding-hands", "topicTags": [{"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 63874, "totalSubmissionRaw": 110931}, "766": {"acRate": 69.11514230155905, "difficulty": "Easy", "likes": 3541, "dislikes": 168, "categoryTitle": "Algorithms", "frontendQuestionId": "766", "paidOnly": false, "title": "Toeplitz Matrix", "titleSlug": "toeplitz-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 343702, "totalSubmissionRaw": 497289}, "767": {"acRate": 54.90638113848224, "difficulty": "Medium", "likes": 8525, "dislikes": 258, "categoryTitle": "Algorithms", "frontendQuestionId": "767", "paidOnly": false, "title": "Reorganize String", "titleSlug": "reorganize-string", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 411362, "totalSubmissionRaw": 749207}, "768": {"acRate": 53.42634953397096, "difficulty": "Hard", "likes": 1839, "dislikes": 55, "categoryTitle": "Algorithms", "frontendQuestionId": "768", "paidOnly": false, "title": "Max Chunks To Make Sorted II", "titleSlug": "max-chunks-to-make-sorted-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 65747, "totalSubmissionRaw": 123061}, "769": {"acRate": 58.53884060759602, "difficulty": "Medium", "likes": 2819, "dislikes": 245, "categoryTitle": "Algorithms", "frontendQuestionId": "769", "paidOnly": false, "title": "Max Chunks To Make Sorted", "titleSlug": "max-chunks-to-make-sorted", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 109525, "totalSubmissionRaw": 187098}, "770": {"acRate": 55.70598609814296, "difficulty": "Hard", "likes": 167, "dislikes": 1411, "categoryTitle": "Algorithms", "frontendQuestionId": "770", "paidOnly": false, "title": "Basic Calculator IV", "titleSlug": "basic-calculator-iv", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10739, "totalSubmissionRaw": 19278}, "771": {"acRate": 88.79365498055682, "difficulty": "Easy", "likes": 5107, "dislikes": 595, "categoryTitle": "Algorithms", "frontendQuestionId": "771", "paidOnly": false, "title": "Jewels and Stones", "titleSlug": "jewels-and-stones", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1083937, "totalSubmissionRaw": 1220737}, "772": {"acRate": 50.97297828436671, "difficulty": "Hard", "likes": 1136, "dislikes": 289, "categoryTitle": "Algorithms", "frontendQuestionId": "772", "paidOnly": true, "title": "Basic Calculator III", "titleSlug": "basic-calculator-iii", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 129688, "totalSubmissionRaw": 254425}, "773": {"acRate": 65.02033818536323, "difficulty": "Hard", "likes": 2026, "dislikes": 52, "categoryTitle": "Algorithms", "frontendQuestionId": "773", "paidOnly": false, "title": "Sliding Puzzle", "titleSlug": "sliding-puzzle", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 96708, "totalSubmissionRaw": 148735}, "774": {"acRate": 52.359120975791306, "difficulty": "Hard", "likes": 681, "dislikes": 97, "categoryTitle": "Algorithms", "frontendQuestionId": "774", "paidOnly": true, "title": "Minimize Max Distance to Gas Station", "titleSlug": "minimize-max-distance-to-gas-station", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 30950, "totalSubmissionRaw": 59111}, "775": {"acRate": 42.420871786965044, "difficulty": "Medium", "likes": 1832, "dislikes": 376, "categoryTitle": "Algorithms", "frontendQuestionId": "775", "paidOnly": false, "title": "Global and Local Inversions", "titleSlug": "global-and-local-inversions", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 77038, "totalSubmissionRaw": 181604}, "776": {"acRate": 82.6217587416045, "difficulty": "Medium", "likes": 1058, "dislikes": 103, "categoryTitle": "Algorithms", "frontendQuestionId": "776", "paidOnly": true, "title": "Split BST", "titleSlug": "split-bst", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 108622, "totalSubmissionRaw": 131469}, "777": {"acRate": 36.86991580694889, "difficulty": "Medium", "likes": 1223, "dislikes": 933, "categoryTitle": "Algorithms", "frontendQuestionId": "777", "paidOnly": false, "title": "Swap Adjacent in LR String", "titleSlug": "swap-adjacent-in-lr-string", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 77730, "totalSubmissionRaw": 210824}, "778": {"acRate": 61.35237621717011, "difficulty": "Hard", "likes": 3725, "dislikes": 248, "categoryTitle": "Algorithms", "frontendQuestionId": "778", "paidOnly": false, "title": "Swim in Rising Water", "titleSlug": "swim-in-rising-water", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 175223, "totalSubmissionRaw": 285601}, "779": {"acRate": 46.72981435920376, "difficulty": "Medium", "likes": 3795, "dislikes": 396, "categoryTitle": "Algorithms", "frontendQuestionId": "779", "paidOnly": false, "title": "K-th Symbol in Grammar", "titleSlug": "k-th-symbol-in-grammar", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 208929, "totalSubmissionRaw": 447100}, "780": {"acRate": 33.31788117449152, "difficulty": "Hard", "likes": 1526, "dislikes": 230, "categoryTitle": "Algorithms", "frontendQuestionId": "780", "paidOnly": false, "title": "Reaching Points", "titleSlug": "reaching-points", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 69716, "totalSubmissionRaw": 209247}, "781": {"acRate": 53.079795494599445, "difficulty": "Medium", "likes": 1335, "dislikes": 621, "categoryTitle": "Algorithms", "frontendQuestionId": "781", "paidOnly": false, "title": "Rabbits in Forest", "titleSlug": "rabbits-in-forest", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 60839, "totalSubmissionRaw": 114618}, "782": {"acRate": 50.90032969819934, "difficulty": "Hard", "likes": 358, "dislikes": 311, "categoryTitle": "Algorithms", "frontendQuestionId": "782", "paidOnly": false, "title": "Transform to Chessboard", "titleSlug": "transform-to-chessboard", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 18063, "totalSubmissionRaw": 35487}, "783": {"acRate": 59.73938099534182, "difficulty": "Easy", "likes": 3492, "dislikes": 419, "categoryTitle": "Algorithms", "frontendQuestionId": "783", "paidOnly": false, "title": "Minimum Distance Between BST Nodes", "titleSlug": "minimum-distance-between-bst-nodes", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 259570, "totalSubmissionRaw": 434504}, "784": {"acRate": 74.40131208726727, "difficulty": "Medium", "likes": 4662, "dislikes": 156, "categoryTitle": "Algorithms", "frontendQuestionId": "784", "paidOnly": false, "title": "Letter Case Permutation", "titleSlug": "letter-case-permutation", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 309381, "totalSubmissionRaw": 415827}, "785": {"acRate": 56.22486935122326, "difficulty": "Medium", "likes": 8310, "dislikes": 386, "categoryTitle": "Algorithms", "frontendQuestionId": "785", "paidOnly": false, "title": "Is Graph Bipartite?", "titleSlug": "is-graph-bipartite", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 597220, "totalSubmissionRaw": 1062199}, "786": {"acRate": 68.1861055686559, "difficulty": "Medium", "likes": 2009, "dislikes": 115, "categoryTitle": "Algorithms", "frontendQuestionId": "786", "paidOnly": false, "title": "K-th Smallest Prime Fraction", "titleSlug": "k-th-smallest-prime-fraction", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 150363, "totalSubmissionRaw": 220519}, "787": {"acRate": 39.52672897442571, "difficulty": "Medium", "likes": 9972, "dislikes": 415, "categoryTitle": "Algorithms", "frontendQuestionId": "787", "paidOnly": false, "title": "Cheapest Flights Within K Stops", "titleSlug": "cheapest-flights-within-k-stops", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 599908, "totalSubmissionRaw": 1517731}, "788": {"acRate": 56.463227664813466, "difficulty": "Medium", "likes": 748, "dislikes": 1928, "categoryTitle": "Algorithms", "frontendQuestionId": "788", "paidOnly": false, "title": "Rotated Digits", "titleSlug": "rotated-digits", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 109380, "totalSubmissionRaw": 193719}, "789": {"acRate": 62.03359535271058, "difficulty": "Medium", "likes": 292, "dislikes": 29, "categoryTitle": "Algorithms", "frontendQuestionId": "789", "paidOnly": false, "title": "Escape The Ghosts", "titleSlug": "escape-the-ghosts", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 30541, "totalSubmissionRaw": 49233}, "790": {"acRate": 50.069540054721195, "difficulty": "Medium", "likes": 3461, "dislikes": 1116, "categoryTitle": "Algorithms", "frontendQuestionId": "790", "paidOnly": false, "title": "Domino and Tromino Tiling", "titleSlug": "domino-and-tromino-tiling", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 142922, "totalSubmissionRaw": 285447}, "791": {"acRate": 70.92644475046298, "difficulty": "Medium", "likes": 3616, "dislikes": 414, "categoryTitle": "Algorithms", "frontendQuestionId": "791", "paidOnly": false, "title": "Custom Sort String", "titleSlug": "custom-sort-string", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 448091, "totalSubmissionRaw": 631769}, "792": {"acRate": 50.88501845468954, "difficulty": "Medium", "likes": 5499, "dislikes": 234, "categoryTitle": "Algorithms", "frontendQuestionId": "792", "paidOnly": false, "title": "Number of Matching Subsequences", "titleSlug": "number-of-matching-subsequences", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 233405, "totalSubmissionRaw": 458691}, "793": {"acRate": 44.8774384875585, "difficulty": "Hard", "likes": 437, "dislikes": 100, "categoryTitle": "Algorithms", "frontendQuestionId": "793", "paidOnly": false, "title": "Preimage Size of Factorial Zeroes Function", "titleSlug": "preimage-size-of-factorial-zeroes-function", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19370, "totalSubmissionRaw": 43162}, "794": {"acRate": 34.72259557508678, "difficulty": "Medium", "likes": 550, "dislikes": 1151, "categoryTitle": "Algorithms", "frontendQuestionId": "794", "paidOnly": false, "title": "Valid Tic-Tac-Toe State", "titleSlug": "valid-tic-tac-toe-state", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 59418, "totalSubmissionRaw": 171122}, "795": {"acRate": 53.305115005802364, "difficulty": "Medium", "likes": 2298, "dislikes": 119, "categoryTitle": "Algorithms", "frontendQuestionId": "795", "paidOnly": false, "title": "Number of Subarrays with Bounded Maximum", "titleSlug": "number-of-subarrays-with-bounded-maximum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 71657, "totalSubmissionRaw": 134428}, "796": {"acRate": 58.92752467818706, "difficulty": "Easy", "likes": 3643, "dislikes": 181, "categoryTitle": "Algorithms", "frontendQuestionId": "796", "paidOnly": false, "title": "Rotate String", "titleSlug": "rotate-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 351841, "totalSubmissionRaw": 597079}, "797": {"acRate": 82.6055070541752, "difficulty": "Medium", "likes": 7249, "dislikes": 147, "categoryTitle": "Algorithms", "frontendQuestionId": "797", "paidOnly": false, "title": "All Paths From Source to Target", "titleSlug": "all-paths-from-source-to-target", "topicTags": [{"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 540658, "totalSubmissionRaw": 654506}, "798": {"acRate": 51.65830596557075, "difficulty": "Hard", "likes": 540, "dislikes": 41, "categoryTitle": "Algorithms", "frontendQuestionId": "798", "paidOnly": false, "title": "Smallest Rotation with Highest Score", "titleSlug": "smallest-rotation-with-highest-score", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14314, "totalSubmissionRaw": 27709}, "799": {"acRate": 58.2233529047516, "difficulty": "Medium", "likes": 3652, "dislikes": 203, "categoryTitle": "Algorithms", "frontendQuestionId": "799", "paidOnly": false, "title": "Champagne Tower", "titleSlug": "champagne-tower", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 156084, "totalSubmissionRaw": 268078}, "800": {"acRate": 67.49226006191951, "difficulty": "Easy", "likes": 108, "dislikes": 684, "categoryTitle": "Algorithms", "frontendQuestionId": "800", "paidOnly": true, "title": "Similar RGB Color", "titleSlug": "similar-rgb-color", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 17440, "totalSubmissionRaw": 25840}, "801": {"acRate": 40.215129764760924, "difficulty": "Hard", "likes": 2814, "dislikes": 138, "categoryTitle": "Algorithms", "frontendQuestionId": "801", "paidOnly": false, "title": "Minimum Swaps To Make Sequences Increasing", "titleSlug": "minimum-swaps-to-make-sequences-increasing", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 80793, "totalSubmissionRaw": 200902}, "802": {"acRate": 63.79455823335414, "difficulty": "Medium", "likes": 5785, "dislikes": 460, "categoryTitle": "Algorithms", "frontendQuestionId": "802", "paidOnly": false, "title": "Find Eventual Safe States", "titleSlug": "find-eventual-safe-states", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 272938, "totalSubmissionRaw": 427838}, "803": {"acRate": 34.92450127992603, "difficulty": "Hard", "likes": 1116, "dislikes": 189, "categoryTitle": "Algorithms", "frontendQuestionId": "803", "paidOnly": false, "title": "Bricks Falling When Hit", "titleSlug": "bricks-falling-when-hit", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 30970, "totalSubmissionRaw": 88677}, "804": {"acRate": 82.94461916756075, "difficulty": "Easy", "likes": 2520, "dislikes": 1536, "categoryTitle": "Algorithms", "frontendQuestionId": "804", "paidOnly": false, "title": "Unique Morse Code Words", "titleSlug": "unique-morse-code-words", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 360260, "totalSubmissionRaw": 434338}, "805": {"acRate": 25.554762680042398, "difficulty": "Hard", "likes": 1270, "dislikes": 136, "categoryTitle": "Algorithms", "frontendQuestionId": "805", "paidOnly": false, "title": "Split Array With Same Average", "titleSlug": "split-array-with-same-average", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 36886, "totalSubmissionRaw": 144341}, "806": {"acRate": 68.91695798430183, "difficulty": "Easy", "likes": 601, "dislikes": 1333, "categoryTitle": "Algorithms", "frontendQuestionId": "806", "paidOnly": false, "title": "Number of Lines To Write String", "titleSlug": "number-of-lines-to-write-string", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 83588, "totalSubmissionRaw": 121288}, "807": {"acRate": 86.20371178031021, "difficulty": "Medium", "likes": 2573, "dislikes": 527, "categoryTitle": "Algorithms", "frontendQuestionId": "807", "paidOnly": false, "title": "Max Increase to Keep City Skyline", "titleSlug": "max-increase-to-keep-city-skyline", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 168005, "totalSubmissionRaw": 194893}, "808": {"acRate": 53.83332141750673, "difficulty": "Medium", "likes": 986, "dislikes": 2677, "categoryTitle": "Algorithms", "frontendQuestionId": "808", "paidOnly": false, "title": "Soup Servings", "titleSlug": "soup-servings", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Probability and Statistics", "id": "VG9waWNUYWdOb2RlOjYxMDc5", "slug": "probability-and-statistics"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 67767, "totalSubmissionRaw": 125883}, "809": {"acRate": 46.21358166723672, "difficulty": "Medium", "likes": 866, "dislikes": 1905, "categoryTitle": "Algorithms", "frontendQuestionId": "809", "paidOnly": false, "title": "Expressive Words", "titleSlug": "expressive-words", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 118902, "totalSubmissionRaw": 257288}, "810": {"acRate": 60.630291627469425, "difficulty": "Hard", "likes": 223, "dislikes": 281, "categoryTitle": "Algorithms", "frontendQuestionId": "810", "paidOnly": false, "title": "Chalkboard XOR Game", "titleSlug": "chalkboard-xor-game", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Brainteaser", "id": "VG9waWNUYWdOb2RlOjMy", "slug": "brainteaser"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 11601, "totalSubmissionRaw": 19134}, "811": {"acRate": 76.36244061407986, "difficulty": "Medium", "likes": 1559, "dislikes": 1299, "categoryTitle": "Algorithms", "frontendQuestionId": "811", "paidOnly": false, "title": "Subdomain Visit Count", "titleSlug": "subdomain-visit-count", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 233384, "totalSubmissionRaw": 305624}, "812": {"acRate": 60.98245376787585, "difficulty": "Easy", "likes": 531, "dislikes": 1590, "categoryTitle": "Algorithms", "frontendQuestionId": "812", "paidOnly": false, "title": "Largest Triangle Area", "titleSlug": "largest-triangle-area", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 54113, "totalSubmissionRaw": 88736}, "813": {"acRate": 53.603995425980045, "difficulty": "Medium", "likes": 2103, "dislikes": 99, "categoryTitle": "Algorithms", "frontendQuestionId": "813", "paidOnly": false, "title": "Largest Sum of Averages", "titleSlug": "largest-sum-of-averages", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 54846, "totalSubmissionRaw": 102317}, "814": {"acRate": 72.26606407914188, "difficulty": "Medium", "likes": 4530, "dislikes": 115, "categoryTitle": "Algorithms", "frontendQuestionId": "814", "paidOnly": false, "title": "Binary Tree Pruning", "titleSlug": "binary-tree-pruning", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 248807, "totalSubmissionRaw": 344293}, "815": {"acRate": 47.587157859825034, "difficulty": "Hard", "likes": 4259, "dislikes": 123, "categoryTitle": "Algorithms", "frontendQuestionId": "815", "paidOnly": false, "title": "Bus Routes", "titleSlug": "bus-routes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 209482, "totalSubmissionRaw": 440206}, "816": {"acRate": 56.87719167350593, "difficulty": "Medium", "likes": 322, "dislikes": 661, "categoryTitle": "Algorithms", "frontendQuestionId": "816", "paidOnly": false, "title": "Ambiguous Coordinates", "titleSlug": "ambiguous-coordinates", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30493, "totalSubmissionRaw": 53612}, "817": {"acRate": 56.90580884054617, "difficulty": "Medium", "likes": 1101, "dislikes": 2231, "categoryTitle": "Algorithms", "frontendQuestionId": "817", "paidOnly": false, "title": "Linked List Components", "titleSlug": "linked-list-components", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 98356, "totalSubmissionRaw": 172840}, "818": {"acRate": 43.80684806107941, "difficulty": "Hard", "likes": 1909, "dislikes": 180, "categoryTitle": "Algorithms", "frontendQuestionId": "818", "paidOnly": false, "title": "Race Car", "titleSlug": "race-car", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 89967, "totalSubmissionRaw": 205372}, "819": {"acRate": 44.32836199983793, "difficulty": "Easy", "likes": 1709, "dislikes": 3059, "categoryTitle": "Algorithms", "frontendQuestionId": "819", "paidOnly": false, "title": "Most Common Word", "titleSlug": "most-common-word", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 366510, "totalSubmissionRaw": 826807}, "820": {"acRate": 60.471454468698006, "difficulty": "Medium", "likes": 1752, "dislikes": 653, "categoryTitle": "Algorithms", "frontendQuestionId": "820", "paidOnly": false, "title": "Short Encoding of Words", "titleSlug": "short-encoding-of-words", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 97405, "totalSubmissionRaw": 161076}, "821": {"acRate": 71.73007164912913, "difficulty": "Easy", "likes": 3143, "dislikes": 179, "categoryTitle": "Algorithms", "frontendQuestionId": "821", "paidOnly": false, "title": "Shortest Distance to a Character", "titleSlug": "shortest-distance-to-a-character", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 191416, "totalSubmissionRaw": 266856}, "822": {"acRate": 47.93247116056162, "difficulty": "Medium", "likes": 174, "dislikes": 756, "categoryTitle": "Algorithms", "frontendQuestionId": "822", "paidOnly": false, "title": "Card Flipping Game", "titleSlug": "card-flipping-game", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19903, "totalSubmissionRaw": 41523}, "823": {"acRate": 52.90341847310543, "difficulty": "Medium", "likes": 3301, "dislikes": 256, "categoryTitle": "Algorithms", "frontendQuestionId": "823", "paidOnly": false, "title": "Binary Trees With Factors", "titleSlug": "binary-trees-with-factors", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 150579, "totalSubmissionRaw": 284630}, "824": {"acRate": 68.44131476456386, "difficulty": "Easy", "likes": 911, "dislikes": 1242, "categoryTitle": "Algorithms", "frontendQuestionId": "824", "paidOnly": false, "title": "Goat Latin", "titleSlug": "goat-latin", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 183112, "totalSubmissionRaw": 267546}, "825": {"acRate": 47.893374767831325, "difficulty": "Medium", "likes": 765, "dislikes": 1216, "categoryTitle": "Algorithms", "frontendQuestionId": "825", "paidOnly": false, "title": "Friends Of Appropriate Ages", "titleSlug": "friends-of-appropriate-ages", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 93085, "totalSubmissionRaw": 194361}, "826": {"acRate": 55.914079279298576, "difficulty": "Medium", "likes": 2364, "dislikes": 169, "categoryTitle": "Algorithms", "frontendQuestionId": "826", "paidOnly": false, "title": "Most Profit Assigning Work", "titleSlug": "most-profit-assigning-work", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 208789, "totalSubmissionRaw": 373412}, "827": {"acRate": 48.21397999979859, "difficulty": "Hard", "likes": 3935, "dislikes": 77, "categoryTitle": "Algorithms", "frontendQuestionId": "827", "paidOnly": false, "title": "Making A Large Island", "titleSlug": "making-a-large-island", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 191504, "totalSubmissionRaw": 397195}, "828": {"acRate": 52.54763625435578, "difficulty": "Hard", "likes": 2155, "dislikes": 250, "categoryTitle": "Algorithms", "frontendQuestionId": "828", "paidOnly": false, "title": "Count Unique Characters of All Substrings of a Given String", "titleSlug": "count-unique-characters-of-all-substrings-of-a-given-string", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 73439, "totalSubmissionRaw": 139757}, "829": {"acRate": 41.88443608057825, "difficulty": "Hard", "likes": 1373, "dislikes": 1380, "categoryTitle": "Algorithms", "frontendQuestionId": "829", "paidOnly": false, "title": "Consecutive Numbers Sum", "titleSlug": "consecutive-numbers-sum", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 88135, "totalSubmissionRaw": 210427}, "830": {"acRate": 52.42780120642716, "difficulty": "Easy", "likes": 879, "dislikes": 124, "categoryTitle": "Algorithms", "frontendQuestionId": "830", "paidOnly": false, "title": "Positions of Large Groups", "titleSlug": "positions-of-large-groups", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 98213, "totalSubmissionRaw": 187330}, "831": {"acRate": 49.252092433078744, "difficulty": "Medium", "likes": 168, "dislikes": 449, "categoryTitle": "Algorithms", "frontendQuestionId": "831", "paidOnly": false, "title": "Masking Personal Information", "titleSlug": "masking-personal-information", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20184, "totalSubmissionRaw": 40981}, "832": {"acRate": 82.26279518515115, "difficulty": "Easy", "likes": 3454, "dislikes": 243, "categoryTitle": "Algorithms", "frontendQuestionId": "832", "paidOnly": false, "title": "Flipping an Image", "titleSlug": "flipping-an-image", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 447633, "totalSubmissionRaw": 544150}, "833": {"acRate": 52.276257037468454, "difficulty": "Medium", "likes": 1190, "dislikes": 1018, "categoryTitle": "Algorithms", "frontendQuestionId": "833", "paidOnly": false, "title": "Find And Replace in String", "titleSlug": "find-and-replace-in-string", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 150794, "totalSubmissionRaw": 288456}, "834": {"acRate": 65.27408392434988, "difficulty": "Hard", "likes": 5584, "dislikes": 137, "categoryTitle": "Algorithms", "frontendQuestionId": "834", "paidOnly": false, "title": "Sum of Distances in Tree", "titleSlug": "sum-of-distances-in-tree", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 159038, "totalSubmissionRaw": 243647}, "835": {"acRate": 63.698841802595865, "difficulty": "Medium", "likes": 1331, "dislikes": 481, "categoryTitle": "Algorithms", "frontendQuestionId": "835", "paidOnly": false, "title": "Image Overlap", "titleSlug": "image-overlap", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 94817, "totalSubmissionRaw": 148852}, "836": {"acRate": 45.009315863455626, "difficulty": "Easy", "likes": 1994, "dislikes": 472, "categoryTitle": "Algorithms", "frontendQuestionId": "836", "paidOnly": false, "title": "Rectangle Overlap", "titleSlug": "rectangle-overlap", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 149534, "totalSubmissionRaw": 332229}, "837": {"acRate": 44.97380093372423, "difficulty": "Medium", "likes": 1983, "dislikes": 1833, "categoryTitle": "Algorithms", "frontendQuestionId": "837", "paidOnly": false, "title": "New 21 Game", "titleSlug": "new-21-game", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Probability and Statistics", "id": "VG9waWNUYWdOb2RlOjYxMDc5", "slug": "probability-and-statistics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 77162, "totalSubmissionRaw": 171571}, "838": {"acRate": 57.22372273542295, "difficulty": "Medium", "likes": 3385, "dislikes": 229, "categoryTitle": "Algorithms", "frontendQuestionId": "838", "paidOnly": false, "title": "Push Dominoes", "titleSlug": "push-dominoes", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 126061, "totalSubmissionRaw": 220295}, "839": {"acRate": 55.07011987728458, "difficulty": "Hard", "likes": 2341, "dislikes": 215, "categoryTitle": "Algorithms", "frontendQuestionId": "839", "paidOnly": false, "title": "Similar String Groups", "titleSlug": "similar-string-groups", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 122242, "totalSubmissionRaw": 221975}, "840": {"acRate": 51.73117579499484, "difficulty": "Medium", "likes": 803, "dislikes": 1823, "categoryTitle": "Algorithms", "frontendQuestionId": "840", "paidOnly": false, "title": "Magic Squares In Grid", "titleSlug": "magic-squares-in-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 141432, "totalSubmissionRaw": 273398}, "841": {"acRate": 73.47343372096101, "difficulty": "Medium", "likes": 6144, "dislikes": 279, "categoryTitle": "Algorithms", "frontendQuestionId": "841", "paidOnly": false, "title": "Keys and Rooms", "titleSlug": "keys-and-rooms", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 471781, "totalSubmissionRaw": 642111}, "842": {"acRate": 39.11466314911447, "difficulty": "Medium", "likes": 1133, "dislikes": 306, "categoryTitle": "Algorithms", "frontendQuestionId": "842", "paidOnly": false, "title": "Split Array into Fibonacci Sequence", "titleSlug": "split-array-into-fibonacci-sequence", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 40328, "totalSubmissionRaw": 103102}, "843": {"acRate": 38.82293053073648, "difficulty": "Hard", "likes": 1544, "dislikes": 1786, "categoryTitle": "Algorithms", "frontendQuestionId": "843", "paidOnly": false, "title": "Guess the Word", "titleSlug": "guess-the-word", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 146430, "totalSubmissionRaw": 377174}, "844": {"acRate": 49.24720380455431, "difficulty": "Easy", "likes": 7535, "dislikes": 353, "categoryTitle": "Algorithms", "frontendQuestionId": "844", "paidOnly": false, "title": "Backspace String Compare", "titleSlug": "backspace-string-compare", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 849041, "totalSubmissionRaw": 1724039}, "845": {"acRate": 40.54931731360925, "difficulty": "Medium", "likes": 2781, "dislikes": 80, "categoryTitle": "Algorithms", "frontendQuestionId": "845", "paidOnly": false, "title": "Longest Mountain in Array", "titleSlug": "longest-mountain-in-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 133106, "totalSubmissionRaw": 328260}, "846": {"acRate": 56.7327349000857, "difficulty": "Medium", "likes": 3273, "dislikes": 258, "categoryTitle": "Algorithms", "frontendQuestionId": "846", "paidOnly": false, "title": "Hand of Straights", "titleSlug": "hand-of-straights", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 314427, "totalSubmissionRaw": 554225}, "847": {"acRate": 65.39984288263541, "difficulty": "Hard", "likes": 4317, "dislikes": 169, "categoryTitle": "Algorithms", "frontendQuestionId": "847", "paidOnly": false, "title": "Shortest Path Visiting All Nodes", "titleSlug": "shortest-path-visiting-all-nodes", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 125707, "totalSubmissionRaw": 192213}, "848": {"acRate": 44.80335825556289, "difficulty": "Medium", "likes": 1374, "dislikes": 126, "categoryTitle": "Algorithms", "frontendQuestionId": "848", "paidOnly": false, "title": "Shifting Letters", "titleSlug": "shifting-letters", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 100433, "totalSubmissionRaw": 224164}, "849": {"acRate": 48.2622148515449, "difficulty": "Medium", "likes": 3223, "dislikes": 196, "categoryTitle": "Algorithms", "frontendQuestionId": "849", "paidOnly": false, "title": "Maximize Distance to Closest Person", "titleSlug": "maximize-distance-to-closest-person", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 231940, "totalSubmissionRaw": 480583}, "850": {"acRate": 54.27871372262552, "difficulty": "Hard", "likes": 968, "dislikes": 62, "categoryTitle": "Algorithms", "frontendQuestionId": "850", "paidOnly": false, "title": "Rectangle Area II", "titleSlug": "rectangle-area-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Line Sweep", "id": "VG9waWNUYWdOb2RlOjU2MTE5", "slug": "line-sweep"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 35666, "totalSubmissionRaw": 65709}, "851": {"acRate": 60.037573159276484, "difficulty": "Medium", "likes": 1309, "dislikes": 813, "categoryTitle": "Algorithms", "frontendQuestionId": "851", "paidOnly": false, "title": "Loud and Rich", "titleSlug": "loud-and-rich", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 49854, "totalSubmissionRaw": 83038}, "852": {"acRate": 68.25975211107618, "difficulty": "Medium", "likes": 7561, "dislikes": 1922, "categoryTitle": "Algorithms", "frontendQuestionId": "852", "paidOnly": false, "title": "Peak Index in a Mountain Array", "titleSlug": "peak-index-in-a-mountain-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 855721, "totalSubmissionRaw": 1253624}, "853": {"acRate": 51.671301360296184, "difficulty": "Medium", "likes": 3585, "dislikes": 991, "categoryTitle": "Algorithms", "frontendQuestionId": "853", "paidOnly": false, "title": "Car Fleet", "titleSlug": "car-fleet", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 284851, "totalSubmissionRaw": 551276}, "854": {"acRate": 39.99660902000678, "difficulty": "Hard", "likes": 1135, "dislikes": 61, "categoryTitle": "Algorithms", "frontendQuestionId": "854", "paidOnly": false, "title": "K-Similar Strings", "titleSlug": "k-similar-strings", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 47180, "totalSubmissionRaw": 117960}, "855": {"acRate": 43.55269346761475, "difficulty": "Medium", "likes": 1334, "dislikes": 486, "categoryTitle": "Algorithms", "frontendQuestionId": "855", "paidOnly": false, "title": "Exam Room", "titleSlug": "exam-room", "topicTags": [{"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 62965, "totalSubmissionRaw": 144572}, "856": {"acRate": 64.04130961408123, "difficulty": "Medium", "likes": 5426, "dislikes": 209, "categoryTitle": "Algorithms", "frontendQuestionId": "856", "paidOnly": false, "title": "Score of Parentheses", "titleSlug": "score-of-parentheses", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 190870, "totalSubmissionRaw": 298042}, "857": {"acRate": 63.46204939995046, "difficulty": "Hard", "likes": 2908, "dislikes": 395, "categoryTitle": "Algorithms", "frontendQuestionId": "857", "paidOnly": false, "title": "Minimum Cost to Hire K Workers", "titleSlug": "minimum-cost-to-hire-k-workers", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 140927, "totalSubmissionRaw": 222065}, "858": {"acRate": 62.502127001314875, "difficulty": "Medium", "likes": 1109, "dislikes": 2548, "categoryTitle": "Algorithms", "frontendQuestionId": "858", "paidOnly": false, "title": "Mirror Reflection", "titleSlug": "mirror-reflection", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 80809, "totalSubmissionRaw": 129290}, "859": {"acRate": 33.16635644609895, "difficulty": "Easy", "likes": 3187, "dislikes": 1799, "categoryTitle": "Algorithms", "frontendQuestionId": "859", "paidOnly": false, "title": "Buddy Strings", "titleSlug": "buddy-strings", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 248749, "totalSubmissionRaw": 750004}, "860": {"acRate": 58.277556588570924, "difficulty": "Easy", "likes": 2839, "dislikes": 188, "categoryTitle": "Algorithms", "frontendQuestionId": "860", "paidOnly": false, "title": "Lemonade Change", "titleSlug": "lemonade-change", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 351116, "totalSubmissionRaw": 602492}, "861": {"acRate": 80.40110234931376, "difficulty": "Medium", "likes": 2294, "dislikes": 214, "categoryTitle": "Algorithms", "frontendQuestionId": "861", "paidOnly": false, "title": "Score After Flipping Matrix", "titleSlug": "score-after-flipping-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 147331, "totalSubmissionRaw": 183245}, "862": {"acRate": 26.098510205588067, "difficulty": "Hard", "likes": 4279, "dislikes": 118, "categoryTitle": "Algorithms", "frontendQuestionId": "862", "paidOnly": false, "title": "Shortest Subarray with Sum at Least K", "titleSlug": "shortest-subarray-with-sum-at-least-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}, {"name": "Monotonic Queue", "id": "VG9waWNUYWdOb2RlOjYxMDcx", "slug": "monotonic-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 102534, "totalSubmissionRaw": 392873}, "863": {"acRate": 64.86942140462631, "difficulty": "Medium", "likes": 11015, "dislikes": 234, "categoryTitle": "Algorithms", "frontendQuestionId": "863", "paidOnly": false, "title": "All Nodes Distance K in Binary Tree", "titleSlug": "all-nodes-distance-k-in-binary-tree", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 465187, "totalSubmissionRaw": 717114}, "864": {"acRate": 53.53603386895025, "difficulty": "Hard", "likes": 2333, "dislikes": 102, "categoryTitle": "Algorithms", "frontendQuestionId": "864", "paidOnly": false, "title": "Shortest Path to Get All Keys", "titleSlug": "shortest-path-to-get-all-keys", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 77896, "totalSubmissionRaw": 145502}, "865": {"acRate": 70.9301688908357, "difficulty": "Medium", "likes": 2646, "dislikes": 374, "categoryTitle": "Algorithms", "frontendQuestionId": "865", "paidOnly": false, "title": "Smallest Subtree with all the Deepest Nodes", "titleSlug": "smallest-subtree-with-all-the-deepest-nodes", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 142498, "totalSubmissionRaw": 200899}, "866": {"acRate": 26.11893619105755, "difficulty": "Medium", "likes": 439, "dislikes": 829, "categoryTitle": "Algorithms", "frontendQuestionId": "866", "paidOnly": false, "title": "Prime Palindrome", "titleSlug": "prime-palindrome", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34658, "totalSubmissionRaw": 132693}, "867": {"acRate": 72.25944412227653, "difficulty": "Easy", "likes": 3763, "dislikes": 443, "categoryTitle": "Algorithms", "frontendQuestionId": "867", "paidOnly": false, "title": "Transpose Matrix", "titleSlug": "transpose-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 418677, "totalSubmissionRaw": 579408}, "868": {"acRate": 63.76424769179875, "difficulty": "Easy", "likes": 638, "dislikes": 662, "categoryTitle": "Algorithms", "frontendQuestionId": "868", "paidOnly": false, "title": "Binary Gap", "titleSlug": "binary-gap", "topicTags": [{"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 84809, "totalSubmissionRaw": 133004}, "869": {"acRate": 62.58910999343975, "difficulty": "Medium", "likes": 2117, "dislikes": 436, "categoryTitle": "Algorithms", "frontendQuestionId": "869", "paidOnly": false, "title": "Reordered Power of 2", "titleSlug": "reordered-power-of-2", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 114488, "totalSubmissionRaw": 182920}, "870": {"acRate": 52.706447724987136, "difficulty": "Medium", "likes": 1615, "dislikes": 99, "categoryTitle": "Algorithms", "frontendQuestionId": "870", "paidOnly": false, "title": "Advantage Shuffle", "titleSlug": "advantage-shuffle", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 68657, "totalSubmissionRaw": 130263}, "871": {"acRate": 40.10217700156423, "difficulty": "Hard", "likes": 4669, "dislikes": 89, "categoryTitle": "Algorithms", "frontendQuestionId": "871", "paidOnly": false, "title": "Minimum Number of Refueling Stops", "titleSlug": "minimum-number-of-refueling-stops", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 139722, "totalSubmissionRaw": 348415}, "872": {"acRate": 70.05618423195166, "difficulty": "Easy", "likes": 4128, "dislikes": 114, "categoryTitle": "Algorithms", "frontendQuestionId": "872", "paidOnly": false, "title": "Leaf-Similar Trees", "titleSlug": "leaf-similar-trees", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 503373, "totalSubmissionRaw": 718527}, "873": {"acRate": 48.43960103435537, "difficulty": "Medium", "likes": 2024, "dislikes": 73, "categoryTitle": "Algorithms", "frontendQuestionId": "873", "paidOnly": false, "title": "Length of Longest Fibonacci Subsequence", "titleSlug": "length-of-longest-fibonacci-subsequence", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 65563, "totalSubmissionRaw": 135350}, "874": {"acRate": 40.54607248598167, "difficulty": "Medium", "likes": 205, "dislikes": 50, "categoryTitle": "Algorithms", "frontendQuestionId": "874", "paidOnly": false, "title": "Walking Robot Simulation", "titleSlug": "walking-robot-simulation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 42590, "totalSubmissionRaw": 105041}, "875": {"acRate": 48.412024149524605, "difficulty": "Medium", "likes": 10773, "dislikes": 685, "categoryTitle": "Algorithms", "frontendQuestionId": "875", "paidOnly": false, "title": "Koko Eating Bananas", "titleSlug": "koko-eating-bananas", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 749901, "totalSubmissionRaw": 1549001}, "876": {"acRate": 79.11542403279529, "difficulty": "Easy", "likes": 11718, "dislikes": 378, "categoryTitle": "Algorithms", "frontendQuestionId": "876", "paidOnly": false, "title": "Middle of the Linked List", "titleSlug": "middle-of-the-linked-list", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 2050349, "totalSubmissionRaw": 2591592}, "877": {"acRate": 70.78899964668199, "difficulty": "Medium", "likes": 3245, "dislikes": 2884, "categoryTitle": "Algorithms", "frontendQuestionId": "877", "paidOnly": false, "title": "Stone Game", "titleSlug": "stone-game", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 244433, "totalSubmissionRaw": 345298}, "878": {"acRate": 35.550452591386076, "difficulty": "Hard", "likes": 1278, "dislikes": 160, "categoryTitle": "Algorithms", "frontendQuestionId": "878", "paidOnly": false, "title": "Nth Magical Number", "titleSlug": "nth-magical-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 39942, "totalSubmissionRaw": 112353}, "879": {"acRate": 48.22783300791439, "difficulty": "Hard", "likes": 1838, "dislikes": 122, "categoryTitle": "Algorithms", "frontendQuestionId": "879", "paidOnly": false, "title": "Profitable Schemes", "titleSlug": "profitable-schemes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 64715, "totalSubmissionRaw": 134186}, "880": {"acRate": 36.497934919344964, "difficulty": "Medium", "likes": 2515, "dislikes": 359, "categoryTitle": "Algorithms", "frontendQuestionId": "880", "paidOnly": false, "title": "Decoded String at Index", "titleSlug": "decoded-string-at-index", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 98355, "totalSubmissionRaw": 269481}, "881": {"acRate": 59.53546956450098, "difficulty": "Medium", "likes": 6430, "dislikes": 161, "categoryTitle": "Algorithms", "frontendQuestionId": "881", "paidOnly": false, "title": "Boats to Save People", "titleSlug": "boats-to-save-people", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 426346, "totalSubmissionRaw": 716121}, "882": {"acRate": 50.53280199427699, "difficulty": "Hard", "likes": 815, "dislikes": 224, "categoryTitle": "Algorithms", "frontendQuestionId": "882", "paidOnly": false, "title": "Reachable Nodes In Subdivided Graph", "titleSlug": "reachable-nodes-in-subdivided-graph", "topicTags": [{"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 28785, "totalSubmissionRaw": 56963}, "883": {"acRate": 73.0660686388147, "difficulty": "Easy", "likes": 588, "dislikes": 1413, "categoryTitle": "Algorithms", "frontendQuestionId": "883", "paidOnly": false, "title": "Projection Area of 3D Shapes", "titleSlug": "projection-area-of-3d-shapes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 57994, "totalSubmissionRaw": 79372}, "884": {"acRate": 67.70665733939606, "difficulty": "Easy", "likes": 1339, "dislikes": 169, "categoryTitle": "Algorithms", "frontendQuestionId": "884", "paidOnly": false, "title": "Uncommon Words from Two Sentences", "titleSlug": "uncommon-words-from-two-sentences", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 145180, "totalSubmissionRaw": 214425}, "885": {"acRate": 84.56403095427513, "difficulty": "Medium", "likes": 1468, "dislikes": 1008, "categoryTitle": "Algorithms", "frontendQuestionId": "885", "paidOnly": false, "title": "Spiral Matrix III", "titleSlug": "spiral-matrix-iii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 152002, "totalSubmissionRaw": 179748}, "886": {"acRate": 50.72697517784168, "difficulty": "Medium", "likes": 4674, "dislikes": 111, "categoryTitle": "Algorithms", "frontendQuestionId": "886", "paidOnly": false, "title": "Possible Bipartition", "titleSlug": "possible-bipartition", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 214498, "totalSubmissionRaw": 422848}, "887": {"acRate": 27.934809626450107, "difficulty": "Hard", "likes": 3626, "dislikes": 191, "categoryTitle": "Algorithms", "frontendQuestionId": "887", "paidOnly": false, "title": "Super Egg Drop", "titleSlug": "super-egg-drop", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 75298, "totalSubmissionRaw": 269549}, "888": {"acRate": 62.055570699793606, "difficulty": "Easy", "likes": 2111, "dislikes": 382, "categoryTitle": "Algorithms", "frontendQuestionId": "888", "paidOnly": false, "title": "Fair Candy Swap", "titleSlug": "fair-candy-swap", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 127482, "totalSubmissionRaw": 205432}, "889": {"acRate": 71.59544237390021, "difficulty": "Medium", "likes": 2740, "dislikes": 114, "categoryTitle": "Algorithms", "frontendQuestionId": "889", "paidOnly": false, "title": "Construct Binary Tree from Preorder and Postorder Traversal", "titleSlug": "construct-binary-tree-from-preorder-and-postorder-traversal", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 104810, "totalSubmissionRaw": 146392}, "890": {"acRate": 76.79587460678331, "difficulty": "Medium", "likes": 3919, "dislikes": 171, "categoryTitle": "Algorithms", "frontendQuestionId": "890", "paidOnly": false, "title": "Find and Replace Pattern", "titleSlug": "find-and-replace-pattern", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 190175, "totalSubmissionRaw": 247637}, "891": {"acRate": 38.0570847505172, "difficulty": "Hard", "likes": 713, "dislikes": 171, "categoryTitle": "Algorithms", "frontendQuestionId": "891", "paidOnly": false, "title": "Sum of Subsequence Widths", "titleSlug": "sum-of-subsequence-widths", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 21707, "totalSubmissionRaw": 57038}, "892": {"acRate": 66.4997687879706, "difficulty": "Easy", "likes": 572, "dislikes": 747, "categoryTitle": "Algorithms", "frontendQuestionId": "892", "paidOnly": false, "title": "Surface Area of 3D Shapes", "titleSlug": "surface-area-of-3d-shapes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 41704, "totalSubmissionRaw": 62713}, "893": {"acRate": 71.98658652684826, "difficulty": "Medium", "likes": 535, "dislikes": 1481, "categoryTitle": "Algorithms", "frontendQuestionId": "893", "paidOnly": false, "title": "Groups of Special-Equivalent Strings", "titleSlug": "groups-of-special-equivalent-strings", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 50662, "totalSubmissionRaw": 70375}, "894": {"acRate": 82.77070302011207, "difficulty": "Medium", "likes": 5073, "dislikes": 353, "categoryTitle": "Algorithms", "frontendQuestionId": "894", "paidOnly": false, "title": "All Possible Full Binary Trees", "titleSlug": "all-possible-full-binary-trees", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 188036, "totalSubmissionRaw": 227177}, "895": {"acRate": 66.45964811805264, "difficulty": "Hard", "likes": 4697, "dislikes": 74, "categoryTitle": "Algorithms", "frontendQuestionId": "895", "paidOnly": false, "title": "Maximum Frequency Stack", "titleSlug": "maximum-frequency-stack", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 178708, "totalSubmissionRaw": 268897}, "896": {"acRate": 61.29866789611861, "difficulty": "Easy", "likes": 3055, "dislikes": 95, "categoryTitle": "Algorithms", "frontendQuestionId": "896", "paidOnly": false, "title": "Monotonic Array", "titleSlug": "monotonic-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 448062, "totalSubmissionRaw": 730949}, "897": {"acRate": 78.36846757056622, "difficulty": "Easy", "likes": 4330, "dislikes": 672, "categoryTitle": "Algorithms", "frontendQuestionId": "897", "paidOnly": false, "title": "Increasing Order Search Tree", "titleSlug": "increasing-order-search-tree", "topicTags": [{"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 291718, "totalSubmissionRaw": 372239}, "898": {"acRate": 39.320159592849734, "difficulty": "Medium", "likes": 1469, "dislikes": 206, "categoryTitle": "Algorithms", "frontendQuestionId": "898", "paidOnly": false, "title": "Bitwise ORs of Subarrays", "titleSlug": "bitwise-ors-of-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 37548, "totalSubmissionRaw": 95493}, "899": {"acRate": 65.97383882052988, "difficulty": "Hard", "likes": 1754, "dislikes": 613, "categoryTitle": "Algorithms", "frontendQuestionId": "899", "paidOnly": false, "title": "Orderly Queue", "titleSlug": "orderly-queue", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 71418, "totalSubmissionRaw": 108252}, "900": {"acRate": 59.6266303228158, "difficulty": "Medium", "likes": 748, "dislikes": 193, "categoryTitle": "Algorithms", "frontendQuestionId": "900", "paidOnly": false, "title": "RLE Iterator", "titleSlug": "rle-iterator", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}, {"name": "Iterator", "id": "VG9waWNUYWdOb2RlOjYxMDY0", "slug": "iterator"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 75250, "totalSubmissionRaw": 126202}, "901": {"acRate": 66.36715840816217, "difficulty": "Medium", "likes": 6370, "dislikes": 414, "categoryTitle": "Algorithms", "frontendQuestionId": "901", "paidOnly": false, "title": "Online Stock Span", "titleSlug": "online-stock-span", "topicTags": [{"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}, {"name": "Data Stream", "id": "VG9waWNUYWdOb2RlOjYxMDYz", "slug": "data-stream"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 343977, "totalSubmissionRaw": 518294}, "902": {"acRate": 42.60749532833144, "difficulty": "Hard", "likes": 1395, "dislikes": 97, "categoryTitle": "Algorithms", "frontendQuestionId": "902", "paidOnly": false, "title": "Numbers At Most N Given Digit Set", "titleSlug": "numbers-at-most-n-given-digit-set", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 45374, "totalSubmissionRaw": 106493}, "903": {"acRate": 57.3684938135066, "difficulty": "Hard", "likes": 723, "dislikes": 43, "categoryTitle": "Algorithms", "frontendQuestionId": "903", "paidOnly": false, "title": "Valid Permutations for DI Sequence", "titleSlug": "valid-permutations-for-di-sequence", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16599, "totalSubmissionRaw": 28934}, "904": {"acRate": 44.750393906605865, "difficulty": "Medium", "likes": 4688, "dislikes": 349, "categoryTitle": "Algorithms", "frontendQuestionId": "904", "paidOnly": false, "title": "Fruit Into Baskets", "titleSlug": "fruit-into-baskets", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 429716, "totalSubmissionRaw": 960252}, "905": {"acRate": 76.24731875228747, "difficulty": "Easy", "likes": 5380, "dislikes": 149, "categoryTitle": "Algorithms", "frontendQuestionId": "905", "paidOnly": false, "title": "Sort Array By Parity", "titleSlug": "sort-array-by-parity", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 822902, "totalSubmissionRaw": 1079254}, "906": {"acRate": 39.00116656682536, "difficulty": "Hard", "likes": 362, "dislikes": 420, "categoryTitle": "Algorithms", "frontendQuestionId": "906", "paidOnly": false, "title": "Super Palindromes", "titleSlug": "super-palindromes", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 24740, "totalSubmissionRaw": 63434}, "907": {"acRate": 37.2568957044221, "difficulty": "Medium", "likes": 8120, "dislikes": 631, "categoryTitle": "Algorithms", "frontendQuestionId": "907", "paidOnly": false, "title": "Sum of Subarray Minimums", "titleSlug": "sum-of-subarray-minimums", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 274440, "totalSubmissionRaw": 736617}, "908": {"acRate": 70.47391723390157, "difficulty": "Easy", "likes": 715, "dislikes": 2039, "categoryTitle": "Algorithms", "frontendQuestionId": "908", "paidOnly": false, "title": "Smallest Range I", "titleSlug": "smallest-range-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 93595, "totalSubmissionRaw": 132808}, "909": {"acRate": 43.85738765472291, "difficulty": "Medium", "likes": 2915, "dislikes": 1035, "categoryTitle": "Algorithms", "frontendQuestionId": "909", "paidOnly": false, "title": "Snakes and Ladders", "titleSlug": "snakes-and-ladders", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 199377, "totalSubmissionRaw": 454603}, "910": {"acRate": 36.45521974980627, "difficulty": "Medium", "likes": 1654, "dislikes": 460, "categoryTitle": "Algorithms", "frontendQuestionId": "910", "paidOnly": false, "title": "Smallest Range II", "titleSlug": "smallest-range-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 55981, "totalSubmissionRaw": 153561}, "911": {"acRate": 52.10075455326534, "difficulty": "Medium", "likes": 1014, "dislikes": 660, "categoryTitle": "Algorithms", "frontendQuestionId": "911", "paidOnly": false, "title": "Online Election", "titleSlug": "online-election", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 61246, "totalSubmissionRaw": 117553}, "912": {"acRate": 58.007439413976456, "difficulty": "Medium", "likes": 6477, "dislikes": 796, "categoryTitle": "Algorithms", "frontendQuestionId": "912", "paidOnly": false, "title": "Sort an Array", "titleSlug": "sort-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Merge Sort", "id": "VG9waWNUYWdOb2RlOjYxMDUx", "slug": "merge-sort"}, {"name": "Bucket Sort", "id": "VG9waWNUYWdOb2RlOjYxMDYw", "slug": "bucket-sort"}, {"name": "Radix Sort", "id": "VG9waWNUYWdOb2RlOjYxMDYx", "slug": "radix-sort"}, {"name": "Counting Sort", "id": "VG9waWNUYWdOb2RlOjYxMDcy", "slug": "counting-sort"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 777699, "totalSubmissionRaw": 1340690}, "913": {"acRate": 33.851692584629234, "difficulty": "Hard", "likes": 916, "dislikes": 162, "categoryTitle": "Algorithms", "frontendQuestionId": "913", "paidOnly": false, "title": "Cat and Mouse", "titleSlug": "cat-and-mouse", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 20310, "totalSubmissionRaw": 59997}, "914": {"acRate": 29.9194277162015, "difficulty": "Easy", "likes": 1819, "dislikes": 517, "categoryTitle": "Algorithms", "frontendQuestionId": "914", "paidOnly": false, "title": "X of a Kind in a Deck of Cards", "titleSlug": "x-of-a-kind-in-a-deck-of-cards", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 126143, "totalSubmissionRaw": 421609}, "915": {"acRate": 48.80866133061315, "difficulty": "Medium", "likes": 1661, "dislikes": 80, "categoryTitle": "Algorithms", "frontendQuestionId": "915", "paidOnly": false, "title": "Partition Array into Disjoint Intervals", "titleSlug": "partition-array-into-disjoint-intervals", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 84213, "totalSubmissionRaw": 172537}, "916": {"acRate": 51.90544541132142, "difficulty": "Medium", "likes": 2711, "dislikes": 232, "categoryTitle": "Algorithms", "frontendQuestionId": "916", "paidOnly": false, "title": "Word Subsets", "titleSlug": "word-subsets", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 115718, "totalSubmissionRaw": 222940}, "917": {"acRate": 65.25198938992042, "difficulty": "Easy", "likes": 2259, "dislikes": 78, "categoryTitle": "Algorithms", "frontendQuestionId": "917", "paidOnly": false, "title": "Reverse Only Letters", "titleSlug": "reverse-only-letters", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 229518, "totalSubmissionRaw": 351741}, "918": {"acRate": 45.481196148662036, "difficulty": "Medium", "likes": 6646, "dislikes": 304, "categoryTitle": "Algorithms", "frontendQuestionId": "918", "paidOnly": false, "title": "Maximum Sum Circular Subarray", "titleSlug": "maximum-sum-circular-subarray", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Monotonic Queue", "id": "VG9waWNUYWdOb2RlOjYxMDcx", "slug": "monotonic-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 277705, "totalSubmissionRaw": 610593}, "919": {"acRate": 65.87835486789302, "difficulty": "Medium", "likes": 1109, "dislikes": 113, "categoryTitle": "Algorithms", "frontendQuestionId": "919", "paidOnly": false, "title": "Complete Binary Tree Inserter", "titleSlug": "complete-binary-tree-inserter", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 56799, "totalSubmissionRaw": 86218}, "920": {"acRate": 60.39660637543467, "difficulty": "Hard", "likes": 2360, "dislikes": 197, "categoryTitle": "Algorithms", "frontendQuestionId": "920", "paidOnly": false, "title": "Number of Music Playlists", "titleSlug": "number-of-music-playlists", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 70690, "totalSubmissionRaw": 117043}, "921": {"acRate": 74.90469896944131, "difficulty": "Medium", "likes": 4101, "dislikes": 207, "categoryTitle": "Algorithms", "frontendQuestionId": "921", "paidOnly": false, "title": "Minimum Add to Make Parentheses Valid", "titleSlug": "minimum-add-to-make-parentheses-valid", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 372357, "totalSubmissionRaw": 497108}, "922": {"acRate": 70.82920552193484, "difficulty": "Easy", "likes": 2613, "dislikes": 97, "categoryTitle": "Algorithms", "frontendQuestionId": "922", "paidOnly": false, "title": "Sort Array By Parity II", "titleSlug": "sort-array-by-parity-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 263105, "totalSubmissionRaw": 371464}, "923": {"acRate": 45.507939677550986, "difficulty": "Medium", "likes": 2616, "dislikes": 317, "categoryTitle": "Algorithms", "frontendQuestionId": "923", "paidOnly": false, "title": "3Sum With Multiplicity", "titleSlug": "3sum-with-multiplicity", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 104833, "totalSubmissionRaw": 230362}, "924": {"acRate": 42.055470769614104, "difficulty": "Hard", "likes": 998, "dislikes": 595, "categoryTitle": "Algorithms", "frontendQuestionId": "924", "paidOnly": false, "title": "Minimize Malware Spread", "titleSlug": "minimize-malware-spread", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 54011, "totalSubmissionRaw": 128429}, "925": {"acRate": 32.302787760708064, "difficulty": "Easy", "likes": 2432, "dislikes": 379, "categoryTitle": "Algorithms", "frontendQuestionId": "925", "paidOnly": false, "title": "Long Pressed Name", "titleSlug": "long-pressed-name", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 147229, "totalSubmissionRaw": 455778}, "926": {"acRate": 61.50542954280205, "difficulty": "Medium", "likes": 4430, "dislikes": 178, "categoryTitle": "Algorithms", "frontendQuestionId": "926", "paidOnly": false, "title": "Flip String to Monotone Increasing", "titleSlug": "flip-string-to-monotone-increasing", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 193934, "totalSubmissionRaw": 315312}, "927": {"acRate": 40.00971970473113, "difficulty": "Hard", "likes": 833, "dislikes": 123, "categoryTitle": "Algorithms", "frontendQuestionId": "927", "paidOnly": false, "title": "Three Equal Parts", "titleSlug": "three-equal-parts", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 30461, "totalSubmissionRaw": 76134}, "928": {"acRate": 44.06044702510562, "difficulty": "Hard", "likes": 671, "dislikes": 89, "categoryTitle": "Algorithms", "frontendQuestionId": "928", "paidOnly": false, "title": "Minimize Malware Spread II", "titleSlug": "minimize-malware-spread-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23675, "totalSubmissionRaw": 53733}, "929": {"acRate": 67.26363806954946, "difficulty": "Easy", "likes": 2694, "dislikes": 342, "categoryTitle": "Algorithms", "frontendQuestionId": "929", "paidOnly": false, "title": "Unique Email Addresses", "titleSlug": "unique-email-addresses", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 498248, "totalSubmissionRaw": 740739}, "930": {"acRate": 63.50199003676288, "difficulty": "Medium", "likes": 3938, "dislikes": 133, "categoryTitle": "Algorithms", "frontendQuestionId": "930", "paidOnly": false, "title": "Binary Subarrays With Sum", "titleSlug": "binary-subarrays-with-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 267565, "totalSubmissionRaw": 421349}, "931": {"acRate": 63.088573444964034, "difficulty": "Medium", "likes": 6359, "dislikes": 163, "categoryTitle": "Algorithms", "frontendQuestionId": "931", "paidOnly": false, "title": "Minimum Falling Path Sum", "titleSlug": "minimum-falling-path-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 463954, "totalSubmissionRaw": 735399}, "932": {"acRate": 65.95958127362606, "difficulty": "Medium", "likes": 1069, "dislikes": 1518, "categoryTitle": "Algorithms", "frontendQuestionId": "932", "paidOnly": false, "title": "Beautiful Array", "titleSlug": "beautiful-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 45367, "totalSubmissionRaw": 68780}, "933": {"acRate": 75.96955466096034, "difficulty": "Easy", "likes": 560, "dislikes": 863, "categoryTitle": "Algorithms", "frontendQuestionId": "933", "paidOnly": false, "title": "Number of Recent Calls", "titleSlug": "number-of-recent-calls", "topicTags": [{"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Data Stream", "id": "VG9waWNUYWdOb2RlOjYxMDYz", "slug": "data-stream"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 290051, "totalSubmissionRaw": 381799}, "934": {"acRate": 57.87760772773517, "difficulty": "Medium", "likes": 5393, "dislikes": 208, "categoryTitle": "Algorithms", "frontendQuestionId": "934", "paidOnly": false, "title": "Shortest Bridge", "titleSlug": "shortest-bridge", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 211626, "totalSubmissionRaw": 365644}, "935": {"acRate": 60.4513152635608, "difficulty": "Medium", "likes": 3035, "dislikes": 444, "categoryTitle": "Algorithms", "frontendQuestionId": "935", "paidOnly": false, "title": "Knight Dialer", "titleSlug": "knight-dialer", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 178468, "totalSubmissionRaw": 295226}, "936": {"acRate": 62.53826030777704, "difficulty": "Hard", "likes": 1545, "dislikes": 219, "categoryTitle": "Algorithms", "frontendQuestionId": "936", "paidOnly": false, "title": "Stamping The Sequence", "titleSlug": "stamping-the-sequence", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 59048, "totalSubmissionRaw": 94419}, "937": {"acRate": 56.49076388316686, "difficulty": "Medium", "likes": 2101, "dislikes": 4386, "categoryTitle": "Algorithms", "frontendQuestionId": "937", "paidOnly": false, "title": "Reorder Data in Log Files", "titleSlug": "reorder-data-in-log-files", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 370213, "totalSubmissionRaw": 655352}, "938": {"acRate": 86.99034919523586, "difficulty": "Easy", "likes": 6957, "dislikes": 378, "categoryTitle": "Algorithms", "frontendQuestionId": "938", "paidOnly": false, "title": "Range Sum of BST", "titleSlug": "range-sum-of-bst", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 1093370, "totalSubmissionRaw": 1256887}, "939": {"acRate": 54.13080108629305, "difficulty": "Medium", "likes": 1977, "dislikes": 284, "categoryTitle": "Algorithms", "frontendQuestionId": "939", "paidOnly": false, "title": "Minimum Area Rectangle", "titleSlug": "minimum-area-rectangle", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 148097, "totalSubmissionRaw": 273591}, "940": {"acRate": 43.188741896379064, "difficulty": "Hard", "likes": 1724, "dislikes": 38, "categoryTitle": "Algorithms", "frontendQuestionId": "940", "paidOnly": false, "title": "Distinct Subsequences II", "titleSlug": "distinct-subsequences-ii", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 40971, "totalSubmissionRaw": 94865}, "941": {"acRate": 33.53762994974089, "difficulty": "Easy", "likes": 2942, "dislikes": 185, "categoryTitle": "Algorithms", "frontendQuestionId": "941", "paidOnly": false, "title": "Valid Mountain Array", "titleSlug": "valid-mountain-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 437545, "totalSubmissionRaw": 1304639}, "942": {"acRate": 79.07219512195121, "difficulty": "Easy", "likes": 2467, "dislikes": 1020, "categoryTitle": "Algorithms", "frontendQuestionId": "942", "paidOnly": false, "title": "DI String Match", "titleSlug": "di-string-match", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 162097, "totalSubmissionRaw": 204999}, "943": {"acRate": 44.13024469046878, "difficulty": "Hard", "likes": 1446, "dislikes": 148, "categoryTitle": "Algorithms", "frontendQuestionId": "943", "paidOnly": false, "title": "Find the Shortest Superstring", "titleSlug": "find-the-shortest-superstring", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 29776, "totalSubmissionRaw": 67473}, "944": {"acRate": 74.62806470052064, "difficulty": "Easy", "likes": 1708, "dislikes": 2880, "categoryTitle": "Algorithms", "frontendQuestionId": "944", "paidOnly": false, "title": "Delete Columns to Make Sorted", "titleSlug": "delete-columns-to-make-sorted", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 193224, "totalSubmissionRaw": 258916}, "945": {"acRate": 60.040023171309706, "difficulty": "Medium", "likes": 2650, "dislikes": 82, "categoryTitle": "Algorithms", "frontendQuestionId": "945", "paidOnly": false, "title": "Minimum Increment to Make Array Unique", "titleSlug": "minimum-increment-to-make-array-unique", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 239421, "totalSubmissionRaw": 398769}, "946": {"acRate": 69.53907593567718, "difficulty": "Medium", "likes": 5910, "dislikes": 122, "categoryTitle": "Algorithms", "frontendQuestionId": "946", "paidOnly": false, "title": "Validate Stack Sequences", "titleSlug": "validate-stack-sequences", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 313777, "totalSubmissionRaw": 451224}, "947": {"acRate": 58.97263799058751, "difficulty": "Medium", "likes": 5404, "dislikes": 649, "categoryTitle": "Algorithms", "frontendQuestionId": "947", "paidOnly": false, "title": "Most Stones Removed with Same Row or Column", "titleSlug": "most-stones-removed-with-same-row-or-column", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 222295, "totalSubmissionRaw": 376946}, "948": {"acRate": 58.990360210423695, "difficulty": "Medium", "likes": 3260, "dislikes": 534, "categoryTitle": "Algorithms", "frontendQuestionId": "948", "paidOnly": false, "title": "Bag of Tokens", "titleSlug": "bag-of-tokens", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 233580, "totalSubmissionRaw": 395962}, "949": {"acRate": 35.351125865936986, "difficulty": "Medium", "likes": 713, "dislikes": 1059, "categoryTitle": "Algorithms", "frontendQuestionId": "949", "paidOnly": false, "title": "Largest Time for Given Digits", "titleSlug": "largest-time-for-given-digits", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 89660, "totalSubmissionRaw": 253627}, "950": {"acRate": 83.0347385501871, "difficulty": "Medium", "likes": 3472, "dislikes": 659, "categoryTitle": "Algorithms", "frontendQuestionId": "950", "paidOnly": false, "title": "Reveal Cards In Increasing Order", "titleSlug": "reveal-cards-in-increasing-order", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 200592, "totalSubmissionRaw": 241576}, "951": {"acRate": 67.06035578709671, "difficulty": "Medium", "likes": 2306, "dislikes": 96, "categoryTitle": "Algorithms", "frontendQuestionId": "951", "paidOnly": false, "title": "Flip Equivalent Binary Trees", "titleSlug": "flip-equivalent-binary-trees", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 150863, "totalSubmissionRaw": 224966}, "952": {"acRate": 40.87576010492428, "difficulty": "Hard", "likes": 1632, "dislikes": 94, "categoryTitle": "Algorithms", "frontendQuestionId": "952", "paidOnly": false, "title": "Largest Component Size by Common Factor", "titleSlug": "largest-component-size-by-common-factor", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 54852, "totalSubmissionRaw": 134192}, "953": {"acRate": 55.15637846899659, "difficulty": "Easy", "likes": 4888, "dislikes": 1633, "categoryTitle": "Algorithms", "frontendQuestionId": "953", "paidOnly": false, "title": "Verifying an Alien Dictionary", "titleSlug": "verifying-an-alien-dictionary", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 516545, "totalSubmissionRaw": 936510}, "954": {"acRate": 39.18995608406017, "difficulty": "Medium", "likes": 1527, "dislikes": 160, "categoryTitle": "Algorithms", "frontendQuestionId": "954", "paidOnly": false, "title": "Array of Doubled Pairs", "titleSlug": "array-of-doubled-pairs", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 89774, "totalSubmissionRaw": 229074}, "955": {"acRate": 35.365294087656984, "difficulty": "Medium", "likes": 663, "dislikes": 87, "categoryTitle": "Algorithms", "frontendQuestionId": "955", "paidOnly": false, "title": "Delete Columns to Make Sorted II", "titleSlug": "delete-columns-to-make-sorted-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20810, "totalSubmissionRaw": 58842}, "956": {"acRate": 52.156189286705526, "difficulty": "Hard", "likes": 2369, "dislikes": 57, "categoryTitle": "Algorithms", "frontendQuestionId": "956", "paidOnly": false, "title": "Tallest Billboard", "titleSlug": "tallest-billboard", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 60134, "totalSubmissionRaw": 115296}, "957": {"acRate": 38.999663186258, "difficulty": "Medium", "likes": 1491, "dislikes": 1751, "categoryTitle": "Algorithms", "frontendQuestionId": "957", "paidOnly": false, "title": "Prison Cells After N Days", "titleSlug": "prison-cells-after-n-days", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 162106, "totalSubmissionRaw": 415660}, "958": {"acRate": 57.16951598422495, "difficulty": "Medium", "likes": 4290, "dislikes": 60, "categoryTitle": "Algorithms", "frontendQuestionId": "958", "paidOnly": false, "title": "Check Completeness of a Binary Tree", "titleSlug": "check-completeness-of-a-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 243246, "totalSubmissionRaw": 425482}, "959": {"acRate": 77.96691455096627, "difficulty": "Medium", "likes": 3809, "dislikes": 800, "categoryTitle": "Algorithms", "frontendQuestionId": "959", "paidOnly": false, "title": "Regions Cut By Slashes", "titleSlug": "regions-cut-by-slashes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 131683, "totalSubmissionRaw": 168896}, "960": {"acRate": 58.33301191807768, "difficulty": "Hard", "likes": 602, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "960", "paidOnly": false, "title": "Delete Columns to Make Sorted III", "titleSlug": "delete-columns-to-make-sorted-iii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 15124, "totalSubmissionRaw": 25927}, "961": {"acRate": 76.92831747922911, "difficulty": "Easy", "likes": 1349, "dislikes": 329, "categoryTitle": "Algorithms", "frontendQuestionId": "961", "paidOnly": false, "title": "N-Repeated Element in Size 2N Array", "titleSlug": "n-repeated-element-in-size-2n-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 242775, "totalSubmissionRaw": 315586}, "962": {"acRate": 50.45372976059382, "difficulty": "Medium", "likes": 1687, "dislikes": 51, "categoryTitle": "Algorithms", "frontendQuestionId": "962", "paidOnly": false, "title": "Maximum Width Ramp", "titleSlug": "maximum-width-ramp", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 49481, "totalSubmissionRaw": 98073}, "963": {"acRate": 55.21945764607212, "difficulty": "Medium", "likes": 382, "dislikes": 461, "categoryTitle": "Algorithms", "frontendQuestionId": "963", "paidOnly": false, "title": "Minimum Area Rectangle II", "titleSlug": "minimum-area-rectangle-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29628, "totalSubmissionRaw": 53655}, "964": {"acRate": 48.645167445854405, "difficulty": "Hard", "likes": 317, "dislikes": 71, "categoryTitle": "Algorithms", "frontendQuestionId": "964", "paidOnly": false, "title": "Least Operators to Express Number", "titleSlug": "least-operators-to-express-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10197, "totalSubmissionRaw": 20962}, "965": {"acRate": 71.23113925477743, "difficulty": "Easy", "likes": 1899, "dislikes": 64, "categoryTitle": "Algorithms", "frontendQuestionId": "965", "paidOnly": false, "title": "Univalued Binary Tree", "titleSlug": "univalued-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 227451, "totalSubmissionRaw": 319314}, "966": {"acRate": 51.366445299695265, "difficulty": "Medium", "likes": 423, "dislikes": 811, "categoryTitle": "Algorithms", "frontendQuestionId": "966", "paidOnly": false, "title": "Vowel Spellchecker", "titleSlug": "vowel-spellchecker", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 42309, "totalSubmissionRaw": 82367}, "967": {"acRate": 58.198905635846245, "difficulty": "Medium", "likes": 2812, "dislikes": 196, "categoryTitle": "Algorithms", "frontendQuestionId": "967", "paidOnly": false, "title": "Numbers With Same Consecutive Differences", "titleSlug": "numbers-with-same-consecutive-differences", "topicTags": [{"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 135185, "totalSubmissionRaw": 232281}, "968": {"acRate": 46.755171767927614, "difficulty": "Hard", "likes": 5351, "dislikes": 77, "categoryTitle": "Algorithms", "frontendQuestionId": "968", "paidOnly": false, "title": "Binary Tree Cameras", "titleSlug": "binary-tree-cameras", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 144783, "totalSubmissionRaw": 309662}, "969": {"acRate": 70.90435190066187, "difficulty": "Medium", "likes": 1501, "dislikes": 1534, "categoryTitle": "Algorithms", "frontendQuestionId": "969", "paidOnly": false, "title": "Pancake Sorting", "titleSlug": "pancake-sorting", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 96844, "totalSubmissionRaw": 136584}, "970": {"acRate": 43.87764691141461, "difficulty": "Medium", "likes": 391, "dislikes": 84, "categoryTitle": "Algorithms", "frontendQuestionId": "970", "paidOnly": false, "title": "Powerful Integers", "titleSlug": "powerful-integers", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 56030, "totalSubmissionRaw": 127696}, "971": {"acRate": 50.68414179323975, "difficulty": "Medium", "likes": 953, "dislikes": 274, "categoryTitle": "Algorithms", "frontendQuestionId": "971", "paidOnly": false, "title": "Flip Binary Tree To Match Preorder Traversal", "titleSlug": "flip-binary-tree-to-match-preorder-traversal", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 43080, "totalSubmissionRaw": 84997}, "972": {"acRate": 44.185779157325975, "difficulty": "Hard", "likes": 95, "dislikes": 217, "categoryTitle": "Algorithms", "frontendQuestionId": "972", "paidOnly": false, "title": "Equal Rational Numbers", "titleSlug": "equal-rational-numbers", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 7687, "totalSubmissionRaw": 17397}, "973": {"acRate": 66.73852426861686, "difficulty": "Medium", "likes": 8421, "dislikes": 309, "categoryTitle": "Algorithms", "frontendQuestionId": "973", "paidOnly": false, "title": "K Closest Points to Origin", "titleSlug": "k-closest-points-to-origin", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Quickselect", "id": "VG9waWNUYWdOb2RlOjYxMDY5", "slug": "quickselect"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1260620, "totalSubmissionRaw": 1888902}, "974": {"acRate": 55.458592283015896, "difficulty": "Medium", "likes": 7224, "dislikes": 319, "categoryTitle": "Algorithms", "frontendQuestionId": "974", "paidOnly": false, "title": "Subarray Sums Divisible by K", "titleSlug": "subarray-sums-divisible-by-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 358552, "totalSubmissionRaw": 646522}, "975": {"acRate": 40.21137966724573, "difficulty": "Hard", "likes": 2003, "dislikes": 506, "categoryTitle": "Algorithms", "frontendQuestionId": "975", "paidOnly": false, "title": "Odd Even Jump", "titleSlug": "odd-even-jump", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 88192, "totalSubmissionRaw": 219321}, "976": {"acRate": 56.27633264597277, "difficulty": "Easy", "likes": 2977, "dislikes": 411, "categoryTitle": "Algorithms", "frontendQuestionId": "976", "paidOnly": false, "title": "Largest Perimeter Triangle", "titleSlug": "largest-perimeter-triangle", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 246437, "totalSubmissionRaw": 437906}, "977": {"acRate": 72.93706794371037, "difficulty": "Easy", "likes": 9347, "dislikes": 239, "categoryTitle": "Algorithms", "frontendQuestionId": "977", "paidOnly": false, "title": "Squares of a Sorted Array", "titleSlug": "squares-of-a-sorted-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 1925416, "totalSubmissionRaw": 2639825}, "978": {"acRate": 47.59069818171903, "difficulty": "Medium", "likes": 1978, "dislikes": 234, "categoryTitle": "Algorithms", "frontendQuestionId": "978", "paidOnly": false, "title": "Longest Turbulent Subarray", "titleSlug": "longest-turbulent-subarray", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 104720, "totalSubmissionRaw": 220043}, "979": {"acRate": 77.13998919002394, "difficulty": "Medium", "likes": 5819, "dislikes": 232, "categoryTitle": "Algorithms", "frontendQuestionId": "979", "paidOnly": false, "title": "Distribute Coins in Binary Tree", "titleSlug": "distribute-coins-in-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 199808, "totalSubmissionRaw": 259020}, "980": {"acRate": 81.91414580206936, "difficulty": "Hard", "likes": 5159, "dislikes": 190, "categoryTitle": "Algorithms", "frontendQuestionId": "980", "paidOnly": false, "title": "Unique Paths III", "titleSlug": "unique-paths-iii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 207422, "totalSubmissionRaw": 253219}, "981": {"acRate": 49.29460251627098, "difficulty": "Medium", "likes": 4799, "dislikes": 590, "categoryTitle": "Algorithms", "frontendQuestionId": "981", "paidOnly": false, "title": "Time Based Key-Value Store", "titleSlug": "time-based-key-value-store", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 472086, "totalSubmissionRaw": 957680}, "982": {"acRate": 58.343707207767956, "difficulty": "Hard", "likes": 440, "dislikes": 220, "categoryTitle": "Algorithms", "frontendQuestionId": "982", "paidOnly": false, "title": "Triples with Bitwise AND Equal To Zero", "titleSlug": "triples-with-bitwise-and-equal-to-zero", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18747, "totalSubmissionRaw": 32132}, "983": {"acRate": 65.23604598607223, "difficulty": "Medium", "likes": 7890, "dislikes": 149, "categoryTitle": "Algorithms", "frontendQuestionId": "983", "paidOnly": false, "title": "Minimum Cost For Tickets", "titleSlug": "minimum-cost-for-tickets", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 304544, "totalSubmissionRaw": 466835}, "984": {"acRate": 44.05490266439401, "difficulty": "Medium", "likes": 815, "dislikes": 369, "categoryTitle": "Algorithms", "frontendQuestionId": "984", "paidOnly": false, "title": "String Without AAA or BBB", "titleSlug": "string-without-aaa-or-bbb", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 49108, "totalSubmissionRaw": 111470}, "985": {"acRate": 68.22005814937908, "difficulty": "Medium", "likes": 2083, "dislikes": 320, "categoryTitle": "Algorithms", "frontendQuestionId": "985", "paidOnly": false, "title": "Sum of Even Numbers After Queries", "titleSlug": "sum-of-even-numbers-after-queries", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 141017, "totalSubmissionRaw": 206709}, "986": {"acRate": 71.83023578549803, "difficulty": "Medium", "likes": 5560, "dislikes": 113, "categoryTitle": "Algorithms", "frontendQuestionId": "986", "paidOnly": false, "title": "Interval List Intersections", "titleSlug": "interval-list-intersections", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 427535, "totalSubmissionRaw": 595202}, "987": {"acRate": 48.518906071712145, "difficulty": "Hard", "likes": 7649, "dislikes": 4332, "categoryTitle": "Algorithms", "frontendQuestionId": "987", "paidOnly": false, "title": "Vertical Order Traversal of a Binary Tree", "titleSlug": "vertical-order-traversal-of-a-binary-tree", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 461358, "totalSubmissionRaw": 950882}, "988": {"acRate": 60.56546543242861, "difficulty": "Medium", "likes": 2285, "dislikes": 329, "categoryTitle": "Algorithms", "frontendQuestionId": "988", "paidOnly": false, "title": "Smallest String Starting From Leaf", "titleSlug": "smallest-string-starting-from-leaf", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 192685, "totalSubmissionRaw": 318144}, "989": {"acRate": 45.14088711372714, "difficulty": "Easy", "likes": 3449, "dislikes": 292, "categoryTitle": "Algorithms", "frontendQuestionId": "989", "paidOnly": false, "title": "Add to Array-Form of Integer", "titleSlug": "add-to-array-form-of-integer", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 268419, "totalSubmissionRaw": 594625}, "990": {"acRate": 50.598573268983024, "difficulty": "Medium", "likes": 3747, "dislikes": 61, "categoryTitle": "Algorithms", "frontendQuestionId": "990", "paidOnly": false, "title": "Satisfiability of Equality Equations", "titleSlug": "satisfiability-of-equality-equations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 131574, "totalSubmissionRaw": 260035}, "991": {"acRate": 54.57060475884518, "difficulty": "Medium", "likes": 2700, "dislikes": 208, "categoryTitle": "Algorithms", "frontendQuestionId": "991", "paidOnly": false, "title": "Broken Calculator", "titleSlug": "broken-calculator", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 102769, "totalSubmissionRaw": 188323}, "992": {"acRate": 63.929810669174216, "difficulty": "Hard", "likes": 6063, "dislikes": 97, "categoryTitle": "Algorithms", "frontendQuestionId": "992", "paidOnly": false, "title": "Subarrays with K Different Integers", "titleSlug": "subarrays-with-k-different-integers", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 232514, "totalSubmissionRaw": 363702}, "993": {"acRate": 56.547426496125105, "difficulty": "Easy", "likes": 4031, "dislikes": 208, "categoryTitle": "Algorithms", "frontendQuestionId": "993", "paidOnly": false, "title": "Cousins in Binary Tree", "titleSlug": "cousins-in-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 284933, "totalSubmissionRaw": 503884}, "994": {"acRate": 54.76799606047638, "difficulty": "Medium", "likes": 12968, "dislikes": 405, "categoryTitle": "Algorithms", "frontendQuestionId": "994", "paidOnly": false, "title": "Rotting Oranges", "titleSlug": "rotting-oranges", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 934227, "totalSubmissionRaw": 1705790}, "995": {"acRate": 62.734677786822715, "difficulty": "Hard", "likes": 1874, "dislikes": 88, "categoryTitle": "Algorithms", "frontendQuestionId": "995", "paidOnly": false, "title": "Minimum Number of K Consecutive Bit Flips", "titleSlug": "minimum-number-of-k-consecutive-bit-flips", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 122534, "totalSubmissionRaw": 195321}, "996": {"acRate": 50.17556440246285, "difficulty": "Hard", "likes": 989, "dislikes": 45, "categoryTitle": "Algorithms", "frontendQuestionId": "996", "paidOnly": false, "title": "Number of Squareful Arrays", "titleSlug": "number-of-squareful-arrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 40583, "totalSubmissionRaw": 80882}, "997": {"acRate": 49.7573428614169, "difficulty": "Easy", "likes": 6636, "dislikes": 600, "categoryTitle": "Algorithms", "frontendQuestionId": "997", "paidOnly": false, "title": "Find the Town Judge", "titleSlug": "find-the-town-judge", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 608696, "totalSubmissionRaw": 1223330}, "998": {"acRate": 69.6261245254082, "difficulty": "Medium", "likes": 534, "dislikes": 788, "categoryTitle": "Algorithms", "frontendQuestionId": "998", "paidOnly": false, "title": "Maximum Binary Tree II", "titleSlug": "maximum-binary-tree-ii", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 37227, "totalSubmissionRaw": 53467}, "999": {"acRate": 69.32901855690955, "difficulty": "Easy", "likes": 711, "dislikes": 636, "categoryTitle": "Algorithms", "frontendQuestionId": "999", "paidOnly": false, "title": "Available Captures for Rook", "titleSlug": "available-captures-for-rook", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 68556, "totalSubmissionRaw": 98885}, "1000": {"acRate": 43.31450695087059, "difficulty": "Hard", "likes": 2471, "dislikes": 111, "categoryTitle": "Algorithms", "frontendQuestionId": "1000", "paidOnly": false, "title": "Minimum Cost to Merge Stones", "titleSlug": "minimum-cost-to-merge-stones", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 40723, "totalSubmissionRaw": 94017}, "1001": {"acRate": 37.287234042553195, "difficulty": "Hard", "likes": 613, "dislikes": 154, "categoryTitle": "Algorithms", "frontendQuestionId": "1001", "paidOnly": false, "title": "Grid Illumination", "titleSlug": "grid-illumination", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21731, "totalSubmissionRaw": 58280}, "1002": {"acRate": 74.59071660568186, "difficulty": "Easy", "likes": 4259, "dislikes": 411, "categoryTitle": "Algorithms", "frontendQuestionId": "1002", "paidOnly": false, "title": "Find Common Characters", "titleSlug": "find-common-characters", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 362849, "totalSubmissionRaw": 486455}, "1003": {"acRate": 59.97283946116407, "difficulty": "Medium", "likes": 998, "dislikes": 470, "categoryTitle": "Algorithms", "frontendQuestionId": "1003", "paidOnly": false, "title": "Check If Word Is Valid After Substitutions", "titleSlug": "check-if-word-is-valid-after-substitutions", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 65801, "totalSubmissionRaw": 109718}, "1004": {"acRate": 63.798002833627585, "difficulty": "Medium", "likes": 8670, "dislikes": 136, "categoryTitle": "Algorithms", "frontendQuestionId": "1004", "paidOnly": false, "title": "Max Consecutive Ones III", "titleSlug": "max-consecutive-ones-iii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 636693, "totalSubmissionRaw": 997988}, "1005": {"acRate": 51.37188459442397, "difficulty": "Easy", "likes": 1553, "dislikes": 114, "categoryTitle": "Algorithms", "frontendQuestionId": "1005", "paidOnly": false, "title": "Maximize Sum Of Array After K Negations", "titleSlug": "maximize-sum-of-array-after-k-negations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 95207, "totalSubmissionRaw": 185329}, "1006": {"acRate": 57.675778497956884, "difficulty": "Medium", "likes": 374, "dislikes": 355, "categoryTitle": "Algorithms", "frontendQuestionId": "1006", "paidOnly": false, "title": "Clumsy Factorial", "titleSlug": "clumsy-factorial", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 32745, "totalSubmissionRaw": 56775}, "1007": {"acRate": 52.25992285047203, "difficulty": "Medium", "likes": 2840, "dislikes": 253, "categoryTitle": "Algorithms", "frontendQuestionId": "1007", "paidOnly": false, "title": "Minimum Domino Rotations For Equal Row", "titleSlug": "minimum-domino-rotations-for-equal-row", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 205925, "totalSubmissionRaw": 394040}, "1008": {"acRate": 82.4076617290417, "difficulty": "Medium", "likes": 6173, "dislikes": 83, "categoryTitle": "Algorithms", "frontendQuestionId": "1008", "paidOnly": false, "title": "Construct Binary Search Tree from Preorder Traversal", "titleSlug": "construct-binary-search-tree-from-preorder-traversal", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 387034, "totalSubmissionRaw": 469658}, "1009": {"acRate": 60.800637950916936, "difficulty": "Easy", "likes": 2424, "dislikes": 112, "categoryTitle": "Algorithms", "frontendQuestionId": "1009", "paidOnly": false, "title": "Complement of Base 10 Integer", "titleSlug": "complement-of-base-10-integer", "topicTags": [{"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 254658, "totalSubmissionRaw": 418841}, "1010": {"acRate": 52.99710155873828, "difficulty": "Medium", "likes": 4207, "dislikes": 172, "categoryTitle": "Algorithms", "frontendQuestionId": "1010", "paidOnly": false, "title": "Pairs of Songs With Total Durations Divisible by 60", "titleSlug": "pairs-of-songs-with-total-durations-divisible-by-60", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 280670, "totalSubmissionRaw": 529592}, "1011": {"acRate": 70.16662615337998, "difficulty": "Medium", "likes": 9541, "dislikes": 230, "categoryTitle": "Algorithms", "frontendQuestionId": "1011", "paidOnly": false, "title": "Capacity To Ship Packages Within D Days", "titleSlug": "capacity-to-ship-packages-within-d-days", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 421434, "totalSubmissionRaw": 600621}, "1012": {"acRate": 42.48872469052874, "difficulty": "Hard", "likes": 775, "dislikes": 88, "categoryTitle": "Algorithms", "frontendQuestionId": "1012", "paidOnly": false, "title": "Numbers With Repeated Digits", "titleSlug": "numbers-with-repeated-digits", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17711, "totalSubmissionRaw": 41684}, "1013": {"acRate": 42.00772267552223, "difficulty": "Easy", "likes": 1708, "dislikes": 158, "categoryTitle": "Algorithms", "frontendQuestionId": "1013", "paidOnly": false, "title": "Partition Array Into Three Parts With Equal Sum", "titleSlug": "partition-array-into-three-parts-with-equal-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 97150, "totalSubmissionRaw": 231267}, "1014": {"acRate": 59.13444573272169, "difficulty": "Medium", "likes": 2499, "dislikes": 58, "categoryTitle": "Algorithms", "frontendQuestionId": "1014", "paidOnly": false, "title": "Best Sightseeing Pair", "titleSlug": "best-sightseeing-pair", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 93844, "totalSubmissionRaw": 158696}, "1015": {"acRate": 46.61515362361299, "difficulty": "Medium", "likes": 1142, "dislikes": 853, "categoryTitle": "Algorithms", "frontendQuestionId": "1015", "paidOnly": false, "title": "Smallest Integer Divisible by K", "titleSlug": "smallest-integer-divisible-by-k", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 63645, "totalSubmissionRaw": 136534}, "1016": {"acRate": 57.438212224359916, "difficulty": "Medium", "likes": 356, "dislikes": 532, "categoryTitle": "Algorithms", "frontendQuestionId": "1016", "paidOnly": false, "title": "Binary String With Substrings Representing 1 To N", "titleSlug": "binary-string-with-substrings-representing-1-to-n", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 38811, "totalSubmissionRaw": 67570}, "1017": {"acRate": 60.90936832468722, "difficulty": "Medium", "likes": 515, "dislikes": 291, "categoryTitle": "Algorithms", "frontendQuestionId": "1017", "paidOnly": false, "title": "Convert to Base -2", "titleSlug": "convert-to-base-2", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27944, "totalSubmissionRaw": 45878}, "1018": {"acRate": 46.81430475707592, "difficulty": "Easy", "likes": 730, "dislikes": 189, "categoryTitle": "Algorithms", "frontendQuestionId": "1018", "paidOnly": false, "title": "Binary Prefix Divisible By 5", "titleSlug": "binary-prefix-divisible-by-5", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 57245, "totalSubmissionRaw": 122281}, "1019": {"acRate": 61.17234300643837, "difficulty": "Medium", "likes": 3305, "dislikes": 120, "categoryTitle": "Algorithms", "frontendQuestionId": "1019", "paidOnly": false, "title": "Next Greater Node In Linked List", "titleSlug": "next-greater-node-in-linked-list", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 163896, "totalSubmissionRaw": 267925}, "1020": {"acRate": 69.26504035528532, "difficulty": "Medium", "likes": 4073, "dislikes": 79, "categoryTitle": "Algorithms", "frontendQuestionId": "1020", "paidOnly": false, "title": "Number of Enclaves", "titleSlug": "number-of-enclaves", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 244240, "totalSubmissionRaw": 352615}, "1021": {"acRate": 83.55183062973288, "difficulty": "Easy", "likes": 2977, "dislikes": 1607, "categoryTitle": "Algorithms", "frontendQuestionId": "1021", "paidOnly": false, "title": "Remove Outermost Parentheses", "titleSlug": "remove-outermost-parentheses", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 355498, "totalSubmissionRaw": 425481}, "1022": {"acRate": 73.13669210508543, "difficulty": "Easy", "likes": 3350, "dislikes": 187, "categoryTitle": "Algorithms", "frontendQuestionId": "1022", "paidOnly": false, "title": "Sum of Root To Leaf Binary Numbers", "titleSlug": "sum-of-root-to-leaf-binary-numbers", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 216587, "totalSubmissionRaw": 296140}, "1023": {"acRate": 62.635204018201264, "difficulty": "Medium", "likes": 905, "dislikes": 329, "categoryTitle": "Algorithms", "frontendQuestionId": "1023", "paidOnly": false, "title": "Camelcase Matching", "titleSlug": "camelcase-matching", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 50380, "totalSubmissionRaw": 80434}, "1024": {"acRate": 51.47063103970194, "difficulty": "Medium", "likes": 1763, "dislikes": 61, "categoryTitle": "Algorithms", "frontendQuestionId": "1024", "paidOnly": false, "title": "Video Stitching", "titleSlug": "video-stitching", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 70733, "totalSubmissionRaw": 137424}, "1025": {"acRate": 69.1343326290402, "difficulty": "Easy", "likes": 2195, "dislikes": 4136, "categoryTitle": "Algorithms", "frontendQuestionId": "1025", "paidOnly": false, "title": "Divisor Game", "titleSlug": "divisor-game", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Brainteaser", "id": "VG9waWNUYWdOb2RlOjMy", "slug": "brainteaser"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 270597, "totalSubmissionRaw": 391408}, "1026": {"acRate": 78.09155480576969, "difficulty": "Medium", "likes": 4934, "dislikes": 166, "categoryTitle": "Algorithms", "frontendQuestionId": "1026", "paidOnly": false, "title": "Maximum Difference Between Node and Ancestor", "titleSlug": "maximum-difference-between-node-and-ancestor", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 332360, "totalSubmissionRaw": 425603}, "1027": {"acRate": 49.188531389155685, "difficulty": "Medium", "likes": 4683, "dislikes": 211, "categoryTitle": "Algorithms", "frontendQuestionId": "1027", "paidOnly": false, "title": "Longest Arithmetic Subsequence", "titleSlug": "longest-arithmetic-subsequence", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 180274, "totalSubmissionRaw": 366496}, "1028": {"acRate": 75.06344292925068, "difficulty": "Hard", "likes": 1635, "dislikes": 45, "categoryTitle": "Algorithms", "frontendQuestionId": "1028", "paidOnly": false, "title": "Recover a Tree From Preorder Traversal", "titleSlug": "recover-a-tree-from-preorder-traversal", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 53834, "totalSubmissionRaw": 71718}, "1029": {"acRate": 66.89750318581395, "difficulty": "Medium", "likes": 4724, "dislikes": 352, "categoryTitle": "Algorithms", "frontendQuestionId": "1029", "paidOnly": false, "title": "Two City Scheduling", "titleSlug": "two-city-scheduling", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 247780, "totalSubmissionRaw": 370389}, "1030": {"acRate": 71.50047074959609, "difficulty": "Easy", "likes": 756, "dislikes": 327, "categoryTitle": "Algorithms", "frontendQuestionId": "1030", "paidOnly": false, "title": "Matrix Cells in Distance Order", "titleSlug": "matrix-cells-in-distance-order", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 61514, "totalSubmissionRaw": 86033}, "1031": {"acRate": 59.84435604588272, "difficulty": "Medium", "likes": 2554, "dislikes": 84, "categoryTitle": "Algorithms", "frontendQuestionId": "1031", "paidOnly": false, "title": "Maximum Sum of Two Non-Overlapping Subarrays", "titleSlug": "maximum-sum-of-two-non-overlapping-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 72362, "totalSubmissionRaw": 120917}, "1032": {"acRate": 52.11402487627807, "difficulty": "Hard", "likes": 1814, "dislikes": 184, "categoryTitle": "Algorithms", "frontendQuestionId": "1032", "paidOnly": false, "title": "Stream of Characters", "titleSlug": "stream-of-characters", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Data Stream", "id": "VG9waWNUYWdOb2RlOjYxMDYz", "slug": "data-stream"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 90878, "totalSubmissionRaw": 174383}, "1033": {"acRate": 48.561036428745524, "difficulty": "Medium", "likes": 219, "dislikes": 649, "categoryTitle": "Algorithms", "frontendQuestionId": "1033", "paidOnly": false, "title": "Moving Stones Until Consecutive", "titleSlug": "moving-stones-until-consecutive", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Brainteaser", "id": "VG9waWNUYWdOb2RlOjMy", "slug": "brainteaser"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25901, "totalSubmissionRaw": 53337}, "1034": {"acRate": 49.18008627850272, "difficulty": "Medium", "likes": 742, "dislikes": 886, "categoryTitle": "Algorithms", "frontendQuestionId": "1034", "paidOnly": false, "title": "Coloring A Border", "titleSlug": "coloring-a-border", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 36709, "totalSubmissionRaw": 74642}, "1035": {"acRate": 63.3827358770056, "difficulty": "Medium", "likes": 3821, "dislikes": 58, "categoryTitle": "Algorithms", "frontendQuestionId": "1035", "paidOnly": false, "title": "Uncrossed Lines", "titleSlug": "uncrossed-lines", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 162597, "totalSubmissionRaw": 256532}, "1036": {"acRate": 34.82245666448822, "difficulty": "Hard", "likes": 671, "dislikes": 169, "categoryTitle": "Algorithms", "frontendQuestionId": "1036", "paidOnly": false, "title": "Escape a Large Maze", "titleSlug": "escape-a-large-maze", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22379, "totalSubmissionRaw": 64266}, "1037": {"acRate": 37.22601022081848, "difficulty": "Easy", "likes": 420, "dislikes": 528, "categoryTitle": "Algorithms", "frontendQuestionId": "1037", "paidOnly": false, "title": "Valid Boomerang", "titleSlug": "valid-boomerang", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 54924, "totalSubmissionRaw": 147542}, "1038": {"acRate": 88.2491469656349, "difficulty": "Medium", "likes": 4316, "dislikes": 166, "categoryTitle": "Algorithms", "frontendQuestionId": "1038", "paidOnly": false, "title": "Binary Search Tree to Greater Sum Tree", "titleSlug": "binary-search-tree-to-greater-sum-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 289669, "totalSubmissionRaw": 328240}, "1039": {"acRate": 59.53271341020976, "difficulty": "Medium", "likes": 1837, "dislikes": 176, "categoryTitle": "Algorithms", "frontendQuestionId": "1039", "paidOnly": false, "title": "Minimum Score Triangulation of Polygon", "titleSlug": "minimum-score-triangulation-of-polygon", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 53330, "totalSubmissionRaw": 89581}, "1040": {"acRate": 56.888487296693945, "difficulty": "Medium", "likes": 373, "dislikes": 646, "categoryTitle": "Algorithms", "frontendQuestionId": "1040", "paidOnly": false, "title": "Moving Stones Until Consecutive II", "titleSlug": "moving-stones-until-consecutive-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10703, "totalSubmissionRaw": 18814}, "1041": {"acRate": 55.863858413493375, "difficulty": "Medium", "likes": 3737, "dislikes": 702, "categoryTitle": "Algorithms", "frontendQuestionId": "1041", "paidOnly": false, "title": "Robot Bounded In Circle", "titleSlug": "robot-bounded-in-circle", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 240489, "totalSubmissionRaw": 430492}, "1042": {"acRate": 51.534588896520006, "difficulty": "Medium", "likes": 1452, "dislikes": 716, "categoryTitle": "Algorithms", "frontendQuestionId": "1042", "paidOnly": false, "title": "Flower Planting With No Adjacent", "titleSlug": "flower-planting-with-no-adjacent", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 81789, "totalSubmissionRaw": 158707}, "1043": {"acRate": 76.64616539395378, "difficulty": "Medium", "likes": 4719, "dislikes": 422, "categoryTitle": "Algorithms", "frontendQuestionId": "1043", "paidOnly": false, "title": "Partition Array for Maximum Sum", "titleSlug": "partition-array-for-maximum-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 200140, "totalSubmissionRaw": 261122}, "1044": {"acRate": 30.570930552582492, "difficulty": "Hard", "likes": 2230, "dislikes": 386, "categoryTitle": "Algorithms", "frontendQuestionId": "1044", "paidOnly": false, "title": "Longest Duplicate Substring", "titleSlug": "longest-duplicate-substring", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "Suffix Array", "id": "VG9waWNUYWdOb2RlOjU2Njk4", "slug": "suffix-array"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 69979, "totalSubmissionRaw": 228907}, "1045": {"acRate": 62.119688322486574, "difficulty": "Medium", "likes": 750, "dislikes": 66, "categoryTitle": "Database", "frontendQuestionId": "1045", "paidOnly": false, "title": "Customers Who Bought All Products", "titleSlug": "customers-who-bought-all-products", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 203212, "totalSubmissionRaw": 327131}, "1046": {"acRate": 65.54410223207228, "difficulty": "Easy", "likes": 6035, "dislikes": 126, "categoryTitle": "Algorithms", "frontendQuestionId": "1046", "paidOnly": false, "title": "Last Stone Weight", "titleSlug": "last-stone-weight", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 650925, "totalSubmissionRaw": 993110}, "1047": {"acRate": 69.95368522941575, "difficulty": "Easy", "likes": 6615, "dislikes": 260, "categoryTitle": "Algorithms", "frontendQuestionId": "1047", "paidOnly": false, "title": "Remove All Adjacent Duplicates In String", "titleSlug": "remove-all-adjacent-duplicates-in-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 601284, "totalSubmissionRaw": 859548}, "1048": {"acRate": 61.300769990013535, "difficulty": "Medium", "likes": 7308, "dislikes": 253, "categoryTitle": "Algorithms", "frontendQuestionId": "1048", "paidOnly": false, "title": "Longest String Chain", "titleSlug": "longest-string-chain", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 421707, "totalSubmissionRaw": 687930}, "1049": {"acRate": 55.915268512291036, "difficulty": "Medium", "likes": 3121, "dislikes": 119, "categoryTitle": "Algorithms", "frontendQuestionId": "1049", "paidOnly": false, "title": "Last Stone Weight II", "titleSlug": "last-stone-weight-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 92282, "totalSubmissionRaw": 165039}, "1050": {"acRate": 70.16062237472637, "difficulty": "Easy", "likes": 655, "dislikes": 51, "categoryTitle": "Database", "frontendQuestionId": "1050", "paidOnly": false, "title": "Actors and Directors Who Cooperated At Least Three Times", "titleSlug": "actors-and-directors-who-cooperated-at-least-three-times", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 189748, "totalSubmissionRaw": 270448}, "1051": {"acRate": 80.79266505139758, "difficulty": "Easy", "likes": 1603, "dislikes": 113, "categoryTitle": "Algorithms", "frontendQuestionId": "1051", "paidOnly": false, "title": "Height Checker", "titleSlug": "height-checker", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting Sort", "id": "VG9waWNUYWdOb2RlOjYxMDcy", "slug": "counting-sort"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 509851, "totalSubmissionRaw": 631061}, "1052": {"acRate": 64.30073109755898, "difficulty": "Medium", "likes": 2442, "dislikes": 237, "categoryTitle": "Algorithms", "frontendQuestionId": "1052", "paidOnly": false, "title": "Grumpy Bookstore Owner", "titleSlug": "grumpy-bookstore-owner", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 197274, "totalSubmissionRaw": 306799}, "1053": {"acRate": 49.70750419563654, "difficulty": "Medium", "likes": 449, "dislikes": 41, "categoryTitle": "Algorithms", "frontendQuestionId": "1053", "paidOnly": false, "title": "Previous Permutation With One Swap", "titleSlug": "previous-permutation-with-one-swap", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 41466, "totalSubmissionRaw": 83420}, "1054": {"acRate": 46.6637249030794, "difficulty": "Medium", "likes": 1267, "dislikes": 50, "categoryTitle": "Algorithms", "frontendQuestionId": "1054", "paidOnly": false, "title": "Distant Barcodes", "titleSlug": "distant-barcodes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 44415, "totalSubmissionRaw": 95181}, "1055": {"acRate": 60.37240313326871, "difficulty": "Medium", "likes": 1271, "dislikes": 67, "categoryTitle": "Algorithms", "frontendQuestionId": "1055", "paidOnly": true, "title": "Shortest Way to Form String", "titleSlug": "shortest-way-to-form-string", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 92179, "totalSubmissionRaw": 152684}, "1056": {"acRate": 48.82724543407556, "difficulty": "Easy", "likes": 314, "dislikes": 180, "categoryTitle": "Algorithms", "frontendQuestionId": "1056", "paidOnly": true, "title": "Confusing Number", "titleSlug": "confusing-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 46839, "totalSubmissionRaw": 95928}, "1057": {"acRate": 58.639117072260916, "difficulty": "Medium", "likes": 982, "dislikes": 195, "categoryTitle": "Algorithms", "frontendQuestionId": "1057", "paidOnly": true, "title": "Campus Bikes", "titleSlug": "campus-bikes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 72312, "totalSubmissionRaw": 123317}, "1058": {"acRate": 45.13588783251705, "difficulty": "Medium", "likes": 150, "dislikes": 146, "categoryTitle": "Algorithms", "frontendQuestionId": "1058", "paidOnly": true, "title": "Minimize Rounding Error to Meet Target", "titleSlug": "minimize-rounding-error-to-meet-target", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9400, "totalSubmissionRaw": 20826}, "1059": {"acRate": 37.53588214408223, "difficulty": "Medium", "likes": 710, "dislikes": 390, "categoryTitle": "Algorithms", "frontendQuestionId": "1059", "paidOnly": true, "title": "All Paths from Source Lead to Destination", "titleSlug": "all-paths-from-source-lead-to-destination", "topicTags": [{"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 62372, "totalSubmissionRaw": 166168}, "1060": {"acRate": 57.31151378249197, "difficulty": "Medium", "likes": 1657, "dislikes": 62, "categoryTitle": "Algorithms", "frontendQuestionId": "1060", "paidOnly": true, "title": "Missing Element in Sorted Array", "titleSlug": "missing-element-in-sorted-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 140050, "totalSubmissionRaw": 244367}, "1061": {"acRate": 76.64211746233504, "difficulty": "Medium", "likes": 2353, "dislikes": 153, "categoryTitle": "Algorithms", "frontendQuestionId": "1061", "paidOnly": false, "title": "Lexicographically Smallest Equivalent String", "titleSlug": "lexicographically-smallest-equivalent-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 82004, "totalSubmissionRaw": 106996}, "1062": {"acRate": 62.37168368985675, "difficulty": "Medium", "likes": 706, "dislikes": 73, "categoryTitle": "Algorithms", "frontendQuestionId": "1062", "paidOnly": true, "title": "Longest Repeating Substring", "titleSlug": "longest-repeating-substring", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "Suffix Array", "id": "VG9waWNUYWdOb2RlOjU2Njk4", "slug": "suffix-array"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 48547, "totalSubmissionRaw": 77835}, "1063": {"acRate": 79.14140059028709, "difficulty": "Hard", "likes": 310, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "1063", "paidOnly": true, "title": "Number of Valid Subarrays", "titleSlug": "number-of-valid-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 14748, "totalSubmissionRaw": 18635}, "1064": {"acRate": 64.15659198991578, "difficulty": "Easy", "likes": 437, "dislikes": 67, "categoryTitle": "Algorithms", "frontendQuestionId": "1064", "paidOnly": true, "title": "Fixed Point", "titleSlug": "fixed-point", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 44789, "totalSubmissionRaw": 69812}, "1065": {"acRate": 67.53984421809467, "difficulty": "Easy", "likes": 377, "dislikes": 108, "categoryTitle": "Algorithms", "frontendQuestionId": "1065", "paidOnly": true, "title": "Index Pairs of a String", "titleSlug": "index-pairs-of-a-string", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 28181, "totalSubmissionRaw": 41725}, "1066": {"acRate": 55.18716233599177, "difficulty": "Medium", "likes": 935, "dislikes": 86, "categoryTitle": "Algorithms", "frontendQuestionId": "1066", "paidOnly": true, "title": "Campus Bikes II", "titleSlug": "campus-bikes-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 51483, "totalSubmissionRaw": 93288}, "1067": {"acRate": 46.31543847949317, "difficulty": "Hard", "likes": 94, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "1067", "paidOnly": true, "title": "Digit Count in Range", "titleSlug": "digit-count-in-range", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4167, "totalSubmissionRaw": 8997}, "1068": {"acRate": 83.8934218754653, "difficulty": "Easy", "likes": 902, "dislikes": 216, "categoryTitle": "Database", "frontendQuestionId": "1068", "paidOnly": false, "title": "Product Sales Analysis I", "titleSlug": "product-sales-analysis-i", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 563445, "totalSubmissionRaw": 671620}, "1069": {"acRate": 81.92221045250422, "difficulty": "Easy", "likes": 80, "dislikes": 181, "categoryTitle": "Database", "frontendQuestionId": "1069", "paidOnly": true, "title": "Product Sales Analysis II", "titleSlug": "product-sales-analysis-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 54909, "totalSubmissionRaw": 67026}, "1070": {"acRate": 43.277669473496964, "difficulty": "Medium", "likes": 434, "dislikes": 899, "categoryTitle": "Database", "frontendQuestionId": "1070", "paidOnly": false, "title": "Product Sales Analysis III", "titleSlug": "product-sales-analysis-iii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 180038, "totalSubmissionRaw": 416007}, "1071": {"acRate": 51.64829843979592, "difficulty": "Easy", "likes": 5196, "dislikes": 1355, "categoryTitle": "Algorithms", "frontendQuestionId": "1071", "paidOnly": false, "title": "Greatest Common Divisor of Strings", "titleSlug": "greatest-common-divisor-of-strings", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 522671, "totalSubmissionRaw": 1011982}, "1072": {"acRate": 64.11112631723005, "difficulty": "Medium", "likes": 746, "dislikes": 53, "categoryTitle": "Algorithms", "frontendQuestionId": "1072", "paidOnly": false, "title": "Flip Columns For Maximum Number of Equal Rows", "titleSlug": "flip-columns-for-maximum-number-of-equal-rows", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23423, "totalSubmissionRaw": 36535}, "1073": {"acRate": 36.99470984937205, "difficulty": "Medium", "likes": 321, "dislikes": 126, "categoryTitle": "Algorithms", "frontendQuestionId": "1073", "paidOnly": false, "title": "Adding Two Negabinary Numbers", "titleSlug": "adding-two-negabinary-numbers", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18322, "totalSubmissionRaw": 49526}, "1074": {"acRate": 74.44395113358063, "difficulty": "Hard", "likes": 3723, "dislikes": 103, "categoryTitle": "Algorithms", "frontendQuestionId": "1074", "paidOnly": false, "title": "Number of Submatrices That Sum to Target", "titleSlug": "number-of-submatrices-that-sum-to-target", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 155937, "totalSubmissionRaw": 209469}, "1075": {"acRate": 62.76797436525068, "difficulty": "Easy", "likes": 614, "dislikes": 169, "categoryTitle": "Database", "frontendQuestionId": "1075", "paidOnly": false, "title": "Project Employees I", "titleSlug": "project-employees-i", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 282070, "totalSubmissionRaw": 449386}, "1076": {"acRate": 49.97865655841273, "difficulty": "Easy", "likes": 203, "dislikes": 62, "categoryTitle": "Database", "frontendQuestionId": "1076", "paidOnly": true, "title": "Project Employees II", "titleSlug": "project-employees-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 58541, "totalSubmissionRaw": 117132}, "1077": {"acRate": 76.6376480662195, "difficulty": "Medium", "likes": 269, "dislikes": 9, "categoryTitle": "Database", "frontendQuestionId": "1077", "paidOnly": true, "title": "Project Employees III", "titleSlug": "project-employees-iii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 59069, "totalSubmissionRaw": 77076}, "1078": {"acRate": 63.50522077505508, "difficulty": "Easy", "likes": 493, "dislikes": 360, "categoryTitle": "Algorithms", "frontendQuestionId": "1078", "paidOnly": false, "title": "Occurrences After Bigram", "titleSlug": "occurrences-after-bigram", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 75233, "totalSubmissionRaw": 118468}, "1079": {"acRate": 76.43504087513968, "difficulty": "Medium", "likes": 2491, "dislikes": 70, "categoryTitle": "Algorithms", "frontendQuestionId": "1079", "paidOnly": false, "title": "Letter Tile Possibilities", "titleSlug": "letter-tile-possibilities", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 103970, "totalSubmissionRaw": 136024}, "1080": {"acRate": 55.92624479839289, "difficulty": "Medium", "likes": 700, "dislikes": 714, "categoryTitle": "Algorithms", "frontendQuestionId": "1080", "paidOnly": false, "title": "Insufficient Nodes in Root to Leaf Paths", "titleSlug": "insufficient-nodes-in-root-to-leaf-paths", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 38975, "totalSubmissionRaw": 69690}, "1081": {"acRate": 61.15186183097754, "difficulty": "Medium", "likes": 2608, "dislikes": 192, "categoryTitle": "Algorithms", "frontendQuestionId": "1081", "paidOnly": false, "title": "Smallest Subsequence of Distinct Characters", "titleSlug": "smallest-subsequence-of-distinct-characters", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 71947, "totalSubmissionRaw": 117653}, "1082": {"acRate": 74.42423790713273, "difficulty": "Easy", "likes": 196, "dislikes": 75, "categoryTitle": "Database", "frontendQuestionId": "1082", "paidOnly": true, "title": "Sales Analysis I", "titleSlug": "sales-analysis-i", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 59913, "totalSubmissionRaw": 80502}, "1083": {"acRate": 49.730547177220586, "difficulty": "Easy", "likes": 271, "dislikes": 46, "categoryTitle": "Database", "frontendQuestionId": "1083", "paidOnly": true, "title": "Sales Analysis II", "titleSlug": "sales-analysis-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 59521, "totalSubmissionRaw": 119687}, "1084": {"acRate": 46.58662058880426, "difficulty": "Easy", "likes": 730, "dislikes": 154, "categoryTitle": "Database", "frontendQuestionId": "1084", "paidOnly": false, "title": "Sales Analysis III", "titleSlug": "sales-analysis-iii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 142085, "totalSubmissionRaw": 304991}, "1085": {"acRate": 76.46559582560587, "difficulty": "Easy", "likes": 117, "dislikes": 151, "categoryTitle": "Algorithms", "frontendQuestionId": "1085", "paidOnly": true, "title": "Sum of Digits in the Minimum Number", "titleSlug": "sum-of-digits-in-the-minimum-number", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24326, "totalSubmissionRaw": 31813}, "1086": {"acRate": 74.5175327060552, "difficulty": "Easy", "likes": 798, "dislikes": 126, "categoryTitle": "Algorithms", "frontendQuestionId": "1086", "paidOnly": true, "title": "High Five", "titleSlug": "high-five", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 105490, "totalSubmissionRaw": 141564}, "1087": {"acRate": 66.42983792423145, "difficulty": "Medium", "likes": 645, "dislikes": 51, "categoryTitle": "Algorithms", "frontendQuestionId": "1087", "paidOnly": true, "title": "Brace Expansion", "titleSlug": "brace-expansion", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 53201, "totalSubmissionRaw": 80086}, "1088": {"acRate": 47.15796098174953, "difficulty": "Hard", "likes": 492, "dislikes": 144, "categoryTitle": "Algorithms", "frontendQuestionId": "1088", "paidOnly": true, "title": "Confusing Number II", "titleSlug": "confusing-number-ii", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 37467, "totalSubmissionRaw": 79450}, "1089": {"acRate": 52.084005342623186, "difficulty": "Easy", "likes": 2613, "dislikes": 752, "categoryTitle": "Algorithms", "frontendQuestionId": "1089", "paidOnly": false, "title": "Duplicate Zeros", "titleSlug": "duplicate-zeros", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 435963, "totalSubmissionRaw": 837039}, "1090": {"acRate": 62.384083099276644, "difficulty": "Medium", "likes": 452, "dislikes": 628, "categoryTitle": "Algorithms", "frontendQuestionId": "1090", "paidOnly": false, "title": "Largest Values From Labels", "titleSlug": "largest-values-from-labels", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 39758, "totalSubmissionRaw": 63731}, "1091": {"acRate": 47.933413608645594, "difficulty": "Medium", "likes": 6566, "dislikes": 241, "categoryTitle": "Algorithms", "frontendQuestionId": "1091", "paidOnly": false, "title": "Shortest Path in Binary Matrix", "titleSlug": "shortest-path-in-binary-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 508342, "totalSubmissionRaw": 1060517}, "1092": {"acRate": 59.464441331733376, "difficulty": "Hard", "likes": 4908, "dislikes": 69, "categoryTitle": "Algorithms", "frontendQuestionId": "1092", "paidOnly": false, "title": "Shortest Common Supersequence ", "titleSlug": "shortest-common-supersequence", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 130330, "totalSubmissionRaw": 219173}, "1093": {"acRate": 42.00998623297101, "difficulty": "Medium", "likes": 156, "dislikes": 103, "categoryTitle": "Algorithms", "frontendQuestionId": "1093", "paidOnly": false, "title": "Statistics from a Large Sample", "titleSlug": "statistics-from-a-large-sample", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Probability and Statistics", "id": "VG9waWNUYWdOb2RlOjYxMDc5", "slug": "probability-and-statistics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20445, "totalSubmissionRaw": 48667}, "1094": {"acRate": 55.97654897782317, "difficulty": "Medium", "likes": 4459, "dislikes": 101, "categoryTitle": "Algorithms", "frontendQuestionId": "1094", "paidOnly": false, "title": "Car Pooling", "titleSlug": "car-pooling", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 228002, "totalSubmissionRaw": 407317}, "1095": {"acRate": 40.27348524471867, "difficulty": "Hard", "likes": 3257, "dislikes": 131, "categoryTitle": "Algorithms", "frontendQuestionId": "1095", "paidOnly": false, "title": "Find in Mountain Array", "titleSlug": "find-in-mountain-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 143991, "totalSubmissionRaw": 357533}, "1096": {"acRate": 63.786537540036825, "difficulty": "Hard", "likes": 482, "dislikes": 289, "categoryTitle": "Algorithms", "frontendQuestionId": "1096", "paidOnly": false, "title": "Brace Expansion II", "titleSlug": "brace-expansion-ii", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25292, "totalSubmissionRaw": 39651}, "1097": {"acRate": 51.05867861617857, "difficulty": "Hard", "likes": 183, "dislikes": 33, "categoryTitle": "Database", "frontendQuestionId": "1097", "paidOnly": true, "title": "Game Play Analysis V", "titleSlug": "game-play-analysis-v", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 24042, "totalSubmissionRaw": 47087}, "1098": {"acRate": 43.156361179438996, "difficulty": "Medium", "likes": 202, "dislikes": 605, "categoryTitle": "Database", "frontendQuestionId": "1098", "paidOnly": true, "title": "Unpopular Books", "titleSlug": "unpopular-books", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 40879, "totalSubmissionRaw": 94723}, "1099": {"acRate": 61.85275705732172, "difficulty": "Easy", "likes": 1136, "dislikes": 131, "categoryTitle": "Algorithms", "frontendQuestionId": "1099", "paidOnly": true, "title": "Two Sum Less Than K", "titleSlug": "two-sum-less-than-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 136154, "totalSubmissionRaw": 220126}, "1100": {"acRate": 74.7852203673954, "difficulty": "Medium", "likes": 572, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "1100", "paidOnly": true, "title": "Find K-Length Substrings With No Repeated Characters", "titleSlug": "find-k-length-substrings-with-no-repeated-characters", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 42828, "totalSubmissionRaw": 57268}, "1101": {"acRate": 65.30997409832224, "difficulty": "Medium", "likes": 1039, "dislikes": 36, "categoryTitle": "Algorithms", "frontendQuestionId": "1101", "paidOnly": true, "title": "The Earliest Moment When Everyone Become Friends", "titleSlug": "the-earliest-moment-when-everyone-become-friends", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 100352, "totalSubmissionRaw": 153655}, "1102": {"acRate": 53.77532228360957, "difficulty": "Medium", "likes": 1296, "dislikes": 124, "categoryTitle": "Algorithms", "frontendQuestionId": "1102", "paidOnly": true, "title": "Path With Maximum Minimum Value", "titleSlug": "path-with-maximum-minimum-value", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 63364, "totalSubmissionRaw": 117831}, "1103": {"acRate": 65.4756985973687, "difficulty": "Easy", "likes": 981, "dislikes": 197, "categoryTitle": "Algorithms", "frontendQuestionId": "1103", "paidOnly": false, "title": "Distribute Candies to People", "titleSlug": "distribute-candies-to-people", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 90327, "totalSubmissionRaw": 137955}, "1104": {"acRate": 75.4817221770918, "difficulty": "Medium", "likes": 1493, "dislikes": 317, "categoryTitle": "Algorithms", "frontendQuestionId": "1104", "paidOnly": false, "title": "Path In Zigzag Labelled Binary Tree", "titleSlug": "path-in-zigzag-labelled-binary-tree", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 46459, "totalSubmissionRaw": 61550}, "1105": {"acRate": 68.84645128240491, "difficulty": "Medium", "likes": 2524, "dislikes": 242, "categoryTitle": "Algorithms", "frontendQuestionId": "1105", "paidOnly": false, "title": "Filling Bookcase Shelves", "titleSlug": "filling-bookcase-shelves", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 139770, "totalSubmissionRaw": 203017}, "1106": {"acRate": 59.73042179386869, "difficulty": "Hard", "likes": 1190, "dislikes": 63, "categoryTitle": "Algorithms", "frontendQuestionId": "1106", "paidOnly": false, "title": "Parsing A Boolean Expression", "titleSlug": "parsing-a-boolean-expression", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33590, "totalSubmissionRaw": 56236}, "1107": {"acRate": 44.60944893353716, "difficulty": "Medium", "likes": 150, "dislikes": 166, "categoryTitle": "Database", "frontendQuestionId": "1107", "paidOnly": true, "title": "New Users Daily Count", "titleSlug": "new-users-daily-count", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 36768, "totalSubmissionRaw": 82422}, "1108": {"acRate": 89.25504506959557, "difficulty": "Easy", "likes": 2120, "dislikes": 1756, "categoryTitle": "Algorithms", "frontendQuestionId": "1108", "paidOnly": false, "title": "Defanging an IP Address", "titleSlug": "defanging-an-ip-address", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 677984, "totalSubmissionRaw": 759603}, "1109": {"acRate": 62.40909972926273, "difficulty": "Medium", "likes": 1650, "dislikes": 161, "categoryTitle": "Algorithms", "frontendQuestionId": "1109", "paidOnly": false, "title": "Corporate Flight Bookings", "titleSlug": "corporate-flight-bookings", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 67541, "totalSubmissionRaw": 108223}, "1110": {"acRate": 72.41409247605091, "difficulty": "Medium", "likes": 4565, "dislikes": 139, "categoryTitle": "Algorithms", "frontendQuestionId": "1110", "paidOnly": false, "title": "Delete Nodes And Return Forest", "titleSlug": "delete-nodes-and-return-forest", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 341977, "totalSubmissionRaw": 472252}, "1111": {"acRate": 72.02467343976778, "difficulty": "Medium", "likes": 440, "dislikes": 1768, "categoryTitle": "Algorithms", "frontendQuestionId": "1111", "paidOnly": false, "title": "Maximum Nesting Depth of Two Valid Parentheses Strings", "titleSlug": "maximum-nesting-depth-of-two-valid-parentheses-strings", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27790, "totalSubmissionRaw": 38584}, "1112": {"acRate": 70.89463131096943, "difficulty": "Medium", "likes": 301, "dislikes": 14, "categoryTitle": "Database", "frontendQuestionId": "1112", "paidOnly": true, "title": "Highest Grade For Each Student", "titleSlug": "highest-grade-for-each-student", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 62936, "totalSubmissionRaw": 88774}, "1113": {"acRate": 64.86681752501431, "difficulty": "Easy", "likes": 110, "dislikes": 403, "categoryTitle": "Database", "frontendQuestionId": "1113", "paidOnly": true, "title": "Reported Posts", "titleSlug": "reported-posts", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 47585, "totalSubmissionRaw": 73358}, "1114": {"acRate": 69.77567084230692, "difficulty": "Easy", "likes": 1481, "dislikes": 203, "categoryTitle": "Concurrency", "frontendQuestionId": "1114", "paidOnly": false, "title": "Print in Order", "titleSlug": "print-in-order", "topicTags": [{"name": "Concurrency", "id": "VG9waWNUYWdOb2RlOjYxMDQ1", "slug": "concurrency"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 164261, "totalSubmissionRaw": 235413}, "1115": {"acRate": 66.6553038050436, "difficulty": "Medium", "likes": 684, "dislikes": 55, "categoryTitle": "Concurrency", "frontendQuestionId": "1115", "paidOnly": false, "title": "Print FooBar Alternately", "titleSlug": "print-foobar-alternately", "topicTags": [{"name": "Concurrency", "id": "VG9waWNUYWdOb2RlOjYxMDQ1", "slug": "concurrency"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 87990, "totalSubmissionRaw": 132008}, "1116": {"acRate": 61.43726456099681, "difficulty": "Medium", "likes": 490, "dislikes": 333, "categoryTitle": "Concurrency", "frontendQuestionId": "1116", "paidOnly": false, "title": "Print Zero Even Odd", "titleSlug": "print-zero-even-odd", "topicTags": [{"name": "Concurrency", "id": "VG9waWNUYWdOb2RlOjYxMDQ1", "slug": "concurrency"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 53005, "totalSubmissionRaw": 86275}, "1117": {"acRate": 56.60943851757083, "difficulty": "Medium", "likes": 519, "dislikes": 166, "categoryTitle": "Concurrency", "frontendQuestionId": "1117", "paidOnly": false, "title": "Building H2O", "titleSlug": "building-h2o", "topicTags": [{"name": "Concurrency", "id": "VG9waWNUYWdOb2RlOjYxMDQ1", "slug": "concurrency"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 54867, "totalSubmissionRaw": 96922}, "1118": {"acRate": 58.36363636363636, "difficulty": "Easy", "likes": 42, "dislikes": 177, "categoryTitle": "Algorithms", "frontendQuestionId": "1118", "paidOnly": true, "title": "Number of Days in a Month", "titleSlug": "number-of-days-in-a-month", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8667, "totalSubmissionRaw": 14850}, "1119": {"acRate": 91.171488195098, "difficulty": "Easy", "likes": 360, "dislikes": 115, "categoryTitle": "Algorithms", "frontendQuestionId": "1119", "paidOnly": true, "title": "Remove Vowels from a String", "titleSlug": "remove-vowels-from-a-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 111406, "totalSubmissionRaw": 122194}, "1120": {"acRate": 66.64912549274752, "difficulty": "Medium", "likes": 837, "dislikes": 36, "categoryTitle": "Algorithms", "frontendQuestionId": "1120", "paidOnly": true, "title": "Maximum Average Subtree", "titleSlug": "maximum-average-subtree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 69659, "totalSubmissionRaw": 104516}, "1121": {"acRate": 61.33949768836686, "difficulty": "Hard", "likes": 122, "dislikes": 29, "categoryTitle": "Algorithms", "frontendQuestionId": "1121", "paidOnly": true, "title": "Divide Array Into Increasing Sequences", "titleSlug": "divide-array-into-increasing-sequences", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4909, "totalSubmissionRaw": 8003}, "1122": {"acRate": 74.77782592163555, "difficulty": "Easy", "likes": 3157, "dislikes": 185, "categoryTitle": "Algorithms", "frontendQuestionId": "1122", "paidOnly": false, "title": "Relative Sort Array", "titleSlug": "relative-sort-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting Sort", "id": "VG9waWNUYWdOb2RlOjYxMDcy", "slug": "counting-sort"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 338256, "totalSubmissionRaw": 452348}, "1123": {"acRate": 72.54700038931519, "difficulty": "Medium", "likes": 1971, "dislikes": 846, "categoryTitle": "Algorithms", "frontendQuestionId": "1123", "paidOnly": false, "title": "Lowest Common Ancestor of Deepest Leaves", "titleSlug": "lowest-common-ancestor-of-deepest-leaves", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 115534, "totalSubmissionRaw": 159254}, "1124": {"acRate": 35.264098779803355, "difficulty": "Medium", "likes": 1430, "dislikes": 116, "categoryTitle": "Algorithms", "frontendQuestionId": "1124", "paidOnly": false, "title": "Longest Well-Performing Interval", "titleSlug": "longest-well-performing-interval", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33929, "totalSubmissionRaw": 96214}, "1125": {"acRate": 55.50026826355597, "difficulty": "Hard", "likes": 2180, "dislikes": 56, "categoryTitle": "Algorithms", "frontendQuestionId": "1125", "paidOnly": false, "title": "Smallest Sufficient Team", "titleSlug": "smallest-sufficient-team", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 64135, "totalSubmissionRaw": 115558}, "1126": {"acRate": 65.69174028647396, "difficulty": "Medium", "likes": 272, "dislikes": 31, "categoryTitle": "Database", "frontendQuestionId": "1126", "paidOnly": true, "title": "Active Businesses", "titleSlug": "active-businesses", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 45954, "totalSubmissionRaw": 69954}, "1127": {"acRate": 46.92086415404485, "difficulty": "Hard", "likes": 181, "dislikes": 133, "categoryTitle": "Database", "frontendQuestionId": "1127", "paidOnly": true, "title": "User Purchase Platform", "titleSlug": "user-purchase-platform", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15985, "totalSubmissionRaw": 34068}, "1128": {"acRate": 48.47891627900632, "difficulty": "Easy", "likes": 687, "dislikes": 334, "categoryTitle": "Algorithms", "frontendQuestionId": "1128", "paidOnly": false, "title": "Number of Equivalent Domino Pairs", "titleSlug": "number-of-equivalent-domino-pairs", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 71073, "totalSubmissionRaw": 146606}, "1129": {"acRate": 47.146401985111666, "difficulty": "Medium", "likes": 3491, "dislikes": 189, "categoryTitle": "Algorithms", "frontendQuestionId": "1129", "paidOnly": false, "title": "Shortest Path with Alternating Colors", "titleSlug": "shortest-path-with-alternating-colors", "topicTags": [{"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 119890, "totalSubmissionRaw": 254293}, "1130": {"acRate": 67.71202869690217, "difficulty": "Medium", "likes": 4283, "dislikes": 275, "categoryTitle": "Algorithms", "frontendQuestionId": "1130", "paidOnly": false, "title": "Minimum Cost Tree From Leaf Values", "titleSlug": "minimum-cost-tree-from-leaf-values", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 102688, "totalSubmissionRaw": 151654}, "1131": {"acRate": 48.51221691333566, "difficulty": "Medium", "likes": 646, "dislikes": 406, "categoryTitle": "Algorithms", "frontendQuestionId": "1131", "paidOnly": false, "title": "Maximum of Absolute Value Expression", "titleSlug": "maximum-of-absolute-value-expression", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24977, "totalSubmissionRaw": 51486}, "1132": {"acRate": 32.24809465661712, "difficulty": "Medium", "likes": 154, "dislikes": 566, "categoryTitle": "Database", "frontendQuestionId": "1132", "paidOnly": true, "title": "Reported Posts II", "titleSlug": "reported-posts-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 38293, "totalSubmissionRaw": 118745}, "1133": {"acRate": 69.1771559346718, "difficulty": "Easy", "likes": 319, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "1133", "paidOnly": true, "title": "Largest Unique Number", "titleSlug": "largest-unique-number", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 66500, "totalSubmissionRaw": 96130}, "1134": {"acRate": 77.78377704863563, "difficulty": "Easy", "likes": 208, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "1134", "paidOnly": true, "title": "Armstrong Number", "titleSlug": "armstrong-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 37456, "totalSubmissionRaw": 48154}, "1135": {"acRate": 62.09522243236576, "difficulty": "Medium", "likes": 1120, "dislikes": 59, "categoryTitle": "Algorithms", "frontendQuestionId": "1135", "paidOnly": true, "title": "Connecting Cities With Minimum Cost", "titleSlug": "connecting-cities-with-minimum-cost", "topicTags": [{"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Minimum Spanning Tree", "id": "VG9waWNUYWdOb2RlOjYxMDgz", "slug": "minimum-spanning-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 75514, "totalSubmissionRaw": 121610}, "1136": {"acRate": 61.47485352576977, "difficulty": "Medium", "likes": 1167, "dislikes": 27, "categoryTitle": "Algorithms", "frontendQuestionId": "1136", "paidOnly": true, "title": "Parallel Courses", "titleSlug": "parallel-courses", "topicTags": [{"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 88766, "totalSubmissionRaw": 144394}, "1137": {"acRate": 63.78060898348744, "difficulty": "Easy", "likes": 4451, "dislikes": 193, "categoryTitle": "Algorithms", "frontendQuestionId": "1137", "paidOnly": false, "title": "N-th Tribonacci Number", "titleSlug": "n-th-tribonacci-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 806189, "totalSubmissionRaw": 1264000}, "1138": {"acRate": 51.67732891047664, "difficulty": "Medium", "likes": 904, "dislikes": 179, "categoryTitle": "Algorithms", "frontendQuestionId": "1138", "paidOnly": false, "title": "Alphabet Board Path", "titleSlug": "alphabet-board-path", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 52345, "totalSubmissionRaw": 101292}, "1139": {"acRate": 50.281484367390675, "difficulty": "Medium", "likes": 709, "dislikes": 112, "categoryTitle": "Algorithms", "frontendQuestionId": "1139", "paidOnly": false, "title": "Largest 1-Bordered Square", "titleSlug": "largest-1-bordered-square", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25812, "totalSubmissionRaw": 51335}, "1140": {"acRate": 67.44357144840222, "difficulty": "Medium", "likes": 2842, "dislikes": 626, "categoryTitle": "Algorithms", "frontendQuestionId": "1140", "paidOnly": false, "title": "Stone Game II", "titleSlug": "stone-game-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 97170, "totalSubmissionRaw": 144076}, "1141": {"acRate": 48.75905415245468, "difficulty": "Easy", "likes": 684, "dislikes": 808, "categoryTitle": "Database", "frontendQuestionId": "1141", "paidOnly": false, "title": "User Activity for the Past 30 Days I", "titleSlug": "user-activity-for-the-past-30-days-i", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 254448, "totalSubmissionRaw": 521842}, "1142": {"acRate": 35.747265295315, "difficulty": "Easy", "likes": 99, "dislikes": 369, "categoryTitle": "Database", "frontendQuestionId": "1142", "paidOnly": true, "title": "User Activity for the Past 30 Days II", "titleSlug": "user-activity-for-the-past-30-days-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 43202, "totalSubmissionRaw": 120854}, "1143": {"acRate": 57.74038293539178, "difficulty": "Medium", "likes": 13586, "dislikes": 197, "categoryTitle": "Algorithms", "frontendQuestionId": "1143", "paidOnly": false, "title": "Longest Common Subsequence", "titleSlug": "longest-common-subsequence", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1173183, "totalSubmissionRaw": 2031821}, "1144": {"acRate": 48.017129450354204, "difficulty": "Medium", "likes": 435, "dislikes": 168, "categoryTitle": "Algorithms", "frontendQuestionId": "1144", "paidOnly": false, "title": "Decrease Elements To Make Array Zigzag", "titleSlug": "decrease-elements-to-make-array-zigzag", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21080, "totalSubmissionRaw": 43901}, "1145": {"acRate": 52.11921338707707, "difficulty": "Medium", "likes": 1353, "dislikes": 212, "categoryTitle": "Algorithms", "frontendQuestionId": "1145", "paidOnly": false, "title": "Binary Tree Coloring Game", "titleSlug": "binary-tree-coloring-game", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 46937, "totalSubmissionRaw": 90057}, "1146": {"acRate": 36.89434042468401, "difficulty": "Medium", "likes": 3714, "dislikes": 502, "categoryTitle": "Algorithms", "frontendQuestionId": "1146", "paidOnly": false, "title": "Snapshot Array", "titleSlug": "snapshot-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 222190, "totalSubmissionRaw": 602235}, "1147": {"acRate": 58.71173858911415, "difficulty": "Hard", "likes": 674, "dislikes": 31, "categoryTitle": "Algorithms", "frontendQuestionId": "1147", "paidOnly": false, "title": "Longest Chunked Palindrome Decomposition", "titleSlug": "longest-chunked-palindrome-decomposition", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24993, "totalSubmissionRaw": 42569}, "1148": {"acRate": 76.1266428466955, "difficulty": "Easy", "likes": 1488, "dislikes": 85, "categoryTitle": "Database", "frontendQuestionId": "1148", "paidOnly": false, "title": "Article Views I", "titleSlug": "article-views-i", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 728667, "totalSubmissionRaw": 957178}, "1149": {"acRate": 47.064351783152794, "difficulty": "Medium", "likes": 130, "dislikes": 27, "categoryTitle": "Database", "frontendQuestionId": "1149", "paidOnly": true, "title": "Article Views II", "titleSlug": "article-views-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 38060, "totalSubmissionRaw": 80868}, "1150": {"acRate": 58.98239522772023, "difficulty": "Easy", "likes": 455, "dislikes": 35, "categoryTitle": "Algorithms", "frontendQuestionId": "1150", "paidOnly": true, "title": "Check If a Number Is Majority Element in a Sorted Array", "titleSlug": "check-if-a-number-is-majority-element-in-a-sorted-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 50624, "totalSubmissionRaw": 85829}, "1151": {"acRate": 60.23790882237802, "difficulty": "Medium", "likes": 1205, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "1151", "paidOnly": true, "title": "Minimum Swaps to Group All 1's Together", "titleSlug": "minimum-swaps-to-group-all-1s-together", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 67705, "totalSubmissionRaw": 112396}, "1152": {"acRate": 42.75414894504211, "difficulty": "Medium", "likes": 495, "dislikes": 3752, "categoryTitle": "Algorithms", "frontendQuestionId": "1152", "paidOnly": true, "title": "Analyze User Website Visit Pattern", "titleSlug": "analyze-user-website-visit-pattern", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 102533, "totalSubmissionRaw": 239820}, "1153": {"acRate": 34.94680354020104, "difficulty": "Hard", "likes": 880, "dislikes": 336, "categoryTitle": "Algorithms", "frontendQuestionId": "1153", "paidOnly": true, "title": "String Transforms Into Another String", "titleSlug": "string-transforms-into-another-string", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 52358, "totalSubmissionRaw": 149822}, "1154": {"acRate": 48.90236590877646, "difficulty": "Easy", "likes": 454, "dislikes": 477, "categoryTitle": "Algorithms", "frontendQuestionId": "1154", "paidOnly": false, "title": "Day of the Year", "titleSlug": "day-of-the-year", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 63621, "totalSubmissionRaw": 130098}, "1155": {"acRate": 61.07523785034713, "difficulty": "Medium", "likes": 5060, "dislikes": 172, "categoryTitle": "Algorithms", "frontendQuestionId": "1155", "paidOnly": false, "title": "Number of Dice Rolls With Target Sum", "titleSlug": "number-of-dice-rolls-with-target-sum", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 296902, "totalSubmissionRaw": 486125}, "1156": {"acRate": 44.05085197018104, "difficulty": "Medium", "likes": 1021, "dislikes": 97, "categoryTitle": "Algorithms", "frontendQuestionId": "1156", "paidOnly": false, "title": "Swap For Longest Repeated Character Substring", "titleSlug": "swap-for-longest-repeated-character-substring", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33091, "totalSubmissionRaw": 75120}, "1157": {"acRate": 41.862387551665456, "difficulty": "Hard", "likes": 633, "dislikes": 61, "categoryTitle": "Algorithms", "frontendQuestionId": "1157", "paidOnly": false, "title": "Online Majority Element In Subarray", "titleSlug": "online-majority-element-in-subarray", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17218, "totalSubmissionRaw": 41130}, "1158": {"acRate": 57.14323228503603, "difficulty": "Medium", "likes": 648, "dislikes": 67, "categoryTitle": "Database", "frontendQuestionId": "1158", "paidOnly": false, "title": "Market Analysis I", "titleSlug": "market-analysis-i", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 108803, "totalSubmissionRaw": 190404}, "1159": {"acRate": 57.08657945024254, "difficulty": "Hard", "likes": 120, "dislikes": 79, "categoryTitle": "Database", "frontendQuestionId": "1159", "paidOnly": true, "title": "Market Analysis II", "titleSlug": "market-analysis-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 19418, "totalSubmissionRaw": 34015}, "1160": {"acRate": 70.6604995374653, "difficulty": "Easy", "likes": 2116, "dislikes": 183, "categoryTitle": "Algorithms", "frontendQuestionId": "1160", "paidOnly": false, "title": "Find Words That Can Be Formed by Characters", "titleSlug": "find-words-that-can-be-formed-by-characters", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 267344, "totalSubmissionRaw": 378350}, "1161": {"acRate": 67.15544895211163, "difficulty": "Medium", "likes": 3539, "dislikes": 98, "categoryTitle": "Algorithms", "frontendQuestionId": "1161", "paidOnly": false, "title": "Maximum Level Sum of a Binary Tree", "titleSlug": "maximum-level-sum-of-a-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 298739, "totalSubmissionRaw": 444847}, "1162": {"acRate": 51.62082740254373, "difficulty": "Medium", "likes": 4137, "dislikes": 111, "categoryTitle": "Algorithms", "frontendQuestionId": "1162", "paidOnly": false, "title": "As Far from Land as Possible", "titleSlug": "as-far-from-land-as-possible", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 157395, "totalSubmissionRaw": 304906}, "1163": {"acRate": 34.56994328922495, "difficulty": "Hard", "likes": 594, "dislikes": 449, "categoryTitle": "Algorithms", "frontendQuestionId": "1163", "paidOnly": false, "title": "Last Substring in Lexicographical Order", "titleSlug": "last-substring-in-lexicographical-order", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 35112, "totalSubmissionRaw": 101568}, "1164": {"acRate": 56.203608783788994, "difficulty": "Medium", "likes": 906, "dislikes": 244, "categoryTitle": "Database", "frontendQuestionId": "1164", "paidOnly": false, "title": "Product Price at a Given Date", "titleSlug": "product-price-at-a-given-date", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 145836, "totalSubmissionRaw": 259478}, "1165": {"acRate": 87.54810751840965, "difficulty": "Easy", "likes": 527, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "1165", "paidOnly": true, "title": "Single-Row Keyboard", "titleSlug": "single-row-keyboard", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 86670, "totalSubmissionRaw": 98997}, "1166": {"acRate": 63.1619028278418, "difficulty": "Medium", "likes": 577, "dislikes": 70, "categoryTitle": "Algorithms", "frontendQuestionId": "1166", "paidOnly": true, "title": "Design File System", "titleSlug": "design-file-system", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 62205, "totalSubmissionRaw": 98485}, "1167": {"acRate": 70.19144339048533, "difficulty": "Medium", "likes": 1313, "dislikes": 156, "categoryTitle": "Algorithms", "frontendQuestionId": "1167", "paidOnly": true, "title": "Minimum Cost to Connect Sticks", "titleSlug": "minimum-cost-to-connect-sticks", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 125719, "totalSubmissionRaw": 179110}, "1168": {"acRate": 64.8551724137931, "difficulty": "Hard", "likes": 1155, "dislikes": 40, "categoryTitle": "Algorithms", "frontendQuestionId": "1168", "paidOnly": true, "title": "Optimize Water Distribution in a Village", "titleSlug": "optimize-water-distribution-in-a-village", "topicTags": [{"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Minimum Spanning Tree", "id": "VG9waWNUYWdOb2RlOjYxMDgz", "slug": "minimum-spanning-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 49371, "totalSubmissionRaw": 76125}, "1169": {"acRate": 31.127717931390862, "difficulty": "Medium", "likes": 548, "dislikes": 2325, "categoryTitle": "Algorithms", "frontendQuestionId": "1169", "paidOnly": false, "title": "Invalid Transactions", "titleSlug": "invalid-transactions", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 78308, "totalSubmissionRaw": 251570}, "1170": {"acRate": 62.40001215426805, "difficulty": "Medium", "likes": 708, "dislikes": 975, "categoryTitle": "Algorithms", "frontendQuestionId": "1170", "paidOnly": false, "title": "Compare Strings by Frequency of the Smallest Character", "titleSlug": "compare-strings-by-frequency-of-the-smallest-character", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 82144, "totalSubmissionRaw": 131641}, "1171": {"acRate": 52.75177175341352, "difficulty": "Medium", "likes": 3306, "dislikes": 215, "categoryTitle": "Algorithms", "frontendQuestionId": "1171", "paidOnly": false, "title": "Remove Zero Sum Consecutive Nodes from Linked List", "titleSlug": "remove-zero-sum-consecutive-nodes-from-linked-list", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 167402, "totalSubmissionRaw": 317340}, "1172": {"acRate": 32.74852785353228, "difficulty": "Hard", "likes": 483, "dislikes": 64, "categoryTitle": "Algorithms", "frontendQuestionId": "1172", "paidOnly": false, "title": "Dinner Plate Stacks", "titleSlug": "dinner-plate-stacks", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18853, "totalSubmissionRaw": 57569}, "1173": {"acRate": 80.93214066696271, "difficulty": "Easy", "likes": 292, "dislikes": 13, "categoryTitle": "Database", "frontendQuestionId": "1173", "paidOnly": true, "title": "Immediate Food Delivery I", "titleSlug": "immediate-food-delivery-i", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 76544, "totalSubmissionRaw": 94578}, "1174": {"acRate": 52.08544769538152, "difficulty": "Medium", "likes": 732, "dislikes": 130, "categoryTitle": "Database", "frontendQuestionId": "1174", "paidOnly": false, "title": "Immediate Food Delivery II", "titleSlug": "immediate-food-delivery-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 180135, "totalSubmissionRaw": 345845}, "1175": {"acRate": 57.820243145923214, "difficulty": "Easy", "likes": 406, "dislikes": 522, "categoryTitle": "Algorithms", "frontendQuestionId": "1175", "paidOnly": false, "title": "Prime Arrangements", "titleSlug": "prime-arrangements", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 32435, "totalSubmissionRaw": 56097}, "1176": {"acRate": 53.52196984404323, "difficulty": "Easy", "likes": 154, "dislikes": 289, "categoryTitle": "Algorithms", "frontendQuestionId": "1176", "paidOnly": true, "title": "Diet Plan Performance", "titleSlug": "diet-plan-performance", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33083, "totalSubmissionRaw": 61812}, "1177": {"acRate": 39.28380398557184, "difficulty": "Medium", "likes": 805, "dislikes": 277, "categoryTitle": "Algorithms", "frontendQuestionId": "1177", "paidOnly": false, "title": "Can Make Palindrome from Substring", "titleSlug": "can-make-palindrome-from-substring", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28643, "totalSubmissionRaw": 72912}, "1178": {"acRate": 46.79768510942172, "difficulty": "Hard", "likes": 1270, "dislikes": 87, "categoryTitle": "Algorithms", "frontendQuestionId": "1178", "paidOnly": false, "title": "Number of Valid Words for Each Puzzle", "titleSlug": "number-of-valid-words-for-each-puzzle", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 31456, "totalSubmissionRaw": 67217}, "1179": {"acRate": 76.92786499757936, "difficulty": "Easy", "likes": 740, "dislikes": 605, "categoryTitle": "Database", "frontendQuestionId": "1179", "paidOnly": false, "title": "Reformat Department Table", "titleSlug": "reformat-department-table", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 122353, "totalSubmissionRaw": 159049}, "1180": {"acRate": 80.014924944749, "difficulty": "Easy", "likes": 355, "dislikes": 50, "categoryTitle": "Algorithms", "frontendQuestionId": "1180", "paidOnly": true, "title": "Count Substrings with Only One Distinct Letter", "titleSlug": "count-substrings-with-only-one-distinct-letter", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 27878, "totalSubmissionRaw": 34841}, "1181": {"acRate": 45.96766568970408, "difficulty": "Medium", "likes": 74, "dislikes": 154, "categoryTitle": "Algorithms", "frontendQuestionId": "1181", "paidOnly": true, "title": "Before and After Puzzle", "titleSlug": "before-and-after-puzzle", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9724, "totalSubmissionRaw": 21154}, "1182": {"acRate": 55.414198907776324, "difficulty": "Medium", "likes": 516, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "1182", "paidOnly": true, "title": "Shortest Distance to Target Color", "titleSlug": "shortest-distance-to-target-color", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 36022, "totalSubmissionRaw": 65005}, "1183": {"acRate": 68.19037375638612, "difficulty": "Hard", "likes": 164, "dislikes": 28, "categoryTitle": "Algorithms", "frontendQuestionId": "1183", "paidOnly": true, "title": "Maximum Number of Ones", "titleSlug": "maximum-number-of-ones", "topicTags": [{"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5072, "totalSubmissionRaw": 7438}, "1184": {"acRate": 54.121863799283155, "difficulty": "Easy", "likes": 759, "dislikes": 88, "categoryTitle": "Algorithms", "frontendQuestionId": "1184", "paidOnly": false, "title": "Distance Between Bus Stops", "titleSlug": "distance-between-bus-stops", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 62363, "totalSubmissionRaw": 115227}, "1185": {"acRate": 57.73056284582337, "difficulty": "Easy", "likes": 402, "dislikes": 2453, "categoryTitle": "Algorithms", "frontendQuestionId": "1185", "paidOnly": false, "title": "Day of the Week", "titleSlug": "day-of-the-week", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 69069, "totalSubmissionRaw": 119641}, "1186": {"acRate": 44.18273533479782, "difficulty": "Medium", "likes": 1822, "dislikes": 66, "categoryTitle": "Algorithms", "frontendQuestionId": "1186", "paidOnly": false, "title": "Maximum Subarray Sum with One Deletion", "titleSlug": "maximum-subarray-sum-with-one-deletion", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 54305, "totalSubmissionRaw": 122910}, "1187": {"acRate": 58.155466677226464, "difficulty": "Hard", "likes": 2235, "dislikes": 50, "categoryTitle": "Algorithms", "frontendQuestionId": "1187", "paidOnly": false, "title": "Make Array Strictly Increasing", "titleSlug": "make-array-strictly-increasing", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 58744, "totalSubmissionRaw": 101012}, "1188": {"acRate": 72.44476403987423, "difficulty": "Medium", "likes": 520, "dislikes": 41, "categoryTitle": "Concurrency", "frontendQuestionId": "1188", "paidOnly": true, "title": "Design Bounded Blocking Queue", "titleSlug": "design-bounded-blocking-queue", "topicTags": [{"name": "Concurrency", "id": "VG9waWNUYWdOb2RlOjYxMDQ1", "slug": "concurrency"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 51380, "totalSubmissionRaw": 70923}, "1189": {"acRate": 59.70835855389864, "difficulty": "Easy", "likes": 1704, "dislikes": 105, "categoryTitle": "Algorithms", "frontendQuestionId": "1189", "paidOnly": false, "title": "Maximum Number of Balloons", "titleSlug": "maximum-number-of-balloons", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 217015, "totalSubmissionRaw": 363459}, "1190": {"acRate": 71.70694943590958, "difficulty": "Medium", "likes": 2810, "dislikes": 117, "categoryTitle": "Algorithms", "frontendQuestionId": "1190", "paidOnly": false, "title": "Reverse Substrings Between Each Pair of Parentheses", "titleSlug": "reverse-substrings-between-each-pair-of-parentheses", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 217883, "totalSubmissionRaw": 303852}, "1191": {"acRate": 23.860437078108333, "difficulty": "Medium", "likes": 1446, "dislikes": 118, "categoryTitle": "Algorithms", "frontendQuestionId": "1191", "paidOnly": false, "title": "K-Concatenation Maximum Sum", "titleSlug": "k-concatenation-maximum-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 36019, "totalSubmissionRaw": 150957}, "1192": {"acRate": 56.35737709506328, "difficulty": "Hard", "likes": 6215, "dislikes": 184, "categoryTitle": "Algorithms", "frontendQuestionId": "1192", "paidOnly": false, "title": "Critical Connections in a Network", "titleSlug": "critical-connections-in-a-network", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Biconnected Component", "id": "VG9waWNUYWdOb2RlOjYxMDg0", "slug": "biconnected-component"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 241629, "totalSubmissionRaw": 428745}, "1193": {"acRate": 57.950377562028045, "difficulty": "Medium", "likes": 826, "dislikes": 82, "categoryTitle": "Database", "frontendQuestionId": "1193", "paidOnly": false, "title": "Monthly Transactions I", "titleSlug": "monthly-transactions-i", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 212191, "totalSubmissionRaw": 366159}, "1194": {"acRate": 49.14480393065727, "difficulty": "Hard", "likes": 149, "dislikes": 56, "categoryTitle": "Database", "frontendQuestionId": "1194", "paidOnly": true, "title": "Tournament Winners", "titleSlug": "tournament-winners", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 21205, "totalSubmissionRaw": 43148}, "1195": {"acRate": 72.75742284105043, "difficulty": "Medium", "likes": 605, "dislikes": 408, "categoryTitle": "Concurrency", "frontendQuestionId": "1195", "paidOnly": false, "title": "Fizz Buzz Multithreaded", "titleSlug": "fizz-buzz-multithreaded", "topicTags": [{"name": "Concurrency", "id": "VG9waWNUYWdOb2RlOjYxMDQ1", "slug": "concurrency"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 50896, "totalSubmissionRaw": 69953}, "1196": {"acRate": 67.05181176642657, "difficulty": "Easy", "likes": 221, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "1196", "paidOnly": true, "title": "How Many Apples Can You Put into the Basket", "titleSlug": "how-many-apples-can-you-put-into-the-basket", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 36676, "totalSubmissionRaw": 54698}, "1197": {"acRate": 40.66532719550345, "difficulty": "Medium", "likes": 1513, "dislikes": 406, "categoryTitle": "Algorithms", "frontendQuestionId": "1197", "paidOnly": true, "title": "Minimum Knight Moves", "titleSlug": "minimum-knight-moves", "topicTags": [{"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 159892, "totalSubmissionRaw": 393190}, "1198": {"acRate": 76.49135785863206, "difficulty": "Medium", "likes": 574, "dislikes": 30, "categoryTitle": "Algorithms", "frontendQuestionId": "1198", "paidOnly": true, "title": "Find Smallest Common Element in All Rows", "titleSlug": "find-smallest-common-element-in-all-rows", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 45494, "totalSubmissionRaw": 59476}, "1199": {"acRate": 45.74887582151504, "difficulty": "Hard", "likes": 235, "dislikes": 30, "categoryTitle": "Algorithms", "frontendQuestionId": "1199", "paidOnly": true, "title": "Minimum Time to Build Blocks", "titleSlug": "minimum-time-to-build-blocks", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 6613, "totalSubmissionRaw": 14455}, "1200": {"acRate": 69.68763458038704, "difficulty": "Easy", "likes": 2353, "dislikes": 75, "categoryTitle": "Algorithms", "frontendQuestionId": "1200", "paidOnly": false, "title": "Minimum Absolute Difference", "titleSlug": "minimum-absolute-difference", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 200653, "totalSubmissionRaw": 287932}, "1201": {"acRate": 29.74801512626127, "difficulty": "Medium", "likes": 1220, "dislikes": 499, "categoryTitle": "Algorithms", "frontendQuestionId": "1201", "paidOnly": false, "title": "Ugly Number III", "titleSlug": "ugly-number-iii", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33197, "totalSubmissionRaw": 111594}, "1202": {"acRate": 58.51960769752509, "difficulty": "Medium", "likes": 3699, "dislikes": 141, "categoryTitle": "Algorithms", "frontendQuestionId": "1202", "paidOnly": false, "title": "Smallest String With Swaps", "titleSlug": "smallest-string-with-swaps", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 118202, "totalSubmissionRaw": 201987}, "1203": {"acRate": 66.2450242194619, "difficulty": "Hard", "likes": 1772, "dislikes": 298, "categoryTitle": "Algorithms", "frontendQuestionId": "1203", "paidOnly": false, "title": "Sort Items by Groups Respecting Dependencies", "titleSlug": "sort-items-by-groups-respecting-dependencies", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 55251, "totalSubmissionRaw": 83404}, "1204": {"acRate": 67.40340081887271, "difficulty": "Medium", "likes": 722, "dislikes": 32, "categoryTitle": "Database", "frontendQuestionId": "1204", "paidOnly": false, "title": "Last Person to Fit in the Bus", "titleSlug": "last-person-to-fit-in-the-bus", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 143059, "totalSubmissionRaw": 212243}, "1205": {"acRate": 41.70681348933242, "difficulty": "Medium", "likes": 156, "dislikes": 546, "categoryTitle": "Database", "frontendQuestionId": "1205", "paidOnly": true, "title": "Monthly Transactions II", "titleSlug": "monthly-transactions-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 23634, "totalSubmissionRaw": 56667}, "1206": {"acRate": 61.77841974557803, "difficulty": "Hard", "likes": 667, "dislikes": 92, "categoryTitle": "Algorithms", "frontendQuestionId": "1206", "paidOnly": false, "title": "Design Skiplist", "titleSlug": "design-skiplist", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24379, "totalSubmissionRaw": 39462}, "1207": {"acRate": 77.38997840775173, "difficulty": "Easy", "likes": 5090, "dislikes": 137, "categoryTitle": "Algorithms", "frontendQuestionId": "1207", "paidOnly": false, "title": "Unique Number of Occurrences", "titleSlug": "unique-number-of-occurrences", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 677041, "totalSubmissionRaw": 874843}, "1208": {"acRate": 58.321125744181856, "difficulty": "Medium", "likes": 1793, "dislikes": 137, "categoryTitle": "Algorithms", "frontendQuestionId": "1208", "paidOnly": false, "title": "Get Equal Substrings Within Budget", "titleSlug": "get-equal-substrings-within-budget", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 161632, "totalSubmissionRaw": 277144}, "1209": {"acRate": 58.17968393134731, "difficulty": "Medium", "likes": 5783, "dislikes": 115, "categoryTitle": "Algorithms", "frontendQuestionId": "1209", "paidOnly": false, "title": "Remove All Adjacent Duplicates in String II", "titleSlug": "remove-all-adjacent-duplicates-in-string-ii", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 328607, "totalSubmissionRaw": 564814}, "1210": {"acRate": 49.89180212369785, "difficulty": "Hard", "likes": 270, "dislikes": 72, "categoryTitle": "Algorithms", "frontendQuestionId": "1210", "paidOnly": false, "title": "Minimum Moves to Reach Target with Rotations", "titleSlug": "minimum-moves-to-reach-target-with-rotations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9914, "totalSubmissionRaw": 19871}, "1211": {"acRate": 45.19550913102069, "difficulty": "Easy", "likes": 636, "dislikes": 420, "categoryTitle": "Database", "frontendQuestionId": "1211", "paidOnly": false, "title": "Queries Quality and Percentage", "titleSlug": "queries-quality-and-percentage", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 211621, "totalSubmissionRaw": 468235}, "1212": {"acRate": 55.73443137686947, "difficulty": "Medium", "likes": 309, "dislikes": 25, "categoryTitle": "Database", "frontendQuestionId": "1212", "paidOnly": true, "title": "Team Scores in Football Tournament", "titleSlug": "team-scores-in-football-tournament", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 40470, "totalSubmissionRaw": 72613}, "1213": {"acRate": 79.80346288284545, "difficulty": "Easy", "likes": 583, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "1213", "paidOnly": true, "title": "Intersection of Three Sorted Arrays", "titleSlug": "intersection-of-three-sorted-arrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 88356, "totalSubmissionRaw": 110717}, "1214": {"acRate": 67.26516164768506, "difficulty": "Medium", "likes": 547, "dislikes": 46, "categoryTitle": "Algorithms", "frontendQuestionId": "1214", "paidOnly": true, "title": "Two Sum BSTs", "titleSlug": "two-sum-bsts", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 49789, "totalSubmissionRaw": 74019}, "1215": {"acRate": 47.30600797126409, "difficulty": "Medium", "likes": 183, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "1215", "paidOnly": true, "title": "Stepping Numbers", "titleSlug": "stepping-numbers", "topicTags": [{"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9614, "totalSubmissionRaw": 20323}, "1216": {"acRate": 49.266002378316315, "difficulty": "Hard", "likes": 769, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "1216", "paidOnly": true, "title": "Valid Palindrome III", "titleSlug": "valid-palindrome-iii", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 72087, "totalSubmissionRaw": 146322}, "1217": {"acRate": 71.80079724197371, "difficulty": "Easy", "likes": 2306, "dislikes": 314, "categoryTitle": "Algorithms", "frontendQuestionId": "1217", "paidOnly": false, "title": "Minimum Cost to Move Chips to The Same Position", "titleSlug": "minimum-cost-to-move-chips-to-the-same-position", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 133291, "totalSubmissionRaw": 185640}, "1218": {"acRate": 54.67191786686123, "difficulty": "Medium", "likes": 3216, "dislikes": 89, "categoryTitle": "Algorithms", "frontendQuestionId": "1218", "paidOnly": false, "title": "Longest Arithmetic Subsequence of Given Difference", "titleSlug": "longest-arithmetic-subsequence-of-given-difference", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 146869, "totalSubmissionRaw": 268637}, "1219": {"acRate": 68.02936345032963, "difficulty": "Medium", "likes": 3289, "dislikes": 97, "categoryTitle": "Algorithms", "frontendQuestionId": "1219", "paidOnly": false, "title": "Path with Maximum Gold", "titleSlug": "path-with-maximum-gold", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 219077, "totalSubmissionRaw": 322033}, "1220": {"acRate": 61.81449994526945, "difficulty": "Hard", "likes": 3253, "dislikes": 216, "categoryTitle": "Algorithms", "frontendQuestionId": "1220", "paidOnly": false, "title": "Count Vowels Permutation", "titleSlug": "count-vowels-permutation", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 169415, "totalSubmissionRaw": 274070}, "1221": {"acRate": 86.32974564751328, "difficulty": "Easy", "likes": 2749, "dislikes": 940, "categoryTitle": "Algorithms", "frontendQuestionId": "1221", "paidOnly": false, "title": "Split a String in Balanced Strings", "titleSlug": "split-a-string-in-balanced-strings", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 316907, "totalSubmissionRaw": 367089}, "1222": {"acRate": 71.99006693308337, "difficulty": "Medium", "likes": 945, "dislikes": 150, "categoryTitle": "Algorithms", "frontendQuestionId": "1222", "paidOnly": false, "title": "Queens That Can Attack the King", "titleSlug": "queens-that-can-attack-the-king", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 43775, "totalSubmissionRaw": 60807}, "1223": {"acRate": 49.38073987841159, "difficulty": "Hard", "likes": 932, "dislikes": 190, "categoryTitle": "Algorithms", "frontendQuestionId": "1223", "paidOnly": false, "title": "Dice Roll Simulation", "titleSlug": "dice-roll-simulation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30541, "totalSubmissionRaw": 61848}, "1224": {"acRate": 37.23904277909002, "difficulty": "Hard", "likes": 540, "dislikes": 66, "categoryTitle": "Algorithms", "frontendQuestionId": "1224", "paidOnly": false, "title": "Maximum Equal Frequency", "titleSlug": "maximum-equal-frequency", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15608, "totalSubmissionRaw": 41913}, "1225": {"acRate": 57.46738479952125, "difficulty": "Hard", "likes": 322, "dislikes": 23, "categoryTitle": "Database", "frontendQuestionId": "1225", "paidOnly": true, "title": "Report Contiguous Dates", "titleSlug": "report-contiguous-dates", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24007, "totalSubmissionRaw": 41775}, "1226": {"acRate": 54.04342281157327, "difficulty": "Medium", "likes": 354, "dislikes": 332, "categoryTitle": "Concurrency", "frontendQuestionId": "1226", "paidOnly": false, "title": "The Dining Philosophers", "titleSlug": "the-dining-philosophers", "topicTags": [{"name": "Concurrency", "id": "VG9waWNUYWdOb2RlOjYxMDQ1", "slug": "concurrency"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 35172, "totalSubmissionRaw": 65081}, "1227": {"acRate": 66.53122717311906, "difficulty": "Medium", "likes": 617, "dislikes": 973, "categoryTitle": "Algorithms", "frontendQuestionId": "1227", "paidOnly": false, "title": "Airplane Seat Assignment Probability", "titleSlug": "airplane-seat-assignment-probability", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Brainteaser", "id": "VG9waWNUYWdOb2RlOjMy", "slug": "brainteaser"}, {"name": "Probability and Statistics", "id": "VG9waWNUYWdOb2RlOjYxMDc5", "slug": "probability-and-statistics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 43719, "totalSubmissionRaw": 65712}, "1228": {"acRate": 51.9577272812144, "difficulty": "Easy", "likes": 314, "dislikes": 43, "categoryTitle": "Algorithms", "frontendQuestionId": "1228", "paidOnly": true, "title": "Missing Number In Arithmetic Progression", "titleSlug": "missing-number-in-arithmetic-progression", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 27827, "totalSubmissionRaw": 53557}, "1229": {"acRate": 55.00611094136274, "difficulty": "Medium", "likes": 885, "dislikes": 33, "categoryTitle": "Algorithms", "frontendQuestionId": "1229", "paidOnly": true, "title": "Meeting Scheduler", "titleSlug": "meeting-scheduler", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 79211, "totalSubmissionRaw": 144004}, "1230": {"acRate": 58.16711145348997, "difficulty": "Medium", "likes": 400, "dislikes": 52, "categoryTitle": "Algorithms", "frontendQuestionId": "1230", "paidOnly": true, "title": "Toss Strange Coins", "titleSlug": "toss-strange-coins", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Probability and Statistics", "id": "VG9waWNUYWdOb2RlOjYxMDc5", "slug": "probability-and-statistics"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 21142, "totalSubmissionRaw": 36347}, "1231": {"acRate": 58.84681439282872, "difficulty": "Hard", "likes": 988, "dislikes": 62, "categoryTitle": "Algorithms", "frontendQuestionId": "1231", "paidOnly": true, "title": "Divide Chocolate", "titleSlug": "divide-chocolate", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 56194, "totalSubmissionRaw": 95492}, "1232": {"acRate": 39.51388428656637, "difficulty": "Easy", "likes": 2603, "dislikes": 278, "categoryTitle": "Algorithms", "frontendQuestionId": "1232", "paidOnly": false, "title": "Check If It Is a Straight Line", "titleSlug": "check-if-it-is-a-straight-line", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 262335, "totalSubmissionRaw": 663901}, "1233": {"acRate": 66.03686411827643, "difficulty": "Medium", "likes": 813, "dislikes": 115, "categoryTitle": "Algorithms", "frontendQuestionId": "1233", "paidOnly": false, "title": "Remove Sub-Folders from the Filesystem", "titleSlug": "remove-sub-folders-from-the-filesystem", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 54314, "totalSubmissionRaw": 82248}, "1234": {"acRate": 38.57229594934513, "difficulty": "Medium", "likes": 1195, "dislikes": 216, "categoryTitle": "Algorithms", "frontendQuestionId": "1234", "paidOnly": false, "title": "Replace the Substring for Balanced String", "titleSlug": "replace-the-substring-for-balanced-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 35576, "totalSubmissionRaw": 92232}, "1235": {"acRate": 54.34936151219086, "difficulty": "Hard", "likes": 6813, "dislikes": 108, "categoryTitle": "Algorithms", "frontendQuestionId": "1235", "paidOnly": false, "title": "Maximum Profit in Job Scheduling", "titleSlug": "maximum-profit-in-job-scheduling", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 317799, "totalSubmissionRaw": 584737}, "1236": {"acRate": 67.96691960695178, "difficulty": "Medium", "likes": 288, "dislikes": 326, "categoryTitle": "Algorithms", "frontendQuestionId": "1236", "paidOnly": true, "title": "Web Crawler", "titleSlug": "web-crawler", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 38873, "totalSubmissionRaw": 57194}, "1237": {"acRate": 69.67478530198508, "difficulty": "Medium", "likes": 517, "dislikes": 1427, "categoryTitle": "Algorithms", "frontendQuestionId": "1237", "paidOnly": false, "title": "Find Positive Integer Solution for a Given Equation", "titleSlug": "find-positive-integer-solution-for-a-given-equation", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 69286, "totalSubmissionRaw": 99442}, "1238": {"acRate": 70.39352287704763, "difficulty": "Medium", "likes": 421, "dislikes": 191, "categoryTitle": "Algorithms", "frontendQuestionId": "1238", "paidOnly": false, "title": "Circular Permutation in Binary Representation", "titleSlug": "circular-permutation-in-binary-representation", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18693, "totalSubmissionRaw": 26555}, "1239": {"acRate": 54.10734047502971, "difficulty": "Medium", "likes": 4426, "dislikes": 331, "categoryTitle": "Algorithms", "frontendQuestionId": "1239", "paidOnly": false, "title": "Maximum Length of a Concatenated String with Unique Characters", "titleSlug": "maximum-length-of-a-concatenated-string-with-unique-characters", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 291888, "totalSubmissionRaw": 539460}, "1240": {"acRate": 54.36541017957326, "difficulty": "Hard", "likes": 687, "dislikes": 568, "categoryTitle": "Algorithms", "frontendQuestionId": "1240", "paidOnly": false, "title": "Tiling a Rectangle with the Fewest Squares", "titleSlug": "tiling-a-rectangle-with-the-fewest-squares", "topicTags": [{"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24129, "totalSubmissionRaw": 44383}, "1241": {"acRate": 65.91112491096052, "difficulty": "Easy", "likes": 177, "dislikes": 536, "categoryTitle": "Database", "frontendQuestionId": "1241", "paidOnly": true, "title": "Number of Comments per Post", "titleSlug": "number-of-comments-per-post", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 36087, "totalSubmissionRaw": 54751}, "1242": {"acRate": 49.39878023425047, "difficulty": "Medium", "likes": 534, "dislikes": 90, "categoryTitle": "Concurrency", "frontendQuestionId": "1242", "paidOnly": true, "title": "Web Crawler Multithreaded", "titleSlug": "web-crawler-multithreaded", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Concurrency", "id": "VG9waWNUYWdOb2RlOjYxMDQ1", "slug": "concurrency"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 57022, "totalSubmissionRaw": 115432}, "1243": {"acRate": 52.3778675405838, "difficulty": "Easy", "likes": 151, "dislikes": 72, "categoryTitle": "Algorithms", "frontendQuestionId": "1243", "paidOnly": true, "title": "Array Transformation", "titleSlug": "array-transformation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13745, "totalSubmissionRaw": 26242}, "1244": {"acRate": 67.89744981009224, "difficulty": "Medium", "likes": 773, "dislikes": 95, "categoryTitle": "Algorithms", "frontendQuestionId": "1244", "paidOnly": true, "title": "Design A Leaderboard", "titleSlug": "design-a-leaderboard", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 75081, "totalSubmissionRaw": 110580}, "1245": {"acRate": 61.19319244436132, "difficulty": "Medium", "likes": 855, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "1245", "paidOnly": true, "title": "Tree Diameter", "titleSlug": "tree-diameter", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 45808, "totalSubmissionRaw": 74858}, "1246": {"acRate": 46.37594753428157, "difficulty": "Hard", "likes": 310, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "1246", "paidOnly": true, "title": "Palindrome Removal", "titleSlug": "palindrome-removal", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10890, "totalSubmissionRaw": 23482}, "1247": {"acRate": 64.42404111306091, "difficulty": "Medium", "likes": 1383, "dislikes": 243, "categoryTitle": "Algorithms", "frontendQuestionId": "1247", "paidOnly": false, "title": "Minimum Swaps to Make Strings Equal", "titleSlug": "minimum-swaps-to-make-strings-equal", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 41118, "totalSubmissionRaw": 63824}, "1248": {"acRate": 71.36217662086658, "difficulty": "Medium", "likes": 4574, "dislikes": 116, "categoryTitle": "Algorithms", "frontendQuestionId": "1248", "paidOnly": false, "title": "Count Number of Nice Subarrays", "titleSlug": "count-number-of-nice-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 267322, "totalSubmissionRaw": 374599}, "1249": {"acRate": 69.17046176177084, "difficulty": "Medium", "likes": 6894, "dislikes": 146, "categoryTitle": "Algorithms", "frontendQuestionId": "1249", "paidOnly": false, "title": "Minimum Remove to Make Valid Parentheses", "titleSlug": "minimum-remove-to-make-valid-parentheses", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 762466, "totalSubmissionRaw": 1102300}, "1250": {"acRate": 59.83416089817284, "difficulty": "Hard", "likes": 514, "dislikes": 378, "categoryTitle": "Algorithms", "frontendQuestionId": "1250", "paidOnly": false, "title": "Check If It Is a Good Array", "titleSlug": "check-if-it-is-a-good-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24462, "totalSubmissionRaw": 40883}, "1251": {"acRate": 37.76743803014082, "difficulty": "Easy", "likes": 1201, "dislikes": 167, "categoryTitle": "Database", "frontendQuestionId": "1251", "paidOnly": false, "title": "Average Selling Price", "titleSlug": "average-selling-price", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 275158, "totalSubmissionRaw": 728564}, "1252": {"acRate": 78.78391872239759, "difficulty": "Easy", "likes": 1222, "dislikes": 1523, "categoryTitle": "Algorithms", "frontendQuestionId": "1252", "paidOnly": false, "title": "Cells with Odd Values in a Matrix", "titleSlug": "cells-with-odd-values-in-a-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 117559, "totalSubmissionRaw": 149217}, "1253": {"acRate": 46.77772113597869, "difficulty": "Medium", "likes": 463, "dislikes": 34, "categoryTitle": "Algorithms", "frontendQuestionId": "1253", "paidOnly": false, "title": "Reconstruct a 2-Row Binary Matrix", "titleSlug": "reconstruct-a-2-row-binary-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28446, "totalSubmissionRaw": 60811}, "1254": {"acRate": 66.42499971195834, "difficulty": "Medium", "likes": 4547, "dislikes": 165, "categoryTitle": "Algorithms", "frontendQuestionId": "1254", "paidOnly": false, "title": "Number of Closed Islands", "titleSlug": "number-of-closed-islands", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 230609, "totalSubmissionRaw": 347172}, "1255": {"acRate": 82.09133595451588, "difficulty": "Hard", "likes": 1742, "dislikes": 110, "categoryTitle": "Algorithms", "frontendQuestionId": "1255", "paidOnly": false, "title": "Maximum Score Words Formed by Letters", "titleSlug": "maximum-score-words-formed-by-letters", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 116086, "totalSubmissionRaw": 141411}, "1256": {"acRate": 69.81316725978648, "difficulty": "Medium", "likes": 78, "dislikes": 253, "categoryTitle": "Algorithms", "frontendQuestionId": "1256", "paidOnly": true, "title": "Encode Number", "titleSlug": "encode-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7847, "totalSubmissionRaw": 11240}, "1257": {"acRate": 65.92117034152503, "difficulty": "Medium", "likes": 437, "dislikes": 36, "categoryTitle": "Algorithms", "frontendQuestionId": "1257", "paidOnly": true, "title": "Smallest Common Region", "titleSlug": "smallest-common-region", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25054, "totalSubmissionRaw": 38006}, "1258": {"acRate": 56.376097150414815, "difficulty": "Medium", "likes": 354, "dislikes": 162, "categoryTitle": "Algorithms", "frontendQuestionId": "1258", "paidOnly": true, "title": "Synonymous Sentences", "titleSlug": "synonymous-sentences", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23444, "totalSubmissionRaw": 41585}, "1259": {"acRate": 59.6073496098666, "difficulty": "Hard", "likes": 232, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "1259", "paidOnly": true, "title": "Handshakes That Don't Cross", "titleSlug": "handshakes-that-dont-cross", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 11841, "totalSubmissionRaw": 19865}, "1260": {"acRate": 67.43059437302031, "difficulty": "Easy", "likes": 1728, "dislikes": 343, "categoryTitle": "Algorithms", "frontendQuestionId": "1260", "paidOnly": false, "title": "Shift 2D Grid", "titleSlug": "shift-2d-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 108570, "totalSubmissionRaw": 161010}, "1261": {"acRate": 77.50501235604047, "difficulty": "Medium", "likes": 994, "dislikes": 94, "categoryTitle": "Algorithms", "frontendQuestionId": "1261", "paidOnly": false, "title": "Find Elements in a Contaminated Binary Tree", "titleSlug": "find-elements-in-a-contaminated-binary-tree", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 66490, "totalSubmissionRaw": 85788}, "1262": {"acRate": 50.597397528805466, "difficulty": "Medium", "likes": 1815, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "1262", "paidOnly": false, "title": "Greatest Sum Divisible by Three", "titleSlug": "greatest-sum-divisible-by-three", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 57043, "totalSubmissionRaw": 112739}, "1263": {"acRate": 49.07624431269819, "difficulty": "Hard", "likes": 849, "dislikes": 57, "categoryTitle": "Algorithms", "frontendQuestionId": "1263", "paidOnly": false, "title": "Minimum Moves to Move a Box to Their Target Location", "titleSlug": "minimum-moves-to-move-a-box-to-their-target-location", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28476, "totalSubmissionRaw": 58024}, "1264": {"acRate": 65.19438347514959, "difficulty": "Medium", "likes": 249, "dislikes": 22, "categoryTitle": "Database", "frontendQuestionId": "1264", "paidOnly": true, "title": "Page Recommendations", "titleSlug": "page-recommendations", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 43366, "totalSubmissionRaw": 66518}, "1265": {"acRate": 94.04894504025714, "difficulty": "Medium", "likes": 579, "dislikes": 103, "categoryTitle": "Algorithms", "frontendQuestionId": "1265", "paidOnly": true, "title": "Print Immutable Linked List in Reverse", "titleSlug": "print-immutable-linked-list-in-reverse", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 59106, "totalSubmissionRaw": 62846}, "1266": {"acRate": 82.46692797648211, "difficulty": "Easy", "likes": 2201, "dislikes": 228, "categoryTitle": "Algorithms", "frontendQuestionId": "1266", "paidOnly": false, "title": "Minimum Time Visiting All Points", "titleSlug": "minimum-time-visiting-all-points", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 235637, "totalSubmissionRaw": 285736}, "1267": {"acRate": 60.615182202376204, "difficulty": "Medium", "likes": 1301, "dislikes": 86, "categoryTitle": "Algorithms", "frontendQuestionId": "1267", "paidOnly": false, "title": "Count Servers that Communicate", "titleSlug": "count-servers-that-communicate", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 60814, "totalSubmissionRaw": 100328}, "1268": {"acRate": 65.10757453666398, "difficulty": "Medium", "likes": 4732, "dislikes": 241, "categoryTitle": "Algorithms", "frontendQuestionId": "1268", "paidOnly": false, "title": "Search Suggestions System", "titleSlug": "search-suggestions-system", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 323192, "totalSubmissionRaw": 496397}, "1269": {"acRate": 50.30295804112425, "difficulty": "Hard", "likes": 1548, "dislikes": 64, "categoryTitle": "Algorithms", "frontendQuestionId": "1269", "paidOnly": false, "title": "Number of Ways to Stay in the Same Place After Some Steps", "titleSlug": "number-of-ways-to-stay-in-the-same-place-after-some-steps", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 92816, "totalSubmissionRaw": 184514}, "1270": {"acRate": 84.73456641844822, "difficulty": "Medium", "likes": 422, "dislikes": 28, "categoryTitle": "Database", "frontendQuestionId": "1270", "paidOnly": true, "title": "All People Report to the Given Manager", "titleSlug": "all-people-report-to-the-given-manager", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 56440, "totalSubmissionRaw": 66608}, "1271": {"acRate": 58.113595476741196, "difficulty": "Easy", "likes": 78, "dislikes": 125, "categoryTitle": "Algorithms", "frontendQuestionId": "1271", "paidOnly": true, "title": "Hexspeak", "titleSlug": "hexspeak", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11306, "totalSubmissionRaw": 19455}, "1272": {"acRate": 66.24400028655347, "difficulty": "Medium", "likes": 462, "dislikes": 33, "categoryTitle": "Algorithms", "frontendQuestionId": "1272", "paidOnly": true, "title": "Remove Interval", "titleSlug": "remove-interval", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 36988, "totalSubmissionRaw": 55836}, "1273": {"acRate": 61.164934531149086, "difficulty": "Medium", "likes": 225, "dislikes": 64, "categoryTitle": "Algorithms", "frontendQuestionId": "1273", "paidOnly": true, "title": "Delete Tree Nodes", "titleSlug": "delete-tree-nodes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10417, "totalSubmissionRaw": 17031}, "1274": {"acRate": 68.65950927420297, "difficulty": "Hard", "likes": 526, "dislikes": 59, "categoryTitle": "Algorithms", "frontendQuestionId": "1274", "paidOnly": true, "title": "Number of Ships in a Rectangle", "titleSlug": "number-of-ships-in-a-rectangle", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 29354, "totalSubmissionRaw": 42753}, "1275": {"acRate": 53.9158765815467, "difficulty": "Easy", "likes": 1493, "dislikes": 348, "categoryTitle": "Algorithms", "frontendQuestionId": "1275", "paidOnly": false, "title": "Find Winner on a Tic Tac Toe Game", "titleSlug": "find-winner-on-a-tic-tac-toe-game", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 130567, "totalSubmissionRaw": 242168}, "1276": {"acRate": 51.17387904563919, "difficulty": "Medium", "likes": 331, "dislikes": 235, "categoryTitle": "Algorithms", "frontendQuestionId": "1276", "paidOnly": false, "title": "Number of Burgers with No Waste of Ingredients", "titleSlug": "number-of-burgers-with-no-waste-of-ingredients", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26832, "totalSubmissionRaw": 52433}, "1277": {"acRate": 75.44958425892399, "difficulty": "Medium", "likes": 4871, "dislikes": 82, "categoryTitle": "Algorithms", "frontendQuestionId": "1277", "paidOnly": false, "title": "Count Square Submatrices with All Ones", "titleSlug": "count-square-submatrices-with-all-ones", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 231299, "totalSubmissionRaw": 306561}, "1278": {"acRate": 61.132098841890134, "difficulty": "Hard", "likes": 1148, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "1278", "paidOnly": false, "title": "Palindrome Partitioning III", "titleSlug": "palindrome-partitioning-iii", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29613, "totalSubmissionRaw": 48441}, "1279": {"acRate": 72.88795686039545, "difficulty": "Easy", "likes": 75, "dislikes": 353, "categoryTitle": "Concurrency", "frontendQuestionId": "1279", "paidOnly": true, "title": "Traffic Light Controlled Intersection", "titleSlug": "traffic-light-controlled-intersection", "topicTags": [{"name": "Concurrency", "id": "VG9waWNUYWdOb2RlOjYxMDQ1", "slug": "concurrency"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14598, "totalSubmissionRaw": 20028}, "1280": {"acRate": 58.1613956044171, "difficulty": "Easy", "likes": 1781, "dislikes": 242, "categoryTitle": "Database", "frontendQuestionId": "1280", "paidOnly": false, "title": "Students and Examinations", "titleSlug": "students-and-examinations", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 297423, "totalSubmissionRaw": 511370}, "1281": {"acRate": 86.56121732212829, "difficulty": "Easy", "likes": 2575, "dislikes": 234, "categoryTitle": "Algorithms", "frontendQuestionId": "1281", "paidOnly": false, "title": "Subtract the Product and Sum of Digits of an Integer", "titleSlug": "subtract-the-product-and-sum-of-digits-of-an-integer", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 511408, "totalSubmissionRaw": 590805}, "1282": {"acRate": 87.43690638830488, "difficulty": "Medium", "likes": 3000, "dislikes": 708, "categoryTitle": "Algorithms", "frontendQuestionId": "1282", "paidOnly": false, "title": "Group the People Given the Group Size They Belong To", "titleSlug": "group-the-people-given-the-group-size-they-belong-to", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 213764, "totalSubmissionRaw": 244478}, "1283": {"acRate": 61.001811874341705, "difficulty": "Medium", "likes": 2933, "dislikes": 205, "categoryTitle": "Algorithms", "frontendQuestionId": "1283", "paidOnly": false, "title": "Find the Smallest Divisor Given a Threshold", "titleSlug": "find-the-smallest-divisor-given-a-threshold", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 209079, "totalSubmissionRaw": 342741}, "1284": {"acRate": 72.1263265567063, "difficulty": "Hard", "likes": 967, "dislikes": 100, "categoryTitle": "Algorithms", "frontendQuestionId": "1284", "paidOnly": false, "title": "Minimum Number of Flips to Convert Binary Matrix to Zero Matrix", "titleSlug": "minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 33846, "totalSubmissionRaw": 46926}, "1285": {"acRate": 82.28256624252266, "difficulty": "Medium", "likes": 561, "dislikes": 33, "categoryTitle": "Database", "frontendQuestionId": "1285", "paidOnly": true, "title": "Find the Start and End Number of Continuous Ranges", "titleSlug": "find-the-start-and-end-number-of-continuous-ranges", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 40028, "totalSubmissionRaw": 48647}, "1286": {"acRate": 73.3039237989733, "difficulty": "Medium", "likes": 1363, "dislikes": 105, "categoryTitle": "Algorithms", "frontendQuestionId": "1286", "paidOnly": false, "title": "Iterator for Combination", "titleSlug": "iterator-for-combination", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Iterator", "id": "VG9waWNUYWdOb2RlOjYxMDY0", "slug": "iterator"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 74111, "totalSubmissionRaw": 101101}, "1287": {"acRate": 60.99271319247538, "difficulty": "Easy", "likes": 1704, "dislikes": 78, "categoryTitle": "Algorithms", "frontendQuestionId": "1287", "paidOnly": false, "title": "Element Appearing More Than 25% In Sorted Array", "titleSlug": "element-appearing-more-than-25-in-sorted-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 220055, "totalSubmissionRaw": 360789}, "1288": {"acRate": 56.313443750948636, "difficulty": "Medium", "likes": 2229, "dislikes": 60, "categoryTitle": "Algorithms", "frontendQuestionId": "1288", "paidOnly": false, "title": "Remove Covered Intervals", "titleSlug": "remove-covered-intervals", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 122435, "totalSubmissionRaw": 217417}, "1289": {"acRate": 64.31513029185018, "difficulty": "Hard", "likes": 2253, "dislikes": 123, "categoryTitle": "Algorithms", "frontendQuestionId": "1289", "paidOnly": false, "title": "Minimum Falling Path Sum II", "titleSlug": "minimum-falling-path-sum-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 143990, "totalSubmissionRaw": 223882}, "1290": {"acRate": 81.11951548578422, "difficulty": "Easy", "likes": 4161, "dislikes": 159, "categoryTitle": "Algorithms", "frontendQuestionId": "1290", "paidOnly": false, "title": "Convert Binary Number in a Linked List to Integer", "titleSlug": "convert-binary-number-in-a-linked-list-to-integer", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 491825, "totalSubmissionRaw": 606297}, "1291": {"acRate": 65.27911503218792, "difficulty": "Medium", "likes": 2861, "dislikes": 175, "categoryTitle": "Algorithms", "frontendQuestionId": "1291", "paidOnly": false, "title": "Sequential Digits", "titleSlug": "sequential-digits", "topicTags": [{"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 220349, "totalSubmissionRaw": 337549}, "1292": {"acRate": 53.61003228674372, "difficulty": "Medium", "likes": 1083, "dislikes": 93, "categoryTitle": "Algorithms", "frontendQuestionId": "1292", "paidOnly": false, "title": "Maximum Side Length of a Square with Sum Less than or Equal to Threshold", "titleSlug": "maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34371, "totalSubmissionRaw": 64113}, "1293": {"acRate": 45.30011253695243, "difficulty": "Hard", "likes": 4519, "dislikes": 84, "categoryTitle": "Algorithms", "frontendQuestionId": "1293", "paidOnly": false, "title": "Shortest Path in a Grid with Obstacles Elimination", "titleSlug": "shortest-path-in-a-grid-with-obstacles-elimination", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 215759, "totalSubmissionRaw": 476288}, "1294": {"acRate": 66.74267585386407, "difficulty": "Easy", "likes": 140, "dislikes": 30, "categoryTitle": "Database", "frontendQuestionId": "1294", "paidOnly": true, "title": "Weather Type in Each Country", "titleSlug": "weather-type-in-each-country", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 40392, "totalSubmissionRaw": 60519}, "1295": {"acRate": 77.39963346887349, "difficulty": "Easy", "likes": 2390, "dislikes": 129, "categoryTitle": "Algorithms", "frontendQuestionId": "1295", "paidOnly": false, "title": "Find Numbers with Even Number of Digits", "titleSlug": "find-numbers-with-even-number-of-digits", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 702766, "totalSubmissionRaw": 907971}, "1296": {"acRate": 58.51285287162461, "difficulty": "Medium", "likes": 1864, "dislikes": 113, "categoryTitle": "Algorithms", "frontendQuestionId": "1296", "paidOnly": false, "title": "Divide Array in Sets of K Consecutive Numbers", "titleSlug": "divide-array-in-sets-of-k-consecutive-numbers", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 99221, "totalSubmissionRaw": 169570}, "1297": {"acRate": 52.11521909965199, "difficulty": "Medium", "likes": 1088, "dislikes": 405, "categoryTitle": "Algorithms", "frontendQuestionId": "1297", "paidOnly": false, "title": "Maximum Number of Occurrences of a Substring", "titleSlug": "maximum-number-of-occurrences-of-a-substring", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 55707, "totalSubmissionRaw": 106892}, "1298": {"acRate": 57.86771964461994, "difficulty": "Hard", "likes": 344, "dislikes": 146, "categoryTitle": "Algorithms", "frontendQuestionId": "1298", "paidOnly": false, "title": "Maximum Candies You Can Get from Boxes", "titleSlug": "maximum-candies-you-can-get-from-boxes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17586, "totalSubmissionRaw": 30390}, "1299": {"acRate": 71.25024774200855, "difficulty": "Easy", "likes": 2597, "dislikes": 245, "categoryTitle": "Algorithms", "frontendQuestionId": "1299", "paidOnly": false, "title": "Replace Elements with Greatest Element on Right Side", "titleSlug": "replace-elements-with-greatest-element-on-right-side", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 402638, "totalSubmissionRaw": 565104}, "1300": {"acRate": 44.65384658815027, "difficulty": "Medium", "likes": 1146, "dislikes": 149, "categoryTitle": "Algorithms", "frontendQuestionId": "1300", "paidOnly": false, "title": "Sum of Mutated Array Closest to Target", "titleSlug": "sum-of-mutated-array-closest-to-target", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 39545, "totalSubmissionRaw": 88559}, "1301": {"acRate": 39.73692346608955, "difficulty": "Hard", "likes": 515, "dislikes": 24, "categoryTitle": "Algorithms", "frontendQuestionId": "1301", "paidOnly": false, "title": "Number of Paths with Max Score", "titleSlug": "number-of-paths-with-max-score", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14138, "totalSubmissionRaw": 35579}, "1302": {"acRate": 86.32733543830284, "difficulty": "Medium", "likes": 4700, "dislikes": 123, "categoryTitle": "Algorithms", "frontendQuestionId": "1302", "paidOnly": false, "title": "Deepest Leaves Sum", "titleSlug": "deepest-leaves-sum", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 340393, "totalSubmissionRaw": 394305}, "1303": {"acRate": 89.54499266117195, "difficulty": "Easy", "likes": 333, "dislikes": 16, "categoryTitle": "Database", "frontendQuestionId": "1303", "paidOnly": true, "title": "Find the Team Size", "titleSlug": "find-the-team-size", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 71379, "totalSubmissionRaw": 79713}, "1304": {"acRate": 76.1765413972351, "difficulty": "Easy", "likes": 1993, "dislikes": 599, "categoryTitle": "Algorithms", "frontendQuestionId": "1304", "paidOnly": false, "title": "Find N Unique Integers Sum up to Zero", "titleSlug": "find-n-unique-integers-sum-up-to-zero", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 224650, "totalSubmissionRaw": 294907}, "1305": {"acRate": 79.83298658646574, "difficulty": "Medium", "likes": 3067, "dislikes": 94, "categoryTitle": "Algorithms", "frontendQuestionId": "1305", "paidOnly": false, "title": "All Elements in Two Binary Search Trees", "titleSlug": "all-elements-in-two-binary-search-trees", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 222176, "totalSubmissionRaw": 278301}, "1306": {"acRate": 65.13393695451613, "difficulty": "Medium", "likes": 4150, "dislikes": 104, "categoryTitle": "Algorithms", "frontendQuestionId": "1306", "paidOnly": false, "title": "Jump Game III", "titleSlug": "jump-game-iii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 239334, "totalSubmissionRaw": 367448}, "1307": {"acRate": 34.59418776857899, "difficulty": "Hard", "likes": 504, "dislikes": 129, "categoryTitle": "Algorithms", "frontendQuestionId": "1307", "paidOnly": false, "title": "Verbal Arithmetic Puzzle", "titleSlug": "verbal-arithmetic-puzzle", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14249, "totalSubmissionRaw": 41189}, "1308": {"acRate": 86.41412880678982, "difficulty": "Medium", "likes": 215, "dislikes": 63, "categoryTitle": "Database", "frontendQuestionId": "1308", "paidOnly": true, "title": "Running Total for Different Genders", "titleSlug": "running-total-for-different-genders", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 41541, "totalSubmissionRaw": 48072}, "1309": {"acRate": 79.8107963256098, "difficulty": "Easy", "likes": 1540, "dislikes": 110, "categoryTitle": "Algorithms", "frontendQuestionId": "1309", "paidOnly": false, "title": "Decrypt String from Alphabet to Integer Mapping", "titleSlug": "decrypt-string-from-alphabet-to-integer-mapping", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 128064, "totalSubmissionRaw": 160460}, "1310": {"acRate": 73.21110909420948, "difficulty": "Medium", "likes": 1499, "dislikes": 37, "categoryTitle": "Algorithms", "frontendQuestionId": "1310", "paidOnly": false, "title": "XOR Queries of a Subarray", "titleSlug": "xor-queries-of-a-subarray", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 60498, "totalSubmissionRaw": 82635}, "1311": {"acRate": 47.66056433920872, "difficulty": "Medium", "likes": 403, "dislikes": 422, "categoryTitle": "Algorithms", "frontendQuestionId": "1311", "paidOnly": false, "title": "Get Watched Videos by Your Friends", "titleSlug": "get-watched-videos-by-your-friends", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25201, "totalSubmissionRaw": 52876}, "1312": {"acRate": 71.1879196165248, "difficulty": "Hard", "likes": 5063, "dislikes": 66, "categoryTitle": "Algorithms", "frontendQuestionId": "1312", "paidOnly": false, "title": "Minimum Insertion Steps to Make a String Palindrome", "titleSlug": "minimum-insertion-steps-to-make-a-string-palindrome", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 186827, "totalSubmissionRaw": 262441}, "1313": {"acRate": 85.80935099079493, "difficulty": "Easy", "likes": 1271, "dislikes": 1318, "categoryTitle": "Algorithms", "frontendQuestionId": "1313", "paidOnly": false, "title": "Decompress Run-Length Encoded List", "titleSlug": "decompress-run-length-encoded-list", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 272854, "totalSubmissionRaw": 317977}, "1314": {"acRate": 75.58994713406601, "difficulty": "Medium", "likes": 2396, "dislikes": 377, "categoryTitle": "Algorithms", "frontendQuestionId": "1314", "paidOnly": false, "title": "Matrix Block Sum", "titleSlug": "matrix-block-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 90652, "totalSubmissionRaw": 119926}, "1315": {"acRate": 85.58705679415566, "difficulty": "Medium", "likes": 2751, "dislikes": 76, "categoryTitle": "Algorithms", "frontendQuestionId": "1315", "paidOnly": false, "title": "Sum of Nodes with Even-Valued Grandparent", "titleSlug": "sum-of-nodes-with-even-valued-grandparent", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 158277, "totalSubmissionRaw": 184931}, "1316": {"acRate": 50.79215778489756, "difficulty": "Hard", "likes": 317, "dislikes": 204, "categoryTitle": "Algorithms", "frontendQuestionId": "1316", "paidOnly": false, "title": "Distinct Echo Substrings", "titleSlug": "distinct-echo-substrings", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17280, "totalSubmissionRaw": 34021}, "1317": {"acRate": 53.96881841113914, "difficulty": "Easy", "likes": 413, "dislikes": 314, "categoryTitle": "Algorithms", "frontendQuestionId": "1317", "paidOnly": false, "title": "Convert Integer to the Sum of Two No-Zero Integers", "titleSlug": "convert-integer-to-the-sum-of-two-no-zero-integers", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 48566, "totalSubmissionRaw": 89989}, "1318": {"acRate": 71.13588222834146, "difficulty": "Medium", "likes": 1985, "dislikes": 100, "categoryTitle": "Algorithms", "frontendQuestionId": "1318", "paidOnly": false, "title": "Minimum Flips to Make a OR b Equal to c", "titleSlug": "minimum-flips-to-make-a-or-b-equal-to-c", "topicTags": [{"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 134333, "totalSubmissionRaw": 188840}, "1319": {"acRate": 63.22503790340047, "difficulty": "Medium", "likes": 5044, "dislikes": 72, "categoryTitle": "Algorithms", "frontendQuestionId": "1319", "paidOnly": false, "title": "Number of Operations to Make Network Connected", "titleSlug": "number-of-operations-to-make-network-connected", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 233527, "totalSubmissionRaw": 369359}, "1320": {"acRate": 59.08349671106876, "difficulty": "Hard", "likes": 1003, "dislikes": 38, "categoryTitle": "Algorithms", "frontendQuestionId": "1320", "paidOnly": false, "title": "Minimum Distance to Type a Word Using Two Fingers", "titleSlug": "minimum-distance-to-type-a-word-using-two-fingers", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 32246, "totalSubmissionRaw": 54577}, "1321": {"acRate": 52.355987594134156, "difficulty": "Medium", "likes": 785, "dislikes": 293, "categoryTitle": "Database", "frontendQuestionId": "1321", "paidOnly": false, "title": "Restaurant Growth", "titleSlug": "restaurant-growth", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 106857, "totalSubmissionRaw": 204097}, "1322": {"acRate": 59.2898733661794, "difficulty": "Easy", "likes": 260, "dislikes": 64, "categoryTitle": "Database", "frontendQuestionId": "1322", "paidOnly": true, "title": "Ads Performance", "titleSlug": "ads-performance", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 43683, "totalSubmissionRaw": 73677}, "1323": {"acRate": 82.39626952047946, "difficulty": "Easy", "likes": 2797, "dislikes": 218, "categoryTitle": "Algorithms", "frontendQuestionId": "1323", "paidOnly": false, "title": "Maximum 69 Number", "titleSlug": "maximum-69-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 271939, "totalSubmissionRaw": 330038}, "1324": {"acRate": 64.4924439016944, "difficulty": "Medium", "likes": 784, "dislikes": 117, "categoryTitle": "Algorithms", "frontendQuestionId": "1324", "paidOnly": false, "title": "Print Words Vertically", "titleSlug": "print-words-vertically", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 42249, "totalSubmissionRaw": 65510}, "1325": {"acRate": 77.44701411274329, "difficulty": "Medium", "likes": 2747, "dislikes": 54, "categoryTitle": "Algorithms", "frontendQuestionId": "1325", "paidOnly": false, "title": "Delete Leaves With a Given Value", "titleSlug": "delete-leaves-with-a-given-value", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 214788, "totalSubmissionRaw": 277336}, "1326": {"acRate": 50.81151753779568, "difficulty": "Hard", "likes": 3406, "dislikes": 197, "categoryTitle": "Algorithms", "frontendQuestionId": "1326", "paidOnly": false, "title": "Minimum Number of Taps to Open to Water a Garden", "titleSlug": "minimum-number-of-taps-to-open-to-water-a-garden", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 135244, "totalSubmissionRaw": 266168}, "1327": {"acRate": 71.02694813547042, "difficulty": "Easy", "likes": 374, "dislikes": 35, "categoryTitle": "Database", "frontendQuestionId": "1327", "paidOnly": false, "title": "List the Products Ordered in a Period", "titleSlug": "list-the-products-ordered-in-a-period", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 135287, "totalSubmissionRaw": 190474}, "1328": {"acRate": 51.7138845048278, "difficulty": "Medium", "likes": 2336, "dislikes": 747, "categoryTitle": "Algorithms", "frontendQuestionId": "1328", "paidOnly": false, "title": "Break a Palindrome", "titleSlug": "break-a-palindrome", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 172351, "totalSubmissionRaw": 333277}, "1329": {"acRate": 82.90122229951307, "difficulty": "Medium", "likes": 3395, "dislikes": 231, "categoryTitle": "Algorithms", "frontendQuestionId": "1329", "paidOnly": false, "title": "Sort the Matrix Diagonally", "titleSlug": "sort-the-matrix-diagonally", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 166847, "totalSubmissionRaw": 201260}, "1330": {"acRate": 41.77334591025468, "difficulty": "Hard", "likes": 479, "dislikes": 54, "categoryTitle": "Algorithms", "frontendQuestionId": "1330", "paidOnly": false, "title": "Reverse Subarray To Maximize Array Value", "titleSlug": "reverse-subarray-to-maximize-array-value", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6200, "totalSubmissionRaw": 14842}, "1331": {"acRate": 62.533111816353504, "difficulty": "Easy", "likes": 1702, "dislikes": 90, "categoryTitle": "Algorithms", "frontendQuestionId": "1331", "paidOnly": false, "title": "Rank Transform of an Array", "titleSlug": "rank-transform-of-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 121575, "totalSubmissionRaw": 194417}, "1332": {"acRate": 76.49154051647373, "difficulty": "Easy", "likes": 1665, "dislikes": 1768, "categoryTitle": "Algorithms", "frontendQuestionId": "1332", "paidOnly": false, "title": "Remove Palindromic Subsequences", "titleSlug": "remove-palindromic-subsequences", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 136581, "totalSubmissionRaw": 178557}, "1333": {"acRate": 61.619690194825935, "difficulty": "Medium", "likes": 306, "dislikes": 224, "categoryTitle": "Algorithms", "frontendQuestionId": "1333", "paidOnly": false, "title": "Filter Restaurants by Vegan-Friendly, Price and Distance", "titleSlug": "filter-restaurants-by-vegan-friendly-price-and-distance", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30869, "totalSubmissionRaw": 50096}, "1334": {"acRate": 68.25105255457841, "difficulty": "Medium", "likes": 3170, "dislikes": 139, "categoryTitle": "Algorithms", "frontendQuestionId": "1334", "paidOnly": false, "title": "Find the City With the Smallest Number of Neighbors at a Threshold Distance", "titleSlug": "find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 209930, "totalSubmissionRaw": 307585}, "1335": {"acRate": 59.5859402207198, "difficulty": "Hard", "likes": 3416, "dislikes": 318, "categoryTitle": "Algorithms", "frontendQuestionId": "1335", "paidOnly": false, "title": "Minimum Difficulty of a Job Schedule", "titleSlug": "minimum-difficulty-of-a-job-schedule", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 198476, "totalSubmissionRaw": 333092}, "1336": {"acRate": 47.591522157996145, "difficulty": "Hard", "likes": 92, "dislikes": 316, "categoryTitle": "Database", "frontendQuestionId": "1336", "paidOnly": true, "title": "Number of Transactions per Visit", "titleSlug": "number-of-transactions-per-visit", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12844, "totalSubmissionRaw": 26988}, "1337": {"acRate": 73.58853670162058, "difficulty": "Easy", "likes": 4176, "dislikes": 233, "categoryTitle": "Algorithms", "frontendQuestionId": "1337", "paidOnly": false, "title": "The K Weakest Rows in a Matrix", "titleSlug": "the-k-weakest-rows-in-a-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 370533, "totalSubmissionRaw": 503520}, "1338": {"acRate": 68.95979099935381, "difficulty": "Medium", "likes": 3258, "dislikes": 150, "categoryTitle": "Algorithms", "frontendQuestionId": "1338", "paidOnly": false, "title": "Reduce Array Size to The Half", "titleSlug": "reduce-array-size-to-the-half", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 198498, "totalSubmissionRaw": 287846}, "1339": {"acRate": 47.7095980187853, "difficulty": "Medium", "likes": 3011, "dislikes": 104, "categoryTitle": "Algorithms", "frontendQuestionId": "1339", "paidOnly": false, "title": "Maximum Product of Splitted Binary Tree", "titleSlug": "maximum-product-of-splitted-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 126377, "totalSubmissionRaw": 264888}, "1340": {"acRate": 63.49712463702101, "difficulty": "Hard", "likes": 1108, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "1340", "paidOnly": false, "title": "Jump Game V", "titleSlug": "jump-game-v", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33454, "totalSubmissionRaw": 52687}, "1341": {"acRate": 40.22876408877495, "difficulty": "Medium", "likes": 596, "dislikes": 188, "categoryTitle": "Database", "frontendQuestionId": "1341", "paidOnly": false, "title": "Movie Rating", "titleSlug": "movie-rating", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 115496, "totalSubmissionRaw": 287100}, "1342": {"acRate": 85.26388078820253, "difficulty": "Easy", "likes": 3966, "dislikes": 170, "categoryTitle": "Algorithms", "frontendQuestionId": "1342", "paidOnly": false, "title": "Number of Steps to Reduce a Number to Zero", "titleSlug": "number-of-steps-to-reduce-a-number-to-zero", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 700238, "totalSubmissionRaw": 821260}, "1343": {"acRate": 68.76684985483202, "difficulty": "Medium", "likes": 1600, "dislikes": 104, "categoryTitle": "Algorithms", "frontendQuestionId": "1343", "paidOnly": false, "title": "Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold", "titleSlug": "number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 106110, "totalSubmissionRaw": 154304}, "1344": {"acRate": 63.8781654156896, "difficulty": "Medium", "likes": 1316, "dislikes": 240, "categoryTitle": "Algorithms", "frontendQuestionId": "1344", "paidOnly": false, "title": "Angle Between Hands of a Clock", "titleSlug": "angle-between-hands-of-a-clock", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 124763, "totalSubmissionRaw": 195314}, "1345": {"acRate": 46.17606070234272, "difficulty": "Hard", "likes": 3739, "dislikes": 129, "categoryTitle": "Algorithms", "frontendQuestionId": "1345", "paidOnly": false, "title": "Jump Game IV", "titleSlug": "jump-game-iv", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 146784, "totalSubmissionRaw": 317879}, "1346": {"acRate": 37.3828169380254, "difficulty": "Easy", "likes": 1926, "dislikes": 207, "categoryTitle": "Algorithms", "frontendQuestionId": "1346", "paidOnly": false, "title": "Check If N and Its Double Exist", "titleSlug": "check-if-n-and-its-double-exist", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 365229, "totalSubmissionRaw": 976997}, "1347": {"acRate": 82.06074613222029, "difficulty": "Medium", "likes": 2715, "dislikes": 118, "categoryTitle": "Algorithms", "frontendQuestionId": "1347", "paidOnly": false, "title": "Minimum Number of Steps to Make Two Strings Anagram", "titleSlug": "minimum-number-of-steps-to-make-two-strings-anagram", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 285468, "totalSubmissionRaw": 347874}, "1348": {"acRate": 44.66920355163896, "difficulty": "Medium", "likes": 193, "dislikes": 299, "categoryTitle": "Algorithms", "frontendQuestionId": "1348", "paidOnly": false, "title": "Tweet Counts Per Frequency", "titleSlug": "tweet-counts-per-frequency", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33455, "totalSubmissionRaw": 74895}, "1349": {"acRate": 50.76117982873454, "difficulty": "Hard", "likes": 829, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "1349", "paidOnly": false, "title": "Maximum Students Taking Exam", "titleSlug": "maximum-students-taking-exam", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17072, "totalSubmissionRaw": 33632}, "1350": {"acRate": 89.72805410736932, "difficulty": "Easy", "likes": 177, "dislikes": 9, "categoryTitle": "Database", "frontendQuestionId": "1350", "paidOnly": true, "title": "Students With Invalid Departments", "titleSlug": "students-with-invalid-departments", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 57312, "totalSubmissionRaw": 63873}, "1351": {"acRate": 77.40668643068899, "difficulty": "Easy", "likes": 4973, "dislikes": 132, "categoryTitle": "Algorithms", "frontendQuestionId": "1351", "paidOnly": false, "title": "Count Negative Numbers in a Sorted Matrix", "titleSlug": "count-negative-numbers-in-a-sorted-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 433431, "totalSubmissionRaw": 559940}, "1352": {"acRate": 51.76460505642051, "difficulty": "Medium", "likes": 1483, "dislikes": 73, "categoryTitle": "Algorithms", "frontendQuestionId": "1352", "paidOnly": false, "title": "Product of the Last K Numbers", "titleSlug": "product-of-the-last-k-numbers", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Data Stream", "id": "VG9waWNUYWdOb2RlOjYxMDYz", "slug": "data-stream"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 90601, "totalSubmissionRaw": 175025}, "1353": {"acRate": 32.47756756278427, "difficulty": "Medium", "likes": 3045, "dislikes": 426, "categoryTitle": "Algorithms", "frontendQuestionId": "1353", "paidOnly": false, "title": "Maximum Number of Events That Can Be Attended", "titleSlug": "maximum-number-of-events-that-can-be-attended", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 91754, "totalSubmissionRaw": 282515}, "1354": {"acRate": 36.202727066622046, "difficulty": "Hard", "likes": 2038, "dislikes": 166, "categoryTitle": "Algorithms", "frontendQuestionId": "1354", "paidOnly": false, "title": "Construct Target Array With Multiple Sums", "titleSlug": "construct-target-array-with-multiple-sums", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 67067, "totalSubmissionRaw": 185254}, "1355": {"acRate": 72.40350370584272, "difficulty": "Medium", "likes": 147, "dislikes": 48, "categoryTitle": "Database", "frontendQuestionId": "1355", "paidOnly": true, "title": "Activity Participants", "titleSlug": "activity-participants", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 30088, "totalSubmissionRaw": 41556}, "1356": {"acRate": 78.30730886829328, "difficulty": "Easy", "likes": 2455, "dislikes": 120, "categoryTitle": "Algorithms", "frontendQuestionId": "1356", "paidOnly": false, "title": "Sort Integers by The Number of 1 Bits", "titleSlug": "sort-integers-by-the-number-of-1-bits", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 229987, "totalSubmissionRaw": 293698}, "1357": {"acRate": 71.22924815966982, "difficulty": "Medium", "likes": 194, "dislikes": 228, "categoryTitle": "Algorithms", "frontendQuestionId": "1357", "paidOnly": false, "title": "Apply Discount Every n Orders", "titleSlug": "apply-discount-every-n-orders", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23125, "totalSubmissionRaw": 32466}, "1358": {"acRate": 67.58548704047887, "difficulty": "Medium", "likes": 3265, "dislikes": 56, "categoryTitle": "Algorithms", "frontendQuestionId": "1358", "paidOnly": false, "title": "Number of Substrings Containing All Three Characters", "titleSlug": "number-of-substrings-containing-all-three-characters", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 126910, "totalSubmissionRaw": 187777}, "1359": {"acRate": 64.99569246834616, "difficulty": "Hard", "likes": 3036, "dislikes": 228, "categoryTitle": "Algorithms", "frontendQuestionId": "1359", "paidOnly": false, "title": "Count All Valid Pickup and Delivery Options", "titleSlug": "count-all-valid-pickup-and-delivery-options", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 124483, "totalSubmissionRaw": 191525}, "1360": {"acRate": 50.18159525158605, "difficulty": "Easy", "likes": 371, "dislikes": 1280, "categoryTitle": "Algorithms", "frontendQuestionId": "1360", "paidOnly": false, "title": "Number of Days Between Two Dates", "titleSlug": "number-of-days-between-two-dates", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 54024, "totalSubmissionRaw": 107657}, "1361": {"acRate": 43.83259663736156, "difficulty": "Medium", "likes": 2132, "dislikes": 509, "categoryTitle": "Algorithms", "frontendQuestionId": "1361", "paidOnly": false, "title": "Validate Binary Tree Nodes", "titleSlug": "validate-binary-tree-nodes", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 116717, "totalSubmissionRaw": 266279}, "1362": {"acRate": 60.911812595199336, "difficulty": "Medium", "likes": 322, "dislikes": 95, "categoryTitle": "Algorithms", "frontendQuestionId": "1362", "paidOnly": false, "title": "Closest Divisors", "titleSlug": "closest-divisors", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23194, "totalSubmissionRaw": 38078}, "1363": {"acRate": 32.67366902583059, "difficulty": "Hard", "likes": 603, "dislikes": 87, "categoryTitle": "Algorithms", "frontendQuestionId": "1363", "paidOnly": false, "title": "Largest Multiple of Three", "titleSlug": "largest-multiple-of-three", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21744, "totalSubmissionRaw": 66549}, "1364": {"acRate": 75.00182628387758, "difficulty": "Medium", "likes": 88, "dislikes": 387, "categoryTitle": "Database", "frontendQuestionId": "1364", "paidOnly": true, "title": "Number of Trusted Contacts of a Customer", "titleSlug": "number-of-trusted-contacts-of-a-customer", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 20534, "totalSubmissionRaw": 27378}, "1365": {"acRate": 86.89826772025839, "difficulty": "Easy", "likes": 5473, "dislikes": 136, "categoryTitle": "Algorithms", "frontendQuestionId": "1365", "paidOnly": false, "title": "How Many Numbers Are Smaller Than the Current Number", "titleSlug": "how-many-numbers-are-smaller-than-the-current-number", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 588124, "totalSubmissionRaw": 676796}, "1366": {"acRate": 58.55305515528711, "difficulty": "Medium", "likes": 1456, "dislikes": 168, "categoryTitle": "Algorithms", "frontendQuestionId": "1366", "paidOnly": false, "title": "Rank Teams by Votes", "titleSlug": "rank-teams-by-votes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 76391, "totalSubmissionRaw": 130466}, "1367": {"acRate": 44.02378113258488, "difficulty": "Medium", "likes": 2245, "dislikes": 67, "categoryTitle": "Algorithms", "frontendQuestionId": "1367", "paidOnly": false, "title": "Linked List in Binary Tree", "titleSlug": "linked-list-in-binary-tree", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 78269, "totalSubmissionRaw": 177788}, "1368": {"acRate": 62.32466708941027, "difficulty": "Hard", "likes": 1768, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "1368", "paidOnly": false, "title": "Minimum Cost to Make at Least One Valid Path in a Grid", "titleSlug": "minimum-cost-to-make-at-least-one-valid-path-in-a-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 49143, "totalSubmissionRaw": 78850}, "1369": {"acRate": 67.65684628301022, "difficulty": "Hard", "likes": 161, "dislikes": 13, "categoryTitle": "Database", "frontendQuestionId": "1369", "paidOnly": true, "title": "Get the Second Most Recent Activity", "titleSlug": "get-the-second-most-recent-activity", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22161, "totalSubmissionRaw": 32755}, "1370": {"acRate": 76.55384907091391, "difficulty": "Easy", "likes": 781, "dislikes": 865, "categoryTitle": "Algorithms", "frontendQuestionId": "1370", "paidOnly": false, "title": "Increasing Decreasing String", "titleSlug": "increasing-decreasing-string", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 80749, "totalSubmissionRaw": 105480}, "1371": {"acRate": 64.14569657184536, "difficulty": "Medium", "likes": 1629, "dislikes": 60, "categoryTitle": "Algorithms", "frontendQuestionId": "1371", "paidOnly": false, "title": "Find the Longest Substring Containing Vowels in Even Counts", "titleSlug": "find-the-longest-substring-containing-vowels-in-even-counts", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28142, "totalSubmissionRaw": 43872}, "1372": {"acRate": 65.92471262686828, "difficulty": "Medium", "likes": 3461, "dislikes": 75, "categoryTitle": "Algorithms", "frontendQuestionId": "1372", "paidOnly": false, "title": "Longest ZigZag Path in a Binary Tree", "titleSlug": "longest-zigzag-path-in-a-binary-tree", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 180312, "totalSubmissionRaw": 273512}, "1373": {"acRate": 41.74258834522596, "difficulty": "Hard", "likes": 2667, "dislikes": 182, "categoryTitle": "Algorithms", "frontendQuestionId": "1373", "paidOnly": false, "title": "Maximum Sum BST in Binary Tree", "titleSlug": "maximum-sum-bst-in-binary-tree", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 78623, "totalSubmissionRaw": 188350}, "1374": {"acRate": 77.95972702267059, "difficulty": "Easy", "likes": 485, "dislikes": 1275, "categoryTitle": "Algorithms", "frontendQuestionId": "1374", "paidOnly": false, "title": "Generate a String With Characters That Have Odd Counts", "titleSlug": "generate-a-string-with-characters-that-have-odd-counts", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 97215, "totalSubmissionRaw": 124699}, "1375": {"acRate": 65.76884028720659, "difficulty": "Medium", "likes": 942, "dislikes": 138, "categoryTitle": "Algorithms", "frontendQuestionId": "1375", "paidOnly": false, "title": "Number of Times Binary String Is Prefix-Aligned", "titleSlug": "number-of-times-binary-string-is-prefix-aligned", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 53768, "totalSubmissionRaw": 81753}, "1376": {"acRate": 60.03753156924142, "difficulty": "Medium", "likes": 4090, "dislikes": 300, "categoryTitle": "Algorithms", "frontendQuestionId": "1376", "paidOnly": false, "title": "Time Needed to Inform All Employees", "titleSlug": "time-needed-to-inform-all-employees", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 222032, "totalSubmissionRaw": 369822}, "1377": {"acRate": 35.529371389349656, "difficulty": "Hard", "likes": 790, "dislikes": 145, "categoryTitle": "Algorithms", "frontendQuestionId": "1377", "paidOnly": false, "title": "Frog Position After T Seconds", "titleSlug": "frog-position-after-t-seconds", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 31058, "totalSubmissionRaw": 87415}, "1378": {"acRate": 83.18900585428337, "difficulty": "Easy", "likes": 1250, "dislikes": 114, "categoryTitle": "Database", "frontendQuestionId": "1378", "paidOnly": false, "title": "Replace Employee ID With The Unique Identifier", "titleSlug": "replace-employee-id-with-the-unique-identifier", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 553323, "totalSubmissionRaw": 665141}, "1379": {"acRate": 85.8889947836715, "difficulty": "Easy", "likes": 1750, "dislikes": 2004, "categoryTitle": "Algorithms", "frontendQuestionId": "1379", "paidOnly": false, "title": "Find a Corresponding Node of a Binary Tree in a Clone of That Tree", "titleSlug": "find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 236114, "totalSubmissionRaw": 274906}, "1380": {"acRate": 79.89978906335152, "difficulty": "Easy", "likes": 2181, "dislikes": 113, "categoryTitle": "Algorithms", "frontendQuestionId": "1380", "paidOnly": false, "title": "Lucky Numbers in a Matrix", "titleSlug": "lucky-numbers-in-a-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 249241, "totalSubmissionRaw": 311942}, "1381": {"acRate": 77.18404087895011, "difficulty": "Medium", "likes": 1824, "dislikes": 97, "categoryTitle": "Algorithms", "frontendQuestionId": "1381", "paidOnly": false, "title": "Design a Stack With Increment Operation", "titleSlug": "design-a-stack-with-increment-operation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 117214, "totalSubmissionRaw": 151863}, "1382": {"acRate": 84.67436867395972, "difficulty": "Medium", "likes": 3647, "dislikes": 90, "categoryTitle": "Algorithms", "frontendQuestionId": "1382", "paidOnly": false, "title": "Balance a Binary Search Tree", "titleSlug": "balance-a-binary-search-tree", "topicTags": [{"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 256742, "totalSubmissionRaw": 303211}, "1383": {"acRate": 47.70101309612058, "difficulty": "Hard", "likes": 3102, "dislikes": 83, "categoryTitle": "Algorithms", "frontendQuestionId": "1383", "paidOnly": false, "title": "Maximum Performance of a Team", "titleSlug": "maximum-performance-of-a-team", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 96523, "totalSubmissionRaw": 202350}, "1384": {"acRate": 61.241364104071735, "difficulty": "Hard", "likes": 228, "dislikes": 129, "categoryTitle": "Database", "frontendQuestionId": "1384", "paidOnly": true, "title": "Total Sales Amount by Year", "titleSlug": "total-sales-amount-by-year", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16665, "totalSubmissionRaw": 27212}, "1385": {"acRate": 68.84462558611966, "difficulty": "Easy", "likes": 911, "dislikes": 3053, "categoryTitle": "Algorithms", "frontendQuestionId": "1385", "paidOnly": false, "title": "Find the Distance Value Between Two Arrays", "titleSlug": "find-the-distance-value-between-two-arrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 107768, "totalSubmissionRaw": 156538}, "1386": {"acRate": 42.19873185948732, "difficulty": "Medium", "likes": 905, "dislikes": 398, "categoryTitle": "Algorithms", "frontendQuestionId": "1386", "paidOnly": false, "title": "Cinema Seat Allocation", "titleSlug": "cinema-seat-allocation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 49781, "totalSubmissionRaw": 117968}, "1387": {"acRate": 70.1433485392031, "difficulty": "Medium", "likes": 1449, "dislikes": 115, "categoryTitle": "Algorithms", "frontendQuestionId": "1387", "paidOnly": false, "title": "Sort Integers by The Power Value", "titleSlug": "sort-integers-by-the-power-value", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 95026, "totalSubmissionRaw": 135474}, "1388": {"acRate": 52.18442377240993, "difficulty": "Hard", "likes": 1063, "dislikes": 18, "categoryTitle": "Algorithms", "frontendQuestionId": "1388", "paidOnly": false, "title": "Pizza With 3n Slices", "titleSlug": "pizza-with-3n-slices", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26983, "totalSubmissionRaw": 51707}, "1389": {"acRate": 85.95501696751742, "difficulty": "Easy", "likes": 2050, "dislikes": 1869, "categoryTitle": "Algorithms", "frontendQuestionId": "1389", "paidOnly": false, "title": "Create Target Array in the Given Order", "titleSlug": "create-target-array-in-the-given-order", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 258610, "totalSubmissionRaw": 300867}, "1390": {"acRate": 43.10854221867893, "difficulty": "Medium", "likes": 415, "dislikes": 190, "categoryTitle": "Algorithms", "frontendQuestionId": "1390", "paidOnly": false, "title": "Four Divisors", "titleSlug": "four-divisors", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 36769, "totalSubmissionRaw": 85294}, "1391": {"acRate": 48.14180455015512, "difficulty": "Medium", "likes": 827, "dislikes": 315, "categoryTitle": "Algorithms", "frontendQuestionId": "1391", "paidOnly": false, "title": "Check if There is a Valid Path in a Grid", "titleSlug": "check-if-there-is-a-valid-path-in-a-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29794, "totalSubmissionRaw": 61888}, "1392": {"acRate": 46.42378054707701, "difficulty": "Hard", "likes": 1361, "dislikes": 38, "categoryTitle": "Algorithms", "frontendQuestionId": "1392", "paidOnly": false, "title": "Longest Happy Prefix", "titleSlug": "longest-happy-prefix", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 47758, "totalSubmissionRaw": 102874}, "1393": {"acRate": 85.36259835879234, "difficulty": "Medium", "likes": 818, "dislikes": 45, "categoryTitle": "Database", "frontendQuestionId": "1393", "paidOnly": false, "title": "Capital Gain/Loss", "titleSlug": "capital-gainloss", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 116403, "totalSubmissionRaw": 136363}, "1394": {"acRate": 67.6091328522418, "difficulty": "Easy", "likes": 1153, "dislikes": 30, "categoryTitle": "Algorithms", "frontendQuestionId": "1394", "paidOnly": false, "title": "Find Lucky Integer in an Array", "titleSlug": "find-lucky-integer-in-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 131445, "totalSubmissionRaw": 194419}, "1395": {"acRate": 70.15621862319787, "difficulty": "Medium", "likes": 3344, "dislikes": 228, "categoryTitle": "Algorithms", "frontendQuestionId": "1395", "paidOnly": false, "title": "Count Number of Teams", "titleSlug": "count-number-of-teams", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 220098, "totalSubmissionRaw": 313725}, "1396": {"acRate": 74.70561746078891, "difficulty": "Medium", "likes": 3507, "dislikes": 174, "categoryTitle": "Algorithms", "frontendQuestionId": "1396", "paidOnly": false, "title": "Design Underground System", "titleSlug": "design-underground-system", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 233913, "totalSubmissionRaw": 313113}, "1397": {"acRate": 42.565633943013566, "difficulty": "Hard", "likes": 488, "dislikes": 128, "categoryTitle": "Algorithms", "frontendQuestionId": "1397", "paidOnly": false, "title": "Find All Good Strings", "titleSlug": "find-all-good-strings", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6842, "totalSubmissionRaw": 16074}, "1398": {"acRate": 72.59891976770945, "difficulty": "Medium", "likes": 305, "dislikes": 17, "categoryTitle": "Database", "frontendQuestionId": "1398", "paidOnly": true, "title": "Customers Who Bought Products A and B but Not C", "titleSlug": "customers-who-bought-products-a-and-b-but-not-c", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 53631, "totalSubmissionRaw": 73873}, "1399": {"acRate": 66.43028296790814, "difficulty": "Easy", "likes": 443, "dislikes": 984, "categoryTitle": "Algorithms", "frontendQuestionId": "1399", "paidOnly": false, "title": "Count Largest Group", "titleSlug": "count-largest-group", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 47962, "totalSubmissionRaw": 72199}, "1400": {"acRate": 62.15970753241975, "difficulty": "Medium", "likes": 1054, "dislikes": 92, "categoryTitle": "Algorithms", "frontendQuestionId": "1400", "paidOnly": false, "title": "Construct K Palindrome Strings", "titleSlug": "construct-k-palindrome-strings", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 54069, "totalSubmissionRaw": 86984}, "1401": {"acRate": 46.666666666666664, "difficulty": "Medium", "likes": 372, "dislikes": 82, "categoryTitle": "Algorithms", "frontendQuestionId": "1401", "paidOnly": false, "title": "Circle and Rectangle Overlapping", "titleSlug": "circle-and-rectangle-overlapping", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17493, "totalSubmissionRaw": 37485}, "1402": {"acRate": 76.24028796591259, "difficulty": "Hard", "likes": 3307, "dislikes": 309, "categoryTitle": "Algorithms", "frontendQuestionId": "1402", "paidOnly": false, "title": "Reducing Dishes", "titleSlug": "reducing-dishes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 151016, "totalSubmissionRaw": 198079}, "1403": {"acRate": 72.70484139911905, "difficulty": "Easy", "likes": 586, "dislikes": 502, "categoryTitle": "Algorithms", "frontendQuestionId": "1403", "paidOnly": false, "title": "Minimum Subsequence in Non-Increasing Order", "titleSlug": "minimum-subsequence-in-non-increasing-order", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 75432, "totalSubmissionRaw": 103751}, "1404": {"acRate": 61.46864025565032, "difficulty": "Medium", "likes": 1374, "dislikes": 87, "categoryTitle": "Algorithms", "frontendQuestionId": "1404", "paidOnly": false, "title": "Number of Steps to Reduce a Number in Binary Representation to One", "titleSlug": "number-of-steps-to-reduce-a-number-in-binary-representation-to-one", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 145803, "totalSubmissionRaw": 237199}, "1405": {"acRate": 57.49984917852571, "difficulty": "Medium", "likes": 2011, "dislikes": 251, "categoryTitle": "Algorithms", "frontendQuestionId": "1405", "paidOnly": false, "title": "Longest Happy String", "titleSlug": "longest-happy-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 85780, "totalSubmissionRaw": 149183}, "1406": {"acRate": 63.801060728460534, "difficulty": "Hard", "likes": 2190, "dislikes": 71, "categoryTitle": "Algorithms", "frontendQuestionId": "1406", "paidOnly": false, "title": "Stone Game III", "titleSlug": "stone-game-iii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 90824, "totalSubmissionRaw": 142355}, "1407": {"acRate": 57.604460297739124, "difficulty": "Easy", "likes": 633, "dislikes": 67, "categoryTitle": "Database", "frontendQuestionId": "1407", "paidOnly": false, "title": "Top Travellers", "titleSlug": "top-travellers", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 129356, "totalSubmissionRaw": 224559}, "1408": {"acRate": 64.06311609792542, "difficulty": "Easy", "likes": 904, "dislikes": 88, "categoryTitle": "Algorithms", "frontendQuestionId": "1408", "paidOnly": false, "title": "String Matching in an Array", "titleSlug": "string-matching-in-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 92609, "totalSubmissionRaw": 144559}, "1409": {"acRate": 84.33413091218983, "difficulty": "Medium", "likes": 491, "dislikes": 627, "categoryTitle": "Algorithms", "frontendQuestionId": "1409", "paidOnly": false, "title": "Queries on a Permutation With Key", "titleSlug": "queries-on-a-permutation-with-key", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 51459, "totalSubmissionRaw": 61018}, "1410": {"acRate": 50.8697124867999, "difficulty": "Medium", "likes": 191, "dislikes": 322, "categoryTitle": "Algorithms", "frontendQuestionId": "1410", "paidOnly": false, "title": "HTML Entity Parser", "titleSlug": "html-entity-parser", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25531, "totalSubmissionRaw": 50188}, "1411": {"acRate": 63.76980170599313, "difficulty": "Hard", "likes": 1081, "dislikes": 51, "categoryTitle": "Algorithms", "frontendQuestionId": "1411", "paidOnly": false, "title": "Number of Ways to Paint N \u00d7 3 Grid", "titleSlug": "number-of-ways-to-paint-n-3-grid", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34539, "totalSubmissionRaw": 54162}, "1412": {"acRate": 58.8672916487486, "difficulty": "Hard", "likes": 215, "dislikes": 25, "categoryTitle": "Database", "frontendQuestionId": "1412", "paidOnly": true, "title": "Find the Quiet Students in All Exams", "titleSlug": "find-the-quiet-students-in-all-exams", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27378, "totalSubmissionRaw": 46508}, "1413": {"acRate": 65.43756614674602, "difficulty": "Easy", "likes": 1560, "dislikes": 335, "categoryTitle": "Algorithms", "frontendQuestionId": "1413", "paidOnly": false, "title": "Minimum Value to Get Positive Step by Step Sum", "titleSlug": "minimum-value-to-get-positive-step-by-step-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 150865, "totalSubmissionRaw": 230548}, "1414": {"acRate": 65.39128116251166, "difficulty": "Medium", "likes": 1016, "dislikes": 67, "categoryTitle": "Algorithms", "frontendQuestionId": "1414", "paidOnly": false, "title": "Find the Minimum Number of Fibonacci Numbers Whose Sum Is K", "titleSlug": "find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 44145, "totalSubmissionRaw": 67509}, "1415": {"acRate": 74.87640366837589, "difficulty": "Medium", "likes": 968, "dislikes": 27, "categoryTitle": "Algorithms", "frontendQuestionId": "1415", "paidOnly": false, "title": "The k-th Lexicographical String of All Happy Strings of Length n", "titleSlug": "the-k-th-lexicographical-string-of-all-happy-strings-of-length-n", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 40741, "totalSubmissionRaw": 54411}, "1416": {"acRate": 47.468989347303385, "difficulty": "Hard", "likes": 1600, "dislikes": 52, "categoryTitle": "Algorithms", "frontendQuestionId": "1416", "paidOnly": false, "title": "Restore The Array", "titleSlug": "restore-the-array", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 59622, "totalSubmissionRaw": 125602}, "1417": {"acRate": 52.657196518794805, "difficulty": "Easy", "likes": 591, "dislikes": 106, "categoryTitle": "Algorithms", "frontendQuestionId": "1417", "paidOnly": false, "title": "Reformat The String", "titleSlug": "reformat-the-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 59718, "totalSubmissionRaw": 113409}, "1418": {"acRate": 75.00316736348664, "difficulty": "Medium", "likes": 393, "dislikes": 479, "categoryTitle": "Algorithms", "frontendQuestionId": "1418", "paidOnly": false, "title": "Display Table of Food Orders in a Restaurant", "titleSlug": "display-table-of-food-orders-in-a-restaurant", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29600, "totalSubmissionRaw": 39465}, "1419": {"acRate": 50.3725486300145, "difficulty": "Medium", "likes": 1037, "dislikes": 89, "categoryTitle": "Algorithms", "frontendQuestionId": "1419", "paidOnly": false, "title": "Minimum Number of Frogs Croaking", "titleSlug": "minimum-number-of-frogs-croaking", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 50704, "totalSubmissionRaw": 100658}, "1420": {"acRate": 68.18272178452975, "difficulty": "Hard", "likes": 1353, "dislikes": 90, "categoryTitle": "Algorithms", "frontendQuestionId": "1420", "paidOnly": false, "title": "Build Array Where You Can Find The Maximum Exactly K Comparisons", "titleSlug": "build-array-where-you-can-find-the-maximum-exactly-k-comparisons", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 65167, "totalSubmissionRaw": 95577}, "1421": {"acRate": 82.82561910824164, "difficulty": "Easy", "likes": 58, "dislikes": 295, "categoryTitle": "Database", "frontendQuestionId": "1421", "paidOnly": true, "title": "NPV Queries", "titleSlug": "npv-queries", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 27325, "totalSubmissionRaw": 32991}, "1422": {"acRate": 62.259691381257056, "difficulty": "Easy", "likes": 1547, "dislikes": 66, "categoryTitle": "Algorithms", "frontendQuestionId": "1422", "paidOnly": false, "title": "Maximum Score After Splitting a String", "titleSlug": "maximum-score-after-splitting-a-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 165424, "totalSubmissionRaw": 265698}, "1423": {"acRate": 53.64404061615866, "difficulty": "Medium", "likes": 6194, "dislikes": 242, "categoryTitle": "Algorithms", "frontendQuestionId": "1423", "paidOnly": false, "title": "Maximum Points You Can Obtain from Cards", "titleSlug": "maximum-points-you-can-obtain-from-cards", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 299386, "totalSubmissionRaw": 558100}, "1424": {"acRate": 57.08846268706241, "difficulty": "Medium", "likes": 2165, "dislikes": 152, "categoryTitle": "Algorithms", "frontendQuestionId": "1424", "paidOnly": false, "title": "Diagonal Traverse II", "titleSlug": "diagonal-traverse-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 137638, "totalSubmissionRaw": 241096}, "1425": {"acRate": 56.57116610208417, "difficulty": "Hard", "likes": 2131, "dislikes": 103, "categoryTitle": "Algorithms", "frontendQuestionId": "1425", "paidOnly": false, "title": "Constrained Subsequence Sum", "titleSlug": "constrained-subsequence-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Monotonic Queue", "id": "VG9waWNUYWdOb2RlOjYxMDcx", "slug": "monotonic-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 78824, "totalSubmissionRaw": 139336}, "1426": {"acRate": 60.258899976362514, "difficulty": "Easy", "likes": 155, "dislikes": 51, "categoryTitle": "Algorithms", "frontendQuestionId": "1426", "paidOnly": true, "title": "Counting Elements", "titleSlug": "counting-elements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 130014, "totalSubmissionRaw": 215759}, "1427": {"acRate": 54.787112242561385, "difficulty": "Easy", "likes": 246, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "1427", "paidOnly": true, "title": "Perform String Shifts", "titleSlug": "perform-string-shifts", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 81349, "totalSubmissionRaw": 148482}, "1428": {"acRate": 54.55589495867964, "difficulty": "Medium", "likes": 1223, "dislikes": 149, "categoryTitle": "Algorithms", "frontendQuestionId": "1428", "paidOnly": true, "title": "Leftmost Column with at Least a One", "titleSlug": "leftmost-column-with-at-least-a-one", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 184314, "totalSubmissionRaw": 337846}, "1429": {"acRate": 53.90027645637717, "difficulty": "Medium", "likes": 555, "dislikes": 32, "categoryTitle": "Algorithms", "frontendQuestionId": "1429", "paidOnly": true, "title": "First Unique Number", "titleSlug": "first-unique-number", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Data Stream", "id": "VG9waWNUYWdOb2RlOjYxMDYz", "slug": "data-stream"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 86564, "totalSubmissionRaw": 160602}, "1430": {"acRate": 46.97985164921879, "difficulty": "Medium", "likes": 215, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "1430", "paidOnly": true, "title": "Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree", "titleSlug": "check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 44652, "totalSubmissionRaw": 95045}, "1431": {"acRate": 87.65676432740639, "difficulty": "Easy", "likes": 4464, "dislikes": 568, "categoryTitle": "Algorithms", "frontendQuestionId": "1431", "paidOnly": false, "title": "Kids With the Greatest Number of Candies", "titleSlug": "kids-with-the-greatest-number-of-candies", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 986361, "totalSubmissionRaw": 1125253}, "1432": {"acRate": 41.05838617975071, "difficulty": "Medium", "likes": 232, "dislikes": 293, "categoryTitle": "Algorithms", "frontendQuestionId": "1432", "paidOnly": false, "title": "Max Difference You Can Get From Changing an Integer", "titleSlug": "max-difference-you-can-get-from-changing-an-integer", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18776, "totalSubmissionRaw": 45730}, "1433": {"acRate": 69.8441897394777, "difficulty": "Medium", "likes": 757, "dislikes": 148, "categoryTitle": "Algorithms", "frontendQuestionId": "1433", "paidOnly": false, "title": "Check If a String Can Break Another String", "titleSlug": "check-if-a-string-can-break-another-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 44423, "totalSubmissionRaw": 63603}, "1434": {"acRate": 43.911239913626545, "difficulty": "Hard", "likes": 898, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "1434", "paidOnly": false, "title": "Number of Ways to Wear Different Hats to Each Other", "titleSlug": "number-of-ways-to-wear-different-hats-to-each-other", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 15455, "totalSubmissionRaw": 35196}, "1435": {"acRate": 75.1638793847728, "difficulty": "Easy", "likes": 153, "dislikes": 260, "categoryTitle": "Database", "frontendQuestionId": "1435", "paidOnly": true, "title": "Create a Session Bar Chart", "titleSlug": "create-a-session-bar-chart", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23506, "totalSubmissionRaw": 31273}, "1436": {"acRate": 79.46895356515671, "difficulty": "Easy", "likes": 2211, "dislikes": 103, "categoryTitle": "Algorithms", "frontendQuestionId": "1436", "paidOnly": false, "title": "Destination City", "titleSlug": "destination-city", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 275588, "totalSubmissionRaw": 346787}, "1437": {"acRate": 58.05894800702003, "difficulty": "Easy", "likes": 629, "dislikes": 224, "categoryTitle": "Algorithms", "frontendQuestionId": "1437", "paidOnly": false, "title": "Check If All 1's Are at Least Length K Places Away", "titleSlug": "check-if-all-1s-are-at-least-length-k-places-away", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 80389, "totalSubmissionRaw": 138461}, "1438": {"acRate": 56.60706988898704, "difficulty": "Medium", "likes": 4059, "dislikes": 192, "categoryTitle": "Algorithms", "frontendQuestionId": "1438", "paidOnly": false, "title": "Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit", "titleSlug": "longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}, {"name": "Monotonic Queue", "id": "VG9waWNUYWdOb2RlOjYxMDcx", "slug": "monotonic-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 231348, "totalSubmissionRaw": 408691}, "1439": {"acRate": 61.814493564633466, "difficulty": "Hard", "likes": 1231, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "1439", "paidOnly": false, "title": "Find the Kth Smallest Sum of a Matrix With Sorted Rows", "titleSlug": "find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 35348, "totalSubmissionRaw": 57184}, "1440": {"acRate": 72.6024734553053, "difficulty": "Medium", "likes": 214, "dislikes": 25, "categoryTitle": "Database", "frontendQuestionId": "1440", "paidOnly": true, "title": "Evaluate Boolean Expression", "titleSlug": "evaluate-boolean-expression", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29881, "totalSubmissionRaw": 41157}, "1441": {"acRate": 79.99745993518131, "difficulty": "Medium", "likes": 986, "dislikes": 482, "categoryTitle": "Algorithms", "frontendQuestionId": "1441", "paidOnly": false, "title": "Build an Array With Stack Operations", "titleSlug": "build-an-array-with-stack-operations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 170069, "totalSubmissionRaw": 212593}, "1442": {"acRate": 84.95940979280819, "difficulty": "Medium", "likes": 1930, "dislikes": 129, "categoryTitle": "Algorithms", "frontendQuestionId": "1442", "paidOnly": false, "title": "Count Triplets That Can Form Two Arrays of Equal XOR", "titleSlug": "count-triplets-that-can-form-two-arrays-of-equal-xor", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 126214, "totalSubmissionRaw": 148557}, "1443": {"acRate": 62.466297715339856, "difficulty": "Medium", "likes": 3653, "dislikes": 321, "categoryTitle": "Algorithms", "frontendQuestionId": "1443", "paidOnly": false, "title": "Minimum Time to Collect All Apples in a Tree", "titleSlug": "minimum-time-to-collect-all-apples-in-a-tree", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 123256, "totalSubmissionRaw": 197316}, "1444": {"acRate": 62.044505257093476, "difficulty": "Hard", "likes": 1835, "dislikes": 95, "categoryTitle": "Algorithms", "frontendQuestionId": "1444", "paidOnly": false, "title": "Number of Ways of Cutting a Pizza", "titleSlug": "number-of-ways-of-cutting-a-pizza", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 68924, "totalSubmissionRaw": 111088}, "1445": {"acRate": 86.29588254069583, "difficulty": "Medium", "likes": 240, "dislikes": 23, "categoryTitle": "Database", "frontendQuestionId": "1445", "paidOnly": true, "title": "Apples & Oranges", "titleSlug": "apples-oranges", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 54073, "totalSubmissionRaw": 62660}, "1446": {"acRate": 60.314842631204854, "difficulty": "Easy", "likes": 1743, "dislikes": 34, "categoryTitle": "Algorithms", "frontendQuestionId": "1446", "paidOnly": false, "title": "Consecutive Characters", "titleSlug": "consecutive-characters", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 172261, "totalSubmissionRaw": 285603}, "1447": {"acRate": 67.08033456525968, "difficulty": "Medium", "likes": 416, "dislikes": 43, "categoryTitle": "Algorithms", "frontendQuestionId": "1447", "paidOnly": false, "title": "Simplified Fractions", "titleSlug": "simplified-fractions", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34486, "totalSubmissionRaw": 51410}, "1448": {"acRate": 73.04676531231698, "difficulty": "Medium", "likes": 5861, "dislikes": 174, "categoryTitle": "Algorithms", "frontendQuestionId": "1448", "paidOnly": false, "title": "Count Good Nodes in Binary Tree", "titleSlug": "count-good-nodes-in-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 546288, "totalSubmissionRaw": 747861}, "1449": {"acRate": 48.35552786646938, "difficulty": "Hard", "likes": 694, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "1449", "paidOnly": false, "title": "Form Largest Integer With Digits That Add up to Target", "titleSlug": "form-largest-integer-with-digits-that-add-up-to-target", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18628, "totalSubmissionRaw": 38523}, "1450": {"acRate": 75.6874706431455, "difficulty": "Easy", "likes": 879, "dislikes": 154, "categoryTitle": "Algorithms", "frontendQuestionId": "1450", "paidOnly": false, "title": "Number of Students Doing Homework at a Given Time", "titleSlug": "number-of-students-doing-homework-at-a-given-time", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 127298, "totalSubmissionRaw": 168189}, "1451": {"acRate": 64.78373849479078, "difficulty": "Medium", "likes": 758, "dislikes": 74, "categoryTitle": "Algorithms", "frontendQuestionId": "1451", "paidOnly": false, "title": "Rearrange Words in a Sentence", "titleSlug": "rearrange-words-in-a-sentence", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 53352, "totalSubmissionRaw": 82354}, "1452": {"acRate": 58.09710078232858, "difficulty": "Medium", "likes": 354, "dislikes": 226, "categoryTitle": "Algorithms", "frontendQuestionId": "1452", "paidOnly": false, "title": "People Whose List of Favorite Companies Is Not a Subset of Another List", "titleSlug": "people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25249, "totalSubmissionRaw": 43460}, "1453": {"acRate": 38.25931445603577, "difficulty": "Hard", "likes": 146, "dislikes": 269, "categoryTitle": "Algorithms", "frontendQuestionId": "1453", "paidOnly": false, "title": "Maximum Number of Darts Inside of a Circular Dartboard", "titleSlug": "maximum-number-of-darts-inside-of-a-circular-dartboard", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6418, "totalSubmissionRaw": 16775}, "1454": {"acRate": 36.58168430740911, "difficulty": "Medium", "likes": 404, "dislikes": 39, "categoryTitle": "Database", "frontendQuestionId": "1454", "paidOnly": true, "title": "Active Users", "titleSlug": "active-users", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 39746, "totalSubmissionRaw": 108650}, "1455": {"acRate": 64.40066979859527, "difficulty": "Easy", "likes": 829, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "1455", "paidOnly": false, "title": "Check If a Word Occurs As a Prefix of Any Word in a Sentence", "titleSlug": "check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 83073, "totalSubmissionRaw": 128994}, "1456": {"acRate": 58.86742463174415, "difficulty": "Medium", "likes": 3508, "dislikes": 132, "categoryTitle": "Algorithms", "frontendQuestionId": "1456", "paidOnly": false, "title": "Maximum Number of Vowels in a Substring of Given Length", "titleSlug": "maximum-number-of-vowels-in-a-substring-of-given-length", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 360831, "totalSubmissionRaw": 612956}, "1457": {"acRate": 68.35115999493169, "difficulty": "Medium", "likes": 3257, "dislikes": 129, "categoryTitle": "Algorithms", "frontendQuestionId": "1457", "paidOnly": false, "title": "Pseudo-Palindromic Paths in a Binary Tree", "titleSlug": "pseudo-palindromic-paths-in-a-binary-tree", "topicTags": [{"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 221170, "totalSubmissionRaw": 323579}, "1458": {"acRate": 62.46000316806589, "difficulty": "Hard", "likes": 1657, "dislikes": 33, "categoryTitle": "Algorithms", "frontendQuestionId": "1458", "paidOnly": false, "title": "Max Dot Product of Two Subsequences", "titleSlug": "max-dot-product-of-two-subsequences", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 78862, "totalSubmissionRaw": 126260}, "1459": {"acRate": 68.52831667646483, "difficulty": "Medium", "likes": 96, "dislikes": 161, "categoryTitle": "Database", "frontendQuestionId": "1459", "paidOnly": true, "title": "Rectangles Area", "titleSlug": "rectangles-area", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17485, "totalSubmissionRaw": 25515}, "1460": {"acRate": 75.97540960375555, "difficulty": "Easy", "likes": 1443, "dislikes": 160, "categoryTitle": "Algorithms", "frontendQuestionId": "1460", "paidOnly": false, "title": "Make Two Arrays Equal by Reversing Subarrays", "titleSlug": "make-two-arrays-equal-by-reversing-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 294875, "totalSubmissionRaw": 388119}, "1461": {"acRate": 56.5385302565935, "difficulty": "Medium", "likes": 2242, "dislikes": 98, "categoryTitle": "Algorithms", "frontendQuestionId": "1461", "paidOnly": false, "title": "Check If a String Contains All Binary Codes of Size K", "titleSlug": "check-if-a-string-contains-all-binary-codes-of-size-k", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 123414, "totalSubmissionRaw": 218283}, "1462": {"acRate": 50.10211616106075, "difficulty": "Medium", "likes": 1469, "dislikes": 66, "categoryTitle": "Algorithms", "frontendQuestionId": "1462", "paidOnly": false, "title": "Course Schedule IV", "titleSlug": "course-schedule-iv", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 63783, "totalSubmissionRaw": 127306}, "1463": {"acRate": 71.85008006810857, "difficulty": "Hard", "likes": 4120, "dislikes": 48, "categoryTitle": "Algorithms", "frontendQuestionId": "1463", "paidOnly": false, "title": "Cherry Pickup II", "titleSlug": "cherry-pickup-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 177229, "totalSubmissionRaw": 246665}, "1464": {"acRate": 82.83176678114002, "difficulty": "Easy", "likes": 2477, "dislikes": 236, "categoryTitle": "Algorithms", "frontendQuestionId": "1464", "paidOnly": false, "title": "Maximum Product of Two Elements in an Array", "titleSlug": "maximum-product-of-two-elements-in-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 388809, "totalSubmissionRaw": 469396}, "1465": {"acRate": 41.08078032495644, "difficulty": "Medium", "likes": 2619, "dislikes": 350, "categoryTitle": "Algorithms", "frontendQuestionId": "1465", "paidOnly": false, "title": "Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts", "titleSlug": "maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 168340, "totalSubmissionRaw": 409778}, "1466": {"acRate": 64.53154542661781, "difficulty": "Medium", "likes": 4185, "dislikes": 122, "categoryTitle": "Algorithms", "frontendQuestionId": "1466", "paidOnly": false, "title": "Reorder Routes to Make All Paths Lead to the City Zero", "titleSlug": "reorder-routes-to-make-all-paths-lead-to-the-city-zero", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 203759, "totalSubmissionRaw": 315751}, "1467": {"acRate": 60.6267217630854, "difficulty": "Hard", "likes": 284, "dislikes": 172, "categoryTitle": "Algorithms", "frontendQuestionId": "1467", "paidOnly": false, "title": "Probability of a Two Boxes Having The Same Number of Distinct Balls", "titleSlug": "probability-of-a-two-boxes-having-the-same-number-of-distinct-balls", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}, {"name": "Probability and Statistics", "id": "VG9waWNUYWdOb2RlOjYxMDc5", "slug": "probability-and-statistics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8803, "totalSubmissionRaw": 14520}, "1468": {"acRate": 78.39659008994892, "difficulty": "Medium", "likes": 127, "dislikes": 22, "categoryTitle": "Database", "frontendQuestionId": "1468", "paidOnly": true, "title": "Calculate Salaries", "titleSlug": "calculate-salaries", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25014, "totalSubmissionRaw": 31907}, "1469": {"acRate": 83.7057936614567, "difficulty": "Easy", "likes": 508, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "1469", "paidOnly": true, "title": "Find All The Lonely Nodes", "titleSlug": "find-all-the-lonely-nodes", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 56072, "totalSubmissionRaw": 66987}, "1470": {"acRate": 88.5929504146815, "difficulty": "Easy", "likes": 5766, "dislikes": 310, "categoryTitle": "Algorithms", "frontendQuestionId": "1470", "paidOnly": false, "title": "Shuffle the Array", "titleSlug": "shuffle-the-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 722960, "totalSubmissionRaw": 816046}, "1471": {"acRate": 61.36729388462491, "difficulty": "Medium", "likes": 699, "dislikes": 155, "categoryTitle": "Algorithms", "frontendQuestionId": "1471", "paidOnly": false, "title": "The k Strongest Values in an Array", "titleSlug": "the-k-strongest-values-in-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 39658, "totalSubmissionRaw": 64624}, "1472": {"acRate": 77.66625792398646, "difficulty": "Medium", "likes": 3858, "dislikes": 239, "categoryTitle": "Algorithms", "frontendQuestionId": "1472", "paidOnly": false, "title": "Design Browser History", "titleSlug": "design-browser-history", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Doubly-Linked List", "id": "VG9waWNUYWdOb2RlOjYxMDU4", "slug": "doubly-linked-list"}, {"name": "Data Stream", "id": "VG9waWNUYWdOb2RlOjYxMDYz", "slug": "data-stream"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 246382, "totalSubmissionRaw": 317232}, "1473": {"acRate": 60.997279620304454, "difficulty": "Hard", "likes": 2065, "dislikes": 152, "categoryTitle": "Algorithms", "frontendQuestionId": "1473", "paidOnly": false, "title": "Paint House III", "titleSlug": "paint-house-iii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 63230, "totalSubmissionRaw": 103661}, "1474": {"acRate": 73.23586656407007, "difficulty": "Easy", "likes": 405, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "1474", "paidOnly": true, "title": "Delete N Nodes After M Nodes of a Linked List", "titleSlug": "delete-n-nodes-after-m-nodes-of-a-linked-list", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 32360, "totalSubmissionRaw": 44186}, "1475": {"acRate": 78.31943772864253, "difficulty": "Easy", "likes": 2132, "dislikes": 119, "categoryTitle": "Algorithms", "frontendQuestionId": "1475", "paidOnly": false, "title": "Final Prices With a Special Discount in a Shop", "titleSlug": "final-prices-with-a-special-discount-in-a-shop", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 160352, "totalSubmissionRaw": 204741}, "1476": {"acRate": 88.22929432694208, "difficulty": "Medium", "likes": 633, "dislikes": 1442, "categoryTitle": "Algorithms", "frontendQuestionId": "1476", "paidOnly": false, "title": "Subrectangle Queries", "titleSlug": "subrectangle-queries", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 111588, "totalSubmissionRaw": 126475}, "1477": {"acRate": 36.52980750417652, "difficulty": "Medium", "likes": 1701, "dislikes": 86, "categoryTitle": "Algorithms", "frontendQuestionId": "1477", "paidOnly": false, "title": "Find Two Non-overlapping Sub-arrays Each With Target Sum", "titleSlug": "find-two-non-overlapping-sub-arrays-each-with-target-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 48543, "totalSubmissionRaw": 132886}, "1478": {"acRate": 55.446777448580875, "difficulty": "Hard", "likes": 1112, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "1478", "paidOnly": false, "title": "Allocate Mailboxes", "titleSlug": "allocate-mailboxes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25826, "totalSubmissionRaw": 46578}, "1479": {"acRate": 77.45894628806022, "difficulty": "Hard", "likes": 151, "dislikes": 39, "categoryTitle": "Database", "frontendQuestionId": "1479", "paidOnly": true, "title": "Sales by Day of the Week", "titleSlug": "sales-by-day-of-the-week", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 18113, "totalSubmissionRaw": 23384}, "1480": {"acRate": 86.83021238510788, "difficulty": "Easy", "likes": 7892, "dislikes": 345, "categoryTitle": "Algorithms", "frontendQuestionId": "1480", "paidOnly": false, "title": "Running Sum of 1d Array", "titleSlug": "running-sum-of-1d-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 1881160, "totalSubmissionRaw": 2166480}, "1481": {"acRate": 63.099199931372226, "difficulty": "Medium", "likes": 2245, "dislikes": 226, "categoryTitle": "Algorithms", "frontendQuestionId": "1481", "paidOnly": false, "title": "Least Number of Unique Integers after K Removals", "titleSlug": "least-number-of-unique-integers-after-k-removals", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 250088, "totalSubmissionRaw": 396341}, "1482": {"acRate": 55.790000625743076, "difficulty": "Medium", "likes": 4652, "dislikes": 226, "categoryTitle": "Algorithms", "frontendQuestionId": "1482", "paidOnly": false, "title": "Minimum Number of Days to Make m Bouquets", "titleSlug": "minimum-number-of-days-to-make-m-bouquets", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 267474, "totalSubmissionRaw": 479430}, "1483": {"acRate": 34.84568788786746, "difficulty": "Hard", "likes": 1931, "dislikes": 119, "categoryTitle": "Algorithms", "frontendQuestionId": "1483", "paidOnly": false, "title": "Kth Ancestor of a Tree Node", "titleSlug": "kth-ancestor-of-a-tree-node", "topicTags": [{"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 37564, "totalSubmissionRaw": 107801}, "1484": {"acRate": 77.05627705627705, "difficulty": "Easy", "likes": 1424, "dislikes": 108, "categoryTitle": "Database", "frontendQuestionId": "1484", "paidOnly": false, "title": "Group Sold Products By The Date", "titleSlug": "group-sold-products-by-the-date", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 229261, "totalSubmissionRaw": 297525}, "1485": {"acRate": 80.70469337873837, "difficulty": "Medium", "likes": 421, "dislikes": 86, "categoryTitle": "Algorithms", "frontendQuestionId": "1485", "paidOnly": true, "title": "Clone Binary Tree With Random Pointer", "titleSlug": "clone-binary-tree-with-random-pointer", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 29387, "totalSubmissionRaw": 36413}, "1486": {"acRate": 86.10377850107213, "difficulty": "Easy", "likes": 1387, "dislikes": 333, "categoryTitle": "Algorithms", "frontendQuestionId": "1486", "paidOnly": false, "title": "XOR Operation in an Array", "titleSlug": "xor-operation-in-an-array", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 201581, "totalSubmissionRaw": 234114}, "1487": {"acRate": 37.193679321047945, "difficulty": "Medium", "likes": 444, "dislikes": 719, "categoryTitle": "Algorithms", "frontendQuestionId": "1487", "paidOnly": false, "title": "Making File Names Unique", "titleSlug": "making-file-names-unique", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34271, "totalSubmissionRaw": 92142}, "1488": {"acRate": 27.02602365787079, "difficulty": "Medium", "likes": 1530, "dislikes": 292, "categoryTitle": "Algorithms", "frontendQuestionId": "1488", "paidOnly": false, "title": "Avoid Flood in The City", "titleSlug": "avoid-flood-in-the-city", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 37127, "totalSubmissionRaw": 137375}, "1489": {"acRate": 67.51912249340289, "difficulty": "Hard", "likes": 1848, "dislikes": 158, "categoryTitle": "Algorithms", "frontendQuestionId": "1489", "paidOnly": false, "title": "Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree", "titleSlug": "find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree", "topicTags": [{"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Minimum Spanning Tree", "id": "VG9waWNUYWdOb2RlOjYxMDgz", "slug": "minimum-spanning-tree"}, {"name": "Strongly Connected Component", "id": "VG9waWNUYWdOb2RlOjYxMDg1", "slug": "strongly-connected-component"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 55523, "totalSubmissionRaw": 82233}, "1490": {"acRate": 83.11237903451362, "difficulty": "Medium", "likes": 409, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "1490", "paidOnly": true, "title": "Clone N-ary Tree", "titleSlug": "clone-n-ary-tree", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 29716, "totalSubmissionRaw": 35754}, "1491": {"acRate": 63.47910778187207, "difficulty": "Easy", "likes": 2226, "dislikes": 187, "categoryTitle": "Algorithms", "frontendQuestionId": "1491", "paidOnly": false, "title": "Average Salary Excluding the Minimum and Maximum Salary", "titleSlug": "average-salary-excluding-the-minimum-and-maximum-salary", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 346090, "totalSubmissionRaw": 545203}, "1492": {"acRate": 68.21705426356588, "difficulty": "Medium", "likes": 1785, "dislikes": 293, "categoryTitle": "Algorithms", "frontendQuestionId": "1492", "paidOnly": false, "title": "The kth Factor of n", "titleSlug": "the-kth-factor-of-n", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 251413, "totalSubmissionRaw": 368550}, "1493": {"acRate": 67.7509647750651, "difficulty": "Medium", "likes": 3969, "dislikes": 83, "categoryTitle": "Algorithms", "frontendQuestionId": "1493", "paidOnly": false, "title": "Longest Subarray of 1's After Deleting One Element", "titleSlug": "longest-subarray-of-1s-after-deleting-one-element", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 302317, "totalSubmissionRaw": 446218}, "1494": {"acRate": 29.502305711068956, "difficulty": "Hard", "likes": 1041, "dislikes": 72, "categoryTitle": "Algorithms", "frontendQuestionId": "1494", "paidOnly": false, "title": "Parallel Courses II", "titleSlug": "parallel-courses-ii", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19129, "totalSubmissionRaw": 64839}, "1495": {"acRate": 49.014486591551005, "difficulty": "Easy", "likes": 86, "dislikes": 38, "categoryTitle": "Database", "frontendQuestionId": "1495", "paidOnly": true, "title": "Friendly Movies Streamed Last Month", "titleSlug": "friendly-movies-streamed-last-month", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 32278, "totalSubmissionRaw": 65854}, "1496": {"acRate": 62.46916937673983, "difficulty": "Easy", "likes": 1471, "dislikes": 46, "categoryTitle": "Algorithms", "frontendQuestionId": "1496", "paidOnly": false, "title": "Path Crossing", "titleSlug": "path-crossing", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 165389, "totalSubmissionRaw": 264753}, "1497": {"acRate": 38.4638339374354, "difficulty": "Medium", "likes": 1746, "dislikes": 92, "categoryTitle": "Algorithms", "frontendQuestionId": "1497", "paidOnly": false, "title": "Check If Array Pairs Are Divisible by k", "titleSlug": "check-if-array-pairs-are-divisible-by-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 52847, "totalSubmissionRaw": 137394}, "1498": {"acRate": 43.63519163640334, "difficulty": "Medium", "likes": 3913, "dislikes": 373, "categoryTitle": "Algorithms", "frontendQuestionId": "1498", "paidOnly": false, "title": "Number of Subsequences That Satisfy the Given Sum Condition", "titleSlug": "number-of-subsequences-that-satisfy-the-given-sum-condition", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 123879, "totalSubmissionRaw": 283897}, "1499": {"acRate": 44.135559146990424, "difficulty": "Hard", "likes": 1326, "dislikes": 60, "categoryTitle": "Algorithms", "frontendQuestionId": "1499", "paidOnly": false, "title": "Max Value of Equation", "titleSlug": "max-value-of-equation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Monotonic Queue", "id": "VG9waWNUYWdOb2RlOjYxMDcx", "slug": "monotonic-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 44787, "totalSubmissionRaw": 101476}, "1500": {"acRate": 43.206151450262794, "difficulty": "Medium", "likes": 49, "dislikes": 120, "categoryTitle": "Algorithms", "frontendQuestionId": "1500", "paidOnly": true, "title": "Design a File Sharing System", "titleSlug": "design-a-file-sharing-system", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Data Stream", "id": "VG9waWNUYWdOb2RlOjYxMDYz", "slug": "data-stream"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4439, "totalSubmissionRaw": 10274}, "1501": {"acRate": 50.19436162584443, "difficulty": "Medium", "likes": 296, "dislikes": 145, "categoryTitle": "Database", "frontendQuestionId": "1501", "paidOnly": true, "title": "Countries You Can Safely Invest In", "titleSlug": "countries-you-can-safely-invest-in", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 39900, "totalSubmissionRaw": 79491}, "1502": {"acRate": 69.57467408685348, "difficulty": "Easy", "likes": 2168, "dislikes": 112, "categoryTitle": "Algorithms", "frontendQuestionId": "1502", "paidOnly": false, "title": "Can Make Arithmetic Progression From Sequence", "titleSlug": "can-make-arithmetic-progression-from-sequence", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 253663, "totalSubmissionRaw": 364591}, "1503": {"acRate": 68.51231527093596, "difficulty": "Medium", "likes": 1498, "dislikes": 409, "categoryTitle": "Algorithms", "frontendQuestionId": "1503", "paidOnly": false, "title": "Last Moment Before All Ants Fall Out of a Plank", "titleSlug": "last-moment-before-all-ants-fall-out-of-a-plank", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Brainteaser", "id": "VG9waWNUYWdOb2RlOjMy", "slug": "brainteaser"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 90402, "totalSubmissionRaw": 131950}, "1504": {"acRate": 57.228721345318476, "difficulty": "Medium", "likes": 2108, "dislikes": 163, "categoryTitle": "Algorithms", "frontendQuestionId": "1504", "paidOnly": false, "title": "Count Submatrices With All Ones", "titleSlug": "count-submatrices-with-all-ones", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 53225, "totalSubmissionRaw": 93004}, "1505": {"acRate": 39.74354124900707, "difficulty": "Hard", "likes": 486, "dislikes": 26, "categoryTitle": "Algorithms", "frontendQuestionId": "1505", "paidOnly": false, "title": "Minimum Possible Integer After at Most K Adjacent Swaps On Digits", "titleSlug": "minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10507, "totalSubmissionRaw": 26437}, "1506": {"acRate": 78.38987745695482, "difficulty": "Medium", "likes": 473, "dislikes": 201, "categoryTitle": "Algorithms", "frontendQuestionId": "1506", "paidOnly": true, "title": "Find Root of N-Ary Tree", "titleSlug": "find-root-of-n-ary-tree", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 35375, "totalSubmissionRaw": 45127}, "1507": {"acRate": 66.46189962130948, "difficulty": "Easy", "likes": 469, "dislikes": 435, "categoryTitle": "Algorithms", "frontendQuestionId": "1507", "paidOnly": false, "title": "Reformat Date", "titleSlug": "reformat-date", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 77573, "totalSubmissionRaw": 116718}, "1508": {"acRate": 63.23458784898158, "difficulty": "Medium", "likes": 1499, "dislikes": 251, "categoryTitle": "Algorithms", "frontendQuestionId": "1508", "paidOnly": false, "title": "Range Sum of Sorted Subarray Sums", "titleSlug": "range-sum-of-sorted-subarray-sums", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 169849, "totalSubmissionRaw": 268602}, "1509": {"acRate": 59.21900499260402, "difficulty": "Medium", "likes": 2471, "dislikes": 276, "categoryTitle": "Algorithms", "frontendQuestionId": "1509", "paidOnly": false, "title": "Minimum Difference Between Largest and Smallest Value in Three Moves", "titleSlug": "minimum-difference-between-largest-and-smallest-value-in-three-moves", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 232601, "totalSubmissionRaw": 392781}, "1510": {"acRate": 59.68534430594216, "difficulty": "Hard", "likes": 1598, "dislikes": 70, "categoryTitle": "Algorithms", "frontendQuestionId": "1510", "paidOnly": false, "title": "Stone Game IV", "titleSlug": "stone-game-iv", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 73977, "totalSubmissionRaw": 123945}, "1511": {"acRate": 67.74922118380063, "difficulty": "Easy", "likes": 318, "dislikes": 57, "categoryTitle": "Database", "frontendQuestionId": "1511", "paidOnly": true, "title": "Customer Order Frequency", "titleSlug": "customer-order-frequency", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 43495, "totalSubmissionRaw": 64200}, "1512": {"acRate": 89.20336254148016, "difficulty": "Easy", "likes": 5440, "dislikes": 258, "categoryTitle": "Algorithms", "frontendQuestionId": "1512", "paidOnly": false, "title": "Number of Good Pairs", "titleSlug": "number-of-good-pairs", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 816655, "totalSubmissionRaw": 915498}, "1513": {"acRate": 46.97876486260786, "difficulty": "Medium", "likes": 872, "dislikes": 33, "categoryTitle": "Algorithms", "frontendQuestionId": "1513", "paidOnly": false, "title": "Number of Substrings With Only 1s", "titleSlug": "number-of-substrings-with-only-1s", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 47255, "totalSubmissionRaw": 100588}, "1514": {"acRate": 55.525889907298996, "difficulty": "Medium", "likes": 3144, "dislikes": 75, "categoryTitle": "Algorithms", "frontendQuestionId": "1514", "paidOnly": false, "title": "Path with Maximum Probability", "titleSlug": "path-with-maximum-probability", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 148900, "totalSubmissionRaw": 268167}, "1515": {"acRate": 35.078226091048116, "difficulty": "Hard", "likes": 234, "dislikes": 264, "categoryTitle": "Algorithms", "frontendQuestionId": "1515", "paidOnly": false, "title": "Best Position for a Service Centre", "titleSlug": "best-position-for-a-service-centre", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}, {"name": "Randomized", "id": "VG9waWNUYWdOb2RlOjYxMDc1", "slug": "randomized"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14908, "totalSubmissionRaw": 42501}, "1516": {"acRate": 61.85234899328859, "difficulty": "Hard", "likes": 33, "dislikes": 62, "categoryTitle": "Algorithms", "frontendQuestionId": "1516", "paidOnly": true, "title": "Move Sub-Tree of N-Ary Tree", "titleSlug": "move-sub-tree-of-n-ary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2304, "totalSubmissionRaw": 3725}, "1517": {"acRate": 44.25267447085093, "difficulty": "Easy", "likes": 461, "dislikes": 252, "categoryTitle": "Database", "frontendQuestionId": "1517", "paidOnly": false, "title": "Find Users With Valid E-Mails", "titleSlug": "find-users-with-valid-e-mails", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 129020, "totalSubmissionRaw": 291553}, "1518": {"acRate": 71.00974745770881, "difficulty": "Easy", "likes": 1672, "dislikes": 135, "categoryTitle": "Algorithms", "frontendQuestionId": "1518", "paidOnly": false, "title": "Water Bottles", "titleSlug": "water-bottles", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 235741, "totalSubmissionRaw": 331983}, "1519": {"acRate": 54.99482401656315, "difficulty": "Medium", "likes": 2256, "dislikes": 807, "categoryTitle": "Algorithms", "frontendQuestionId": "1519", "paidOnly": false, "title": "Number of Nodes in the Sub-Tree With the Same Label", "titleSlug": "number-of-nodes-in-the-sub-tree-with-the-same-label", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 85000, "totalSubmissionRaw": 154560}, "1520": {"acRate": 39.65356125356125, "difficulty": "Hard", "likes": 823, "dislikes": 77, "categoryTitle": "Algorithms", "frontendQuestionId": "1520", "paidOnly": false, "title": "Maximum Number of Non-Overlapping Substrings", "titleSlug": "maximum-number-of-non-overlapping-substrings", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17398, "totalSubmissionRaw": 43875}, "1521": {"acRate": 45.51985957464179, "difficulty": "Hard", "likes": 385, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "1521", "paidOnly": false, "title": "Find a Value of a Mysterious Function Closest to Target", "titleSlug": "find-a-value-of-a-mysterious-function-closest-to-target", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11151, "totalSubmissionRaw": 24497}, "1522": {"acRate": 74.4547227804705, "difficulty": "Medium", "likes": 608, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "1522", "paidOnly": true, "title": "Diameter of N-Ary Tree", "titleSlug": "diameter-of-n-ary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 50384, "totalSubmissionRaw": 67671}, "1523": {"acRate": 49.97778248911632, "difficulty": "Easy", "likes": 2746, "dislikes": 158, "categoryTitle": "Algorithms", "frontendQuestionId": "1523", "paidOnly": false, "title": "Count Odd Numbers in an Interval Range", "titleSlug": "count-odd-numbers-in-an-interval-range", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 344169, "totalSubmissionRaw": 688644}, "1524": {"acRate": 43.70561652679148, "difficulty": "Medium", "likes": 1353, "dislikes": 59, "categoryTitle": "Algorithms", "frontendQuestionId": "1524", "paidOnly": false, "title": "Number of Sub-arrays With Odd Sum", "titleSlug": "number-of-sub-arrays-with-odd-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 39943, "totalSubmissionRaw": 91391}, "1525": {"acRate": 68.310429503502, "difficulty": "Medium", "likes": 2052, "dislikes": 49, "categoryTitle": "Algorithms", "frontendQuestionId": "1525", "paidOnly": false, "title": "Number of Good Ways to Split a String", "titleSlug": "number-of-good-ways-to-split-a-string", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 105431, "totalSubmissionRaw": 154341}, "1526": {"acRate": 70.77774434078978, "difficulty": "Hard", "likes": 1489, "dislikes": 71, "categoryTitle": "Algorithms", "frontendQuestionId": "1526", "paidOnly": false, "title": "Minimum Number of Increments on Subarrays to Form a Target Array", "titleSlug": "minimum-number-of-increments-on-subarrays-to-form-a-target-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 42335, "totalSubmissionRaw": 59813}, "1527": {"acRate": 40.33537214867669, "difficulty": "Easy", "likes": 654, "dislikes": 571, "categoryTitle": "Database", "frontendQuestionId": "1527", "paidOnly": false, "title": "Patients With a Condition", "titleSlug": "patients-with-a-condition", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 238328, "totalSubmissionRaw": 590866}, "1528": {"acRate": 84.81875412499366, "difficulty": "Easy", "likes": 2752, "dislikes": 520, "categoryTitle": "Algorithms", "frontendQuestionId": "1528", "paidOnly": false, "title": "Shuffle String", "titleSlug": "shuffle-string", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 400962, "totalSubmissionRaw": 472728}, "1529": {"acRate": 73.39992649375196, "difficulty": "Medium", "likes": 1024, "dislikes": 43, "categoryTitle": "Algorithms", "frontendQuestionId": "1529", "paidOnly": false, "title": "Minimum Suffix Flips", "titleSlug": "minimum-suffix-flips", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 55919, "totalSubmissionRaw": 76184}, "1530": {"acRate": 71.89157105225722, "difficulty": "Medium", "likes": 2389, "dislikes": 103, "categoryTitle": "Algorithms", "frontendQuestionId": "1530", "paidOnly": false, "title": "Number of Good Leaf Nodes Pairs", "titleSlug": "number-of-good-leaf-nodes-pairs", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 146555, "totalSubmissionRaw": 203856}, "1531": {"acRate": 52.50788660174508, "difficulty": "Hard", "likes": 2431, "dislikes": 214, "categoryTitle": "Algorithms", "frontendQuestionId": "1531", "paidOnly": false, "title": "String Compression II", "titleSlug": "string-compression-ii", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 99535, "totalSubmissionRaw": 189562}, "1532": {"acRate": 68.37819911716946, "difficulty": "Medium", "likes": 152, "dislikes": 11, "categoryTitle": "Database", "frontendQuestionId": "1532", "paidOnly": true, "title": "The Most Recent Three Orders", "titleSlug": "the-most-recent-three-orders", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29897, "totalSubmissionRaw": 43723}, "1533": {"acRate": 56.173704222533516, "difficulty": "Medium", "likes": 247, "dislikes": 33, "categoryTitle": "Algorithms", "frontendQuestionId": "1533", "paidOnly": true, "title": "Find the Index of the Large Integer", "titleSlug": "find-the-index-of-the-large-integer", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 14035, "totalSubmissionRaw": 24985}, "1534": {"acRate": 81.38946984356573, "difficulty": "Easy", "likes": 764, "dislikes": 1201, "categoryTitle": "Algorithms", "frontendQuestionId": "1534", "paidOnly": false, "title": "Count Good Triplets", "titleSlug": "count-good-triplets", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 124919, "totalSubmissionRaw": 153483}, "1535": {"acRate": 57.02669432714897, "difficulty": "Medium", "likes": 1574, "dislikes": 81, "categoryTitle": "Algorithms", "frontendQuestionId": "1535", "paidOnly": false, "title": "Find the Winner of an Array Game", "titleSlug": "find-the-winner-of-an-array-game", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 116278, "totalSubmissionRaw": 203901}, "1536": {"acRate": 47.72580496355752, "difficulty": "Medium", "likes": 565, "dislikes": 71, "categoryTitle": "Algorithms", "frontendQuestionId": "1536", "paidOnly": false, "title": "Minimum Swaps to Arrange a Binary Grid", "titleSlug": "minimum-swaps-to-arrange-a-binary-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15519, "totalSubmissionRaw": 32517}, "1537": {"acRate": 39.54851781069935, "difficulty": "Hard", "likes": 986, "dislikes": 51, "categoryTitle": "Algorithms", "frontendQuestionId": "1537", "paidOnly": false, "title": "Get the Maximum Score", "titleSlug": "get-the-maximum-score", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27523, "totalSubmissionRaw": 69593}, "1538": {"acRate": 69.83101391650099, "difficulty": "Medium", "likes": 138, "dislikes": 116, "categoryTitle": "Algorithms", "frontendQuestionId": "1538", "paidOnly": true, "title": "Guess the Majority in a Hidden Array", "titleSlug": "guess-the-majority-in-a-hidden-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 4215, "totalSubmissionRaw": 6036}, "1539": {"acRate": 60.52583372200735, "difficulty": "Easy", "likes": 6682, "dislikes": 455, "categoryTitle": "Algorithms", "frontendQuestionId": "1539", "paidOnly": false, "title": "Kth Missing Positive Number", "titleSlug": "kth-missing-positive-number", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 465874, "totalSubmissionRaw": 769711}, "1540": {"acRate": 35.35357013722688, "difficulty": "Medium", "likes": 393, "dislikes": 316, "categoryTitle": "Algorithms", "frontendQuestionId": "1540", "paidOnly": false, "title": "Can Convert String in K Moves", "titleSlug": "can-convert-string-in-k-moves", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20533, "totalSubmissionRaw": 58079}, "1541": {"acRate": 52.69974550582744, "difficulty": "Medium", "likes": 1117, "dislikes": 264, "categoryTitle": "Algorithms", "frontendQuestionId": "1541", "paidOnly": false, "title": "Minimum Insertions to Balance a Parentheses String", "titleSlug": "minimum-insertions-to-balance-a-parentheses-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 65022, "totalSubmissionRaw": 123382}, "1542": {"acRate": 43.856595892794985, "difficulty": "Hard", "likes": 816, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "1542", "paidOnly": false, "title": "Find Longest Awesome Substring", "titleSlug": "find-longest-awesome-substring", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15120, "totalSubmissionRaw": 34476}, "1543": {"acRate": 59.35314435785447, "difficulty": "Easy", "likes": 88, "dislikes": 44, "categoryTitle": "Database", "frontendQuestionId": "1543", "paidOnly": true, "title": "Fix Product Name Format", "titleSlug": "fix-product-name-format", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20792, "totalSubmissionRaw": 35031}, "1544": {"acRate": 68.3451939545851, "difficulty": "Easy", "likes": 3027, "dislikes": 169, "categoryTitle": "Algorithms", "frontendQuestionId": "1544", "paidOnly": false, "title": "Make The String Great", "titleSlug": "make-the-string-great", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 322014, "totalSubmissionRaw": 471161}, "1545": {"acRate": 58.970965672120634, "difficulty": "Medium", "likes": 926, "dislikes": 57, "categoryTitle": "Algorithms", "frontendQuestionId": "1545", "paidOnly": false, "title": "Find Kth Bit in Nth Binary String", "titleSlug": "find-kth-bit-in-nth-binary-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 44115, "totalSubmissionRaw": 74808}, "1546": {"acRate": 47.83471996586751, "difficulty": "Medium", "likes": 1066, "dislikes": 28, "categoryTitle": "Algorithms", "frontendQuestionId": "1546", "paidOnly": false, "title": "Maximum Number of Non-Overlapping Subarrays With Sum Equals Target", "titleSlug": "maximum-number-of-non-overlapping-subarrays-with-sum-equals-target", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29150, "totalSubmissionRaw": 60939}, "1547": {"acRate": 61.698135602505346, "difficulty": "Hard", "likes": 4274, "dislikes": 111, "categoryTitle": "Algorithms", "frontendQuestionId": "1547", "paidOnly": false, "title": "Minimum Cost to Cut a Stick", "titleSlug": "minimum-cost-to-cut-a-stick", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 135149, "totalSubmissionRaw": 219049}, "1548": {"acRate": 59.24225419174915, "difficulty": "Hard", "likes": 377, "dislikes": 185, "categoryTitle": "Algorithms", "frontendQuestionId": "1548", "paidOnly": true, "title": "The Most Similar Path in a Graph", "titleSlug": "the-most-similar-path-in-a-graph", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 17419, "totalSubmissionRaw": 29403}, "1549": {"acRate": 64.86058370402516, "difficulty": "Medium", "likes": 134, "dislikes": 12, "categoryTitle": "Database", "frontendQuestionId": "1549", "paidOnly": true, "title": "The Most Recent Orders for Each Product", "titleSlug": "the-most-recent-orders-for-each-product", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 29891, "totalSubmissionRaw": 46085}, "1550": {"acRate": 68.31667993335344, "difficulty": "Easy", "likes": 1131, "dislikes": 94, "categoryTitle": "Algorithms", "frontendQuestionId": "1550", "paidOnly": false, "title": "Three Consecutive Odds", "titleSlug": "three-consecutive-odds", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 276356, "totalSubmissionRaw": 404522}, "1551": {"acRate": 82.4063684982105, "difficulty": "Medium", "likes": 1444, "dislikes": 183, "categoryTitle": "Algorithms", "frontendQuestionId": "1551", "paidOnly": false, "title": "Minimum Operations to Make Array Equal", "titleSlug": "minimum-operations-to-make-array-equal", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 100619, "totalSubmissionRaw": 122101}, "1552": {"acRate": 71.09412649965759, "difficulty": "Medium", "likes": 2883, "dislikes": 253, "categoryTitle": "Algorithms", "frontendQuestionId": "1552", "paidOnly": false, "title": "Magnetic Force Between Two Balls", "titleSlug": "magnetic-force-between-two-balls", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 168176, "totalSubmissionRaw": 236554}, "1553": {"acRate": 35.463933356366844, "difficulty": "Hard", "likes": 993, "dislikes": 58, "categoryTitle": "Algorithms", "frontendQuestionId": "1553", "paidOnly": false, "title": "Minimum Number of Days to Eat N Oranges", "titleSlug": "minimum-number-of-days-to-eat-n-oranges", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 36952, "totalSubmissionRaw": 104196}, "1554": {"acRate": 41.665826528211845, "difficulty": "Medium", "likes": 376, "dislikes": 98, "categoryTitle": "Algorithms", "frontendQuestionId": "1554", "paidOnly": true, "title": "Strings Differ by One Character", "titleSlug": "strings-differ-by-one-character", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24797, "totalSubmissionRaw": 59514}, "1555": {"acRate": 51.352392482733954, "difficulty": "Medium", "likes": 140, "dislikes": 28, "categoryTitle": "Database", "frontendQuestionId": "1555", "paidOnly": true, "title": "Bank Account Summary", "titleSlug": "bank-account-summary", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18663, "totalSubmissionRaw": 36343}, "1556": {"acRate": 53.73657377617186, "difficulty": "Easy", "likes": 489, "dislikes": 40, "categoryTitle": "Algorithms", "frontendQuestionId": "1556", "paidOnly": false, "title": "Thousand Separator", "titleSlug": "thousand-separator", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 54282, "totalSubmissionRaw": 101015}, "1557": {"acRate": 81.05572000243053, "difficulty": "Medium", "likes": 3696, "dislikes": 129, "categoryTitle": "Algorithms", "frontendQuestionId": "1557", "paidOnly": false, "title": "Minimum Number of Vertices to Reach All Nodes", "titleSlug": "minimum-number-of-vertices-to-reach-all-nodes", "topicTags": [{"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 186754, "totalSubmissionRaw": 230402}, "1558": {"acRate": 63.70972373786687, "difficulty": "Medium", "likes": 627, "dislikes": 35, "categoryTitle": "Algorithms", "frontendQuestionId": "1558", "paidOnly": false, "title": "Minimum Numbers of Function Calls to Make Target Array", "titleSlug": "minimum-numbers-of-function-calls-to-make-target-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22185, "totalSubmissionRaw": 34822}, "1559": {"acRate": 48.77725495393996, "difficulty": "Medium", "likes": 1162, "dislikes": 28, "categoryTitle": "Algorithms", "frontendQuestionId": "1559", "paidOnly": false, "title": "Detect Cycles in 2D Grid", "titleSlug": "detect-cycles-in-2d-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 44160, "totalSubmissionRaw": 90534}, "1560": {"acRate": 58.947481975583884, "difficulty": "Easy", "likes": 317, "dislikes": 633, "categoryTitle": "Algorithms", "frontendQuestionId": "1560", "paidOnly": false, "title": "Most Visited Sector in  a Circular Track", "titleSlug": "most-visited-sector-in-a-circular-track", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 32786, "totalSubmissionRaw": 55619}, "1561": {"acRate": 84.47735331236603, "difficulty": "Medium", "likes": 1889, "dislikes": 212, "categoryTitle": "Algorithms", "frontendQuestionId": "1561", "paidOnly": false, "title": "Maximum Number of Coins You Can Get", "titleSlug": "maximum-number-of-coins-you-can-get", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 168681, "totalSubmissionRaw": 199676}, "1562": {"acRate": 42.96306498634162, "difficulty": "Medium", "likes": 648, "dislikes": 134, "categoryTitle": "Algorithms", "frontendQuestionId": "1562", "paidOnly": false, "title": "Find Latest Group of Size M", "titleSlug": "find-latest-group-of-size-m", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18716, "totalSubmissionRaw": 43563}, "1563": {"acRate": 40.92781658606484, "difficulty": "Hard", "likes": 648, "dislikes": 88, "categoryTitle": "Algorithms", "frontendQuestionId": "1563", "paidOnly": false, "title": "Stone Game V", "titleSlug": "stone-game-v", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20565, "totalSubmissionRaw": 50247}, "1564": {"acRate": 67.37896358770578, "difficulty": "Medium", "likes": 337, "dislikes": 30, "categoryTitle": "Algorithms", "frontendQuestionId": "1564", "paidOnly": true, "title": "Put Boxes Into the Warehouse I", "titleSlug": "put-boxes-into-the-warehouse-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 16617, "totalSubmissionRaw": 24662}, "1565": {"acRate": 82.10495283018868, "difficulty": "Easy", "likes": 77, "dislikes": 45, "categoryTitle": "Database", "frontendQuestionId": "1565", "paidOnly": true, "title": "Unique Orders and Customers Per Month", "titleSlug": "unique-orders-and-customers-per-month", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22280, "totalSubmissionRaw": 27136}, "1566": {"acRate": 43.27713765918739, "difficulty": "Easy", "likes": 655, "dislikes": 135, "categoryTitle": "Algorithms", "frontendQuestionId": "1566", "paidOnly": false, "title": "Detect Pattern of Length M Repeated K or More Times", "titleSlug": "detect-pattern-of-length-m-repeated-k-or-more-times", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 35682, "totalSubmissionRaw": 82450}, "1567": {"acRate": 44.28310593535963, "difficulty": "Medium", "likes": 2413, "dislikes": 69, "categoryTitle": "Algorithms", "frontendQuestionId": "1567", "paidOnly": false, "title": "Maximum Length of Subarray With Positive Product", "titleSlug": "maximum-length-of-subarray-with-positive-product", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 97499, "totalSubmissionRaw": 220172}, "1568": {"acRate": 60.023841574079654, "difficulty": "Hard", "likes": 1215, "dislikes": 216, "categoryTitle": "Algorithms", "frontendQuestionId": "1568", "paidOnly": false, "title": "Minimum Number of Days to Disconnect Island", "titleSlug": "minimum-number-of-days-to-disconnect-island", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Strongly Connected Component", "id": "VG9waWNUYWdOb2RlOjYxMDg1", "slug": "strongly-connected-component"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 89627, "totalSubmissionRaw": 149319}, "1569": {"acRate": 53.51389390798258, "difficulty": "Hard", "likes": 1789, "dislikes": 207, "categoryTitle": "Algorithms", "frontendQuestionId": "1569", "paidOnly": false, "title": "Number of Ways to Reorder Array to Get Same BST", "titleSlug": "number-of-ways-to-reorder-array-to-get-same-bst", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 56272, "totalSubmissionRaw": 105154}, "1570": {"acRate": 89.82706809173226, "difficulty": "Medium", "likes": 1213, "dislikes": 146, "categoryTitle": "Algorithms", "frontendQuestionId": "1570", "paidOnly": true, "title": "Dot Product of Two Sparse Vectors", "titleSlug": "dot-product-of-two-sparse-vectors", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 271716, "totalSubmissionRaw": 302488}, "1571": {"acRate": 87.72533762450858, "difficulty": "Easy", "likes": 159, "dislikes": 11, "categoryTitle": "Database", "frontendQuestionId": "1571", "paidOnly": true, "title": "Warehouse Manager", "titleSlug": "warehouse-manager", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 43067, "totalSubmissionRaw": 49093}, "1572": {"acRate": 83.15509857744516, "difficulty": "Easy", "likes": 3492, "dislikes": 55, "categoryTitle": "Algorithms", "frontendQuestionId": "1572", "paidOnly": false, "title": "Matrix Diagonal Sum", "titleSlug": "matrix-diagonal-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 375338, "totalSubmissionRaw": 451371}, "1573": {"acRate": 33.49415919587069, "difficulty": "Medium", "likes": 740, "dislikes": 84, "categoryTitle": "Algorithms", "frontendQuestionId": "1573", "paidOnly": false, "title": "Number of Ways to Split a String", "titleSlug": "number-of-ways-to-split-a-string", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30823, "totalSubmissionRaw": 92025}, "1574": {"acRate": 38.08973778846841, "difficulty": "Medium", "likes": 1618, "dislikes": 61, "categoryTitle": "Algorithms", "frontendQuestionId": "1574", "paidOnly": false, "title": "Shortest Subarray to be Removed to Make Array Sorted", "titleSlug": "shortest-subarray-to-be-removed-to-make-array-sorted", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 31987, "totalSubmissionRaw": 83978}, "1575": {"acRate": 65.27181767648693, "difficulty": "Hard", "likes": 1624, "dislikes": 60, "categoryTitle": "Algorithms", "frontendQuestionId": "1575", "paidOnly": false, "title": "Count All Possible Routes", "titleSlug": "count-all-possible-routes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 58712, "totalSubmissionRaw": 89950}, "1576": {"acRate": 46.231892688591465, "difficulty": "Easy", "likes": 562, "dislikes": 178, "categoryTitle": "Algorithms", "frontendQuestionId": "1576", "paidOnly": false, "title": "Replace All ?'s to Avoid Consecutive Repeating Characters", "titleSlug": "replace-all-s-to-avoid-consecutive-repeating-characters", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 62107, "totalSubmissionRaw": 134338}, "1577": {"acRate": 41.47483118477594, "difficulty": "Medium", "likes": 374, "dislikes": 53, "categoryTitle": "Algorithms", "frontendQuestionId": "1577", "paidOnly": false, "title": "Number of Ways Where Square of Number Is Equal to Product of Two Numbers", "titleSlug": "number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21620, "totalSubmissionRaw": 52128}, "1578": {"acRate": 63.72281152898318, "difficulty": "Medium", "likes": 3820, "dislikes": 135, "categoryTitle": "Algorithms", "frontendQuestionId": "1578", "paidOnly": false, "title": "Minimum Time to Make Rope Colorful", "titleSlug": "minimum-time-to-make-rope-colorful", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 261679, "totalSubmissionRaw": 410652}, "1579": {"acRate": 70.94227143433199, "difficulty": "Hard", "likes": 2530, "dislikes": 44, "categoryTitle": "Algorithms", "frontendQuestionId": "1579", "paidOnly": false, "title": "Remove Max Number of Edges to Keep Graph Fully Traversable", "titleSlug": "remove-max-number-of-edges-to-keep-graph-fully-traversable", "topicTags": [{"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 130189, "totalSubmissionRaw": 183514}, "1580": {"acRate": 66.20990814636349, "difficulty": "Medium", "likes": 220, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "1580", "paidOnly": true, "title": "Put Boxes Into the Warehouse II", "titleSlug": "put-boxes-into-the-warehouse-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 8794, "totalSubmissionRaw": 13282}, "1581": {"acRate": 67.94288527286105, "difficulty": "Easy", "likes": 2104, "dislikes": 291, "categoryTitle": "Database", "frontendQuestionId": "1581", "paidOnly": false, "title": "Customer Who Visited but Did Not Make Any Transactions", "titleSlug": "customer-who-visited-but-did-not-make-any-transactions", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 502374, "totalSubmissionRaw": 739411}, "1582": {"acRate": 68.65151284569943, "difficulty": "Easy", "likes": 1452, "dislikes": 69, "categoryTitle": "Algorithms", "frontendQuestionId": "1582", "paidOnly": false, "title": "Special Positions in a Binary Matrix", "titleSlug": "special-positions-in-a-binary-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 148866, "totalSubmissionRaw": 216843}, "1583": {"acRate": 61.633017005286284, "difficulty": "Medium", "likes": 286, "dislikes": 860, "categoryTitle": "Algorithms", "frontendQuestionId": "1583", "paidOnly": false, "title": "Count Unhappy Friends", "titleSlug": "count-unhappy-friends", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29031, "totalSubmissionRaw": 47103}, "1584": {"acRate": 67.34757244190216, "difficulty": "Medium", "likes": 5072, "dislikes": 129, "categoryTitle": "Algorithms", "frontendQuestionId": "1584", "paidOnly": false, "title": "Min Cost to Connect All Points", "titleSlug": "min-cost-to-connect-all-points", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Minimum Spanning Tree", "id": "VG9waWNUYWdOb2RlOjYxMDgz", "slug": "minimum-spanning-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 308002, "totalSubmissionRaw": 457332}, "1585": {"acRate": 48.690463034589456, "difficulty": "Hard", "likes": 438, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "1585", "paidOnly": false, "title": "Check If String Is Transformable With Substring Sort Operations", "titleSlug": "check-if-string-is-transformable-with-substring-sort-operations", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8812, "totalSubmissionRaw": 18098}, "1586": {"acRate": 63.634344600897265, "difficulty": "Medium", "likes": 261, "dislikes": 48, "categoryTitle": "Algorithms", "frontendQuestionId": "1586", "paidOnly": true, "title": "Binary Search Tree Iterator II", "titleSlug": "binary-search-tree-iterator-ii", "topicTags": [{"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}, {"name": "Iterator", "id": "VG9waWNUYWdOb2RlOjYxMDY0", "slug": "iterator"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 14324, "totalSubmissionRaw": 22511}, "1587": {"acRate": 83.37428400313273, "difficulty": "Easy", "likes": 479, "dislikes": 5, "categoryTitle": "Database", "frontendQuestionId": "1587", "paidOnly": false, "title": "Bank Account Summary II", "titleSlug": "bank-account-summary-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 108585, "totalSubmissionRaw": 130238}, "1588": {"acRate": 83.17646297778748, "difficulty": "Easy", "likes": 3706, "dislikes": 301, "categoryTitle": "Algorithms", "frontendQuestionId": "1588", "paidOnly": false, "title": "Sum of All Odd Length Subarrays", "titleSlug": "sum-of-all-odd-length-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 205728, "totalSubmissionRaw": 247339}, "1589": {"acRate": 38.25869180907484, "difficulty": "Medium", "likes": 769, "dislikes": 38, "categoryTitle": "Algorithms", "frontendQuestionId": "1589", "paidOnly": false, "title": "Maximum Sum Obtained of Any Permutation", "titleSlug": "maximum-sum-obtained-of-any-permutation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20776, "totalSubmissionRaw": 54304}, "1590": {"acRate": 29.18393339162833, "difficulty": "Medium", "likes": 1548, "dislikes": 69, "categoryTitle": "Algorithms", "frontendQuestionId": "1590", "paidOnly": false, "title": "Make Sum Divisible by P", "titleSlug": "make-sum-divisible-by-p", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30705, "totalSubmissionRaw": 105212}, "1591": {"acRate": 59.18934211203128, "difficulty": "Hard", "likes": 628, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "1591", "paidOnly": false, "title": "Strange Printer II", "titleSlug": "strange-printer-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11507, "totalSubmissionRaw": 19441}, "1592": {"acRate": 43.32969180805446, "difficulty": "Easy", "likes": 458, "dislikes": 349, "categoryTitle": "Algorithms", "frontendQuestionId": "1592", "paidOnly": false, "title": "Rearrange Spaces Between Words", "titleSlug": "rearrange-spaces-between-words", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 58304, "totalSubmissionRaw": 134559}, "1593": {"acRate": 56.74244290389555, "difficulty": "Medium", "likes": 842, "dislikes": 37, "categoryTitle": "Algorithms", "frontendQuestionId": "1593", "paidOnly": false, "title": "Split a String Into the Max Number of Unique Substrings", "titleSlug": "split-a-string-into-the-max-number-of-unique-substrings", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 32249, "totalSubmissionRaw": 56834}, "1594": {"acRate": 33.91600793198055, "difficulty": "Medium", "likes": 835, "dislikes": 41, "categoryTitle": "Algorithms", "frontendQuestionId": "1594", "paidOnly": false, "title": "Maximum Non Negative Product in a Matrix", "titleSlug": "maximum-non-negative-product-in-a-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24971, "totalSubmissionRaw": 73626}, "1595": {"acRate": 48.247950819672134, "difficulty": "Hard", "likes": 472, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "1595", "paidOnly": false, "title": "Minimum Cost to Connect Two Groups of Points", "titleSlug": "minimum-cost-to-connect-two-groups-of-points", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9418, "totalSubmissionRaw": 19520}, "1596": {"acRate": 78.43567251461988, "difficulty": "Medium", "likes": 242, "dislikes": 17, "categoryTitle": "Database", "frontendQuestionId": "1596", "paidOnly": true, "title": "The Most Frequently Ordered Products for Each Customer", "titleSlug": "the-most-frequently-ordered-products-for-each-customer", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34336, "totalSubmissionRaw": 43776}, "1597": {"acRate": 62.514721816554385, "difficulty": "Hard", "likes": 267, "dislikes": 46, "categoryTitle": "Algorithms", "frontendQuestionId": "1597", "paidOnly": true, "title": "Build Binary Expression Tree From Infix Expression", "titleSlug": "build-binary-expression-tree-from-infix-expression", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13270, "totalSubmissionRaw": 21227}, "1598": {"acRate": 71.76557274516132, "difficulty": "Easy", "likes": 1444, "dislikes": 96, "categoryTitle": "Algorithms", "frontendQuestionId": "1598", "paidOnly": false, "title": "Crawler Log Folder", "titleSlug": "crawler-log-folder", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 251285, "totalSubmissionRaw": 350147}, "1599": {"acRate": 44.20156622403814, "difficulty": "Medium", "likes": 109, "dislikes": 247, "categoryTitle": "Algorithms", "frontendQuestionId": "1599", "paidOnly": false, "title": "Maximum Profit of Operating a Centennial Wheel", "titleSlug": "maximum-profit-of-operating-a-centennial-wheel", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12982, "totalSubmissionRaw": 29370}, "1600": {"acRate": 65.55017103762827, "difficulty": "Medium", "likes": 294, "dislikes": 306, "categoryTitle": "Algorithms", "frontendQuestionId": "1600", "paidOnly": false, "title": "Throne Inheritance", "titleSlug": "throne-inheritance", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18396, "totalSubmissionRaw": 28064}, "1601": {"acRate": 64.52231757707851, "difficulty": "Hard", "likes": 1416, "dislikes": 72, "categoryTitle": "Algorithms", "frontendQuestionId": "1601", "paidOnly": false, "title": "Maximum Number of Achievable Transfer Requests", "titleSlug": "maximum-number-of-achievable-transfer-requests", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 56839, "totalSubmissionRaw": 88092}, "1602": {"acRate": 75.43825603208487, "difficulty": "Medium", "likes": 329, "dislikes": 10, "categoryTitle": "Algorithms", "frontendQuestionId": "1602", "paidOnly": true, "title": "Find Nearest Right Node in Binary Tree", "titleSlug": "find-nearest-right-node-in-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 23324, "totalSubmissionRaw": 30918}, "1603": {"acRate": 87.98412756464177, "difficulty": "Easy", "likes": 1949, "dislikes": 448, "categoryTitle": "Algorithms", "frontendQuestionId": "1603", "paidOnly": false, "title": "Design Parking System", "titleSlug": "design-parking-system", "topicTags": [{"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 288689, "totalSubmissionRaw": 328115}, "1604": {"acRate": 45.88675082730727, "difficulty": "Medium", "likes": 311, "dislikes": 422, "categoryTitle": "Algorithms", "frontendQuestionId": "1604", "paidOnly": false, "title": "Alert Using Same Key-Card Three or More Times in a One Hour Period", "titleSlug": "alert-using-same-key-card-three-or-more-times-in-a-one-hour-period", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 37439, "totalSubmissionRaw": 81590}, "1605": {"acRate": 83.13491386662119, "difficulty": "Medium", "likes": 2119, "dislikes": 88, "categoryTitle": "Algorithms", "frontendQuestionId": "1605", "paidOnly": false, "title": "Find Valid Matrix Given Row and Column Sums", "titleSlug": "find-valid-matrix-given-row-and-column-sums", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 146226, "totalSubmissionRaw": 175890}, "1606": {"acRate": 43.64568997873139, "difficulty": "Hard", "likes": 609, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "1606", "paidOnly": false, "title": "Find Servers That Handled Most Number of Requests", "titleSlug": "find-servers-that-handled-most-number-of-requests", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 17443, "totalSubmissionRaw": 39965}, "1607": {"acRate": 54.355209817026406, "difficulty": "Easy", "likes": 134, "dislikes": 14, "categoryTitle": "Database", "frontendQuestionId": "1607", "paidOnly": true, "title": "Sellers With No Sales", "titleSlug": "sellers-with-no-sales", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 34727, "totalSubmissionRaw": 63889}, "1608": {"acRate": 66.89342251427152, "difficulty": "Easy", "likes": 2198, "dislikes": 425, "categoryTitle": "Algorithms", "frontendQuestionId": "1608", "paidOnly": false, "title": "Special Array With X Elements Greater Than or Equal X", "titleSlug": "special-array-with-x-elements-greater-than-or-equal-x", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 199320, "totalSubmissionRaw": 297968}, "1609": {"acRate": 65.88051794932677, "difficulty": "Medium", "likes": 1772, "dislikes": 94, "categoryTitle": "Algorithms", "frontendQuestionId": "1609", "paidOnly": false, "title": "Even Odd Tree", "titleSlug": "even-odd-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 160927, "totalSubmissionRaw": 244271}, "1610": {"acRate": 37.441416107866466, "difficulty": "Hard", "likes": 579, "dislikes": 748, "categoryTitle": "Algorithms", "frontendQuestionId": "1610", "paidOnly": false, "title": "Maximum Number of Visible Points", "titleSlug": "maximum-number-of-visible-points", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 41541, "totalSubmissionRaw": 110951}, "1611": {"acRate": 74.06362619609791, "difficulty": "Hard", "likes": 925, "dislikes": 1024, "categoryTitle": "Algorithms", "frontendQuestionId": "1611", "paidOnly": false, "title": "Minimum One Bit Operations to Make Integers Zero", "titleSlug": "minimum-one-bit-operations-to-make-integers-zero", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 59599, "totalSubmissionRaw": 80470}, "1612": {"acRate": 70.60708898944193, "difficulty": "Medium", "likes": 140, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "1612", "paidOnly": true, "title": "Check If Two Expression Trees are Equivalent", "titleSlug": "check-if-two-expression-trees-are-equivalent", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7490, "totalSubmissionRaw": 10608}, "1613": {"acRate": 72.97348341769283, "difficulty": "Medium", "likes": 226, "dislikes": 28, "categoryTitle": "Database", "frontendQuestionId": "1613", "paidOnly": true, "title": "Find the Missing IDs", "titleSlug": "find-the-missing-ids", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19319, "totalSubmissionRaw": 26474}, "1614": {"acRate": 83.90099065107893, "difficulty": "Easy", "likes": 2466, "dislikes": 504, "categoryTitle": "Algorithms", "frontendQuestionId": "1614", "paidOnly": false, "title": "Maximum Nesting Depth of the Parentheses", "titleSlug": "maximum-nesting-depth-of-the-parentheses", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 361129, "totalSubmissionRaw": 430423}, "1615": {"acRate": 65.15105470146587, "difficulty": "Medium", "likes": 2351, "dislikes": 369, "categoryTitle": "Algorithms", "frontendQuestionId": "1615", "paidOnly": false, "title": "Maximal Network Rank", "titleSlug": "maximal-network-rank", "topicTags": [{"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 145782, "totalSubmissionRaw": 223760}, "1616": {"acRate": 31.07031061882976, "difficulty": "Medium", "likes": 735, "dislikes": 248, "categoryTitle": "Algorithms", "frontendQuestionId": "1616", "paidOnly": false, "title": "Split Two Strings to Make Palindrome", "titleSlug": "split-two-strings-to-make-palindrome", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25807, "totalSubmissionRaw": 83060}, "1617": {"acRate": 66.33117661155045, "difficulty": "Hard", "likes": 544, "dislikes": 41, "categoryTitle": "Algorithms", "frontendQuestionId": "1617", "paidOnly": false, "title": "Count Subtrees With Max Distance Between Cities", "titleSlug": "count-subtrees-with-max-distance-between-cities", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11072, "totalSubmissionRaw": 16692}, "1618": {"acRate": 60.945755547728076, "difficulty": "Medium", "likes": 108, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "1618", "paidOnly": true, "title": "Maximum Font to Fit a Sentence in a Screen", "titleSlug": "maximum-font-to-fit-a-sentence-in-a-screen", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6921, "totalSubmissionRaw": 11356}, "1619": {"acRate": 68.84999780826722, "difficulty": "Easy", "likes": 499, "dislikes": 128, "categoryTitle": "Algorithms", "frontendQuestionId": "1619", "paidOnly": false, "title": "Mean of Array After Removing Some Elements", "titleSlug": "mean-of-array-after-removing-some-elements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 62827, "totalSubmissionRaw": 91252}, "1620": {"acRate": 38.0712351593418, "difficulty": "Medium", "likes": 80, "dislikes": 266, "categoryTitle": "Algorithms", "frontendQuestionId": "1620", "paidOnly": false, "title": "Coordinate With Maximum Network Quality", "titleSlug": "coordinate-with-maximum-network-quality", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9139, "totalSubmissionRaw": 24005}, "1621": {"acRate": 43.7304472816437, "difficulty": "Medium", "likes": 461, "dislikes": 47, "categoryTitle": "Algorithms", "frontendQuestionId": "1621", "paidOnly": false, "title": "Number of Sets of K Non-Overlapping Line Segments", "titleSlug": "number-of-sets-of-k-non-overlapping-line-segments", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10344, "totalSubmissionRaw": 23654}, "1622": {"acRate": 17.447634588602696, "difficulty": "Hard", "likes": 370, "dislikes": 138, "categoryTitle": "Algorithms", "frontendQuestionId": "1622", "paidOnly": false, "title": "Fancy Sequence", "titleSlug": "fancy-sequence", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12403, "totalSubmissionRaw": 71087}, "1623": {"acRate": 81.96761232192866, "difficulty": "Easy", "likes": 73, "dislikes": 138, "categoryTitle": "Database", "frontendQuestionId": "1623", "paidOnly": true, "title": "All Valid Triplets That Can Represent a Country", "titleSlug": "all-valid-triplets-that-can-represent-a-country", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20196, "totalSubmissionRaw": 24639}, "1624": {"acRate": 68.54776227246215, "difficulty": "Easy", "likes": 1343, "dislikes": 64, "categoryTitle": "Algorithms", "frontendQuestionId": "1624", "paidOnly": false, "title": "Largest Substring Between Two Equal Characters", "titleSlug": "largest-substring-between-two-equal-characters", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 157483, "totalSubmissionRaw": 229742}, "1625": {"acRate": 65.55172560534491, "difficulty": "Medium", "likes": 355, "dislikes": 274, "categoryTitle": "Algorithms", "frontendQuestionId": "1625", "paidOnly": false, "title": "Lexicographically Smallest String After Applying Operations", "titleSlug": "lexicographically-smallest-string-after-applying-operations", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15404, "totalSubmissionRaw": 23499}, "1626": {"acRate": 50.38769369819354, "difficulty": "Medium", "likes": 2947, "dislikes": 95, "categoryTitle": "Algorithms", "frontendQuestionId": "1626", "paidOnly": false, "title": "Best Team With No Conflicts", "titleSlug": "best-team-with-no-conflicts", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 84739, "totalSubmissionRaw": 168174}, "1627": {"acRate": 47.25689027561103, "difficulty": "Hard", "likes": 581, "dislikes": 33, "categoryTitle": "Algorithms", "frontendQuestionId": "1627", "paidOnly": false, "title": "Graph Connectivity With Threshold", "titleSlug": "graph-connectivity-with-threshold", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18175, "totalSubmissionRaw": 38460}, "1628": {"acRate": 82.54149090125318, "difficulty": "Medium", "likes": 536, "dislikes": 72, "categoryTitle": "Algorithms", "frontendQuestionId": "1628", "paidOnly": true, "title": "Design an Expression Tree With Evaluate Function", "titleSlug": "design-an-expression-tree-with-evaluate-function", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26807, "totalSubmissionRaw": 32477}, "1629": {"acRate": 59.117069184358314, "difficulty": "Easy", "likes": 764, "dislikes": 109, "categoryTitle": "Algorithms", "frontendQuestionId": "1629", "paidOnly": false, "title": "Slowest Key", "titleSlug": "slowest-key", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 102000, "totalSubmissionRaw": 172539}, "1630": {"acRate": 83.74443292233364, "difficulty": "Medium", "likes": 1819, "dislikes": 203, "categoryTitle": "Algorithms", "frontendQuestionId": "1630", "paidOnly": false, "title": "Arithmetic Subarrays", "titleSlug": "arithmetic-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 139710, "totalSubmissionRaw": 166829}, "1631": {"acRate": 60.093386833497, "difficulty": "Medium", "likes": 5926, "dislikes": 204, "categoryTitle": "Algorithms", "frontendQuestionId": "1631", "paidOnly": false, "title": "Path With Minimum Effort", "titleSlug": "path-with-minimum-effort", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 277215, "totalSubmissionRaw": 461307}, "1632": {"acRate": 40.97972419069827, "difficulty": "Hard", "likes": 874, "dislikes": 55, "categoryTitle": "Algorithms", "frontendQuestionId": "1632", "paidOnly": false, "title": "Rank Transform of a Matrix", "titleSlug": "rank-transform-of-a-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 22495, "totalSubmissionRaw": 54893}, "1633": {"acRate": 56.85513199273187, "difficulty": "Easy", "likes": 692, "dislikes": 74, "categoryTitle": "Database", "frontendQuestionId": "1633", "paidOnly": false, "title": "Percentage of Users Attended a Contest", "titleSlug": "percentage-of-users-attended-a-contest", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 214963, "totalSubmissionRaw": 378089}, "1634": {"acRate": 55.50764192139738, "difficulty": "Medium", "likes": 144, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "1634", "paidOnly": true, "title": "Add Two Polynomials Represented as Linked Lists", "titleSlug": "add-two-polynomials-represented-as-linked-lists", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10169, "totalSubmissionRaw": 18320}, "1635": {"acRate": 47.73264442367944, "difficulty": "Hard", "likes": 109, "dislikes": 35, "categoryTitle": "Database", "frontendQuestionId": "1635", "paidOnly": true, "title": "Hopper Company Queries I", "titleSlug": "hopper-company-queries-i", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 8684, "totalSubmissionRaw": 18193}, "1636": {"acRate": 79.78175786762888, "difficulty": "Easy", "likes": 3403, "dislikes": 155, "categoryTitle": "Algorithms", "frontendQuestionId": "1636", "paidOnly": false, "title": "Sort Array by Increasing Frequency", "titleSlug": "sort-array-by-increasing-frequency", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 274174, "totalSubmissionRaw": 343655}, "1637": {"acRate": 87.39568560125402, "difficulty": "Easy", "likes": 933, "dislikes": 1726, "categoryTitle": "Algorithms", "frontendQuestionId": "1637", "paidOnly": false, "title": "Widest Vertical Area Between Two Points Containing No Points", "titleSlug": "widest-vertical-area-between-two-points-containing-no-points", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 175626, "totalSubmissionRaw": 200955}, "1638": {"acRate": 71.28915580427217, "difficulty": "Medium", "likes": 1153, "dislikes": 347, "categoryTitle": "Algorithms", "frontendQuestionId": "1638", "paidOnly": false, "title": "Count Substrings That Differ by One Character", "titleSlug": "count-substrings-that-differ-by-one-character", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 31338, "totalSubmissionRaw": 43959}, "1639": {"acRate": 51.00344137374021, "difficulty": "Hard", "likes": 1573, "dislikes": 87, "categoryTitle": "Algorithms", "frontendQuestionId": "1639", "paidOnly": false, "title": "Number of Ways to Form a Target String Given a Dictionary", "titleSlug": "number-of-ways-to-form-a-target-string-given-a-dictionary", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 58097, "totalSubmissionRaw": 113908}, "1640": {"acRate": 56.64018161180476, "difficulty": "Easy", "likes": 900, "dislikes": 141, "categoryTitle": "Algorithms", "frontendQuestionId": "1640", "paidOnly": false, "title": "Check Array Formation Through Concatenation", "titleSlug": "check-array-formation-through-concatenation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 83333, "totalSubmissionRaw": 147127}, "1641": {"acRate": 78.56149033134211, "difficulty": "Medium", "likes": 3862, "dislikes": 90, "categoryTitle": "Algorithms", "frontendQuestionId": "1641", "paidOnly": false, "title": "Count Sorted Vowel Strings", "titleSlug": "count-sorted-vowel-strings", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 188590, "totalSubmissionRaw": 240054}, "1642": {"acRate": 49.823852238423264, "difficulty": "Medium", "likes": 5896, "dislikes": 140, "categoryTitle": "Algorithms", "frontendQuestionId": "1642", "paidOnly": false, "title": "Furthest Building You Can Reach", "titleSlug": "furthest-building-you-can-reach", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 231232, "totalSubmissionRaw": 464097}, "1643": {"acRate": 48.32958094269736, "difficulty": "Hard", "likes": 549, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "1643", "paidOnly": false, "title": "Kth Smallest Instructions", "titleSlug": "kth-smallest-instructions", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13309, "totalSubmissionRaw": 27538}, "1644": {"acRate": 64.85160828941436, "difficulty": "Medium", "likes": 637, "dislikes": 37, "categoryTitle": "Algorithms", "frontendQuestionId": "1644", "paidOnly": true, "title": "Lowest Common Ancestor of a Binary Tree II", "titleSlug": "lowest-common-ancestor-of-a-binary-tree-ii", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 83428, "totalSubmissionRaw": 128640}, "1645": {"acRate": 39.150227617602425, "difficulty": "Hard", "likes": 61, "dislikes": 17, "categoryTitle": "Database", "frontendQuestionId": "1645", "paidOnly": true, "title": "Hopper Company Queries II", "titleSlug": "hopper-company-queries-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6708, "totalSubmissionRaw": 17134}, "1646": {"acRate": 50.530416651424815, "difficulty": "Easy", "likes": 760, "dislikes": 945, "categoryTitle": "Algorithms", "frontendQuestionId": "1646", "paidOnly": false, "title": "Get Maximum in Generated Array", "titleSlug": "get-maximum-in-generated-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 110508, "totalSubmissionRaw": 218696}, "1647": {"acRate": 61.257472850118496, "difficulty": "Medium", "likes": 4932, "dislikes": 73, "categoryTitle": "Algorithms", "frontendQuestionId": "1647", "paidOnly": false, "title": "Minimum Deletions to Make Character Frequencies Unique", "titleSlug": "minimum-deletions-to-make-character-frequencies-unique", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 277070, "totalSubmissionRaw": 452304}, "1648": {"acRate": 29.9776567957957, "difficulty": "Medium", "likes": 1077, "dislikes": 385, "categoryTitle": "Algorithms", "frontendQuestionId": "1648", "paidOnly": false, "title": "Sell Diminishing-Valued Colored Balls", "titleSlug": "sell-diminishing-valued-colored-balls", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 38104, "totalSubmissionRaw": 127108}, "1649": {"acRate": 39.13428213258609, "difficulty": "Hard", "likes": 653, "dislikes": 81, "categoryTitle": "Algorithms", "frontendQuestionId": "1649", "paidOnly": false, "title": "Create Sorted Array through Instructions", "titleSlug": "create-sorted-array-through-instructions", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Merge Sort", "id": "VG9waWNUYWdOb2RlOjYxMDUx", "slug": "merge-sort"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 26535, "totalSubmissionRaw": 67805}, "1650": {"acRate": 80.15879824235319, "difficulty": "Medium", "likes": 1389, "dislikes": 53, "categoryTitle": "Algorithms", "frontendQuestionId": "1650", "paidOnly": true, "title": "Lowest Common Ancestor of a Binary Tree III", "titleSlug": "lowest-common-ancestor-of-a-binary-tree-iii", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 252291, "totalSubmissionRaw": 314739}, "1651": {"acRate": 65.20136131593874, "difficulty": "Hard", "likes": 34, "dislikes": 62, "categoryTitle": "Database", "frontendQuestionId": "1651", "paidOnly": true, "title": "Hopper Company Queries III", "titleSlug": "hopper-company-queries-iii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6897, "totalSubmissionRaw": 10578}, "1652": {"acRate": 66.40094127601068, "difficulty": "Easy", "likes": 804, "dislikes": 97, "categoryTitle": "Algorithms", "frontendQuestionId": "1652", "paidOnly": false, "title": "Defuse the Bomb", "titleSlug": "defuse-the-bomb", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 50227, "totalSubmissionRaw": 75642}, "1653": {"acRate": 65.85488995246735, "difficulty": "Medium", "likes": 2069, "dislikes": 66, "categoryTitle": "Algorithms", "frontendQuestionId": "1653", "paidOnly": false, "title": "Minimum Deletions to Make String Balanced", "titleSlug": "minimum-deletions-to-make-string-balanced", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 160436, "totalSubmissionRaw": 243621}, "1654": {"acRate": 29.542175083951193, "difficulty": "Medium", "likes": 1485, "dislikes": 270, "categoryTitle": "Algorithms", "frontendQuestionId": "1654", "paidOnly": false, "title": "Minimum Jumps to Reach Home", "titleSlug": "minimum-jumps-to-reach-home", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 44427, "totalSubmissionRaw": 150385}, "1655": {"acRate": 39.59859988416308, "difficulty": "Hard", "likes": 427, "dislikes": 26, "categoryTitle": "Algorithms", "frontendQuestionId": "1655", "paidOnly": false, "title": "Distribute Repeating Integers", "titleSlug": "distribute-repeating-integers", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15725, "totalSubmissionRaw": 39711}, "1656": {"acRate": 84.33663254127158, "difficulty": "Easy", "likes": 528, "dislikes": 3494, "categoryTitle": "Algorithms", "frontendQuestionId": "1656", "paidOnly": false, "title": "Design an Ordered Stream", "titleSlug": "design-an-ordered-stream", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Data Stream", "id": "VG9waWNUYWdOb2RlOjYxMDYz", "slug": "data-stream"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 89299, "totalSubmissionRaw": 105884}, "1657": {"acRate": 54.50125475205561, "difficulty": "Medium", "likes": 3696, "dislikes": 296, "categoryTitle": "Algorithms", "frontendQuestionId": "1657", "paidOnly": false, "title": "Determine if Two Strings Are Close", "titleSlug": "determine-if-two-strings-are-close", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 364426, "totalSubmissionRaw": 668656}, "1658": {"acRate": 39.77238773357291, "difficulty": "Medium", "likes": 5462, "dislikes": 120, "categoryTitle": "Algorithms", "frontendQuestionId": "1658", "paidOnly": false, "title": "Minimum Operations to Reduce X to Zero", "titleSlug": "minimum-operations-to-reduce-x-to-zero", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 195671, "totalSubmissionRaw": 491977}, "1659": {"acRate": 39.66965091262406, "difficulty": "Hard", "likes": 330, "dislikes": 53, "categoryTitle": "Algorithms", "frontendQuestionId": "1659", "paidOnly": false, "title": "Maximize Grid Happiness", "titleSlug": "maximize-grid-happiness", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5716, "totalSubmissionRaw": 14409}, "1660": {"acRate": 74.42200322254281, "difficulty": "Medium", "likes": 267, "dislikes": 46, "categoryTitle": "Algorithms", "frontendQuestionId": "1660", "paidOnly": true, "title": "Correct a Binary Tree", "titleSlug": "correct-a-binary-tree", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 19861, "totalSubmissionRaw": 26687}, "1661": {"acRate": 67.88988244054383, "difficulty": "Easy", "likes": 1399, "dislikes": 139, "categoryTitle": "Database", "frontendQuestionId": "1661", "paidOnly": false, "title": "Average Time of Process per Machine", "titleSlug": "average-time-of-process-per-machine", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 313626, "totalSubmissionRaw": 461967}, "1662": {"acRate": 85.56393440408489, "difficulty": "Easy", "likes": 2992, "dislikes": 200, "categoryTitle": "Algorithms", "frontendQuestionId": "1662", "paidOnly": false, "title": "Check If Two String Arrays are Equivalent", "titleSlug": "check-if-two-string-arrays-are-equivalent", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 506736, "totalSubmissionRaw": 592231}, "1663": {"acRate": 66.89566577301161, "difficulty": "Medium", "likes": 1875, "dislikes": 63, "categoryTitle": "Algorithms", "frontendQuestionId": "1663", "paidOnly": false, "title": "Smallest String With A Given Numeric Value", "titleSlug": "smallest-string-with-a-given-numeric-value", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 95816, "totalSubmissionRaw": 143232}, "1664": {"acRate": 63.66368276278759, "difficulty": "Medium", "likes": 1316, "dislikes": 40, "categoryTitle": "Algorithms", "frontendQuestionId": "1664", "paidOnly": false, "title": "Ways to Make a Fair Array", "titleSlug": "ways-to-make-a-fair-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 40040, "totalSubmissionRaw": 62893}, "1665": {"acRate": 58.33306599082481, "difficulty": "Hard", "likes": 578, "dislikes": 37, "categoryTitle": "Algorithms", "frontendQuestionId": "1665", "paidOnly": false, "title": "Minimum Initial Energy to Finish Tasks", "titleSlug": "minimum-initial-energy-to-finish-tasks", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18183, "totalSubmissionRaw": 31171}, "1666": {"acRate": 73.94882537782433, "difficulty": "Medium", "likes": 64, "dislikes": 190, "categoryTitle": "Algorithms", "frontendQuestionId": "1666", "paidOnly": true, "title": "Change the Root of a Binary Tree", "titleSlug": "change-the-root-of-a-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4942, "totalSubmissionRaw": 6683}, "1667": {"acRate": 61.44900310590121, "difficulty": "Easy", "likes": 877, "dislikes": 107, "categoryTitle": "Database", "frontendQuestionId": "1667", "paidOnly": false, "title": "Fix Names in a Table", "titleSlug": "fix-names-in-a-table", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 245322, "totalSubmissionRaw": 399227}, "1668": {"acRate": 38.935133108361455, "difficulty": "Easy", "likes": 703, "dislikes": 267, "categoryTitle": "Algorithms", "frontendQuestionId": "1668", "paidOnly": false, "title": "Maximum Repeating Substring", "titleSlug": "maximum-repeating-substring", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 57112, "totalSubmissionRaw": 146685}, "1669": {"acRate": 81.7164110265332, "difficulty": "Medium", "likes": 2091, "dislikes": 219, "categoryTitle": "Algorithms", "frontendQuestionId": "1669", "paidOnly": false, "title": "Merge In Between Linked Lists", "titleSlug": "merge-in-between-linked-lists", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 221466, "totalSubmissionRaw": 271018}, "1670": {"acRate": 56.45724258289704, "difficulty": "Medium", "likes": 747, "dislikes": 104, "categoryTitle": "Algorithms", "frontendQuestionId": "1670", "paidOnly": false, "title": "Design Front Middle Back Queue", "titleSlug": "design-front-middle-back-queue", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Data Stream", "id": "VG9waWNUYWdOb2RlOjYxMDYz", "slug": "data-stream"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29115, "totalSubmissionRaw": 51570}, "1671": {"acRate": 41.97339246119734, "difficulty": "Hard", "likes": 1590, "dislikes": 23, "categoryTitle": "Algorithms", "frontendQuestionId": "1671", "paidOnly": false, "title": "Minimum Number of Removals to Make Mountain Array", "titleSlug": "minimum-number-of-removals-to-make-mountain-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 32181, "totalSubmissionRaw": 76670}, "1672": {"acRate": 88.17840946639019, "difficulty": "Easy", "likes": 4368, "dislikes": 366, "categoryTitle": "Algorithms", "frontendQuestionId": "1672", "paidOnly": false, "title": "Richest Customer Wealth", "titleSlug": "richest-customer-wealth", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 920682, "totalSubmissionRaw": 1044113}, "1673": {"acRate": 50.66670796487587, "difficulty": "Medium", "likes": 2043, "dislikes": 98, "categoryTitle": "Algorithms", "frontendQuestionId": "1673", "paidOnly": false, "title": "Find the Most Competitive Subsequence", "titleSlug": "find-the-most-competitive-subsequence", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 65432, "totalSubmissionRaw": 129142}, "1674": {"acRate": 40.29560482302606, "difficulty": "Medium", "likes": 664, "dislikes": 77, "categoryTitle": "Algorithms", "frontendQuestionId": "1674", "paidOnly": false, "title": "Minimum Moves to Make Array Complementary", "titleSlug": "minimum-moves-to-make-array-complementary", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9324, "totalSubmissionRaw": 23139}, "1675": {"acRate": 54.04588823262153, "difficulty": "Hard", "likes": 3035, "dislikes": 171, "categoryTitle": "Algorithms", "frontendQuestionId": "1675", "paidOnly": false, "title": "Minimize Deviation in Array", "titleSlug": "minimize-deviation-in-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 95163, "totalSubmissionRaw": 176079}, "1676": {"acRate": 78.57204793368365, "difficulty": "Medium", "likes": 473, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "1676", "paidOnly": true, "title": "Lowest Common Ancestor of a Binary Tree IV", "titleSlug": "lowest-common-ancestor-of-a-binary-tree-iv", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 45307, "totalSubmissionRaw": 57663}, "1677": {"acRate": 38.18093919616762, "difficulty": "Easy", "likes": 37, "dislikes": 134, "categoryTitle": "Database", "frontendQuestionId": "1677", "paidOnly": true, "title": "Product's Worth Over Invoices", "titleSlug": "products-worth-over-invoices", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17375, "totalSubmissionRaw": 45507}, "1678": {"acRate": 87.35757708128573, "difficulty": "Easy", "likes": 1577, "dislikes": 88, "categoryTitle": "Algorithms", "frontendQuestionId": "1678", "paidOnly": false, "title": "Goal Parser Interpretation", "titleSlug": "goal-parser-interpretation", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 263978, "totalSubmissionRaw": 302181}, "1679": {"acRate": 55.142704819640684, "difficulty": "Medium", "likes": 3152, "dislikes": 90, "categoryTitle": "Algorithms", "frontendQuestionId": "1679", "paidOnly": false, "title": "Max Number of K-Sum Pairs", "titleSlug": "max-number-of-k-sum-pairs", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 328912, "totalSubmissionRaw": 596475}, "1680": {"acRate": 57.131113593293094, "difficulty": "Medium", "likes": 1420, "dislikes": 435, "categoryTitle": "Algorithms", "frontendQuestionId": "1680", "paidOnly": false, "title": "Concatenation of Consecutive Binary Numbers", "titleSlug": "concatenation-of-consecutive-binary-numbers", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 91043, "totalSubmissionRaw": 159358}, "1681": {"acRate": 38.966417574502564, "difficulty": "Hard", "likes": 276, "dislikes": 97, "categoryTitle": "Algorithms", "frontendQuestionId": "1681", "paidOnly": false, "title": "Minimum Incompatibility", "titleSlug": "minimum-incompatibility", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8656, "totalSubmissionRaw": 22214}, "1682": {"acRate": 50.13515948819607, "difficulty": "Medium", "likes": 149, "dislikes": 28, "categoryTitle": "Algorithms", "frontendQuestionId": "1682", "paidOnly": true, "title": "Longest Palindromic Subsequence II", "titleSlug": "longest-palindromic-subsequence-ii", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5564, "totalSubmissionRaw": 11098}, "1683": {"acRate": 85.35507721157214, "difficulty": "Easy", "likes": 990, "dislikes": 366, "categoryTitle": "Database", "frontendQuestionId": "1683", "paidOnly": false, "title": "Invalid Tweets", "titleSlug": "invalid-tweets", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 604471, "totalSubmissionRaw": 708184}, "1684": {"acRate": 83.51953199554366, "difficulty": "Easy", "likes": 1721, "dislikes": 73, "categoryTitle": "Algorithms", "frontendQuestionId": "1684", "paidOnly": false, "title": "Count the Number of Consistent Strings", "titleSlug": "count-the-number-of-consistent-strings", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 188167, "totalSubmissionRaw": 225297}, "1685": {"acRate": 68.42283386559845, "difficulty": "Medium", "likes": 2066, "dislikes": 73, "categoryTitle": "Algorithms", "frontendQuestionId": "1685", "paidOnly": false, "title": "Sum of Absolute Differences in a Sorted Array", "titleSlug": "sum-of-absolute-differences-in-a-sorted-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 111196, "totalSubmissionRaw": 162513}, "1686": {"acRate": 57.399927574584254, "difficulty": "Medium", "likes": 832, "dislikes": 72, "categoryTitle": "Algorithms", "frontendQuestionId": "1686", "paidOnly": false, "title": "Stone Game VI", "titleSlug": "stone-game-vi", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20606, "totalSubmissionRaw": 35899}, "1687": {"acRate": 39.101428740111, "difficulty": "Hard", "likes": 376, "dislikes": 30, "categoryTitle": "Algorithms", "frontendQuestionId": "1687", "paidOnly": false, "title": "Delivering Boxes from Storage to Ports", "titleSlug": "delivering-boxes-from-storage-to-ports", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}, {"name": "Monotonic Queue", "id": "VG9waWNUYWdOb2RlOjYxMDcx", "slug": "monotonic-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6623, "totalSubmissionRaw": 16938}, "1688": {"acRate": 85.72794276374626, "difficulty": "Easy", "likes": 1758, "dislikes": 238, "categoryTitle": "Algorithms", "frontendQuestionId": "1688", "paidOnly": false, "title": "Count of Matches in Tournament", "titleSlug": "count-of-matches-in-tournament", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 250191, "totalSubmissionRaw": 291843}, "1689": {"acRate": 88.7337741856478, "difficulty": "Medium", "likes": 2420, "dislikes": 1493, "categoryTitle": "Algorithms", "frontendQuestionId": "1689", "paidOnly": false, "title": "Partitioning Into Minimum Number Of Deci-Binary Numbers", "titleSlug": "partitioning-into-minimum-number-of-deci-binary-numbers", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 224626, "totalSubmissionRaw": 253146}, "1690": {"acRate": 58.108837918546286, "difficulty": "Medium", "likes": 988, "dislikes": 171, "categoryTitle": "Algorithms", "frontendQuestionId": "1690", "paidOnly": false, "title": "Stone Game VII", "titleSlug": "stone-game-vii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 36583, "totalSubmissionRaw": 62956}, "1691": {"acRate": 58.08066279270467, "difficulty": "Hard", "likes": 1155, "dislikes": 33, "categoryTitle": "Algorithms", "frontendQuestionId": "1691", "paidOnly": false, "title": "Maximum Height by Stacking Cuboids ", "titleSlug": "maximum-height-by-stacking-cuboids", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30285, "totalSubmissionRaw": 52143}, "1692": {"acRate": 62.58616591395294, "difficulty": "Hard", "likes": 73, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "1692", "paidOnly": true, "title": "Count Ways to Distribute Candies", "titleSlug": "count-ways-to-distribute-candies", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2633, "totalSubmissionRaw": 4207}, "1693": {"acRate": 86.55605357657728, "difficulty": "Easy", "likes": 554, "dislikes": 32, "categoryTitle": "Database", "frontendQuestionId": "1693", "paidOnly": false, "title": "Daily Leads and Partners", "titleSlug": "daily-leads-and-partners", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 132087, "totalSubmissionRaw": 152603}, "1694": {"acRate": 66.00243053821438, "difficulty": "Easy", "likes": 353, "dislikes": 203, "categoryTitle": "Algorithms", "frontendQuestionId": "1694", "paidOnly": false, "title": "Reformat Phone Number", "titleSlug": "reformat-phone-number", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 39647, "totalSubmissionRaw": 60069}, "1695": {"acRate": 58.44188564987734, "difficulty": "Medium", "likes": 2799, "dislikes": 49, "categoryTitle": "Algorithms", "frontendQuestionId": "1695", "paidOnly": false, "title": "Maximum Erasure Value", "titleSlug": "maximum-erasure-value", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 132216, "totalSubmissionRaw": 226235}, "1696": {"acRate": 45.66457059899004, "difficulty": "Medium", "likes": 3412, "dislikes": 114, "categoryTitle": "Algorithms", "frontendQuestionId": "1696", "paidOnly": false, "title": "Jump Game VI", "titleSlug": "jump-game-vi", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Monotonic Queue", "id": "VG9waWNUYWdOb2RlOjYxMDcx", "slug": "monotonic-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 109147, "totalSubmissionRaw": 239019}, "1697": {"acRate": 62.56470275944449, "difficulty": "Hard", "likes": 1962, "dislikes": 46, "categoryTitle": "Algorithms", "frontendQuestionId": "1697", "paidOnly": false, "title": "Checking Existence of Edge Length Limited Paths", "titleSlug": "checking-existence-of-edge-length-limited-paths", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 51853, "totalSubmissionRaw": 82879}, "1698": {"acRate": 64.18636597790625, "difficulty": "Medium", "likes": 194, "dislikes": 43, "categoryTitle": "Algorithms", "frontendQuestionId": "1698", "paidOnly": true, "title": "Number of Distinct Substrings in a String", "titleSlug": "number-of-distinct-substrings-in-a-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "Suffix Array", "id": "VG9waWNUYWdOb2RlOjU2Njk4", "slug": "suffix-array"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11214, "totalSubmissionRaw": 17471}, "1699": {"acRate": 81.21683164590311, "difficulty": "Medium", "likes": 293, "dislikes": 16, "categoryTitle": "Database", "frontendQuestionId": "1699", "paidOnly": true, "title": "Number of Calls Between Two Persons", "titleSlug": "number-of-calls-between-two-persons", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 43157, "totalSubmissionRaw": 53138}, "1700": {"acRate": 78.31627336806619, "difficulty": "Easy", "likes": 2404, "dislikes": 239, "categoryTitle": "Algorithms", "frontendQuestionId": "1700", "paidOnly": false, "title": "Number of Students Unable to Eat Lunch", "titleSlug": "number-of-students-unable-to-eat-lunch", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 255544, "totalSubmissionRaw": 326298}, "1701": {"acRate": 73.05514291139382, "difficulty": "Medium", "likes": 1211, "dislikes": 97, "categoryTitle": "Algorithms", "frontendQuestionId": "1701", "paidOnly": false, "title": "Average Waiting Time", "titleSlug": "average-waiting-time", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 196220, "totalSubmissionRaw": 268592}, "1702": {"acRate": 47.02002762430939, "difficulty": "Medium", "likes": 495, "dislikes": 55, "categoryTitle": "Algorithms", "frontendQuestionId": "1702", "paidOnly": false, "title": "Maximum Binary String After Change", "titleSlug": "maximum-binary-string-after-change", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13617, "totalSubmissionRaw": 28960}, "1703": {"acRate": 42.64153776843369, "difficulty": "Hard", "likes": 713, "dislikes": 26, "categoryTitle": "Algorithms", "frontendQuestionId": "1703", "paidOnly": false, "title": "Minimum Adjacent Swaps for K Consecutive Ones", "titleSlug": "minimum-adjacent-swaps-for-k-consecutive-ones", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11358, "totalSubmissionRaw": 26636}, "1704": {"acRate": 78.65497012469598, "difficulty": "Easy", "likes": 2245, "dislikes": 124, "categoryTitle": "Algorithms", "frontendQuestionId": "1704", "paidOnly": false, "title": "Determine if String Halves Are Alike", "titleSlug": "determine-if-string-halves-are-alike", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 361875, "totalSubmissionRaw": 460079}, "1705": {"acRate": 39.39887351089106, "difficulty": "Medium", "likes": 831, "dislikes": 187, "categoryTitle": "Algorithms", "frontendQuestionId": "1705", "paidOnly": false, "title": "Maximum Number of Eaten Apples", "titleSlug": "maximum-number-of-eaten-apples", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23713, "totalSubmissionRaw": 60187}, "1706": {"acRate": 71.86670658500323, "difficulty": "Medium", "likes": 3092, "dislikes": 180, "categoryTitle": "Algorithms", "frontendQuestionId": "1706", "paidOnly": false, "title": "Where Will the Ball Fall", "titleSlug": "where-will-the-ball-fall", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 141627, "totalSubmissionRaw": 197069}, "1707": {"acRate": 51.30184192495264, "difficulty": "Hard", "likes": 1224, "dislikes": 38, "categoryTitle": "Algorithms", "frontendQuestionId": "1707", "paidOnly": false, "title": "Maximum XOR With an Element From Array", "titleSlug": "maximum-xor-with-an-element-from-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25457, "totalSubmissionRaw": 49622}, "1708": {"acRate": 64.93603094317167, "difficulty": "Easy", "likes": 103, "dislikes": 112, "categoryTitle": "Algorithms", "frontendQuestionId": "1708", "paidOnly": true, "title": "Largest Subarray Length K", "titleSlug": "largest-subarray-length-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8730, "totalSubmissionRaw": 13444}, "1709": {"acRate": 70.48224540021094, "difficulty": "Medium", "likes": 209, "dislikes": 15, "categoryTitle": "Database", "frontendQuestionId": "1709", "paidOnly": true, "title": "Biggest Window Between Visits", "titleSlug": "biggest-window-between-visits", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 24057, "totalSubmissionRaw": 34132}, "1710": {"acRate": 73.74854839166517, "difficulty": "Easy", "likes": 3831, "dislikes": 222, "categoryTitle": "Algorithms", "frontendQuestionId": "1710", "paidOnly": false, "title": "Maximum Units on a Truck", "titleSlug": "maximum-units-on-a-truck", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 312449, "totalSubmissionRaw": 423668}, "1711": {"acRate": 30.463500479956117, "difficulty": "Medium", "likes": 1046, "dislikes": 237, "categoryTitle": "Algorithms", "frontendQuestionId": "1711", "paidOnly": false, "title": "Count Good Meals", "titleSlug": "count-good-meals", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 39987, "totalSubmissionRaw": 131262}, "1712": {"acRate": 33.04455323146912, "difficulty": "Medium", "likes": 1405, "dislikes": 104, "categoryTitle": "Algorithms", "frontendQuestionId": "1712", "paidOnly": false, "title": "Ways to Split Array Into Three Subarrays", "titleSlug": "ways-to-split-array-into-three-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33413, "totalSubmissionRaw": 101115}, "1713": {"acRate": 47.827755603315936, "difficulty": "Hard", "likes": 718, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "1713", "paidOnly": false, "title": "Minimum Operations to Make a Subsequence", "titleSlug": "minimum-operations-to-make-a-subsequence", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12462, "totalSubmissionRaw": 26056}, "1714": {"acRate": 49.648382559774966, "difficulty": "Hard", "likes": 31, "dislikes": 24, "categoryTitle": "Algorithms", "frontendQuestionId": "1714", "paidOnly": true, "title": "Sum Of Special Evenly-Spaced Elements In Array", "titleSlug": "sum-of-special-evenly-spaced-elements-in-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1412, "totalSubmissionRaw": 2844}, "1715": {"acRate": 75.60074823732553, "difficulty": "Medium", "likes": 82, "dislikes": 22, "categoryTitle": "Database", "frontendQuestionId": "1715", "paidOnly": true, "title": "Count Apples and Oranges", "titleSlug": "count-apples-and-oranges", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15762, "totalSubmissionRaw": 20849}, "1716": {"acRate": 78.36978054552728, "difficulty": "Easy", "likes": 1433, "dislikes": 51, "categoryTitle": "Algorithms", "frontendQuestionId": "1716", "paidOnly": false, "title": "Calculate Money in Leetcode Bank", "titleSlug": "calculate-money-in-leetcode-bank", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 162592, "totalSubmissionRaw": 207468}, "1717": {"acRate": 63.07051422753786, "difficulty": "Medium", "likes": 1402, "dislikes": 115, "categoryTitle": "Algorithms", "frontendQuestionId": "1717", "paidOnly": false, "title": "Maximum Score From Removing Substrings", "titleSlug": "maximum-score-from-removing-substrings", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 135051, "totalSubmissionRaw": 214127}, "1718": {"acRate": 53.90519187358917, "difficulty": "Medium", "likes": 564, "dislikes": 54, "categoryTitle": "Algorithms", "frontendQuestionId": "1718", "paidOnly": false, "title": "Construct the Lexicographically Largest Valid Sequence", "titleSlug": "construct-the-lexicographically-largest-valid-sequence", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14328, "totalSubmissionRaw": 26580}, "1719": {"acRate": 44.67983128834356, "difficulty": "Hard", "likes": 219, "dislikes": 153, "categoryTitle": "Algorithms", "frontendQuestionId": "1719", "paidOnly": false, "title": "Number Of Ways To Reconstruct A Tree", "titleSlug": "number-of-ways-to-reconstruct-a-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4661, "totalSubmissionRaw": 10432}, "1720": {"acRate": 86.5127410187376, "difficulty": "Easy", "likes": 1592, "dislikes": 215, "categoryTitle": "Algorithms", "frontendQuestionId": "1720", "paidOnly": false, "title": "Decode XORed Array", "titleSlug": "decode-xored-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 159058, "totalSubmissionRaw": 183855}, "1721": {"acRate": 68.03412413803844, "difficulty": "Medium", "likes": 5357, "dislikes": 181, "categoryTitle": "Algorithms", "frontendQuestionId": "1721", "paidOnly": false, "title": "Swapping Nodes in a Linked List", "titleSlug": "swapping-nodes-in-a-linked-list", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 349460, "totalSubmissionRaw": 513653}, "1722": {"acRate": 48.91675263867947, "difficulty": "Medium", "likes": 841, "dislikes": 26, "categoryTitle": "Algorithms", "frontendQuestionId": "1722", "paidOnly": false, "title": "Minimize Hamming Distance After Swap Operations", "titleSlug": "minimize-hamming-distance-after-swap-operations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18492, "totalSubmissionRaw": 37803}, "1723": {"acRate": 42.496968245175395, "difficulty": "Hard", "likes": 1046, "dislikes": 30, "categoryTitle": "Algorithms", "frontendQuestionId": "1723", "paidOnly": false, "title": "Find Minimum Time to Finish All Jobs", "titleSlug": "find-minimum-time-to-finish-all-jobs", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28385, "totalSubmissionRaw": 66793}, "1724": {"acRate": 51.4921598381386, "difficulty": "Hard", "likes": 105, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "1724", "paidOnly": true, "title": "Checking Existence of Edge Length Limited Paths II", "titleSlug": "checking-existence-of-edge-length-limited-paths-ii", "topicTags": [{"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Minimum Spanning Tree", "id": "VG9waWNUYWdOb2RlOjYxMDgz", "slug": "minimum-spanning-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3054, "totalSubmissionRaw": 5931}, "1725": {"acRate": 78.78654294838023, "difficulty": "Easy", "likes": 589, "dislikes": 72, "categoryTitle": "Algorithms", "frontendQuestionId": "1725", "paidOnly": false, "title": "Number Of Rectangles That Can Form The Largest Square", "titleSlug": "number-of-rectangles-that-can-form-the-largest-square", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 73275, "totalSubmissionRaw": 93005}, "1726": {"acRate": 61.217354226628295, "difficulty": "Medium", "likes": 627, "dislikes": 27, "categoryTitle": "Algorithms", "frontendQuestionId": "1726", "paidOnly": false, "title": "Tuple with Same Product", "titleSlug": "tuple-with-same-product", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28714, "totalSubmissionRaw": 46905}, "1727": {"acRate": 75.36732393783669, "difficulty": "Medium", "likes": 1913, "dislikes": 102, "categoryTitle": "Algorithms", "frontendQuestionId": "1727", "paidOnly": false, "title": "Largest Submatrix With Rearrangements", "titleSlug": "largest-submatrix-with-rearrangements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 72890, "totalSubmissionRaw": 96713}, "1728": {"acRate": 40.02282360612977, "difficulty": "Hard", "likes": 270, "dislikes": 44, "categoryTitle": "Algorithms", "frontendQuestionId": "1728", "paidOnly": false, "title": "Cat and Mouse II", "titleSlug": "cat-and-mouse-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7365, "totalSubmissionRaw": 18402}, "1729": {"acRate": 69.15334762228824, "difficulty": "Easy", "likes": 579, "dislikes": 32, "categoryTitle": "Database", "frontendQuestionId": "1729", "paidOnly": false, "title": "Find Followers Count", "titleSlug": "find-followers-count", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 217458, "totalSubmissionRaw": 314458}, "1730": {"acRate": 55.04120273742505, "difficulty": "Medium", "likes": 675, "dislikes": 40, "categoryTitle": "Algorithms", "frontendQuestionId": "1730", "paidOnly": true, "title": "Shortest Path to Get Food", "titleSlug": "shortest-path-to-get-food", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 66192, "totalSubmissionRaw": 120259}, "1731": {"acRate": 48.908990382142676, "difficulty": "Easy", "likes": 540, "dislikes": 72, "categoryTitle": "Database", "frontendQuestionId": "1731", "paidOnly": false, "title": "The Number of Employees Which Report to Each Employee", "titleSlug": "the-number-of-employees-which-report-to-each-employee", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 152150, "totalSubmissionRaw": 311088}, "1732": {"acRate": 83.42235292533702, "difficulty": "Easy", "likes": 2886, "dislikes": 345, "categoryTitle": "Algorithms", "frontendQuestionId": "1732", "paidOnly": false, "title": "Find the Highest Altitude", "titleSlug": "find-the-highest-altitude", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 433727, "totalSubmissionRaw": 519918}, "1733": {"acRate": 42.784140969163, "difficulty": "Medium", "likes": 215, "dislikes": 397, "categoryTitle": "Algorithms", "frontendQuestionId": "1733", "paidOnly": false, "title": "Minimum Number of People to Teach", "titleSlug": "minimum-number-of-people-to-teach", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9712, "totalSubmissionRaw": 22700}, "1734": {"acRate": 65.16306993347396, "difficulty": "Medium", "likes": 764, "dislikes": 30, "categoryTitle": "Algorithms", "frontendQuestionId": "1734", "paidOnly": false, "title": "Decode XORed Permutation", "titleSlug": "decode-xored-permutation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16064, "totalSubmissionRaw": 24652}, "1735": {"acRate": 51.928063571727314, "difficulty": "Hard", "likes": 290, "dislikes": 33, "categoryTitle": "Algorithms", "frontendQuestionId": "1735", "paidOnly": false, "title": "Count Ways to Make Array With Product", "titleSlug": "count-ways-to-make-array-with-product", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6208, "totalSubmissionRaw": 11955}, "1736": {"acRate": 42.855677972860576, "difficulty": "Easy", "likes": 367, "dislikes": 183, "categoryTitle": "Algorithms", "frontendQuestionId": "1736", "paidOnly": false, "title": "Latest Time by Replacing Hidden Digits", "titleSlug": "latest-time-by-replacing-hidden-digits", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 37614, "totalSubmissionRaw": 87769}, "1737": {"acRate": 36.820602034899046, "difficulty": "Medium", "likes": 323, "dislikes": 341, "categoryTitle": "Algorithms", "frontendQuestionId": "1737", "paidOnly": false, "title": "Change Minimum Characters to Satisfy One of Three Conditions", "titleSlug": "change-minimum-characters-to-satisfy-one-of-three-conditions", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13969, "totalSubmissionRaw": 37938}, "1738": {"acRate": 61.911820190804725, "difficulty": "Medium", "likes": 507, "dislikes": 77, "categoryTitle": "Algorithms", "frontendQuestionId": "1738", "paidOnly": false, "title": "Find Kth Largest XOR Coordinate Value", "titleSlug": "find-kth-largest-xor-coordinate-value", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}, {"name": "Quickselect", "id": "VG9waWNUYWdOb2RlOjYxMDY5", "slug": "quickselect"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22973, "totalSubmissionRaw": 37106}, "1739": {"acRate": 51.99011803458687, "difficulty": "Hard", "likes": 306, "dislikes": 44, "categoryTitle": "Algorithms", "frontendQuestionId": "1739", "paidOnly": false, "title": "Building Boxes", "titleSlug": "building-boxes", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7576, "totalSubmissionRaw": 14572}, "1740": {"acRate": 73.57898215465961, "difficulty": "Medium", "likes": 460, "dislikes": 18, "categoryTitle": "Algorithms", "frontendQuestionId": "1740", "paidOnly": true, "title": "Find Distance in a Binary Tree", "titleSlug": "find-distance-in-a-binary-tree", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 31171, "totalSubmissionRaw": 42364}, "1741": {"acRate": 86.8219968950126, "difficulty": "Easy", "likes": 714, "dislikes": 19, "categoryTitle": "Database", "frontendQuestionId": "1741", "paidOnly": false, "title": "Find Total Time Spent by Each Employee", "titleSlug": "find-total-time-spent-by-each-employee", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 143166, "totalSubmissionRaw": 164896}, "1742": {"acRate": 73.5653445277627, "difficulty": "Easy", "likes": 605, "dislikes": 162, "categoryTitle": "Algorithms", "frontendQuestionId": "1742", "paidOnly": false, "title": "Maximum Number of Balls in a Box", "titleSlug": "maximum-number-of-balls-in-a-box", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 66417, "totalSubmissionRaw": 90283}, "1743": {"acRate": 74.77168714084168, "difficulty": "Medium", "likes": 1949, "dislikes": 69, "categoryTitle": "Algorithms", "frontendQuestionId": "1743", "paidOnly": false, "title": "Restore the Array From Adjacent Pairs", "titleSlug": "restore-the-array-from-adjacent-pairs", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 108647, "totalSubmissionRaw": 145305}, "1744": {"acRate": 34.46570024108457, "difficulty": "Medium", "likes": 131, "dislikes": 328, "categoryTitle": "Algorithms", "frontendQuestionId": "1744", "paidOnly": false, "title": "Can You Eat Your Favorite Candy on Your Favorite Day?", "titleSlug": "can-you-eat-your-favorite-candy-on-your-favorite-day", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11008, "totalSubmissionRaw": 31939}, "1745": {"acRate": 44.371565934065934, "difficulty": "Hard", "likes": 914, "dislikes": 27, "categoryTitle": "Algorithms", "frontendQuestionId": "1745", "paidOnly": false, "title": "Palindrome Partitioning IV", "titleSlug": "palindrome-partitioning-iv", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25842, "totalSubmissionRaw": 58240}, "1746": {"acRate": 62.323137043525136, "difficulty": "Medium", "likes": 275, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "1746", "paidOnly": true, "title": "Maximum Subarray Sum After One Operation", "titleSlug": "maximum-subarray-sum-after-one-operation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9250, "totalSubmissionRaw": 14842}, "1747": {"acRate": 63.45468935496636, "difficulty": "Medium", "likes": 185, "dislikes": 13, "categoryTitle": "Database", "frontendQuestionId": "1747", "paidOnly": true, "title": "Leetflex Banned Accounts", "titleSlug": "leetflex-banned-accounts", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 22449, "totalSubmissionRaw": 35378}, "1748": {"acRate": 78.07014502301472, "difficulty": "Easy", "likes": 1549, "dislikes": 33, "categoryTitle": "Algorithms", "frontendQuestionId": "1748", "paidOnly": false, "title": "Sum of Unique Elements", "titleSlug": "sum-of-unique-elements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 180125, "totalSubmissionRaw": 230722}, "1749": {"acRate": 60.29206926381537, "difficulty": "Medium", "likes": 1273, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "1749", "paidOnly": false, "title": "Maximum Absolute Sum of Any Subarray", "titleSlug": "maximum-absolute-sum-of-any-subarray", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 41121, "totalSubmissionRaw": 68203}, "1750": {"acRate": 55.942674836684056, "difficulty": "Medium", "likes": 1215, "dislikes": 105, "categoryTitle": "Algorithms", "frontendQuestionId": "1750", "paidOnly": false, "title": "Minimum Length of String After Deleting Similar Ends", "titleSlug": "minimum-length-of-string-after-deleting-similar-ends", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 165705, "totalSubmissionRaw": 296205}, "1751": {"acRate": 61.511696592573415, "difficulty": "Hard", "likes": 2075, "dislikes": 40, "categoryTitle": "Algorithms", "frontendQuestionId": "1751", "paidOnly": false, "title": "Maximum Number of Events That Can Be Attended II", "titleSlug": "maximum-number-of-events-that-can-be-attended-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 76018, "totalSubmissionRaw": 123583}, "1752": {"acRate": 51.36168007715227, "difficulty": "Easy", "likes": 3197, "dislikes": 179, "categoryTitle": "Algorithms", "frontendQuestionId": "1752", "paidOnly": false, "title": "Check if Array Is Sorted and Rotated", "titleSlug": "check-if-array-is-sorted-and-rotated", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 285459, "totalSubmissionRaw": 555779}, "1753": {"acRate": 67.43334910869223, "difficulty": "Medium", "likes": 944, "dislikes": 57, "categoryTitle": "Algorithms", "frontendQuestionId": "1753", "paidOnly": false, "title": "Maximum Score From Removing Stones", "titleSlug": "maximum-score-from-removing-stones", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 42746, "totalSubmissionRaw": 63390}, "1754": {"acRate": 48.642857142857146, "difficulty": "Medium", "likes": 547, "dislikes": 77, "categoryTitle": "Algorithms", "frontendQuestionId": "1754", "paidOnly": false, "title": "Largest Merge Of Two Strings", "titleSlug": "largest-merge-of-two-strings", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23835, "totalSubmissionRaw": 49000}, "1755": {"acRate": 39.72877736252002, "difficulty": "Hard", "likes": 896, "dislikes": 67, "categoryTitle": "Algorithms", "frontendQuestionId": "1755", "paidOnly": false, "title": "Closest Subsequence Sum", "titleSlug": "closest-subsequence-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18603, "totalSubmissionRaw": 46825}, "1756": {"acRate": 75.76354679802955, "difficulty": "Medium", "likes": 289, "dislikes": 24, "categoryTitle": "Algorithms", "frontendQuestionId": "1756", "paidOnly": true, "title": "Design Most Recently Used Queue", "titleSlug": "design-most-recently-used-queue", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17687, "totalSubmissionRaw": 23345}, "1757": {"acRate": 89.25124144460369, "difficulty": "Easy", "likes": 2388, "dislikes": 107, "categoryTitle": "Database", "frontendQuestionId": "1757", "paidOnly": false, "title": "Recyclable and Low Fat Products", "titleSlug": "recyclable-and-low-fat-products", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1192510, "totalSubmissionRaw": 1336128}, "1758": {"acRate": 63.75802260956347, "difficulty": "Easy", "likes": 1426, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "1758", "paidOnly": false, "title": "Minimum Changes To Make Alternating Binary String", "titleSlug": "minimum-changes-to-make-alternating-binary-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 148217, "totalSubmissionRaw": 232468}, "1759": {"acRate": 57.67479334839345, "difficulty": "Medium", "likes": 1482, "dislikes": 98, "categoryTitle": "Algorithms", "frontendQuestionId": "1759", "paidOnly": false, "title": "Count Number of Homogenous Substrings", "titleSlug": "count-number-of-homogenous-substrings", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 113102, "totalSubmissionRaw": 196103}, "1760": {"acRate": 60.33556050482554, "difficulty": "Medium", "likes": 1989, "dislikes": 49, "categoryTitle": "Algorithms", "frontendQuestionId": "1760", "paidOnly": false, "title": "Minimum Limit of Balls in a Bag", "titleSlug": "minimum-limit-of-balls-in-a-bag", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 40636, "totalSubmissionRaw": 67350}, "1761": {"acRate": 42.55246329820769, "difficulty": "Hard", "likes": 323, "dislikes": 286, "categoryTitle": "Algorithms", "frontendQuestionId": "1761", "paidOnly": false, "title": "Minimum Degree of a Connected Trio in a Graph", "titleSlug": "minimum-degree-of-a-connected-trio-in-a-graph", "topicTags": [{"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23623, "totalSubmissionRaw": 55515}, "1762": {"acRate": 79.85226944813947, "difficulty": "Medium", "likes": 1215, "dislikes": 150, "categoryTitle": "Algorithms", "frontendQuestionId": "1762", "paidOnly": true, "title": "Buildings With an Ocean View", "titleSlug": "buildings-with-an-ocean-view", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 226913, "totalSubmissionRaw": 284166}, "1763": {"acRate": 60.78932752061872, "difficulty": "Easy", "likes": 1340, "dislikes": 885, "categoryTitle": "Algorithms", "frontendQuestionId": "1763", "paidOnly": false, "title": "Longest Nice Substring", "titleSlug": "longest-nice-substring", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 58007, "totalSubmissionRaw": 95423}, "1764": {"acRate": 53.691275167785236, "difficulty": "Medium", "likes": 331, "dislikes": 43, "categoryTitle": "Algorithms", "frontendQuestionId": "1764", "paidOnly": false, "title": "Form Array by Concatenating Subarrays of Another Array", "titleSlug": "form-array-by-concatenating-subarrays-of-another-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16080, "totalSubmissionRaw": 29949}, "1765": {"acRate": 62.83901385798322, "difficulty": "Medium", "likes": 826, "dislikes": 50, "categoryTitle": "Algorithms", "frontendQuestionId": "1765", "paidOnly": false, "title": "Map of Highest Peak", "titleSlug": "map-of-highest-peak", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28522, "totalSubmissionRaw": 45389}, "1766": {"acRate": 41.32758830941832, "difficulty": "Hard", "likes": 401, "dislikes": 33, "categoryTitle": "Algorithms", "frontendQuestionId": "1766", "paidOnly": false, "title": "Tree of Coprimes", "titleSlug": "tree-of-coprimes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10167, "totalSubmissionRaw": 24601}, "1767": {"acRate": 77.32331177533065, "difficulty": "Hard", "likes": 172, "dislikes": 13, "categoryTitle": "Database", "frontendQuestionId": "1767", "paidOnly": true, "title": "Find the Subtasks That Did Not Execute", "titleSlug": "find-the-subtasks-that-did-not-execute", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13271, "totalSubmissionRaw": 17163}, "1768": {"acRate": 80.47825712115272, "difficulty": "Easy", "likes": 3904, "dislikes": 98, "categoryTitle": "Algorithms", "frontendQuestionId": "1768", "paidOnly": false, "title": "Merge Strings Alternately", "titleSlug": "merge-strings-alternately", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 989475, "totalSubmissionRaw": 1229495}, "1769": {"acRate": 85.92262959608291, "difficulty": "Medium", "likes": 2252, "dislikes": 93, "categoryTitle": "Algorithms", "frontendQuestionId": "1769", "paidOnly": false, "title": "Minimum Number of Operations to Move All Balls to Each Box", "titleSlug": "minimum-number-of-operations-to-move-all-balls-to-each-box", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 130910, "totalSubmissionRaw": 152358}, "1770": {"acRate": 40.6694816892984, "difficulty": "Hard", "likes": 2520, "dislikes": 512, "categoryTitle": "Algorithms", "frontendQuestionId": "1770", "paidOnly": false, "title": "Maximum Score from Performing Multiplication Operations", "titleSlug": "maximum-score-from-performing-multiplication-operations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 114230, "totalSubmissionRaw": 280874}, "1771": {"acRate": 36.46521076688675, "difficulty": "Hard", "likes": 540, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "1771", "paidOnly": false, "title": "Maximize Palindrome Length From Subsequences", "titleSlug": "maximize-palindrome-length-from-subsequences", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11488, "totalSubmissionRaw": 31504}, "1772": {"acRate": 65.7975622681505, "difficulty": "Medium", "likes": 89, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "1772", "paidOnly": true, "title": "Sort Features by Popularity", "titleSlug": "sort-features-by-popularity", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6208, "totalSubmissionRaw": 9435}, "1773": {"acRate": 84.70587809311387, "difficulty": "Easy", "likes": 1891, "dislikes": 228, "categoryTitle": "Algorithms", "frontendQuestionId": "1773", "paidOnly": false, "title": "Count Items Matching a Rule", "titleSlug": "count-items-matching-a-rule", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 233939, "totalSubmissionRaw": 276178}, "1774": {"acRate": 47.64686146525956, "difficulty": "Medium", "likes": 706, "dislikes": 89, "categoryTitle": "Algorithms", "frontendQuestionId": "1774", "paidOnly": false, "title": "Closest Dessert Cost", "titleSlug": "closest-dessert-cost", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 31243, "totalSubmissionRaw": 65572}, "1775": {"acRate": 53.74991037499104, "difficulty": "Medium", "likes": 921, "dislikes": 45, "categoryTitle": "Algorithms", "frontendQuestionId": "1775", "paidOnly": false, "title": "Equal Sum Arrays With Minimum Number of Operations", "titleSlug": "equal-sum-arrays-with-minimum-number-of-operations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29986, "totalSubmissionRaw": 55788}, "1776": {"acRate": 55.412252418240435, "difficulty": "Hard", "likes": 891, "dislikes": 35, "categoryTitle": "Algorithms", "frontendQuestionId": "1776", "paidOnly": false, "title": "Car Fleet II", "titleSlug": "car-fleet-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26466, "totalSubmissionRaw": 47762}, "1777": {"acRate": 82.24218412897658, "difficulty": "Easy", "likes": 134, "dislikes": 13, "categoryTitle": "Database", "frontendQuestionId": "1777", "paidOnly": true, "title": "Product's Price for Each Store", "titleSlug": "products-price-for-each-store", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 20966, "totalSubmissionRaw": 25493}, "1778": {"acRate": 40.17197163976467, "difficulty": "Medium", "likes": 167, "dislikes": 67, "categoryTitle": "Algorithms", "frontendQuestionId": "1778", "paidOnly": true, "title": "Shortest Path in a Hidden Grid", "titleSlug": "shortest-path-in-a-hidden-grid", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7989, "totalSubmissionRaw": 19887}, "1779": {"acRate": 68.69345169945808, "difficulty": "Easy", "likes": 844, "dislikes": 187, "categoryTitle": "Algorithms", "frontendQuestionId": "1779", "paidOnly": false, "title": "Find Nearest Point That Has the Same X or Y Coordinate", "titleSlug": "find-nearest-point-that-has-the-same-x-or-y-coordinate", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 116998, "totalSubmissionRaw": 170319}, "1780": {"acRate": 67.96663450465311, "difficulty": "Medium", "likes": 973, "dislikes": 32, "categoryTitle": "Algorithms", "frontendQuestionId": "1780", "paidOnly": false, "title": "Check if Number is a Sum of Powers of Three", "titleSlug": "check-if-number-is-a-sum-of-powers-of-three", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 43674, "totalSubmissionRaw": 64258}, "1781": {"acRate": 67.08890180127833, "difficulty": "Medium", "likes": 1113, "dislikes": 177, "categoryTitle": "Algorithms", "frontendQuestionId": "1781", "paidOnly": false, "title": "Sum of Beauty of All Substrings", "titleSlug": "sum-of-beauty-of-all-substrings", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 63503, "totalSubmissionRaw": 94655}, "1782": {"acRate": 40.373993095512084, "difficulty": "Hard", "likes": 314, "dislikes": 163, "categoryTitle": "Algorithms", "frontendQuestionId": "1782", "paidOnly": false, "title": "Count Pairs Of Nodes", "titleSlug": "count-pairs-of-nodes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7017, "totalSubmissionRaw": 17380}, "1783": {"acRate": 83.59543334941309, "difficulty": "Medium", "likes": 231, "dislikes": 9, "categoryTitle": "Database", "frontendQuestionId": "1783", "paidOnly": true, "title": "Grand Slam Titles", "titleSlug": "grand-slam-titles", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25994, "totalSubmissionRaw": 31095}, "1784": {"acRate": 39.20995896793936, "difficulty": "Easy", "likes": 337, "dislikes": 967, "categoryTitle": "Algorithms", "frontendQuestionId": "1784", "paidOnly": false, "title": "Check if Binary String Has at Most One Segment of Ones", "titleSlug": "check-if-binary-string-has-at-most-one-segment-of-ones", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 45104, "totalSubmissionRaw": 115032}, "1785": {"acRate": 43.62912288311023, "difficulty": "Medium", "likes": 264, "dislikes": 192, "categoryTitle": "Algorithms", "frontendQuestionId": "1785", "paidOnly": false, "title": "Minimum Elements to Add to Form a Given Sum", "titleSlug": "minimum-elements-to-add-to-form-a-given-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22130, "totalSubmissionRaw": 50723}, "1786": {"acRate": 39.23732517482518, "difficulty": "Medium", "likes": 1094, "dislikes": 211, "categoryTitle": "Algorithms", "frontendQuestionId": "1786", "paidOnly": false, "title": "Number of Restricted Paths From First to Last Node", "titleSlug": "number-of-restricted-paths-from-first-to-last-node", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25137, "totalSubmissionRaw": 64064}, "1787": {"acRate": 39.79023030658648, "difficulty": "Hard", "likes": 401, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "1787", "paidOnly": false, "title": "Make the XOR of All Segments Equal to Zero", "titleSlug": "make-the-xor-of-all-segments-equal-to-zero", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5425, "totalSubmissionRaw": 13634}, "1788": {"acRate": 67.12569586873718, "difficulty": "Hard", "likes": 75, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "1788", "paidOnly": true, "title": "Maximize the Beauty of the Garden", "titleSlug": "maximize-the-beauty-of-the-garden", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2291, "totalSubmissionRaw": 3413}, "1789": {"acRate": 64.67225015014873, "difficulty": "Easy", "likes": 511, "dislikes": 219, "categoryTitle": "Database", "frontendQuestionId": "1789", "paidOnly": false, "title": "Primary Department for Each Employee", "titleSlug": "primary-department-for-each-employee", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 136754, "totalSubmissionRaw": 211457}, "1790": {"acRate": 45.7792777535188, "difficulty": "Easy", "likes": 1092, "dislikes": 59, "categoryTitle": "Algorithms", "frontendQuestionId": "1790", "paidOnly": false, "title": "Check if One String Swap Can Make Strings Equal", "titleSlug": "check-if-one-string-swap-can-make-strings-equal", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 112178, "totalSubmissionRaw": 245041}, "1791": {"acRate": 86.67838579540424, "difficulty": "Easy", "likes": 1796, "dislikes": 174, "categoryTitle": "Algorithms", "frontendQuestionId": "1791", "paidOnly": false, "title": "Find Center of Star Graph", "titleSlug": "find-center-of-star-graph", "topicTags": [{"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 342696, "totalSubmissionRaw": 395365}, "1792": {"acRate": 54.07920363557671, "difficulty": "Medium", "likes": 726, "dislikes": 85, "categoryTitle": "Algorithms", "frontendQuestionId": "1792", "paidOnly": false, "title": "Maximum Average Pass Ratio", "titleSlug": "maximum-average-pass-ratio", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22491, "totalSubmissionRaw": 41589}, "1793": {"acRate": 64.33520122261844, "difficulty": "Hard", "likes": 1857, "dislikes": 48, "categoryTitle": "Algorithms", "frontendQuestionId": "1793", "paidOnly": false, "title": "Maximum Score of a Good Subarray", "titleSlug": "maximum-score-of-a-good-subarray", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 75774, "totalSubmissionRaw": 117780}, "1794": {"acRate": 65.36712150747238, "difficulty": "Medium", "likes": 44, "dislikes": 59, "categoryTitle": "Algorithms", "frontendQuestionId": "1794", "paidOnly": true, "title": "Count Pairs of Equal Substrings With Minimum Difference", "titleSlug": "count-pairs-of-equal-substrings-with-minimum-difference", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2012, "totalSubmissionRaw": 3078}, "1795": {"acRate": 85.3018736114695, "difficulty": "Easy", "likes": 856, "dislikes": 56, "categoryTitle": "Database", "frontendQuestionId": "1795", "paidOnly": false, "title": "Rearrange Products Table", "titleSlug": "rearrange-products-table", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 135537, "totalSubmissionRaw": 158891}, "1796": {"acRate": 50.624213440724894, "difficulty": "Easy", "likes": 529, "dislikes": 130, "categoryTitle": "Algorithms", "frontendQuestionId": "1796", "paidOnly": false, "title": "Second Largest Digit in a String", "titleSlug": "second-largest-digit-in-a-string", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 60339, "totalSubmissionRaw": 119190}, "1797": {"acRate": 57.69124905958126, "difficulty": "Medium", "likes": 375, "dislikes": 50, "categoryTitle": "Algorithms", "frontendQuestionId": "1797", "paidOnly": false, "title": "Design Authentication Manager", "titleSlug": "design-authentication-manager", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Doubly-Linked List", "id": "VG9waWNUYWdOb2RlOjYxMDU4", "slug": "doubly-linked-list"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 31440, "totalSubmissionRaw": 54497}, "1798": {"acRate": 61.01395942945774, "difficulty": "Medium", "likes": 814, "dislikes": 59, "categoryTitle": "Algorithms", "frontendQuestionId": "1798", "paidOnly": false, "title": "Maximum Number of Consecutive Values You Can Make", "titleSlug": "maximum-number-of-consecutive-values-you-can-make", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20062, "totalSubmissionRaw": 32881}, "1799": {"acRate": 57.74998123264019, "difficulty": "Hard", "likes": 1630, "dislikes": 111, "categoryTitle": "Algorithms", "frontendQuestionId": "1799", "paidOnly": false, "title": "Maximize Score After N Operations", "titleSlug": "maximize-score-after-n-operations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 61543, "totalSubmissionRaw": 106568}, "1800": {"acRate": 62.021489518592645, "difficulty": "Easy", "likes": 721, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "1800", "paidOnly": false, "title": "Maximum Ascending Subarray Sum", "titleSlug": "maximum-ascending-subarray-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 58877, "totalSubmissionRaw": 94930}, "1801": {"acRate": 49.90424329126191, "difficulty": "Medium", "likes": 292, "dislikes": 237, "categoryTitle": "Algorithms", "frontendQuestionId": "1801", "paidOnly": false, "title": "Number of Orders in the Backlog", "titleSlug": "number-of-orders-in-the-backlog", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21628, "totalSubmissionRaw": 43339}, "1802": {"acRate": 39.210437737421664, "difficulty": "Medium", "likes": 2544, "dislikes": 448, "categoryTitle": "Algorithms", "frontendQuestionId": "1802", "paidOnly": false, "title": "Maximum Value at a Given Index in a Bounded Array", "titleSlug": "maximum-value-at-a-given-index-in-a-bounded-array", "topicTags": [{"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 73389, "totalSubmissionRaw": 187165}, "1803": {"acRate": 48.11707021179801, "difficulty": "Hard", "likes": 527, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "1803", "paidOnly": false, "title": "Count Pairs With XOR in a Range", "titleSlug": "count-pairs-with-xor-in-a-range", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9519, "totalSubmissionRaw": 19783}, "1804": {"acRate": 61.46860913307637, "difficulty": "Medium", "likes": 320, "dislikes": 18, "categoryTitle": "Algorithms", "frontendQuestionId": "1804", "paidOnly": true, "title": "Implement Trie II (Prefix Tree)", "titleSlug": "implement-trie-ii-prefix-tree", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 18818, "totalSubmissionRaw": 30614}, "1805": {"acRate": 38.093515489705595, "difficulty": "Easy", "likes": 612, "dislikes": 101, "categoryTitle": "Algorithms", "frontendQuestionId": "1805", "paidOnly": false, "title": "Number of Different Integers in a String", "titleSlug": "number-of-different-integers-in-a-string", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 49493, "totalSubmissionRaw": 129925}, "1806": {"acRate": 72.82064787990518, "difficulty": "Medium", "likes": 318, "dislikes": 167, "categoryTitle": "Algorithms", "frontendQuestionId": "1806", "paidOnly": false, "title": "Minimum Number of Operations to Reinitialize a Permutation", "titleSlug": "minimum-number-of-operations-to-reinitialize-a-permutation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19355, "totalSubmissionRaw": 26579}, "1807": {"acRate": 67.02943989797004, "difficulty": "Medium", "likes": 482, "dislikes": 41, "categoryTitle": "Algorithms", "frontendQuestionId": "1807", "paidOnly": false, "title": "Evaluate the Bracket Pairs of a String", "titleSlug": "evaluate-the-bracket-pairs-of-a-string", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 31534, "totalSubmissionRaw": 47045}, "1808": {"acRate": 33.19172515700037, "difficulty": "Hard", "likes": 224, "dislikes": 167, "categoryTitle": "Algorithms", "frontendQuestionId": "1808", "paidOnly": false, "title": "Maximize Number of Nice Divisors", "titleSlug": "maximize-number-of-nice-divisors", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7188, "totalSubmissionRaw": 21656}, "1809": {"acRate": 58.60480301821084, "difficulty": "Easy", "likes": 90, "dislikes": 61, "categoryTitle": "Database", "frontendQuestionId": "1809", "paidOnly": true, "title": "Ad-Free Sessions", "titleSlug": "ad-free-sessions", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16155, "totalSubmissionRaw": 27566}, "1810": {"acRate": 56.84767759562842, "difficulty": "Medium", "likes": 86, "dislikes": 26, "categoryTitle": "Algorithms", "frontendQuestionId": "1810", "paidOnly": true, "title": "Minimum Path Cost in a Hidden Grid", "titleSlug": "minimum-path-cost-in-a-hidden-grid", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3329, "totalSubmissionRaw": 5856}, "1811": {"acRate": 60.99249632552023, "difficulty": "Medium", "likes": 197, "dislikes": 26, "categoryTitle": "Database", "frontendQuestionId": "1811", "paidOnly": true, "title": "Find Interview Candidates", "titleSlug": "find-interview-candidates", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15769, "totalSubmissionRaw": 25854}, "1812": {"acRate": 78.62715788322365, "difficulty": "Easy", "likes": 812, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "1812", "paidOnly": false, "title": "Determine Color of a Chessboard Square", "titleSlug": "determine-color-of-a-chessboard-square", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 86265, "totalSubmissionRaw": 109714}, "1813": {"acRate": 33.693424505353484, "difficulty": "Medium", "likes": 403, "dislikes": 69, "categoryTitle": "Algorithms", "frontendQuestionId": "1813", "paidOnly": false, "title": "Sentence Similarity III", "titleSlug": "sentence-similarity-iii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17591, "totalSubmissionRaw": 52209}, "1814": {"acRate": 48.746045593535484, "difficulty": "Medium", "likes": 1822, "dislikes": 85, "categoryTitle": "Algorithms", "frontendQuestionId": "1814", "paidOnly": false, "title": "Count Nice Pairs in an Array", "titleSlug": "count-nice-pairs-in-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 110635, "totalSubmissionRaw": 226962}, "1815": {"acRate": 40.00358080687515, "difficulty": "Hard", "likes": 341, "dislikes": 27, "categoryTitle": "Algorithms", "frontendQuestionId": "1815", "paidOnly": false, "title": "Maximum Number of Groups Getting Fresh Donuts", "titleSlug": "maximum-number-of-groups-getting-fresh-donuts", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6703, "totalSubmissionRaw": 16756}, "1816": {"acRate": 85.46893759995444, "difficulty": "Easy", "likes": 1138, "dislikes": 33, "categoryTitle": "Algorithms", "frontendQuestionId": "1816", "paidOnly": false, "title": "Truncate Sentence", "titleSlug": "truncate-sentence", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 180101, "totalSubmissionRaw": 210721}, "1817": {"acRate": 80.53552899322166, "difficulty": "Medium", "likes": 827, "dislikes": 306, "categoryTitle": "Algorithms", "frontendQuestionId": "1817", "paidOnly": false, "title": "Finding the Users Active Minutes", "titleSlug": "finding-the-users-active-minutes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 59762, "totalSubmissionRaw": 74206}, "1818": {"acRate": 30.749579189895783, "difficulty": "Medium", "likes": 1021, "dislikes": 76, "categoryTitle": "Algorithms", "frontendQuestionId": "1818", "paidOnly": false, "title": "Minimum Absolute Sum Difference", "titleSlug": "minimum-absolute-sum-difference", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25758, "totalSubmissionRaw": 83767}, "1819": {"acRate": 40.97473711767529, "difficulty": "Hard", "likes": 412, "dislikes": 44, "categoryTitle": "Algorithms", "frontendQuestionId": "1819", "paidOnly": false, "title": "Number of Different Subsequences GCDs", "titleSlug": "number-of-different-subsequences-gcds", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9391, "totalSubmissionRaw": 22919}, "1820": {"acRate": 50.205338809034906, "difficulty": "Medium", "likes": 214, "dislikes": 62, "categoryTitle": "Algorithms", "frontendQuestionId": "1820", "paidOnly": true, "title": "Maximum Number of Accepted Invitations", "titleSlug": "maximum-number-of-accepted-invitations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8313, "totalSubmissionRaw": 16558}, "1821": {"acRate": 87.75313735602545, "difficulty": "Easy", "likes": 58, "dislikes": 25, "categoryTitle": "Database", "frontendQuestionId": "1821", "paidOnly": true, "title": "Find Customers With Positive Revenue this Year", "titleSlug": "find-customers-with-positive-revenue-this-year", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25523, "totalSubmissionRaw": 29085}, "1822": {"acRate": 65.31981915139401, "difficulty": "Easy", "likes": 2161, "dislikes": 218, "categoryTitle": "Algorithms", "frontendQuestionId": "1822", "paidOnly": false, "title": "Sign of the Product of an Array", "titleSlug": "sign-of-the-product-of-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 347748, "totalSubmissionRaw": 532378}, "1823": {"acRate": 81.7295569865909, "difficulty": "Medium", "likes": 3773, "dislikes": 107, "categoryTitle": "Algorithms", "frontendQuestionId": "1823", "paidOnly": false, "title": "Find the Winner of the Circular Game", "titleSlug": "find-the-winner-of-the-circular-game", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 288478, "totalSubmissionRaw": 352965}, "1824": {"acRate": 50.218221804042486, "difficulty": "Medium", "likes": 1193, "dislikes": 48, "categoryTitle": "Algorithms", "frontendQuestionId": "1824", "paidOnly": false, "title": "Minimum Sideway Jumps", "titleSlug": "minimum-sideway-jumps", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 44299, "totalSubmissionRaw": 88213}, "1825": {"acRate": 37.178296876740816, "difficulty": "Hard", "likes": 461, "dislikes": 129, "categoryTitle": "Algorithms", "frontendQuestionId": "1825", "paidOnly": false, "title": "Finding MK Average", "titleSlug": "finding-mk-average", "topicTags": [{"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Data Stream", "id": "VG9waWNUYWdOb2RlOjYxMDYz", "slug": "data-stream"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20022, "totalSubmissionRaw": 53854}, "1826": {"acRate": 50.08801095247408, "difficulty": "Easy", "likes": 67, "dislikes": 76, "categoryTitle": "Algorithms", "frontendQuestionId": "1826", "paidOnly": true, "title": "Faulty Sensor", "titleSlug": "faulty-sensor", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5121, "totalSubmissionRaw": 10223}, "1827": {"acRate": 80.0621746903131, "difficulty": "Easy", "likes": 1233, "dislikes": 63, "categoryTitle": "Algorithms", "frontendQuestionId": "1827", "paidOnly": false, "title": "Minimum Operations to Make the Array Increasing", "titleSlug": "minimum-operations-to-make-the-array-increasing", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 101213, "totalSubmissionRaw": 126418}, "1828": {"acRate": 86.35631408233014, "difficulty": "Medium", "likes": 1144, "dislikes": 83, "categoryTitle": "Algorithms", "frontendQuestionId": "1828", "paidOnly": false, "title": "Queries on Number of Points Inside a Circle", "titleSlug": "queries-on-number-of-points-inside-a-circle", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 79338, "totalSubmissionRaw": 91873}, "1829": {"acRate": 77.16565543262122, "difficulty": "Medium", "likes": 774, "dislikes": 61, "categoryTitle": "Algorithms", "frontendQuestionId": "1829", "paidOnly": false, "title": "Maximum XOR for Each Query", "titleSlug": "maximum-xor-for-each-query", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30269, "totalSubmissionRaw": 39226}, "1830": {"acRate": 50.05452562704471, "difficulty": "Hard", "likes": 180, "dislikes": 126, "categoryTitle": "Algorithms", "frontendQuestionId": "1830", "paidOnly": false, "title": "Minimum Number of Operations to Make String Sorted", "titleSlug": "minimum-number-of-operations-to-make-string-sorted", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4131, "totalSubmissionRaw": 8253}, "1831": {"acRate": 81.76178150293767, "difficulty": "Medium", "likes": 87, "dislikes": 2, "categoryTitle": "Database", "frontendQuestionId": "1831", "paidOnly": true, "title": "Maximum Transaction Each Day", "titleSlug": "maximum-transaction-each-day", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19899, "totalSubmissionRaw": 24338}, "1832": {"acRate": 83.34569973752308, "difficulty": "Easy", "likes": 2768, "dislikes": 57, "categoryTitle": "Algorithms", "frontendQuestionId": "1832", "paidOnly": false, "title": "Check if the Sentence Is Pangram", "titleSlug": "check-if-the-sentence-is-pangram", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 359447, "totalSubmissionRaw": 431273}, "1833": {"acRate": 73.83793149284722, "difficulty": "Medium", "likes": 2174, "dislikes": 672, "categoryTitle": "Algorithms", "frontendQuestionId": "1833", "paidOnly": false, "title": "Maximum Ice Cream Bars", "titleSlug": "maximum-ice-cream-bars", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 161089, "totalSubmissionRaw": 218166}, "1834": {"acRate": 45.671565113995584, "difficulty": "Medium", "likes": 3167, "dislikes": 267, "categoryTitle": "Algorithms", "frontendQuestionId": "1834", "paidOnly": false, "title": "Single-Threaded CPU", "titleSlug": "single-threaded-cpu", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 110234, "totalSubmissionRaw": 241366}, "1835": {"acRate": 61.56189671814671, "difficulty": "Hard", "likes": 602, "dislikes": 50, "categoryTitle": "Algorithms", "frontendQuestionId": "1835", "paidOnly": false, "title": "Find XOR Sum of All Pairs Bitwise AND", "titleSlug": "find-xor-sum-of-all-pairs-bitwise-and", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20409, "totalSubmissionRaw": 33152}, "1836": {"acRate": 74.5888175437848, "difficulty": "Medium", "likes": 398, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "1836", "paidOnly": true, "title": "Remove Duplicates From an Unsorted Linked List", "titleSlug": "remove-duplicates-from-an-unsorted-linked-list", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 34965, "totalSubmissionRaw": 46877}, "1837": {"acRate": 77.56764462305009, "difficulty": "Easy", "likes": 510, "dislikes": 45, "categoryTitle": "Algorithms", "frontendQuestionId": "1837", "paidOnly": false, "title": "Sum of Digits in Base K", "titleSlug": "sum-of-digits-in-base-k", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 57134, "totalSubmissionRaw": 73657}, "1838": {"acRate": 44.220031669495995, "difficulty": "Medium", "likes": 4647, "dislikes": 213, "categoryTitle": "Algorithms", "frontendQuestionId": "1838", "paidOnly": false, "title": "Frequency of the Most Frequent Element", "titleSlug": "frequency-of-the-most-frequent-element", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 154989, "totalSubmissionRaw": 350495}, "1839": {"acRate": 49.519554440296226, "difficulty": "Medium", "likes": 756, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "1839", "paidOnly": false, "title": "Longest Substring Of All Vowels in Order", "titleSlug": "longest-substring-of-all-vowels-in-order", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 32364, "totalSubmissionRaw": 65356}, "1840": {"acRate": 36.33251833740832, "difficulty": "Hard", "likes": 376, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "1840", "paidOnly": false, "title": "Maximum Building Height", "titleSlug": "maximum-building-height", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7430, "totalSubmissionRaw": 20450}, "1841": {"acRate": 53.45395374065321, "difficulty": "Medium", "likes": 107, "dislikes": 97, "categoryTitle": "Database", "frontendQuestionId": "1841", "paidOnly": true, "title": "League Statistics", "titleSlug": "league-statistics", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 13797, "totalSubmissionRaw": 25811}, "1842": {"acRate": 53.263371076129985, "difficulty": "Hard", "likes": 121, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "1842", "paidOnly": true, "title": "Next Palindrome Using Same Digits", "titleSlug": "next-palindrome-using-same-digits", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5786, "totalSubmissionRaw": 10863}, "1843": {"acRate": 44.896136672490776, "difficulty": "Medium", "likes": 93, "dislikes": 57, "categoryTitle": "Database", "frontendQuestionId": "1843", "paidOnly": true, "title": "Suspicious Bank Accounts", "titleSlug": "suspicious-bank-accounts", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 11563, "totalSubmissionRaw": 25755}, "1844": {"acRate": 81.49591485702, "difficulty": "Easy", "likes": 835, "dislikes": 108, "categoryTitle": "Algorithms", "frontendQuestionId": "1844", "paidOnly": false, "title": "Replace All Digits with Characters", "titleSlug": "replace-all-digits-with-characters", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 90969, "totalSubmissionRaw": 111624}, "1845": {"acRate": 69.39554283559076, "difficulty": "Medium", "likes": 1416, "dislikes": 88, "categoryTitle": "Algorithms", "frontendQuestionId": "1845", "paidOnly": false, "title": "Seat Reservation Manager", "titleSlug": "seat-reservation-manager", "topicTags": [{"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 125116, "totalSubmissionRaw": 180294}, "1846": {"acRate": 65.86117448510798, "difficulty": "Medium", "likes": 1078, "dislikes": 271, "categoryTitle": "Algorithms", "frontendQuestionId": "1846", "paidOnly": false, "title": "Maximum Element After Decreasing and Rearranging", "titleSlug": "maximum-element-after-decreasing-and-rearranging", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 105368, "totalSubmissionRaw": 159985}, "1847": {"acRate": 38.2578083425437, "difficulty": "Hard", "likes": 510, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "1847", "paidOnly": false, "title": "Closest Room", "titleSlug": "closest-room", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9346, "totalSubmissionRaw": 24429}, "1848": {"acRate": 54.490892106492296, "difficulty": "Easy", "likes": 363, "dislikes": 67, "categoryTitle": "Algorithms", "frontendQuestionId": "1848", "paidOnly": false, "title": "Minimum Distance to the Target Element", "titleSlug": "minimum-distance-to-the-target-element", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 46666, "totalSubmissionRaw": 85640}, "1849": {"acRate": 35.941388256472706, "difficulty": "Medium", "likes": 525, "dislikes": 117, "categoryTitle": "Algorithms", "frontendQuestionId": "1849", "paidOnly": false, "title": "Splitting a String Into Descending Consecutive Values", "titleSlug": "splitting-a-string-into-descending-consecutive-values", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27153, "totalSubmissionRaw": 75548}, "1850": {"acRate": 71.30612767046182, "difficulty": "Medium", "likes": 775, "dislikes": 105, "categoryTitle": "Algorithms", "frontendQuestionId": "1850", "paidOnly": false, "title": "Minimum Adjacent Swaps to Reach the Kth Smallest Number", "titleSlug": "minimum-adjacent-swaps-to-reach-the-kth-smallest-number", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22296, "totalSubmissionRaw": 31268}, "1851": {"acRate": 50.17564323400562, "difficulty": "Hard", "likes": 957, "dislikes": 35, "categoryTitle": "Algorithms", "frontendQuestionId": "1851", "paidOnly": false, "title": "Minimum Interval to Include Each Query", "titleSlug": "minimum-interval-to-include-each-query", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Line Sweep", "id": "VG9waWNUYWdOb2RlOjU2MTE5", "slug": "line-sweep"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 36994, "totalSubmissionRaw": 73729}, "1852": {"acRate": 71.44615967421157, "difficulty": "Medium", "likes": 134, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "1852", "paidOnly": true, "title": "Distinct Numbers in Each Subarray", "titleSlug": "distinct-numbers-in-each-subarray", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7544, "totalSubmissionRaw": 10559}, "1853": {"acRate": 85.75286100038575, "difficulty": "Easy", "likes": 63, "dislikes": 42, "categoryTitle": "Database", "frontendQuestionId": "1853", "paidOnly": true, "title": "Convert Date Format", "titleSlug": "convert-date-format", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13338, "totalSubmissionRaw": 15554}, "1854": {"acRate": 61.077113429641514, "difficulty": "Easy", "likes": 1311, "dislikes": 235, "categoryTitle": "Algorithms", "frontendQuestionId": "1854", "paidOnly": false, "title": "Maximum Population Year", "titleSlug": "maximum-population-year", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 73058, "totalSubmissionRaw": 119616}, "1855": {"acRate": 53.49705345720697, "difficulty": "Medium", "likes": 1196, "dislikes": 28, "categoryTitle": "Algorithms", "frontendQuestionId": "1855", "paidOnly": false, "title": "Maximum Distance Between a Pair of Values", "titleSlug": "maximum-distance-between-a-pair-of-values", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 51018, "totalSubmissionRaw": 95366}, "1856": {"acRate": 38.131376789481365, "difficulty": "Medium", "likes": 1433, "dislikes": 122, "categoryTitle": "Algorithms", "frontendQuestionId": "1856", "paidOnly": false, "title": "Maximum Subarray Min-Product", "titleSlug": "maximum-subarray-min-product", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28740, "totalSubmissionRaw": 75371}, "1857": {"acRate": 49.907486160228004, "difficulty": "Hard", "likes": 2123, "dislikes": 69, "categoryTitle": "Algorithms", "frontendQuestionId": "1857", "paidOnly": false, "title": "Largest Color Value in a Directed Graph", "titleSlug": "largest-color-value-in-a-directed-graph", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 66893, "totalSubmissionRaw": 134034}, "1858": {"acRate": 68.61269676526553, "difficulty": "Medium", "likes": 179, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "1858", "paidOnly": true, "title": "Longest Word With All Prefixes", "titleSlug": "longest-word-with-all-prefixes", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7933, "totalSubmissionRaw": 11562}, "1859": {"acRate": 83.28580391262192, "difficulty": "Easy", "likes": 2195, "dislikes": 78, "categoryTitle": "Algorithms", "frontendQuestionId": "1859", "paidOnly": false, "title": "Sorting the Sentence", "titleSlug": "sorting-the-sentence", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 175230, "totalSubmissionRaw": 210396}, "1860": {"acRate": 72.22300436435309, "difficulty": "Medium", "likes": 222, "dislikes": 85, "categoryTitle": "Algorithms", "frontendQuestionId": "1860", "paidOnly": false, "title": "Incremental Memory Leak", "titleSlug": "incremental-memory-leak", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20520, "totalSubmissionRaw": 28412}, "1861": {"acRate": 67.75823027347153, "difficulty": "Medium", "likes": 982, "dislikes": 56, "categoryTitle": "Algorithms", "frontendQuestionId": "1861", "paidOnly": false, "title": "Rotating the Box", "titleSlug": "rotating-the-box", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 54460, "totalSubmissionRaw": 80374}, "1862": {"acRate": 28.935418000060952, "difficulty": "Hard", "likes": 443, "dislikes": 37, "categoryTitle": "Algorithms", "frontendQuestionId": "1862", "paidOnly": false, "title": "Sum of Floored Pairs", "titleSlug": "sum-of-floored-pairs", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9494, "totalSubmissionRaw": 32811}, "1863": {"acRate": 87.79126552253383, "difficulty": "Easy", "likes": 2152, "dislikes": 251, "categoryTitle": "Algorithms", "frontendQuestionId": "1863", "paidOnly": false, "title": "Sum of All Subset XOR Totals", "titleSlug": "sum-of-all-subset-xor-totals", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 182467, "totalSubmissionRaw": 207842}, "1864": {"acRate": 43.42296228093447, "difficulty": "Medium", "likes": 584, "dislikes": 36, "categoryTitle": "Algorithms", "frontendQuestionId": "1864", "paidOnly": false, "title": "Minimum Number of Swaps to Make the Binary String Alternating", "titleSlug": "minimum-number-of-swaps-to-make-the-binary-string-alternating", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27825, "totalSubmissionRaw": 64079}, "1865": {"acRate": 50.928376800311405, "difficulty": "Medium", "likes": 612, "dislikes": 107, "categoryTitle": "Algorithms", "frontendQuestionId": "1865", "paidOnly": false, "title": "Finding Pairs With a Certain Sum", "titleSlug": "finding-pairs-with-a-certain-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26167, "totalSubmissionRaw": 51380}, "1866": {"acRate": 57.70557130814622, "difficulty": "Hard", "likes": 709, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "1866", "paidOnly": false, "title": "Number of Ways to Rearrange Sticks With K Sticks Visible", "titleSlug": "number-of-ways-to-rearrange-sticks-with-k-sticks-visible", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15060, "totalSubmissionRaw": 26098}, "1867": {"acRate": 71.0340370529944, "difficulty": "Medium", "likes": 72, "dislikes": 266, "categoryTitle": "Database", "frontendQuestionId": "1867", "paidOnly": true, "title": "Orders With Maximum Quantity Above Average", "titleSlug": "orders-with-maximum-quantity-above-average", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16487, "totalSubmissionRaw": 23210}, "1868": {"acRate": 58.67853651006021, "difficulty": "Medium", "likes": 368, "dislikes": 66, "categoryTitle": "Algorithms", "frontendQuestionId": "1868", "paidOnly": true, "title": "Product of Two Run-Length Encoded Arrays", "titleSlug": "product-of-two-run-length-encoded-arrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 45612, "totalSubmissionRaw": 77732}, "1869": {"acRate": 61.21741284290049, "difficulty": "Easy", "likes": 516, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "1869", "paidOnly": false, "title": "Longer Contiguous Segments of Ones than Zeros", "titleSlug": "longer-contiguous-segments-of-ones-than-zeros", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 49430, "totalSubmissionRaw": 80745}, "1870": {"acRate": 46.83918904768192, "difficulty": "Medium", "likes": 2311, "dislikes": 279, "categoryTitle": "Algorithms", "frontendQuestionId": "1870", "paidOnly": false, "title": "Minimum Speed to Arrive on Time", "titleSlug": "minimum-speed-to-arrive-on-time", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 102879, "totalSubmissionRaw": 219643}, "1871": {"acRate": 24.917576111679153, "difficulty": "Medium", "likes": 1670, "dislikes": 104, "categoryTitle": "Algorithms", "frontendQuestionId": "1871", "paidOnly": false, "title": "Jump Game VII", "titleSlug": "jump-game-vii", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 47765, "totalSubmissionRaw": 191690}, "1872": {"acRate": 53.09311916648578, "difficulty": "Hard", "likes": 444, "dislikes": 23, "categoryTitle": "Algorithms", "frontendQuestionId": "1872", "paidOnly": false, "title": "Stone Game VIII", "titleSlug": "stone-game-viii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9784, "totalSubmissionRaw": 18428}, "1873": {"acRate": 57.563123132641316, "difficulty": "Easy", "likes": 1079, "dislikes": 77, "categoryTitle": "Database", "frontendQuestionId": "1873", "paidOnly": false, "title": "Calculate Special Bonus", "titleSlug": "calculate-special-bonus", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 246992, "totalSubmissionRaw": 429080}, "1874": {"acRate": 89.41086732175708, "difficulty": "Medium", "likes": 244, "dislikes": 27, "categoryTitle": "Algorithms", "frontendQuestionId": "1874", "paidOnly": true, "title": "Minimize Product Sum of Two Arrays", "titleSlug": "minimize-product-sum-of-two-arrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 19927, "totalSubmissionRaw": 22287}, "1875": {"acRate": 67.63416393806537, "difficulty": "Medium", "likes": 73, "dislikes": 5, "categoryTitle": "Database", "frontendQuestionId": "1875", "paidOnly": true, "title": "Group Employees of the Same Salary", "titleSlug": "group-employees-of-the-same-salary", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12187, "totalSubmissionRaw": 18019}, "1876": {"acRate": 73.87323383310789, "difficulty": "Easy", "likes": 1504, "dislikes": 46, "categoryTitle": "Algorithms", "frontendQuestionId": "1876", "paidOnly": false, "title": "Substrings of Size Three with Distinct Characters", "titleSlug": "substrings-of-size-three-with-distinct-characters", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 129977, "totalSubmissionRaw": 175946}, "1877": {"acRate": 81.44473549677204, "difficulty": "Medium", "likes": 1947, "dislikes": 440, "categoryTitle": "Algorithms", "frontendQuestionId": "1877", "paidOnly": false, "title": "Minimize Maximum Pair Sum in Array", "titleSlug": "minimize-maximum-pair-sum-in-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 180023, "totalSubmissionRaw": 221037}, "1878": {"acRate": 48.058771420716624, "difficulty": "Medium", "likes": 207, "dislikes": 518, "categoryTitle": "Algorithms", "frontendQuestionId": "1878", "paidOnly": false, "title": "Get Biggest Three Rhombus Sums in a Grid", "titleSlug": "get-biggest-three-rhombus-sums-in-a-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15733, "totalSubmissionRaw": 32737}, "1879": {"acRate": 47.76863786514671, "difficulty": "Hard", "likes": 675, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "1879", "paidOnly": false, "title": "Minimum XOR Sum of Two Arrays", "titleSlug": "minimum-xor-sum-of-two-arrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14750, "totalSubmissionRaw": 30878}, "1880": {"acRate": 74.2906862374215, "difficulty": "Easy", "likes": 573, "dislikes": 39, "categoryTitle": "Algorithms", "frontendQuestionId": "1880", "paidOnly": false, "title": "Check if Word Equals Summation of Two Words", "titleSlug": "check-if-word-equals-summation-of-two-words", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 68732, "totalSubmissionRaw": 92518}, "1881": {"acRate": 38.05862758161226, "difficulty": "Medium", "likes": 381, "dislikes": 63, "categoryTitle": "Algorithms", "frontendQuestionId": "1881", "paidOnly": false, "title": "Maximum Value after Insertion", "titleSlug": "maximum-value-after-insertion", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28560, "totalSubmissionRaw": 75047}, "1882": {"acRate": 40.29305727832327, "difficulty": "Medium", "likes": 925, "dislikes": 271, "categoryTitle": "Algorithms", "frontendQuestionId": "1882", "paidOnly": false, "title": "Process Tasks Using Servers", "titleSlug": "process-tasks-using-servers", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34758, "totalSubmissionRaw": 86263}, "1883": {"acRate": 37.862164465274816, "difficulty": "Hard", "likes": 335, "dislikes": 50, "categoryTitle": "Algorithms", "frontendQuestionId": "1883", "paidOnly": false, "title": "Minimum Skips to Arrive at Meeting On Time", "titleSlug": "minimum-skips-to-arrive-at-meeting-on-time", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7109, "totalSubmissionRaw": 18776}, "1884": {"acRate": 73.07457123722448, "difficulty": "Medium", "likes": 1455, "dislikes": 143, "categoryTitle": "Algorithms", "frontendQuestionId": "1884", "paidOnly": false, "title": "Egg Drop With 2 Eggs and N Floors", "titleSlug": "egg-drop-with-2-eggs-and-n-floors", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 50192, "totalSubmissionRaw": 68686}, "1885": {"acRate": 60.898483738233466, "difficulty": "Medium", "likes": 237, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "1885", "paidOnly": true, "title": "Count Pairs in Two Arrays", "titleSlug": "count-pairs-in-two-arrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 10804, "totalSubmissionRaw": 17741}, "1886": {"acRate": 57.150904921726855, "difficulty": "Easy", "likes": 1436, "dislikes": 121, "categoryTitle": "Algorithms", "frontendQuestionId": "1886", "paidOnly": false, "title": "Determine Whether Matrix Can Be Obtained By Rotation", "titleSlug": "determine-whether-matrix-can-be-obtained-by-rotation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 72029, "totalSubmissionRaw": 126033}, "1887": {"acRate": 72.88710861056752, "difficulty": "Medium", "likes": 1225, "dislikes": 48, "categoryTitle": "Algorithms", "frontendQuestionId": "1887", "paidOnly": false, "title": "Reduction Operations to Make the Array Elements Equal", "titleSlug": "reduction-operations-to-make-the-array-elements-equal", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 95348, "totalSubmissionRaw": 130816}, "1888": {"acRate": 39.98893805309734, "difficulty": "Medium", "likes": 1207, "dislikes": 73, "categoryTitle": "Algorithms", "frontendQuestionId": "1888", "paidOnly": false, "title": "Minimum Number of Flips to Make the Binary String Alternating", "titleSlug": "minimum-number-of-flips-to-make-the-binary-string-alternating", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28197, "totalSubmissionRaw": 70512}, "1889": {"acRate": 31.92409144196952, "difficulty": "Hard", "likes": 403, "dislikes": 36, "categoryTitle": "Algorithms", "frontendQuestionId": "1889", "paidOnly": false, "title": "Minimum Space Wasted From Packaging", "titleSlug": "minimum-space-wasted-from-packaging", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13071, "totalSubmissionRaw": 40944}, "1890": {"acRate": 77.30813045863044, "difficulty": "Easy", "likes": 408, "dislikes": 11, "categoryTitle": "Database", "frontendQuestionId": "1890", "paidOnly": false, "title": "The Latest Login in 2020", "titleSlug": "the-latest-login-in-2020", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 91614, "totalSubmissionRaw": 118505}, "1891": {"acRate": 49.669987450226984, "difficulty": "Medium", "likes": 571, "dislikes": 41, "categoryTitle": "Algorithms", "frontendQuestionId": "1891", "paidOnly": true, "title": "Cutting Ribbons", "titleSlug": "cutting-ribbons", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 64117, "totalSubmissionRaw": 129086}, "1892": {"acRate": 43.59708795799022, "difficulty": "Hard", "likes": 85, "dislikes": 22, "categoryTitle": "Database", "frontendQuestionId": "1892", "paidOnly": true, "title": "Page Recommendations II", "titleSlug": "page-recommendations-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7306, "totalSubmissionRaw": 16758}, "1893": {"acRate": 50.04764792514944, "difficulty": "Easy", "likes": 600, "dislikes": 112, "categoryTitle": "Algorithms", "frontendQuestionId": "1893", "paidOnly": false, "title": "Check if All the Integers in a Range Are Covered", "titleSlug": "check-if-all-the-integers-in-a-range-are-covered", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 46216, "totalSubmissionRaw": 92344}, "1894": {"acRate": 45.75559701492538, "difficulty": "Medium", "likes": 591, "dislikes": 67, "categoryTitle": "Algorithms", "frontendQuestionId": "1894", "paidOnly": false, "title": "Find the Student that Will Replace the Chalk", "titleSlug": "find-the-student-that-will-replace-the-chalk", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 39240, "totalSubmissionRaw": 85760}, "1895": {"acRate": 53.01114586545663, "difficulty": "Medium", "likes": 304, "dislikes": 261, "categoryTitle": "Algorithms", "frontendQuestionId": "1895", "paidOnly": false, "title": "Largest Magic Square", "titleSlug": "largest-magic-square", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12033, "totalSubmissionRaw": 22699}, "1896": {"acRate": 54.00311931375098, "difficulty": "Hard", "likes": 237, "dislikes": 40, "categoryTitle": "Algorithms", "frontendQuestionId": "1896", "paidOnly": false, "title": "Minimum Cost to Change the Final Value of Expression", "titleSlug": "minimum-cost-to-change-the-final-value-of-expression", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4155, "totalSubmissionRaw": 7694}, "1897": {"acRate": 67.20080430359602, "difficulty": "Easy", "likes": 1100, "dislikes": 78, "categoryTitle": "Algorithms", "frontendQuestionId": "1897", "paidOnly": false, "title": "Redistribute Characters to Make All Strings Equal", "titleSlug": "redistribute-characters-to-make-all-strings-equal", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 141035, "totalSubmissionRaw": 209871}, "1898": {"acRate": 43.94641645941669, "difficulty": "Medium", "likes": 975, "dislikes": 127, "categoryTitle": "Algorithms", "frontendQuestionId": "1898", "paidOnly": false, "title": "Maximum Number of Removable Characters", "titleSlug": "maximum-number-of-removable-characters", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 31098, "totalSubmissionRaw": 70766}, "1899": {"acRate": 66.29865363538556, "difficulty": "Medium", "likes": 805, "dislikes": 63, "categoryTitle": "Algorithms", "frontendQuestionId": "1899", "paidOnly": false, "title": "Merge Triplets to Form Target Triplet", "titleSlug": "merge-triplets-to-form-target-triplet", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 65938, "totalSubmissionRaw": 99455}, "1900": {"acRate": 50.9994498441225, "difficulty": "Hard", "likes": 229, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "1900", "paidOnly": false, "title": "The Earliest and Latest Rounds Where Players Compete", "titleSlug": "the-earliest-and-latest-rounds-where-players-compete", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5562, "totalSubmissionRaw": 10906}, "1901": {"acRate": 51.957057306240074, "difficulty": "Medium", "likes": 2084, "dislikes": 133, "categoryTitle": "Algorithms", "frontendQuestionId": "1901", "paidOnly": false, "title": "Find a Peak Element II", "titleSlug": "find-a-peak-element-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 80774, "totalSubmissionRaw": 155463}, "1902": {"acRate": 44.15584415584416, "difficulty": "Medium", "likes": 101, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "1902", "paidOnly": true, "title": "Depth of BST Given Insertion Order", "titleSlug": "depth-of-bst-given-insertion-order", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2380, "totalSubmissionRaw": 5390}, "1903": {"acRate": 63.625687481230145, "difficulty": "Easy", "likes": 2067, "dislikes": 125, "categoryTitle": "Algorithms", "frontendQuestionId": "1903", "paidOnly": false, "title": "Largest Odd Number in String", "titleSlug": "largest-odd-number-in-string", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 283894, "totalSubmissionRaw": 446194}, "1904": {"acRate": 43.91077249342183, "difficulty": "Medium", "likes": 213, "dislikes": 261, "categoryTitle": "Algorithms", "frontendQuestionId": "1904", "paidOnly": false, "title": "The Number of Full Rounds You Have Played", "titleSlug": "the-number-of-full-rounds-you-have-played", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22362, "totalSubmissionRaw": 50926}, "1905": {"acRate": 67.52319225580328, "difficulty": "Medium", "likes": 2083, "dislikes": 64, "categoryTitle": "Algorithms", "frontendQuestionId": "1905", "paidOnly": false, "title": "Count Sub Islands", "titleSlug": "count-sub-islands", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 97097, "totalSubmissionRaw": 143798}, "1906": {"acRate": 44.50444105333177, "difficulty": "Medium", "likes": 532, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "1906", "paidOnly": false, "title": "Minimum Absolute Difference Queries", "titleSlug": "minimum-absolute-difference-queries", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11374, "totalSubmissionRaw": 25557}, "1907": {"acRate": 60.153437406656295, "difficulty": "Medium", "likes": 450, "dislikes": 86, "categoryTitle": "Database", "frontendQuestionId": "1907", "paidOnly": false, "title": "Count Salary Categories", "titleSlug": "count-salary-categories", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 114788, "totalSubmissionRaw": 190825}, "1908": {"acRate": 63.133640552995395, "difficulty": "Medium", "likes": 102, "dislikes": 39, "categoryTitle": "Algorithms", "frontendQuestionId": "1908", "paidOnly": true, "title": "Game of Nim", "titleSlug": "game-of-nim", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Brainteaser", "id": "VG9waWNUYWdOb2RlOjMy", "slug": "brainteaser"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 4521, "totalSubmissionRaw": 7161}, "1909": {"acRate": 27.699299590648742, "difficulty": "Easy", "likes": 1244, "dislikes": 335, "categoryTitle": "Algorithms", "frontendQuestionId": "1909", "paidOnly": false, "title": "Remove One Element to Make the Array Strictly Increasing", "titleSlug": "remove-one-element-to-make-the-array-strictly-increasing", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 68140, "totalSubmissionRaw": 245999}, "1910": {"acRate": 77.76424168591014, "difficulty": "Medium", "likes": 1789, "dislikes": 60, "categoryTitle": "Algorithms", "frontendQuestionId": "1910", "paidOnly": false, "title": "Remove All Occurrences of a Substring", "titleSlug": "remove-all-occurrences-of-a-substring", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 128304, "totalSubmissionRaw": 164991}, "1911": {"acRate": 59.026622296173045, "difficulty": "Medium", "likes": 1238, "dislikes": 26, "categoryTitle": "Algorithms", "frontendQuestionId": "1911", "paidOnly": false, "title": "Maximum Alternating Subsequence Sum", "titleSlug": "maximum-alternating-subsequence-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 39732, "totalSubmissionRaw": 67312}, "1912": {"acRate": 36.540225543624885, "difficulty": "Hard", "likes": 241, "dislikes": 48, "categoryTitle": "Algorithms", "frontendQuestionId": "1912", "paidOnly": false, "title": "Design Movie Rental System", "titleSlug": "design-movie-rental-system", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6772, "totalSubmissionRaw": 18533}, "1913": {"acRate": 82.86066139043052, "difficulty": "Easy", "likes": 1517, "dislikes": 67, "categoryTitle": "Algorithms", "frontendQuestionId": "1913", "paidOnly": false, "title": "Maximum Product Difference Between Two Pairs", "titleSlug": "maximum-product-difference-between-two-pairs", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 252319, "totalSubmissionRaw": 304510}, "1914": {"acRate": 49.70990949176143, "difficulty": "Medium", "likes": 239, "dislikes": 271, "categoryTitle": "Algorithms", "frontendQuestionId": "1914", "paidOnly": false, "title": "Cyclically Rotating a Grid", "titleSlug": "cyclically-rotating-a-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12852, "totalSubmissionRaw": 25854}, "1915": {"acRate": 66.96930079411196, "difficulty": "Medium", "likes": 1725, "dislikes": 270, "categoryTitle": "Algorithms", "frontendQuestionId": "1915", "paidOnly": false, "title": "Number of Wonderful Substrings", "titleSlug": "number-of-wonderful-substrings", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 82983, "totalSubmissionRaw": 123912}, "1916": {"acRate": 49.185479733196516, "difficulty": "Hard", "likes": 486, "dislikes": 53, "categoryTitle": "Algorithms", "frontendQuestionId": "1916", "paidOnly": false, "title": "Count Ways to Build Rooms in an Ant Colony", "titleSlug": "count-ways-to-build-rooms-in-an-ant-colony", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7669, "totalSubmissionRaw": 15592}, "1917": {"acRate": 26.992835209825998, "difficulty": "Hard", "likes": 66, "dislikes": 60, "categoryTitle": "Database", "frontendQuestionId": "1917", "paidOnly": true, "title": "Leetcodify Friends Recommendations", "titleSlug": "leetcodify-friends-recommendations", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6593, "totalSubmissionRaw": 24425}, "1918": {"acRate": 52.509003601440575, "difficulty": "Medium", "likes": 205, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "1918", "paidOnly": true, "title": "Kth Smallest Subarray Sum", "titleSlug": "kth-smallest-subarray-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4374, "totalSubmissionRaw": 8330}, "1919": {"acRate": 41.60944998154301, "difficulty": "Hard", "likes": 58, "dislikes": 6, "categoryTitle": "Database", "frontendQuestionId": "1919", "paidOnly": true, "title": "Leetcodify Similar Friends", "titleSlug": "leetcodify-similar-friends", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5636, "totalSubmissionRaw": 13545}, "1920": {"acRate": 89.96308495311644, "difficulty": "Easy", "likes": 3371, "dislikes": 399, "categoryTitle": "Algorithms", "frontendQuestionId": "1920", "paidOnly": false, "title": "Build Array from Permutation", "titleSlug": "build-array-from-permutation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 556374, "totalSubmissionRaw": 618447}, "1921": {"acRate": 50.92232423851388, "difficulty": "Medium", "likes": 1504, "dislikes": 234, "categoryTitle": "Algorithms", "frontendQuestionId": "1921", "paidOnly": false, "title": "Eliminate Maximum Number of Monsters", "titleSlug": "eliminate-maximum-number-of-monsters", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 109704, "totalSubmissionRaw": 215434}, "1922": {"acRate": 46.202752520605834, "difficulty": "Medium", "likes": 1431, "dislikes": 438, "categoryTitle": "Algorithms", "frontendQuestionId": "1922", "paidOnly": false, "title": "Count Good Numbers", "titleSlug": "count-good-numbers", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 72816, "totalSubmissionRaw": 157601}, "1923": {"acRate": 28.357376561570497, "difficulty": "Hard", "likes": 477, "dislikes": 35, "categoryTitle": "Algorithms", "frontendQuestionId": "1923", "paidOnly": false, "title": "Longest Common Subpath", "titleSlug": "longest-common-subpath", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "Suffix Array", "id": "VG9waWNUYWdOb2RlOjU2Njk4", "slug": "suffix-array"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7627, "totalSubmissionRaw": 26896}, "1924": {"acRate": 50.6993006993007, "difficulty": "Hard", "likes": 13, "dislikes": 43, "categoryTitle": "Algorithms", "frontendQuestionId": "1924", "paidOnly": true, "title": "Erect the Fence II", "titleSlug": "erect-the-fence-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 725, "totalSubmissionRaw": 1430}, "1925": {"acRate": 67.92862729195029, "difficulty": "Easy", "likes": 425, "dislikes": 40, "categoryTitle": "Algorithms", "frontendQuestionId": "1925", "paidOnly": false, "title": "Count Square Sum Triples", "titleSlug": "count-square-sum-triples", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 46902, "totalSubmissionRaw": 69046}, "1926": {"acRate": 46.810458580139624, "difficulty": "Medium", "likes": 2316, "dislikes": 111, "categoryTitle": "Algorithms", "frontendQuestionId": "1926", "paidOnly": false, "title": "Nearest Exit from Entrance in Maze", "titleSlug": "nearest-exit-from-entrance-in-maze", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 161057, "totalSubmissionRaw": 344062}, "1927": {"acRate": 47.919223916056225, "difficulty": "Medium", "likes": 497, "dislikes": 86, "categoryTitle": "Algorithms", "frontendQuestionId": "1927", "paidOnly": false, "title": "Sum Game", "titleSlug": "sum-game", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12102, "totalSubmissionRaw": 25255}, "1928": {"acRate": 38.510654519117146, "difficulty": "Hard", "likes": 787, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "1928", "paidOnly": false, "title": "Minimum Cost to Reach Destination in Time", "titleSlug": "minimum-cost-to-reach-destination-in-time", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20204, "totalSubmissionRaw": 52465}, "1929": {"acRate": 90.03742305350923, "difficulty": "Easy", "likes": 3359, "dislikes": 392, "categoryTitle": "Algorithms", "frontendQuestionId": "1929", "paidOnly": false, "title": "Concatenation of Array", "titleSlug": "concatenation-of-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 832692, "totalSubmissionRaw": 924829}, "1930": {"acRate": 66.09109232130568, "difficulty": "Medium", "likes": 1726, "dislikes": 75, "categoryTitle": "Algorithms", "frontendQuestionId": "1930", "paidOnly": false, "title": "Unique Length-3 Palindromic Subsequences", "titleSlug": "unique-length-3-palindromic-subsequences", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 107554, "totalSubmissionRaw": 162736}, "1931": {"acRate": 57.719372105611356, "difficulty": "Hard", "likes": 480, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "1931", "paidOnly": false, "title": "Painting a Grid With Three Different Colors", "titleSlug": "painting-a-grid-with-three-different-colors", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9597, "totalSubmissionRaw": 16627}, "1932": {"acRate": 36.29083920563741, "difficulty": "Hard", "likes": 576, "dislikes": 40, "categoryTitle": "Algorithms", "frontendQuestionId": "1932", "paidOnly": false, "title": "Merge BSTs to Create Single BST", "titleSlug": "merge-bsts-to-create-single-bst", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9064, "totalSubmissionRaw": 24976}, "1933": {"acRate": 50.70555032925682, "difficulty": "Easy", "likes": 57, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "1933", "paidOnly": true, "title": "Check if String Is Decomposable Into Value-Equal Substrings", "titleSlug": "check-if-string-is-decomposable-into-value-equal-substrings", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3773, "totalSubmissionRaw": 7441}, "1934": {"acRate": 59.008805915782126, "difficulty": "Medium", "likes": 888, "dislikes": 81, "categoryTitle": "Database", "frontendQuestionId": "1934", "paidOnly": false, "title": "Confirmation Rate", "titleSlug": "confirmation-rate", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 231650, "totalSubmissionRaw": 392569}, "1935": {"acRate": 73.53010292804437, "difficulty": "Easy", "likes": 593, "dislikes": 29, "categoryTitle": "Algorithms", "frontendQuestionId": "1935", "paidOnly": false, "title": "Maximum Number of Words You Can Type", "titleSlug": "maximum-number-of-words-you-can-type", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 62580, "totalSubmissionRaw": 85108}, "1936": {"acRate": 42.92418719284523, "difficulty": "Medium", "likes": 375, "dislikes": 26, "categoryTitle": "Algorithms", "frontendQuestionId": "1936", "paidOnly": false, "title": "Add Minimum Number of Rungs", "titleSlug": "add-minimum-number-of-rungs", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29085, "totalSubmissionRaw": 67759}, "1937": {"acRate": 35.72836388098807, "difficulty": "Medium", "likes": 2340, "dislikes": 140, "categoryTitle": "Algorithms", "frontendQuestionId": "1937", "paidOnly": false, "title": "Maximum Number of Points with Cost", "titleSlug": "maximum-number-of-points-with-cost", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 60436, "totalSubmissionRaw": 169322}, "1938": {"acRate": 42.909367859862904, "difficulty": "Hard", "likes": 383, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "1938", "paidOnly": false, "title": "Maximum Genetic Difference Query", "titleSlug": "maximum-genetic-difference-query", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5634, "totalSubmissionRaw": 13130}, "1939": {"acRate": 56.34412835909046, "difficulty": "Easy", "likes": 62, "dislikes": 47, "categoryTitle": "Database", "frontendQuestionId": "1939", "paidOnly": true, "title": "Users That Actively Request Confirmation Messages", "titleSlug": "users-that-actively-request-confirmation-messages", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11448, "totalSubmissionRaw": 20318}, "1940": {"acRate": 81.23084319971153, "difficulty": "Medium", "likes": 186, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "1940", "paidOnly": true, "title": "Longest Common Subsequence Between Sorted Arrays", "titleSlug": "longest-common-subsequence-between-sorted-arrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 13516, "totalSubmissionRaw": 16639}, "1941": {"acRate": 77.80420134760206, "difficulty": "Easy", "likes": 888, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "1941", "paidOnly": false, "title": "Check if All Characters Have Equal Number of Occurrences", "titleSlug": "check-if-all-characters-have-equal-number-of-occurrences", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 102076, "totalSubmissionRaw": 131196}, "1942": {"acRate": 42.36505340132782, "difficulty": "Medium", "likes": 578, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "1942", "paidOnly": false, "title": "The Number of the Smallest Unoccupied Chair", "titleSlug": "the-number-of-the-smallest-unoccupied-chair", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17612, "totalSubmissionRaw": 41572}, "1943": {"acRate": 50.12741033735215, "difficulty": "Medium", "likes": 477, "dislikes": 34, "categoryTitle": "Algorithms", "frontendQuestionId": "1943", "paidOnly": false, "title": "Describe the Painting", "titleSlug": "describe-the-painting", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13180, "totalSubmissionRaw": 26293}, "1944": {"acRate": 69.82566568831996, "difficulty": "Hard", "likes": 1760, "dislikes": 52, "categoryTitle": "Algorithms", "frontendQuestionId": "1944", "paidOnly": false, "title": "Number of Visible People in a Queue", "titleSlug": "number-of-visible-people-in-a-queue", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 59238, "totalSubmissionRaw": 84837}, "1945": {"acRate": 62.87676241402161, "difficulty": "Easy", "likes": 608, "dislikes": 66, "categoryTitle": "Algorithms", "frontendQuestionId": "1945", "paidOnly": false, "title": "Sum of Digits of String After Convert", "titleSlug": "sum-of-digits-of-string-after-convert", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 55031, "totalSubmissionRaw": 87522}, "1946": {"acRate": 36.00076096919804, "difficulty": "Medium", "likes": 214, "dislikes": 225, "categoryTitle": "Algorithms", "frontendQuestionId": "1946", "paidOnly": false, "title": "Largest Number After Mutating Substring", "titleSlug": "largest-number-after-mutating-substring", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20816, "totalSubmissionRaw": 57821}, "1947": {"acRate": 62.294281388875326, "difficulty": "Medium", "likes": 781, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "1947", "paidOnly": false, "title": "Maximum Compatibility Score Sum", "titleSlug": "maximum-compatibility-score-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25511, "totalSubmissionRaw": 40953}, "1948": {"acRate": 55.57278422129877, "difficulty": "Hard", "likes": 319, "dislikes": 75, "categoryTitle": "Algorithms", "frontendQuestionId": "1948", "paidOnly": false, "title": "Delete Duplicate Folders in System", "titleSlug": "delete-duplicate-folders-in-system", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8960, "totalSubmissionRaw": 16123}, "1949": {"acRate": 54.477480647431385, "difficulty": "Medium", "likes": 147, "dislikes": 84, "categoryTitle": "Database", "frontendQuestionId": "1949", "paidOnly": true, "title": "Strong Friendship", "titleSlug": "strong-friendship", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12386, "totalSubmissionRaw": 22736}, "1950": {"acRate": 49.77799703996053, "difficulty": "Medium", "likes": 139, "dislikes": 54, "categoryTitle": "Algorithms", "frontendQuestionId": "1950", "paidOnly": true, "title": "Maximum of Minimum Values in All Subarrays", "titleSlug": "maximum-of-minimum-values-in-all-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3027, "totalSubmissionRaw": 6081}, "1951": {"acRate": 68.78531896300612, "difficulty": "Medium", "likes": 94, "dislikes": 7, "categoryTitle": "Database", "frontendQuestionId": "1951", "paidOnly": true, "title": "All the Pairs With the Maximum Number of Common Followers", "titleSlug": "all-the-pairs-with-the-maximum-number-of-common-followers", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11807, "totalSubmissionRaw": 17165}, "1952": {"acRate": 61.07365295781189, "difficulty": "Easy", "likes": 531, "dislikes": 31, "categoryTitle": "Algorithms", "frontendQuestionId": "1952", "paidOnly": false, "title": "Three Divisors", "titleSlug": "three-divisors", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 73642, "totalSubmissionRaw": 120579}, "1953": {"acRate": 40.777666999002996, "difficulty": "Medium", "likes": 646, "dislikes": 146, "categoryTitle": "Algorithms", "frontendQuestionId": "1953", "paidOnly": false, "title": "Maximum Number of Weeks for Which You Can Work", "titleSlug": "maximum-number-of-weeks-for-which-you-can-work", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24131, "totalSubmissionRaw": 59177}, "1954": {"acRate": 54.55941338681374, "difficulty": "Medium", "likes": 382, "dislikes": 92, "categoryTitle": "Algorithms", "frontendQuestionId": "1954", "paidOnly": false, "title": "Minimum Garden Perimeter to Collect Enough Apples", "titleSlug": "minimum-garden-perimeter-to-collect-enough-apples", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17411, "totalSubmissionRaw": 31912}, "1955": {"acRate": 51.332645516292665, "difficulty": "Hard", "likes": 520, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "1955", "paidOnly": false, "title": "Count Number of Special Subsequences", "titleSlug": "count-number-of-special-subsequences", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11941, "totalSubmissionRaw": 23262}, "1956": {"acRate": 47.27361246348588, "difficulty": "Hard", "likes": 31, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "1956", "paidOnly": true, "title": "Minimum Time For K Virus Variants to Spread", "titleSlug": "minimum-time-for-k-virus-variants-to-spread", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 971, "totalSubmissionRaw": 2054}, "1957": {"acRate": 58.48656294200849, "difficulty": "Easy", "likes": 439, "dislikes": 24, "categoryTitle": "Algorithms", "frontendQuestionId": "1957", "paidOnly": false, "title": "Delete Characters to Make Fancy String", "titleSlug": "delete-characters-to-make-fancy-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 38869, "totalSubmissionRaw": 66458}, "1958": {"acRate": 48.60614975134832, "difficulty": "Medium", "likes": 161, "dislikes": 272, "categoryTitle": "Algorithms", "frontendQuestionId": "1958", "paidOnly": false, "title": "Check if Move is Legal", "titleSlug": "check-if-move-is-legal", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13879, "totalSubmissionRaw": 28554}, "1959": {"acRate": 43.10266619626027, "difficulty": "Medium", "likes": 566, "dislikes": 52, "categoryTitle": "Algorithms", "frontendQuestionId": "1959", "paidOnly": false, "title": "Minimum Total Space Wasted With K Resizing Operations", "titleSlug": "minimum-total-space-wasted-with-k-resizing-operations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8552, "totalSubmissionRaw": 19841}, "1960": {"acRate": 30.824492523598696, "difficulty": "Hard", "likes": 244, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "1960", "paidOnly": false, "title": "Maximum Product of the Length of Two Palindromic Substrings", "titleSlug": "maximum-product-of-the-length-of-two-palindromic-substrings", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3690, "totalSubmissionRaw": 11971}, "1961": {"acRate": 52.77422087862362, "difficulty": "Easy", "likes": 485, "dislikes": 91, "categoryTitle": "Algorithms", "frontendQuestionId": "1961", "paidOnly": false, "title": "Check If String Is a Prefix of Array", "titleSlug": "check-if-string-is-a-prefix-of-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 54815, "totalSubmissionRaw": 103867}, "1962": {"acRate": 62.59831579456077, "difficulty": "Medium", "likes": 1814, "dislikes": 155, "categoryTitle": "Algorithms", "frontendQuestionId": "1962", "paidOnly": false, "title": "Remove Stones to Minimize the Total", "titleSlug": "remove-stones-to-minimize-the-total", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 103624, "totalSubmissionRaw": 165538}, "1963": {"acRate": 72.00211545651004, "difficulty": "Medium", "likes": 1805, "dislikes": 76, "categoryTitle": "Algorithms", "frontendQuestionId": "1963", "paidOnly": false, "title": "Minimum Number of Swaps to Make the String Balanced", "titleSlug": "minimum-number-of-swaps-to-make-the-string-balanced", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 78964, "totalSubmissionRaw": 109669}, "1964": {"acRate": 62.90512354262488, "difficulty": "Hard", "likes": 1793, "dislikes": 72, "categoryTitle": "Algorithms", "frontendQuestionId": "1964", "paidOnly": false, "title": "Find the Longest Valid Obstacle Course at Each Position", "titleSlug": "find-the-longest-valid-obstacle-course-at-each-position", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 58810, "totalSubmissionRaw": 93490}, "1965": {"acRate": 72.37614584406221, "difficulty": "Easy", "likes": 699, "dislikes": 36, "categoryTitle": "Database", "frontendQuestionId": "1965", "paidOnly": false, "title": "Employees With Missing Information", "titleSlug": "employees-with-missing-information", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 126484, "totalSubmissionRaw": 174760}, "1966": {"acRate": 64.08915169433705, "difficulty": "Medium", "likes": 72, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "1966", "paidOnly": true, "title": "Binary Searchable Numbers in an Unsorted Array", "titleSlug": "binary-searchable-numbers-in-an-unsorted-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2818, "totalSubmissionRaw": 4397}, "1967": {"acRate": 81.09576984432587, "difficulty": "Easy", "likes": 695, "dislikes": 35, "categoryTitle": "Algorithms", "frontendQuestionId": "1967", "paidOnly": false, "title": "Number of Strings That Appear as Substrings in Word", "titleSlug": "number-of-strings-that-appear-as-substrings-in-word", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 73712, "totalSubmissionRaw": 90895}, "1968": {"acRate": 50.31415759467718, "difficulty": "Medium", "likes": 620, "dislikes": 49, "categoryTitle": "Algorithms", "frontendQuestionId": "1968", "paidOnly": false, "title": "Array With Elements Not Equal to Average of Neighbors", "titleSlug": "array-with-elements-not-equal-to-average-of-neighbors", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 38037, "totalSubmissionRaw": 75599}, "1969": {"acRate": 35.67530078702168, "difficulty": "Medium", "likes": 242, "dislikes": 367, "categoryTitle": "Algorithms", "frontendQuestionId": "1969", "paidOnly": false, "title": "Minimum Non-Zero Product of the Array Elements", "titleSlug": "minimum-non-zero-product-of-the-array-elements", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11831, "totalSubmissionRaw": 33163}, "1970": {"acRate": 61.95935777929347, "difficulty": "Hard", "likes": 1897, "dislikes": 35, "categoryTitle": "Algorithms", "frontendQuestionId": "1970", "paidOnly": false, "title": "Last Day Where You Can Still Cross", "titleSlug": "last-day-where-you-can-still-cross", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 57230, "totalSubmissionRaw": 92367}, "1971": {"acRate": 54.02597677844147, "difficulty": "Easy", "likes": 3881, "dislikes": 224, "categoryTitle": "Algorithms", "frontendQuestionId": "1971", "paidOnly": false, "title": "Find if Path Exists in Graph", "titleSlug": "find-if-path-exists-in-graph", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 458841, "totalSubmissionRaw": 849297}, "1972": {"acRate": 50.40240926320162, "difficulty": "Hard", "likes": 133, "dislikes": 42, "categoryTitle": "Database", "frontendQuestionId": "1972", "paidOnly": true, "title": "First and Last Call On the Same Day", "titleSlug": "first-and-last-call-on-the-same-day", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 9707, "totalSubmissionRaw": 19259}, "1973": {"acRate": 77.00278995615784, "difficulty": "Medium", "likes": 175, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "1973", "paidOnly": true, "title": "Count Nodes Equal to Sum of Descendants", "titleSlug": "count-nodes-equal-to-sum-of-descendants", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 13524, "totalSubmissionRaw": 17563}, "1974": {"acRate": 75.55585097543953, "difficulty": "Easy", "likes": 692, "dislikes": 29, "categoryTitle": "Algorithms", "frontendQuestionId": "1974", "paidOnly": false, "title": "Minimum Time to Type Word Using Special Typewriter", "titleSlug": "minimum-time-to-type-word-using-special-typewriter", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 45468, "totalSubmissionRaw": 60178}, "1975": {"acRate": 49.803046218487395, "difficulty": "Medium", "likes": 554, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "1975", "paidOnly": false, "title": "Maximum Matrix Sum", "titleSlug": "maximum-matrix-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18965, "totalSubmissionRaw": 38080}, "1976": {"acRate": 27.565069029088786, "difficulty": "Medium", "likes": 2794, "dislikes": 131, "categoryTitle": "Algorithms", "frontendQuestionId": "1976", "paidOnly": false, "title": "Number of Ways to Arrive at Destination", "titleSlug": "number-of-ways-to-arrive-at-destination", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 72217, "totalSubmissionRaw": 261990}, "1977": {"acRate": 20.897633744855966, "difficulty": "Hard", "likes": 515, "dislikes": 56, "categoryTitle": "Algorithms", "frontendQuestionId": "1977", "paidOnly": false, "title": "Number of Ways to Separate Numbers", "titleSlug": "number-of-ways-to-separate-numbers", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Suffix Array", "id": "VG9waWNUYWdOb2RlOjU2Njk4", "slug": "suffix-array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6500, "totalSubmissionRaw": 31104}, "1978": {"acRate": 48.429239069633155, "difficulty": "Easy", "likes": 365, "dislikes": 34, "categoryTitle": "Database", "frontendQuestionId": "1978", "paidOnly": false, "title": "Employees Whose Manager Left the Company", "titleSlug": "employees-whose-manager-left-the-company", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 134195, "totalSubmissionRaw": 277096}, "1979": {"acRate": 78.00845558657257, "difficulty": "Easy", "likes": 1125, "dislikes": 48, "categoryTitle": "Algorithms", "frontendQuestionId": "1979", "paidOnly": false, "title": "Find Greatest Common Divisor of Array", "titleSlug": "find-greatest-common-divisor-of-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 144474, "totalSubmissionRaw": 185203}, "1980": {"acRate": 74.68823939856567, "difficulty": "Medium", "likes": 1989, "dislikes": 74, "categoryTitle": "Algorithms", "frontendQuestionId": "1980", "paidOnly": false, "title": "Find Unique Binary String", "titleSlug": "find-unique-binary-string", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 142363, "totalSubmissionRaw": 190610}, "1981": {"acRate": 35.04829726576127, "difficulty": "Medium", "likes": 943, "dislikes": 142, "categoryTitle": "Algorithms", "frontendQuestionId": "1981", "paidOnly": false, "title": "Minimize the Difference Between Target and Chosen Elements", "titleSlug": "minimize-the-difference-between-target-and-chosen-elements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29136, "totalSubmissionRaw": 83131}, "1982": {"acRate": 48.890602244495845, "difficulty": "Hard", "likes": 584, "dislikes": 40, "categoryTitle": "Algorithms", "frontendQuestionId": "1982", "paidOnly": false, "title": "Find Array Given Subset Sums", "titleSlug": "find-array-given-subset-sums", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5707, "totalSubmissionRaw": 11673}, "1983": {"acRate": 53.38700176713136, "difficulty": "Medium", "likes": 94, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "1983", "paidOnly": true, "title": "Widest Pair of Indices With Equal Range Sum", "titleSlug": "widest-pair-of-indices-with-equal-range-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2719, "totalSubmissionRaw": 5093}, "1984": {"acRate": 57.1610772969794, "difficulty": "Easy", "likes": 998, "dislikes": 283, "categoryTitle": "Algorithms", "frontendQuestionId": "1984", "paidOnly": false, "title": "Minimum Difference Between Highest and Lowest of K Scores", "titleSlug": "minimum-difference-between-highest-and-lowest-of-k-scores", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 80672, "totalSubmissionRaw": 141131}, "1985": {"acRate": 45.70878683302362, "difficulty": "Medium", "likes": 1247, "dislikes": 145, "categoryTitle": "Algorithms", "frontendQuestionId": "1985", "paidOnly": false, "title": "Find the Kth Largest Integer in the Array", "titleSlug": "find-the-kth-largest-integer-in-the-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Quickselect", "id": "VG9waWNUYWdOb2RlOjYxMDY5", "slug": "quickselect"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 68874, "totalSubmissionRaw": 150680}, "1986": {"acRate": 33.24591137392681, "difficulty": "Medium", "likes": 1116, "dislikes": 67, "categoryTitle": "Algorithms", "frontendQuestionId": "1986", "paidOnly": false, "title": "Minimum Number of Work Sessions to Finish the Tasks", "titleSlug": "minimum-number-of-work-sessions-to-finish-the-tasks", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26874, "totalSubmissionRaw": 80834}, "1987": {"acRate": 52.31731933790876, "difficulty": "Hard", "likes": 698, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "1987", "paidOnly": false, "title": "Number of Unique Good Subsequences", "titleSlug": "number-of-unique-good-subsequences", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12959, "totalSubmissionRaw": 24770}, "1988": {"acRate": 67.00105596620908, "difficulty": "Medium", "likes": 77, "dislikes": 155, "categoryTitle": "Database", "frontendQuestionId": "1988", "paidOnly": true, "title": "Find Cutoff Score for Each School", "titleSlug": "find-cutoff-score-for-each-school", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 11421, "totalSubmissionRaw": 17046}, "1989": {"acRate": 51.33991537376586, "difficulty": "Medium", "likes": 71, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "1989", "paidOnly": true, "title": "Maximum Number of People That Can Be Caught in Tag", "titleSlug": "maximum-number-of-people-that-can-be-caught-in-tag", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2184, "totalSubmissionRaw": 4254}, "1990": {"acRate": 49.15220159506736, "difficulty": "Medium", "likes": 24, "dislikes": 191, "categoryTitle": "Database", "frontendQuestionId": "1990", "paidOnly": true, "title": "Count the Number of Experiments", "titleSlug": "count-the-number-of-experiments", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7334, "totalSubmissionRaw": 14921}, "1991": {"acRate": 67.57568092867223, "difficulty": "Easy", "likes": 1372, "dislikes": 64, "categoryTitle": "Algorithms", "frontendQuestionId": "1991", "paidOnly": false, "title": "Find the Middle Index in Array", "titleSlug": "find-the-middle-index-in-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 101523, "totalSubmissionRaw": 150236}, "1992": {"acRate": 75.7748647108249, "difficulty": "Medium", "likes": 1375, "dislikes": 88, "categoryTitle": "Algorithms", "frontendQuestionId": "1992", "paidOnly": false, "title": "Find All Groups of Farmland", "titleSlug": "find-all-groups-of-farmland", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 128962, "totalSubmissionRaw": 170191}, "1993": {"acRate": 46.03205251979146, "difficulty": "Medium", "likes": 462, "dislikes": 78, "categoryTitle": "Algorithms", "frontendQuestionId": "1993", "paidOnly": false, "title": "Operations on Tree", "titleSlug": "operations-on-tree", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16688, "totalSubmissionRaw": 36253}, "1994": {"acRate": 34.8526863084922, "difficulty": "Hard", "likes": 472, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "1994", "paidOnly": false, "title": "The Number of Good Subsets", "titleSlug": "the-number-of-good-subsets", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8044, "totalSubmissionRaw": 23080}, "1995": {"acRate": 61.64967695620962, "difficulty": "Easy", "likes": 636, "dislikes": 232, "categoryTitle": "Algorithms", "frontendQuestionId": "1995", "paidOnly": false, "title": "Count Special Quadruplets", "titleSlug": "count-special-quadruplets", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 42939, "totalSubmissionRaw": 69650}, "1996": {"acRate": 44.00884810886364, "difficulty": "Medium", "likes": 3014, "dislikes": 93, "categoryTitle": "Algorithms", "frontendQuestionId": "1996", "paidOnly": false, "title": "The Number of Weak Characters in the Game", "titleSlug": "the-number-of-weak-characters-in-the-game", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 104848, "totalSubmissionRaw": 238243}, "1997": {"acRate": 37.65514532600157, "difficulty": "Medium", "likes": 489, "dislikes": 97, "categoryTitle": "Algorithms", "frontendQuestionId": "1997", "paidOnly": false, "title": "First Day Where You Have Been in All the Rooms", "titleSlug": "first-day-where-you-have-been-in-all-the-rooms", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9587, "totalSubmissionRaw": 25460}, "1998": {"acRate": 46.13670493629802, "difficulty": "Hard", "likes": 496, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "1998", "paidOnly": false, "title": "GCD Sort of an Array", "titleSlug": "gcd-sort-of-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9524, "totalSubmissionRaw": 20643}, "1999": {"acRate": 49.14127423822715, "difficulty": "Medium", "likes": 28, "dislikes": 10, "categoryTitle": "Algorithms", "frontendQuestionId": "1999", "paidOnly": true, "title": "Smallest Greater Multiple Made of Two Digits", "titleSlug": "smallest-greater-multiple-made-of-two-digits", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1774, "totalSubmissionRaw": 3610}, "2000": {"acRate": 86.28701883442197, "difficulty": "Easy", "likes": 1329, "dislikes": 37, "categoryTitle": "Algorithms", "frontendQuestionId": "2000", "paidOnly": false, "title": "Reverse Prefix of Word", "titleSlug": "reverse-prefix-of-word", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 272132, "totalSubmissionRaw": 315380}, "2001": {"acRate": 50.0622559626706, "difficulty": "Medium", "likes": 528, "dislikes": 49, "categoryTitle": "Algorithms", "frontendQuestionId": "2001", "paidOnly": false, "title": "Number of Pairs of Interchangeable Rectangles", "titleSlug": "number-of-pairs-of-interchangeable-rectangles", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 41413, "totalSubmissionRaw": 82723}, "2002": {"acRate": 60.240915639506966, "difficulty": "Medium", "likes": 941, "dislikes": 74, "categoryTitle": "Algorithms", "frontendQuestionId": "2002", "paidOnly": false, "title": "Maximum Product of the Length of Two Palindromic Subsequences", "titleSlug": "maximum-product-of-the-length-of-two-palindromic-subsequences", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30106, "totalSubmissionRaw": 49976}, "2003": {"acRate": 46.76944868162998, "difficulty": "Hard", "likes": 450, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "2003", "paidOnly": false, "title": "Smallest Missing Genetic Value in Each Subtree", "titleSlug": "smallest-missing-genetic-value-in-each-subtree", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8585, "totalSubmissionRaw": 18356}, "2004": {"acRate": 43.48043881180183, "difficulty": "Hard", "likes": 117, "dislikes": 14, "categoryTitle": "Database", "frontendQuestionId": "2004", "paidOnly": true, "title": "The Number of Seniors and Juniors to Join the Company", "titleSlug": "the-number-of-seniors-and-juniors-to-join-the-company", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 8680, "totalSubmissionRaw": 19963}, "2005": {"acRate": 59.202175883952854, "difficulty": "Hard", "likes": 16, "dislikes": 45, "categoryTitle": "Algorithms", "frontendQuestionId": "2005", "paidOnly": true, "title": "Subtree Removal Game with Fibonacci Tree", "titleSlug": "subtree-removal-game-with-fibonacci-tree", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 653, "totalSubmissionRaw": 1103}, "2006": {"acRate": 84.10696689519257, "difficulty": "Easy", "likes": 1632, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "2006", "paidOnly": false, "title": "Count Number of Pairs With Absolute Difference K", "titleSlug": "count-number-of-pairs-with-absolute-difference-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 160466, "totalSubmissionRaw": 190788}, "2007": {"acRate": 40.502089068248836, "difficulty": "Medium", "likes": 2444, "dislikes": 116, "categoryTitle": "Algorithms", "frontendQuestionId": "2007", "paidOnly": false, "title": "Find Original Array From Doubled Array", "titleSlug": "find-original-array-from-doubled-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 136391, "totalSubmissionRaw": 336749}, "2008": {"acRate": 44.26896977174584, "difficulty": "Medium", "likes": 1275, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "2008", "paidOnly": false, "title": "Maximum Earnings From Taxi", "titleSlug": "maximum-earnings-from-taxi", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 32292, "totalSubmissionRaw": 72945}, "2009": {"acRate": 52.64207726763718, "difficulty": "Hard", "likes": 1875, "dislikes": 50, "categoryTitle": "Algorithms", "frontendQuestionId": "2009", "paidOnly": false, "title": "Minimum Number of Operations to Make Array Continuous", "titleSlug": "minimum-number-of-operations-to-make-array-continuous", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 75215, "totalSubmissionRaw": 142880}, "2010": {"acRate": 62.43870545930042, "difficulty": "Hard", "likes": 38, "dislikes": 10, "categoryTitle": "Database", "frontendQuestionId": "2010", "paidOnly": true, "title": "The Number of Seniors and Juniors to Join the Company II", "titleSlug": "the-number-of-seniors-and-juniors-to-join-the-company-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5730, "totalSubmissionRaw": 9177}, "2011": {"acRate": 89.32851963495636, "difficulty": "Easy", "likes": 1610, "dislikes": 186, "categoryTitle": "Algorithms", "frontendQuestionId": "2011", "paidOnly": false, "title": "Final Value of Variable After Performing Operations", "titleSlug": "final-value-of-variable-after-performing-operations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 409240, "totalSubmissionRaw": 458130}, "2012": {"acRate": 48.32148737099948, "difficulty": "Medium", "likes": 605, "dislikes": 64, "categoryTitle": "Algorithms", "frontendQuestionId": "2012", "paidOnly": false, "title": "Sum of Beauty in the Array", "titleSlug": "sum-of-beauty-in-the-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24067, "totalSubmissionRaw": 49806}, "2013": {"acRate": 51.21463092678149, "difficulty": "Medium", "likes": 886, "dislikes": 232, "categoryTitle": "Algorithms", "frontendQuestionId": "2013", "paidOnly": false, "title": "Detect Squares", "titleSlug": "detect-squares", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 72165, "totalSubmissionRaw": 140907}, "2014": {"acRate": 55.73377703826955, "difficulty": "Hard", "likes": 460, "dislikes": 80, "categoryTitle": "Algorithms", "frontendQuestionId": "2014", "paidOnly": false, "title": "Longest Subsequence Repeated k Times", "titleSlug": "longest-subsequence-repeated-k-times", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8374, "totalSubmissionRaw": 15025}, "2015": {"acRate": 59.30038867295947, "difficulty": "Medium", "likes": 54, "dislikes": 28, "categoryTitle": "Algorithms", "frontendQuestionId": "2015", "paidOnly": true, "title": "Average Height of Buildings in Each Segment", "titleSlug": "average-height-of-buildings-in-each-segment", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2136, "totalSubmissionRaw": 3602}, "2016": {"acRate": 56.58720362914952, "difficulty": "Easy", "likes": 1010, "dislikes": 31, "categoryTitle": "Algorithms", "frontendQuestionId": "2016", "paidOnly": false, "title": "Maximum Difference Between Increasing Elements", "titleSlug": "maximum-difference-between-increasing-elements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 87567, "totalSubmissionRaw": 154747}, "2017": {"acRate": 46.100825664714655, "difficulty": "Medium", "likes": 915, "dislikes": 40, "categoryTitle": "Algorithms", "frontendQuestionId": "2017", "paidOnly": false, "title": "Grid Game", "titleSlug": "grid-game", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25349, "totalSubmissionRaw": 54986}, "2018": {"acRate": 49.70402029575115, "difficulty": "Medium", "likes": 292, "dislikes": 294, "categoryTitle": "Algorithms", "frontendQuestionId": "2018", "paidOnly": false, "title": "Check if Word Can Be Placed In Crossword", "titleSlug": "check-if-word-can-be-placed-in-crossword", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21747, "totalSubmissionRaw": 43753}, "2019": {"acRate": 33.724096552360734, "difficulty": "Hard", "likes": 270, "dislikes": 81, "categoryTitle": "Algorithms", "frontendQuestionId": "2019", "paidOnly": false, "title": "The Score of Students Solving Math Expression", "titleSlug": "the-score-of-students-solving-math-expression", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7307, "totalSubmissionRaw": 21667}, "2020": {"acRate": 71.9402181230645, "difficulty": "Medium", "likes": 27, "dislikes": 213, "categoryTitle": "Database", "frontendQuestionId": "2020", "paidOnly": true, "title": "Number of Accounts That Did Not Stream", "titleSlug": "number-of-accounts-that-did-not-stream", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10682, "totalSubmissionRaw": 14850}, "2021": {"acRate": 61.554026709834076, "difficulty": "Medium", "likes": 151, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "2021", "paidOnly": true, "title": "Brightest Position on Street", "titleSlug": "brightest-position-on-street", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6084, "totalSubmissionRaw": 9884}, "2022": {"acRate": 62.001202560747004, "difficulty": "Easy", "likes": 783, "dislikes": 56, "categoryTitle": "Algorithms", "frontendQuestionId": "2022", "paidOnly": false, "title": "Convert 1D Array Into 2D Array", "titleSlug": "convert-1d-array-into-2d-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 87648, "totalSubmissionRaw": 141365}, "2023": {"acRate": 74.96856136820925, "difficulty": "Medium", "likes": 702, "dislikes": 53, "categoryTitle": "Algorithms", "frontendQuestionId": "2023", "paidOnly": false, "title": "Number of Pairs of Strings With Concatenation Equal to Target", "titleSlug": "number-of-pairs-of-strings-with-concatenation-equal-to-target", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 47692, "totalSubmissionRaw": 63616}, "2024": {"acRate": 67.38895107819862, "difficulty": "Medium", "likes": 2876, "dislikes": 45, "categoryTitle": "Algorithms", "frontendQuestionId": "2024", "paidOnly": false, "title": "Maximize the Confusion of an Exam", "titleSlug": "maximize-the-confusion-of-an-exam", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 109565, "totalSubmissionRaw": 162586}, "2025": {"acRate": 34.36600139013007, "difficulty": "Hard", "likes": 476, "dislikes": 53, "categoryTitle": "Algorithms", "frontendQuestionId": "2025", "paidOnly": false, "title": "Maximum Number of Ways to Partition an Array", "titleSlug": "maximum-number-of-ways-to-partition-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10383, "totalSubmissionRaw": 30211}, "2026": {"acRate": 84.26829268292683, "difficulty": "Easy", "likes": 52, "dislikes": 11, "categoryTitle": "Database", "frontendQuestionId": "2026", "paidOnly": true, "title": "Low-Quality Problems", "titleSlug": "low-quality-problems", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12438, "totalSubmissionRaw": 14760}, "2027": {"acRate": 55.26832871138115, "difficulty": "Easy", "likes": 479, "dislikes": 71, "categoryTitle": "Algorithms", "frontendQuestionId": "2027", "paidOnly": false, "title": "Minimum Moves to Convert String", "titleSlug": "minimum-moves-to-convert-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 39660, "totalSubmissionRaw": 71759}, "2028": {"acRate": 46.83697945264861, "difficulty": "Medium", "likes": 487, "dislikes": 43, "categoryTitle": "Algorithms", "frontendQuestionId": "2028", "paidOnly": false, "title": "Find Missing Observations", "titleSlug": "find-missing-observations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 32414, "totalSubmissionRaw": 69206}, "2029": {"acRate": 28.490761468809517, "difficulty": "Medium", "likes": 236, "dislikes": 273, "categoryTitle": "Algorithms", "frontendQuestionId": "2029", "paidOnly": false, "title": "Stone Game IX", "titleSlug": "stone-game-ix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8527, "totalSubmissionRaw": 29929}, "2030": {"acRate": 39.32328815977175, "difficulty": "Hard", "likes": 483, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "2030", "paidOnly": false, "title": "Smallest K-Length Subsequence With Occurrences of a Letter", "titleSlug": "smallest-k-length-subsequence-with-occurrences-of-a-letter", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8821, "totalSubmissionRaw": 22432}, "2031": {"acRate": 51.9496855345912, "difficulty": "Medium", "likes": 172, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2031", "paidOnly": true, "title": "Count Subarrays With More Ones Than Zeros", "titleSlug": "count-subarrays-with-more-ones-than-zeros", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Merge Sort", "id": "VG9waWNUYWdOb2RlOjYxMDUx", "slug": "merge-sort"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4130, "totalSubmissionRaw": 7950}, "2032": {"acRate": 75.46718026130863, "difficulty": "Easy", "likes": 755, "dislikes": 51, "categoryTitle": "Algorithms", "frontendQuestionId": "2032", "paidOnly": false, "title": "Two Out of Three", "titleSlug": "two-out-of-three", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 72489, "totalSubmissionRaw": 96054}, "2033": {"acRate": 53.41806627326373, "difficulty": "Medium", "likes": 549, "dislikes": 40, "categoryTitle": "Algorithms", "frontendQuestionId": "2033", "paidOnly": false, "title": "Minimum Operations to Make a Uni-Value Grid", "titleSlug": "minimum-operations-to-make-a-uni-value-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23536, "totalSubmissionRaw": 44060}, "2034": {"acRate": 48.64353267740728, "difficulty": "Medium", "likes": 1163, "dislikes": 64, "categoryTitle": "Algorithms", "frontendQuestionId": "2034", "paidOnly": false, "title": "Stock Price Fluctuation ", "titleSlug": "stock-price-fluctuation", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Data Stream", "id": "VG9waWNUYWdOb2RlOjYxMDYz", "slug": "data-stream"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 68870, "totalSubmissionRaw": 141581}, "2035": {"acRate": 20.539736506587335, "difficulty": "Hard", "likes": 3070, "dislikes": 198, "categoryTitle": "Algorithms", "frontendQuestionId": "2035", "paidOnly": false, "title": "Partition Array Into Two Arrays to Minimize Sum Difference", "titleSlug": "partition-array-into-two-arrays-to-minimize-sum-difference", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28998, "totalSubmissionRaw": 141180}, "2036": {"acRate": 40.08566389518771, "difficulty": "Medium", "likes": 98, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "2036", "paidOnly": true, "title": "Maximum Alternating Subarray Sum", "titleSlug": "maximum-alternating-subarray-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3182, "totalSubmissionRaw": 7938}, "2037": {"acRate": 87.62589981751758, "difficulty": "Easy", "likes": 1326, "dislikes": 318, "categoryTitle": "Algorithms", "frontendQuestionId": "2037", "paidOnly": false, "title": "Minimum Number of Moves to Seat Everyone", "titleSlug": "minimum-number-of-moves-to-seat-everyone", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 234812, "totalSubmissionRaw": 267971}, "2038": {"acRate": 62.79833207963929, "difficulty": "Medium", "likes": 1571, "dislikes": 124, "categoryTitle": "Algorithms", "frontendQuestionId": "2038", "paidOnly": false, "title": "Remove Colored Pieces if Both Neighbors are the Same Color", "titleSlug": "remove-colored-pieces-if-both-neighbors-are-the-same-color", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 144428, "totalSubmissionRaw": 229987}, "2039": {"acRate": 52.30041516368339, "difficulty": "Medium", "likes": 666, "dislikes": 61, "categoryTitle": "Algorithms", "frontendQuestionId": "2039", "paidOnly": false, "title": "The Time When the Network Becomes Idle", "titleSlug": "the-time-when-the-network-becomes-idle", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15369, "totalSubmissionRaw": 29386}, "2040": {"acRate": 29.017748601993677, "difficulty": "Hard", "likes": 686, "dislikes": 37, "categoryTitle": "Algorithms", "frontendQuestionId": "2040", "paidOnly": false, "title": "Kth Smallest Product of Two Sorted Arrays", "titleSlug": "kth-smallest-product-of-two-sorted-arrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11935, "totalSubmissionRaw": 41130}, "2041": {"acRate": 78.17784256559767, "difficulty": "Medium", "likes": 53, "dislikes": 28, "categoryTitle": "Database", "frontendQuestionId": "2041", "paidOnly": true, "title": "Accepted Candidates From the Interviews", "titleSlug": "accepted-candidates-from-the-interviews", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 10726, "totalSubmissionRaw": 13720}, "2042": {"acRate": 70.00665091851478, "difficulty": "Easy", "likes": 614, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "2042", "paidOnly": false, "title": "Check if Numbers Are Ascending in a Sentence", "titleSlug": "check-if-numbers-are-ascending-in-a-sentence", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 61050, "totalSubmissionRaw": 87206}, "2043": {"acRate": 63.8616285258116, "difficulty": "Medium", "likes": 260, "dislikes": 217, "categoryTitle": "Algorithms", "frontendQuestionId": "2043", "paidOnly": false, "title": "Simple Bank System", "titleSlug": "simple-bank-system", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29997, "totalSubmissionRaw": 46973}, "2044": {"acRate": 77.88257486441877, "difficulty": "Medium", "likes": 623, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "2044", "paidOnly": false, "title": "Count Number of Maximum Bitwise-OR Subsets", "titleSlug": "count-number-of-maximum-bitwise-or-subsets", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29726, "totalSubmissionRaw": 38168}, "2045": {"acRate": 63.18919874282465, "difficulty": "Hard", "likes": 1197, "dislikes": 64, "categoryTitle": "Algorithms", "frontendQuestionId": "2045", "paidOnly": false, "title": "Second Minimum Time to Reach Destination", "titleSlug": "second-minimum-time-to-reach-destination", "topicTags": [{"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 82230, "totalSubmissionRaw": 130133}, "2046": {"acRate": 67.10414575773952, "difficulty": "Medium", "likes": 166, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "2046", "paidOnly": true, "title": "Sort Linked List Already Sorted Using Absolute Values", "titleSlug": "sort-linked-list-already-sorted-using-absolute-values", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8692, "totalSubmissionRaw": 12953}, "2047": {"acRate": 29.180864632312346, "difficulty": "Easy", "likes": 299, "dislikes": 803, "categoryTitle": "Algorithms", "frontendQuestionId": "2047", "paidOnly": false, "title": "Number of Valid Words in a Sentence", "titleSlug": "number-of-valid-words-in-a-sentence", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30658, "totalSubmissionRaw": 105062}, "2048": {"acRate": 48.70195490817856, "difficulty": "Medium", "likes": 198, "dislikes": 279, "categoryTitle": "Algorithms", "frontendQuestionId": "2048", "paidOnly": false, "title": "Next Greater Numerically Balanced Number", "titleSlug": "next-greater-numerically-balanced-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13976, "totalSubmissionRaw": 28697}, "2049": {"acRate": 49.98840383208749, "difficulty": "Medium", "likes": 1072, "dislikes": 82, "categoryTitle": "Algorithms", "frontendQuestionId": "2049", "paidOnly": false, "title": "Count Nodes With the Highest Score", "titleSlug": "count-nodes-with-the-highest-score", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28019, "totalSubmissionRaw": 56052}, "2050": {"acRate": 67.14002314432138, "difficulty": "Hard", "likes": 1526, "dislikes": 39, "categoryTitle": "Algorithms", "frontendQuestionId": "2050", "paidOnly": false, "title": "Parallel Courses III", "titleSlug": "parallel-courses-iii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 81226, "totalSubmissionRaw": 120980}, "2051": {"acRate": 69.92911435647792, "difficulty": "Medium", "likes": 57, "dislikes": 8, "categoryTitle": "Database", "frontendQuestionId": "2051", "paidOnly": true, "title": "The Category of Each Member in the Store", "titleSlug": "the-category-of-each-member-in-the-store", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8188, "totalSubmissionRaw": 11709}, "2052": {"acRate": 49.406802003691006, "difficulty": "Medium", "likes": 43, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "2052", "paidOnly": true, "title": "Minimum Cost to Separate Sentence Into Rows", "titleSlug": "minimum-cost-to-separate-sentence-into-rows", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1874, "totalSubmissionRaw": 3793}, "2053": {"acRate": 82.1227122657785, "difficulty": "Easy", "likes": 1231, "dislikes": 48, "categoryTitle": "Algorithms", "frontendQuestionId": "2053", "paidOnly": false, "title": "Kth Distinct String in an Array", "titleSlug": "kth-distinct-string-in-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 226104, "totalSubmissionRaw": 275325}, "2054": {"acRate": 46.69634822147492, "difficulty": "Medium", "likes": 834, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "2054", "paidOnly": false, "title": "Two Best Non-Overlapping Events", "titleSlug": "two-best-non-overlapping-events", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19718, "totalSubmissionRaw": 42226}, "2055": {"acRate": 45.14636289613918, "difficulty": "Medium", "likes": 1217, "dislikes": 63, "categoryTitle": "Algorithms", "frontendQuestionId": "2055", "paidOnly": false, "title": "Plates Between Candles", "titleSlug": "plates-between-candles", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 56000, "totalSubmissionRaw": 124041}, "2056": {"acRate": 52.6491705867789, "difficulty": "Hard", "likes": 59, "dislikes": 290, "categoryTitle": "Algorithms", "frontendQuestionId": "2056", "paidOnly": false, "title": "Number of Valid Move Combinations On Chessboard", "titleSlug": "number-of-valid-move-combinations-on-chessboard", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4253, "totalSubmissionRaw": 8078}, "2057": {"acRate": 73.11091912009037, "difficulty": "Easy", "likes": 422, "dislikes": 138, "categoryTitle": "Algorithms", "frontendQuestionId": "2057", "paidOnly": false, "title": "Smallest Index With Equal Value", "titleSlug": "smallest-index-with-equal-value", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 66006, "totalSubmissionRaw": 90282}, "2058": {"acRate": 69.67722357976778, "difficulty": "Medium", "likes": 1245, "dislikes": 66, "categoryTitle": "Algorithms", "frontendQuestionId": "2058", "paidOnly": false, "title": "Find the Minimum and Maximum Number of Nodes Between Critical Points", "titleSlug": "find-the-minimum-and-maximum-number-of-nodes-between-critical-points", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 174508, "totalSubmissionRaw": 250452}, "2059": {"acRate": 49.54125801719923, "difficulty": "Medium", "likes": 640, "dislikes": 33, "categoryTitle": "Algorithms", "frontendQuestionId": "2059", "paidOnly": false, "title": "Minimum Operations to Convert Number", "titleSlug": "minimum-operations-to-convert-number", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17225, "totalSubmissionRaw": 34769}, "2060": {"acRate": 43.841840178617794, "difficulty": "Hard", "likes": 311, "dislikes": 153, "categoryTitle": "Algorithms", "frontendQuestionId": "2060", "paidOnly": false, "title": "Check if an Original String Exists Given Two Encoded Strings", "titleSlug": "check-if-an-original-string-exists-given-two-encoded-strings", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16887, "totalSubmissionRaw": 38518}, "2061": {"acRate": 62.5355315520182, "difficulty": "Medium", "likes": 120, "dislikes": 26, "categoryTitle": "Algorithms", "frontendQuestionId": "2061", "paidOnly": true, "title": "Number of Spaces Cleaning Robot Cleaned", "titleSlug": "number-of-spaces-cleaning-robot-cleaned", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 8800, "totalSubmissionRaw": 14072}, "2062": {"acRate": 68.10152934582433, "difficulty": "Easy", "likes": 947, "dislikes": 242, "categoryTitle": "Algorithms", "frontendQuestionId": "2062", "paidOnly": false, "title": "Count Vowel Substrings of a String", "titleSlug": "count-vowel-substrings-of-a-string", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 42526, "totalSubmissionRaw": 62445}, "2063": {"acRate": 54.00586049170955, "difficulty": "Medium", "likes": 833, "dislikes": 28, "categoryTitle": "Algorithms", "frontendQuestionId": "2063", "paidOnly": false, "title": "Vowels of All Substrings", "titleSlug": "vowels-of-all-substrings", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30226, "totalSubmissionRaw": 55968}, "2064": {"acRate": 53.395021074815595, "difficulty": "Medium", "likes": 1067, "dislikes": 43, "categoryTitle": "Algorithms", "frontendQuestionId": "2064", "paidOnly": false, "title": "Minimized Maximum of Products Distributed to Any Store", "titleSlug": "minimized-maximum-of-products-distributed-to-any-store", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 32430, "totalSubmissionRaw": 60736}, "2065": {"acRate": 58.820763342825046, "difficulty": "Hard", "likes": 643, "dislikes": 47, "categoryTitle": "Algorithms", "frontendQuestionId": "2065", "paidOnly": false, "title": "Maximum Path Quality of a Graph", "titleSlug": "maximum-path-quality-of-a-graph", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22516, "totalSubmissionRaw": 38279}, "2066": {"acRate": 82.0359784801614, "difficulty": "Medium", "likes": 70, "dislikes": 2, "categoryTitle": "Database", "frontendQuestionId": "2066", "paidOnly": true, "title": "Account Balance", "titleSlug": "account-balance", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9759, "totalSubmissionRaw": 11896}, "2067": {"acRate": 46.90542420027816, "difficulty": "Medium", "likes": 103, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "2067", "paidOnly": true, "title": "Number of Equal Count Substrings", "titleSlug": "number-of-equal-count-substrings", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2698, "totalSubmissionRaw": 5752}, "2068": {"acRate": 63.8695842549035, "difficulty": "Easy", "likes": 526, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "2068", "paidOnly": false, "title": "Check Whether Two Strings are Almost Equivalent", "titleSlug": "check-whether-two-strings-are-almost-equivalent", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 56887, "totalSubmissionRaw": 89068}, "2069": {"acRate": 26.30868024800709, "difficulty": "Medium", "likes": 166, "dislikes": 307, "categoryTitle": "Algorithms", "frontendQuestionId": "2069", "paidOnly": false, "title": "Walking Robot Simulation II", "titleSlug": "walking-robot-simulation-ii", "topicTags": [{"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11881, "totalSubmissionRaw": 45160}, "2070": {"acRate": 49.81268093318953, "difficulty": "Medium", "likes": 588, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "2070", "paidOnly": false, "title": "Most Beautiful Item for Each Query", "titleSlug": "most-beautiful-item-for-each-query", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17551, "totalSubmissionRaw": 35234}, "2071": {"acRate": 33.6595050698433, "difficulty": "Hard", "likes": 536, "dislikes": 23, "categoryTitle": "Algorithms", "frontendQuestionId": "2071", "paidOnly": false, "title": "Maximum Number of Tasks You Can Assign", "titleSlug": "maximum-number-of-tasks-you-can-assign", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Monotonic Queue", "id": "VG9waWNUYWdOb2RlOjYxMDcx", "slug": "monotonic-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9494, "totalSubmissionRaw": 28206}, "2072": {"acRate": 74.09833938764919, "difficulty": "Easy", "likes": 66, "dislikes": 2, "categoryTitle": "Database", "frontendQuestionId": "2072", "paidOnly": true, "title": "The Winner University", "titleSlug": "the-winner-university", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 11423, "totalSubmissionRaw": 15416}, "2073": {"acRate": 69.9068028492339, "difficulty": "Easy", "likes": 1653, "dislikes": 145, "categoryTitle": "Algorithms", "frontendQuestionId": "2073", "paidOnly": false, "title": "Time Needed to Buy Tickets", "titleSlug": "time-needed-to-buy-tickets", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 218953, "totalSubmissionRaw": 313207}, "2074": {"acRate": 58.34282099936748, "difficulty": "Medium", "likes": 721, "dislikes": 338, "categoryTitle": "Algorithms", "frontendQuestionId": "2074", "paidOnly": false, "title": "Reverse Nodes in Even Length Groups", "titleSlug": "reverse-nodes-in-even-length-groups", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27672, "totalSubmissionRaw": 47430}, "2075": {"acRate": 49.004093708073896, "difficulty": "Medium", "likes": 247, "dislikes": 62, "categoryTitle": "Algorithms", "frontendQuestionId": "2075", "paidOnly": false, "title": "Decode the Slanted Ciphertext", "titleSlug": "decode-the-slanted-ciphertext", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14245, "totalSubmissionRaw": 29069}, "2076": {"acRate": 55.401263526615374, "difficulty": "Hard", "likes": 614, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "2076", "paidOnly": false, "title": "Process Restricted Friend Requests", "titleSlug": "process-restricted-friend-requests", "topicTags": [{"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17714, "totalSubmissionRaw": 31974}, "2077": {"acRate": 55.45137636735185, "difficulty": "Medium", "likes": 129, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "2077", "paidOnly": true, "title": "Paths in Maze That Lead to Same Room", "titleSlug": "paths-in-maze-that-lead-to-same-room", "topicTags": [{"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4613, "totalSubmissionRaw": 8319}, "2078": {"acRate": 66.09941520467835, "difficulty": "Easy", "likes": 900, "dislikes": 27, "categoryTitle": "Algorithms", "frontendQuestionId": "2078", "paidOnly": false, "title": "Two Furthest Houses With Different Colors", "titleSlug": "two-furthest-houses-with-different-colors", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 56515, "totalSubmissionRaw": 85500}, "2079": {"acRate": 79.79576730766325, "difficulty": "Medium", "likes": 907, "dislikes": 68, "categoryTitle": "Algorithms", "frontendQuestionId": "2079", "paidOnly": false, "title": "Watering Plants", "titleSlug": "watering-plants", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 52824, "totalSubmissionRaw": 66199}, "2080": {"acRate": 40.3929690793453, "difficulty": "Medium", "likes": 658, "dislikes": 27, "categoryTitle": "Algorithms", "frontendQuestionId": "2080", "paidOnly": false, "title": "Range Frequency Queries", "titleSlug": "range-frequency-queries", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22038, "totalSubmissionRaw": 54559}, "2081": {"acRate": 42.42808554793336, "difficulty": "Hard", "likes": 124, "dislikes": 150, "categoryTitle": "Algorithms", "frontendQuestionId": "2081", "paidOnly": false, "title": "Sum of k-Mirror Numbers", "titleSlug": "sum-of-k-mirror-numbers", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7360, "totalSubmissionRaw": 17347}, "2082": {"acRate": 77.2477671187562, "difficulty": "Easy", "likes": 96, "dislikes": 25, "categoryTitle": "Database", "frontendQuestionId": "2082", "paidOnly": true, "title": "The Number of Rich Customers", "titleSlug": "the-number-of-rich-customers", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 23352, "totalSubmissionRaw": 30230}, "2083": {"acRate": 74.28953332945895, "difficulty": "Medium", "likes": 133, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "2083", "paidOnly": true, "title": "Substrings That Begin and End With the Same Letter", "titleSlug": "substrings-that-begin-and-end-with-the-same-letter", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 12783, "totalSubmissionRaw": 17207}, "2084": {"acRate": 87.01807710766278, "difficulty": "Medium", "likes": 84, "dislikes": 18, "categoryTitle": "Database", "frontendQuestionId": "2084", "paidOnly": true, "title": "Drop Type 1 Orders for Customers With Type 0 Orders", "titleSlug": "drop-type-1-orders-for-customers-with-type-0-orders", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10879, "totalSubmissionRaw": 12502}, "2085": {"acRate": 71.06261859582543, "difficulty": "Easy", "likes": 809, "dislikes": 18, "categoryTitle": "Algorithms", "frontendQuestionId": "2085", "paidOnly": false, "title": "Count Common Words With One Occurrence", "titleSlug": "count-common-words-with-one-occurrence", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 73401, "totalSubmissionRaw": 103291}, "2086": {"acRate": 46.81686514322498, "difficulty": "Medium", "likes": 537, "dislikes": 30, "categoryTitle": "Algorithms", "frontendQuestionId": "2086", "paidOnly": false, "title": "Minimum Number of Food Buckets to Feed the Hamsters", "titleSlug": "minimum-number-of-food-buckets-to-feed-the-hamsters", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21819, "totalSubmissionRaw": 46605}, "2087": {"acRate": 50.98451538902695, "difficulty": "Medium", "likes": 674, "dislikes": 90, "categoryTitle": "Algorithms", "frontendQuestionId": "2087", "paidOnly": false, "title": "Minimum Cost Homecoming of a Robot in a Grid", "titleSlug": "minimum-cost-homecoming-of-a-robot-in-a-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18669, "totalSubmissionRaw": 36617}, "2088": {"acRate": 65.02392963394128, "difficulty": "Hard", "likes": 369, "dislikes": 18, "categoryTitle": "Algorithms", "frontendQuestionId": "2088", "paidOnly": false, "title": "Count Fertile Pyramids in a Land", "titleSlug": "count-fertile-pyramids-in-a-land", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10054, "totalSubmissionRaw": 15462}, "2089": {"acRate": 76.53217486620672, "difficulty": "Easy", "likes": 1798, "dislikes": 94, "categoryTitle": "Algorithms", "frontendQuestionId": "2089", "paidOnly": false, "title": "Find Target Indices After Sorting Array", "titleSlug": "find-target-indices-after-sorting-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 189908, "totalSubmissionRaw": 248141}, "2090": {"acRate": 46.00955272617905, "difficulty": "Medium", "likes": 1891, "dislikes": 94, "categoryTitle": "Algorithms", "frontendQuestionId": "2090", "paidOnly": false, "title": "K Radius Subarray Averages", "titleSlug": "k-radius-subarray-averages", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 128501, "totalSubmissionRaw": 279290}, "2091": {"acRate": 54.952393789748434, "difficulty": "Medium", "likes": 958, "dislikes": 52, "categoryTitle": "Algorithms", "frontendQuestionId": "2091", "paidOnly": false, "title": "Removing Minimum and Maximum From Array", "titleSlug": "removing-minimum-and-maximum-from-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 44845, "totalSubmissionRaw": 81607}, "2092": {"acRate": 45.52931359577342, "difficulty": "Hard", "likes": 1583, "dislikes": 81, "categoryTitle": "Algorithms", "frontendQuestionId": "2092", "paidOnly": false, "title": "Find All People With Secret", "titleSlug": "find-all-people-with-secret", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 98759, "totalSubmissionRaw": 216913}, "2093": {"acRate": 59.853488651375045, "difficulty": "Medium", "likes": 227, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "2093", "paidOnly": true, "title": "Minimum Cost to Reach City With Discounts", "titleSlug": "minimum-cost-to-reach-city-with-discounts", "topicTags": [{"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 9968, "totalSubmissionRaw": 16654}, "2094": {"acRate": 60.90808416389811, "difficulty": "Easy", "likes": 699, "dislikes": 263, "categoryTitle": "Algorithms", "frontendQuestionId": "2094", "paidOnly": false, "title": "Finding 3-Digit Even Numbers", "titleSlug": "finding-3-digit-even-numbers", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33000, "totalSubmissionRaw": 54180}, "2095": {"acRate": 59.47327592107632, "difficulty": "Medium", "likes": 4199, "dislikes": 79, "categoryTitle": "Algorithms", "frontendQuestionId": "2095", "paidOnly": false, "title": "Delete the Middle Node of a Linked List", "titleSlug": "delete-the-middle-node-of-a-linked-list", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 469190, "totalSubmissionRaw": 788909}, "2096": {"acRate": 56.36910119226196, "difficulty": "Medium", "likes": 3083, "dislikes": 160, "categoryTitle": "Algorithms", "frontendQuestionId": "2096", "paidOnly": false, "title": "Step-By-Step Directions From a Binary Tree Node to Another", "titleSlug": "step-by-step-directions-from-a-binary-tree-node-to-another", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 202922, "totalSubmissionRaw": 359988}, "2097": {"acRate": 44.102878607842385, "difficulty": "Hard", "likes": 507, "dislikes": 27, "categoryTitle": "Algorithms", "frontendQuestionId": "2097", "paidOnly": false, "title": "Valid Arrangement of Pairs", "titleSlug": "valid-arrangement-of-pairs", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Eulerian Circuit", "id": "VG9waWNUYWdOb2RlOjYxMDc0", "slug": "eulerian-circuit"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11506, "totalSubmissionRaw": 26089}, "2098": {"acRate": 36.64130678004028, "difficulty": "Medium", "likes": 84, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "2098", "paidOnly": true, "title": "Subsequence of Size K With the Largest Even Sum", "titleSlug": "subsequence-of-size-k-with-the-largest-even-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3275, "totalSubmissionRaw": 8938}, "2099": {"acRate": 43.890268102524935, "difficulty": "Easy", "likes": 1255, "dislikes": 133, "categoryTitle": "Algorithms", "frontendQuestionId": "2099", "paidOnly": false, "title": "Find Subsequence of Length K With the Largest Sum", "titleSlug": "find-subsequence-of-length-k-with-the-largest-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 52861, "totalSubmissionRaw": 120439}, "2100": {"acRate": 49.54191687378676, "difficulty": "Medium", "likes": 889, "dislikes": 45, "categoryTitle": "Algorithms", "frontendQuestionId": "2100", "paidOnly": false, "title": "Find Good Days to Rob the Bank", "titleSlug": "find-good-days-to-rob-the-bank", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27308, "totalSubmissionRaw": 55121}, "2101": {"acRate": 48.72851918863416, "difficulty": "Medium", "likes": 3076, "dislikes": 153, "categoryTitle": "Algorithms", "frontendQuestionId": "2101", "paidOnly": false, "title": "Detonate the Maximum Bombs", "titleSlug": "detonate-the-maximum-bombs", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 127658, "totalSubmissionRaw": 261978}, "2102": {"acRate": 64.6508728179551, "difficulty": "Hard", "likes": 384, "dislikes": 43, "categoryTitle": "Algorithms", "frontendQuestionId": "2102", "paidOnly": false, "title": "Sequentially Ordinal Rank Tracker", "titleSlug": "sequentially-ordinal-rank-tracker", "topicTags": [{"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Data Stream", "id": "VG9waWNUYWdOb2RlOjYxMDYz", "slug": "data-stream"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15555, "totalSubmissionRaw": 24060}, "2103": {"acRate": 80.89680135923764, "difficulty": "Easy", "likes": 959, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "2103", "paidOnly": false, "title": "Rings and Rods", "titleSlug": "rings-and-rods", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 76657, "totalSubmissionRaw": 94759}, "2104": {"acRate": 60.946577382644186, "difficulty": "Medium", "likes": 2393, "dislikes": 117, "categoryTitle": "Algorithms", "frontendQuestionId": "2104", "paidOnly": false, "title": "Sum of Subarray Ranges", "titleSlug": "sum-of-subarray-ranges", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 107216, "totalSubmissionRaw": 175918}, "2105": {"acRate": 48.321085091802736, "difficulty": "Medium", "likes": 277, "dislikes": 160, "categoryTitle": "Algorithms", "frontendQuestionId": "2105", "paidOnly": false, "title": "Watering Plants II", "titleSlug": "watering-plants-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20449, "totalSubmissionRaw": 42319}, "2106": {"acRate": 36.32893374741201, "difficulty": "Hard", "likes": 553, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "2106", "paidOnly": false, "title": "Maximum Fruits Harvested After at Most K Steps", "titleSlug": "maximum-fruits-harvested-after-at-most-k-steps", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11230, "totalSubmissionRaw": 30912}, "2107": {"acRate": 55.26954832442933, "difficulty": "Medium", "likes": 77, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "2107", "paidOnly": true, "title": "Number of Unique Flavors After Sharing K Candies", "titleSlug": "number-of-unique-flavors-after-sharing-k-candies", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3414, "totalSubmissionRaw": 6177}, "2108": {"acRate": 83.87792072730933, "difficulty": "Easy", "likes": 1532, "dislikes": 53, "categoryTitle": "Algorithms", "frontendQuestionId": "2108", "paidOnly": false, "title": "Find First Palindromic String in the Array", "titleSlug": "find-first-palindromic-string-in-the-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 300033, "totalSubmissionRaw": 357702}, "2109": {"acRate": 59.21245211459407, "difficulty": "Medium", "likes": 560, "dislikes": 68, "categoryTitle": "Algorithms", "frontendQuestionId": "2109", "paidOnly": false, "title": "Adding Spaces to a String", "titleSlug": "adding-spaces-to-a-string", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 46525, "totalSubmissionRaw": 78573}, "2110": {"acRate": 59.1271953166578, "difficulty": "Medium", "likes": 713, "dislikes": 31, "categoryTitle": "Algorithms", "frontendQuestionId": "2110", "paidOnly": false, "title": "Number of Smooth Descent Periods of a Stock", "titleSlug": "number-of-smooth-descent-periods-of-a-stock", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 37774, "totalSubmissionRaw": 63886}, "2111": {"acRate": 38.78393631557061, "difficulty": "Hard", "likes": 697, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "2111", "paidOnly": false, "title": "Minimum Operations to Make the Array K-Increasing", "titleSlug": "minimum-operations-to-make-the-array-k-increasing", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13057, "totalSubmissionRaw": 33666}, "2112": {"acRate": 70.220734719898, "difficulty": "Medium", "likes": 60, "dislikes": 8, "categoryTitle": "Database", "frontendQuestionId": "2112", "paidOnly": true, "title": "The Airport With the Most Traffic", "titleSlug": "the-airport-with-the-most-traffic", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8812, "totalSubmissionRaw": 12549}, "2113": {"acRate": 73.78895981975217, "difficulty": "Medium", "likes": 59, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "2113", "paidOnly": true, "title": "Elements in Array After Removing and Replacing Elements", "titleSlug": "elements-in-array-after-removing-and-replacing-elements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1965, "totalSubmissionRaw": 2663}, "2114": {"acRate": 86.5726144390789, "difficulty": "Easy", "likes": 1745, "dislikes": 60, "categoryTitle": "Algorithms", "frontendQuestionId": "2114", "paidOnly": false, "title": "Maximum Number of Words Found in Sentences", "titleSlug": "maximum-number-of-words-found-in-sentences", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 303696, "totalSubmissionRaw": 350799}, "2115": {"acRate": 50.19944975790388, "difficulty": "Medium", "likes": 1876, "dislikes": 91, "categoryTitle": "Algorithms", "frontendQuestionId": "2115", "paidOnly": false, "title": "Find All Possible Recipes from Given Supplies", "titleSlug": "find-all-possible-recipes-from-given-supplies", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 96523, "totalSubmissionRaw": 192279}, "2116": {"acRate": 31.98414304591612, "difficulty": "Medium", "likes": 1157, "dislikes": 44, "categoryTitle": "Algorithms", "frontendQuestionId": "2116", "paidOnly": false, "title": "Check if a Parentheses String Can Be Valid", "titleSlug": "check-if-a-parentheses-string-can-be-valid", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26867, "totalSubmissionRaw": 84001}, "2117": {"acRate": 26.121158653139243, "difficulty": "Hard", "likes": 89, "dislikes": 154, "categoryTitle": "Algorithms", "frontendQuestionId": "2117", "paidOnly": false, "title": "Abbreviating the Product of a Range", "titleSlug": "abbreviating-the-product-of-a-range", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3553, "totalSubmissionRaw": 13602}, "2118": {"acRate": 55.57172557172557, "difficulty": "Hard", "likes": 23, "dislikes": 37, "categoryTitle": "Database", "frontendQuestionId": "2118", "paidOnly": true, "title": "Build the Equation", "titleSlug": "build-the-equation", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2673, "totalSubmissionRaw": 4810}, "2119": {"acRate": 80.20621400737956, "difficulty": "Easy", "likes": 680, "dislikes": 38, "categoryTitle": "Algorithms", "frontendQuestionId": "2119", "paidOnly": false, "title": "A Number After a Double Reversal", "titleSlug": "a-number-after-a-double-reversal", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 93035, "totalSubmissionRaw": 115995}, "2120": {"acRate": 82.72379771682422, "difficulty": "Medium", "likes": 539, "dislikes": 51, "categoryTitle": "Algorithms", "frontendQuestionId": "2120", "paidOnly": false, "title": "Execution of All Suffix Instructions Staying in a Grid", "titleSlug": "execution-of-all-suffix-instructions-staying-in-a-grid", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 32029, "totalSubmissionRaw": 38718}, "2121": {"acRate": 44.491206974297306, "difficulty": "Medium", "likes": 905, "dislikes": 39, "categoryTitle": "Algorithms", "frontendQuestionId": "2121", "paidOnly": false, "title": "Intervals Between Identical Elements", "titleSlug": "intervals-between-identical-elements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20720, "totalSubmissionRaw": 46570}, "2122": {"acRate": 39.47027959462373, "difficulty": "Hard", "likes": 372, "dislikes": 33, "categoryTitle": "Algorithms", "frontendQuestionId": "2122", "paidOnly": false, "title": "Recover the Original Array", "titleSlug": "recover-the-original-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10983, "totalSubmissionRaw": 27826}, "2123": {"acRate": 40.58614564831261, "difficulty": "Hard", "likes": 52, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "2123", "paidOnly": true, "title": "Minimum Operations to Remove Adjacent Ones in Matrix", "titleSlug": "minimum-operations-to-remove-adjacent-ones-in-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 914, "totalSubmissionRaw": 2252}, "2124": {"acRate": 72.1211765790069, "difficulty": "Easy", "likes": 737, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "2124", "paidOnly": false, "title": "Check if All A's Appears Before All B's", "titleSlug": "check-if-all-as-appears-before-all-bs", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 86086, "totalSubmissionRaw": 119363}, "2125": {"acRate": 85.60100421265584, "difficulty": "Medium", "likes": 1854, "dislikes": 190, "categoryTitle": "Algorithms", "frontendQuestionId": "2125", "paidOnly": false, "title": "Number of Laser Beams in a Bank", "titleSlug": "number-of-laser-beams-in-a-bank", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 210718, "totalSubmissionRaw": 246163}, "2126": {"acRate": 51.69038359554534, "difficulty": "Medium", "likes": 557, "dislikes": 188, "categoryTitle": "Algorithms", "frontendQuestionId": "2126", "paidOnly": false, "title": "Destroying Asteroids", "titleSlug": "destroying-asteroids", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 46786, "totalSubmissionRaw": 90512}, "2127": {"acRate": 37.34613898548324, "difficulty": "Hard", "likes": 1033, "dislikes": 37, "categoryTitle": "Algorithms", "frontendQuestionId": "2127", "paidOnly": false, "title": "Maximum Employees to Be Invited to a Meeting", "titleSlug": "maximum-employees-to-be-invited-to-a-meeting", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13532, "totalSubmissionRaw": 36234}, "2128": {"acRate": 76.21151393696483, "difficulty": "Medium", "likes": 475, "dislikes": 184, "categoryTitle": "Algorithms", "frontendQuestionId": "2128", "paidOnly": true, "title": "Remove All Ones With Row and Column Flips", "titleSlug": "remove-all-ones-with-row-and-column-flips", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33466, "totalSubmissionRaw": 43912}, "2129": {"acRate": 64.70362536278223, "difficulty": "Easy", "likes": 735, "dislikes": 50, "categoryTitle": "Algorithms", "frontendQuestionId": "2129", "paidOnly": false, "title": "Capitalize the Title", "titleSlug": "capitalize-the-title", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 65768, "totalSubmissionRaw": 101645}, "2130": {"acRate": 80.96746848624069, "difficulty": "Medium", "likes": 3529, "dislikes": 102, "categoryTitle": "Algorithms", "frontendQuestionId": "2130", "paidOnly": false, "title": "Maximum Twin Sum of a Linked List", "titleSlug": "maximum-twin-sum-of-a-linked-list", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 309469, "totalSubmissionRaw": 382214}, "2131": {"acRate": 48.029376551790634, "difficulty": "Medium", "likes": 2435, "dislikes": 61, "categoryTitle": "Algorithms", "frontendQuestionId": "2131", "paidOnly": false, "title": "Longest Palindrome by Concatenating Two Letter Words", "titleSlug": "longest-palindrome-by-concatenating-two-letter-words", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 119548, "totalSubmissionRaw": 248906}, "2132": {"acRate": 32.38716502115656, "difficulty": "Hard", "likes": 386, "dislikes": 44, "categoryTitle": "Algorithms", "frontendQuestionId": "2132", "paidOnly": false, "title": "Stamping the Grid", "titleSlug": "stamping-the-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7348, "totalSubmissionRaw": 22688}, "2133": {"acRate": 51.849972627615394, "difficulty": "Easy", "likes": 968, "dislikes": 52, "categoryTitle": "Algorithms", "frontendQuestionId": "2133", "paidOnly": false, "title": "Check if Every Row and Column Contains All Numbers", "titleSlug": "check-if-every-row-and-column-contains-all-numbers", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 77664, "totalSubmissionRaw": 149786}, "2134": {"acRate": 65.48824452762493, "difficulty": "Medium", "likes": 1940, "dislikes": 39, "categoryTitle": "Algorithms", "frontendQuestionId": "2134", "paidOnly": false, "title": "Minimum Swaps to Group All 1's Together II", "titleSlug": "minimum-swaps-to-group-all-1s-together-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 151860, "totalSubmissionRaw": 231889}, "2135": {"acRate": 43.097346216490934, "difficulty": "Medium", "likes": 693, "dislikes": 159, "categoryTitle": "Algorithms", "frontendQuestionId": "2135", "paidOnly": false, "title": "Count Words Obtained After Adding a Letter", "titleSlug": "count-words-obtained-after-adding-a-letter", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 35192, "totalSubmissionRaw": 81657}, "2136": {"acRate": 71.79520617615607, "difficulty": "Hard", "likes": 1585, "dislikes": 81, "categoryTitle": "Algorithms", "frontendQuestionId": "2136", "paidOnly": false, "title": "Earliest Possible Day of Full Bloom", "titleSlug": "earliest-possible-day-of-full-bloom", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 55054, "totalSubmissionRaw": 76682}, "2137": {"acRate": 67.58474576271186, "difficulty": "Medium", "likes": 102, "dislikes": 10, "categoryTitle": "Algorithms", "frontendQuestionId": "2137", "paidOnly": true, "title": "Pour Water Between Buckets to Make Water Levels Equal", "titleSlug": "pour-water-between-buckets-to-make-water-levels-equal", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2552, "totalSubmissionRaw": 3776}, "2138": {"acRate": 66.88810176826495, "difficulty": "Easy", "likes": 464, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "2138", "paidOnly": false, "title": "Divide a String Into Groups of Size k", "titleSlug": "divide-a-string-into-groups-of-size-k", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 48532, "totalSubmissionRaw": 72557}, "2139": {"acRate": 50.978022722652625, "difficulty": "Medium", "likes": 990, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "2139", "paidOnly": false, "title": "Minimum Moves to Reach Target Score", "titleSlug": "minimum-moves-to-reach-target-score", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 45139, "totalSubmissionRaw": 88546}, "2140": {"acRate": 55.05580744590202, "difficulty": "Medium", "likes": 2334, "dislikes": 59, "categoryTitle": "Algorithms", "frontendQuestionId": "2140", "paidOnly": false, "title": "Solving Questions With Brainpower", "titleSlug": "solving-questions-with-brainpower", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 104671, "totalSubmissionRaw": 190118}, "2141": {"acRate": 49.95901236187166, "difficulty": "Hard", "likes": 2003, "dislikes": 56, "categoryTitle": "Algorithms", "frontendQuestionId": "2141", "paidOnly": false, "title": "Maximum Running Time of N Computers", "titleSlug": "maximum-running-time-of-n-computers", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 60944, "totalSubmissionRaw": 121988}, "2142": {"acRate": 48.392537156108354, "difficulty": "Medium", "likes": 105, "dislikes": 11, "categoryTitle": "Database", "frontendQuestionId": "2142", "paidOnly": true, "title": "The Number of Passengers in Each Bus I", "titleSlug": "the-number-of-passengers-in-each-bus-i", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9182, "totalSubmissionRaw": 18974}, "2143": {"acRate": 51.872925557136085, "difficulty": "Hard", "likes": 38, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "2143", "paidOnly": true, "title": "Choose Numbers From Two Arrays in Range", "titleSlug": "choose-numbers-from-two-arrays-in-range", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1094, "totalSubmissionRaw": 2109}, "2144": {"acRate": 61.38591535923666, "difficulty": "Easy", "likes": 591, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "2144", "paidOnly": false, "title": "Minimum Cost of Buying Candies With Discount", "titleSlug": "minimum-cost-of-buying-candies-with-discount", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 51725, "totalSubmissionRaw": 84262}, "2145": {"acRate": 38.65618650850658, "difficulty": "Medium", "likes": 521, "dislikes": 46, "categoryTitle": "Algorithms", "frontendQuestionId": "2145", "paidOnly": false, "title": "Count the Hidden Sequences", "titleSlug": "count-the-hidden-sequences", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18836, "totalSubmissionRaw": 48727}, "2146": {"acRate": 43.347824912915506, "difficulty": "Medium", "likes": 503, "dislikes": 158, "categoryTitle": "Algorithms", "frontendQuestionId": "2146", "paidOnly": false, "title": "K Highest Ranked Items Within a Price Range", "titleSlug": "k-highest-ranked-items-within-a-price-range", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16053, "totalSubmissionRaw": 37033}, "2147": {"acRate": 49.344229071063566, "difficulty": "Hard", "likes": 1055, "dislikes": 107, "categoryTitle": "Algorithms", "frontendQuestionId": "2147", "paidOnly": false, "title": "Number of Ways to Divide a Long Corridor", "titleSlug": "number-of-ways-to-divide-a-long-corridor", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 68173, "totalSubmissionRaw": 138158}, "2148": {"acRate": 59.396781774007245, "difficulty": "Easy", "likes": 646, "dislikes": 40, "categoryTitle": "Algorithms", "frontendQuestionId": "2148", "paidOnly": false, "title": "Count Elements With Strictly Smaller and Greater Elements ", "titleSlug": "count-elements-with-strictly-smaller-and-greater-elements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 59651, "totalSubmissionRaw": 100428}, "2149": {"acRate": 84.02598052086068, "difficulty": "Medium", "likes": 3280, "dislikes": 185, "categoryTitle": "Algorithms", "frontendQuestionId": "2149", "paidOnly": false, "title": "Rearrange Array Elements by Sign", "titleSlug": "rearrange-array-elements-by-sign", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 403239, "totalSubmissionRaw": 479898}, "2150": {"acRate": 60.80710937975531, "difficulty": "Medium", "likes": 645, "dislikes": 62, "categoryTitle": "Algorithms", "frontendQuestionId": "2150", "paidOnly": false, "title": "Find All Lonely Numbers in the Array", "titleSlug": "find-all-lonely-numbers-in-the-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 49950, "totalSubmissionRaw": 82145}, "2151": {"acRate": 50.18605165235972, "difficulty": "Hard", "likes": 505, "dislikes": 79, "categoryTitle": "Algorithms", "frontendQuestionId": "2151", "paidOnly": false, "title": "Maximum Good People Based on Statements", "titleSlug": "maximum-good-people-based-on-statements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13622, "totalSubmissionRaw": 27143}, "2152": {"acRate": 43.370165745856355, "difficulty": "Medium", "likes": 71, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "2152", "paidOnly": true, "title": "Minimum Number of Lines to Cover Points", "titleSlug": "minimum-number-of-lines-to-cover-points", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2041, "totalSubmissionRaw": 4706}, "2153": {"acRate": 40.04497949464215, "difficulty": "Hard", "likes": 78, "dislikes": 28, "categoryTitle": "Database", "frontendQuestionId": "2153", "paidOnly": true, "title": "The Number of Passengers in Each Bus II", "titleSlug": "the-number-of-passengers-in-each-bus-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 3027, "totalSubmissionRaw": 7559}, "2154": {"acRate": 71.35267584491652, "difficulty": "Easy", "likes": 710, "dislikes": 37, "categoryTitle": "Algorithms", "frontendQuestionId": "2154", "paidOnly": false, "title": "Keep Multiplying Found Values by Two", "titleSlug": "keep-multiplying-found-values-by-two", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 96969, "totalSubmissionRaw": 135901}, "2155": {"acRate": 64.35538816360213, "difficulty": "Medium", "likes": 503, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "2155", "paidOnly": false, "title": "All Divisions With the Highest Score of a Binary Array", "titleSlug": "all-divisions-with-the-highest-score-of-a-binary-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30415, "totalSubmissionRaw": 47261}, "2156": {"acRate": 23.662981774723633, "difficulty": "Hard", "likes": 424, "dislikes": 383, "categoryTitle": "Algorithms", "frontendQuestionId": "2156", "paidOnly": false, "title": "Find Substring With Given Hash Value", "titleSlug": "find-substring-with-given-hash-value", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13464, "totalSubmissionRaw": 56899}, "2157": {"acRate": 26.135685210312076, "difficulty": "Hard", "likes": 472, "dislikes": 56, "categoryTitle": "Algorithms", "frontendQuestionId": "2157", "paidOnly": false, "title": "Groups of Strings", "titleSlug": "groups-of-strings", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9631, "totalSubmissionRaw": 36850}, "2158": {"acRate": 55.29818907586106, "difficulty": "Hard", "likes": 421, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "2158", "paidOnly": true, "title": "Amount of New Area Painted Each Day", "titleSlug": "amount-of-new-area-painted-each-day", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30200, "totalSubmissionRaw": 54613}, "2159": {"acRate": 60.351089588377725, "difficulty": "Medium", "likes": 72, "dislikes": 18, "categoryTitle": "Database", "frontendQuestionId": "2159", "paidOnly": true, "title": "Order Two Columns Independently", "titleSlug": "order-two-columns-independently", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7976, "totalSubmissionRaw": 13216}, "2160": {"acRate": 86.22862919737919, "difficulty": "Easy", "likes": 1403, "dislikes": 139, "categoryTitle": "Algorithms", "frontendQuestionId": "2160", "paidOnly": false, "title": "Minimum Sum of Four Digit Number After Splitting Digits", "titleSlug": "minimum-sum-of-four-digit-number-after-splitting-digits", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 134765, "totalSubmissionRaw": 156288}, "2161": {"acRate": 85.12056542486219, "difficulty": "Medium", "likes": 1106, "dislikes": 86, "categoryTitle": "Algorithms", "frontendQuestionId": "2161", "paidOnly": false, "title": "Partition Array According to Given Pivot", "titleSlug": "partition-array-according-to-given-pivot", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 80449, "totalSubmissionRaw": 94512}, "2162": {"acRate": 41.168787933109684, "difficulty": "Medium", "likes": 208, "dislikes": 622, "categoryTitle": "Algorithms", "frontendQuestionId": "2162", "paidOnly": false, "title": "Minimum Cost to Set Cooking Time", "titleSlug": "minimum-cost-to-set-cooking-time", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16076, "totalSubmissionRaw": 39049}, "2163": {"acRate": 48.20654679575841, "difficulty": "Hard", "likes": 670, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2163", "paidOnly": false, "title": "Minimum Difference in Sums After Removal of Elements", "titleSlug": "minimum-difference-in-sums-after-removal-of-elements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10456, "totalSubmissionRaw": 21690}, "2164": {"acRate": 62.62379358843785, "difficulty": "Easy", "likes": 731, "dislikes": 63, "categoryTitle": "Algorithms", "frontendQuestionId": "2164", "paidOnly": false, "title": "Sort Even and Odd Indices Independently", "titleSlug": "sort-even-and-odd-indices-independently", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 64562, "totalSubmissionRaw": 103095}, "2165": {"acRate": 52.264413490367104, "difficulty": "Medium", "likes": 635, "dislikes": 23, "categoryTitle": "Algorithms", "frontendQuestionId": "2165", "paidOnly": false, "title": "Smallest Value of the Rearranged Number", "titleSlug": "smallest-value-of-the-rearranged-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 36433, "totalSubmissionRaw": 69709}, "2166": {"acRate": 32.5629779577148, "difficulty": "Medium", "likes": 588, "dislikes": 47, "categoryTitle": "Algorithms", "frontendQuestionId": "2166", "paidOnly": false, "title": "Design Bitset", "titleSlug": "design-bitset", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23164, "totalSubmissionRaw": 71136}, "2167": {"acRate": 41.546821110171145, "difficulty": "Hard", "likes": 669, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "2167", "paidOnly": false, "title": "Minimum Time to Remove All Cars Containing Illegal Goods", "titleSlug": "minimum-time-to-remove-all-cars-containing-illegal-goods", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12769, "totalSubmissionRaw": 30734}, "2168": {"acRate": 59.97787610619469, "difficulty": "Medium", "likes": 73, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "2168", "paidOnly": true, "title": "Unique Substrings With Equal Digit Frequency", "titleSlug": "unique-substrings-with-equal-digit-frequency", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2711, "totalSubmissionRaw": 4520}, "2169": {"acRate": 74.50105704144767, "difficulty": "Easy", "likes": 604, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "2169", "paidOnly": false, "title": "Count Operations to Obtain Zero", "titleSlug": "count-operations-to-obtain-zero", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 76824, "totalSubmissionRaw": 103118}, "2170": {"acRate": 33.366678926075764, "difficulty": "Medium", "likes": 579, "dislikes": 331, "categoryTitle": "Algorithms", "frontendQuestionId": "2170", "paidOnly": false, "title": "Minimum Operations to Make the Array Alternating", "titleSlug": "minimum-operations-to-make-the-array-alternating", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22681, "totalSubmissionRaw": 67975}, "2171": {"acRate": 42.93704759815749, "difficulty": "Medium", "likes": 872, "dislikes": 48, "categoryTitle": "Algorithms", "frontendQuestionId": "2171", "paidOnly": false, "title": "Removing Minimum Number of Magic Beans", "titleSlug": "removing-minimum-number-of-magic-beans", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27405, "totalSubmissionRaw": 63826}, "2172": {"acRate": 49.2198730759791, "difficulty": "Hard", "likes": 513, "dislikes": 29, "categoryTitle": "Algorithms", "frontendQuestionId": "2172", "paidOnly": false, "title": "Maximum AND Sum of Array", "titleSlug": "maximum-and-sum-of-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14038, "totalSubmissionRaw": 28521}, "2173": {"acRate": 52.87266211221861, "difficulty": "Hard", "likes": 97, "dislikes": 4, "categoryTitle": "Database", "frontendQuestionId": "2173", "paidOnly": true, "title": "Longest Winning Streak", "titleSlug": "longest-winning-streak", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 4721, "totalSubmissionRaw": 8929}, "2174": {"acRate": 67.24598930481284, "difficulty": "Medium", "likes": 91, "dislikes": 23, "categoryTitle": "Algorithms", "frontendQuestionId": "2174", "paidOnly": true, "title": "Remove All Ones With Row and Column Flips II", "titleSlug": "remove-all-ones-with-row-and-column-flips-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5030, "totalSubmissionRaw": 7480}, "2175": {"acRate": 60.372982000371124, "difficulty": "Medium", "likes": 39, "dislikes": 16, "categoryTitle": "Database", "frontendQuestionId": "2175", "paidOnly": true, "title": "The Change in Global Rankings", "titleSlug": "the-change-in-global-rankings", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6507, "totalSubmissionRaw": 10778}, "2176": {"acRate": 79.61662102631266, "difficulty": "Easy", "likes": 640, "dislikes": 28, "categoryTitle": "Algorithms", "frontendQuestionId": "2176", "paidOnly": false, "title": "Count Equal and Divisible Pairs in an Array", "titleSlug": "count-equal-and-divisible-pairs-in-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 80244, "totalSubmissionRaw": 100788}, "2177": {"acRate": 64.5575699363669, "difficulty": "Medium", "likes": 671, "dislikes": 218, "categoryTitle": "Algorithms", "frontendQuestionId": "2177", "paidOnly": false, "title": "Find Three Consecutive Integers That Sum to a Given Number", "titleSlug": "find-three-consecutive-integers-that-sum-to-a-given-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 48393, "totalSubmissionRaw": 74961}, "2178": {"acRate": 59.268274130980444, "difficulty": "Medium", "likes": 783, "dislikes": 73, "categoryTitle": "Algorithms", "frontendQuestionId": "2178", "paidOnly": false, "title": "Maximum Split of Positive Even Integers", "titleSlug": "maximum-split-of-positive-even-integers", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 46752, "totalSubmissionRaw": 78882}, "2179": {"acRate": 41.401116545625214, "difficulty": "Hard", "likes": 619, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "2179", "paidOnly": false, "title": "Count Good Triplets in an Array", "titleSlug": "count-good-triplets-in-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Merge Sort", "id": "VG9waWNUYWdOb2RlOjYxMDUx", "slug": "merge-sort"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8380, "totalSubmissionRaw": 20241}, "2180": {"acRate": 67.26193001060446, "difficulty": "Easy", "likes": 618, "dislikes": 30, "categoryTitle": "Algorithms", "frontendQuestionId": "2180", "paidOnly": false, "title": "Count Integers With Even Digit Sum", "titleSlug": "count-integers-with-even-digit-sum", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 63426, "totalSubmissionRaw": 94298}, "2181": {"acRate": 89.83910123626193, "difficulty": "Medium", "likes": 2294, "dislikes": 48, "categoryTitle": "Algorithms", "frontendQuestionId": "2181", "paidOnly": false, "title": "Merge Nodes in Between Zeros", "titleSlug": "merge-nodes-in-between-zeros", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 272367, "totalSubmissionRaw": 303172}, "2182": {"acRate": 54.475153945295716, "difficulty": "Medium", "likes": 659, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "2182", "paidOnly": false, "title": "Construct String With Repeat Limit", "titleSlug": "construct-string-with-repeat-limit", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22824, "totalSubmissionRaw": 41898}, "2183": {"acRate": 29.558468437392204, "difficulty": "Hard", "likes": 843, "dislikes": 35, "categoryTitle": "Algorithms", "frontendQuestionId": "2183", "paidOnly": false, "title": "Count Array Pairs Divisible by K", "titleSlug": "count-array-pairs-divisible-by-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17138, "totalSubmissionRaw": 57980}, "2184": {"acRate": 48.99845916795069, "difficulty": "Medium", "likes": 177, "dislikes": 124, "categoryTitle": "Algorithms", "frontendQuestionId": "2184", "paidOnly": true, "title": "Number of Ways to Build Sturdy Brick Wall", "titleSlug": "number-of-ways-to-build-sturdy-brick-wall", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8268, "totalSubmissionRaw": 16874}, "2185": {"acRate": 78.2467786632431, "difficulty": "Easy", "likes": 695, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "2185", "paidOnly": false, "title": "Counting Words With a Given Prefix", "titleSlug": "counting-words-with-a-given-prefix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 99954, "totalSubmissionRaw": 127742}, "2186": {"acRate": 72.7396351575456, "difficulty": "Medium", "likes": 573, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "2186", "paidOnly": false, "title": "Minimum Number of Steps to Make Two Strings Anagram II", "titleSlug": "minimum-number-of-steps-to-make-two-strings-anagram-ii", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 43862, "totalSubmissionRaw": 60300}, "2187": {"acRate": 38.783286311061424, "difficulty": "Medium", "likes": 2801, "dislikes": 181, "categoryTitle": "Algorithms", "frontendQuestionId": "2187", "paidOnly": false, "title": "Minimum Time to Complete Trips", "titleSlug": "minimum-time-to-complete-trips", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 117257, "totalSubmissionRaw": 302339}, "2188": {"acRate": 41.82568871001319, "difficulty": "Hard", "likes": 565, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "2188", "paidOnly": false, "title": "Minimum Time to Finish the Race", "titleSlug": "minimum-time-to-finish-the-race", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12055, "totalSubmissionRaw": 28822}, "2189": {"acRate": 63.190184049079754, "difficulty": "Medium", "likes": 66, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "2189", "paidOnly": true, "title": "Number of Ways to Build House of Cards", "titleSlug": "number-of-ways-to-build-house-of-cards", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2266, "totalSubmissionRaw": 3586}, "2190": {"acRate": 59.051246429296164, "difficulty": "Easy", "likes": 370, "dislikes": 235, "categoryTitle": "Algorithms", "frontendQuestionId": "2190", "paidOnly": false, "title": "Most Frequent Number Following Key In an Array", "titleSlug": "most-frequent-number-following-key-in-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 37830, "totalSubmissionRaw": 64063}, "2191": {"acRate": 60.26963875850375, "difficulty": "Medium", "likes": 918, "dislikes": 136, "categoryTitle": "Algorithms", "frontendQuestionId": "2191", "paidOnly": false, "title": "Sort the Jumbled Numbers", "titleSlug": "sort-the-jumbled-numbers", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 145735, "totalSubmissionRaw": 241805}, "2192": {"acRate": 62.19744459127098, "difficulty": "Medium", "likes": 1605, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "2192", "paidOnly": false, "title": "All Ancestors of a Node in a Directed Acyclic Graph", "titleSlug": "all-ancestors-of-a-node-in-a-directed-acyclic-graph", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 132261, "totalSubmissionRaw": 212647}, "2193": {"acRate": 51.191491175718305, "difficulty": "Hard", "likes": 975, "dislikes": 72, "categoryTitle": "Algorithms", "frontendQuestionId": "2193", "paidOnly": false, "title": "Minimum Number of Moves to Make Palindrome", "titleSlug": "minimum-number-of-moves-to-make-palindrome", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24017, "totalSubmissionRaw": 46916}, "2194": {"acRate": 84.16156953260241, "difficulty": "Easy", "likes": 607, "dislikes": 95, "categoryTitle": "Algorithms", "frontendQuestionId": "2194", "paidOnly": false, "title": "Cells in a Range on an Excel Sheet", "titleSlug": "cells-in-a-range-on-an-excel-sheet", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 72926, "totalSubmissionRaw": 86650}, "2195": {"acRate": 25.498294544863914, "difficulty": "Medium", "likes": 750, "dislikes": 308, "categoryTitle": "Algorithms", "frontendQuestionId": "2195", "paidOnly": false, "title": "Append K Integers With Minimal Sum", "titleSlug": "append-k-integers-with-minimal-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 32967, "totalSubmissionRaw": 129291}, "2196": {"acRate": 81.81744522708613, "difficulty": "Medium", "likes": 1567, "dislikes": 35, "categoryTitle": "Algorithms", "frontendQuestionId": "2196", "paidOnly": false, "title": "Create Binary Tree From Descriptions", "titleSlug": "create-binary-tree-from-descriptions", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 151467, "totalSubmissionRaw": 185128}, "2197": {"acRate": 39.21230570297136, "difficulty": "Hard", "likes": 425, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "2197", "paidOnly": false, "title": "Replace Non-Coprime Numbers in Array", "titleSlug": "replace-non-coprime-numbers-in-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14556, "totalSubmissionRaw": 37121}, "2198": {"acRate": 54.78387566779991, "difficulty": "Medium", "likes": 27, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "2198", "paidOnly": true, "title": "Number of Single Divisor Triplets", "titleSlug": "number-of-single-divisor-triplets", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1128, "totalSubmissionRaw": 2059}, "2199": {"acRate": 49.31362196409715, "difficulty": "Hard", "likes": 44, "dislikes": 14, "categoryTitle": "Database", "frontendQuestionId": "2199", "paidOnly": true, "title": "Finding the Topic of Each Post", "titleSlug": "finding-the-topic-of-each-post", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3269, "totalSubmissionRaw": 6629}, "2200": {"acRate": 66.10251921019355, "difficulty": "Easy", "likes": 414, "dislikes": 67, "categoryTitle": "Algorithms", "frontendQuestionId": "2200", "paidOnly": false, "title": "Find All K-Distant Indices in an Array", "titleSlug": "find-all-k-distant-indices-in-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 40776, "totalSubmissionRaw": 61686}, "2201": {"acRate": 56.574845547809325, "difficulty": "Medium", "likes": 214, "dislikes": 198, "categoryTitle": "Algorithms", "frontendQuestionId": "2201", "paidOnly": false, "title": "Count Artifacts That Can Be Extracted", "titleSlug": "count-artifacts-that-can-be-extracted", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19963, "totalSubmissionRaw": 35286}, "2202": {"acRate": 23.070419889156778, "difficulty": "Medium", "likes": 615, "dislikes": 320, "categoryTitle": "Algorithms", "frontendQuestionId": "2202", "paidOnly": false, "title": "Maximize the Topmost Element After K Moves", "titleSlug": "maximize-the-topmost-element-after-k-moves", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29472, "totalSubmissionRaw": 127748}, "2203": {"acRate": 37.05786323235988, "difficulty": "Hard", "likes": 673, "dislikes": 18, "categoryTitle": "Algorithms", "frontendQuestionId": "2203", "paidOnly": false, "title": "Minimum Weighted Subgraph With the Required Paths", "titleSlug": "minimum-weighted-subgraph-with-the-required-paths", "topicTags": [{"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12258, "totalSubmissionRaw": 33078}, "2204": {"acRate": 68.42000793965859, "difficulty": "Hard", "likes": 112, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "2204", "paidOnly": true, "title": "Distance to a Cycle in Undirected Graph", "titleSlug": "distance-to-a-cycle-in-undirected-graph", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3447, "totalSubmissionRaw": 5038}, "2205": {"acRate": 50.055335968379445, "difficulty": "Easy", "likes": 27, "dislikes": 76, "categoryTitle": "Database", "frontendQuestionId": "2205", "paidOnly": true, "title": "The Number of Users That Are Eligible for Discount", "titleSlug": "the-number-of-users-that-are-eligible-for-discount", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6332, "totalSubmissionRaw": 12650}, "2206": {"acRate": 73.75952782167585, "difficulty": "Easy", "likes": 717, "dislikes": 35, "categoryTitle": "Algorithms", "frontendQuestionId": "2206", "paidOnly": false, "title": "Divide Array Into Equal Pairs", "titleSlug": "divide-array-into-equal-pairs", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 84479, "totalSubmissionRaw": 114533}, "2207": {"acRate": 34.79829625457618, "difficulty": "Medium", "likes": 501, "dislikes": 33, "categoryTitle": "Algorithms", "frontendQuestionId": "2207", "paidOnly": false, "title": "Maximize Number of Subsequences in a String", "titleSlug": "maximize-number-of-subsequences-in-a-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19771, "totalSubmissionRaw": 56816}, "2208": {"acRate": 46.87297185674671, "difficulty": "Medium", "likes": 592, "dislikes": 29, "categoryTitle": "Algorithms", "frontendQuestionId": "2208", "paidOnly": false, "title": "Minimum Operations to Halve Array Sum", "titleSlug": "minimum-operations-to-halve-array-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 31778, "totalSubmissionRaw": 67796}, "2209": {"acRate": 36.852977630880005, "difficulty": "Hard", "likes": 500, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2209", "paidOnly": false, "title": "Minimum White Tiles After Covering With Carpets", "titleSlug": "minimum-white-tiles-after-covering-with-carpets", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12488, "totalSubmissionRaw": 33886}, "2210": {"acRate": 61.05033600796463, "difficulty": "Easy", "likes": 690, "dislikes": 92, "categoryTitle": "Algorithms", "frontendQuestionId": "2210", "paidOnly": false, "title": "Count Hills and Valleys in an Array", "titleSlug": "count-hills-and-valleys-in-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 51510, "totalSubmissionRaw": 84373}, "2211": {"acRate": 43.9272595893298, "difficulty": "Medium", "likes": 666, "dislikes": 230, "categoryTitle": "Algorithms", "frontendQuestionId": "2211", "paidOnly": false, "title": "Count Collisions on a Road", "titleSlug": "count-collisions-on-a-road", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29180, "totalSubmissionRaw": 66428}, "2212": {"acRate": 50.194540119913256, "difficulty": "Medium", "likes": 494, "dislikes": 51, "categoryTitle": "Algorithms", "frontendQuestionId": "2212", "paidOnly": false, "title": "Maximum Points in an Archery Competition", "titleSlug": "maximum-points-in-an-archery-competition", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15739, "totalSubmissionRaw": 31356}, "2213": {"acRate": 32.31865716379138, "difficulty": "Hard", "likes": 296, "dislikes": 82, "categoryTitle": "Algorithms", "frontendQuestionId": "2213", "paidOnly": false, "title": "Longest Substring of One Repeating Character", "titleSlug": "longest-substring-of-one-repeating-character", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4852, "totalSubmissionRaw": 15013}, "2214": {"acRate": 57.70302985841097, "difficulty": "Medium", "likes": 313, "dislikes": 234, "categoryTitle": "Algorithms", "frontendQuestionId": "2214", "paidOnly": true, "title": "Minimum Health to Beat Game", "titleSlug": "minimum-health-to-beat-game", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 31462, "totalSubmissionRaw": 54524}, "2215": {"acRate": 79.28166471352105, "difficulty": "Easy", "likes": 2343, "dislikes": 96, "categoryTitle": "Algorithms", "frontendQuestionId": "2215", "paidOnly": false, "title": "Find the Difference of Two Arrays", "titleSlug": "find-the-difference-of-two-arrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 375469, "totalSubmissionRaw": 473590}, "2216": {"acRate": 48.594657375145175, "difficulty": "Medium", "likes": 793, "dislikes": 94, "categoryTitle": "Algorithms", "frontendQuestionId": "2216", "paidOnly": false, "title": "Minimum Deletions to Make Array Beautiful", "titleSlug": "minimum-deletions-to-make-array-beautiful", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33472, "totalSubmissionRaw": 68880}, "2217": {"acRate": 37.18779510892572, "difficulty": "Medium", "likes": 618, "dislikes": 288, "categoryTitle": "Algorithms", "frontendQuestionId": "2217", "paidOnly": false, "title": "Find Palindrome With Fixed Length", "titleSlug": "find-palindrome-with-fixed-length", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22840, "totalSubmissionRaw": 61418}, "2218": {"acRate": 60.54197254457715, "difficulty": "Hard", "likes": 2309, "dislikes": 37, "categoryTitle": "Algorithms", "frontendQuestionId": "2218", "paidOnly": false, "title": "Maximum Value of K Coins From Piles", "titleSlug": "maximum-value-of-k-coins-from-piles", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 67871, "totalSubmissionRaw": 112107}, "2219": {"acRate": 62.04211133544851, "difficulty": "Medium", "likes": 66, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2219", "paidOnly": true, "title": "Maximum Sum Score of Array", "titleSlug": "maximum-sum-score-of-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4302, "totalSubmissionRaw": 6934}, "2220": {"acRate": 85.30215910785597, "difficulty": "Easy", "likes": 934, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "2220", "paidOnly": false, "title": "Minimum Bit Flips to Convert Number", "titleSlug": "minimum-bit-flips-to-convert-number", "topicTags": [{"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 102957, "totalSubmissionRaw": 120697}, "2221": {"acRate": 78.83253182733729, "difficulty": "Medium", "likes": 1094, "dislikes": 54, "categoryTitle": "Algorithms", "frontendQuestionId": "2221", "paidOnly": false, "title": "Find Triangular Sum of an Array", "titleSlug": "find-triangular-sum-of-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 81799, "totalSubmissionRaw": 103763}, "2222": {"acRate": 50.68659947236691, "difficulty": "Medium", "likes": 979, "dislikes": 50, "categoryTitle": "Algorithms", "frontendQuestionId": "2222", "paidOnly": false, "title": "Number of Ways to Select Buildings", "titleSlug": "number-of-ways-to-select-buildings", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 37465, "totalSubmissionRaw": 73915}, "2223": {"acRate": 40.45018520277329, "difficulty": "Hard", "likes": 264, "dislikes": 185, "categoryTitle": "Algorithms", "frontendQuestionId": "2223", "paidOnly": false, "title": "Sum of Scores of Built Strings", "titleSlug": "sum-of-scores-of-built-strings", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "Suffix Array", "id": "VG9waWNUYWdOb2RlOjU2Njk4", "slug": "suffix-array"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8518, "totalSubmissionRaw": 21058}, "2224": {"acRate": 65.28093290928366, "difficulty": "Easy", "likes": 453, "dislikes": 36, "categoryTitle": "Algorithms", "frontendQuestionId": "2224", "paidOnly": false, "title": "Minimum Number of Operations to Convert Time", "titleSlug": "minimum-number-of-operations-to-convert-time", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 43105, "totalSubmissionRaw": 66030}, "2225": {"acRate": 73.20340694992316, "difficulty": "Medium", "likes": 2149, "dislikes": 155, "categoryTitle": "Algorithms", "frontendQuestionId": "2225", "paidOnly": false, "title": "Find Players With Zero or One Losses", "titleSlug": "find-players-with-zero-or-one-losses", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 252937, "totalSubmissionRaw": 345526}, "2226": {"acRate": 38.33773363873201, "difficulty": "Medium", "likes": 1118, "dislikes": 41, "categoryTitle": "Algorithms", "frontendQuestionId": "2226", "paidOnly": false, "title": "Maximum Candies Allocated to K Children", "titleSlug": "maximum-candies-allocated-to-k-children", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 43852, "totalSubmissionRaw": 114385}, "2227": {"acRate": 40.560172360726376, "difficulty": "Hard", "likes": 334, "dislikes": 77, "categoryTitle": "Algorithms", "frontendQuestionId": "2227", "paidOnly": false, "title": "Encrypt and Decrypt Strings", "titleSlug": "encrypt-and-decrypt-strings", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13178, "totalSubmissionRaw": 32490}, "2228": {"acRate": 44.86685915944818, "difficulty": "Medium", "likes": 62, "dislikes": 9, "categoryTitle": "Database", "frontendQuestionId": "2228", "paidOnly": true, "title": "Users With Two Purchases Within Seven Days", "titleSlug": "users-with-two-purchases-within-seven-days", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8391, "totalSubmissionRaw": 18702}, "2229": {"acRate": 61.17695136902329, "difficulty": "Easy", "likes": 81, "dislikes": 10, "categoryTitle": "Algorithms", "frontendQuestionId": "2229", "paidOnly": true, "title": "Check if an Array Is Consecutive", "titleSlug": "check-if-an-array-is-consecutive", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5988, "totalSubmissionRaw": 9788}, "2230": {"acRate": 49.94521548575603, "difficulty": "Easy", "likes": 20, "dislikes": 44, "categoryTitle": "Database", "frontendQuestionId": "2230", "paidOnly": true, "title": "The Users That Are Eligible for Discount", "titleSlug": "the-users-that-are-eligible-for-discount", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5470, "totalSubmissionRaw": 10952}, "2231": {"acRate": 61.94061520349354, "difficulty": "Easy", "likes": 616, "dislikes": 297, "categoryTitle": "Algorithms", "frontendQuestionId": "2231", "paidOnly": false, "title": "Largest Number After Digit Swaps by Parity", "titleSlug": "largest-number-after-digit-swaps-by-parity", "topicTags": [{"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 45247, "totalSubmissionRaw": 73049}, "2232": {"acRate": 67.57831133725553, "difficulty": "Medium", "likes": 206, "dislikes": 333, "categoryTitle": "Algorithms", "frontendQuestionId": "2232", "paidOnly": false, "title": "Minimize Result by Adding Parentheses to Expression", "titleSlug": "minimize-result-by-adding-parentheses-to-expression", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21250, "totalSubmissionRaw": 31445}, "2233": {"acRate": 41.70661553211889, "difficulty": "Medium", "likes": 736, "dislikes": 45, "categoryTitle": "Algorithms", "frontendQuestionId": "2233", "paidOnly": false, "title": "Maximum Product After K Increments", "titleSlug": "maximum-product-after-k-increments", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33495, "totalSubmissionRaw": 80311}, "2234": {"acRate": 29.548083443021817, "difficulty": "Hard", "likes": 432, "dislikes": 38, "categoryTitle": "Algorithms", "frontendQuestionId": "2234", "paidOnly": false, "title": "Maximum Total Beauty of the Gardens", "titleSlug": "maximum-total-beauty-of-the-gardens", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7408, "totalSubmissionRaw": 25071}, "2235": {"acRate": 87.91556497394821, "difficulty": "Easy", "likes": 1637, "dislikes": 3116, "categoryTitle": "Algorithms", "frontendQuestionId": "2235", "paidOnly": false, "title": "Add Two Integers", "titleSlug": "add-two-integers", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 542636, "totalSubmissionRaw": 617224}, "2236": {"acRate": 84.58485273492286, "difficulty": "Easy", "likes": 1270, "dislikes": 1534, "categoryTitle": "Algorithms", "frontendQuestionId": "2236", "paidOnly": false, "title": "Root Equals Sum of Children", "titleSlug": "root-equals-sum-of-children", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 241236, "totalSubmissionRaw": 285199}, "2237": {"acRate": 63.57927786499214, "difficulty": "Medium", "likes": 77, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "2237", "paidOnly": true, "title": "Count Positions on Street With Required Brightness", "titleSlug": "count-positions-on-street-with-required-brightness", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3240, "totalSubmissionRaw": 5096}, "2238": {"acRate": 71.4500044126732, "difficulty": "Medium", "likes": 67, "dislikes": 5, "categoryTitle": "Database", "frontendQuestionId": "2238", "paidOnly": true, "title": "Number of Times a Driver Was a Passenger", "titleSlug": "number-of-times-a-driver-was-a-passenger", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8096, "totalSubmissionRaw": 11331}, "2239": {"acRate": 45.69156354459522, "difficulty": "Easy", "likes": 582, "dislikes": 39, "categoryTitle": "Algorithms", "frontendQuestionId": "2239", "paidOnly": false, "title": "Find Closest Number to Zero", "titleSlug": "find-closest-number-to-zero", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 82554, "totalSubmissionRaw": 180672}, "2240": {"acRate": 57.20333857505746, "difficulty": "Medium", "likes": 447, "dislikes": 34, "categoryTitle": "Algorithms", "frontendQuestionId": "2240", "paidOnly": false, "title": "Number of Ways to Buy Pens and Pencils", "titleSlug": "number-of-ways-to-buy-pens-and-pencils", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28374, "totalSubmissionRaw": 49602}, "2241": {"acRate": 42.07487918163185, "difficulty": "Medium", "likes": 262, "dislikes": 347, "categoryTitle": "Algorithms", "frontendQuestionId": "2241", "paidOnly": false, "title": "Design an ATM Machine", "titleSlug": "design-an-atm-machine", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22375, "totalSubmissionRaw": 53179}, "2242": {"acRate": 38.696102754137485, "difficulty": "Hard", "likes": 520, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "2242", "paidOnly": false, "title": "Maximum Score of a Node Sequence", "titleSlug": "maximum-score-of-a-node-sequence", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12322, "totalSubmissionRaw": 31843}, "2243": {"acRate": 66.19269949066215, "difficulty": "Easy", "likes": 545, "dislikes": 45, "categoryTitle": "Algorithms", "frontendQuestionId": "2243", "paidOnly": false, "title": "Calculate Digit Sum of a String", "titleSlug": "calculate-digit-sum-of-a-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 40547, "totalSubmissionRaw": 61255}, "2244": {"acRate": 62.91136842798788, "difficulty": "Medium", "likes": 2772, "dislikes": 83, "categoryTitle": "Algorithms", "frontendQuestionId": "2244", "paidOnly": false, "title": "Minimum Rounds to Complete All Tasks", "titleSlug": "minimum-rounds-to-complete-all-tasks", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 152779, "totalSubmissionRaw": 242848}, "2245": {"acRate": 36.35393508225878, "difficulty": "Medium", "likes": 186, "dislikes": 401, "categoryTitle": "Algorithms", "frontendQuestionId": "2245", "paidOnly": false, "title": "Maximum Trailing Zeros in a Cornered Path", "titleSlug": "maximum-trailing-zeros-in-a-cornered-path", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8176, "totalSubmissionRaw": 22490}, "2246": {"acRate": 54.401982522499026, "difficulty": "Hard", "likes": 2377, "dislikes": 61, "categoryTitle": "Algorithms", "frontendQuestionId": "2246", "paidOnly": false, "title": "Longest Path With Different Adjacent Characters", "titleSlug": "longest-path-with-different-adjacent-characters", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 75078, "totalSubmissionRaw": 138006}, "2247": {"acRate": 49.972572682391665, "difficulty": "Hard", "likes": 59, "dislikes": 0, "categoryTitle": "Algorithms", "frontendQuestionId": "2247", "paidOnly": true, "title": "Maximum Cost of Trip With K Highways", "titleSlug": "maximum-cost-of-trip-with-k-highways", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1822, "totalSubmissionRaw": 3646}, "2248": {"acRate": 68.22669481436803, "difficulty": "Easy", "likes": 715, "dislikes": 41, "categoryTitle": "Algorithms", "frontendQuestionId": "2248", "paidOnly": false, "title": "Intersection of Multiple Arrays", "titleSlug": "intersection-of-multiple-arrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 85967, "totalSubmissionRaw": 126002}, "2249": {"acRate": 53.26669349202652, "difficulty": "Medium", "likes": 234, "dislikes": 220, "categoryTitle": "Algorithms", "frontendQuestionId": "2249", "paidOnly": false, "title": "Count Lattice Points Inside a Circle", "titleSlug": "count-lattice-points-inside-a-circle", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25152, "totalSubmissionRaw": 47219}, "2250": {"acRate": 35.21495404146573, "difficulty": "Medium", "likes": 505, "dislikes": 136, "categoryTitle": "Algorithms", "frontendQuestionId": "2250", "paidOnly": false, "title": "Count Number of Rectangles Containing Each Point", "titleSlug": "count-number-of-rectangles-containing-each-point", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17087, "totalSubmissionRaw": 48522}, "2251": {"acRate": 56.70211587459843, "difficulty": "Hard", "likes": 1653, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "2251", "paidOnly": false, "title": "Number of Flowers in Full Bloom", "titleSlug": "number-of-flowers-in-full-bloom", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 81896, "totalSubmissionRaw": 144432}, "2252": {"acRate": 55.65674255691769, "difficulty": "Hard", "likes": 30, "dislikes": 10, "categoryTitle": "Database", "frontendQuestionId": "2252", "paidOnly": true, "title": "Dynamic Pivoting of a Table", "titleSlug": "dynamic-pivoting-of-a-table", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1587, "totalSubmissionRaw": 2851}, "2253": {"acRate": 66.62020905923345, "difficulty": "Hard", "likes": 16, "dislikes": 13, "categoryTitle": "Database", "frontendQuestionId": "2253", "paidOnly": true, "title": "Dynamic Unpivoting of a Table", "titleSlug": "dynamic-unpivoting-of-a-table", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 956, "totalSubmissionRaw": 1435}, "2254": {"acRate": 64.05454545454545, "difficulty": "Hard", "likes": 81, "dislikes": 10, "categoryTitle": "Algorithms", "frontendQuestionId": "2254", "paidOnly": true, "title": "Design Video Sharing Platform", "titleSlug": "design-video-sharing-platform", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3523, "totalSubmissionRaw": 5500}, "2255": {"acRate": 72.65083963246278, "difficulty": "Easy", "likes": 539, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "2255", "paidOnly": false, "title": "Count Prefixes of a Given String", "titleSlug": "count-prefixes-of-a-given-string", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 64203, "totalSubmissionRaw": 88372}, "2256": {"acRate": 43.213972924955584, "difficulty": "Medium", "likes": 1508, "dislikes": 178, "categoryTitle": "Algorithms", "frontendQuestionId": "2256", "paidOnly": false, "title": "Minimum Average Difference", "titleSlug": "minimum-average-difference", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 86348, "totalSubmissionRaw": 199815}, "2257": {"acRate": 52.60065557548395, "difficulty": "Medium", "likes": 420, "dislikes": 37, "categoryTitle": "Algorithms", "frontendQuestionId": "2257", "paidOnly": false, "title": "Count Unguarded Cells in the Grid", "titleSlug": "count-unguarded-cells-in-the-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17010, "totalSubmissionRaw": 32338}, "2258": {"acRate": 35.093546224632824, "difficulty": "Hard", "likes": 732, "dislikes": 34, "categoryTitle": "Algorithms", "frontendQuestionId": "2258", "paidOnly": false, "title": "Escape the Spreading Fire", "titleSlug": "escape-the-spreading-fire", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11517, "totalSubmissionRaw": 32818}, "2259": {"acRate": 45.75525291628751, "difficulty": "Easy", "likes": 827, "dislikes": 54, "categoryTitle": "Algorithms", "frontendQuestionId": "2259", "paidOnly": false, "title": "Remove Digit From Number to Maximize Result", "titleSlug": "remove-digit-from-number-to-maximize-result", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 88999, "totalSubmissionRaw": 194511}, "2260": {"acRate": 51.50204885317439, "difficulty": "Medium", "likes": 956, "dislikes": 36, "categoryTitle": "Algorithms", "frontendQuestionId": "2260", "paidOnly": false, "title": "Minimum Consecutive Cards to Pick Up", "titleSlug": "minimum-consecutive-cards-to-pick-up", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 77422, "totalSubmissionRaw": 150328}, "2261": {"acRate": 52.066262914143216, "difficulty": "Medium", "likes": 667, "dislikes": 153, "categoryTitle": "Algorithms", "frontendQuestionId": "2261", "paidOnly": false, "title": "K Divisible Elements Subarrays", "titleSlug": "k-divisible-elements-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 35076, "totalSubmissionRaw": 67368}, "2262": {"acRate": 55.71396206874232, "difficulty": "Hard", "likes": 1112, "dislikes": 32, "categoryTitle": "Algorithms", "frontendQuestionId": "2262", "paidOnly": false, "title": "Total Appeal of A String", "titleSlug": "total-appeal-of-a-string", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34428, "totalSubmissionRaw": 61795}, "2263": {"acRate": 66.06104651162791, "difficulty": "Hard", "likes": 83, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "2263", "paidOnly": true, "title": "Make Array Non-decreasing or Non-increasing", "titleSlug": "make-array-non-decreasing-or-non-increasing", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3636, "totalSubmissionRaw": 5504}, "2264": {"acRate": 68.97991418846209, "difficulty": "Easy", "likes": 998, "dislikes": 48, "categoryTitle": "Algorithms", "frontendQuestionId": "2264", "paidOnly": false, "title": "Largest 3-Same-Digit Number in String", "titleSlug": "largest-3-same-digit-number-in-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 149356, "totalSubmissionRaw": 216521}, "2265": {"acRate": 86.33816677949132, "difficulty": "Medium", "likes": 2193, "dislikes": 54, "categoryTitle": "Algorithms", "frontendQuestionId": "2265", "paidOnly": false, "title": "Count Nodes Equal to Average of Subtree", "titleSlug": "count-nodes-equal-to-average-of-subtree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 151773, "totalSubmissionRaw": 175789}, "2266": {"acRate": 47.81789282470481, "difficulty": "Medium", "likes": 872, "dislikes": 30, "categoryTitle": "Algorithms", "frontendQuestionId": "2266", "paidOnly": false, "title": "Count Number of Texts", "titleSlug": "count-number-of-texts", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21059, "totalSubmissionRaw": 44040}, "2267": {"acRate": 38.915186414210424, "difficulty": "Hard", "likes": 515, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "2267", "paidOnly": false, "title": " Check if There Is a Valid Parentheses String Path", "titleSlug": "check-if-there-is-a-valid-parentheses-string-path", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15949, "totalSubmissionRaw": 40984}, "2268": {"acRate": 71.28633256864461, "difficulty": "Medium", "likes": 244, "dislikes": 37, "categoryTitle": "Algorithms", "frontendQuestionId": "2268", "paidOnly": true, "title": "Minimum Number of Keypresses", "titleSlug": "minimum-number-of-keypresses", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30142, "totalSubmissionRaw": 42283}, "2269": {"acRate": 60.21224029258423, "difficulty": "Easy", "likes": 657, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "2269", "paidOnly": false, "title": "Find the K-Beauty of a Number", "titleSlug": "find-the-k-beauty-of-a-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 61903, "totalSubmissionRaw": 102808}, "2270": {"acRate": 48.04371754817047, "difficulty": "Medium", "likes": 567, "dislikes": 52, "categoryTitle": "Algorithms", "frontendQuestionId": "2270", "paidOnly": false, "title": "Number of Ways to Split Array", "titleSlug": "number-of-ways-to-split-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 43211, "totalSubmissionRaw": 89941}, "2271": {"acRate": 33.80559866180294, "difficulty": "Medium", "likes": 774, "dislikes": 49, "categoryTitle": "Algorithms", "frontendQuestionId": "2271", "paidOnly": false, "title": "Maximum White Tiles Covered by a Carpet", "titleSlug": "maximum-white-tiles-covered-by-a-carpet", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16774, "totalSubmissionRaw": 49619}, "2272": {"acRate": 46.21522232213558, "difficulty": "Hard", "likes": 1850, "dislikes": 205, "categoryTitle": "Algorithms", "frontendQuestionId": "2272", "paidOnly": false, "title": "Substring With Largest Variance", "titleSlug": "substring-with-largest-variance", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 68868, "totalSubmissionRaw": 149017}, "2273": {"acRate": 58.42795082042815, "difficulty": "Easy", "likes": 673, "dislikes": 185, "categoryTitle": "Algorithms", "frontendQuestionId": "2273", "paidOnly": false, "title": "Find Resultant Array After Removing Anagrams", "titleSlug": "find-resultant-array-after-removing-anagrams", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 63347, "totalSubmissionRaw": 108419}, "2274": {"acRate": 51.78523532288857, "difficulty": "Medium", "likes": 406, "dislikes": 35, "categoryTitle": "Algorithms", "frontendQuestionId": "2274", "paidOnly": false, "title": "Maximum Consecutive Floors Without Special Floors", "titleSlug": "maximum-consecutive-floors-without-special-floors", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 32822, "totalSubmissionRaw": 63381}, "2275": {"acRate": 72.97297297297297, "difficulty": "Medium", "likes": 563, "dislikes": 18, "categoryTitle": "Algorithms", "frontendQuestionId": "2275", "paidOnly": false, "title": "Largest Combination With Bitwise AND Greater Than Zero", "titleSlug": "largest-combination-with-bitwise-and-greater-than-zero", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28134, "totalSubmissionRaw": 38554}, "2276": {"acRate": 35.285990082144075, "difficulty": "Hard", "likes": 575, "dislikes": 59, "categoryTitle": "Algorithms", "frontendQuestionId": "2276", "paidOnly": false, "title": "Count Integers in Intervals", "titleSlug": "count-integers-in-intervals", "topicTags": [{"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18643, "totalSubmissionRaw": 52834}, "2277": {"acRate": 62.5233761376387, "difficulty": "Hard", "likes": 134, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "2277", "paidOnly": true, "title": "Closest Node to Path in Tree", "titleSlug": "closest-node-to-path-in-tree", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5015, "totalSubmissionRaw": 8021}, "2278": {"acRate": 74.11568108494484, "difficulty": "Easy", "likes": 520, "dislikes": 60, "categoryTitle": "Algorithms", "frontendQuestionId": "2278", "paidOnly": false, "title": "Percentage of Letter in String", "titleSlug": "percentage-of-letter-in-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 76729, "totalSubmissionRaw": 103526}, "2279": {"acRate": 67.50933378163504, "difficulty": "Medium", "likes": 1670, "dislikes": 70, "categoryTitle": "Algorithms", "frontendQuestionId": "2279", "paidOnly": false, "title": "Maximum Bags With Full Capacity of Rocks", "titleSlug": "maximum-bags-with-full-capacity-of-rocks", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 96377, "totalSubmissionRaw": 142761}, "2280": {"acRate": 25.355032947057488, "difficulty": "Medium", "likes": 341, "dislikes": 523, "categoryTitle": "Algorithms", "frontendQuestionId": "2280", "paidOnly": false, "title": "Minimum Lines to Represent a Line Chart", "titleSlug": "minimum-lines-to-represent-a-line-chart", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26781, "totalSubmissionRaw": 105624}, "2281": {"acRate": 27.88049433402222, "difficulty": "Hard", "likes": 1182, "dislikes": 101, "categoryTitle": "Algorithms", "frontendQuestionId": "2281", "paidOnly": false, "title": "Sum of Total Strength of Wizards", "titleSlug": "sum-of-total-strength-of-wizards", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 20101, "totalSubmissionRaw": 72097}, "2282": {"acRate": 48.25883575883576, "difficulty": "Medium", "likes": 63, "dislikes": 28, "categoryTitle": "Algorithms", "frontendQuestionId": "2282", "paidOnly": true, "title": "Number of People That Can Be Seen in a Grid", "titleSlug": "number-of-people-that-can-be-seen-in-a-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1857, "totalSubmissionRaw": 3848}, "2283": {"acRate": 72.36047032610406, "difficulty": "Easy", "likes": 599, "dislikes": 78, "categoryTitle": "Algorithms", "frontendQuestionId": "2283", "paidOnly": false, "title": "Check if Number Has Equal Digit Count and Digit Value", "titleSlug": "check-if-number-has-equal-digit-count-and-digit-value", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 59756, "totalSubmissionRaw": 82581}, "2284": {"acRate": 57.07151188579126, "difficulty": "Medium", "likes": 432, "dislikes": 40, "categoryTitle": "Algorithms", "frontendQuestionId": "2284", "paidOnly": false, "title": "Sender With Largest Word Count", "titleSlug": "sender-with-largest-word-count", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34740, "totalSubmissionRaw": 60871}, "2285": {"acRate": 69.33920447349706, "difficulty": "Medium", "likes": 1263, "dislikes": 76, "categoryTitle": "Algorithms", "frontendQuestionId": "2285", "paidOnly": false, "title": "Maximum Total Importance of Roads", "titleSlug": "maximum-total-importance-of-roads", "topicTags": [{"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 142352, "totalSubmissionRaw": 205298}, "2286": {"acRate": 17.910372226017866, "difficulty": "Hard", "likes": 331, "dislikes": 56, "categoryTitle": "Algorithms", "frontendQuestionId": "2286", "paidOnly": false, "title": "Booking Concert Tickets in Groups", "titleSlug": "booking-concert-tickets-in-groups", "topicTags": [{"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7078, "totalSubmissionRaw": 39519}, "2287": {"acRate": 59.29109700405775, "difficulty": "Easy", "likes": 473, "dislikes": 35, "categoryTitle": "Algorithms", "frontendQuestionId": "2287", "paidOnly": false, "title": "Rearrange Characters to Make Target String", "titleSlug": "rearrange-characters-to-make-target-string", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 41936, "totalSubmissionRaw": 70729}, "2288": {"acRate": 31.171109764717762, "difficulty": "Medium", "likes": 199, "dislikes": 1102, "categoryTitle": "Algorithms", "frontendQuestionId": "2288", "paidOnly": false, "title": "Apply Discount to Prices", "titleSlug": "apply-discount-to-prices", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24695, "totalSubmissionRaw": 79224}, "2289": {"acRate": 22.069526245860352, "difficulty": "Medium", "likes": 1334, "dislikes": 135, "categoryTitle": "Algorithms", "frontendQuestionId": "2289", "paidOnly": false, "title": "Steps to Make Array Non-decreasing", "titleSlug": "steps-to-make-array-non-decreasing", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22258, "totalSubmissionRaw": 100854}, "2290": {"acRate": 54.66717216058744, "difficulty": "Hard", "likes": 952, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2290", "paidOnly": false, "title": "Minimum Obstacle Removal to Reach Corner", "titleSlug": "minimum-obstacle-removal-to-reach-corner", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27397, "totalSubmissionRaw": 50116}, "2291": {"acRate": 45.42482088762802, "difficulty": "Medium", "likes": 158, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "2291", "paidOnly": true, "title": "Maximum Profit From Trading Stocks", "titleSlug": "maximum-profit-from-trading-stocks", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9446, "totalSubmissionRaw": 20796}, "2292": {"acRate": 39.36840960974019, "difficulty": "Medium", "likes": 60, "dislikes": 26, "categoryTitle": "Database", "frontendQuestionId": "2292", "paidOnly": true, "title": "Products With Three or More Orders in Two Consecutive Years", "titleSlug": "products-with-three-or-more-orders-in-two-consecutive-years", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7243, "totalSubmissionRaw": 18398}, "2293": {"acRate": 63.17344301121821, "difficulty": "Easy", "likes": 534, "dislikes": 27, "categoryTitle": "Algorithms", "frontendQuestionId": "2293", "paidOnly": false, "title": "Min Max Game", "titleSlug": "min-max-game", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 49612, "totalSubmissionRaw": 78533}, "2294": {"acRate": 74.01752993430497, "difficulty": "Medium", "likes": 767, "dislikes": 29, "categoryTitle": "Algorithms", "frontendQuestionId": "2294", "paidOnly": false, "title": "Partition Array Such That Maximum Difference Is K", "titleSlug": "partition-array-such-that-maximum-difference-is-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 43828, "totalSubmissionRaw": 59213}, "2295": {"acRate": 57.92813856945174, "difficulty": "Medium", "likes": 633, "dislikes": 36, "categoryTitle": "Algorithms", "frontendQuestionId": "2295", "paidOnly": false, "title": "Replace Elements in an Array", "titleSlug": "replace-elements-in-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 36420, "totalSubmissionRaw": 62871}, "2296": {"acRate": 45.287151633870536, "difficulty": "Hard", "likes": 572, "dislikes": 224, "categoryTitle": "Algorithms", "frontendQuestionId": "2296", "paidOnly": false, "title": "Design a Text Editor", "titleSlug": "design-a-text-editor", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}, {"name": "Doubly-Linked List", "id": "VG9waWNUYWdOb2RlOjYxMDU4", "slug": "doubly-linked-list"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25431, "totalSubmissionRaw": 56155}, "2297": {"acRate": 45.592569438242386, "difficulty": "Medium", "likes": 146, "dislikes": 41, "categoryTitle": "Algorithms", "frontendQuestionId": "2297", "paidOnly": true, "title": "Jump Game VIII", "titleSlug": "jump-game-viii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5105, "totalSubmissionRaw": 11197}, "2298": {"acRate": 81.45519077196096, "difficulty": "Medium", "likes": 47, "dislikes": 10, "categoryTitle": "Database", "frontendQuestionId": "2298", "paidOnly": true, "title": "Tasks Count in the Weekend", "titleSlug": "tasks-count-in-the-weekend", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6426, "totalSubmissionRaw": 7889}, "2299": {"acRate": 54.83879157146484, "difficulty": "Easy", "likes": 348, "dislikes": 41, "categoryTitle": "Algorithms", "frontendQuestionId": "2299", "paidOnly": false, "title": "Strong Password Checker II", "titleSlug": "strong-password-checker-ii", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 43202, "totalSubmissionRaw": 78780}, "2300": {"acRate": 43.49984713515604, "difficulty": "Medium", "likes": 2575, "dislikes": 78, "categoryTitle": "Algorithms", "frontendQuestionId": "2300", "paidOnly": false, "title": "Successful Pairs of Spells and Potions", "titleSlug": "successful-pairs-of-spells-and-potions", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 166471, "totalSubmissionRaw": 382693}, "2301": {"acRate": 41.081417029210684, "difficulty": "Hard", "likes": 380, "dislikes": 76, "categoryTitle": "Algorithms", "frontendQuestionId": "2301", "paidOnly": false, "title": "Match Substring After Replacement", "titleSlug": "match-substring-after-replacement", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14542, "totalSubmissionRaw": 35398}, "2302": {"acRate": 54.906201100620635, "difficulty": "Hard", "likes": 1039, "dislikes": 26, "categoryTitle": "Algorithms", "frontendQuestionId": "2302", "paidOnly": false, "title": "Count Subarrays With Score Less Than K", "titleSlug": "count-subarrays-with-score-less-than-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 31228, "totalSubmissionRaw": 56876}, "2303": {"acRate": 65.85536858974359, "difficulty": "Easy", "likes": 264, "dislikes": 278, "categoryTitle": "Algorithms", "frontendQuestionId": "2303", "paidOnly": false, "title": "Calculate Amount Paid in Taxes", "titleSlug": "calculate-amount-paid-in-taxes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 39450, "totalSubmissionRaw": 59904}, "2304": {"acRate": 66.86813186813187, "difficulty": "Medium", "likes": 886, "dislikes": 153, "categoryTitle": "Algorithms", "frontendQuestionId": "2304", "paidOnly": false, "title": "Minimum Path Cost in a Grid", "titleSlug": "minimum-path-cost-in-a-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 31642, "totalSubmissionRaw": 47320}, "2305": {"acRate": 69.23310158089946, "difficulty": "Medium", "likes": 2566, "dislikes": 117, "categoryTitle": "Algorithms", "frontendQuestionId": "2305", "paidOnly": false, "title": "Fair Distribution of Cookies", "titleSlug": "fair-distribution-of-cookies", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 98185, "totalSubmissionRaw": 141818}, "2306": {"acRate": 46.38418207940888, "difficulty": "Hard", "likes": 1944, "dislikes": 71, "categoryTitle": "Algorithms", "frontendQuestionId": "2306", "paidOnly": false, "title": "Naming a Company", "titleSlug": "naming-a-company", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 61017, "totalSubmissionRaw": 131547}, "2307": {"acRate": 43.362609786700126, "difficulty": "Hard", "likes": 60, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "2307", "paidOnly": true, "title": "Check for Contradictions in Equations", "titleSlug": "check-for-contradictions-in-equations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3456, "totalSubmissionRaw": 7970}, "2308": {"acRate": 69.26505886387015, "difficulty": "Medium", "likes": 79, "dislikes": 15, "categoryTitle": "Database", "frontendQuestionId": "2308", "paidOnly": true, "title": "Arrange Table by Gender", "titleSlug": "arrange-table-by-gender", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6060, "totalSubmissionRaw": 8749}, "2309": {"acRate": 70.1048381028818, "difficulty": "Easy", "likes": 481, "dislikes": 30, "categoryTitle": "Algorithms", "frontendQuestionId": "2309", "paidOnly": false, "title": "Greatest English Letter in Upper and Lower Case", "titleSlug": "greatest-english-letter-in-upper-and-lower-case", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 55903, "totalSubmissionRaw": 79742}, "2310": {"acRate": 26.822605088936747, "difficulty": "Medium", "likes": 405, "dislikes": 326, "categoryTitle": "Algorithms", "frontendQuestionId": "2310", "paidOnly": false, "title": "Sum of Numbers With Units Digit K", "titleSlug": "sum-of-numbers-with-units-digit-k", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26902, "totalSubmissionRaw": 100296}, "2311": {"acRate": 37.99197328926512, "difficulty": "Medium", "likes": 685, "dislikes": 50, "categoryTitle": "Algorithms", "frontendQuestionId": "2311", "paidOnly": false, "title": "Longest Binary Subsequence Less Than or Equal to K", "titleSlug": "longest-binary-subsequence-less-than-or-equal-to-k", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22530, "totalSubmissionRaw": 59302}, "2312": {"acRate": 50.13497705390084, "difficulty": "Hard", "likes": 545, "dislikes": 10, "categoryTitle": "Algorithms", "frontendQuestionId": "2312", "paidOnly": false, "title": "Selling Pieces of Wood", "titleSlug": "selling-pieces-of-wood", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11143, "totalSubmissionRaw": 22226}, "2313": {"acRate": 58.610220947883285, "difficulty": "Hard", "likes": 100, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "2313", "paidOnly": true, "title": "Minimum Flips in Binary Tree to Get Result", "titleSlug": "minimum-flips-in-binary-tree-to-get-result", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3475, "totalSubmissionRaw": 5929}, "2314": {"acRate": 71.8838789376158, "difficulty": "Medium", "likes": 52, "dislikes": 2, "categoryTitle": "Database", "frontendQuestionId": "2314", "paidOnly": true, "title": "The First Day of the Maximum Recorded Degree in Each City", "titleSlug": "the-first-day-of-the-maximum-recorded-degree-in-each-city", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5819, "totalSubmissionRaw": 8095}, "2315": {"acRate": 82.42689832547768, "difficulty": "Easy", "likes": 627, "dislikes": 104, "categoryTitle": "Algorithms", "frontendQuestionId": "2315", "paidOnly": false, "title": "Count Asterisks", "titleSlug": "count-asterisks", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 74670, "totalSubmissionRaw": 90589}, "2316": {"acRate": 49.19583927345689, "difficulty": "Medium", "likes": 2044, "dislikes": 49, "categoryTitle": "Algorithms", "frontendQuestionId": "2316", "paidOnly": false, "title": "Count Unreachable Pairs of Nodes in an Undirected Graph", "titleSlug": "count-unreachable-pairs-of-nodes-in-an-undirected-graph", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 93171, "totalSubmissionRaw": 189389}, "2317": {"acRate": 79.64206505667816, "difficulty": "Medium", "likes": 611, "dislikes": 168, "categoryTitle": "Algorithms", "frontendQuestionId": "2317", "paidOnly": false, "title": "Maximum XOR After Operations ", "titleSlug": "maximum-xor-after-operations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25855, "totalSubmissionRaw": 32464}, "2318": {"acRate": 57.3051696534628, "difficulty": "Hard", "likes": 438, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "2318", "paidOnly": false, "title": "Number of Distinct Roll Sequences", "titleSlug": "number-of-distinct-roll-sequences", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11096, "totalSubmissionRaw": 19363}, "2319": {"acRate": 65.20382219330273, "difficulty": "Easy", "likes": 491, "dislikes": 23, "categoryTitle": "Algorithms", "frontendQuestionId": "2319", "paidOnly": false, "title": "Check if Matrix Is X-Matrix", "titleSlug": "check-if-matrix-is-x-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 54112, "totalSubmissionRaw": 82989}, "2320": {"acRate": 41.98062108810785, "difficulty": "Medium", "likes": 581, "dislikes": 193, "categoryTitle": "Algorithms", "frontendQuestionId": "2320", "paidOnly": false, "title": "Count Number of Ways to Place Houses", "titleSlug": "count-number-of-ways-to-place-houses", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27902, "totalSubmissionRaw": 66464}, "2321": {"acRate": 56.896046852122986, "difficulty": "Hard", "likes": 787, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "2321", "paidOnly": false, "title": "Maximum Score Of Spliced Array", "titleSlug": "maximum-score-of-spliced-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19430, "totalSubmissionRaw": 34150}, "2322": {"acRate": 52.45534150612959, "difficulty": "Hard", "likes": 453, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2322", "paidOnly": false, "title": "Minimum Score After Removals on a Tree", "titleSlug": "minimum-score-after-removals-on-a-tree", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7488, "totalSubmissionRaw": 14275}, "2323": {"acRate": 65.84871854794734, "difficulty": "Medium", "likes": 63, "dislikes": 18, "categoryTitle": "Algorithms", "frontendQuestionId": "2323", "paidOnly": true, "title": "Find Minimum Time to Finish All Jobs II", "titleSlug": "find-minimum-time-to-finish-all-jobs-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8453, "totalSubmissionRaw": 12837}, "2324": {"acRate": 74.4556765163297, "difficulty": "Medium", "likes": 49, "dislikes": 1, "categoryTitle": "Database", "frontendQuestionId": "2324", "paidOnly": true, "title": "Product Sales Analysis IV", "titleSlug": "product-sales-analysis-iv", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7660, "totalSubmissionRaw": 10288}, "2325": {"acRate": 84.5755380039297, "difficulty": "Easy", "likes": 995, "dislikes": 101, "categoryTitle": "Algorithms", "frontendQuestionId": "2325", "paidOnly": false, "title": "Decode the Message", "titleSlug": "decode-the-message", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 108902, "totalSubmissionRaw": 128763}, "2326": {"acRate": 75.74491552332091, "difficulty": "Medium", "likes": 768, "dislikes": 27, "categoryTitle": "Algorithms", "frontendQuestionId": "2326", "paidOnly": false, "title": "Spiral Matrix IV", "titleSlug": "spiral-matrix-iv", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 45325, "totalSubmissionRaw": 59839}, "2327": {"acRate": 45.97251703720255, "difficulty": "Medium", "likes": 849, "dislikes": 117, "categoryTitle": "Algorithms", "frontendQuestionId": "2327", "paidOnly": false, "title": "Number of People Aware of a Secret", "titleSlug": "number-of-people-aware-of-a-secret", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24690, "totalSubmissionRaw": 53706}, "2328": {"acRate": 58.199568355027985, "difficulty": "Hard", "likes": 1979, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "2328", "paidOnly": false, "title": "Number of Increasing Paths in a Grid", "titleSlug": "number-of-increasing-paths-in-a-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 69034, "totalSubmissionRaw": 118616}, "2329": {"acRate": 69.80377569050498, "difficulty": "Easy", "likes": 32, "dislikes": 7, "categoryTitle": "Database", "frontendQuestionId": "2329", "paidOnly": true, "title": "Product Sales Analysis V", "titleSlug": "product-sales-analysis-v", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7506, "totalSubmissionRaw": 10753}, "2330": {"acRate": 76.07278330962541, "difficulty": "Medium", "likes": 102, "dislikes": 33, "categoryTitle": "Algorithms", "frontendQuestionId": "2330", "paidOnly": true, "title": "Valid Palindrome IV", "titleSlug": "valid-palindrome-iv", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12834, "totalSubmissionRaw": 16871}, "2331": {"acRate": 82.79623009424765, "difficulty": "Easy", "likes": 1433, "dislikes": 38, "categoryTitle": "Algorithms", "frontendQuestionId": "2331", "paidOnly": false, "title": "Evaluate Boolean Binary Tree", "titleSlug": "evaluate-boolean-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 191073, "totalSubmissionRaw": 230775}, "2332": {"acRate": 27.435324527392606, "difficulty": "Medium", "likes": 461, "dislikes": 743, "categoryTitle": "Algorithms", "frontendQuestionId": "2332", "paidOnly": false, "title": "The Latest Time to Catch a Bus", "titleSlug": "the-latest-time-to-catch-a-bus", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25049, "totalSubmissionRaw": 91302}, "2333": {"acRate": 25.506951984029698, "difficulty": "Medium", "likes": 627, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "2333", "paidOnly": false, "title": "Minimum Sum of Squared Difference", "titleSlug": "minimum-sum-of-squared-difference", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14566, "totalSubmissionRaw": 57106}, "2334": {"acRate": 43.076285240464344, "difficulty": "Hard", "likes": 547, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "2334", "paidOnly": false, "title": "Subarray With Elements Greater Than Varying Threshold", "titleSlug": "subarray-with-elements-greater-than-varying-threshold", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9351, "totalSubmissionRaw": 21706}, "2335": {"acRate": 57.9251977321216, "difficulty": "Easy", "likes": 692, "dislikes": 81, "categoryTitle": "Algorithms", "frontendQuestionId": "2335", "paidOnly": false, "title": "Minimum Amount of Time to Fill Cups", "titleSlug": "minimum-amount-of-time-to-fill-cups", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 49142, "totalSubmissionRaw": 84837}, "2336": {"acRate": 71.60633647021561, "difficulty": "Medium", "likes": 1672, "dislikes": 195, "categoryTitle": "Algorithms", "frontendQuestionId": "2336", "paidOnly": false, "title": "Smallest Number in Infinite Set", "titleSlug": "smallest-number-in-infinite-set", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 149214, "totalSubmissionRaw": 208381}, "2337": {"acRate": 47.66559673183542, "difficulty": "Medium", "likes": 656, "dislikes": 45, "categoryTitle": "Algorithms", "frontendQuestionId": "2337", "paidOnly": false, "title": "Move Pieces to Obtain a String", "titleSlug": "move-pieces-to-obtain-a-string", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26136, "totalSubmissionRaw": 54832}, "2338": {"acRate": 26.87783958218335, "difficulty": "Hard", "likes": 483, "dislikes": 28, "categoryTitle": "Algorithms", "frontendQuestionId": "2338", "paidOnly": false, "title": "Count the Number of Ideal Arrays", "titleSlug": "count-the-number-of-ideal-arrays", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6330, "totalSubmissionRaw": 23551}, "2339": {"acRate": 87.74483570587606, "difficulty": "Easy", "likes": 42, "dislikes": 4, "categoryTitle": "Database", "frontendQuestionId": "2339", "paidOnly": true, "title": "All the Matches of the League", "titleSlug": "all-the-matches-of-the-league", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8198, "totalSubmissionRaw": 9343}, "2340": {"acRate": 72.48969928748663, "difficulty": "Medium", "likes": 176, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "2340", "paidOnly": true, "title": "Minimum Adjacent Swaps to Make a Valid Array", "titleSlug": "minimum-adjacent-swaps-to-make-a-valid-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 31833, "totalSubmissionRaw": 43905}, "2341": {"acRate": 75.34691030532335, "difficulty": "Easy", "likes": 677, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "2341", "paidOnly": false, "title": "Maximum Number of Pairs in Array", "titleSlug": "maximum-number-of-pairs-in-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 71294, "totalSubmissionRaw": 94621}, "2342": {"acRate": 55.136646723932394, "difficulty": "Medium", "likes": 700, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "2342", "paidOnly": false, "title": "Max Sum of a Pair With Equal Sum of Digits", "titleSlug": "max-sum-of-a-pair-with-equal-sum-of-digits", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 49489, "totalSubmissionRaw": 89757}, "2343": {"acRate": 44.25735219145558, "difficulty": "Medium", "likes": 311, "dislikes": 430, "categoryTitle": "Algorithms", "frontendQuestionId": "2343", "paidOnly": false, "title": "Query Kth Smallest Trimmed Number", "titleSlug": "query-kth-smallest-trimmed-number", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Radix Sort", "id": "VG9waWNUYWdOb2RlOjYxMDYx", "slug": "radix-sort"}, {"name": "Quickselect", "id": "VG9waWNUYWdOb2RlOjYxMDY5", "slug": "quickselect"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30384, "totalSubmissionRaw": 68653}, "2344": {"acRate": 56.28772040550669, "difficulty": "Hard", "likes": 546, "dislikes": 127, "categoryTitle": "Algorithms", "frontendQuestionId": "2344", "paidOnly": false, "title": "Minimum Deletions to Make Array Divisible", "titleSlug": "minimum-deletions-to-make-array-divisible", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28539, "totalSubmissionRaw": 50702}, "2345": {"acRate": 37.72655212305583, "difficulty": "Medium", "likes": 156, "dislikes": 71, "categoryTitle": "Algorithms", "frontendQuestionId": "2345", "paidOnly": true, "title": "Finding the Number of Visible Mountains", "titleSlug": "finding-the-number-of-visible-mountains", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8805, "totalSubmissionRaw": 23339}, "2346": {"acRate": 33.60238757376382, "difficulty": "Medium", "likes": 26, "dislikes": 74, "categoryTitle": "Database", "frontendQuestionId": "2346", "paidOnly": true, "title": "Compute the Rank as a Percentage", "titleSlug": "compute-the-rank-as-a-percentage", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4954, "totalSubmissionRaw": 14743}, "2347": {"acRate": 60.67988343214804, "difficulty": "Easy", "likes": 371, "dislikes": 37, "categoryTitle": "Algorithms", "frontendQuestionId": "2347", "paidOnly": false, "title": "Best Poker Hand", "titleSlug": "best-poker-hand", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 42269, "totalSubmissionRaw": 69659}, "2348": {"acRate": 66.7409944959111, "difficulty": "Medium", "likes": 2259, "dislikes": 83, "categoryTitle": "Algorithms", "frontendQuestionId": "2348", "paidOnly": false, "title": "Number of Zero-Filled Subarrays", "titleSlug": "number-of-zero-filled-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 127805, "totalSubmissionRaw": 191494}, "2349": {"acRate": 44.813862705893555, "difficulty": "Medium", "likes": 398, "dislikes": 31, "categoryTitle": "Algorithms", "frontendQuestionId": "2349", "paidOnly": false, "title": "Design a Number Container System", "titleSlug": "design-a-number-container-system", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23534, "totalSubmissionRaw": 52515}, "2350": {"acRate": 68.61601937393488, "difficulty": "Hard", "likes": 641, "dislikes": 51, "categoryTitle": "Algorithms", "frontendQuestionId": "2350", "paidOnly": false, "title": "Shortest Impossible Sequence of Rolls", "titleSlug": "shortest-impossible-sequence-of-rolls", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15300, "totalSubmissionRaw": 22298}, "2351": {"acRate": 73.63802816077498, "difficulty": "Easy", "likes": 1034, "dislikes": 60, "categoryTitle": "Algorithms", "frontendQuestionId": "2351", "paidOnly": false, "title": "First Letter to Appear Twice", "titleSlug": "first-letter-to-appear-twice", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 125882, "totalSubmissionRaw": 170947}, "2352": {"acRate": 70.41924819540736, "difficulty": "Medium", "likes": 2216, "dislikes": 156, "categoryTitle": "Algorithms", "frontendQuestionId": "2352", "paidOnly": false, "title": "Equal Row and Column Pairs", "titleSlug": "equal-row-and-column-pairs", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 236859, "totalSubmissionRaw": 336355}, "2353": {"acRate": 45.21958989929227, "difficulty": "Medium", "likes": 1489, "dislikes": 293, "categoryTitle": "Algorithms", "frontendQuestionId": "2353", "paidOnly": false, "title": "Design a Food Rating System", "titleSlug": "design-a-food-rating-system", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 84595, "totalSubmissionRaw": 187076}, "2354": {"acRate": 47.559644472165914, "difficulty": "Hard", "likes": 590, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "2354", "paidOnly": false, "title": "Number of Excellent Pairs", "titleSlug": "number-of-excellent-pairs", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15250, "totalSubmissionRaw": 32065}, "2355": {"acRate": 40.203607787104836, "difficulty": "Hard", "likes": 284, "dislikes": 33, "categoryTitle": "Algorithms", "frontendQuestionId": "2355", "paidOnly": true, "title": "Maximum Number of Books You Can Take", "titleSlug": "maximum-number-of-books-you-can-take", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 11255, "totalSubmissionRaw": 27995}, "2356": {"acRate": 88.55076935110307, "difficulty": "Easy", "likes": 464, "dislikes": 36, "categoryTitle": "Database", "frontendQuestionId": "2356", "paidOnly": false, "title": "Number of Unique Subjects Taught by Each Teacher", "titleSlug": "number-of-unique-subjects-taught-by-each-teacher", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 203779, "totalSubmissionRaw": 230127}, "2357": {"acRate": 72.44817188088956, "difficulty": "Easy", "likes": 1173, "dislikes": 54, "categoryTitle": "Algorithms", "frontendQuestionId": "2357", "paidOnly": false, "title": "Make Array Zero by Subtracting Equal Amounts", "titleSlug": "make-array-zero-by-subtracting-equal-amounts", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 115323, "totalSubmissionRaw": 159180}, "2358": {"acRate": 68.09506087511298, "difficulty": "Medium", "likes": 669, "dislikes": 115, "categoryTitle": "Algorithms", "frontendQuestionId": "2358", "paidOnly": false, "title": "Maximum Number of Groups Entering a Competition", "titleSlug": "maximum-number-of-groups-entering-a-competition", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 38424, "totalSubmissionRaw": 56427}, "2359": {"acRate": 45.483809336336215, "difficulty": "Medium", "likes": 1684, "dislikes": 403, "categoryTitle": "Algorithms", "frontendQuestionId": "2359", "paidOnly": false, "title": "Find Closest Node to Given Two Nodes", "titleSlug": "find-closest-node-to-given-two-nodes", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 78561, "totalSubmissionRaw": 172723}, "2360": {"acRate": 49.81682373653687, "difficulty": "Hard", "likes": 2331, "dislikes": 46, "categoryTitle": "Algorithms", "frontendQuestionId": "2360", "paidOnly": false, "title": "Longest Cycle in a Graph", "titleSlug": "longest-cycle-in-a-graph", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 76965, "totalSubmissionRaw": 154496}, "2361": {"acRate": 78.62239491345814, "difficulty": "Hard", "likes": 183, "dislikes": 31, "categoryTitle": "Algorithms", "frontendQuestionId": "2361", "paidOnly": true, "title": "Minimum Costs Using the Train Line", "titleSlug": "minimum-costs-using-the-train-line", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 11129, "totalSubmissionRaw": 14155}, "2362": {"acRate": 74.55312311709179, "difficulty": "Hard", "likes": 32, "dislikes": 28, "categoryTitle": "Database", "frontendQuestionId": "2362", "paidOnly": true, "title": "Generate the Invoice", "titleSlug": "generate-the-invoice", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3712, "totalSubmissionRaw": 4979}, "2363": {"acRate": 75.66619468575, "difficulty": "Easy", "likes": 557, "dislikes": 27, "categoryTitle": "Algorithms", "frontendQuestionId": "2363", "paidOnly": false, "title": "Merge Similar Items", "titleSlug": "merge-similar-items", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 59317, "totalSubmissionRaw": 78393}, "2364": {"acRate": 41.77724216668781, "difficulty": "Medium", "likes": 985, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "2364", "paidOnly": false, "title": "Count Number of Bad Pairs", "titleSlug": "count-number-of-bad-pairs", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 32933, "totalSubmissionRaw": 78830}, "2365": {"acRate": 52.622746787117705, "difficulty": "Medium", "likes": 556, "dislikes": 60, "categoryTitle": "Algorithms", "frontendQuestionId": "2365", "paidOnly": false, "title": "Task Scheduler II", "titleSlug": "task-scheduler-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 37630, "totalSubmissionRaw": 71509}, "2366": {"acRate": 53.54032290372982, "difficulty": "Hard", "likes": 1998, "dislikes": 67, "categoryTitle": "Algorithms", "frontendQuestionId": "2366", "paidOnly": false, "title": "Minimum Replacements to Sort the Array", "titleSlug": "minimum-replacements-to-sort-the-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 66821, "totalSubmissionRaw": 124805}, "2367": {"acRate": 84.40547519366241, "difficulty": "Easy", "likes": 1261, "dislikes": 80, "categoryTitle": "Algorithms", "frontendQuestionId": "2367", "paidOnly": false, "title": "Number of Arithmetic Triplets", "titleSlug": "number-of-arithmetic-triplets", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 134674, "totalSubmissionRaw": 159556}, "2368": {"acRate": 58.95149859282237, "difficulty": "Medium", "likes": 705, "dislikes": 31, "categoryTitle": "Algorithms", "frontendQuestionId": "2368", "paidOnly": false, "title": "Reachable Nodes With Restrictions", "titleSlug": "reachable-nodes-with-restrictions", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 57394, "totalSubmissionRaw": 97358}, "2369": {"acRate": 51.839040835762994, "difficulty": "Medium", "likes": 1991, "dislikes": 196, "categoryTitle": "Algorithms", "frontendQuestionId": "2369", "paidOnly": false, "title": "Check if There is a Valid Partition For The Array", "titleSlug": "check-if-there-is-a-valid-partition-for-the-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 88722, "totalSubmissionRaw": 171149}, "2370": {"acRate": 47.31175690799391, "difficulty": "Medium", "likes": 1451, "dislikes": 79, "categoryTitle": "Algorithms", "frontendQuestionId": "2370", "paidOnly": false, "title": "Longest Ideal Subsequence", "titleSlug": "longest-ideal-subsequence", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 114564, "totalSubmissionRaw": 242147}, "2371": {"acRate": 66.2767600971088, "difficulty": "Hard", "likes": 99, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "2371", "paidOnly": true, "title": "Minimize Maximum Value in a Grid", "titleSlug": "minimize-maximum-value-in-a-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3003, "totalSubmissionRaw": 4529}, "2372": {"acRate": 83.12387791741472, "difficulty": "Medium", "likes": 37, "dislikes": 4, "categoryTitle": "Database", "frontendQuestionId": "2372", "paidOnly": true, "title": "Calculate the Influence of Each Salesperson", "titleSlug": "calculate-the-influence-of-each-salesperson", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5556, "totalSubmissionRaw": 6684}, "2373": {"acRate": 88.0043187030999, "difficulty": "Easy", "likes": 1207, "dislikes": 160, "categoryTitle": "Algorithms", "frontendQuestionId": "2373", "paidOnly": false, "title": "Largest Local Values in a Matrix", "titleSlug": "largest-local-values-in-a-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 163835, "totalSubmissionRaw": 186167}, "2374": {"acRate": 47.77721629631653, "difficulty": "Medium", "likes": 442, "dislikes": 41, "categoryTitle": "Algorithms", "frontendQuestionId": "2374", "paidOnly": false, "title": "Node With Highest Edge Score", "titleSlug": "node-with-highest-edge-score", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34982, "totalSubmissionRaw": 73219}, "2375": {"acRate": 76.24305739222427, "difficulty": "Medium", "likes": 938, "dislikes": 44, "categoryTitle": "Algorithms", "frontendQuestionId": "2375", "paidOnly": false, "title": "Construct Smallest Number From DI String", "titleSlug": "construct-smallest-number-from-di-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34593, "totalSubmissionRaw": 45372}, "2376": {"acRate": 38.81081081081081, "difficulty": "Hard", "likes": 571, "dislikes": 32, "categoryTitle": "Algorithms", "frontendQuestionId": "2376", "paidOnly": false, "title": "Count Special Integers", "titleSlug": "count-special-integers", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12206, "totalSubmissionRaw": 31450}, "2377": {"acRate": 78.90231621349446, "difficulty": "Easy", "likes": 38, "dislikes": 2, "categoryTitle": "Database", "frontendQuestionId": "2377", "paidOnly": true, "title": "Sort the Olympic Table", "titleSlug": "sort-the-olympic-table", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6268, "totalSubmissionRaw": 7944}, "2378": {"acRate": 58.113948919449896, "difficulty": "Medium", "likes": 54, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "2378", "paidOnly": true, "title": "Choose Edges to Maximize Score in a Tree", "titleSlug": "choose-edges-to-maximize-score-in-a-tree", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1479, "totalSubmissionRaw": 2545}, "2379": {"acRate": 59.09492738370869, "difficulty": "Easy", "likes": 735, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "2379", "paidOnly": false, "title": "Minimum Recolors to Get K Consecutive Black Blocks", "titleSlug": "minimum-recolors-to-get-k-consecutive-black-blocks", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 56152, "totalSubmissionRaw": 95020}, "2380": {"acRate": 50.640442683847894, "difficulty": "Medium", "likes": 502, "dislikes": 110, "categoryTitle": "Algorithms", "frontendQuestionId": "2380", "paidOnly": false, "title": "Time Needed to Rearrange a Binary String", "titleSlug": "time-needed-to-rearrange-a-binary-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 32854, "totalSubmissionRaw": 64877}, "2381": {"acRate": 37.72445097123022, "difficulty": "Medium", "likes": 758, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "2381", "paidOnly": false, "title": "Shifting Letters II", "titleSlug": "shifting-letters-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22606, "totalSubmissionRaw": 59924}, "2382": {"acRate": 49.18705687936457, "difficulty": "Hard", "likes": 462, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "2382", "paidOnly": false, "title": "Maximum Segment Sum After Removals", "titleSlug": "maximum-segment-sum-after-removals", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9227, "totalSubmissionRaw": 18759}, "2383": {"acRate": 41.276633121690466, "difficulty": "Easy", "likes": 344, "dislikes": 277, "categoryTitle": "Algorithms", "frontendQuestionId": "2383", "paidOnly": false, "title": "Minimum Hours of Training to Win a Competition", "titleSlug": "minimum-hours-of-training-to-win-a-competition", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 32895, "totalSubmissionRaw": 79694}, "2384": {"acRate": 35.42280701754386, "difficulty": "Medium", "likes": 607, "dislikes": 230, "categoryTitle": "Algorithms", "frontendQuestionId": "2384", "paidOnly": false, "title": "Largest Palindromic Number", "titleSlug": "largest-palindromic-number", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 40382, "totalSubmissionRaw": 114000}, "2385": {"acRate": 62.735493260211726, "difficulty": "Medium", "likes": 2722, "dislikes": 67, "categoryTitle": "Algorithms", "frontendQuestionId": "2385", "paidOnly": false, "title": "Amount of Time for Binary Tree to Be Infected", "titleSlug": "amount-of-time-for-binary-tree-to-be-infected", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 141392, "totalSubmissionRaw": 225378}, "2386": {"acRate": 39.052698954555154, "difficulty": "Hard", "likes": 565, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "2386", "paidOnly": false, "title": "Find the K-Sum of an Array", "titleSlug": "find-the-k-sum-of-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9152, "totalSubmissionRaw": 23435}, "2387": {"acRate": 69.74755700325733, "difficulty": "Medium", "likes": 77, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "2387", "paidOnly": true, "title": "Median of a Row Wise Sorted Matrix", "titleSlug": "median-of-a-row-wise-sorted-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3426, "totalSubmissionRaw": 4912}, "2388": {"acRate": 50.670724833727874, "difficulty": "Medium", "likes": 84, "dislikes": 28, "categoryTitle": "Database", "frontendQuestionId": "2388", "paidOnly": true, "title": "Change Null Values in a Table to the Previous Value", "titleSlug": "change-null-values-in-a-table-to-the-previous-value", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4495, "totalSubmissionRaw": 8871}, "2389": {"acRate": 71.91254934281872, "difficulty": "Easy", "likes": 1897, "dislikes": 171, "categoryTitle": "Algorithms", "frontendQuestionId": "2389", "paidOnly": false, "title": "Longest Subsequence With Limited Sum", "titleSlug": "longest-subsequence-with-limited-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 116046, "totalSubmissionRaw": 161371}, "2390": {"acRate": 75.9806982061203, "difficulty": "Medium", "likes": 2913, "dislikes": 208, "categoryTitle": "Algorithms", "frontendQuestionId": "2390", "paidOnly": false, "title": "Removing Stars From a String", "titleSlug": "removing-stars-from-a-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 345621, "totalSubmissionRaw": 454880}, "2391": {"acRate": 85.21672415542254, "difficulty": "Medium", "likes": 1527, "dislikes": 239, "categoryTitle": "Algorithms", "frontendQuestionId": "2391", "paidOnly": false, "title": "Minimum Amount of Time to Collect Garbage", "titleSlug": "minimum-amount-of-time-to-collect-garbage", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 134397, "totalSubmissionRaw": 157711}, "2392": {"acRate": 79.57440496963774, "difficulty": "Hard", "likes": 1347, "dislikes": 50, "categoryTitle": "Algorithms", "frontendQuestionId": "2392", "paidOnly": false, "title": "Build a Matrix With Conditions", "titleSlug": "build-a-matrix-with-conditions", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 91205, "totalSubmissionRaw": 114616}, "2393": {"acRate": 74.78416862877005, "difficulty": "Medium", "likes": 132, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "2393", "paidOnly": true, "title": "Count Strictly Increasing Subarrays", "titleSlug": "count-strictly-increasing-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 6670, "totalSubmissionRaw": 8919}, "2394": {"acRate": 40.58566199446478, "difficulty": "Medium", "likes": 27, "dislikes": 36, "categoryTitle": "Database", "frontendQuestionId": "2394", "paidOnly": true, "title": "Employees With Deductions", "titleSlug": "employees-with-deductions", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4546, "totalSubmissionRaw": 11201}, "2395": {"acRate": 65.26623961565409, "difficulty": "Easy", "likes": 538, "dislikes": 31, "categoryTitle": "Algorithms", "frontendQuestionId": "2395", "paidOnly": false, "title": "Find Subarrays With Equal Sum", "titleSlug": "find-subarrays-with-equal-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 52166, "totalSubmissionRaw": 79928}, "2396": {"acRate": 87.67093594202079, "difficulty": "Medium", "likes": 621, "dislikes": 1570, "categoryTitle": "Algorithms", "frontendQuestionId": "2396", "paidOnly": false, "title": "Strictly Palindromic Number", "titleSlug": "strictly-palindromic-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Brainteaser", "id": "VG9waWNUYWdOb2RlOjMy", "slug": "brainteaser"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 93025, "totalSubmissionRaw": 106107}, "2397": {"acRate": 55.71351835273053, "difficulty": "Medium", "likes": 266, "dislikes": 411, "categoryTitle": "Algorithms", "frontendQuestionId": "2397", "paidOnly": false, "title": "Maximum Rows Covered by Columns", "titleSlug": "maximum-rows-covered-by-columns", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15558, "totalSubmissionRaw": 27925}, "2398": {"acRate": 34.74278444780155, "difficulty": "Hard", "likes": 801, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "2398", "paidOnly": false, "title": "Maximum Number of Robots Within Budget", "titleSlug": "maximum-number-of-robots-within-budget", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21848, "totalSubmissionRaw": 62885}, "2399": {"acRate": 70.68795861564845, "difficulty": "Easy", "likes": 485, "dislikes": 57, "categoryTitle": "Algorithms", "frontendQuestionId": "2399", "paidOnly": false, "title": "Check Distances Between Same Letters", "titleSlug": "check-distances-between-same-letters", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 50286, "totalSubmissionRaw": 71138}, "2400": {"acRate": 35.259315487486326, "difficulty": "Medium", "likes": 794, "dislikes": 61, "categoryTitle": "Algorithms", "frontendQuestionId": "2400", "paidOnly": false, "title": "Number of Ways to Reach a Position After Exactly k Steps", "titleSlug": "number-of-ways-to-reach-a-position-after-exactly-k-steps", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 31586, "totalSubmissionRaw": 89582}, "2401": {"acRate": 51.5160252519121, "difficulty": "Medium", "likes": 1307, "dislikes": 30, "categoryTitle": "Algorithms", "frontendQuestionId": "2401", "paidOnly": false, "title": "Longest Nice Subarray", "titleSlug": "longest-nice-subarray", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33947, "totalSubmissionRaw": 65896}, "2402": {"acRate": 44.20625938500913, "difficulty": "Hard", "likes": 1716, "dislikes": 110, "categoryTitle": "Algorithms", "frontendQuestionId": "2402", "paidOnly": false, "title": "Meeting Rooms III", "titleSlug": "meeting-rooms-iii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 119524, "totalSubmissionRaw": 270378}, "2403": {"acRate": 56.24493106244931, "difficulty": "Hard", "likes": 47, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "2403", "paidOnly": true, "title": "Minimum Time to Kill All Monsters", "titleSlug": "minimum-time-to-kill-all-monsters", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1387, "totalSubmissionRaw": 2466}, "2404": {"acRate": 50.713255329379706, "difficulty": "Easy", "likes": 973, "dislikes": 34, "categoryTitle": "Algorithms", "frontendQuestionId": "2404", "paidOnly": false, "title": "Most Frequent Even Element", "titleSlug": "most-frequent-even-element", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 85428, "totalSubmissionRaw": 168453}, "2405": {"acRate": 78.00451716219483, "difficulty": "Medium", "likes": 2630, "dislikes": 102, "categoryTitle": "Algorithms", "frontendQuestionId": "2405", "paidOnly": false, "title": "Optimal Partition of String", "titleSlug": "optimal-partition-of-string", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 206531, "totalSubmissionRaw": 264768}, "2406": {"acRate": 47.34220414354166, "difficulty": "Medium", "likes": 782, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "2406", "paidOnly": false, "title": "Divide Intervals Into Minimum Number of Groups", "titleSlug": "divide-intervals-into-minimum-number-of-groups", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27467, "totalSubmissionRaw": 58018}, "2407": {"acRate": 24.219470525090337, "difficulty": "Hard", "likes": 882, "dislikes": 37, "categoryTitle": "Algorithms", "frontendQuestionId": "2407", "paidOnly": false, "title": "Longest Increasing Subsequence II", "titleSlug": "longest-increasing-subsequence-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Monotonic Queue", "id": "VG9waWNUYWdOb2RlOjYxMDcx", "slug": "monotonic-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16019, "totalSubmissionRaw": 66141}, "2408": {"acRate": 78.54114577671486, "difficulty": "Medium", "likes": 51, "dislikes": 80, "categoryTitle": "Algorithms", "frontendQuestionId": "2408", "paidOnly": true, "title": "Design SQL", "titleSlug": "design-sql", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7225, "totalSubmissionRaw": 9199}, "2409": {"acRate": 45.263401554753955, "difficulty": "Easy", "likes": 254, "dislikes": 583, "categoryTitle": "Algorithms", "frontendQuestionId": "2409", "paidOnly": false, "title": "Count Days Spent Together", "titleSlug": "count-days-spent-together", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23465, "totalSubmissionRaw": 51841}, "2410": {"acRate": 63.399248465475324, "difficulty": "Medium", "likes": 503, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2410", "paidOnly": false, "title": "Maximum Matching of Players With Trainers", "titleSlug": "maximum-matching-of-players-with-trainers", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 37287, "totalSubmissionRaw": 58813}, "2411": {"acRate": 44.33145388642771, "difficulty": "Medium", "likes": 566, "dislikes": 29, "categoryTitle": "Algorithms", "frontendQuestionId": "2411", "paidOnly": false, "title": "Smallest Subarrays With Maximum Bitwise OR", "titleSlug": "smallest-subarrays-with-maximum-bitwise-or", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13209, "totalSubmissionRaw": 29796}, "2412": {"acRate": 40.49940458469783, "difficulty": "Hard", "likes": 400, "dislikes": 35, "categoryTitle": "Algorithms", "frontendQuestionId": "2412", "paidOnly": false, "title": "Minimum Money Required Before Transactions", "titleSlug": "minimum-money-required-before-transactions", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10883, "totalSubmissionRaw": 26872}, "2413": {"acRate": 87.89722818191439, "difficulty": "Easy", "likes": 901, "dislikes": 106, "categoryTitle": "Algorithms", "frontendQuestionId": "2413", "paidOnly": false, "title": "Smallest Even Multiple", "titleSlug": "smallest-even-multiple", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 182719, "totalSubmissionRaw": 207878}, "2414": {"acRate": 58.61885296667906, "difficulty": "Medium", "likes": 508, "dislikes": 30, "categoryTitle": "Algorithms", "frontendQuestionId": "2414", "paidOnly": false, "title": "Length of the Longest Alphabetical Continuous Substring", "titleSlug": "length-of-the-longest-alphabetical-continuous-substring", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 47323, "totalSubmissionRaw": 80730}, "2415": {"acRate": 78.11365520395621, "difficulty": "Medium", "likes": 1125, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "2415", "paidOnly": false, "title": "Reverse Odd Levels of Binary Tree", "titleSlug": "reverse-odd-levels-of-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 54653, "totalSubmissionRaw": 69966}, "2416": {"acRate": 46.358767475829445, "difficulty": "Hard", "likes": 669, "dislikes": 54, "categoryTitle": "Algorithms", "frontendQuestionId": "2416", "paidOnly": false, "title": "Sum of Prefix Scores of Strings", "titleSlug": "sum-of-prefix-scores-of-strings", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26660, "totalSubmissionRaw": 57508}, "2417": {"acRate": 45.20603835169318, "difficulty": "Medium", "likes": 28, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "2417", "paidOnly": true, "title": "Closest Fair Integer", "titleSlug": "closest-fair-integer", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1108, "totalSubmissionRaw": 2451}, "2418": {"acRate": 85.02252061328406, "difficulty": "Easy", "likes": 1711, "dislikes": 32, "categoryTitle": "Algorithms", "frontendQuestionId": "2418", "paidOnly": false, "title": "Sort the People", "titleSlug": "sort-the-people", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 300893, "totalSubmissionRaw": 353898}, "2419": {"acRate": 49.64589604830431, "difficulty": "Medium", "likes": 461, "dislikes": 39, "categoryTitle": "Algorithms", "frontendQuestionId": "2419", "paidOnly": false, "title": "Longest Subarray With Maximum Bitwise AND", "titleSlug": "longest-subarray-with-maximum-bitwise-and", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Brainteaser", "id": "VG9waWNUYWdOb2RlOjMy", "slug": "brainteaser"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28531, "totalSubmissionRaw": 57469}, "2420": {"acRate": 38.89601436495976, "difficulty": "Medium", "likes": 625, "dislikes": 37, "categoryTitle": "Algorithms", "frontendQuestionId": "2420", "paidOnly": false, "title": "Find All Good Indices", "titleSlug": "find-all-good-indices", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24261, "totalSubmissionRaw": 62374}, "2421": {"acRate": 56.31168520750131, "difficulty": "Hard", "likes": 2240, "dislikes": 104, "categoryTitle": "Algorithms", "frontendQuestionId": "2421", "paidOnly": false, "title": "Number of Good Paths", "titleSlug": "number-of-good-paths", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 56542, "totalSubmissionRaw": 100409}, "2422": {"acRate": 69.21125206839493, "difficulty": "Medium", "likes": 135, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2422", "paidOnly": true, "title": "Merge Operations to Turn Array Into a Palindrome", "titleSlug": "merge-operations-to-turn-array-into-a-palindrome", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12548, "totalSubmissionRaw": 18130}, "2423": {"acRate": 17.40046322609981, "difficulty": "Easy", "likes": 673, "dislikes": 1220, "categoryTitle": "Algorithms", "frontendQuestionId": "2423", "paidOnly": false, "title": "Remove Letter To Equalize Frequency", "titleSlug": "remove-letter-to-equalize-frequency", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 48983, "totalSubmissionRaw": 281502}, "2424": {"acRate": 55.51589543423553, "difficulty": "Medium", "likes": 360, "dislikes": 29, "categoryTitle": "Algorithms", "frontendQuestionId": "2424", "paidOnly": false, "title": "Longest Uploaded Prefix", "titleSlug": "longest-uploaded-prefix", "topicTags": [{"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21619, "totalSubmissionRaw": 38942}, "2425": {"acRate": 58.141442715700144, "difficulty": "Medium", "likes": 404, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "2425", "paidOnly": false, "title": "Bitwise XOR of All Pairings", "titleSlug": "bitwise-xor-of-all-pairings", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Brainteaser", "id": "VG9waWNUYWdOb2RlOjMy", "slug": "brainteaser"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20553, "totalSubmissionRaw": 35350}, "2426": {"acRate": 44.22162901230549, "difficulty": "Hard", "likes": 532, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "2426", "paidOnly": false, "title": "Number of Pairs Satisfying Inequality", "titleSlug": "number-of-pairs-satisfying-inequality", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Merge Sort", "id": "VG9waWNUYWdOb2RlOjYxMDUx", "slug": "merge-sort"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13584, "totalSubmissionRaw": 30718}, "2427": {"acRate": 79.0918963644826, "difficulty": "Easy", "likes": 577, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "2427", "paidOnly": false, "title": "Number of Common Factors", "titleSlug": "number-of-common-factors", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 91764, "totalSubmissionRaw": 116022}, "2428": {"acRate": 74.93392236822233, "difficulty": "Medium", "likes": 452, "dislikes": 61, "categoryTitle": "Algorithms", "frontendQuestionId": "2428", "paidOnly": false, "title": "Maximum Sum of an Hourglass", "titleSlug": "maximum-sum-of-an-hourglass", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 39691, "totalSubmissionRaw": 52968}, "2429": {"acRate": 44.31031070651098, "difficulty": "Medium", "likes": 480, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "2429", "paidOnly": false, "title": "Minimize XOR", "titleSlug": "minimize-xor", "topicTags": [{"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22390, "totalSubmissionRaw": 50530}, "2430": {"acRate": 33.5884604062408, "difficulty": "Hard", "likes": 483, "dislikes": 54, "categoryTitle": "Algorithms", "frontendQuestionId": "2430", "paidOnly": false, "title": "Maximum Deletions on a String", "titleSlug": "maximum-deletions-on-a-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13692, "totalSubmissionRaw": 40764}, "2431": {"acRate": 63.90499861916597, "difficulty": "Medium", "likes": 46, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "2431", "paidOnly": true, "title": "Maximize Total Tastiness of Purchased Fruits", "titleSlug": "maximize-total-tastiness-of-purchased-fruits", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2314, "totalSubmissionRaw": 3621}, "2432": {"acRate": 50.26650266502665, "difficulty": "Easy", "likes": 275, "dislikes": 68, "categoryTitle": "Algorithms", "frontendQuestionId": "2432", "paidOnly": false, "title": "The Employee That Worked on the Longest Task", "titleSlug": "the-employee-that-worked-on-the-longest-task", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 35554, "totalSubmissionRaw": 70731}, "2433": {"acRate": 88.06974468257599, "difficulty": "Medium", "likes": 1390, "dislikes": 83, "categoryTitle": "Algorithms", "frontendQuestionId": "2433", "paidOnly": false, "title": "Find The Original Array of Prefix Xor", "titleSlug": "find-the-original-array-of-prefix-xor", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 152085, "totalSubmissionRaw": 172687}, "2434": {"acRate": 40.060970516996576, "difficulty": "Medium", "likes": 651, "dislikes": 193, "categoryTitle": "Algorithms", "frontendQuestionId": "2434", "paidOnly": false, "title": "Using a Robot to Print the Lexicographically Smallest String", "titleSlug": "using-a-robot-to-print-the-lexicographically-smallest-string", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19186, "totalSubmissionRaw": 47892}, "2435": {"acRate": 43.02628938390528, "difficulty": "Hard", "likes": 897, "dislikes": 31, "categoryTitle": "Algorithms", "frontendQuestionId": "2435", "paidOnly": false, "title": "Paths in Matrix Whose Sum Is Divisible by K", "titleSlug": "paths-in-matrix-whose-sum-is-divisible-by-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23584, "totalSubmissionRaw": 54813}, "2436": {"acRate": 71.13339410513521, "difficulty": "Medium", "likes": 40, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "2436", "paidOnly": true, "title": "Minimum Split Into Subarrays With GCD Greater Than One", "titleSlug": "minimum-split-into-subarrays-with-gcd-greater-than-one", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2341, "totalSubmissionRaw": 3291}, "2437": {"acRate": 46.84406211270686, "difficulty": "Easy", "likes": 286, "dislikes": 236, "categoryTitle": "Algorithms", "frontendQuestionId": "2437", "paidOnly": false, "title": "Number of Valid Clock Times", "titleSlug": "number-of-valid-clock-times", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 32128, "totalSubmissionRaw": 68585}, "2438": {"acRate": 40.54522803331949, "difficulty": "Medium", "likes": 293, "dislikes": 51, "categoryTitle": "Algorithms", "frontendQuestionId": "2438", "paidOnly": false, "title": "Range Product Queries of Powers", "titleSlug": "range-product-queries-of-powers", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16598, "totalSubmissionRaw": 40937}, "2439": {"acRate": 46.48029376856253, "difficulty": "Medium", "likes": 2420, "dislikes": 619, "categoryTitle": "Algorithms", "frontendQuestionId": "2439", "paidOnly": false, "title": "Minimize Maximum of Array", "titleSlug": "minimize-maximum-of-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 83414, "totalSubmissionRaw": 179461}, "2440": {"acRate": 52.98725234219014, "difficulty": "Hard", "likes": 389, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "2440", "paidOnly": false, "title": "Create Components With Same Value", "titleSlug": "create-components-with-same-value", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6900, "totalSubmissionRaw": 13022}, "2441": {"acRate": 75.07905105484531, "difficulty": "Easy", "likes": 996, "dislikes": 24, "categoryTitle": "Algorithms", "frontendQuestionId": "2441", "paidOnly": false, "title": "Largest Positive Integer That Exists With Its Negative", "titleSlug": "largest-positive-integer-that-exists-with-its-negative", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 225803, "totalSubmissionRaw": 300754}, "2442": {"acRate": 79.74587039390089, "difficulty": "Medium", "likes": 629, "dislikes": 54, "categoryTitle": "Algorithms", "frontendQuestionId": "2442", "paidOnly": false, "title": "Count Number of Distinct Integers After Reverse Operations", "titleSlug": "count-number-of-distinct-integers-after-reverse-operations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 65898, "totalSubmissionRaw": 82635}, "2443": {"acRate": 47.492529977104866, "difficulty": "Medium", "likes": 256, "dislikes": 300, "categoryTitle": "Algorithms", "frontendQuestionId": "2443", "paidOnly": false, "title": "Sum of Number and Its Reverse", "titleSlug": "sum-of-number-and-its-reverse", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 36715, "totalSubmissionRaw": 77308}, "2444": {"acRate": 67.88777506454942, "difficulty": "Hard", "likes": 3151, "dislikes": 82, "categoryTitle": "Algorithms", "frontendQuestionId": "2444", "paidOnly": false, "title": "Count Subarrays With Fixed Bounds", "titleSlug": "count-subarrays-with-fixed-bounds", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Monotonic Queue", "id": "VG9waWNUYWdOb2RlOjYxMDcx", "slug": "monotonic-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 145400, "totalSubmissionRaw": 214177}, "2445": {"acRate": 68.51851851851852, "difficulty": "Medium", "likes": 76, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "2445", "paidOnly": true, "title": "Number of Nodes With Value One", "titleSlug": "number-of-nodes-with-value-one", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2072, "totalSubmissionRaw": 3024}, "2446": {"acRate": 51.067696501590184, "difficulty": "Easy", "likes": 458, "dislikes": 67, "categoryTitle": "Algorithms", "frontendQuestionId": "2446", "paidOnly": false, "title": "Determine if Two Events Have Conflict", "titleSlug": "determine-if-two-events-have-conflict", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 46084, "totalSubmissionRaw": 90241}, "2447": {"acRate": 50.26985058799023, "difficulty": "Medium", "likes": 443, "dislikes": 68, "categoryTitle": "Algorithms", "frontendQuestionId": "2447", "paidOnly": false, "title": "Number of Subarrays With GCD Equal to K", "titleSlug": "number-of-subarrays-with-gcd-equal-to-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26546, "totalSubmissionRaw": 52807}, "2448": {"acRate": 45.93574203627443, "difficulty": "Hard", "likes": 2384, "dislikes": 35, "categoryTitle": "Algorithms", "frontendQuestionId": "2448", "paidOnly": false, "title": "Minimum Cost to Make Array Equal", "titleSlug": "minimum-cost-to-make-array-equal", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 67040, "totalSubmissionRaw": 145943}, "2449": {"acRate": 61.99562238294632, "difficulty": "Hard", "likes": 425, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "2449", "paidOnly": false, "title": "Minimum Number of Operations to Make Arrays Similar", "titleSlug": "minimum-number-of-operations-to-make-arrays-similar", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13029, "totalSubmissionRaw": 21016}, "2450": {"acRate": 63.55022109917877, "difficulty": "Medium", "likes": 37, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "2450", "paidOnly": true, "title": "Number of Distinct Binary Strings After Applying Operations", "titleSlug": "number-of-distinct-binary-strings-after-applying-operations", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1006, "totalSubmissionRaw": 1583}, "2451": {"acRate": 59.269883684375976, "difficulty": "Easy", "likes": 395, "dislikes": 111, "categoryTitle": "Algorithms", "frontendQuestionId": "2451", "paidOnly": false, "title": "Odd String Difference", "titleSlug": "odd-string-difference", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30166, "totalSubmissionRaw": 50896}, "2452": {"acRate": 60.77750027147356, "difficulty": "Medium", "likes": 297, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "2452", "paidOnly": false, "title": "Words Within Two Edits of Dictionary", "titleSlug": "words-within-two-edits-of-dictionary", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22388, "totalSubmissionRaw": 36836}, "2453": {"acRate": 39.50177152791532, "difficulty": "Medium", "likes": 565, "dislikes": 24, "categoryTitle": "Algorithms", "frontendQuestionId": "2453", "paidOnly": false, "title": "Destroy Sequential Targets", "titleSlug": "destroy-sequential-targets", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17950, "totalSubmissionRaw": 45441}, "2454": {"acRate": 38.83312874575782, "difficulty": "Hard", "likes": 663, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "2454", "paidOnly": false, "title": "Next Greater Element IV", "titleSlug": "next-greater-element-iv", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10756, "totalSubmissionRaw": 27698}, "2455": {"acRate": 60.57485838156199, "difficulty": "Easy", "likes": 334, "dislikes": 36, "categoryTitle": "Algorithms", "frontendQuestionId": "2455", "paidOnly": false, "title": "Average Value of Even Numbers That Are Divisible by Three", "titleSlug": "average-value-of-even-numbers-that-are-divisible-by-three", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 59241, "totalSubmissionRaw": 97798}, "2456": {"acRate": 43.924893771772, "difficulty": "Medium", "likes": 271, "dislikes": 365, "categoryTitle": "Algorithms", "frontendQuestionId": "2456", "paidOnly": false, "title": "Most Popular Video Creator", "titleSlug": "most-popular-video-creator", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22949, "totalSubmissionRaw": 52246}, "2457": {"acRate": 37.63549187515159, "difficulty": "Medium", "likes": 523, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "2457", "paidOnly": false, "title": "Minimum Addition to Make Integer Beautiful", "titleSlug": "minimum-addition-to-make-integer-beautiful", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20173, "totalSubmissionRaw": 53601}, "2458": {"acRate": 41.00212366501493, "difficulty": "Hard", "likes": 843, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "2458", "paidOnly": false, "title": "Height of Binary Tree After Subtree Removal Queries", "titleSlug": "height-of-binary-tree-after-subtree-removal-queries", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26644, "totalSubmissionRaw": 64982}, "2459": {"acRate": 45.84463625154131, "difficulty": "Hard", "likes": 54, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "2459", "paidOnly": true, "title": "Sort Array by Moving Items to Empty Space", "titleSlug": "sort-array-by-moving-items-to-empty-space", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1859, "totalSubmissionRaw": 4055}, "2460": {"acRate": 67.77690366480378, "difficulty": "Easy", "likes": 549, "dislikes": 27, "categoryTitle": "Algorithms", "frontendQuestionId": "2460", "paidOnly": false, "title": "Apply Operations to an Array", "titleSlug": "apply-operations-to-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 66338, "totalSubmissionRaw": 97877}, "2461": {"acRate": 34.14008188387877, "difficulty": "Medium", "likes": 1314, "dislikes": 24, "categoryTitle": "Algorithms", "frontendQuestionId": "2461", "paidOnly": false, "title": "Maximum Sum of Distinct Subarrays With Length K", "titleSlug": "maximum-sum-of-distinct-subarrays-with-length-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 62122, "totalSubmissionRaw": 181963}, "2462": {"acRate": 42.900197199518786, "difficulty": "Medium", "likes": 1894, "dislikes": 591, "categoryTitle": "Algorithms", "frontendQuestionId": "2462", "paidOnly": false, "title": "Total Cost to Hire K Workers", "titleSlug": "total-cost-to-hire-k-workers", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 103770, "totalSubmissionRaw": 241887}, "2463": {"acRate": 40.83619702176403, "difficulty": "Hard", "likes": 466, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "2463", "paidOnly": false, "title": "Minimum Total Distance Traveled", "titleSlug": "minimum-total-distance-traveled", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8556, "totalSubmissionRaw": 20952}, "2464": {"acRate": 54.49490268767377, "difficulty": "Medium", "likes": 29, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "2464", "paidOnly": true, "title": "Minimum Subarrays in a Valid Split", "titleSlug": "minimum-subarrays-in-a-valid-split", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1176, "totalSubmissionRaw": 2158}, "2465": {"acRate": 58.11981164757054, "difficulty": "Easy", "likes": 371, "dislikes": 27, "categoryTitle": "Algorithms", "frontendQuestionId": "2465", "paidOnly": false, "title": "Number of Distinct Averages", "titleSlug": "number-of-distinct-averages", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 45298, "totalSubmissionRaw": 77939}, "2466": {"acRate": 54.42723287441, "difficulty": "Medium", "likes": 1704, "dislikes": 147, "categoryTitle": "Algorithms", "frontendQuestionId": "2466", "paidOnly": false, "title": "Count Ways To Build Good Strings", "titleSlug": "count-ways-to-build-good-strings", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 77720, "totalSubmissionRaw": 142796}, "2467": {"acRate": 49.46200150489089, "difficulty": "Medium", "likes": 703, "dislikes": 69, "categoryTitle": "Algorithms", "frontendQuestionId": "2467", "paidOnly": false, "title": "Most Profitable Path in a Tree", "titleSlug": "most-profitable-path-in-a-tree", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13147, "totalSubmissionRaw": 26580}, "2468": {"acRate": 44.47711533253376, "difficulty": "Hard", "likes": 159, "dislikes": 168, "categoryTitle": "Algorithms", "frontendQuestionId": "2468", "paidOnly": false, "title": "Split Message Based on Limit", "titleSlug": "split-message-based-on-limit", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11496, "totalSubmissionRaw": 25847}, "2469": {"acRate": 89.65932751926353, "difficulty": "Easy", "likes": 617, "dislikes": 336, "categoryTitle": "Algorithms", "frontendQuestionId": "2469", "paidOnly": false, "title": "Convert the Temperature", "titleSlug": "convert-the-temperature", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 194199, "totalSubmissionRaw": 216597}, "2470": {"acRate": 39.019758788811906, "difficulty": "Medium", "likes": 356, "dislikes": 38, "categoryTitle": "Algorithms", "frontendQuestionId": "2470", "paidOnly": false, "title": "Number of Subarrays With LCM Equal to K", "titleSlug": "number-of-subarrays-with-lcm-equal-to-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22809, "totalSubmissionRaw": 58455}, "2471": {"acRate": 62.04856265699134, "difficulty": "Medium", "likes": 641, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2471", "paidOnly": false, "title": "Minimum Number of Operations to Sort a Binary Tree by Level", "titleSlug": "minimum-number-of-operations-to-sort-a-binary-tree-by-level", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22232, "totalSubmissionRaw": 35830}, "2472": {"acRate": 40.46712235478094, "difficulty": "Hard", "likes": 459, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "2472", "paidOnly": false, "title": "Maximum Number of Non-overlapping Palindrome Substrings", "titleSlug": "maximum-number-of-non-overlapping-palindrome-substrings", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16044, "totalSubmissionRaw": 39647}, "2473": {"acRate": 67.59812982494292, "difficulty": "Medium", "likes": 110, "dislikes": 24, "categoryTitle": "Algorithms", "frontendQuestionId": "2473", "paidOnly": true, "title": "Minimum Cost to Buy Apples", "titleSlug": "minimum-cost-to-buy-apples", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 6217, "totalSubmissionRaw": 9197}, "2474": {"acRate": 44.83558466366489, "difficulty": "Hard", "likes": 38, "dislikes": 6, "categoryTitle": "Database", "frontendQuestionId": "2474", "paidOnly": true, "title": "Customers With Strictly Increasing Purchases", "titleSlug": "customers-with-strictly-increasing-purchases", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3286, "totalSubmissionRaw": 7329}, "2475": {"acRate": 71.57988078230456, "difficulty": "Easy", "likes": 402, "dislikes": 46, "categoryTitle": "Algorithms", "frontendQuestionId": "2475", "paidOnly": false, "title": "Number of Unequal Triplets in Array", "titleSlug": "number-of-unequal-triplets-in-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 43590, "totalSubmissionRaw": 60897}, "2476": {"acRate": 41.54374761392427, "difficulty": "Medium", "likes": 443, "dislikes": 117, "categoryTitle": "Algorithms", "frontendQuestionId": "2476", "paidOnly": false, "title": "Closest Nodes Queries in a Binary Search Tree", "titleSlug": "closest-nodes-queries-in-a-binary-search-tree", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23940, "totalSubmissionRaw": 57626}, "2477": {"acRate": 64.46959265372375, "difficulty": "Medium", "likes": 2192, "dislikes": 87, "categoryTitle": "Algorithms", "frontendQuestionId": "2477", "paidOnly": false, "title": "Minimum Fuel Cost to Report to the Capital", "titleSlug": "minimum-fuel-cost-to-report-to-the-capital", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 70698, "totalSubmissionRaw": 109661}, "2478": {"acRate": 31.10418975172951, "difficulty": "Hard", "likes": 348, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "2478", "paidOnly": false, "title": "Number of Beautiful Partitions", "titleSlug": "number-of-beautiful-partitions", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10386, "totalSubmissionRaw": 33391}, "2479": {"acRate": 49.448123620309055, "difficulty": "Hard", "likes": 31, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "2479", "paidOnly": true, "title": "Maximum XOR of Two Non-Overlapping Subtrees", "titleSlug": "maximum-xor-of-two-non-overlapping-subtrees", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 672, "totalSubmissionRaw": 1359}, "2480": {"acRate": 76.55376520881289, "difficulty": "Easy", "likes": 27, "dislikes": 9, "categoryTitle": "Database", "frontendQuestionId": "2480", "paidOnly": true, "title": "Form a Chemical Bond", "titleSlug": "form-a-chemical-bond", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4656, "totalSubmissionRaw": 6082}, "2481": {"acRate": 53.42877986503739, "difficulty": "Easy", "likes": 222, "dislikes": 49, "categoryTitle": "Algorithms", "frontendQuestionId": "2481", "paidOnly": false, "title": "Minimum Cuts to Divide a Circle", "titleSlug": "minimum-cuts-to-divide-a-circle", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 35154, "totalSubmissionRaw": 65796}, "2482": {"acRate": 84.43065031665465, "difficulty": "Medium", "likes": 1175, "dislikes": 82, "categoryTitle": "Algorithms", "frontendQuestionId": "2482", "paidOnly": false, "title": "Difference Between Ones and Zeros in Row and Column", "titleSlug": "difference-between-ones-and-zeros-in-row-and-column", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 127584, "totalSubmissionRaw": 151111}, "2483": {"acRate": 67.36686924230078, "difficulty": "Medium", "likes": 1930, "dislikes": 102, "categoryTitle": "Algorithms", "frontendQuestionId": "2483", "paidOnly": false, "title": "Minimum Penalty for a Shop", "titleSlug": "minimum-penalty-for-a-shop", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 108301, "totalSubmissionRaw": 160763}, "2484": {"acRate": 38.229008686060936, "difficulty": "Hard", "likes": 496, "dislikes": 28, "categoryTitle": "Algorithms", "frontendQuestionId": "2484", "paidOnly": false, "title": "Count Palindromic Subsequences", "titleSlug": "count-palindromic-subsequences", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11091, "totalSubmissionRaw": 29012}, "2485": {"acRate": 83.92742395471579, "difficulty": "Easy", "likes": 1281, "dislikes": 56, "categoryTitle": "Algorithms", "frontendQuestionId": "2485", "paidOnly": false, "title": "Find the Pivot Integer", "titleSlug": "find-the-pivot-integer", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 232484, "totalSubmissionRaw": 277006}, "2486": {"acRate": 73.00641737293873, "difficulty": "Medium", "likes": 1097, "dislikes": 86, "categoryTitle": "Algorithms", "frontendQuestionId": "2486", "paidOnly": false, "title": "Append Characters to String to Make Subsequence", "titleSlug": "append-characters-to-string-to-make-subsequence", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 188734, "totalSubmissionRaw": 258517}, "2487": {"acRate": 74.32358975929442, "difficulty": "Medium", "likes": 2081, "dislikes": 72, "categoryTitle": "Algorithms", "frontendQuestionId": "2487", "paidOnly": false, "title": "Remove Nodes From Linked List", "titleSlug": "remove-nodes-from-linked-list", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 194157, "totalSubmissionRaw": 261232}, "2488": {"acRate": 44.430657969370394, "difficulty": "Hard", "likes": 571, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "2488", "paidOnly": false, "title": "Count Subarrays With Median K", "titleSlug": "count-subarrays-with-median-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12533, "totalSubmissionRaw": 28208}, "2489": {"acRate": 57.0627802690583, "difficulty": "Medium", "likes": 47, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "2489", "paidOnly": true, "title": "Number of Substrings With Fixed Ratio", "titleSlug": "number-of-substrings-with-fixed-ratio", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1018, "totalSubmissionRaw": 1784}, "2490": {"acRate": 62.767593503937, "difficulty": "Easy", "likes": 364, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "2490", "paidOnly": false, "title": "Circular Sentence", "titleSlug": "circular-sentence", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 40814, "totalSubmissionRaw": 65024}, "2491": {"acRate": 60.11473381433691, "difficulty": "Medium", "likes": 483, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "2491", "paidOnly": false, "title": "Divide Players Into Teams of Equal Skill", "titleSlug": "divide-players-into-teams-of-equal-skill", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 37410, "totalSubmissionRaw": 62231}, "2492": {"acRate": 57.41863949259819, "difficulty": "Medium", "likes": 1775, "dislikes": 303, "categoryTitle": "Algorithms", "frontendQuestionId": "2492", "paidOnly": false, "title": "Minimum Score of a Path Between Two Cities", "titleSlug": "minimum-score-of-a-path-between-two-cities", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 86999, "totalSubmissionRaw": 151517}, "2493": {"acRate": 38.78118912902328, "difficulty": "Hard", "likes": 413, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "2493", "paidOnly": false, "title": "Divide Nodes Into the Maximum Number of Groups", "titleSlug": "divide-nodes-into-the-maximum-number-of-groups", "topicTags": [{"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8362, "totalSubmissionRaw": 21562}, "2494": {"acRate": 31.796610169491522, "difficulty": "Hard", "likes": 47, "dislikes": 6, "categoryTitle": "Database", "frontendQuestionId": "2494", "paidOnly": true, "title": "Merge Overlapping Events in the Same Hall", "titleSlug": "merge-overlapping-events-in-the-same-hall", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1876, "totalSubmissionRaw": 5900}, "2495": {"acRate": 63.93215645552094, "difficulty": "Medium", "likes": 45, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "2495", "paidOnly": true, "title": "Number of Subarrays Having Even Product", "titleSlug": "number-of-subarrays-having-even-product", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1847, "totalSubmissionRaw": 2889}, "2496": {"acRate": 72.45418714570607, "difficulty": "Easy", "likes": 396, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "2496", "paidOnly": false, "title": "Maximum Value of a String in an Array", "titleSlug": "maximum-value-of-a-string-in-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 46133, "totalSubmissionRaw": 63674}, "2497": {"acRate": 39.53139252052296, "difficulty": "Medium", "likes": 398, "dislikes": 51, "categoryTitle": "Algorithms", "frontendQuestionId": "2497", "paidOnly": false, "title": "Maximum Star Sum of a Graph", "titleSlug": "maximum-star-sum-of-a-graph", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20803, "totalSubmissionRaw": 52624}, "2498": {"acRate": 61.734194558622036, "difficulty": "Medium", "likes": 704, "dislikes": 105, "categoryTitle": "Algorithms", "frontendQuestionId": "2498", "paidOnly": false, "title": "Frog Jump II", "titleSlug": "frog-jump-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22078, "totalSubmissionRaw": 35763}, "2499": {"acRate": 43.0499578217265, "difficulty": "Hard", "likes": 228, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "2499", "paidOnly": false, "title": "Minimum Total Cost to Make Arrays Unequal", "titleSlug": "minimum-total-cost-to-make-arrays-unequal", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4593, "totalSubmissionRaw": 10669}, "2500": {"acRate": 78.33180866928157, "difficulty": "Easy", "likes": 637, "dislikes": 47, "categoryTitle": "Algorithms", "frontendQuestionId": "2500", "paidOnly": false, "title": "Delete Greatest Value in Each Row", "titleSlug": "delete-greatest-value-in-each-row", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 62508, "totalSubmissionRaw": 79799}, "2501": {"acRate": 39.89636529735073, "difficulty": "Medium", "likes": 459, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "2501", "paidOnly": false, "title": "Longest Square Streak in an Array", "titleSlug": "longest-square-streak-in-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26640, "totalSubmissionRaw": 66773}, "2502": {"acRate": 53.2664834335075, "difficulty": "Medium", "likes": 287, "dislikes": 86, "categoryTitle": "Algorithms", "frontendQuestionId": "2502", "paidOnly": false, "title": "Design Memory Allocator", "titleSlug": "design-memory-allocator", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17636, "totalSubmissionRaw": 33109}, "2503": {"acRate": 37.711216528796015, "difficulty": "Hard", "likes": 471, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "2503", "paidOnly": false, "title": "Maximum Number of Points From Grid Queries", "titleSlug": "maximum-number-of-points-from-grid-queries", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9619, "totalSubmissionRaw": 25507}, "2504": {"acRate": 76.03079555175364, "difficulty": "Easy", "likes": 30, "dislikes": 4, "categoryTitle": "Database", "frontendQuestionId": "2504", "paidOnly": true, "title": "Concatenate the Name and the Profession", "titleSlug": "concatenate-the-name-and-the-profession", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4444, "totalSubmissionRaw": 5845}, "2505": {"acRate": 66.89919776770144, "difficulty": "Medium", "likes": 53, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "2505", "paidOnly": true, "title": "Bitwise OR of All Subsequence Sums", "titleSlug": "bitwise-or-of-all-subsequence-sums", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Brainteaser", "id": "VG9waWNUYWdOb2RlOjMy", "slug": "brainteaser"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3836, "totalSubmissionRaw": 5734}, "2506": {"acRate": 70.53423377249842, "difficulty": "Easy", "likes": 499, "dislikes": 37, "categoryTitle": "Algorithms", "frontendQuestionId": "2506", "paidOnly": false, "title": "Count Pairs Of Similar Strings", "titleSlug": "count-pairs-of-similar-strings", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 46791, "totalSubmissionRaw": 66338}, "2507": {"acRate": 48.64922041930229, "difficulty": "Medium", "likes": 389, "dislikes": 24, "categoryTitle": "Algorithms", "frontendQuestionId": "2507", "paidOnly": false, "title": "Smallest Value After Replacing With Sum of Prime Factors", "titleSlug": "smallest-value-after-replacing-with-sum-of-prime-factors", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22996, "totalSubmissionRaw": 47269}, "2508": {"acRate": 32.46999975951711, "difficulty": "Hard", "likes": 329, "dislikes": 56, "categoryTitle": "Algorithms", "frontendQuestionId": "2508", "paidOnly": false, "title": "Add Edges to Make Degrees of All Nodes Even", "titleSlug": "add-edges-to-make-degrees-of-all-nodes-even", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13502, "totalSubmissionRaw": 41583}, "2509": {"acRate": 56.413171635506146, "difficulty": "Hard", "likes": 349, "dislikes": 29, "categoryTitle": "Algorithms", "frontendQuestionId": "2509", "paidOnly": false, "title": "Cycle Length Queries in a Tree", "titleSlug": "cycle-length-queries-in-a-tree", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13397, "totalSubmissionRaw": 23748}, "2510": {"acRate": 50.375773651635726, "difficulty": "Medium", "likes": 93, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "2510", "paidOnly": true, "title": "Check if There is a Path With Equal Number of 0's And 1's", "titleSlug": "check-if-there-is-a-path-with-equal-number-of-0s-and-1s", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4558, "totalSubmissionRaw": 9048}, "2511": {"acRate": 38.51640740681771, "difficulty": "Easy", "likes": 278, "dislikes": 274, "categoryTitle": "Algorithms", "frontendQuestionId": "2511", "paidOnly": false, "title": "Maximum Enemy Forts That Can Be Captured", "titleSlug": "maximum-enemy-forts-that-can-be-captured", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24191, "totalSubmissionRaw": 62807}, "2512": {"acRate": 45.21040616789422, "difficulty": "Medium", "likes": 328, "dislikes": 82, "categoryTitle": "Algorithms", "frontendQuestionId": "2512", "paidOnly": false, "title": "Reward Top K Students", "titleSlug": "reward-top-k-students", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20993, "totalSubmissionRaw": 46434}, "2513": {"acRate": 30.590566602917118, "difficulty": "Medium", "likes": 478, "dislikes": 95, "categoryTitle": "Algorithms", "frontendQuestionId": "2513", "paidOnly": false, "title": "Minimize the Maximum of Two Arrays", "titleSlug": "minimize-the-maximum-of-two-arrays", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13276, "totalSubmissionRaw": 43399}, "2514": {"acRate": 33.594425087108014, "difficulty": "Hard", "likes": 414, "dislikes": 36, "categoryTitle": "Algorithms", "frontendQuestionId": "2514", "paidOnly": false, "title": "Count Anagrams", "titleSlug": "count-anagrams", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12052, "totalSubmissionRaw": 35875}, "2515": {"acRate": 49.46234801934894, "difficulty": "Easy", "likes": 345, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "2515", "paidOnly": false, "title": "Shortest Distance to Target String in a Circular Array", "titleSlug": "shortest-distance-to-target-string-in-a-circular-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30267, "totalSubmissionRaw": 61192}, "2516": {"acRate": 34.43550051599587, "difficulty": "Medium", "likes": 707, "dislikes": 65, "categoryTitle": "Algorithms", "frontendQuestionId": "2516", "paidOnly": false, "title": "Take K of Each Character From Left and Right", "titleSlug": "take-k-of-each-character-from-left-and-right", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16684, "totalSubmissionRaw": 48450}, "2517": {"acRate": 64.02535657686212, "difficulty": "Medium", "likes": 904, "dislikes": 145, "categoryTitle": "Algorithms", "frontendQuestionId": "2517", "paidOnly": false, "title": "Maximum Tastiness of Candy Basket", "titleSlug": "maximum-tastiness-of-candy-basket", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22220, "totalSubmissionRaw": 34705}, "2518": {"acRate": 31.5045923017598, "difficulty": "Hard", "likes": 434, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "2518", "paidOnly": false, "title": "Number of Great Partitions", "titleSlug": "number-of-great-partitions", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8987, "totalSubmissionRaw": 28526}, "2519": {"acRate": 53.50656808556457, "difficulty": "Hard", "likes": 103, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "2519", "paidOnly": true, "title": "Count the Number of K-Big Indices", "titleSlug": "count-the-number-of-k-big-indices", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Merge Sort", "id": "VG9waWNUYWdOb2RlOjYxMDUx", "slug": "merge-sort"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7454, "totalSubmissionRaw": 13931}, "2520": {"acRate": 84.77946319914909, "difficulty": "Easy", "likes": 506, "dislikes": 32, "categoryTitle": "Algorithms", "frontendQuestionId": "2520", "paidOnly": false, "title": "Count the Digits That Divide a Number", "titleSlug": "count-the-digits-that-divide-a-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 88475, "totalSubmissionRaw": 104359}, "2521": {"acRate": 51.417738747205036, "difficulty": "Medium", "likes": 465, "dislikes": 10, "categoryTitle": "Algorithms", "frontendQuestionId": "2521", "paidOnly": false, "title": "Distinct Prime Factors of Product of Array", "titleSlug": "distinct-prime-factors-of-product-of-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 31734, "totalSubmissionRaw": 61718}, "2522": {"acRate": 46.28298385204462, "difficulty": "Medium", "likes": 370, "dislikes": 47, "categoryTitle": "Algorithms", "frontendQuestionId": "2522", "paidOnly": false, "title": "Partition String Into Substrings With Values at Most K", "titleSlug": "partition-string-into-substrings-with-values-at-most-k", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21697, "totalSubmissionRaw": 46879}, "2523": {"acRate": 37.63676148796499, "difficulty": "Medium", "likes": 364, "dislikes": 29, "categoryTitle": "Algorithms", "frontendQuestionId": "2523", "paidOnly": false, "title": "Closest Prime Numbers in Range", "titleSlug": "closest-prime-numbers-in-range", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24080, "totalSubmissionRaw": 63980}, "2524": {"acRate": 39.30804501875782, "difficulty": "Hard", "likes": 23, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "2524", "paidOnly": true, "title": "Maximum Frequency Score of a Subarray", "titleSlug": "maximum-frequency-score-of-a-subarray", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 943, "totalSubmissionRaw": 2399}, "2525": {"acRate": 35.82209190722791, "difficulty": "Easy", "likes": 196, "dislikes": 58, "categoryTitle": "Algorithms", "frontendQuestionId": "2525", "paidOnly": false, "title": "Categorize Box According to Criteria", "titleSlug": "categorize-box-according-to-criteria", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33964, "totalSubmissionRaw": 94813}, "2526": {"acRate": 49.46308724832215, "difficulty": "Medium", "likes": 310, "dislikes": 34, "categoryTitle": "Algorithms", "frontendQuestionId": "2526", "paidOnly": false, "title": "Find Consecutive Integers from a Data Stream", "titleSlug": "find-consecutive-integers-from-a-data-stream", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}, {"name": "Data Stream", "id": "VG9waWNUYWdOb2RlOjYxMDYz", "slug": "data-stream"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26532, "totalSubmissionRaw": 53640}, "2527": {"acRate": 68.80449591280654, "difficulty": "Medium", "likes": 360, "dislikes": 52, "categoryTitle": "Algorithms", "frontendQuestionId": "2527", "paidOnly": false, "title": "Find Xor-Beauty of Array", "titleSlug": "find-xor-beauty-of-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20201, "totalSubmissionRaw": 29360}, "2528": {"acRate": 32.62797074954296, "difficulty": "Hard", "likes": 458, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "2528", "paidOnly": false, "title": "Maximize the Minimum Powered City", "titleSlug": "maximize-the-minimum-powered-city", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7139, "totalSubmissionRaw": 21880}, "2529": {"acRate": 71.00771940533872, "difficulty": "Easy", "likes": 904, "dislikes": 53, "categoryTitle": "Algorithms", "frontendQuestionId": "2529", "paidOnly": false, "title": "Maximum Count of Positive Integer and Negative Integer", "titleSlug": "maximum-count-of-positive-integer-and-negative-integer", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 111671, "totalSubmissionRaw": 157266}, "2530": {"acRate": 46.12755167543972, "difficulty": "Medium", "likes": 390, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "2530", "paidOnly": false, "title": "Maximal Score After Applying K Operations", "titleSlug": "maximal-score-after-applying-k-operations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28743, "totalSubmissionRaw": 62312}, "2531": {"acRate": 26.416294473098358, "difficulty": "Medium", "likes": 563, "dislikes": 147, "categoryTitle": "Algorithms", "frontendQuestionId": "2531", "paidOnly": false, "title": "Make Number of Distinct Characters Equal", "titleSlug": "make-number-of-distinct-characters-equal", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19104, "totalSubmissionRaw": 72319}, "2532": {"acRate": 43.83938976586503, "difficulty": "Hard", "likes": 112, "dislikes": 217, "categoryTitle": "Algorithms", "frontendQuestionId": "2532", "paidOnly": false, "title": "Time to Cross a Bridge", "titleSlug": "time-to-cross-a-bridge", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4138, "totalSubmissionRaw": 9439}, "2533": {"acRate": 51.754792110380585, "difficulty": "Medium", "likes": 53, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "2533", "paidOnly": true, "title": "Number of Good Binary Strings", "titleSlug": "number-of-good-binary-strings", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5589, "totalSubmissionRaw": 10799}, "2534": {"acRate": 49.385701215527384, "difficulty": "Hard", "likes": 84, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "2534", "paidOnly": true, "title": "Time Taken to Cross the Door", "titleSlug": "time-taken-to-cross-the-door", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7557, "totalSubmissionRaw": 15301}, "2535": {"acRate": 84.49823260349373, "difficulty": "Easy", "likes": 696, "dislikes": 18, "categoryTitle": "Algorithms", "frontendQuestionId": "2535", "paidOnly": false, "title": "Difference Between Element Sum and Digit Sum of an Array", "titleSlug": "difference-between-element-sum-and-digit-sum-of-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 131715, "totalSubmissionRaw": 155879}, "2536": {"acRate": 49.88136907138998, "difficulty": "Medium", "likes": 460, "dislikes": 59, "categoryTitle": "Algorithms", "frontendQuestionId": "2536", "paidOnly": false, "title": "Increment Submatrices by One", "titleSlug": "increment-submatrices-by-one", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21234, "totalSubmissionRaw": 42569}, "2537": {"acRate": 51.189701309033055, "difficulty": "Medium", "likes": 852, "dislikes": 24, "categoryTitle": "Algorithms", "frontendQuestionId": "2537", "paidOnly": false, "title": "Count the Number of Good Subarrays", "titleSlug": "count-the-number-of-good-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21234, "totalSubmissionRaw": 41481}, "2538": {"acRate": 32.079013958044236, "difficulty": "Hard", "likes": 431, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "2538", "paidOnly": false, "title": "Difference Between Maximum and Minimum Price Sum", "titleSlug": "difference-between-maximum-and-minimum-price-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7860, "totalSubmissionRaw": 24502}, "2539": {"acRate": 52.40073868882733, "difficulty": "Medium", "likes": 28, "dislikes": 68, "categoryTitle": "Algorithms", "frontendQuestionId": "2539", "paidOnly": true, "title": "Count the Number of Good Subsequences", "titleSlug": "count-the-number-of-good-subsequences", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2270, "totalSubmissionRaw": 4332}, "2540": {"acRate": 58.73465740449911, "difficulty": "Easy", "likes": 1122, "dislikes": 37, "categoryTitle": "Algorithms", "frontendQuestionId": "2540", "paidOnly": false, "title": "Minimum Common Value", "titleSlug": "minimum-common-value", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 241224, "totalSubmissionRaw": 410702}, "2541": {"acRate": 31.61544280391113, "difficulty": "Medium", "likes": 413, "dislikes": 24, "categoryTitle": "Algorithms", "frontendQuestionId": "2541", "paidOnly": false, "title": "Minimum Operations to Make Array Equal II", "titleSlug": "minimum-operations-to-make-array-equal-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22569, "totalSubmissionRaw": 71386}, "2542": {"acRate": 53.80405871900218, "difficulty": "Medium", "likes": 2751, "dislikes": 164, "categoryTitle": "Algorithms", "frontendQuestionId": "2542", "paidOnly": false, "title": "Maximum Subsequence Score", "titleSlug": "maximum-subsequence-score", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 95074, "totalSubmissionRaw": 176705}, "2543": {"acRate": 42.61399787910923, "difficulty": "Hard", "likes": 246, "dislikes": 50, "categoryTitle": "Algorithms", "frontendQuestionId": "2543", "paidOnly": false, "title": "Check if Point Is Reachable", "titleSlug": "check-if-point-is-reachable", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8037, "totalSubmissionRaw": 18860}, "2544": {"acRate": 68.21822741571091, "difficulty": "Easy", "likes": 392, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "2544", "paidOnly": false, "title": "Alternating Digit Sum", "titleSlug": "alternating-digit-sum", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 63107, "totalSubmissionRaw": 92508}, "2545": {"acRate": 85.56310920312643, "difficulty": "Medium", "likes": 662, "dislikes": 47, "categoryTitle": "Algorithms", "frontendQuestionId": "2545", "paidOnly": false, "title": "Sort the Students by Their Kth Score", "titleSlug": "sort-the-students-by-their-kth-score", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 65572, "totalSubmissionRaw": 76636}, "2546": {"acRate": 41.212278202305406, "difficulty": "Medium", "likes": 250, "dislikes": 99, "categoryTitle": "Algorithms", "frontendQuestionId": "2546", "paidOnly": false, "title": "Apply Bitwise Operations to Make Strings Equal", "titleSlug": "apply-bitwise-operations-to-make-strings-equal", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19092, "totalSubmissionRaw": 46326}, "2547": {"acRate": 40.67886152017434, "difficulty": "Hard", "likes": 430, "dislikes": 24, "categoryTitle": "Algorithms", "frontendQuestionId": "2547", "paidOnly": false, "title": "Minimum Cost to Split an Array", "titleSlug": "minimum-cost-to-split-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12320, "totalSubmissionRaw": 30286}, "2548": {"acRate": 65.82096696984203, "difficulty": "Medium", "likes": 39, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "2548", "paidOnly": true, "title": "Maximum Price to Fill a Bag", "titleSlug": "maximum-price-to-fill-a-bag", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1375, "totalSubmissionRaw": 2089}, "2549": {"acRate": 60.48101194021385, "difficulty": "Easy", "likes": 265, "dislikes": 271, "categoryTitle": "Algorithms", "frontendQuestionId": "2549", "paidOnly": false, "title": "Count Distinct Numbers on Board", "titleSlug": "count-distinct-numbers-on-board", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 42650, "totalSubmissionRaw": 70518}, "2550": {"acRate": 27.709895713258923, "difficulty": "Medium", "likes": 240, "dislikes": 514, "categoryTitle": "Algorithms", "frontendQuestionId": "2550", "paidOnly": false, "title": "Count Collisions of Monkeys on a Polygon", "titleSlug": "count-collisions-of-monkeys-on-a-polygon", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20433, "totalSubmissionRaw": 73739}, "2551": {"acRate": 66.54501216545012, "difficulty": "Hard", "likes": 2037, "dislikes": 86, "categoryTitle": "Algorithms", "frontendQuestionId": "2551", "paidOnly": false, "title": "Put Marbles in Bags", "titleSlug": "put-marbles-in-bags", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 58529, "totalSubmissionRaw": 87954}, "2552": {"acRate": 33.43632117837255, "difficulty": "Hard", "likes": 374, "dislikes": 67, "categoryTitle": "Algorithms", "frontendQuestionId": "2552", "paidOnly": false, "title": "Count Increasing Quadruplets", "titleSlug": "count-increasing-quadruplets", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9307, "totalSubmissionRaw": 27835}, "2553": {"acRate": 79.50155630409755, "difficulty": "Easy", "likes": 487, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "2553", "paidOnly": false, "title": "Separate the Digits in an Array", "titleSlug": "separate-the-digits-in-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 74582, "totalSubmissionRaw": 93812}, "2554": {"acRate": 54.174301714246575, "difficulty": "Medium", "likes": 332, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "2554", "paidOnly": false, "title": "Maximum Number of Integers to Choose From a Range I", "titleSlug": "maximum-number-of-integers-to-choose-from-a-range-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 31634, "totalSubmissionRaw": 58393}, "2555": {"acRate": 33.35350125784161, "difficulty": "Medium", "likes": 545, "dislikes": 50, "categoryTitle": "Algorithms", "frontendQuestionId": "2555", "paidOnly": false, "title": "Maximize Win From Two Segments", "titleSlug": "maximize-win-from-two-segments", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10474, "totalSubmissionRaw": 31403}, "2556": {"acRate": 27.253556228672217, "difficulty": "Medium", "likes": 588, "dislikes": 28, "categoryTitle": "Algorithms", "frontendQuestionId": "2556", "paidOnly": false, "title": "Disconnect Path in a Binary Matrix by at Most One Flip", "titleSlug": "disconnect-path-in-a-binary-matrix-by-at-most-one-flip", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14216, "totalSubmissionRaw": 52162}, "2557": {"acRate": 40.06977323697981, "difficulty": "Medium", "likes": 33, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "2557", "paidOnly": true, "title": "Maximum Number of Integers to Choose From a Range II", "titleSlug": "maximum-number-of-integers-to-choose-from-a-range-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1608, "totalSubmissionRaw": 4013}, "2558": {"acRate": 67.01104774499271, "difficulty": "Easy", "likes": 379, "dislikes": 39, "categoryTitle": "Algorithms", "frontendQuestionId": "2558", "paidOnly": false, "title": "Take Gifts From the Richest Pile", "titleSlug": "take-gifts-from-the-richest-pile", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 48646, "totalSubmissionRaw": 72594}, "2559": {"acRate": 52.36366969113738, "difficulty": "Medium", "likes": 443, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "2559", "paidOnly": false, "title": "Count Vowel Strings in Ranges", "titleSlug": "count-vowel-strings-in-ranges", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28567, "totalSubmissionRaw": 54555}, "2560": {"acRate": 43.80085194617864, "difficulty": "Medium", "likes": 909, "dislikes": 31, "categoryTitle": "Algorithms", "frontendQuestionId": "2560", "paidOnly": false, "title": "House Robber IV", "titleSlug": "house-robber-iv", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19434, "totalSubmissionRaw": 44369}, "2561": {"acRate": 34.125782701438105, "difficulty": "Hard", "likes": 378, "dislikes": 18, "categoryTitle": "Algorithms", "frontendQuestionId": "2561", "paidOnly": false, "title": "Rearranging Fruits", "titleSlug": "rearranging-fruits", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9919, "totalSubmissionRaw": 29066}, "2562": {"acRate": 69.9602419083884, "difficulty": "Easy", "likes": 355, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "2562", "paidOnly": false, "title": "Find the Array Concatenation Value", "titleSlug": "find-the-array-concatenation-value", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 49973, "totalSubmissionRaw": 71431}, "2563": {"acRate": 33.01918031534171, "difficulty": "Medium", "likes": 801, "dislikes": 41, "categoryTitle": "Algorithms", "frontendQuestionId": "2563", "paidOnly": false, "title": "Count the Number of Fair Pairs", "titleSlug": "count-the-number-of-fair-pairs", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25926, "totalSubmissionRaw": 78518}, "2564": {"acRate": 33.62949210979976, "difficulty": "Medium", "likes": 368, "dislikes": 82, "categoryTitle": "Algorithms", "frontendQuestionId": "2564", "paidOnly": false, "title": "Substring XOR Queries", "titleSlug": "substring-xor-queries", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12680, "totalSubmissionRaw": 37705}, "2565": {"acRate": 31.723096829846888, "difficulty": "Hard", "likes": 375, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "2565", "paidOnly": false, "title": "Subsequence With the Minimum Score", "titleSlug": "subsequence-with-the-minimum-score", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7355, "totalSubmissionRaw": 23185}, "2566": {"acRate": 59.98826291079812, "difficulty": "Easy", "likes": 227, "dislikes": 41, "categoryTitle": "Algorithms", "frontendQuestionId": "2566", "paidOnly": false, "title": "Maximum Difference by Remapping a Digit", "titleSlug": "maximum-difference-by-remapping-a-digit", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25555, "totalSubmissionRaw": 42600}, "2567": {"acRate": 48.03040004454219, "difficulty": "Medium", "likes": 241, "dislikes": 222, "categoryTitle": "Algorithms", "frontendQuestionId": "2567", "paidOnly": false, "title": "Minimum Score by Changing Two Elements", "titleSlug": "minimum-score-by-changing-two-elements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17253, "totalSubmissionRaw": 35921}, "2568": {"acRate": 57.67228739002933, "difficulty": "Medium", "likes": 350, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "2568", "paidOnly": false, "title": "Minimum Impossible OR", "titleSlug": "minimum-impossible-or", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Brainteaser", "id": "VG9waWNUYWdOb2RlOjMy", "slug": "brainteaser"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15733, "totalSubmissionRaw": 27280}, "2569": {"acRate": 28.349080059671806, "difficulty": "Hard", "likes": 175, "dislikes": 24, "categoryTitle": "Algorithms", "frontendQuestionId": "2569", "paidOnly": false, "title": "Handling Sum Queries After Update", "titleSlug": "handling-sum-queries-after-update", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5701, "totalSubmissionRaw": 20110}, "2570": {"acRate": 73.74383986180968, "difficulty": "Easy", "likes": 334, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "2570", "paidOnly": false, "title": "Merge Two 2D Arrays by Summing Values", "titleSlug": "merge-two-2d-arrays-by-summing-values", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 43545, "totalSubmissionRaw": 59049}, "2571": {"acRate": 55.49435054802504, "difficulty": "Medium", "likes": 533, "dislikes": 192, "categoryTitle": "Algorithms", "frontendQuestionId": "2571", "paidOnly": false, "title": "Minimum Operations to Reduce an Integer to 0", "titleSlug": "minimum-operations-to-reduce-an-integer-to-0", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29518, "totalSubmissionRaw": 53191}, "2572": {"acRate": 23.15228144680646, "difficulty": "Medium", "likes": 457, "dislikes": 113, "categoryTitle": "Algorithms", "frontendQuestionId": "2572", "paidOnly": false, "title": "Count the Number of Square-Free Subsets", "titleSlug": "count-the-number-of-square-free-subsets", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9595, "totalSubmissionRaw": 41443}, "2573": {"acRate": 31.3644192128596, "difficulty": "Hard", "likes": 186, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2573", "paidOnly": false, "title": "Find the String with LCP", "titleSlug": "find-the-string-with-lcp", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4917, "totalSubmissionRaw": 15677}, "2574": {"acRate": 86.90239639941586, "difficulty": "Easy", "likes": 1049, "dislikes": 99, "categoryTitle": "Algorithms", "frontendQuestionId": "2574", "paidOnly": false, "title": "Left and Right Sum Differences", "titleSlug": "left-and-right-sum-differences", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 145198, "totalSubmissionRaw": 167082}, "2575": {"acRate": 32.95267288168797, "difficulty": "Medium", "likes": 526, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "2575", "paidOnly": false, "title": "Find the Divisibility Array of a String", "titleSlug": "find-the-divisibility-array-of-a-string", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28596, "totalSubmissionRaw": 86779}, "2576": {"acRate": 38.70661502240449, "difficulty": "Medium", "likes": 555, "dislikes": 27, "categoryTitle": "Algorithms", "frontendQuestionId": "2576", "paidOnly": false, "title": "Find the Maximum Number of Marked Indices", "titleSlug": "find-the-maximum-number-of-marked-indices", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20386, "totalSubmissionRaw": 52668}, "2577": {"acRate": 35.65248630362542, "difficulty": "Hard", "likes": 542, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "2577", "paidOnly": false, "title": "Minimum Time to Visit a Cell In a Grid", "titleSlug": "minimum-time-to-visit-a-cell-in-a-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11909, "totalSubmissionRaw": 33403}, "2578": {"acRate": 70.89424904021406, "difficulty": "Easy", "likes": 371, "dislikes": 29, "categoryTitle": "Algorithms", "frontendQuestionId": "2578", "paidOnly": false, "title": "Split With Minimum Sum", "titleSlug": "split-with-minimum-sum", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 36563, "totalSubmissionRaw": 51574}, "2579": {"acRate": 57.78067601347679, "difficulty": "Medium", "likes": 290, "dislikes": 23, "categoryTitle": "Algorithms", "frontendQuestionId": "2579", "paidOnly": false, "title": "Count Total Number of Colored Cells", "titleSlug": "count-total-number-of-colored-cells", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26582, "totalSubmissionRaw": 46005}, "2580": {"acRate": 36.29172036798364, "difficulty": "Medium", "likes": 313, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "2580", "paidOnly": false, "title": "Count Ways to Group Overlapping Ranges", "titleSlug": "count-ways-to-group-overlapping-ranges", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16332, "totalSubmissionRaw": 45002}, "2581": {"acRate": 45.76495695047465, "difficulty": "Hard", "likes": 297, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "2581", "paidOnly": false, "title": "Count Number of Possible Root Nodes", "titleSlug": "count-number-of-possible-root-nodes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6219, "totalSubmissionRaw": 13589}, "2582": {"acRate": 56.970665601172044, "difficulty": "Easy", "likes": 1008, "dislikes": 53, "categoryTitle": "Algorithms", "frontendQuestionId": "2582", "paidOnly": false, "title": "Pass the Pillow", "titleSlug": "pass-the-pillow", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 188208, "totalSubmissionRaw": 330361}, "2583": {"acRate": 47.71255882844788, "difficulty": "Medium", "likes": 553, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "2583", "paidOnly": false, "title": "Kth Largest Sum in a Binary Tree", "titleSlug": "kth-largest-sum-in-a-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 39944, "totalSubmissionRaw": 83718}, "2584": {"acRate": 23.149378566403502, "difficulty": "Hard", "likes": 303, "dislikes": 111, "categoryTitle": "Algorithms", "frontendQuestionId": "2584", "paidOnly": false, "title": "Split the Array to Make Coprime Products", "titleSlug": "split-the-array-to-make-coprime-products", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11846, "totalSubmissionRaw": 51172}, "2585": {"acRate": 57.52624248394878, "difficulty": "Hard", "likes": 470, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "2585", "paidOnly": false, "title": "Number of Ways to Earn Points", "titleSlug": "number-of-ways-to-earn-points", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16934, "totalSubmissionRaw": 29437}, "2586": {"acRate": 74.22389799462378, "difficulty": "Easy", "likes": 338, "dislikes": 24, "categoryTitle": "Algorithms", "frontendQuestionId": "2586", "paidOnly": false, "title": "Count the Number of Vowel Strings in Range", "titleSlug": "count-the-number-of-vowel-strings-in-range", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 62403, "totalSubmissionRaw": 84074}, "2587": {"acRate": 41.12706469614964, "difficulty": "Medium", "likes": 288, "dislikes": 48, "categoryTitle": "Algorithms", "frontendQuestionId": "2587", "paidOnly": false, "title": "Rearrange Array to Maximize Prefix Score", "titleSlug": "rearrange-array-to-maximize-prefix-score", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29331, "totalSubmissionRaw": 71318}, "2588": {"acRate": 50.6055965474036, "difficulty": "Medium", "likes": 500, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "2588", "paidOnly": false, "title": "Count the Number of Beautiful Subarrays", "titleSlug": "count-the-number-of-beautiful-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18175, "totalSubmissionRaw": 35915}, "2589": {"acRate": 39.373910222618704, "difficulty": "Hard", "likes": 424, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "2589", "paidOnly": false, "title": "Minimum Time to Complete All Tasks", "titleSlug": "minimum-time-to-complete-all-tasks", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9710, "totalSubmissionRaw": 24661}, "2590": {"acRate": 58.696916812100056, "difficulty": "Medium", "likes": 38, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "2590", "paidOnly": true, "title": "Design a Todo List", "titleSlug": "design-a-todo-list", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2018, "totalSubmissionRaw": 3438}, "2591": {"acRate": 19.193435711396813, "difficulty": "Easy", "likes": 301, "dislikes": 834, "categoryTitle": "Algorithms", "frontendQuestionId": "2591", "paidOnly": false, "title": "Distribute Money to Maximum Children", "titleSlug": "distribute-money-to-maximum-children", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 31320, "totalSubmissionRaw": 163182}, "2592": {"acRate": 58.06482093924218, "difficulty": "Medium", "likes": 436, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2592", "paidOnly": false, "title": "Maximize Greatness of an Array", "titleSlug": "maximize-greatness-of-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24580, "totalSubmissionRaw": 42332}, "2593": {"acRate": 52.653288740245266, "difficulty": "Medium", "likes": 362, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "2593", "paidOnly": false, "title": "Find Score of an Array After Marking All Elements", "titleSlug": "find-score-of-an-array-after-marking-all-elements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18892, "totalSubmissionRaw": 35880}, "2594": {"acRate": 44.87352867518157, "difficulty": "Medium", "likes": 579, "dislikes": 30, "categoryTitle": "Algorithms", "frontendQuestionId": "2594", "paidOnly": false, "title": "Minimum Time to Repair Cars", "titleSlug": "minimum-time-to-repair-cars", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17918, "totalSubmissionRaw": 39930}, "2595": {"acRate": 73.42402226000927, "difficulty": "Easy", "likes": 320, "dislikes": 109, "categoryTitle": "Algorithms", "frontendQuestionId": "2595", "paidOnly": false, "title": "Number of Even and Odd Bits", "titleSlug": "number-of-even-and-odd-bits", "topicTags": [{"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 47498, "totalSubmissionRaw": 64690}, "2596": {"acRate": 57.0298033253416, "difficulty": "Medium", "likes": 387, "dislikes": 56, "categoryTitle": "Algorithms", "frontendQuestionId": "2596", "paidOnly": false, "title": "Check Knight Tour Configuration", "titleSlug": "check-knight-tour-configuration", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29258, "totalSubmissionRaw": 51303}, "2597": {"acRate": 51.157552135296804, "difficulty": "Medium", "likes": 1190, "dislikes": 172, "categoryTitle": "Algorithms", "frontendQuestionId": "2597", "paidOnly": false, "title": "The Number of Beautiful Subsets", "titleSlug": "the-number-of-beautiful-subsets", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 115370, "totalSubmissionRaw": 225519}, "2598": {"acRate": 39.31432313970477, "difficulty": "Medium", "likes": 347, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "2598", "paidOnly": false, "title": "Smallest Missing Non-negative Integer After Operations", "titleSlug": "smallest-missing-non-negative-integer-after-operations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15607, "totalSubmissionRaw": 39698}, "2599": {"acRate": 50.78603783639755, "difficulty": "Medium", "likes": 45, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "2599", "paidOnly": true, "title": "Make the Prefix Sum Non-negative", "titleSlug": "make-the-prefix-sum-non-negative", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1906, "totalSubmissionRaw": 3753}, "2600": {"acRate": 61.84433290883212, "difficulty": "Easy", "likes": 278, "dislikes": 26, "categoryTitle": "Algorithms", "frontendQuestionId": "2600", "paidOnly": false, "title": "K Items With the Maximum Sum", "titleSlug": "k-items-with-the-maximum-sum", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 41278, "totalSubmissionRaw": 66745}, "2601": {"acRate": 37.840863296467106, "difficulty": "Medium", "likes": 380, "dislikes": 38, "categoryTitle": "Algorithms", "frontendQuestionId": "2601", "paidOnly": false, "title": "Prime Subtraction Operation", "titleSlug": "prime-subtraction-operation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16902, "totalSubmissionRaw": 44666}, "2602": {"acRate": 35.63328631875882, "difficulty": "Medium", "likes": 709, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "2602", "paidOnly": false, "title": "Minimum Operations to Make All Array Elements Equal", "titleSlug": "minimum-operations-to-make-all-array-elements-equal", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18948, "totalSubmissionRaw": 53175}, "2603": {"acRate": 37.40634858044164, "difficulty": "Hard", "likes": 431, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "2603", "paidOnly": false, "title": "Collect Coins in a Tree", "titleSlug": "collect-coins-in-a-tree", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7589, "totalSubmissionRaw": 20288}, "2604": {"acRate": 40.83845319840983, "difficulty": "Hard", "likes": 40, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "2604", "paidOnly": true, "title": "Minimum Time to Eat All Grains", "titleSlug": "minimum-time-to-eat-all-grains", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1130, "totalSubmissionRaw": 2767}, "2605": {"acRate": 54.13713943507336, "difficulty": "Easy", "likes": 295, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "2605", "paidOnly": false, "title": "Form Smallest Number From Two Digit Arrays", "titleSlug": "form-smallest-number-from-two-digit-arrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 37967, "totalSubmissionRaw": 70132}, "2606": {"acRate": 56.896394131895256, "difficulty": "Medium", "likes": 357, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "2606", "paidOnly": false, "title": "Find the Substring With Maximum Cost", "titleSlug": "find-the-substring-with-maximum-cost", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24899, "totalSubmissionRaw": 43762}, "2607": {"acRate": 37.00330543638793, "difficulty": "Medium", "likes": 461, "dislikes": 82, "categoryTitle": "Algorithms", "frontendQuestionId": "2607", "paidOnly": false, "title": "Make K-Subarray Sums Equal", "titleSlug": "make-k-subarray-sums-equal", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10523, "totalSubmissionRaw": 28438}, "2608": {"acRate": 36.46033447250814, "difficulty": "Hard", "likes": 506, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "2608", "paidOnly": false, "title": "Shortest Cycle in a Graph", "titleSlug": "shortest-cycle-in-a-graph", "topicTags": [{"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18030, "totalSubmissionRaw": 49451}, "2609": {"acRate": 46.45492650097408, "difficulty": "Easy", "likes": 363, "dislikes": 28, "categoryTitle": "Algorithms", "frontendQuestionId": "2609", "paidOnly": false, "title": "Find the Longest Balanced Substring of a Binary String", "titleSlug": "find-the-longest-balanced-substring-of-a-binary-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 31476, "totalSubmissionRaw": 67756}, "2610": {"acRate": 87.18041427980222, "difficulty": "Medium", "likes": 1603, "dislikes": 78, "categoryTitle": "Algorithms", "frontendQuestionId": "2610", "paidOnly": false, "title": "Convert an Array Into a 2D Array With Conditions", "titleSlug": "convert-an-array-into-a-2d-array-with-conditions", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 200127, "totalSubmissionRaw": 229555}, "2611": {"acRate": 45.96728417358997, "difficulty": "Medium", "likes": 618, "dislikes": 56, "categoryTitle": "Algorithms", "frontendQuestionId": "2611", "paidOnly": false, "title": "Mice and Cheese", "titleSlug": "mice-and-cheese", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26724, "totalSubmissionRaw": 58137}, "2612": {"acRate": 16.564905760552165, "difficulty": "Hard", "likes": 241, "dislikes": 71, "categoryTitle": "Algorithms", "frontendQuestionId": "2612", "paidOnly": false, "title": "Minimum Reverse Operations", "titleSlug": "minimum-reverse-operations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4992, "totalSubmissionRaw": 30136}, "2613": {"acRate": 42.604006163328194, "difficulty": "Hard", "likes": 17, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "2613", "paidOnly": true, "title": "Beautiful Pairs", "titleSlug": "beautiful-pairs", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 553, "totalSubmissionRaw": 1298}, "2614": {"acRate": 34.1085800544645, "difficulty": "Easy", "likes": 345, "dislikes": 40, "categoryTitle": "Algorithms", "frontendQuestionId": "2614", "paidOnly": false, "title": "Prime In Diagonal", "titleSlug": "prime-in-diagonal", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 44965, "totalSubmissionRaw": 131829}, "2615": {"acRate": 31.112535677763027, "difficulty": "Medium", "likes": 732, "dislikes": 90, "categoryTitle": "Algorithms", "frontendQuestionId": "2615", "paidOnly": false, "title": "Sum of Distances", "titleSlug": "sum-of-distances", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20384, "totalSubmissionRaw": 65517}, "2616": {"acRate": 43.92021388446634, "difficulty": "Medium", "likes": 2308, "dislikes": 247, "categoryTitle": "Algorithms", "frontendQuestionId": "2616", "paidOnly": false, "title": "Minimize the Maximum Difference of Pairs", "titleSlug": "minimize-the-maximum-difference-of-pairs", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 73103, "totalSubmissionRaw": 166445}, "2617": {"acRate": 24.918798791953957, "difficulty": "Hard", "likes": 377, "dislikes": 33, "categoryTitle": "Algorithms", "frontendQuestionId": "2617", "paidOnly": false, "title": "Minimum Number of Visited Cells in a Grid", "titleSlug": "minimum-number-of-visited-cells-in-a-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8746, "totalSubmissionRaw": 35098}, "2618": {"acRate": 27.598367616531423, "difficulty": "Medium", "likes": 265, "dislikes": 99, "categoryTitle": "JavaScript", "frontendQuestionId": "2618", "paidOnly": false, "title": "Check if Object Instance of Class", "titleSlug": "check-if-object-instance-of-class", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 23399, "totalSubmissionRaw": 84784}, "2619": {"acRate": 73.52717769479605, "difficulty": "Easy", "likes": 498, "dislikes": 21, "categoryTitle": "JavaScript", "frontendQuestionId": "2619", "paidOnly": false, "title": "Array Prototype Last", "titleSlug": "array-prototype-last", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 138422, "totalSubmissionRaw": 188260}, "2620": {"acRate": 81.15937016140681, "difficulty": "Easy", "likes": 1268, "dislikes": 104, "categoryTitle": "JavaScript", "frontendQuestionId": "2620", "paidOnly": false, "title": "Counter", "titleSlug": "counter", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 398890, "totalSubmissionRaw": 491489}, "2621": {"acRate": 86.94125080529264, "difficulty": "Easy", "likes": 584, "dislikes": 47, "categoryTitle": "JavaScript", "frontendQuestionId": "2621", "paidOnly": false, "title": "Sleep", "titleSlug": "sleep", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 140351, "totalSubmissionRaw": 161432}, "2622": {"acRate": 74.40903404227299, "difficulty": "Medium", "likes": 426, "dislikes": 29, "categoryTitle": "JavaScript", "frontendQuestionId": "2622", "paidOnly": false, "title": "Cache With Time Limit", "titleSlug": "cache-with-time-limit", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 45202, "totalSubmissionRaw": 60748}, "2623": {"acRate": 62.56824274920789, "difficulty": "Medium", "likes": 590, "dislikes": 86, "categoryTitle": "JavaScript", "frontendQuestionId": "2623", "paidOnly": false, "title": "Memoize", "titleSlug": "memoize", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 102687, "totalSubmissionRaw": 164120}, "2624": {"acRate": 65.48978458119869, "difficulty": "Medium", "likes": 100, "dislikes": 44, "categoryTitle": "JavaScript", "frontendQuestionId": "2624", "paidOnly": false, "title": "Snail Traversal", "titleSlug": "snail-traversal", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 10610, "totalSubmissionRaw": 16201}, "2625": {"acRate": 63.57423316505771, "difficulty": "Medium", "likes": 333, "dislikes": 25, "categoryTitle": "JavaScript", "frontendQuestionId": "2625", "paidOnly": false, "title": "Flatten Deeply Nested Array", "titleSlug": "flatten-deeply-nested-array", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 43069, "totalSubmissionRaw": 67745}, "2626": {"acRate": 84.73972545670424, "difficulty": "Easy", "likes": 583, "dislikes": 36, "categoryTitle": "JavaScript", "frontendQuestionId": "2626", "paidOnly": false, "title": "Array Reduce Transformation", "titleSlug": "array-reduce-transformation", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 162724, "totalSubmissionRaw": 192028}, "2627": {"acRate": 90.87309739471473, "difficulty": "Medium", "likes": 393, "dislikes": 44, "categoryTitle": "JavaScript", "frontendQuestionId": "2627", "paidOnly": false, "title": "Debounce", "titleSlug": "debounce", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 48658, "totalSubmissionRaw": 53545}, "2628": {"acRate": 38.716090161176865, "difficulty": "Medium", "likes": 213, "dislikes": 16, "categoryTitle": "JavaScript", "frontendQuestionId": "2628", "paidOnly": true, "title": "JSON Deep Equal", "titleSlug": "json-deep-equal", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 12659, "totalSubmissionRaw": 32697}, "2629": {"acRate": 86.26015236416295, "difficulty": "Easy", "likes": 657, "dislikes": 48, "categoryTitle": "JavaScript", "frontendQuestionId": "2629", "paidOnly": false, "title": "Function Composition", "titleSlug": "function-composition", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 137007, "totalSubmissionRaw": 158830}, "2630": {"acRate": 30.789110957960027, "difficulty": "Hard", "likes": 116, "dislikes": 41, "categoryTitle": "JavaScript", "frontendQuestionId": "2630", "paidOnly": false, "title": "Memoize II", "titleSlug": "memoize-ii", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 5361, "totalSubmissionRaw": 17412}, "2631": {"acRate": 80.81122372931883, "difficulty": "Medium", "likes": 303, "dislikes": 17, "categoryTitle": "JavaScript", "frontendQuestionId": "2631", "paidOnly": false, "title": "Group By", "titleSlug": "group-by", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 43373, "totalSubmissionRaw": 53672}, "2632": {"acRate": 89.21430887279801, "difficulty": "Medium", "likes": 343, "dislikes": 35, "categoryTitle": "JavaScript", "frontendQuestionId": "2632", "paidOnly": true, "title": "Curry", "titleSlug": "curry", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 16510, "totalSubmissionRaw": 18506}, "2633": {"acRate": 77.5260176524832, "difficulty": "Medium", "likes": 203, "dislikes": 12, "categoryTitle": "JavaScript", "frontendQuestionId": "2633", "paidOnly": true, "title": "Convert Object to JSON String", "titleSlug": "convert-object-to-json-string", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 11770, "totalSubmissionRaw": 15182}, "2634": {"acRate": 84.76945525291829, "difficulty": "Easy", "likes": 629, "dislikes": 78, "categoryTitle": "JavaScript", "frontendQuestionId": "2634", "paidOnly": false, "title": "Filter Elements from Array", "titleSlug": "filter-elements-from-array", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 174286, "totalSubmissionRaw": 205600}, "2635": {"acRate": 85.80540409981616, "difficulty": "Easy", "likes": 727, "dislikes": 70, "categoryTitle": "JavaScript", "frontendQuestionId": "2635", "paidOnly": false, "title": "Apply Transform Over Each Element in Array", "titleSlug": "apply-transform-over-each-element-in-array", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 191836, "totalSubmissionRaw": 223571}, "2636": {"acRate": 79.7847809377402, "difficulty": "Medium", "likes": 285, "dislikes": 27, "categoryTitle": "JavaScript", "frontendQuestionId": "2636", "paidOnly": true, "title": "Promise Pool", "titleSlug": "promise-pool", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 12456, "totalSubmissionRaw": 15612}, "2637": {"acRate": 81.48806877130576, "difficulty": "Medium", "likes": 477, "dislikes": 71, "categoryTitle": "JavaScript", "frontendQuestionId": "2637", "paidOnly": false, "title": "Promise Time Limit", "titleSlug": "promise-time-limit", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 54980, "totalSubmissionRaw": 67470}, "2638": {"acRate": 46.86119662695757, "difficulty": "Medium", "likes": 83, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "2638", "paidOnly": true, "title": "Count the Number of K-Free Subsets", "titleSlug": "count-the-number-of-k-free-subsets", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3501, "totalSubmissionRaw": 7471}, "2639": {"acRate": 67.75385953468145, "difficulty": "Easy", "likes": 168, "dislikes": 44, "categoryTitle": "Algorithms", "frontendQuestionId": "2639", "paidOnly": false, "title": "Find the Width of Columns of a Grid", "titleSlug": "find-the-width-of-columns-of-a-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28044, "totalSubmissionRaw": 41391}, "2640": {"acRate": 70.80714106110133, "difficulty": "Medium", "likes": 291, "dislikes": 35, "categoryTitle": "Algorithms", "frontendQuestionId": "2640", "paidOnly": false, "title": "Find the Score of All Prefixes of an Array", "titleSlug": "find-the-score-of-all-prefixes-of-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30976, "totalSubmissionRaw": 43747}, "2641": {"acRate": 67.68980684643336, "difficulty": "Medium", "likes": 580, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "2641", "paidOnly": false, "title": "Cousins in Binary Tree II", "titleSlug": "cousins-in-binary-tree-ii", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21237, "totalSubmissionRaw": 31374}, "2642": {"acRate": 70.58578278090472, "difficulty": "Hard", "likes": 808, "dislikes": 57, "categoryTitle": "Algorithms", "frontendQuestionId": "2642", "paidOnly": false, "title": "Design Graph With Shortest Path Calculator", "titleSlug": "design-graph-with-shortest-path-calculator", "topicTags": [{"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 67720, "totalSubmissionRaw": 95940}, "2643": {"acRate": 75.38547864816525, "difficulty": "Easy", "likes": 451, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "2643", "paidOnly": false, "title": "Row With Maximum Ones", "titleSlug": "row-with-maximum-ones", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 64487, "totalSubmissionRaw": 85543}, "2644": {"acRate": 49.36230222070697, "difficulty": "Easy", "likes": 232, "dislikes": 57, "categoryTitle": "Algorithms", "frontendQuestionId": "2644", "paidOnly": false, "title": "Find the Maximum Divisibility Score", "titleSlug": "find-the-maximum-divisibility-score", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 31853, "totalSubmissionRaw": 64529}, "2645": {"acRate": 50.59958649207444, "difficulty": "Medium", "likes": 540, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "2645", "paidOnly": false, "title": "Minimum Additions to Make Valid String", "titleSlug": "minimum-additions-to-make-valid-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29367, "totalSubmissionRaw": 58038}, "2646": {"acRate": 45.74834557157102, "difficulty": "Hard", "likes": 473, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "2646", "paidOnly": false, "title": "Minimize the Total Price of the Trips", "titleSlug": "minimize-the-total-price-of-the-trips", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10093, "totalSubmissionRaw": 22062}, "2647": {"acRate": 66.45569620253164, "difficulty": "Hard", "likes": 10, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "2647", "paidOnly": true, "title": "Color the Triangle Red", "titleSlug": "color-the-triangle-red", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 315, "totalSubmissionRaw": 474}, "2648": {"acRate": 83.20317019553396, "difficulty": "Easy", "likes": 244, "dislikes": 28, "categoryTitle": "JavaScript", "frontendQuestionId": "2648", "paidOnly": false, "title": "Generate Fibonacci Sequence", "titleSlug": "generate-fibonacci-sequence", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 28765, "totalSubmissionRaw": 34572}, "2649": {"acRate": 79.05589746843475, "difficulty": "Medium", "likes": 160, "dislikes": 11, "categoryTitle": "JavaScript", "frontendQuestionId": "2649", "paidOnly": false, "title": "Nested Array Generator", "titleSlug": "nested-array-generator", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 12460, "totalSubmissionRaw": 15761}, "2650": {"acRate": 52.09798690274072, "difficulty": "Hard", "likes": 63, "dislikes": 15, "categoryTitle": "JavaScript", "frontendQuestionId": "2650", "paidOnly": false, "title": "Design Cancellable Function", "titleSlug": "design-cancellable-function", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2148, "totalSubmissionRaw": 4123}, "2651": {"acRate": 78.46730357436995, "difficulty": "Easy", "likes": 228, "dislikes": 47, "categoryTitle": "Algorithms", "frontendQuestionId": "2651", "paidOnly": false, "title": "Calculate Delayed Arrival Time", "titleSlug": "calculate-delayed-arrival-time", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 57165, "totalSubmissionRaw": 72852}, "2652": {"acRate": 85.67494794010632, "difficulty": "Easy", "likes": 489, "dislikes": 32, "categoryTitle": "Algorithms", "frontendQuestionId": "2652", "paidOnly": false, "title": "Sum Multiples", "titleSlug": "sum-multiples", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 112319, "totalSubmissionRaw": 131099}, "2653": {"acRate": 33.41092810790988, "difficulty": "Medium", "likes": 619, "dislikes": 124, "categoryTitle": "Algorithms", "frontendQuestionId": "2653", "paidOnly": false, "title": "Sliding Subarray Beauty", "titleSlug": "sliding-subarray-beauty", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20955, "totalSubmissionRaw": 62719}, "2654": {"acRate": 35.343924099509074, "difficulty": "Medium", "likes": 380, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "2654", "paidOnly": false, "title": "Minimum Number of Operations to Make All Array Elements Equal to 1", "titleSlug": "minimum-number-of-operations-to-make-all-array-elements-equal-to-1", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12815, "totalSubmissionRaw": 36258}, "2655": {"acRate": 52.10819411296739, "difficulty": "Medium", "likes": 26, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "2655", "paidOnly": true, "title": "Find Maximal Uncovered Ranges", "titleSlug": "find-maximal-uncovered-ranges", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1310, "totalSubmissionRaw": 2514}, "2656": {"acRate": 82.33659683859322, "difficulty": "Easy", "likes": 370, "dislikes": 49, "categoryTitle": "Algorithms", "frontendQuestionId": "2656", "paidOnly": false, "title": "Maximum Sum With Exactly K Elements ", "titleSlug": "maximum-sum-with-exactly-k-elements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 75267, "totalSubmissionRaw": 91414}, "2657": {"acRate": 81.46212135456818, "difficulty": "Medium", "likes": 478, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "2657", "paidOnly": false, "title": "Find the Prefix Common Array of Two Arrays", "titleSlug": "find-the-prefix-common-array-of-two-arrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 43322, "totalSubmissionRaw": 53181}, "2658": {"acRate": 60.00533025363124, "difficulty": "Medium", "likes": 433, "dislikes": 23, "categoryTitle": "Algorithms", "frontendQuestionId": "2658", "paidOnly": false, "title": "Maximum Number of Fish in a Grid", "titleSlug": "maximum-number-of-fish-in-a-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27018, "totalSubmissionRaw": 45026}, "2659": {"acRate": 25.494052853242007, "difficulty": "Hard", "likes": 538, "dislikes": 32, "categoryTitle": "Algorithms", "frontendQuestionId": "2659", "paidOnly": false, "title": "Make Array Empty", "titleSlug": "make-array-empty", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11017, "totalSubmissionRaw": 43214}, "2660": {"acRate": 34.22471932108493, "difficulty": "Easy", "likes": 272, "dislikes": 155, "categoryTitle": "Algorithms", "frontendQuestionId": "2660", "paidOnly": false, "title": "Determine the Winner of a Bowling Game", "titleSlug": "determine-the-winner-of-a-bowling-game", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34964, "totalSubmissionRaw": 102162}, "2661": {"acRate": 50.64703911550381, "difficulty": "Medium", "likes": 429, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "2661", "paidOnly": false, "title": "First Completely Painted Row or Column", "titleSlug": "first-completely-painted-row-or-column", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24186, "totalSubmissionRaw": 47755}, "2662": {"acRate": 39.207874384813685, "difficulty": "Medium", "likes": 607, "dislikes": 83, "categoryTitle": "Algorithms", "frontendQuestionId": "2662", "paidOnly": false, "title": "Minimum Cost of a Path With Special Roads", "titleSlug": "minimum-cost-of-a-path-with-special-roads", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13384, "totalSubmissionRaw": 34136}, "2663": {"acRate": 37.51874866080994, "difficulty": "Hard", "likes": 191, "dislikes": 18, "categoryTitle": "Algorithms", "frontendQuestionId": "2663", "paidOnly": false, "title": "Lexicographically Smallest Beautiful String", "titleSlug": "lexicographically-smallest-beautiful-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5253, "totalSubmissionRaw": 14001}, "2664": {"acRate": 66.27164995442115, "difficulty": "Medium", "likes": 35, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "2664", "paidOnly": true, "title": "The Knight\u2019s Tour", "titleSlug": "the-knights-tour", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1454, "totalSubmissionRaw": 2194}, "2665": {"acRate": 80.17564536364674, "difficulty": "Easy", "likes": 721, "dislikes": 27, "categoryTitle": "JavaScript", "frontendQuestionId": "2665", "paidOnly": false, "title": "Counter II", "titleSlug": "counter-ii", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 210885, "totalSubmissionRaw": 263029}, "2666": {"acRate": 86.2497712935636, "difficulty": "Easy", "likes": 472, "dislikes": 54, "categoryTitle": "JavaScript", "frontendQuestionId": "2666", "paidOnly": false, "title": "Allow One Function Call", "titleSlug": "allow-one-function-call", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 108421, "totalSubmissionRaw": 125706}, "2667": {"acRate": 81.32601245267446, "difficulty": "Easy", "likes": 1265, "dislikes": 175, "categoryTitle": "JavaScript", "frontendQuestionId": "2667", "paidOnly": false, "title": "Create Hello World Function", "titleSlug": "create-hello-world-function", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 453232, "totalSubmissionRaw": 557304}, "2668": {"acRate": 72.09437246180622, "difficulty": "Easy", "likes": 19, "dislikes": 18, "categoryTitle": "Database", "frontendQuestionId": "2668", "paidOnly": true, "title": "Find Latest Salaries", "titleSlug": "find-latest-salaries", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 3728, "totalSubmissionRaw": 5171}, "2669": {"acRate": 72.41894197952219, "difficulty": "Easy", "likes": 16, "dislikes": 1, "categoryTitle": "Database", "frontendQuestionId": "2669", "paidOnly": true, "title": "Count Artist Occurrences On Spotify Ranking List", "titleSlug": "count-artist-occurrences-on-spotify-ranking-list", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3395, "totalSubmissionRaw": 4688}, "2670": {"acRate": 77.83101391650099, "difficulty": "Easy", "likes": 332, "dislikes": 32, "categoryTitle": "Algorithms", "frontendQuestionId": "2670", "paidOnly": false, "title": "Find the Distinct Difference Array", "titleSlug": "find-the-distinct-difference-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 39149, "totalSubmissionRaw": 50300}, "2671": {"acRate": 29.93212852487274, "difficulty": "Medium", "likes": 322, "dislikes": 28, "categoryTitle": "Algorithms", "frontendQuestionId": "2671", "paidOnly": false, "title": "Frequency Tracker", "titleSlug": "frequency-tracker", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22227, "totalSubmissionRaw": 74258}, "2672": {"acRate": 54.78381663483244, "difficulty": "Medium", "likes": 345, "dislikes": 96, "categoryTitle": "Algorithms", "frontendQuestionId": "2672", "paidOnly": false, "title": "Number of Adjacent Elements With the Same Color", "titleSlug": "number-of-adjacent-elements-with-the-same-color", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15775, "totalSubmissionRaw": 28795}, "2673": {"acRate": 59.17887308884849, "difficulty": "Medium", "likes": 596, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "2673", "paidOnly": false, "title": "Make Costs of Paths Equal in a Binary Tree", "titleSlug": "make-costs-of-paths-equal-in-a-binary-tree", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16605, "totalSubmissionRaw": 28059}, "2674": {"acRate": 74.50980392156863, "difficulty": "Medium", "likes": 39, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "2674", "paidOnly": true, "title": "Split a Circular Linked List", "titleSlug": "split-a-circular-linked-list", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1482, "totalSubmissionRaw": 1989}, "2675": {"acRate": 69.09261650428455, "difficulty": "Hard", "likes": 132, "dislikes": 72, "categoryTitle": "JavaScript", "frontendQuestionId": "2675", "paidOnly": true, "title": "Array of Objects to Matrix", "titleSlug": "array-of-objects-to-matrix", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 5886, "totalSubmissionRaw": 8519}, "2676": {"acRate": 82.65875476042866, "difficulty": "Medium", "likes": 162, "dislikes": 29, "categoryTitle": "JavaScript", "frontendQuestionId": "2676", "paidOnly": true, "title": "Throttle", "titleSlug": "throttle", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 9333, "totalSubmissionRaw": 11291}, "2677": {"acRate": 83.42953979770164, "difficulty": "Easy", "likes": 333, "dislikes": 5, "categoryTitle": "JavaScript", "frontendQuestionId": "2677", "paidOnly": false, "title": "Chunk Array", "titleSlug": "chunk-array", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 63016, "totalSubmissionRaw": 75532}, "2678": {"acRate": 81.7933340409723, "difficulty": "Easy", "likes": 701, "dislikes": 58, "categoryTitle": "Algorithms", "frontendQuestionId": "2678", "paidOnly": false, "title": "Number of Senior Citizens", "titleSlug": "number-of-senior-citizens", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 246584, "totalSubmissionRaw": 301472}, "2679": {"acRate": 60.05331692812468, "difficulty": "Medium", "likes": 348, "dislikes": 58, "categoryTitle": "Algorithms", "frontendQuestionId": "2679", "paidOnly": false, "title": "Sum in a Matrix", "titleSlug": "sum-in-a-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 35142, "totalSubmissionRaw": 58518}, "2680": {"acRate": 40.93255131964809, "difficulty": "Medium", "likes": 389, "dislikes": 45, "categoryTitle": "Algorithms", "frontendQuestionId": "2680", "paidOnly": false, "title": "Maximum OR", "titleSlug": "maximum-or", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13958, "totalSubmissionRaw": 34100}, "2681": {"acRate": 30.871192957603967, "difficulty": "Hard", "likes": 313, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2681", "paidOnly": false, "title": "Power of Heroes", "titleSlug": "power-of-heroes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9153, "totalSubmissionRaw": 29649}, "2682": {"acRate": 49.14313085438547, "difficulty": "Easy", "likes": 247, "dislikes": 38, "categoryTitle": "Algorithms", "frontendQuestionId": "2682", "paidOnly": false, "title": "Find the Losers of the Circular Game", "titleSlug": "find-the-losers-of-the-circular-game", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27701, "totalSubmissionRaw": 56368}, "2683": {"acRate": 61.957247828991314, "difficulty": "Medium", "likes": 270, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "2683", "paidOnly": false, "title": "Neighboring Bitwise XOR", "titleSlug": "neighboring-bitwise-xor", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22260, "totalSubmissionRaw": 35928}, "2684": {"acRate": 45.94788249047781, "difficulty": "Medium", "likes": 432, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "2684", "paidOnly": false, "title": "Maximum Number of Moves in a Grid", "titleSlug": "maximum-number-of-moves-in-a-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24368, "totalSubmissionRaw": 53034}, "2685": {"acRate": 65.96119929453262, "difficulty": "Medium", "likes": 663, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2685", "paidOnly": false, "title": "Count the Number of Complete Components", "titleSlug": "count-the-number-of-complete-components", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29172, "totalSubmissionRaw": 44226}, "2686": {"acRate": 67.3076923076923, "difficulty": "Medium", "likes": 14, "dislikes": 1, "categoryTitle": "Database", "frontendQuestionId": "2686", "paidOnly": true, "title": "Immediate Food Delivery III", "titleSlug": "immediate-food-delivery-iii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3290, "totalSubmissionRaw": 4888}, "2687": {"acRate": 80.53885548875529, "difficulty": "Easy", "likes": 21, "dislikes": 3, "categoryTitle": "Database", "frontendQuestionId": "2687", "paidOnly": true, "title": "Bikes Last Time Used ", "titleSlug": "bikes-last-time-used", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3617, "totalSubmissionRaw": 4491}, "2688": {"acRate": 42.25881742738589, "difficulty": "Medium", "likes": 20, "dislikes": 8, "categoryTitle": "Database", "frontendQuestionId": "2688", "paidOnly": true, "title": "Find Active Users", "titleSlug": "find-active-users", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3259, "totalSubmissionRaw": 7712}, "2689": {"acRate": 74.18839808408728, "difficulty": "Easy", "likes": 36, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "2689", "paidOnly": true, "title": "Extract Kth Character From The Rope Tree", "titleSlug": "extract-kth-character-from-the-rope-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2788, "totalSubmissionRaw": 3758}, "2690": {"acRate": 93.01801801801803, "difficulty": "Easy", "likes": 27, "dislikes": 6, "categoryTitle": "JavaScript", "frontendQuestionId": "2690", "paidOnly": true, "title": "Infinite Method Object", "titleSlug": "infinite-method-object", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1239, "totalSubmissionRaw": 1332}, "2691": {"acRate": 37.254901960784316, "difficulty": "Hard", "likes": 11, "dislikes": 8, "categoryTitle": "JavaScript", "frontendQuestionId": "2691", "paidOnly": true, "title": "Immutability Helper", "titleSlug": "immutability-helper", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 190, "totalSubmissionRaw": 510}, "2692": {"acRate": 62.70096463022507, "difficulty": "Medium", "likes": 16, "dislikes": 0, "categoryTitle": "JavaScript", "frontendQuestionId": "2692", "paidOnly": true, "title": "Make Object Immutable", "titleSlug": "make-object-immutable", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 390, "totalSubmissionRaw": 622}, "2693": {"acRate": 79.91262969030346, "difficulty": "Medium", "likes": 139, "dislikes": 13, "categoryTitle": "JavaScript", "frontendQuestionId": "2693", "paidOnly": false, "title": "Call Function with Custom Context", "titleSlug": "call-function-with-custom-context", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 10244, "totalSubmissionRaw": 12819}, "2694": {"acRate": 74.3156033593635, "difficulty": "Medium", "likes": 238, "dislikes": 28, "categoryTitle": "JavaScript", "frontendQuestionId": "2694", "paidOnly": false, "title": "Event Emitter", "titleSlug": "event-emitter", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 25219, "totalSubmissionRaw": 33935}, "2695": {"acRate": 88.15203668017809, "difficulty": "Easy", "likes": 225, "dislikes": 47, "categoryTitle": "JavaScript", "frontendQuestionId": "2695", "paidOnly": false, "title": "Array Wrapper", "titleSlug": "array-wrapper", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 39798, "totalSubmissionRaw": 45147}, "2696": {"acRate": 69.8725070094694, "difficulty": "Easy", "likes": 408, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "2696", "paidOnly": false, "title": "Minimum String Length After Removing Substrings", "titleSlug": "minimum-string-length-after-removing-substrings", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 52832, "totalSubmissionRaw": 75612}, "2697": {"acRate": 82.00312989045383, "difficulty": "Easy", "likes": 348, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "2697", "paidOnly": false, "title": "Lexicographically Smallest Palindrome", "titleSlug": "lexicographically-smallest-palindrome", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 54496, "totalSubmissionRaw": 66456}, "2698": {"acRate": 62.71793275217933, "difficulty": "Medium", "likes": 476, "dislikes": 30, "categoryTitle": "Algorithms", "frontendQuestionId": "2698", "paidOnly": false, "title": "Find the Punishment Number of an Integer", "titleSlug": "find-the-punishment-number-of-an-integer", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20145, "totalSubmissionRaw": 32120}, "2699": {"acRate": 24.607253685027153, "difficulty": "Hard", "likes": 275, "dislikes": 48, "categoryTitle": "Algorithms", "frontendQuestionId": "2699", "paidOnly": false, "title": "Modify Graph Edge Weights", "titleSlug": "modify-graph-edge-weights", "topicTags": [{"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5075, "totalSubmissionRaw": 20624}, "2700": {"acRate": 76.3788592360021, "difficulty": "Medium", "likes": 145, "dislikes": 30, "categoryTitle": "JavaScript", "frontendQuestionId": "2700", "paidOnly": true, "title": "Differences Between Two Objects", "titleSlug": "differences-between-two-objects", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 7298, "totalSubmissionRaw": 9555}, "2701": {"acRate": 32.59215915740199, "difficulty": "Hard", "likes": 45, "dislikes": 5, "categoryTitle": "Database", "frontendQuestionId": "2701", "paidOnly": true, "title": "Consecutive Transactions with Increasing Amounts", "titleSlug": "consecutive-transactions-with-increasing-amounts", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 2785, "totalSubmissionRaw": 8545}, "2702": {"acRate": 46.46053702196908, "difficulty": "Hard", "likes": 38, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "2702", "paidOnly": true, "title": "Minimum Operations to Make Numbers Non-positive", "titleSlug": "minimum-operations-to-make-numbers-non-positive", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1713, "totalSubmissionRaw": 3687}, "2703": {"acRate": 94.30638226523108, "difficulty": "Easy", "likes": 308, "dislikes": 153, "categoryTitle": "JavaScript", "frontendQuestionId": "2703", "paidOnly": false, "title": "Return Length of Arguments Passed", "titleSlug": "return-length-of-arguments-passed", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 157486, "totalSubmissionRaw": 166994}, "2704": {"acRate": 62.39726119988104, "difficulty": "Easy", "likes": 642, "dislikes": 155, "categoryTitle": "JavaScript", "frontendQuestionId": "2704", "paidOnly": false, "title": "To Be Or Not To Be", "titleSlug": "to-be-or-not-to-be", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 184631, "totalSubmissionRaw": 295896}, "2705": {"acRate": 64.97354497354497, "difficulty": "Medium", "likes": 175, "dislikes": 21, "categoryTitle": "JavaScript", "frontendQuestionId": "2705", "paidOnly": false, "title": "Compact Object", "titleSlug": "compact-object", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 23332, "totalSubmissionRaw": 35906}, "2706": {"acRate": 69.14364599319912, "difficulty": "Easy", "likes": 983, "dislikes": 68, "categoryTitle": "Algorithms", "frontendQuestionId": "2706", "paidOnly": false, "title": "Buy Two Chocolates", "titleSlug": "buy-two-chocolates", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 183817, "totalSubmissionRaw": 265848}, "2707": {"acRate": 52.5403405598872, "difficulty": "Medium", "likes": 2082, "dislikes": 94, "categoryTitle": "Algorithms", "frontendQuestionId": "2707", "paidOnly": false, "title": "Extra Characters in a String", "titleSlug": "extra-characters-in-a-string", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 87197, "totalSubmissionRaw": 165962}, "2708": {"acRate": 24.277187486771368, "difficulty": "Medium", "likes": 356, "dislikes": 57, "categoryTitle": "Algorithms", "frontendQuestionId": "2708", "paidOnly": false, "title": "Maximum Strength of a Group", "titleSlug": "maximum-strength-of-a-group", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28675, "totalSubmissionRaw": 118115}, "2709": {"acRate": 42.45483975786167, "difficulty": "Hard", "likes": 811, "dislikes": 135, "categoryTitle": "Algorithms", "frontendQuestionId": "2709", "paidOnly": false, "title": "Greatest Common Divisor Traversal", "titleSlug": "greatest-common-divisor-traversal", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 70554, "totalSubmissionRaw": 166186}, "2710": {"acRate": 78.83071449747999, "difficulty": "Easy", "likes": 315, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "2710", "paidOnly": false, "title": "Remove Trailing Zeros From a String", "titleSlug": "remove-trailing-zeros-from-a-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 66474, "totalSubmissionRaw": 84325}, "2711": {"acRate": 71.19023544706053, "difficulty": "Medium", "likes": 124, "dislikes": 206, "categoryTitle": "Algorithms", "frontendQuestionId": "2711", "paidOnly": false, "title": "Difference of Number of Distinct Values on Diagonals", "titleSlug": "difference-of-number-of-distinct-values-on-diagonals", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19714, "totalSubmissionRaw": 27692}, "2712": {"acRate": 54.581323980710216, "difficulty": "Medium", "likes": 530, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "2712", "paidOnly": false, "title": "Minimum Cost to Make All Characters Equal", "titleSlug": "minimum-cost-to-make-all-characters-equal", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18675, "totalSubmissionRaw": 34215}, "2713": {"acRate": 30.645998489996224, "difficulty": "Hard", "likes": 576, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "2713", "paidOnly": false, "title": "Maximum Strictly Increasing Cells in a Matrix", "titleSlug": "maximum-strictly-increasing-cells-in-a-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12989, "totalSubmissionRaw": 42384}, "2714": {"acRate": 61.72607879924953, "difficulty": "Hard", "likes": 30, "dislikes": 0, "categoryTitle": "Algorithms", "frontendQuestionId": "2714", "paidOnly": true, "title": "Find Shortest Path with K Hops", "titleSlug": "find-shortest-path-with-k-hops", "topicTags": [{"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 987, "totalSubmissionRaw": 1599}, "2715": {"acRate": 88.69780596202153, "difficulty": "Easy", "likes": 228, "dislikes": 290, "categoryTitle": "JavaScript", "frontendQuestionId": "2715", "paidOnly": false, "title": "Timeout Cancellation", "titleSlug": "timeout-cancellation", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 50493, "totalSubmissionRaw": 56927}, "2716": {"acRate": 76.37461666756336, "difficulty": "Easy", "likes": 324, "dislikes": 93, "categoryTitle": "Algorithms", "frontendQuestionId": "2716", "paidOnly": false, "title": "Minimize String Length", "titleSlug": "minimize-string-length", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 56783, "totalSubmissionRaw": 74348}, "2717": {"acRate": 63.98551609097197, "difficulty": "Easy", "likes": 207, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2717", "paidOnly": false, "title": "Semi-Ordered Permutation", "titleSlug": "semi-ordered-permutation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 31454, "totalSubmissionRaw": 49158}, "2718": {"acRate": 30.928500205290632, "difficulty": "Medium", "likes": 690, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "2718", "paidOnly": false, "title": "Sum of Matrix After Queries", "titleSlug": "sum-of-matrix-after-queries", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21092, "totalSubmissionRaw": 68196}, "2719": {"acRate": 34.56265808949817, "difficulty": "Hard", "likes": 525, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "2719", "paidOnly": false, "title": "Count of Integers", "titleSlug": "count-of-integers", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11068, "totalSubmissionRaw": 32022}, "2720": {"acRate": 51.35740274279317, "difficulty": "Hard", "likes": 13, "dislikes": 9, "categoryTitle": "Database", "frontendQuestionId": "2720", "paidOnly": true, "title": "Popularity Percentage", "titleSlug": "popularity-percentage", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1835, "totalSubmissionRaw": 3573}, "2721": {"acRate": 75.11046077925059, "difficulty": "Medium", "likes": 186, "dislikes": 45, "categoryTitle": "JavaScript", "frontendQuestionId": "2721", "paidOnly": false, "title": "Execute Asynchronous Functions in Parallel", "titleSlug": "execute-asynchronous-functions-in-parallel", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 26179, "totalSubmissionRaw": 34854}, "2722": {"acRate": 54.63550700019668, "difficulty": "Medium", "likes": 166, "dislikes": 52, "categoryTitle": "JavaScript", "frontendQuestionId": "2722", "paidOnly": false, "title": "Join Two Arrays by ID", "titleSlug": "join-two-arrays-by-id", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 30556, "totalSubmissionRaw": 55927}, "2723": {"acRate": 91.37319556007132, "difficulty": "Easy", "likes": 267, "dislikes": 26, "categoryTitle": "JavaScript", "frontendQuestionId": "2723", "paidOnly": false, "title": "Add Two Promises", "titleSlug": "add-two-promises", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 95326, "totalSubmissionRaw": 104326}, "2724": {"acRate": 82.5411128632575, "difficulty": "Easy", "likes": 169, "dislikes": 37, "categoryTitle": "JavaScript", "frontendQuestionId": "2724", "paidOnly": false, "title": "Sort By", "titleSlug": "sort-by", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 40304, "totalSubmissionRaw": 48829}, "2725": {"acRate": 80.73826163992518, "difficulty": "Easy", "likes": 158, "dislikes": 84, "categoryTitle": "JavaScript", "frontendQuestionId": "2725", "paidOnly": false, "title": "Interval Cancellation", "titleSlug": "interval-cancellation", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 41011, "totalSubmissionRaw": 50795}, "2726": {"acRate": 75.43355733795795, "difficulty": "Easy", "likes": 109, "dislikes": 19, "categoryTitle": "JavaScript", "frontendQuestionId": "2726", "paidOnly": false, "title": "Calculator with Method Chaining", "titleSlug": "calculator-with-method-chaining", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 27838, "totalSubmissionRaw": 36904}, "2727": {"acRate": 80.22782337346035, "difficulty": "Easy", "likes": 173, "dislikes": 11, "categoryTitle": "JavaScript", "frontendQuestionId": "2727", "paidOnly": false, "title": "Is Object Empty", "titleSlug": "is-object-empty", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 63246, "totalSubmissionRaw": 78833}, "2728": {"acRate": 84.87394957983193, "difficulty": "Easy", "likes": 52, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "2728", "paidOnly": true, "title": "Count Houses in a Circular Street", "titleSlug": "count-houses-in-a-circular-street", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2121, "totalSubmissionRaw": 2499}, "2729": {"acRate": 52.17491714876271, "difficulty": "Easy", "likes": 230, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "2729", "paidOnly": false, "title": "Check if The Number is Fascinating", "titleSlug": "check-if-the-number-is-fascinating", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 45184, "totalSubmissionRaw": 86601}, "2730": {"acRate": 36.99551919564097, "difficulty": "Medium", "likes": 286, "dislikes": 84, "categoryTitle": "Algorithms", "frontendQuestionId": "2730", "paidOnly": false, "title": "Find the Longest Semi-Repetitive Substring", "titleSlug": "find-the-longest-semi-repetitive-substring", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23696, "totalSubmissionRaw": 64051}, "2731": {"acRate": 27.95176756245113, "difficulty": "Medium", "likes": 484, "dislikes": 93, "categoryTitle": "Algorithms", "frontendQuestionId": "2731", "paidOnly": false, "title": "Movement of Robots", "titleSlug": "movement-of-robots", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Brainteaser", "id": "VG9waWNUYWdOb2RlOjMy", "slug": "brainteaser"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13584, "totalSubmissionRaw": 48598}, "2732": {"acRate": 45.75943459127883, "difficulty": "Hard", "likes": 208, "dislikes": 26, "categoryTitle": "Algorithms", "frontendQuestionId": "2732", "paidOnly": false, "title": "Find a Good Subset of the Matrix", "titleSlug": "find-a-good-subset-of-the-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6863, "totalSubmissionRaw": 14998}, "2733": {"acRate": 76.59658769305409, "difficulty": "Easy", "likes": 346, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "2733", "paidOnly": false, "title": "Neither Minimum nor Maximum", "titleSlug": "neither-minimum-nor-maximum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 94727, "totalSubmissionRaw": 123670}, "2734": {"acRate": 31.058850521968566, "difficulty": "Medium", "likes": 241, "dislikes": 184, "categoryTitle": "Algorithms", "frontendQuestionId": "2734", "paidOnly": false, "title": "Lexicographically Smallest String After Substring Operation", "titleSlug": "lexicographically-smallest-string-after-substring-operation", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27074, "totalSubmissionRaw": 87170}, "2735": {"acRate": 33.28854927645758, "difficulty": "Medium", "likes": 287, "dislikes": 537, "categoryTitle": "Algorithms", "frontendQuestionId": "2735", "paidOnly": false, "title": "Collecting Chocolates", "titleSlug": "collecting-chocolates", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11893, "totalSubmissionRaw": 35727}, "2736": {"acRate": 29.194386694386694, "difficulty": "Hard", "likes": 330, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "2736", "paidOnly": false, "title": "Maximum Sum Queries", "titleSlug": "maximum-sum-queries", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5617, "totalSubmissionRaw": 19240}, "2737": {"acRate": 57.37211634904714, "difficulty": "Medium", "likes": 34, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "2737", "paidOnly": true, "title": "Find the Closest Marked Node", "titleSlug": "find-the-closest-marked-node", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1716, "totalSubmissionRaw": 2991}, "2738": {"acRate": 55.501222493887525, "difficulty": "Medium", "likes": 20, "dislikes": 45, "categoryTitle": "Database", "frontendQuestionId": "2738", "paidOnly": true, "title": "Count Occurrences in Text", "titleSlug": "count-occurrences-in-text", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 4994, "totalSubmissionRaw": 8998}, "2739": {"acRate": 39.27639074540904, "difficulty": "Easy", "likes": 283, "dislikes": 96, "categoryTitle": "Algorithms", "frontendQuestionId": "2739", "paidOnly": false, "title": "Total Distance Traveled", "titleSlug": "total-distance-traveled", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 43781, "totalSubmissionRaw": 111469}, "2740": {"acRate": 65.38716469120399, "difficulty": "Medium", "likes": 283, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "2740", "paidOnly": false, "title": "Find the Value of the Partition", "titleSlug": "find-the-value-of-the-partition", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33541, "totalSubmissionRaw": 51296}, "2741": {"acRate": 28.50250178699071, "difficulty": "Medium", "likes": 556, "dislikes": 61, "categoryTitle": "Algorithms", "frontendQuestionId": "2741", "paidOnly": false, "title": "Special Permutations", "titleSlug": "special-permutations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14355, "totalSubmissionRaw": 50364}, "2742": {"acRate": 50.79788276808469, "difficulty": "Hard", "likes": 1370, "dislikes": 83, "categoryTitle": "Algorithms", "frontendQuestionId": "2742", "paidOnly": false, "title": "Painting the Walls", "titleSlug": "painting-the-walls", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 64780, "totalSubmissionRaw": 127525}, "2743": {"acRate": 76.68016194331983, "difficulty": "Medium", "likes": 83, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "2743", "paidOnly": true, "title": "Count Substrings Without Repeating Character", "titleSlug": "count-substrings-without-repeating-character", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 6629, "totalSubmissionRaw": 8645}, "2744": {"acRate": 81.5311510031679, "difficulty": "Easy", "likes": 354, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "2744", "paidOnly": false, "title": "Find Maximum Number of String Pairs", "titleSlug": "find-maximum-number-of-string-pairs", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 69489, "totalSubmissionRaw": 85230}, "2745": {"acRate": 53.94079406866169, "difficulty": "Medium", "likes": 308, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "2745", "paidOnly": false, "title": "Construct the Longest New String", "titleSlug": "construct-the-longest-new-string", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Brainteaser", "id": "VG9waWNUYWdOb2RlOjMy", "slug": "brainteaser"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20080, "totalSubmissionRaw": 37226}, "2746": {"acRate": 26.902478914793313, "difficulty": "Medium", "likes": 358, "dislikes": 32, "categoryTitle": "Algorithms", "frontendQuestionId": "2746", "paidOnly": false, "title": "Decremental String Concatenation", "titleSlug": "decremental-string-concatenation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8389, "totalSubmissionRaw": 31183}, "2747": {"acRate": 32.37590072057646, "difficulty": "Medium", "likes": 338, "dislikes": 38, "categoryTitle": "Algorithms", "frontendQuestionId": "2747", "paidOnly": false, "title": "Count Zero Request Servers", "titleSlug": "count-zero-request-servers", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6470, "totalSubmissionRaw": 19984}, "2748": {"acRate": 50.31139490600884, "difficulty": "Easy", "likes": 206, "dislikes": 36, "categoryTitle": "Algorithms", "frontendQuestionId": "2748", "paidOnly": false, "title": "Number of Beautiful Pairs", "titleSlug": "number-of-beautiful-pairs", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 35141, "totalSubmissionRaw": 69847}, "2749": {"acRate": 29.897936889416027, "difficulty": "Medium", "likes": 283, "dislikes": 286, "categoryTitle": "Algorithms", "frontendQuestionId": "2749", "paidOnly": false, "title": "Minimum Operations to Make the Integer Zero", "titleSlug": "minimum-operations-to-make-the-integer-zero", "topicTags": [{"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Brainteaser", "id": "VG9waWNUYWdOb2RlOjMy", "slug": "brainteaser"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9579, "totalSubmissionRaw": 32039}, "2750": {"acRate": 34.1553114243953, "difficulty": "Medium", "likes": 436, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "2750", "paidOnly": false, "title": "Ways to Split Array Into Good Subarrays", "titleSlug": "ways-to-split-array-into-good-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21732, "totalSubmissionRaw": 63627}, "2751": {"acRate": 57.116268370339775, "difficulty": "Hard", "likes": 1117, "dislikes": 97, "categoryTitle": "Algorithms", "frontendQuestionId": "2751", "paidOnly": false, "title": "Robot Collisions", "titleSlug": "robot-collisions", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 109248, "totalSubmissionRaw": 191272}, "2752": {"acRate": 37.87619280645951, "difficulty": "Hard", "likes": 12, "dislikes": 25, "categoryTitle": "Database", "frontendQuestionId": "2752", "paidOnly": true, "title": "Customers with Maximum Number of Transactions on Consecutive Days", "titleSlug": "customers-with-maximum-number-of-transactions-on-consecutive-days", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1548, "totalSubmissionRaw": 4087}, "2753": {"acRate": 67.60154738878144, "difficulty": "Hard", "likes": 27, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "2753", "paidOnly": true, "title": "Count Houses in a Circular Street II", "titleSlug": "count-houses-in-a-circular-street-ii", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 699, "totalSubmissionRaw": 1034}, "2754": {"acRate": 86.86440677966102, "difficulty": "Medium", "likes": 16, "dislikes": 0, "categoryTitle": "JavaScript", "frontendQuestionId": "2754", "paidOnly": true, "title": "Bind Function to Context", "titleSlug": "bind-function-to-context", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 615, "totalSubmissionRaw": 708}, "2755": {"acRate": 64.43037974683544, "difficulty": "Medium", "likes": 14, "dislikes": 4, "categoryTitle": "JavaScript", "frontendQuestionId": "2755", "paidOnly": true, "title": "Deep Merge of Two Objects", "titleSlug": "deep-merge-of-two-objects", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 509, "totalSubmissionRaw": 790}, "2756": {"acRate": 63.01969365426696, "difficulty": "Hard", "likes": 14, "dislikes": 5, "categoryTitle": "JavaScript", "frontendQuestionId": "2756", "paidOnly": true, "title": "Query Batching", "titleSlug": "query-batching", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 288, "totalSubmissionRaw": 457}, "2757": {"acRate": 71.19266055045873, "difficulty": "Medium", "likes": 11, "dislikes": 1, "categoryTitle": "JavaScript", "frontendQuestionId": "2757", "paidOnly": true, "title": "Generate Circular Array Values", "titleSlug": "generate-circular-array-values", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 388, "totalSubmissionRaw": 545}, "2758": {"acRate": 83.73764600179695, "difficulty": "Easy", "likes": 13, "dislikes": 1, "categoryTitle": "JavaScript", "frontendQuestionId": "2758", "paidOnly": true, "title": "Next Day", "titleSlug": "next-day", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 932, "totalSubmissionRaw": 1113}, "2759": {"acRate": 61.586901763224176, "difficulty": "Hard", "likes": 16, "dislikes": 3, "categoryTitle": "JavaScript", "frontendQuestionId": "2759", "paidOnly": true, "title": "Convert JSON String to Object", "titleSlug": "convert-json-string-to-object", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 489, "totalSubmissionRaw": 794}, "2760": {"acRate": 29.73875514859121, "difficulty": "Easy", "likes": 293, "dislikes": 270, "categoryTitle": "Algorithms", "frontendQuestionId": "2760", "paidOnly": false, "title": "Longest Even Odd Subarray With Threshold", "titleSlug": "longest-even-odd-subarray-with-threshold", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 36245, "totalSubmissionRaw": 121878}, "2761": {"acRate": 34.33821253768297, "difficulty": "Medium", "likes": 360, "dislikes": 33, "categoryTitle": "Algorithms", "frontendQuestionId": "2761", "paidOnly": false, "title": "Prime Pairs With Target Sum", "titleSlug": "prime-pairs-with-target-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29957, "totalSubmissionRaw": 87241}, "2762": {"acRate": 41.265682883399165, "difficulty": "Medium", "likes": 699, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "2762", "paidOnly": false, "title": "Continuous Subarrays", "titleSlug": "continuous-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}, {"name": "Monotonic Queue", "id": "VG9waWNUYWdOb2RlOjYxMDcx", "slug": "monotonic-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20162, "totalSubmissionRaw": 48859}, "2763": {"acRate": 46.64816267422916, "difficulty": "Hard", "likes": 305, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "2763", "paidOnly": false, "title": "Sum of Imbalance Numbers of All Subarrays", "titleSlug": "sum-of-imbalance-numbers-of-all-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7731, "totalSubmissionRaw": 16573}, "2764": {"acRate": 65.81298391899941, "difficulty": "Medium", "likes": 31, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "2764", "paidOnly": true, "title": "Is Array a Preorder of Some \u200cBinary Tree", "titleSlug": "is-array-a-preorder-of-some-binary-tree", "topicTags": [{"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1105, "totalSubmissionRaw": 1679}, "2765": {"acRate": 34.14112809900478, "difficulty": "Easy", "likes": 215, "dislikes": 174, "categoryTitle": "Algorithms", "frontendQuestionId": "2765", "paidOnly": false, "title": "Longest Alternating Subarray", "titleSlug": "longest-alternating-subarray", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25077, "totalSubmissionRaw": 73451}, "2766": {"acRate": 51.85204003861592, "difficulty": "Medium", "likes": 196, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "2766", "paidOnly": false, "title": "Relocate Marbles", "titleSlug": "relocate-marbles", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20410, "totalSubmissionRaw": 39362}, "2767": {"acRate": 53.5110680239134, "difficulty": "Medium", "likes": 351, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "2767", "paidOnly": false, "title": "Partition String Into Minimum Beautiful Substrings", "titleSlug": "partition-string-into-minimum-beautiful-substrings", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16559, "totalSubmissionRaw": 30945}, "2768": {"acRate": 36.3989871586182, "difficulty": "Medium", "likes": 226, "dislikes": 23, "categoryTitle": "Algorithms", "frontendQuestionId": "2768", "paidOnly": false, "title": "Number of Black Blocks", "titleSlug": "number-of-black-blocks", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8050, "totalSubmissionRaw": 22116}, "2769": {"acRate": 90.66696638942312, "difficulty": "Easy", "likes": 352, "dislikes": 512, "categoryTitle": "Algorithms", "frontendQuestionId": "2769", "paidOnly": false, "title": "Find the Maximum Achievable Number", "titleSlug": "find-the-maximum-achievable-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 108900, "totalSubmissionRaw": 120110}, "2770": {"acRate": 31.27495281130241, "difficulty": "Medium", "likes": 422, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "2770", "paidOnly": false, "title": "Maximum Number of Jumps to Reach the Last Index", "titleSlug": "maximum-number-of-jumps-to-reach-the-last-index", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27339, "totalSubmissionRaw": 87415}, "2771": {"acRate": 29.566747515099635, "difficulty": "Medium", "likes": 588, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "2771", "paidOnly": false, "title": "Longest Non-decreasing Subarray From Two Arrays", "titleSlug": "longest-non-decreasing-subarray-from-two-arrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24868, "totalSubmissionRaw": 84108}, "2772": {"acRate": 33.30192283203871, "difficulty": "Medium", "likes": 384, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "2772", "paidOnly": false, "title": "Apply Operations to Make All Array Elements Equal to Zero", "titleSlug": "apply-operations-to-make-all-array-elements-equal-to-zero", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13076, "totalSubmissionRaw": 39265}, "2773": {"acRate": 74.87875848690592, "difficulty": "Medium", "likes": 10, "dislikes": 36, "categoryTitle": "Algorithms", "frontendQuestionId": "2773", "paidOnly": true, "title": "Height of Special Binary Tree", "titleSlug": "height-of-special-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 772, "totalSubmissionRaw": 1031}, "2774": {"acRate": 81.64481525625746, "difficulty": "Easy", "likes": 21, "dislikes": 2, "categoryTitle": "JavaScript", "frontendQuestionId": "2774", "paidOnly": true, "title": "Array Upper Bound", "titleSlug": "array-upper-bound", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1370, "totalSubmissionRaw": 1678}, "2775": {"acRate": 68.46625766871166, "difficulty": "Medium", "likes": 15, "dislikes": 1, "categoryTitle": "JavaScript", "frontendQuestionId": "2775", "paidOnly": true, "title": "Undefined to Null", "titleSlug": "undefined-to-null", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 558, "totalSubmissionRaw": 815}, "2776": {"acRate": 91.72932330827066, "difficulty": "Medium", "likes": 17, "dislikes": 9, "categoryTitle": "JavaScript", "frontendQuestionId": "2776", "paidOnly": true, "title": "Convert Callback Based Function to Promise Based Function", "titleSlug": "convert-callback-based-function-to-promise-based-function", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 732, "totalSubmissionRaw": 798}, "2777": {"acRate": 80.67940552016985, "difficulty": "Medium", "likes": 10, "dislikes": 2, "categoryTitle": "JavaScript", "frontendQuestionId": "2777", "paidOnly": true, "title": "Date Range Generator", "titleSlug": "date-range-generator", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 380, "totalSubmissionRaw": 471}, "2778": {"acRate": 81.56850147993484, "difficulty": "Easy", "likes": 275, "dislikes": 108, "categoryTitle": "Algorithms", "frontendQuestionId": "2778", "paidOnly": false, "title": "Sum of Squares of Special Elements ", "titleSlug": "sum-of-squares-of-special-elements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 71100, "totalSubmissionRaw": 87166}, "2779": {"acRate": 38.42691909569601, "difficulty": "Medium", "likes": 611, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "2779", "paidOnly": false, "title": "Maximum Beauty of an Array After Applying Operation", "titleSlug": "maximum-beauty-of-an-array-after-applying-operation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25615, "totalSubmissionRaw": 66659}, "2780": {"acRate": 62.269295302013425, "difficulty": "Medium", "likes": 333, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "2780", "paidOnly": false, "title": "Minimum Index of a Valid Split", "titleSlug": "minimum-index-of-a-valid-split", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23752, "totalSubmissionRaw": 38144}, "2781": {"acRate": 37.901429311112985, "difficulty": "Hard", "likes": 556, "dislikes": 23, "categoryTitle": "Algorithms", "frontendQuestionId": "2781", "paidOnly": false, "title": "Length of the Longest Valid Substring", "titleSlug": "length-of-the-longest-valid-substring", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 31476, "totalSubmissionRaw": 83047}, "2782": {"acRate": 83.4785903751421, "difficulty": "Medium", "likes": 33, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "2782", "paidOnly": true, "title": "Number of Unique Categories", "titleSlug": "number-of-unique-categories", "topicTags": [{"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 2203, "totalSubmissionRaw": 2639}, "2783": {"acRate": 37.607585703865794, "difficulty": "Medium", "likes": 17, "dislikes": 5, "categoryTitle": "Database", "frontendQuestionId": "2783", "paidOnly": true, "title": "Flight Occupancy and Waitlist Analysis", "titleSlug": "flight-occupancy-and-waitlist-analysis", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 2578, "totalSubmissionRaw": 6855}, "2784": {"acRate": 49.30801320706222, "difficulty": "Easy", "likes": 270, "dislikes": 50, "categoryTitle": "Algorithms", "frontendQuestionId": "2784", "paidOnly": false, "title": "Check if Array is Good", "titleSlug": "check-if-array-is-good", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 49879, "totalSubmissionRaw": 101158}, "2785": {"acRate": 81.31747760832728, "difficulty": "Medium", "likes": 990, "dislikes": 57, "categoryTitle": "Algorithms", "frontendQuestionId": "2785", "paidOnly": false, "title": "Sort Vowels in a String", "titleSlug": "sort-vowels-in-a-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 134369, "totalSubmissionRaw": 165240}, "2786": {"acRate": 36.13869564419318, "difficulty": "Medium", "likes": 475, "dislikes": 26, "categoryTitle": "Algorithms", "frontendQuestionId": "2786", "paidOnly": false, "title": "Visit Array Positions to Maximize Score", "titleSlug": "visit-array-positions-to-maximize-score", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19688, "totalSubmissionRaw": 54479}, "2787": {"acRate": 33.887589076815914, "difficulty": "Medium", "likes": 402, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "2787", "paidOnly": false, "title": "Ways to Express an Integer as Sum of Powers", "titleSlug": "ways-to-express-an-integer-as-sum-of-powers", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18974, "totalSubmissionRaw": 55991}, "2788": {"acRate": 74.38885692495016, "difficulty": "Easy", "likes": 310, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "2788", "paidOnly": false, "title": "Split Strings by Separator", "titleSlug": "split-strings-by-separator", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 55596, "totalSubmissionRaw": 74737}, "2789": {"acRate": 47.24833255777881, "difficulty": "Medium", "likes": 464, "dislikes": 31, "categoryTitle": "Algorithms", "frontendQuestionId": "2789", "paidOnly": false, "title": "Largest Element in an Array after Merge Operations", "titleSlug": "largest-element-in-an-array-after-merge-operations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30461, "totalSubmissionRaw": 64470}, "2790": {"acRate": 20.118780864533253, "difficulty": "Hard", "likes": 400, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "2790", "paidOnly": false, "title": "Maximum Number of Groups With Increasing Length", "titleSlug": "maximum-number-of-groups-with-increasing-length", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9248, "totalSubmissionRaw": 45967}, "2791": {"acRate": 48.220521584070134, "difficulty": "Hard", "likes": 384, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "2791", "paidOnly": false, "title": "Count Paths That Can Form a Palindrome in a Tree", "titleSlug": "count-paths-that-can-form-a-palindrome-in-a-tree", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6490, "totalSubmissionRaw": 13459}, "2792": {"acRate": 58.69410929737402, "difficulty": "Hard", "likes": 19, "dislikes": 0, "categoryTitle": "Algorithms", "frontendQuestionId": "2792", "paidOnly": true, "title": "Count Nodes That Are Great Enough", "titleSlug": "count-nodes-that-are-great-enough", "topicTags": [{"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 827, "totalSubmissionRaw": 1409}, "2793": {"acRate": 74.85306465155331, "difficulty": "Hard", "likes": 10, "dislikes": 20, "categoryTitle": "Database", "frontendQuestionId": "2793", "paidOnly": true, "title": "Status of Flight Tickets", "titleSlug": "status-of-flight-tickets", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1783, "totalSubmissionRaw": 2382}, "2794": {"acRate": 63.67684478371501, "difficulty": "Easy", "likes": 9, "dislikes": 3, "categoryTitle": "JavaScript", "frontendQuestionId": "2794", "paidOnly": true, "title": "Create Object from Two Arrays", "titleSlug": "create-object-from-two-arrays", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1001, "totalSubmissionRaw": 1572}, "2795": {"acRate": 87.93893129770993, "difficulty": "Medium", "likes": 13, "dislikes": 5, "categoryTitle": "JavaScript", "frontendQuestionId": "2795", "paidOnly": true, "title": "Parallel Execution of Promises for Individual Results Retrieval", "titleSlug": "parallel-execution-of-promises-for-individual-results-retrieval", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 576, "totalSubmissionRaw": 655}, "2796": {"acRate": 92.75653923541248, "difficulty": "Easy", "likes": 25, "dislikes": 2, "categoryTitle": "JavaScript", "frontendQuestionId": "2796", "paidOnly": true, "title": "Repeat String", "titleSlug": "repeat-string", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 2305, "totalSubmissionRaw": 2485}, "2797": {"acRate": 90.55404178019982, "difficulty": "Easy", "likes": 10, "dislikes": 4, "categoryTitle": "JavaScript", "frontendQuestionId": "2797", "paidOnly": true, "title": "Partial Function with Placeholders", "titleSlug": "partial-function-with-placeholders", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 997, "totalSubmissionRaw": 1101}, "2798": {"acRate": 87.76970789376027, "difficulty": "Easy", "likes": 497, "dislikes": 68, "categoryTitle": "Algorithms", "frontendQuestionId": "2798", "paidOnly": false, "title": "Number of Employees Who Met the Target", "titleSlug": "number-of-employees-who-met-the-target", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 165560, "totalSubmissionRaw": 188630}, "2799": {"acRate": 65.2195354756602, "difficulty": "Medium", "likes": 558, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "2799", "paidOnly": false, "title": "Count Complete Subarrays in an Array", "titleSlug": "count-complete-subarrays-in-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 40997, "totalSubmissionRaw": 62860}, "2800": {"acRate": 30.578302916861645, "difficulty": "Medium", "likes": 323, "dislikes": 262, "categoryTitle": "Algorithms", "frontendQuestionId": "2800", "paidOnly": false, "title": "Shortest String That Contains Three Strings", "titleSlug": "shortest-string-that-contains-three-strings", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15683, "totalSubmissionRaw": 51288}, "2801": {"acRate": 27.99103489985414, "difficulty": "Hard", "likes": 332, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "2801", "paidOnly": false, "title": "Count Stepping Numbers in Range", "titleSlug": "count-stepping-numbers-in-range", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7868, "totalSubmissionRaw": 28109}, "2802": {"acRate": 77.21010332950632, "difficulty": "Medium", "likes": 58, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "2802", "paidOnly": true, "title": "Find The K-th Lucky Number", "titleSlug": "find-the-k-th-lucky-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 5380, "totalSubmissionRaw": 6968}, "2803": {"acRate": 86.30952380952381, "difficulty": "Easy", "likes": 18, "dislikes": 1, "categoryTitle": "JavaScript", "frontendQuestionId": "2803", "paidOnly": true, "title": "Factorial Generator", "titleSlug": "factorial-generator", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 870, "totalSubmissionRaw": 1008}, "2804": {"acRate": 89.15046059365405, "difficulty": "Easy", "likes": 8, "dislikes": 9, "categoryTitle": "JavaScript", "frontendQuestionId": "2804", "paidOnly": true, "title": "Array Prototype ForEach", "titleSlug": "array-prototype-foreach", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 871, "totalSubmissionRaw": 977}, "2805": {"acRate": 81.6, "difficulty": "Medium", "likes": 16, "dislikes": 7, "categoryTitle": "JavaScript", "frontendQuestionId": "2805", "paidOnly": true, "title": "Custom Interval", "titleSlug": "custom-interval", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 408, "totalSubmissionRaw": 500}, "2806": {"acRate": 52.81935641150658, "difficulty": "Easy", "likes": 253, "dislikes": 47, "categoryTitle": "Algorithms", "frontendQuestionId": "2806", "paidOnly": false, "title": "Account Balance After Rounded Purchase", "titleSlug": "account-balance-after-rounded-purchase", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 43333, "totalSubmissionRaw": 82040}, "2807": {"acRate": 88.83262978264774, "difficulty": "Medium", "likes": 539, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "2807", "paidOnly": false, "title": "Insert Greatest Common Divisors in Linked List", "titleSlug": "insert-greatest-common-divisors-in-linked-list", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 79125, "totalSubmissionRaw": 89072}, "2808": {"acRate": 26.88336520076482, "difficulty": "Medium", "likes": 513, "dislikes": 30, "categoryTitle": "Algorithms", "frontendQuestionId": "2808", "paidOnly": false, "title": "Minimum Seconds to Equalize a Circular Array", "titleSlug": "minimum-seconds-to-equalize-a-circular-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15466, "totalSubmissionRaw": 57530}, "2809": {"acRate": 26.274223520042472, "difficulty": "Hard", "likes": 233, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "2809", "paidOnly": false, "title": "Minimum Time to Make Array Sum At Most x", "titleSlug": "minimum-time-to-make-array-sum-at-most-x", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3959, "totalSubmissionRaw": 15068}, "2810": {"acRate": 83.92341745498618, "difficulty": "Easy", "likes": 426, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "2810", "paidOnly": false, "title": "Faulty Keyboard", "titleSlug": "faulty-keyboard", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 81706, "totalSubmissionRaw": 97358}, "2811": {"acRate": 33.77011017378878, "difficulty": "Medium", "likes": 498, "dislikes": 99, "categoryTitle": "Algorithms", "frontendQuestionId": "2811", "paidOnly": false, "title": "Check if it is Possible to Split Array", "titleSlug": "check-if-it-is-possible-to-split-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29303, "totalSubmissionRaw": 86772}, "2812": {"acRate": 48.990912740410934, "difficulty": "Medium", "likes": 1583, "dislikes": 293, "categoryTitle": "Algorithms", "frontendQuestionId": "2812", "paidOnly": false, "title": "Find the Safest Path in a Grid", "titleSlug": "find-the-safest-path-in-a-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 93966, "totalSubmissionRaw": 191805}, "2813": {"acRate": 33.01532528164011, "difficulty": "Hard", "likes": 306, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "2813", "paidOnly": false, "title": "Maximum Elegance of a K-Length Subsequence", "titleSlug": "maximum-elegance-of-a-k-length-subsequence", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6506, "totalSubmissionRaw": 19706}, "2814": {"acRate": 63.93210749646393, "difficulty": "Hard", "likes": 20, "dislikes": 0, "categoryTitle": "Algorithms", "frontendQuestionId": "2814", "paidOnly": true, "title": "Minimum Time Takes to Reach Destination Without Drowning", "titleSlug": "minimum-time-takes-to-reach-destination-without-drowning", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 904, "totalSubmissionRaw": 1414}, "2815": {"acRate": 58.21650746381658, "difficulty": "Easy", "likes": 376, "dislikes": 121, "categoryTitle": "Algorithms", "frontendQuestionId": "2815", "paidOnly": false, "title": "Max Pair Sum in an Array", "titleSlug": "max-pair-sum-in-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 46136, "totalSubmissionRaw": 79249}, "2816": {"acRate": 61.56870800199536, "difficulty": "Medium", "likes": 1137, "dislikes": 30, "categoryTitle": "Algorithms", "frontendQuestionId": "2816", "paidOnly": false, "title": "Double a Number Represented as a Linked List", "titleSlug": "double-a-number-represented-as-a-linked-list", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 167856, "totalSubmissionRaw": 272632}, "2817": {"acRate": 33.98370608686628, "difficulty": "Medium", "likes": 671, "dislikes": 72, "categoryTitle": "Algorithms", "frontendQuestionId": "2817", "paidOnly": false, "title": "Minimum Absolute Difference Between Elements With Constraint", "titleSlug": "minimum-absolute-difference-between-elements-with-constraint", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26196, "totalSubmissionRaw": 77084}, "2818": {"acRate": 32.596946999146674, "difficulty": "Hard", "likes": 325, "dislikes": 10, "categoryTitle": "Algorithms", "frontendQuestionId": "2818", "paidOnly": false, "title": "Apply Operations to Maximize Score", "titleSlug": "apply-operations-to-maximize-score", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6876, "totalSubmissionRaw": 21094}, "2819": {"acRate": 51.8005540166205, "difficulty": "Hard", "likes": 16, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "2819", "paidOnly": true, "title": "Minimum Relative Loss After Buying Chocolates", "titleSlug": "minimum-relative-loss-after-buying-chocolates", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 374, "totalSubmissionRaw": 721}, "2820": {"acRate": 66.26764886433395, "difficulty": "Medium", "likes": 19, "dislikes": 3, "categoryTitle": "Database", "frontendQuestionId": "2820", "paidOnly": true, "title": "Election Results", "titleSlug": "election-results", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2159, "totalSubmissionRaw": 3258}, "2821": {"acRate": 65.97374179431073, "difficulty": "Medium", "likes": 16, "dislikes": 5, "categoryTitle": "JavaScript", "frontendQuestionId": "2821", "paidOnly": true, "title": "Delay the Resolution of Each Promise", "titleSlug": "delay-the-resolution-of-each-promise", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 603, "totalSubmissionRaw": 914}, "2822": {"acRate": 57.97317436661699, "difficulty": "Easy", "likes": 15, "dislikes": 1, "categoryTitle": "JavaScript", "frontendQuestionId": "2822", "paidOnly": true, "title": "Inversion of Object", "titleSlug": "inversion-of-object", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 778, "totalSubmissionRaw": 1342}, "2823": {"acRate": 52.60869565217391, "difficulty": "Medium", "likes": 14, "dislikes": 3, "categoryTitle": "JavaScript", "frontendQuestionId": "2823", "paidOnly": true, "title": "Deep Object Filter", "titleSlug": "deep-object-filter", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 363, "totalSubmissionRaw": 690}, "2824": {"acRate": 87.3594548551959, "difficulty": "Easy", "likes": 594, "dislikes": 66, "categoryTitle": "Algorithms", "frontendQuestionId": "2824", "paidOnly": false, "title": "Count Pairs Whose Sum is Less than Target", "titleSlug": "count-pairs-whose-sum-is-less-than-target", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 161532, "totalSubmissionRaw": 184905}, "2825": {"acRate": 49.44499225242992, "difficulty": "Medium", "likes": 321, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "2825", "paidOnly": false, "title": "Make String a Subsequence Using Cyclic Increments", "titleSlug": "make-string-a-subsequence-using-cyclic-increments", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 35101, "totalSubmissionRaw": 70990}, "2826": {"acRate": 42.21056843790147, "difficulty": "Medium", "likes": 494, "dislikes": 91, "categoryTitle": "Algorithms", "frontendQuestionId": "2826", "paidOnly": false, "title": "Sorting Three Groups", "titleSlug": "sorting-three-groups", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20042, "totalSubmissionRaw": 47481}, "2827": {"acRate": 18.1219174610601, "difficulty": "Hard", "likes": 350, "dislikes": 36, "categoryTitle": "Algorithms", "frontendQuestionId": "2827", "paidOnly": false, "title": "Number of Beautiful Integers in the Range", "titleSlug": "number-of-beautiful-integers-in-the-range", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9296, "totalSubmissionRaw": 51297}, "2828": {"acRate": 83.09993106998577, "difficulty": "Easy", "likes": 318, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "2828", "paidOnly": false, "title": "Check if a String Is an Acronym of Words", "titleSlug": "check-if-a-string-is-an-acronym-of-words", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 95239, "totalSubmissionRaw": 114607}, "2829": {"acRate": 61.41755790878598, "difficulty": "Medium", "likes": 329, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "2829", "paidOnly": false, "title": "Determine the Minimum Sum of a k-avoiding Array", "titleSlug": "determine-the-minimum-sum-of-a-k-avoiding-array", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34972, "totalSubmissionRaw": 56942}, "2830": {"acRate": 36.471899273156694, "difficulty": "Medium", "likes": 663, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "2830", "paidOnly": false, "title": "Maximize the Profit as the Salesman", "titleSlug": "maximize-the-profit-as-the-salesman", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21928, "totalSubmissionRaw": 60123}, "2831": {"acRate": 35.88142697960699, "difficulty": "Medium", "likes": 667, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2831", "paidOnly": false, "title": "Find the Longest Equal Subarray", "titleSlug": "find-the-longest-equal-subarray", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20287, "totalSubmissionRaw": 56539}, "2832": {"acRate": 74.13793103448276, "difficulty": "Medium", "likes": 37, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "2832", "paidOnly": true, "title": "Maximal Range That Each Element Is Maximum in It", "titleSlug": "maximal-range-that-each-element-is-maximum-in-it", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1333, "totalSubmissionRaw": 1798}, "2833": {"acRate": 64.89040060468632, "difficulty": "Easy", "likes": 238, "dislikes": 44, "categoryTitle": "Algorithms", "frontendQuestionId": "2833", "paidOnly": false, "title": "Furthest Point From Origin", "titleSlug": "furthest-point-from-origin", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 48076, "totalSubmissionRaw": 74088}, "2834": {"acRate": 38.106096674768835, "difficulty": "Medium", "likes": 295, "dislikes": 52, "categoryTitle": "Algorithms", "frontendQuestionId": "2834", "paidOnly": false, "title": "Find the Minimum Possible Sum of a Beautiful Array", "titleSlug": "find-the-minimum-possible-sum-of-a-beautiful-array", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30414, "totalSubmissionRaw": 79814}, "2835": {"acRate": 32.46563875462425, "difficulty": "Hard", "likes": 521, "dislikes": 126, "categoryTitle": "Algorithms", "frontendQuestionId": "2835", "paidOnly": false, "title": "Minimum Operations to Form Subsequence With Target Sum", "titleSlug": "minimum-operations-to-form-subsequence-with-target-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12023, "totalSubmissionRaw": 37033}, "2836": {"acRate": 31.186818957594852, "difficulty": "Hard", "likes": 290, "dislikes": 92, "categoryTitle": "Algorithms", "frontendQuestionId": "2836", "paidOnly": false, "title": "Maximize Value of Function in a Ball Passing Game", "titleSlug": "maximize-value-of-function-in-a-ball-passing-game", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4751, "totalSubmissionRaw": 15234}, "2837": {"acRate": 75.17691888949373, "difficulty": "Easy", "likes": 14, "dislikes": 4, "categoryTitle": "Database", "frontendQuestionId": "2837", "paidOnly": true, "title": "Total Traveled Distance", "titleSlug": "total-traveled-distance", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 2762, "totalSubmissionRaw": 3674}, "2838": {"acRate": 68.85069817400644, "difficulty": "Medium", "likes": 30, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "2838", "paidOnly": true, "title": "Maximum Coins Heroes Can Collect", "titleSlug": "maximum-coins-heroes-can-collect", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1282, "totalSubmissionRaw": 1862}, "2839": {"acRate": 47.2003184000398, "difficulty": "Easy", "likes": 181, "dislikes": 24, "categoryTitle": "Algorithms", "frontendQuestionId": "2839", "paidOnly": false, "title": "Check if Strings Can be Made Equal With Operations I", "titleSlug": "check-if-strings-can-be-made-equal-with-operations-i", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 37950, "totalSubmissionRaw": 80402}, "2840": {"acRate": 55.90739699789727, "difficulty": "Medium", "likes": 253, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "2840", "paidOnly": false, "title": "Check if Strings Can be Made Equal With Operations II", "titleSlug": "check-if-strings-can-be-made-equal-with-operations-ii", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26854, "totalSubmissionRaw": 48033}, "2841": {"acRate": 38.15015726854173, "difficulty": "Medium", "likes": 271, "dislikes": 135, "categoryTitle": "Algorithms", "frontendQuestionId": "2841", "paidOnly": false, "title": "Maximum Sum of Almost Unique Subarray", "titleSlug": "maximum-sum-of-almost-unique-subarray", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25107, "totalSubmissionRaw": 65811}, "2842": {"acRate": 29.411067662045266, "difficulty": "Hard", "likes": 334, "dislikes": 32, "categoryTitle": "Algorithms", "frontendQuestionId": "2842", "paidOnly": false, "title": "Count K-Subsequences of a String With Maximum Beauty", "titleSlug": "count-k-subsequences-of-a-string-with-maximum-beauty", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12410, "totalSubmissionRaw": 42195}, "2843": {"acRate": 74.48877129787539, "difficulty": "Easy", "likes": 252, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "2843", "paidOnly": false, "title": "  Count Symmetric Integers", "titleSlug": "count-symmetric-integers", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 46735, "totalSubmissionRaw": 62741}, "2844": {"acRate": 38.242855876355684, "difficulty": "Medium", "likes": 345, "dislikes": 52, "categoryTitle": "Algorithms", "frontendQuestionId": "2844", "paidOnly": false, "title": "Minimum Operations to Make a Special Number", "titleSlug": "minimum-operations-to-make-a-special-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25882, "totalSubmissionRaw": 67678}, "2845": {"acRate": 35.5899952429834, "difficulty": "Medium", "likes": 495, "dislikes": 68, "categoryTitle": "Algorithms", "frontendQuestionId": "2845", "paidOnly": false, "title": "Count of Interesting Subarrays", "titleSlug": "count-of-interesting-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14215, "totalSubmissionRaw": 39941}, "2846": {"acRate": 44.664507869568496, "difficulty": "Hard", "likes": 298, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "2846", "paidOnly": false, "title": "Minimum Edge Weight Equilibrium Queries in a Tree", "titleSlug": "minimum-edge-weight-equilibrium-queries-in-a-tree", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Strongly Connected Component", "id": "VG9waWNUYWdOb2RlOjYxMDg1", "slug": "strongly-connected-component"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5930, "totalSubmissionRaw": 13278}, "2847": {"acRate": 43.383742911153114, "difficulty": "Medium", "likes": 18, "dislikes": 0, "categoryTitle": "Algorithms", "frontendQuestionId": "2847", "paidOnly": true, "title": "Smallest Number With Given Digit Product", "titleSlug": "smallest-number-with-given-digit-product", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 918, "totalSubmissionRaw": 2116}, "2848": {"acRate": 75.32996157409517, "difficulty": "Easy", "likes": 272, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "2848", "paidOnly": false, "title": "Points That Intersect With Cars", "titleSlug": "points-that-intersect-with-cars", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 49598, "totalSubmissionRaw": 65841}, "2849": {"acRate": 35.66984053483055, "difficulty": "Medium", "likes": 817, "dislikes": 755, "categoryTitle": "Algorithms", "frontendQuestionId": "2849", "paidOnly": false, "title": "Determine if a Cell Is Reachable at a Given Time", "titleSlug": "determine-if-a-cell-is-reachable-at-a-given-time", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 98600, "totalSubmissionRaw": 276424}, "2850": {"acRate": 44.55486871658286, "difficulty": "Medium", "likes": 502, "dislikes": 69, "categoryTitle": "Algorithms", "frontendQuestionId": "2850", "paidOnly": false, "title": "Minimum Moves to Spread Stones Over Grid", "titleSlug": "minimum-moves-to-spread-stones-over-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22416, "totalSubmissionRaw": 50311}, "2851": {"acRate": 29.581306206693203, "difficulty": "Hard", "likes": 163, "dislikes": 34, "categoryTitle": "Algorithms", "frontendQuestionId": "2851", "paidOnly": false, "title": "String Transformation", "titleSlug": "string-transformation", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4013, "totalSubmissionRaw": 13566}, "2852": {"acRate": 64.69613259668509, "difficulty": "Medium", "likes": 28, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "2852", "paidOnly": true, "title": "Sum of Remoteness of All Cells", "titleSlug": "sum-of-remoteness-of-all-cells", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1171, "totalSubmissionRaw": 1810}, "2853": {"acRate": 73.62962962962963, "difficulty": "Easy", "likes": 15, "dislikes": 1, "categoryTitle": "Database", "frontendQuestionId": "2853", "paidOnly": true, "title": "Highest Salaries Difference", "titleSlug": "highest-salaries-difference", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2982, "totalSubmissionRaw": 4050}, "2854": {"acRate": 67.13615023474179, "difficulty": "Medium", "likes": 16, "dislikes": 2, "categoryTitle": "Database", "frontendQuestionId": "2854", "paidOnly": true, "title": "Rolling Average Steps", "titleSlug": "rolling-average-steps", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2288, "totalSubmissionRaw": 3408}, "2855": {"acRate": 58.00207162384745, "difficulty": "Easy", "likes": 214, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "2855", "paidOnly": false, "title": "Minimum Right Shifts to Sort the Array", "titleSlug": "minimum-right-shifts-to-sort-the-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34158, "totalSubmissionRaw": 58891}, "2856": {"acRate": 22.66534967189227, "difficulty": "Medium", "likes": 368, "dislikes": 96, "categoryTitle": "Algorithms", "frontendQuestionId": "2856", "paidOnly": false, "title": "Minimum Array Length After Pair Removals", "titleSlug": "minimum-array-length-after-pair-removals", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23176, "totalSubmissionRaw": 102253}, "2857": {"acRate": 32.1276659032095, "difficulty": "Medium", "likes": 265, "dislikes": 39, "categoryTitle": "Algorithms", "frontendQuestionId": "2857", "paidOnly": false, "title": "Count Pairs of Points With Distance k", "titleSlug": "count-pairs-of-points-with-distance-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10801, "totalSubmissionRaw": 33619}, "2858": {"acRate": 58.756148981026, "difficulty": "Hard", "likes": 299, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "2858", "paidOnly": false, "title": "Minimum Edge Reversals So Every Node Is Reachable", "titleSlug": "minimum-edge-reversals-so-every-node-is-reachable", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8361, "totalSubmissionRaw": 14230}, "2859": {"acRate": 86.65501446480232, "difficulty": "Easy", "likes": 264, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "2859", "paidOnly": false, "title": "Sum of Values at Indices With K Set Bits", "titleSlug": "sum-of-values-at-indices-with-k-set-bits", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 71889, "totalSubmissionRaw": 82960}, "2860": {"acRate": 52.21481019340596, "difficulty": "Medium", "likes": 163, "dislikes": 292, "categoryTitle": "Algorithms", "frontendQuestionId": "2860", "paidOnly": false, "title": "Happy Students", "titleSlug": "happy-students", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21760, "totalSubmissionRaw": 41674}, "2861": {"acRate": 38.52686591540095, "difficulty": "Medium", "likes": 270, "dislikes": 46, "categoryTitle": "Algorithms", "frontendQuestionId": "2861", "paidOnly": false, "title": "Maximum Number of Alloys", "titleSlug": "maximum-number-of-alloys", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14154, "totalSubmissionRaw": 36738}, "2862": {"acRate": 44.158553546592486, "difficulty": "Hard", "likes": 208, "dislikes": 54, "categoryTitle": "Algorithms", "frontendQuestionId": "2862", "paidOnly": false, "title": "Maximum Element-Sum of a Complete Subset of Indices", "titleSlug": "maximum-element-sum-of-a-complete-subset-of-indices", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7620, "totalSubmissionRaw": 17256}, "2863": {"acRate": 70.86867505118455, "difficulty": "Medium", "likes": 122, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2863", "paidOnly": true, "title": "Maximum Length of Semi-Decreasing Subarrays", "titleSlug": "maximum-length-of-semi-decreasing-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12115, "totalSubmissionRaw": 17095}, "2864": {"acRate": 83.15291237376313, "difficulty": "Easy", "likes": 763, "dislikes": 29, "categoryTitle": "Algorithms", "frontendQuestionId": "2864", "paidOnly": false, "title": "Maximum Odd Binary Number", "titleSlug": "maximum-odd-binary-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 203787, "totalSubmissionRaw": 245075}, "2865": {"acRate": 43.599657888172196, "difficulty": "Medium", "likes": 282, "dislikes": 49, "categoryTitle": "Algorithms", "frontendQuestionId": "2865", "paidOnly": false, "title": "Beautiful Towers I", "titleSlug": "beautiful-towers-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24469, "totalSubmissionRaw": 56122}, "2866": {"acRate": 34.853946880135716, "difficulty": "Medium", "likes": 402, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "2866", "paidOnly": false, "title": "Beautiful Towers II", "titleSlug": "beautiful-towers-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13149, "totalSubmissionRaw": 37726}, "2867": {"acRate": 35.60395427865307, "difficulty": "Hard", "likes": 248, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "2867", "paidOnly": false, "title": "Count Valid Paths in a Tree", "titleSlug": "count-valid-paths-in-a-tree", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6915, "totalSubmissionRaw": 19422}, "2868": {"acRate": 58.96774193548387, "difficulty": "Hard", "likes": 10, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "2868", "paidOnly": true, "title": "The Wording Game", "titleSlug": "the-wording-game", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 457, "totalSubmissionRaw": 775}, "2869": {"acRate": 60.39440838741888, "difficulty": "Easy", "likes": 169, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "2869", "paidOnly": false, "title": "Minimum Operations to Collect Elements", "titleSlug": "minimum-operations-to-collect-elements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 36291, "totalSubmissionRaw": 60090}, "2870": {"acRate": 62.00043131925498, "difficulty": "Medium", "likes": 1388, "dislikes": 66, "categoryTitle": "Algorithms", "frontendQuestionId": "2870", "paidOnly": false, "title": "Minimum Number of Operations to Make Array Empty", "titleSlug": "minimum-number-of-operations-to-make-array-empty", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 181120, "totalSubmissionRaw": 292124}, "2871": {"acRate": 44.0118378539817, "difficulty": "Medium", "likes": 222, "dislikes": 31, "categoryTitle": "Algorithms", "frontendQuestionId": "2871", "paidOnly": false, "title": "Split Array Into Maximum Number of Subarrays", "titleSlug": "split-array-into-maximum-number-of-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16210, "totalSubmissionRaw": 36831}, "2872": {"acRate": 57.82415918676328, "difficulty": "Hard", "likes": 185, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "2872", "paidOnly": false, "title": "Maximum Number of K-Divisible Components", "titleSlug": "maximum-number-of-k-divisible-components", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10694, "totalSubmissionRaw": 18494}, "2873": {"acRate": 45.7906533947121, "difficulty": "Easy", "likes": 164, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2873", "paidOnly": false, "title": "Maximum Value of an Ordered Triplet I", "titleSlug": "maximum-value-of-an-ordered-triplet-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 37998, "totalSubmissionRaw": 82982}, "2874": {"acRate": 41.422093462652725, "difficulty": "Medium", "likes": 274, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "2874", "paidOnly": false, "title": "Maximum Value of an Ordered Triplet II", "titleSlug": "maximum-value-of-an-ordered-triplet-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26308, "totalSubmissionRaw": 63512}, "2875": {"acRate": 30.868314578328487, "difficulty": "Medium", "likes": 369, "dislikes": 26, "categoryTitle": "Algorithms", "frontendQuestionId": "2875", "paidOnly": false, "title": "Minimum Size Subarray in Infinite Array", "titleSlug": "minimum-size-subarray-in-infinite-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19531, "totalSubmissionRaw": 63272}, "2876": {"acRate": 32.892893530310744, "difficulty": "Hard", "likes": 317, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "2876", "paidOnly": false, "title": "Count Visited Nodes in a Directed Graph", "titleSlug": "count-visited-nodes-in-a-directed-graph", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10331, "totalSubmissionRaw": 31408}, "2877": {"acRate": 81.16182094475373, "difficulty": "Easy", "likes": 183, "dislikes": 7, "categoryTitle": "pandas", "frontendQuestionId": "2877", "paidOnly": false, "title": "Create a DataFrame from List", "titleSlug": "create-a-dataframe-from-list", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 112694, "totalSubmissionRaw": 138851}, "2878": {"acRate": 84.92233892338344, "difficulty": "Easy", "likes": 95, "dislikes": 8, "categoryTitle": "pandas", "frontendQuestionId": "2878", "paidOnly": false, "title": "Get the Size of a DataFrame", "titleSlug": "get-the-size-of-a-dataframe", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 87808, "totalSubmissionRaw": 103398}, "2879": {"acRate": 92.89801107982926, "difficulty": "Easy", "likes": 77, "dislikes": 19, "categoryTitle": "pandas", "frontendQuestionId": "2879", "paidOnly": false, "title": "Display the First Three Rows", "titleSlug": "display-the-first-three-rows", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 92057, "totalSubmissionRaw": 99095}, "2880": {"acRate": 79.17188913472333, "difficulty": "Easy", "likes": 77, "dislikes": 7, "categoryTitle": "pandas", "frontendQuestionId": "2880", "paidOnly": false, "title": "Select Data", "titleSlug": "select-data", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 72641, "totalSubmissionRaw": 91751}, "2881": {"acRate": 90.1321597512287, "difficulty": "Easy", "likes": 69, "dislikes": 5, "categoryTitle": "pandas", "frontendQuestionId": "2881", "paidOnly": false, "title": "Create a New Column", "titleSlug": "create-a-new-column", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 68402, "totalSubmissionRaw": 75891}, "2882": {"acRate": 85.36117144258391, "difficulty": "Easy", "likes": 81, "dislikes": 6, "categoryTitle": "pandas", "frontendQuestionId": "2882", "paidOnly": false, "title": "Drop Duplicate Rows", "titleSlug": "drop-duplicate-rows", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 60918, "totalSubmissionRaw": 71365}, "2883": {"acRate": 63.94837691614067, "difficulty": "Easy", "likes": 64, "dislikes": 4, "categoryTitle": "pandas", "frontendQuestionId": "2883", "paidOnly": false, "title": "Drop Missing Data", "titleSlug": "drop-missing-data", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 56735, "totalSubmissionRaw": 88720}, "2884": {"acRate": 91.9221489937625, "difficulty": "Easy", "likes": 63, "dislikes": 4, "categoryTitle": "pandas", "frontendQuestionId": "2884", "paidOnly": false, "title": "Modify Columns", "titleSlug": "modify-columns", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 62485, "totalSubmissionRaw": 67976}, "2885": {"acRate": 85.25216949851665, "difficulty": "Easy", "likes": 52, "dislikes": 3, "categoryTitle": "pandas", "frontendQuestionId": "2885", "paidOnly": false, "title": "Rename Columns", "titleSlug": "rename-columns", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 53737, "totalSubmissionRaw": 63033}, "2886": {"acRate": 87.12379306333405, "difficulty": "Easy", "likes": 58, "dislikes": 7, "categoryTitle": "pandas", "frontendQuestionId": "2886", "paidOnly": false, "title": "Change Data Type", "titleSlug": "change-data-type", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 52425, "totalSubmissionRaw": 60173}, "2887": {"acRate": 71.82292038557658, "difficulty": "Easy", "likes": 57, "dislikes": 3, "categoryTitle": "pandas", "frontendQuestionId": "2887", "paidOnly": false, "title": "Fill Missing Data", "titleSlug": "fill-missing-data", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 50294, "totalSubmissionRaw": 70025}, "2888": {"acRate": 90.55216616397038, "difficulty": "Easy", "likes": 59, "dislikes": 6, "categoryTitle": "pandas", "frontendQuestionId": "2888", "paidOnly": false, "title": "Reshape Data: Concatenate", "titleSlug": "reshape-data-concatenate", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 52839, "totalSubmissionRaw": 58352}, "2889": {"acRate": 82.04055180075919, "difficulty": "Easy", "likes": 81, "dislikes": 12, "categoryTitle": "pandas", "frontendQuestionId": "2889", "paidOnly": false, "title": "Reshape Data: Pivot", "titleSlug": "reshape-data-pivot", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 44306, "totalSubmissionRaw": 54005}, "2890": {"acRate": 85.78143601954103, "difficulty": "Easy", "likes": 70, "dislikes": 3, "categoryTitle": "pandas", "frontendQuestionId": "2890", "paidOnly": false, "title": "Reshape Data: Melt", "titleSlug": "reshape-data-melt", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 41791, "totalSubmissionRaw": 48718}, "2891": {"acRate": 76.08177053405075, "difficulty": "Easy", "likes": 65, "dislikes": 5, "categoryTitle": "pandas", "frontendQuestionId": "2891", "paidOnly": false, "title": "Method Chaining", "titleSlug": "method-chaining", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 43693, "totalSubmissionRaw": 57429}, "2892": {"acRate": 40.115440115440116, "difficulty": "Medium", "likes": 22, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "2892", "paidOnly": true, "title": "Minimizing Array After Replacing Pairs With Their Product", "titleSlug": "minimizing-array-after-replacing-pairs-with-their-product", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 834, "totalSubmissionRaw": 2079}, "2893": {"acRate": 68.34579135521612, "difficulty": "Medium", "likes": 18, "dislikes": 3, "categoryTitle": "Database", "frontendQuestionId": "2893", "paidOnly": true, "title": "Calculate Orders Within Each Interval", "titleSlug": "calculate-orders-within-each-interval", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2103, "totalSubmissionRaw": 3077}, "2894": {"acRate": 89.10908046787632, "difficulty": "Easy", "likes": 216, "dislikes": 18, "categoryTitle": "Algorithms", "frontendQuestionId": "2894", "paidOnly": false, "title": "Divisible and Non-divisible Sums Difference", "titleSlug": "divisible-and-non-divisible-sums-difference", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 88447, "totalSubmissionRaw": 99257}, "2895": {"acRate": 69.26584681413007, "difficulty": "Medium", "likes": 255, "dislikes": 43, "categoryTitle": "Algorithms", "frontendQuestionId": "2895", "paidOnly": false, "title": "Minimum Processing Time", "titleSlug": "minimum-processing-time", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33569, "totalSubmissionRaw": 48464}, "2896": {"acRate": 26.955035779130622, "difficulty": "Medium", "likes": 350, "dislikes": 68, "categoryTitle": "Algorithms", "frontendQuestionId": "2896", "paidOnly": false, "title": "Apply Operations to Make Two Strings Equal", "titleSlug": "apply-operations-to-make-two-strings-equal", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12619, "totalSubmissionRaw": 46815}, "2897": {"acRate": 47.147870363999175, "difficulty": "Hard", "likes": 179, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "2897", "paidOnly": false, "title": "Apply Operations on Array to Maximize Sum of Squares", "titleSlug": "apply-operations-on-array-to-maximize-sum-of-squares", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6852, "totalSubmissionRaw": 14533}, "2898": {"acRate": 67.9646017699115, "difficulty": "Medium", "likes": 20, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "2898", "paidOnly": true, "title": "Maximum Linear Stock Score", "titleSlug": "maximum-linear-stock-score", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 768, "totalSubmissionRaw": 1130}, "2899": {"acRate": 66.1332938242339, "difficulty": "Easy", "likes": 153, "dislikes": 207, "categoryTitle": "Algorithms", "frontendQuestionId": "2899", "paidOnly": false, "title": "Last Visited Integers", "titleSlug": "last-visited-integers", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26782, "totalSubmissionRaw": 40497}, "2900": {"acRate": 62.478784977588234, "difficulty": "Easy", "likes": 180, "dislikes": 80, "categoryTitle": "Algorithms", "frontendQuestionId": "2900", "paidOnly": false, "title": "Longest Unequal Adjacent Groups Subsequence I", "titleSlug": "longest-unequal-adjacent-groups-subsequence-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28714, "totalSubmissionRaw": 45958}, "2901": {"acRate": 27.34277965070594, "difficulty": "Medium", "likes": 193, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "2901", "paidOnly": false, "title": "Longest Unequal Adjacent Groups Subsequence II", "titleSlug": "longest-unequal-adjacent-groups-subsequence-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10787, "totalSubmissionRaw": 39451}, "2902": {"acRate": 21.07727158318651, "difficulty": "Hard", "likes": 146, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "2902", "paidOnly": false, "title": "Count of Sub-Multisets With Bounded Sum", "titleSlug": "count-of-sub-multisets-with-bounded-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4187, "totalSubmissionRaw": 19865}, "2903": {"acRate": 61.860681114551085, "difficulty": "Easy", "likes": 136, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2903", "paidOnly": false, "title": "Find Indices With Index and Value Difference I", "titleSlug": "find-indices-with-index-and-value-difference-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 39962, "totalSubmissionRaw": 64600}, "2904": {"acRate": 39.23240611748136, "difficulty": "Medium", "likes": 180, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "2904", "paidOnly": false, "title": "Shortest and Lexicographically Smallest Beautiful String", "titleSlug": "shortest-and-lexicographically-smallest-beautiful-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25627, "totalSubmissionRaw": 65321}, "2905": {"acRate": 32.16927453769559, "difficulty": "Medium", "likes": 258, "dislikes": 10, "categoryTitle": "Algorithms", "frontendQuestionId": "2905", "paidOnly": false, "title": "Find Indices With Index and Value Difference II", "titleSlug": "find-indices-with-index-and-value-difference-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18092, "totalSubmissionRaw": 56240}, "2906": {"acRate": 30.85206588426975, "difficulty": "Medium", "likes": 220, "dislikes": 18, "categoryTitle": "Algorithms", "frontendQuestionId": "2906", "paidOnly": false, "title": "Construct Product Matrix", "titleSlug": "construct-product-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12119, "totalSubmissionRaw": 39281}, "2907": {"acRate": 56.6869300911854, "difficulty": "Medium", "likes": 18, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "2907", "paidOnly": true, "title": "Maximum Profitable Triplets With Increasing Prices I", "titleSlug": "maximum-profitable-triplets-with-increasing-prices-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1119, "totalSubmissionRaw": 1973}, "2908": {"acRate": 65.06992022524636, "difficulty": "Easy", "likes": 155, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "2908", "paidOnly": false, "title": "Minimum Sum of Mountain Triplets I", "titleSlug": "minimum-sum-of-mountain-triplets-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34666, "totalSubmissionRaw": 53275}, "2909": {"acRate": 54.10493686465788, "difficulty": "Medium", "likes": 189, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "2909", "paidOnly": false, "title": "Minimum Sum of Mountain Triplets II", "titleSlug": "minimum-sum-of-mountain-triplets-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23738, "totalSubmissionRaw": 43874}, "2910": {"acRate": 25.04153481012658, "difficulty": "Medium", "likes": 368, "dislikes": 177, "categoryTitle": "Algorithms", "frontendQuestionId": "2910", "paidOnly": false, "title": "Minimum Number of Groups to Create a Valid Assignment", "titleSlug": "minimum-number-of-groups-to-create-a-valid-assignment", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12661, "totalSubmissionRaw": 50560}, "2911": {"acRate": 36.489780611288204, "difficulty": "Hard", "likes": 121, "dislikes": 101, "categoryTitle": "Algorithms", "frontendQuestionId": "2911", "paidOnly": false, "title": "Minimum Changes to Make K Semi-palindromes", "titleSlug": "minimum-changes-to-make-k-semi-palindromes", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3892, "totalSubmissionRaw": 10666}, "2912": {"acRate": 61.845930232558146, "difficulty": "Hard", "likes": 15, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "2912", "paidOnly": true, "title": "Number of Ways to Reach Destination in the Grid", "titleSlug": "number-of-ways-to-reach-destination-in-the-grid", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 851, "totalSubmissionRaw": 1376}, "2913": {"acRate": 82.74220714233408, "difficulty": "Easy", "likes": 145, "dislikes": 27, "categoryTitle": "Algorithms", "frontendQuestionId": "2913", "paidOnly": false, "title": "Subarrays Distinct Element Sum of Squares I", "titleSlug": "subarrays-distinct-element-sum-of-squares-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33897, "totalSubmissionRaw": 40967}, "2914": {"acRate": 60.07772589087034, "difficulty": "Medium", "likes": 142, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "2914", "paidOnly": false, "title": "Minimum Number of Changes to Make Binary String Beautiful", "titleSlug": "minimum-number-of-changes-to-make-binary-string-beautiful", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19169, "totalSubmissionRaw": 31907}, "2915": {"acRate": 35.82740456970858, "difficulty": "Medium", "likes": 221, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "2915", "paidOnly": false, "title": "Length of the Longest Subsequence That Sums to Target", "titleSlug": "length-of-the-longest-subsequence-that-sums-to-target", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20949, "totalSubmissionRaw": 58472}, "2916": {"acRate": 21.316146540027137, "difficulty": "Hard", "likes": 141, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "2916", "paidOnly": false, "title": "Subarrays Distinct Element Sum of Squares II", "titleSlug": "subarrays-distinct-element-sum-of-squares-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3142, "totalSubmissionRaw": 14740}, "2917": {"acRate": 74.70828221734045, "difficulty": "Easy", "likes": 219, "dislikes": 269, "categoryTitle": "Algorithms", "frontendQuestionId": "2917", "paidOnly": false, "title": "Find the K-or of an Array", "titleSlug": "find-the-k-or-of-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26186, "totalSubmissionRaw": 35051}, "2918": {"acRate": 35.333141797476955, "difficulty": "Medium", "likes": 177, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "2918", "paidOnly": false, "title": "Minimum Equal Sum of Two Arrays After Replacing Zeros", "titleSlug": "minimum-equal-sum-of-two-arrays-after-replacing-zeros", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27056, "totalSubmissionRaw": 76574}, "2919": {"acRate": 34.39982073052312, "difficulty": "Medium", "likes": 313, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "2919", "paidOnly": false, "title": "Minimum Increment Operations to Make Array Beautiful", "titleSlug": "minimum-increment-operations-to-make-array-beautiful", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13816, "totalSubmissionRaw": 40163}, "2920": {"acRate": 37.55552301459462, "difficulty": "Hard", "likes": 196, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "2920", "paidOnly": false, "title": "Maximum Points After Collecting Coins From All Nodes", "titleSlug": "maximum-points-after-collecting-coins-from-all-nodes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7694, "totalSubmissionRaw": 20487}, "2921": {"acRate": 48.93617021276596, "difficulty": "Hard", "likes": 8, "dislikes": 0, "categoryTitle": "Algorithms", "frontendQuestionId": "2921", "paidOnly": true, "title": "Maximum Profitable Triplets With Increasing Prices II", "titleSlug": "maximum-profitable-triplets-with-increasing-prices-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 414, "totalSubmissionRaw": 846}, "2922": {"acRate": 40.982142857142854, "difficulty": "Medium", "likes": 12, "dislikes": 6, "categoryTitle": "Database", "frontendQuestionId": "2922", "paidOnly": true, "title": "Market Analysis III", "titleSlug": "market-analysis-iii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1836, "totalSubmissionRaw": 4479}, "2923": {"acRate": 73.53494202444375, "difficulty": "Easy", "likes": 139, "dislikes": 40, "categoryTitle": "Algorithms", "frontendQuestionId": "2923", "paidOnly": false, "title": "Find Champion I", "titleSlug": "find-champion-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 37544, "totalSubmissionRaw": 51056}, "2924": {"acRate": 58.666222074024674, "difficulty": "Medium", "likes": 148, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "2924", "paidOnly": false, "title": "Find Champion II", "titleSlug": "find-champion-ii", "topicTags": [{"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26391, "totalSubmissionRaw": 44985}, "2925": {"acRate": 49.61793956149445, "difficulty": "Medium", "likes": 319, "dislikes": 65, "categoryTitle": "Algorithms", "frontendQuestionId": "2925", "paidOnly": false, "title": "Maximum Score After Applying Operations on a Tree", "titleSlug": "maximum-score-after-applying-operations-on-a-tree", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12922, "totalSubmissionRaw": 26043}, "2926": {"acRate": 24.092991970404, "difficulty": "Hard", "likes": 192, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "2926", "paidOnly": false, "title": "Maximum Balanced Subsequence Sum", "titleSlug": "maximum-balanced-subsequence-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5731, "totalSubmissionRaw": 23787}, "2927": {"acRate": 44.026733500417706, "difficulty": "Hard", "likes": 8, "dislikes": 0, "categoryTitle": "Algorithms", "frontendQuestionId": "2927", "paidOnly": true, "title": "Distribute Candies Among Children III", "titleSlug": "distribute-candies-among-children-iii", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 527, "totalSubmissionRaw": 1197}, "2928": {"acRate": 75.93103853383458, "difficulty": "Easy", "likes": 103, "dislikes": 48, "categoryTitle": "Algorithms", "frontendQuestionId": "2928", "paidOnly": false, "title": "Distribute Candies Among Children I", "titleSlug": "distribute-candies-among-children-i", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25853, "totalSubmissionRaw": 34048}, "2929": {"acRate": 35.327358867515265, "difficulty": "Medium", "likes": 92, "dislikes": 108, "categoryTitle": "Algorithms", "frontendQuestionId": "2929", "paidOnly": false, "title": "Distribute Candies Among Children II", "titleSlug": "distribute-candies-among-children-ii", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12378, "totalSubmissionRaw": 35038}, "2930": {"acRate": 56.46920926877649, "difficulty": "Medium", "likes": 165, "dislikes": 64, "categoryTitle": "Algorithms", "frontendQuestionId": "2930", "paidOnly": false, "title": "Number of Strings Which Can Be Rearranged to Contain Substring", "titleSlug": "number-of-strings-which-can-be-rearranged-to-contain-substring", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6263, "totalSubmissionRaw": 11091}, "2931": {"acRate": 65.49818896187611, "difficulty": "Hard", "likes": 93, "dislikes": 28, "categoryTitle": "Algorithms", "frontendQuestionId": "2931", "paidOnly": false, "title": "Maximum Spending After Buying Items", "titleSlug": "maximum-spending-after-buying-items", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10669, "totalSubmissionRaw": 16289}, "2932": {"acRate": 76.29033536827083, "difficulty": "Easy", "likes": 140, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2932", "paidOnly": false, "title": "Maximum Strong Pair XOR I", "titleSlug": "maximum-strong-pair-xor-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 38490, "totalSubmissionRaw": 50452}, "2933": {"acRate": 44.389330259745606, "difficulty": "Medium", "likes": 190, "dislikes": 18, "categoryTitle": "Algorithms", "frontendQuestionId": "2933", "paidOnly": false, "title": "High-Access Employees", "titleSlug": "high-access-employees", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21567, "totalSubmissionRaw": 48584}, "2934": {"acRate": 45.00183217295713, "difficulty": "Medium", "likes": 180, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "2934", "paidOnly": false, "title": "Minimum Operations to Maximize Last Elements in Arrays", "titleSlug": "minimum-operations-to-maximize-last-elements-in-arrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12281, "totalSubmissionRaw": 27290}, "2935": {"acRate": 30.414474654604458, "difficulty": "Hard", "likes": 172, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "2935", "paidOnly": false, "title": "Maximum Strong Pair XOR II", "titleSlug": "maximum-strong-pair-xor-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6186, "totalSubmissionRaw": 20339}, "2936": {"acRate": 66.39128802102891, "difficulty": "Medium", "likes": 19, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "2936", "paidOnly": true, "title": "Number of Equal Numbers Blocks", "titleSlug": "number-of-equal-numbers-blocks", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1769, "totalSubmissionRaw": 2664}, "2937": {"acRate": 43.36348783734721, "difficulty": "Easy", "likes": 296, "dislikes": 38, "categoryTitle": "Algorithms", "frontendQuestionId": "2937", "paidOnly": false, "title": "Make Three Strings Equal", "titleSlug": "make-three-strings-equal", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28665, "totalSubmissionRaw": 66104}, "2938": {"acRate": 53.413681213164686, "difficulty": "Medium", "likes": 187, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "2938", "paidOnly": false, "title": "Separate Black and White Balls", "titleSlug": "separate-black-and-white-balls", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24198, "totalSubmissionRaw": 45303}, "2939": {"acRate": 26.295557675077312, "difficulty": "Medium", "likes": 201, "dislikes": 69, "categoryTitle": "Algorithms", "frontendQuestionId": "2939", "paidOnly": false, "title": "Maximum Xor Product", "titleSlug": "maximum-xor-product", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9098, "totalSubmissionRaw": 34599}, "2940": {"acRate": 35.650431565967935, "difficulty": "Hard", "likes": 231, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "2940", "paidOnly": false, "title": "Find Building Where Alice and Bob Can Meet", "titleSlug": "find-building-where-alice-and-bob-can-meet", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6939, "totalSubmissionRaw": 19464}, "2941": {"acRate": 47.70992366412214, "difficulty": "Hard", "likes": 13, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "2941", "paidOnly": true, "title": "Maximum GCD-Sum of a Subarray", "titleSlug": "maximum-gcd-sum-of-a-subarray", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 375, "totalSubmissionRaw": 786}, "2942": {"acRate": 88.65564635735345, "difficulty": "Easy", "likes": 339, "dislikes": 27, "categoryTitle": "Algorithms", "frontendQuestionId": "2942", "paidOnly": false, "title": "Find Words Containing Character", "titleSlug": "find-words-containing-character", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 147648, "totalSubmissionRaw": 166541}, "2943": {"acRate": 36.84946749324432, "difficulty": "Medium", "likes": 224, "dislikes": 146, "categoryTitle": "Algorithms", "frontendQuestionId": "2943", "paidOnly": false, "title": "Maximize Area of Square Hole in Grid", "titleSlug": "maximize-area-of-square-hole-in-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11591, "totalSubmissionRaw": 31455}, "2944": {"acRate": 46.057436676502384, "difficulty": "Medium", "likes": 252, "dislikes": 47, "categoryTitle": "Algorithms", "frontendQuestionId": "2944", "paidOnly": false, "title": "Minimum Number of Coins for Fruits", "titleSlug": "minimum-number-of-coins-for-fruits", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Monotonic Queue", "id": "VG9waWNUYWdOb2RlOjYxMDcx", "slug": "monotonic-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15765, "totalSubmissionRaw": 34229}, "2945": {"acRate": 16.200734196619468, "difficulty": "Hard", "likes": 161, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "2945", "paidOnly": false, "title": "Find Maximum Non-decreasing Array Length", "titleSlug": "find-maximum-non-decreasing-array-length", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}, {"name": "Monotonic Queue", "id": "VG9waWNUYWdOb2RlOjYxMDcx", "slug": "monotonic-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4016, "totalSubmissionRaw": 24789}, "2946": {"acRate": 58.35150900329699, "difficulty": "Easy", "likes": 172, "dislikes": 63, "categoryTitle": "Algorithms", "frontendQuestionId": "2946", "paidOnly": false, "title": "Matrix Similarity After Cyclic Shifts", "titleSlug": "matrix-similarity-after-cyclic-shifts", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23008, "totalSubmissionRaw": 39430}, "2947": {"acRate": 62.05027848863466, "difficulty": "Medium", "likes": 136, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "2947", "paidOnly": false, "title": "Count Beautiful Substrings I", "titleSlug": "count-beautiful-substrings-i", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20610, "totalSubmissionRaw": 33215}, "2948": {"acRate": 39.67627494456763, "difficulty": "Medium", "likes": 255, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "2948", "paidOnly": false, "title": "Make Lexicographically Smallest Array by Swapping Elements", "titleSlug": "make-lexicographically-smallest-array-by-swapping-elements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8947, "totalSubmissionRaw": 22550}, "2949": {"acRate": 25.215613938880306, "difficulty": "Hard", "likes": 177, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "2949", "paidOnly": false, "title": "Count Beautiful Substrings II", "titleSlug": "count-beautiful-substrings-ii", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5058, "totalSubmissionRaw": 20059}, "2950": {"acRate": 76.30128597672994, "difficulty": "Medium", "likes": 22, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "2950", "paidOnly": true, "title": "Number of Divisible Substrings", "titleSlug": "number-of-divisible-substrings", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1246, "totalSubmissionRaw": 1633}, "2951": {"acRate": 75.69119622099755, "difficulty": "Easy", "likes": 152, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "2951", "paidOnly": false, "title": "Find the Peaks", "titleSlug": "find-the-peaks", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 49032, "totalSubmissionRaw": 64779}, "2952": {"acRate": 57.087897565416576, "difficulty": "Medium", "likes": 352, "dislikes": 55, "categoryTitle": "Algorithms", "frontendQuestionId": "2952", "paidOnly": false, "title": "Minimum Number of Coins to be Added", "titleSlug": "minimum-number-of-coins-to-be-added", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19439, "totalSubmissionRaw": 34051}, "2953": {"acRate": 27.746011435883084, "difficulty": "Hard", "likes": 198, "dislikes": 36, "categoryTitle": "Algorithms", "frontendQuestionId": "2953", "paidOnly": false, "title": "Count Complete Substrings", "titleSlug": "count-complete-substrings", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6939, "totalSubmissionRaw": 25009}, "2954": {"acRate": 36.665513663092355, "difficulty": "Hard", "likes": 115, "dislikes": 27, "categoryTitle": "Algorithms", "frontendQuestionId": "2954", "paidOnly": false, "title": "Count the Number of Infection Sequences", "titleSlug": "count-the-number-of-infection-sequences", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3181, "totalSubmissionRaw": 8674}, "2955": {"acRate": 65.73286643321661, "difficulty": "Medium", "likes": 29, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "2955", "paidOnly": true, "title": "Number of Same-End Substrings", "titleSlug": "number-of-same-end-substrings", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1314, "totalSubmissionRaw": 1997}, "2956": {"acRate": 83.68475962990418, "difficulty": "Easy", "likes": 217, "dislikes": 87, "categoryTitle": "Algorithms", "frontendQuestionId": "2956", "paidOnly": false, "title": "Find Common Elements Between Two Arrays", "titleSlug": "find-common-elements-between-two-arrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 60960, "totalSubmissionRaw": 72845}, "2957": {"acRate": 52.654484251021884, "difficulty": "Medium", "likes": 161, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "2957", "paidOnly": false, "title": "Remove Adjacent Almost-Equal Characters", "titleSlug": "remove-adjacent-almost-equal-characters", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21899, "totalSubmissionRaw": 41590}, "2958": {"acRate": 55.82003494247322, "difficulty": "Medium", "likes": 1030, "dislikes": 31, "categoryTitle": "Algorithms", "frontendQuestionId": "2958", "paidOnly": false, "title": "Length of Longest Subarray With at Most K Frequency", "titleSlug": "length-of-longest-subarray-with-at-most-k-frequency", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 147927, "totalSubmissionRaw": 265007}, "2959": {"acRate": 51.438928756380854, "difficulty": "Hard", "likes": 158, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "2959", "paidOnly": false, "title": "Number of Possible Sets of Closing Branches", "titleSlug": "number-of-possible-sets-of-closing-branches", "topicTags": [{"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6953, "totalSubmissionRaw": 13517}, "2960": {"acRate": 80.7568075484995, "difficulty": "Easy", "likes": 140, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "2960", "paidOnly": false, "title": "Count Tested Devices After Test Operations", "titleSlug": "count-tested-devices-after-test-operations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 41253, "totalSubmissionRaw": 51083}, "2961": {"acRate": 48.034079001321246, "difficulty": "Medium", "likes": 110, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2961", "paidOnly": false, "title": "Double Modular Exponentiation", "titleSlug": "double-modular-exponentiation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21086, "totalSubmissionRaw": 43898}, "2962": {"acRate": 58.94692490777636, "difficulty": "Medium", "likes": 1212, "dislikes": 59, "categoryTitle": "Algorithms", "frontendQuestionId": "2962", "paidOnly": false, "title": "Count Subarrays Where Max Element Appears at Least K Times", "titleSlug": "count-subarrays-where-max-element-appears-at-least-k-times", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 131510, "totalSubmissionRaw": 223099}, "2963": {"acRate": 49.8605003073722, "difficulty": "Hard", "likes": 241, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "2963", "paidOnly": false, "title": "Count the Number of Good Partitions", "titleSlug": "count-the-number-of-good-partitions", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10544, "totalSubmissionRaw": 21147}, "2964": {"acRate": 66.97211155378486, "difficulty": "Medium", "likes": 19, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "2964", "paidOnly": true, "title": "Number of Divisible Triplet Sums", "titleSlug": "number-of-divisible-triplet-sums", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1681, "totalSubmissionRaw": 2510}, "2965": {"acRate": 75.94140392623439, "difficulty": "Easy", "likes": 196, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "2965", "paidOnly": false, "title": "Find Missing and Repeated Values", "titleSlug": "find-missing-and-repeated-values", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 51063, "totalSubmissionRaw": 67240}, "2966": {"acRate": 71.66646155011313, "difficulty": "Medium", "likes": 828, "dislikes": 191, "categoryTitle": "Algorithms", "frontendQuestionId": "2966", "paidOnly": false, "title": "Divide Array Into Arrays With Max Difference", "titleSlug": "divide-array-into-arrays-with-max-difference", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 151404, "totalSubmissionRaw": 211262}, "2967": {"acRate": 22.16087921159899, "difficulty": "Medium", "likes": 222, "dislikes": 87, "categoryTitle": "Algorithms", "frontendQuestionId": "2967", "paidOnly": false, "title": "Minimum Cost to Make Array Equalindromic", "titleSlug": "minimum-cost-to-make-array-equalindromic", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12885, "totalSubmissionRaw": 58143}, "2968": {"acRate": 38.460138332726615, "difficulty": "Hard", "likes": 238, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "2968", "paidOnly": false, "title": "Apply Operations to Maximize Frequency Score", "titleSlug": "apply-operations-to-maximize-frequency-score", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6339, "totalSubmissionRaw": 16482}, "2969": {"acRate": 54.04411764705882, "difficulty": "Hard", "likes": 18, "dislikes": 0, "categoryTitle": "Algorithms", "frontendQuestionId": "2969", "paidOnly": true, "title": "Minimum Number of Coins for Fruits II", "titleSlug": "minimum-number-of-coins-for-fruits-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Monotonic Queue", "id": "VG9waWNUYWdOb2RlOjYxMDcx", "slug": "monotonic-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 588, "totalSubmissionRaw": 1088}, "2970": {"acRate": 52.097177183562806, "difficulty": "Easy", "likes": 146, "dislikes": 93, "categoryTitle": "Algorithms", "frontendQuestionId": "2970", "paidOnly": false, "title": "Count the Number of Incremovable Subarrays I", "titleSlug": "count-the-number-of-incremovable-subarrays-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19601, "totalSubmissionRaw": 37623}, "2971": {"acRate": 66.0816587235297, "difficulty": "Medium", "likes": 782, "dislikes": 69, "categoryTitle": "Algorithms", "frontendQuestionId": "2971", "paidOnly": false, "title": "Find Polygon With the Largest Perimeter", "titleSlug": "find-polygon-with-the-largest-perimeter", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 134496, "totalSubmissionRaw": 203529}, "2972": {"acRate": 39.93468100681345, "difficulty": "Hard", "likes": 193, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "2972", "paidOnly": false, "title": "Count the Number of Incremovable Subarrays II", "titleSlug": "count-the-number-of-incremovable-subarrays-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7092, "totalSubmissionRaw": 17759}, "2973": {"acRate": 37.118299027369375, "difficulty": "Hard", "likes": 173, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2973", "paidOnly": false, "title": "Find Number of Coins to Place in Tree Nodes", "titleSlug": "find-number-of-coins-to-place-in-tree-nodes", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8205, "totalSubmissionRaw": 22105}, "2974": {"acRate": 85.93037942707018, "difficulty": "Easy", "likes": 227, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "2974", "paidOnly": false, "title": "Minimum Number Game", "titleSlug": "minimum-number-game", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 85041, "totalSubmissionRaw": 98965}, "2975": {"acRate": 22.8924814637449, "difficulty": "Medium", "likes": 135, "dislikes": 115, "categoryTitle": "Algorithms", "frontendQuestionId": "2975", "paidOnly": false, "title": "Maximum Square Area by Removing Fences From a Field", "titleSlug": "maximum-square-area-by-removing-fences-from-a-field", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13852, "totalSubmissionRaw": 60544}, "2976": {"acRate": 58.616382444699866, "difficulty": "Medium", "likes": 859, "dislikes": 59, "categoryTitle": "Algorithms", "frontendQuestionId": "2976", "paidOnly": false, "title": "Minimum Cost to Convert String I", "titleSlug": "minimum-cost-to-convert-string-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 99955, "totalSubmissionRaw": 170524}, "2977": {"acRate": 25.49431603900652, "difficulty": "Hard", "likes": 95, "dislikes": 73, "categoryTitle": "Algorithms", "frontendQuestionId": "2977", "paidOnly": false, "title": "Minimum Cost to Convert String II", "titleSlug": "minimum-cost-to-convert-string-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4721, "totalSubmissionRaw": 18548}, "2978": {"acRate": 42.73339749759384, "difficulty": "Medium", "likes": 8, "dislikes": 2, "categoryTitle": "Database", "frontendQuestionId": "2978", "paidOnly": true, "title": "Symmetric Coordinates", "titleSlug": "symmetric-coordinates", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1332, "totalSubmissionRaw": 3117}, "2979": {"acRate": 77.18186250609459, "difficulty": "Medium", "likes": 15, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "2979", "paidOnly": true, "title": "Most Expensive Item That Can Not Be Bought", "titleSlug": "most-expensive-item-that-can-not-be-bought", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1583, "totalSubmissionRaw": 2051}, "2980": {"acRate": 70.75612577558103, "difficulty": "Easy", "likes": 106, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "2980", "paidOnly": false, "title": "Check if Bitwise OR Has Trailing Zeros", "titleSlug": "check-if-bitwise-or-has-trailing-zeros", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33641, "totalSubmissionRaw": 47545}, "2981": {"acRate": 43.03523593653411, "difficulty": "Medium", "likes": 162, "dislikes": 10, "categoryTitle": "Algorithms", "frontendQuestionId": "2981", "paidOnly": false, "title": "Find Longest Special Substring That Occurs Thrice I", "titleSlug": "find-longest-special-substring-that-occurs-thrice-i", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20886, "totalSubmissionRaw": 48531}, "2982": {"acRate": 34.05719710454492, "difficulty": "Medium", "likes": 248, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "2982", "paidOnly": false, "title": "Find Longest Special Substring That Occurs Thrice II", "titleSlug": "find-longest-special-substring-that-occurs-thrice-ii", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17220, "totalSubmissionRaw": 50563}, "2983": {"acRate": 25.871513944223107, "difficulty": "Hard", "likes": 85, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "2983", "paidOnly": false, "title": "Palindrome Rearrangement Queries", "titleSlug": "palindrome-rearrangement-queries", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3117, "totalSubmissionRaw": 12048}, "2984": {"acRate": 61.70850505807418, "difficulty": "Medium", "likes": 8, "dislikes": 4, "categoryTitle": "Database", "frontendQuestionId": "2984", "paidOnly": true, "title": "Find Peak Calling Hours for Each City", "titleSlug": "find-peak-calling-hours-for-each-city", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1647, "totalSubmissionRaw": 2669}, "2985": {"acRate": 87.33031674208145, "difficulty": "Easy", "likes": 7, "dislikes": 4, "categoryTitle": "Database", "frontendQuestionId": "2985", "paidOnly": true, "title": "Calculate Compressed Mean", "titleSlug": "calculate-compressed-mean", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2123, "totalSubmissionRaw": 2431}, "2986": {"acRate": 52.20257716511837, "difficulty": "Medium", "likes": 7, "dislikes": 8, "categoryTitle": "Database", "frontendQuestionId": "2986", "paidOnly": true, "title": "Find Third Transaction", "titleSlug": "find-third-transaction", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1742, "totalSubmissionRaw": 3337}, "2987": {"acRate": 79.26960257787326, "difficulty": "Easy", "likes": 8, "dislikes": 6, "categoryTitle": "Database", "frontendQuestionId": "2987", "paidOnly": true, "title": "Find Expensive Cities", "titleSlug": "find-expensive-cities", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2214, "totalSubmissionRaw": 2793}, "2988": {"acRate": 79.94395516413131, "difficulty": "Medium", "likes": 2, "dislikes": 1, "categoryTitle": "Database", "frontendQuestionId": "2988", "paidOnly": true, "title": "Manager of the Largest Department", "titleSlug": "manager-of-the-largest-department", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1997, "totalSubmissionRaw": 2498}, "2989": {"acRate": 89.097605893186, "difficulty": "Medium", "likes": 6, "dislikes": 2, "categoryTitle": "Database", "frontendQuestionId": "2989", "paidOnly": true, "title": "Class Performance", "titleSlug": "class-performance", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2419, "totalSubmissionRaw": 2715}, "2990": {"acRate": 61.1198738170347, "difficulty": "Easy", "likes": 13, "dislikes": 8, "categoryTitle": "Database", "frontendQuestionId": "2990", "paidOnly": true, "title": "Loan Types", "titleSlug": "loan-types", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2325, "totalSubmissionRaw": 3804}, "2991": {"acRate": 53.753753753753756, "difficulty": "Hard", "likes": 8, "dislikes": 5, "categoryTitle": "Database", "frontendQuestionId": "2991", "paidOnly": true, "title": "Top Three Wineries ", "titleSlug": "top-three-wineries", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1253, "totalSubmissionRaw": 2331}, "2992": {"acRate": 73.35701598579041, "difficulty": "Medium", "likes": 16, "dislikes": 0, "categoryTitle": "Algorithms", "frontendQuestionId": "2992", "paidOnly": true, "title": "Number of Self-Divisible Permutations", "titleSlug": "number-of-self-divisible-permutations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1239, "totalSubmissionRaw": 1689}, "2993": {"acRate": 81.06453132359867, "difficulty": "Medium", "likes": 9, "dislikes": 4, "categoryTitle": "Database", "frontendQuestionId": "2993", "paidOnly": true, "title": "Friday Purchases I", "titleSlug": "friday-purchases-i", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1721, "totalSubmissionRaw": 2123}, "2994": {"acRate": 73.63934426229508, "difficulty": "Hard", "likes": 10, "dislikes": 4, "categoryTitle": "Database", "frontendQuestionId": "2994", "paidOnly": true, "title": "Friday Purchases II ", "titleSlug": "friday-purchases-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1123, "totalSubmissionRaw": 1525}, "2995": {"acRate": 42.68817204301075, "difficulty": "Hard", "likes": 5, "dislikes": 5, "categoryTitle": "Database", "frontendQuestionId": "2995", "paidOnly": true, "title": "Viewers Turned Streamers", "titleSlug": "viewers-turned-streamers", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1191, "totalSubmissionRaw": 2790}, "2996": {"acRate": 32.61633524084554, "difficulty": "Easy", "likes": 107, "dislikes": 231, "categoryTitle": "Algorithms", "frontendQuestionId": "2996", "paidOnly": false, "title": "Smallest Missing Integer Greater Than Sequential Prefix Sum", "titleSlug": "smallest-missing-integer-greater-than-sequential-prefix-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30718, "totalSubmissionRaw": 94186}, "2997": {"acRate": 86.39734952715311, "difficulty": "Medium", "likes": 568, "dislikes": 54, "categoryTitle": "Algorithms", "frontendQuestionId": "2997", "paidOnly": false, "title": "Minimum Number of Operations to Make Array XOR Equal to K", "titleSlug": "minimum-number-of-operations-to-make-array-xor-equal-to-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 109265, "totalSubmissionRaw": 126468}, "2998": {"acRate": 46.62098809953119, "difficulty": "Medium", "likes": 243, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "2998", "paidOnly": false, "title": "Minimum Number of Operations to Make X and Y Equal", "titleSlug": "minimum-number-of-operations-to-make-x-and-y-equal", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19391, "totalSubmissionRaw": 41594}, "2999": {"acRate": 26.10779118277145, "difficulty": "Hard", "likes": 105, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "2999", "paidOnly": false, "title": "Count the Number of Powerful Integers", "titleSlug": "count-the-number-of-powerful-integers", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4631, "totalSubmissionRaw": 17738}, "3000": {"acRate": 36.19260270007649, "difficulty": "Easy", "likes": 102, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "3000", "paidOnly": false, "title": "Maximum Area of Longest Diagonal Rectangle", "titleSlug": "maximum-area-of-longest-diagonal-rectangle", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 35012, "totalSubmissionRaw": 96738}, "3001": {"acRate": 21.00932791198278, "difficulty": "Medium", "likes": 150, "dislikes": 194, "categoryTitle": "Algorithms", "frontendQuestionId": "3001", "paidOnly": false, "title": "Minimum Moves to Capture The Queen", "titleSlug": "minimum-moves-to-capture-the-queen", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17569, "totalSubmissionRaw": 83621}, "3002": {"acRate": 45.81991236470213, "difficulty": "Medium", "likes": 281, "dislikes": 24, "categoryTitle": "Algorithms", "frontendQuestionId": "3002", "paidOnly": false, "title": "Maximum Size of a Set After Removals", "titleSlug": "maximum-size-of-a-set-after-removals", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15790, "totalSubmissionRaw": 34461}, "3003": {"acRate": 28.272206548687695, "difficulty": "Hard", "likes": 131, "dislikes": 28, "categoryTitle": "Algorithms", "frontendQuestionId": "3003", "paidOnly": false, "title": "Maximize the Number of Partitions After Operations", "titleSlug": "maximize-the-number-of-partitions-after-operations", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3307, "totalSubmissionRaw": 11698}, "3004": {"acRate": 64.77794793261869, "difficulty": "Medium", "likes": 17, "dislikes": 0, "categoryTitle": "Algorithms", "frontendQuestionId": "3004", "paidOnly": true, "title": "Maximum Subtree of the Same Color", "titleSlug": "maximum-subtree-of-the-same-color", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1269, "totalSubmissionRaw": 1959}, "3005": {"acRate": 78.7453659411624, "difficulty": "Easy", "likes": 635, "dislikes": 68, "categoryTitle": "Algorithms", "frontendQuestionId": "3005", "paidOnly": false, "title": "Count Elements With Maximum Frequency", "titleSlug": "count-elements-with-maximum-frequency", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 210710, "totalSubmissionRaw": 267584}, "3006": {"acRate": 36.48558110361934, "difficulty": "Medium", "likes": 150, "dislikes": 31, "categoryTitle": "Algorithms", "frontendQuestionId": "3006", "paidOnly": false, "title": "Find Beautiful Indices in the Given Array I", "titleSlug": "find-beautiful-indices-in-the-given-array-i", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25595, "totalSubmissionRaw": 70151}, "3007": {"acRate": 36.5454769028979, "difficulty": "Medium", "likes": 287, "dislikes": 113, "categoryTitle": "Algorithms", "frontendQuestionId": "3007", "paidOnly": false, "title": "Maximum Number That Sum of the Prices Is Less Than or Equal to K", "titleSlug": "maximum-number-that-sum-of-the-prices-is-less-than-or-equal-to-k", "topicTags": [{"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8916, "totalSubmissionRaw": 24397}, "3008": {"acRate": 24.66457528957529, "difficulty": "Hard", "likes": 160, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "3008", "paidOnly": false, "title": "Find Beautiful Indices in the Given Array II", "titleSlug": "find-beautiful-indices-in-the-given-array-ii", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10221, "totalSubmissionRaw": 41440}, "3009": {"acRate": 45.98185767216047, "difficulty": "Hard", "likes": 28, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "3009", "paidOnly": true, "title": "Maximum Number of Intersections on the Chart", "titleSlug": "maximum-number-of-intersections-on-the-chart", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3599, "totalSubmissionRaw": 7827}, "3010": {"acRate": 66.4248538070454, "difficulty": "Easy", "likes": 89, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "3010", "paidOnly": false, "title": "Divide an Array Into Subarrays With Minimum Cost I", "titleSlug": "divide-an-array-into-subarrays-with-minimum-cost-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33055, "totalSubmissionRaw": 49763}, "3011": {"acRate": 51.53904915970162, "difficulty": "Medium", "likes": 116, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "3011", "paidOnly": false, "title": "Find if Array Can Be Sorted", "titleSlug": "find-if-array-can-be-sorted", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22939, "totalSubmissionRaw": 44509}, "3012": {"acRate": 35.36731825731442, "difficulty": "Medium", "likes": 161, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "3012", "paidOnly": false, "title": "Minimize Length of Array Using Operations", "titleSlug": "minimize-length-of-array-using-operations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13825, "totalSubmissionRaw": 39115}, "3013": {"acRate": 32.14782059380922, "difficulty": "Hard", "likes": 114, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "3013", "paidOnly": false, "title": "Divide an Array Into Subarrays With Minimum Cost II", "titleSlug": "divide-an-array-into-subarrays-with-minimum-cost-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5090, "totalSubmissionRaw": 15831}, "3014": {"acRate": 66.45116601246825, "difficulty": "Easy", "likes": 157, "dislikes": 26, "categoryTitle": "Algorithms", "frontendQuestionId": "3014", "paidOnly": false, "title": "Minimum Number of Pushes to Type Word I", "titleSlug": "minimum-number-of-pushes-to-type-word-i", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 40292, "totalSubmissionRaw": 60634}, "3015": {"acRate": 56.478493046182734, "difficulty": "Medium", "likes": 148, "dislikes": 33, "categoryTitle": "Algorithms", "frontendQuestionId": "3015", "paidOnly": false, "title": "Count the Number of Houses at a Certain Distance I", "titleSlug": "count-the-number-of-houses-at-a-certain-distance-i", "topicTags": [{"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19245, "totalSubmissionRaw": 34076}, "3016": {"acRate": 80.70547371509424, "difficulty": "Medium", "likes": 726, "dislikes": 73, "categoryTitle": "Algorithms", "frontendQuestionId": "3016", "paidOnly": false, "title": "Minimum Number of Pushes to Type Word II", "titleSlug": "minimum-number-of-pushes-to-type-word-ii", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 170545, "totalSubmissionRaw": 211317}, "3017": {"acRate": 21.85247214738222, "difficulty": "Hard", "likes": 79, "dislikes": 23, "categoryTitle": "Algorithms", "frontendQuestionId": "3017", "paidOnly": false, "title": "Count the Number of Houses at a Certain Distance II", "titleSlug": "count-the-number-of-houses-at-a-certain-distance-ii", "topicTags": [{"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3001, "totalSubmissionRaw": 13733}, "3018": {"acRate": 43.64012409513961, "difficulty": "Hard", "likes": 5, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "3018", "paidOnly": true, "title": "Maximum Number of Removal Queries That Can Be Processed I", "titleSlug": "maximum-number-of-removal-queries-that-can-be-processed-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 422, "totalSubmissionRaw": 967}, "3019": {"acRate": 80.94994238893868, "difficulty": "Easy", "likes": 112, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "3019", "paidOnly": false, "title": "Number of Changing Keys", "titleSlug": "number-of-changing-keys", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 50585, "totalSubmissionRaw": 62489}, "3020": {"acRate": 24.764288280698278, "difficulty": "Medium", "likes": 171, "dislikes": 37, "categoryTitle": "Algorithms", "frontendQuestionId": "3020", "paidOnly": false, "title": "Find the Maximum Number of Elements in Subset", "titleSlug": "find-the-maximum-number-of-elements-in-subset", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19990, "totalSubmissionRaw": 80715}, "3021": {"acRate": 47.829153795636415, "difficulty": "Medium", "likes": 90, "dislikes": 71, "categoryTitle": "Algorithms", "frontendQuestionId": "3021", "paidOnly": false, "title": "Alice and Bob Playing Flower Game", "titleSlug": "alice-and-bob-playing-flower-game", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19665, "totalSubmissionRaw": 41115}, "3022": {"acRate": 34.064099710661026, "difficulty": "Hard", "likes": 89, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "3022", "paidOnly": false, "title": "Minimize OR of Remaining Elements Using Operations", "titleSlug": "minimize-or-of-remaining-elements-using-operations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3061, "totalSubmissionRaw": 8986}, "3023": {"acRate": 58.455114822546975, "difficulty": "Medium", "likes": 10, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "3023", "paidOnly": true, "title": "Find Pattern in Infinite Stream I", "titleSlug": "find-pattern-in-infinite-stream-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 840, "totalSubmissionRaw": 1437}, "3024": {"acRate": 38.24992708029501, "difficulty": "Easy", "likes": 91, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "3024", "paidOnly": false, "title": "Type of Triangle", "titleSlug": "type-of-triangle", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 45898, "totalSubmissionRaw": 119995}, "3025": {"acRate": 41.172784243509405, "difficulty": "Medium", "likes": 83, "dislikes": 70, "categoryTitle": "Algorithms", "frontendQuestionId": "3025", "paidOnly": false, "title": "Find the Number of Ways to Place People I", "titleSlug": "find-the-number-of-ways-to-place-people-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13797, "totalSubmissionRaw": 33510}, "3026": {"acRate": 18.296093709685742, "difficulty": "Medium", "likes": 314, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "3026", "paidOnly": false, "title": "Maximum Good Subarray Sum", "titleSlug": "maximum-good-subarray-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17724, "totalSubmissionRaw": 96889}, "3027": {"acRate": 47.80305896341134, "difficulty": "Hard", "likes": 91, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "3027", "paidOnly": false, "title": "Find the Number of Ways to Place People II", "titleSlug": "find-the-number-of-ways-to-place-people-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8845, "totalSubmissionRaw": 18503}, "3028": {"acRate": 74.89045321521792, "difficulty": "Easy", "likes": 104, "dislikes": 36, "categoryTitle": "Algorithms", "frontendQuestionId": "3028", "paidOnly": false, "title": "Ant on the Boundary", "titleSlug": "ant-on-the-boundary", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 47329, "totalSubmissionRaw": 63202}, "3029": {"acRate": 40.90721223393263, "difficulty": "Medium", "likes": 140, "dislikes": 31, "categoryTitle": "Algorithms", "frontendQuestionId": "3029", "paidOnly": false, "title": "Minimum Time to Revert Word to Initial State I", "titleSlug": "minimum-time-to-revert-word-to-initial-state-i", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19795, "totalSubmissionRaw": 48390}, "3030": {"acRate": 44.32971014492754, "difficulty": "Medium", "likes": 76, "dislikes": 122, "categoryTitle": "Algorithms", "frontendQuestionId": "3030", "paidOnly": false, "title": "Find the Grid of Region Average", "titleSlug": "find-the-grid-of-region-average", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9788, "totalSubmissionRaw": 22081}, "3031": {"acRate": 35.59033462117739, "difficulty": "Hard", "likes": 128, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "3031", "paidOnly": false, "title": "Minimum Time to Revert Word to Initial State II", "titleSlug": "minimum-time-to-revert-word-to-initial-state-ii", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10870, "totalSubmissionRaw": 30543}, "3032": {"acRate": 87.13973799126637, "difficulty": "Easy", "likes": 23, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "3032", "paidOnly": true, "title": "Count Numbers With Unique Digits II", "titleSlug": "count-numbers-with-unique-digits-ii", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3991, "totalSubmissionRaw": 4580}, "3033": {"acRate": 68.49199080714001, "difficulty": "Easy", "likes": 108, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "3033", "paidOnly": false, "title": "Modify the Matrix", "titleSlug": "modify-the-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 39620, "totalSubmissionRaw": 57850}, "3034": {"acRate": 66.80042457348488, "difficulty": "Medium", "likes": 90, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "3034", "paidOnly": false, "title": "Number of Subarrays That Match a Pattern I", "titleSlug": "number-of-subarrays-that-match-a-pattern-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25805, "totalSubmissionRaw": 38629}, "3035": {"acRate": 42.6722104269875, "difficulty": "Medium", "likes": 208, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "3035", "paidOnly": false, "title": "Maximum Palindromes After Operations", "titleSlug": "maximum-palindromes-after-operations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14470, "totalSubmissionRaw": 33909}, "3036": {"acRate": 32.551197086393216, "difficulty": "Hard", "likes": 141, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "3036", "paidOnly": false, "title": "Number of Subarrays That Match a Pattern II", "titleSlug": "number-of-subarrays-that-match-a-pattern-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10904, "totalSubmissionRaw": 33498}, "3037": {"acRate": 71.5219421101774, "difficulty": "Hard", "likes": 4, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "3037", "paidOnly": true, "title": "Find Pattern in Infinite Stream II", "titleSlug": "find-pattern-in-infinite-stream-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 766, "totalSubmissionRaw": 1071}, "3038": {"acRate": 52.16674956478487, "difficulty": "Easy", "likes": 73, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "3038", "paidOnly": false, "title": "Maximum Number of Operations With the Same Score I", "titleSlug": "maximum-number-of-operations-with-the-same-score-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33563, "totalSubmissionRaw": 64337}, "3039": {"acRate": 56.810755093536855, "difficulty": "Medium", "likes": 129, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "3039", "paidOnly": false, "title": "Apply Operations to Make String Empty", "titleSlug": "apply-operations-to-make-string-empty", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25905, "totalSubmissionRaw": 45598}, "3040": {"acRate": 33.42683338965867, "difficulty": "Medium", "likes": 151, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "3040", "paidOnly": false, "title": "Maximum Number of Operations With the Same Score II", "titleSlug": "maximum-number-of-operations-with-the-same-score-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19782, "totalSubmissionRaw": 59180}, "3041": {"acRate": 32.330315780526156, "difficulty": "Hard", "likes": 150, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "3041", "paidOnly": false, "title": "Maximize Consecutive Elements in an Array After Modification", "titleSlug": "maximize-consecutive-elements-in-an-array-after-modification", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7607, "totalSubmissionRaw": 23522}, "3042": {"acRate": 65.36981099508068, "difficulty": "Easy", "likes": 101, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "3042", "paidOnly": false, "title": "Count Prefix and Suffix Pairs I", "titleSlug": "count-prefix-and-suffix-pairs-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 37873, "totalSubmissionRaw": 57936}, "3043": {"acRate": 35.22049707774958, "difficulty": "Medium", "likes": 162, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "3043", "paidOnly": false, "title": "Find the Length of the Longest Common Prefix", "titleSlug": "find-the-length-of-the-longest-common-prefix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23856, "totalSubmissionRaw": 67746}, "3044": {"acRate": 48.33663179719159, "difficulty": "Medium", "likes": 87, "dislikes": 64, "categoryTitle": "Algorithms", "frontendQuestionId": "3044", "paidOnly": false, "title": "Most Frequent Prime", "titleSlug": "most-frequent-prime", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15388, "totalSubmissionRaw": 31834}, "3045": {"acRate": 24.92072039729552, "difficulty": "Hard", "likes": 155, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "3045", "paidOnly": false, "title": "Count Prefix and Suffix Pairs II", "titleSlug": "count-prefix-and-suffix-pairs-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8330, "totalSubmissionRaw": 33426}, "3046": {"acRate": 58.63329716469312, "difficulty": "Easy", "likes": 103, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "3046", "paidOnly": false, "title": "Split the Array", "titleSlug": "split-the-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 49705, "totalSubmissionRaw": 84779}, "3047": {"acRate": 45.4259922758364, "difficulty": "Medium", "likes": 101, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "3047", "paidOnly": false, "title": "Find the Largest Area of Square Inside Two Rectangles", "titleSlug": "find-the-largest-area-of-square-inside-two-rectangles", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19526, "totalSubmissionRaw": 42983}, "3048": {"acRate": 36.135442541508695, "difficulty": "Medium", "likes": 172, "dislikes": 79, "categoryTitle": "Algorithms", "frontendQuestionId": "3048", "paidOnly": false, "title": "Earliest Second to Mark Indices I", "titleSlug": "earliest-second-to-mark-indices-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8292, "totalSubmissionRaw": 22947}, "3049": {"acRate": 23.04289286401231, "difficulty": "Hard", "likes": 73, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "3049", "paidOnly": false, "title": "Earliest Second to Mark Indices II", "titleSlug": "earliest-second-to-mark-indices-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2396, "totalSubmissionRaw": 10398}, "3050": {"acRate": 68.36573830793485, "difficulty": "Medium", "likes": 7, "dislikes": 0, "categoryTitle": "Database", "frontendQuestionId": "3050", "paidOnly": true, "title": "Pizza Toppings Cost Analysis", "titleSlug": "pizza-toppings-cost-analysis", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1301, "totalSubmissionRaw": 1903}, "3051": {"acRate": 74.09658899020602, "difficulty": "Easy", "likes": 10, "dislikes": 0, "categoryTitle": "Database", "frontendQuestionId": "3051", "paidOnly": true, "title": "Find Candidates for Data Scientist Position", "titleSlug": "find-candidates-for-data-scientist-position", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2194, "totalSubmissionRaw": 2961}, "3052": {"acRate": 73.77521613832853, "difficulty": "Hard", "likes": 4, "dislikes": 5, "categoryTitle": "Database", "frontendQuestionId": "3052", "paidOnly": true, "title": "Maximize Items", "titleSlug": "maximize-items", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 768, "totalSubmissionRaw": 1041}, "3053": {"acRate": 50.39102346140768, "difficulty": "Easy", "likes": 7, "dislikes": 0, "categoryTitle": "Database", "frontendQuestionId": "3053", "paidOnly": true, "title": "Classifying Triangles by Lengths", "titleSlug": "classifying-triangles-by-lengths", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1482, "totalSubmissionRaw": 2941}, "3054": {"acRate": 79.71360381861575, "difficulty": "Medium", "likes": 7, "dislikes": 1, "categoryTitle": "Database", "frontendQuestionId": "3054", "paidOnly": true, "title": "Binary Tree Nodes", "titleSlug": "binary-tree-nodes", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1336, "totalSubmissionRaw": 1676}, "3055": {"acRate": 60.32448377581121, "difficulty": "Medium", "likes": 5, "dislikes": 3, "categoryTitle": "Database", "frontendQuestionId": "3055", "paidOnly": true, "title": "Top Percentile Fraud", "titleSlug": "top-percentile-fraud", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1227, "totalSubmissionRaw": 2034}, "3056": {"acRate": 59.26443202979515, "difficulty": "Medium", "likes": 2, "dislikes": 1, "categoryTitle": "Database", "frontendQuestionId": "3056", "paidOnly": true, "title": "Snaps Analysis", "titleSlug": "snaps-analysis", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1273, "totalSubmissionRaw": 2148}, "3057": {"acRate": 68.44729344729345, "difficulty": "Hard", "likes": 5, "dislikes": 3, "categoryTitle": "Database", "frontendQuestionId": "3057", "paidOnly": true, "title": "Employees Project Allocation", "titleSlug": "employees-project-allocation", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 961, "totalSubmissionRaw": 1404}, "3058": {"acRate": 52.453549309194855, "difficulty": "Medium", "likes": 9, "dislikes": 2, "categoryTitle": "Database", "frontendQuestionId": "3058", "paidOnly": true, "title": "Friends With No Mutual Friends", "titleSlug": "friends-with-no-mutual-friends", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1101, "totalSubmissionRaw": 2099}, "3059": {"acRate": 67.41482965931864, "difficulty": "Easy", "likes": 6, "dislikes": 7, "categoryTitle": "Database", "frontendQuestionId": "3059", "paidOnly": true, "title": "Find All Unique Email Domains", "titleSlug": "find-all-unique-email-domains", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1682, "totalSubmissionRaw": 2495}, "3060": {"acRate": 40.33124440465532, "difficulty": "Hard", "likes": 3, "dislikes": 9, "categoryTitle": "Database", "frontendQuestionId": "3060", "paidOnly": true, "title": "User Activities within Time Bounds", "titleSlug": "user-activities-within-time-bounds", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 901, "totalSubmissionRaw": 2234}, "3061": {"acRate": 77.97246558197747, "difficulty": "Hard", "likes": 8, "dislikes": 4, "categoryTitle": "Database", "frontendQuestionId": "3061", "paidOnly": true, "title": "Calculate Trapping Rain Water", "titleSlug": "calculate-trapping-rain-water", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 623, "totalSubmissionRaw": 799}, "3062": {"acRate": 80.44718869866217, "difficulty": "Easy", "likes": 26, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "3062", "paidOnly": true, "title": "Winner of the Linked List Game", "titleSlug": "winner-of-the-linked-list-game", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 8599, "totalSubmissionRaw": 10689}, "3063": {"acRate": 86.02986657241318, "difficulty": "Easy", "likes": 37, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "3063", "paidOnly": true, "title": "Linked List Frequency", "titleSlug": "linked-list-frequency", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 9736, "totalSubmissionRaw": 11317}, "3064": {"acRate": 90.82644628099173, "difficulty": "Medium", "likes": 9, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "3064", "paidOnly": true, "title": "Guess the Number Using Bitwise Questions I", "titleSlug": "guess-the-number-using-bitwise-questions-i", "topicTags": [{"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1099, "totalSubmissionRaw": 1210}, "3065": {"acRate": 86.21602491506228, "difficulty": "Easy", "likes": 85, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "3065", "paidOnly": false, "title": "Minimum Operations to Exceed Threshold Value I", "titleSlug": "minimum-operations-to-exceed-threshold-value-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 60904, "totalSubmissionRaw": 70641}, "3066": {"acRate": 27.751196172248804, "difficulty": "Medium", "likes": 84, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "3066", "paidOnly": false, "title": "Minimum Operations to Exceed Threshold Value II", "titleSlug": "minimum-operations-to-exceed-threshold-value-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28073, "totalSubmissionRaw": 101157}, "3067": {"acRate": 57.957585021016435, "difficulty": "Medium", "likes": 188, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "3067", "paidOnly": false, "title": "Count Pairs of Connectable Servers in a Weighted Tree Network", "titleSlug": "count-pairs-of-connectable-servers-in-a-weighted-tree-network", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12134, "totalSubmissionRaw": 20936}, "3068": {"acRate": 66.90110847114283, "difficulty": "Hard", "likes": 626, "dislikes": 92, "categoryTitle": "Algorithms", "frontendQuestionId": "3068", "paidOnly": false, "title": "Find the Maximum Sum of Node Values", "titleSlug": "find-the-maximum-sum-of-node-values", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 70666, "totalSubmissionRaw": 105629}, "3069": {"acRate": 72.77098642104906, "difficulty": "Easy", "likes": 74, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "3069", "paidOnly": false, "title": "Distribute Elements Into Two Arrays I", "titleSlug": "distribute-elements-into-two-arrays-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 42980, "totalSubmissionRaw": 59062}, "3070": {"acRate": 59.55418412932345, "difficulty": "Medium", "likes": 135, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "3070", "paidOnly": false, "title": "Count Submatrices with Top-Left Element and Sum Less Than k", "titleSlug": "count-submatrices-with-top-left-element-and-sum-less-than-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25864, "totalSubmissionRaw": 43428}, "3071": {"acRate": 62.885412674633315, "difficulty": "Medium", "likes": 91, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "3071", "paidOnly": false, "title": "Minimum Operations to Write the Letter Y on a Grid", "titleSlug": "minimum-operations-to-write-the-letter-y-on-a-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18050, "totalSubmissionRaw": 28703}, "3072": {"acRate": 27.796859666339547, "difficulty": "Hard", "likes": 130, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "3072", "paidOnly": false, "title": "Distribute Elements Into Two Arrays II", "titleSlug": "distribute-elements-into-two-arrays-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10197, "totalSubmissionRaw": 36684}, "3073": {"acRate": 41.301627033792236, "difficulty": "Medium", "likes": 12, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "3073", "paidOnly": true, "title": "Maximum Increasing Triplet Value", "titleSlug": "maximum-increasing-triplet-value", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 660, "totalSubmissionRaw": 1598}, "3074": {"acRate": 67.08758460450551, "difficulty": "Easy", "likes": 87, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "3074", "paidOnly": false, "title": "Apple Redistribution into Boxes", "titleSlug": "apple-redistribution-into-boxes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 46487, "totalSubmissionRaw": 69293}, "3075": {"acRate": 55.03114138569652, "difficulty": "Medium", "likes": 641, "dislikes": 89, "categoryTitle": "Algorithms", "frontendQuestionId": "3075", "paidOnly": false, "title": "Maximize Happiness of Selected Children", "titleSlug": "maximize-happiness-of-selected-children", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 173534, "totalSubmissionRaw": 315337}, "3076": {"acRate": 45.91546304163126, "difficulty": "Medium", "likes": 127, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "3076", "paidOnly": false, "title": "Shortest Uncommon Substring in an Array", "titleSlug": "shortest-uncommon-substring-in-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21617, "totalSubmissionRaw": 47080}, "3077": {"acRate": 27.950254987921625, "difficulty": "Hard", "likes": 130, "dislikes": 75, "categoryTitle": "Algorithms", "frontendQuestionId": "3077", "paidOnly": false, "title": "Maximum Strength of K Disjoint Subarrays", "titleSlug": "maximum-strength-of-k-disjoint-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6248, "totalSubmissionRaw": 22354}, "3078": {"acRate": 66.93766937669376, "difficulty": "Medium", "likes": 8, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "3078", "paidOnly": true, "title": "Match Alphanumerical Pattern in Matrix I", "titleSlug": "match-alphanumerical-pattern-in-matrix-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 494, "totalSubmissionRaw": 738}, "3079": {"acRate": 74.4478854647916, "difficulty": "Easy", "likes": 93, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "3079", "paidOnly": false, "title": "Find the Sum of Encrypted Integers", "titleSlug": "find-the-sum-of-encrypted-integers", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 43992, "totalSubmissionRaw": 59091}, "3080": {"acRate": 49.38777741335957, "difficulty": "Medium", "likes": 111, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "3080", "paidOnly": false, "title": "Mark Elements on Array by Performing Queries", "titleSlug": "mark-elements-on-array-by-performing-queries", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18070, "totalSubmissionRaw": 36588}, "3081": {"acRate": 27.42801868735722, "difficulty": "Medium", "likes": 160, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "3081", "paidOnly": false, "title": "Replace Question Marks in String to Minimize Its Value", "titleSlug": "replace-question-marks-in-string-to-minimize-its-value", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13327, "totalSubmissionRaw": 48589}, "3082": {"acRate": 39.05960553557807, "difficulty": "Hard", "likes": 132, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "3082", "paidOnly": false, "title": "Find the Sum of the Power of All Subsequences", "titleSlug": "find-the-sum-of-the-power-of-all-subsequences", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7169, "totalSubmissionRaw": 18354}, "3083": {"acRate": 66.18852768424708, "difficulty": "Easy", "likes": 89, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "3083", "paidOnly": false, "title": "Existence of a Substring in a String and Its Reverse", "titleSlug": "existence-of-a-substring-in-a-string-and-its-reverse", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 43836, "totalSubmissionRaw": 66229}, "3084": {"acRate": 48.877583979328165, "difficulty": "Medium", "likes": 108, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "3084", "paidOnly": false, "title": "Count Substrings Starting and Ending with Given Character", "titleSlug": "count-substrings-starting-and-ending-with-given-character", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 36318, "totalSubmissionRaw": 74304}, "3085": {"acRate": 44.027565084226644, "difficulty": "Medium", "likes": 193, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "3085", "paidOnly": false, "title": "Minimum Deletions to Make String K-Special", "titleSlug": "minimum-deletions-to-make-string-k-special", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19550, "totalSubmissionRaw": 44404}, "3086": {"acRate": 23.08591922657103, "difficulty": "Hard", "likes": 50, "dislikes": 45, "categoryTitle": "Algorithms", "frontendQuestionId": "3086", "paidOnly": false, "title": "Minimum Moves to Pick K Ones", "titleSlug": "minimum-moves-to-pick-k-ones", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2961, "totalSubmissionRaw": 12826}, "3087": {"acRate": 64.01045068582626, "difficulty": "Medium", "likes": 5, "dislikes": 6, "categoryTitle": "Database", "frontendQuestionId": "3087", "paidOnly": true, "title": "Find Trending Hashtags", "titleSlug": "find-trending-hashtags", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 980, "totalSubmissionRaw": 1531}, "3088": {"acRate": 54.02144772117963, "difficulty": "Hard", "likes": 8, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "3088", "paidOnly": true, "title": "Make String Anti-palindrome", "titleSlug": "make-string-anti-palindrome", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 403, "totalSubmissionRaw": 746}, "3089": {"acRate": 39.86420950533463, "difficulty": "Medium", "likes": 7, "dislikes": 14, "categoryTitle": "Database", "frontendQuestionId": "3089", "paidOnly": true, "title": "Find Bursty Behavior", "titleSlug": "find-bursty-behavior", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 822, "totalSubmissionRaw": 2062}, "3090": {"acRate": 63.72579157700584, "difficulty": "Easy", "likes": 166, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "3090", "paidOnly": false, "title": "Maximum Length Substring With Two Occurrences", "titleSlug": "maximum-length-substring-with-two-occurrences", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 39388, "totalSubmissionRaw": 61808}, "3091": {"acRate": 44.63375020302095, "difficulty": "Medium", "likes": 156, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "3091", "paidOnly": false, "title": "Apply Operations to Make Sum of Array Greater Than or Equal to k", "titleSlug": "apply-operations-to-make-sum-of-array-greater-than-or-equal-to-k", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27472, "totalSubmissionRaw": 61561}, "3092": {"acRate": 42.67794313686925, "difficulty": "Medium", "likes": 221, "dislikes": 28, "categoryTitle": "Algorithms", "frontendQuestionId": "3092", "paidOnly": false, "title": "Most Frequent IDs", "titleSlug": "most-frequent-ids", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19529, "totalSubmissionRaw": 45759}, "3093": {"acRate": 41.42174220963173, "difficulty": "Hard", "likes": 125, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "3093", "paidOnly": false, "title": "Longest Common Suffix Queries", "titleSlug": "longest-common-suffix-queries", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9354, "totalSubmissionRaw": 22586}, "3094": {"acRate": 80.85443037974683, "difficulty": "Medium", "likes": 11, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "3094", "paidOnly": true, "title": "Guess the Number Using Bitwise Questions II", "titleSlug": "guess-the-number-using-bitwise-questions-ii", "topicTags": [{"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 511, "totalSubmissionRaw": 632}, "3095": {"acRate": 41.051705891997436, "difficulty": "Easy", "likes": 84, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "3095", "paidOnly": false, "title": "Shortest Subarray With OR at Least K I", "titleSlug": "shortest-subarray-with-or-at-least-k-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27542, "totalSubmissionRaw": 67091}, "3096": {"acRate": 40.64339467997914, "difficulty": "Medium", "likes": 78, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "3096", "paidOnly": false, "title": "Minimum Levels to Gain More Points", "titleSlug": "minimum-levels-to-gain-more-points", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21814, "totalSubmissionRaw": 53679}, "3097": {"acRate": 30.324499852396848, "difficulty": "Medium", "likes": 187, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "3097", "paidOnly": false, "title": "Shortest Subarray With OR at Least K II", "titleSlug": "shortest-subarray-with-or-at-least-k-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13354, "totalSubmissionRaw": 44037}, "3098": {"acRate": 24.46139573239872, "difficulty": "Hard", "likes": 122, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "3098", "paidOnly": false, "title": "Find the Sum of Subsequence Powers", "titleSlug": "find-the-sum-of-subsequence-powers", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4746, "totalSubmissionRaw": 19402}, "3099": {"acRate": 82.99401029217401, "difficulty": "Easy", "likes": 121, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "3099", "paidOnly": false, "title": "Harshad Number", "titleSlug": "harshad-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 59026, "totalSubmissionRaw": 71121}, "3100": {"acRate": 63.78372397514154, "difficulty": "Medium", "likes": 136, "dislikes": 36, "categoryTitle": "Algorithms", "frontendQuestionId": "3100", "paidOnly": false, "title": "Water Bottles II", "titleSlug": "water-bottles-ii", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34588, "totalSubmissionRaw": 54227}, "3101": {"acRate": 57.17345464809311, "difficulty": "Medium", "likes": 203, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "3101", "paidOnly": false, "title": "Count Alternating Subarrays", "titleSlug": "count-alternating-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34437, "totalSubmissionRaw": 60231}, "3102": {"acRate": 32.62822257650581, "difficulty": "Hard", "likes": 162, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "3102", "paidOnly": false, "title": "Minimize Manhattan Distances", "titleSlug": "minimize-manhattan-distances", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8391, "totalSubmissionRaw": 25717}, "3103": {"acRate": 66.21787025703794, "difficulty": "Hard", "likes": 7, "dislikes": 0, "categoryTitle": "Database", "frontendQuestionId": "3103", "paidOnly": true, "title": "Find Trending Hashtags II ", "titleSlug": "find-trending-hashtags-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 541, "totalSubmissionRaw": 817}, "3104": {"acRate": 56.97538100820633, "difficulty": "Hard", "likes": 8, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "3104", "paidOnly": true, "title": "Find Longest Self-Contained Substring", "titleSlug": "find-longest-self-contained-substring", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 486, "totalSubmissionRaw": 853}, "3105": {"acRate": 57.011843994824474, "difficulty": "Easy", "likes": 108, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "3105", "paidOnly": false, "title": "Longest Strictly Increasing or Strictly Decreasing Subarray", "titleSlug": "longest-strictly-increasing-or-strictly-decreasing-subarray", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 40097, "totalSubmissionRaw": 70331}, "3106": {"acRate": 63.5245173892088, "difficulty": "Medium", "likes": 143, "dislikes": 18, "categoryTitle": "Algorithms", "frontendQuestionId": "3106", "paidOnly": false, "title": "Lexicographically Smallest String After Operations With Constraint", "titleSlug": "lexicographically-smallest-string-after-operations-with-constraint", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25042, "totalSubmissionRaw": 39421}, "3107": {"acRate": 48.529029938684616, "difficulty": "Medium", "likes": 130, "dislikes": 178, "categoryTitle": "Algorithms", "frontendQuestionId": "3107", "paidOnly": false, "title": "Minimum Operations to Make Median of Array Equal to K", "titleSlug": "minimum-operations-to-make-median-of-array-equal-to-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24298, "totalSubmissionRaw": 50068}, "3108": {"acRate": 45.70304894669211, "difficulty": "Hard", "likes": 177, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "3108", "paidOnly": false, "title": "Minimum Cost Walk in Weighted Graph", "titleSlug": "minimum-cost-walk-in-weighted-graph", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11737, "totalSubmissionRaw": 25681}, "3109": {"acRate": 41.2262156448203, "difficulty": "Medium", "likes": 10, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "3109", "paidOnly": true, "title": "Find the Index of Permutation", "titleSlug": "find-the-index-of-permutation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Merge Sort", "id": "VG9waWNUYWdOb2RlOjYxMDUx", "slug": "merge-sort"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 390, "totalSubmissionRaw": 946}, "3110": {"acRate": 93.22536003113782, "difficulty": "Easy", "likes": 570, "dislikes": 36, "categoryTitle": "Algorithms", "frontendQuestionId": "3110", "paidOnly": false, "title": "Score of a String", "titleSlug": "score-of-a-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 258651, "totalSubmissionRaw": 277447}, "3111": {"acRate": 63.822575532200254, "difficulty": "Medium", "likes": 87, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "3111", "paidOnly": false, "title": "Minimum Rectangles to Cover Points", "titleSlug": "minimum-rectangles-to-cover-points", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26173, "totalSubmissionRaw": 41009}, "3112": {"acRate": 34.6751253836365, "difficulty": "Medium", "likes": 153, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "3112", "paidOnly": false, "title": "Minimum Time to Visit Disappearing Nodes", "titleSlug": "minimum-time-to-visit-disappearing-nodes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18529, "totalSubmissionRaw": 53436}, "3113": {"acRate": 30.008338223032027, "difficulty": "Hard", "likes": 199, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "3113", "paidOnly": false, "title": "Find the Number of Subarrays Where Boundary Elements Are Maximum", "titleSlug": "find-the-number-of-subarrays-where-boundary-elements-are-maximum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9717, "totalSubmissionRaw": 32381}, "3114": {"acRate": 35.60604445960059, "difficulty": "Easy", "likes": 92, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "3114", "paidOnly": false, "title": "Latest Time You Can Obtain After Replacing Characters", "titleSlug": "latest-time-you-can-obtain-after-replacing-characters", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33412, "totalSubmissionRaw": 93838}, "3115": {"acRate": 58.33473404336599, "difficulty": "Medium", "likes": 102, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "3115", "paidOnly": false, "title": "Maximum Prime Difference", "titleSlug": "maximum-prime-difference", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 38176, "totalSubmissionRaw": 65443}, "3116": {"acRate": 16.530151826182397, "difficulty": "Hard", "likes": 209, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "3116", "paidOnly": false, "title": "Kth Smallest Amount With Single Denomination Combination", "titleSlug": "kth-smallest-amount-with-single-denomination-combination", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8130, "totalSubmissionRaw": 49196}, "3117": {"acRate": 27.869526888039964, "difficulty": "Hard", "likes": 109, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "3117", "paidOnly": false, "title": "Minimum Sum of Values by Dividing Array", "titleSlug": "minimum-sum-of-values-by-dividing-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4742, "totalSubmissionRaw": 17015}, "3118": {"acRate": 62.47960848287113, "difficulty": "Medium", "likes": 3, "dislikes": 4, "categoryTitle": "Database", "frontendQuestionId": "3118", "paidOnly": true, "title": "Friday Purchase III ", "titleSlug": "friday-purchase-iii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 766, "totalSubmissionRaw": 1226}, "3119": {"acRate": 60.10064701653487, "difficulty": "Medium", "likes": 8, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "3119", "paidOnly": true, "title": "Maximum Number of Potholes That Can Be Fixed", "titleSlug": "maximum-number-of-potholes-that-can-be-fixed", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 836, "totalSubmissionRaw": 1391}, "3120": {"acRate": 65.57415703843434, "difficulty": "Easy", "likes": 121, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "3120", "paidOnly": false, "title": "Count the Number of Special Characters I", "titleSlug": "count-the-number-of-special-characters-i", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 44494, "totalSubmissionRaw": 67854}, "3121": {"acRate": 41.486389829822265, "difficulty": "Medium", "likes": 142, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "3121", "paidOnly": false, "title": "Count the Number of Special Characters II", "titleSlug": "count-the-number-of-special-characters-ii", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30741, "totalSubmissionRaw": 74099}, "3122": {"acRate": 41.169744439997714, "difficulty": "Medium", "likes": 211, "dislikes": 10, "categoryTitle": "Algorithms", "frontendQuestionId": "3122", "paidOnly": false, "title": "Minimum Number of Operations to Satisfy Conditions", "titleSlug": "minimum-number-of-operations-to-satisfy-conditions", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14402, "totalSubmissionRaw": 34982}, "3123": {"acRate": 48.75523056764868, "difficulty": "Hard", "likes": 223, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "3123", "paidOnly": false, "title": "Find Edges in Shortest Paths", "titleSlug": "find-edges-in-shortest-paths", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11535, "totalSubmissionRaw": 23659}, "3124": {"acRate": 71.71156893819335, "difficulty": "Medium", "likes": 4, "dislikes": 3, "categoryTitle": "Database", "frontendQuestionId": "3124", "paidOnly": true, "title": "Find Longest Calls", "titleSlug": "find-longest-calls", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 905, "totalSubmissionRaw": 1262}, "3125": {"acRate": 68.8787185354691, "difficulty": "Medium", "likes": 9, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "3125", "paidOnly": true, "title": "Maximum Number That Makes Result of Bitwise AND Zero", "titleSlug": "maximum-number-that-makes-result-of-bitwise-and-zero", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 602, "totalSubmissionRaw": 874}, "3126": {"acRate": 56.65054413542926, "difficulty": "Medium", "likes": 6, "dislikes": 12, "categoryTitle": "Database", "frontendQuestionId": "3126", "paidOnly": true, "title": "Server Utilization Time", "titleSlug": "server-utilization-time", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 937, "totalSubmissionRaw": 1654}, "3127": {"acRate": 51.10873899820749, "difficulty": "Easy", "likes": 66, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "3127", "paidOnly": false, "title": "Make a Square with the Same Color", "titleSlug": "make-a-square-with-the-same-color", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25375, "totalSubmissionRaw": 49650}, "3128": {"acRate": 47.556593604024435, "difficulty": "Medium", "likes": 102, "dislikes": 18, "categoryTitle": "Algorithms", "frontendQuestionId": "3128", "paidOnly": false, "title": "Right Triangles", "titleSlug": "right-triangles", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18529, "totalSubmissionRaw": 38962}, "3129": {"acRate": 26.97229644213191, "difficulty": "Medium", "likes": 112, "dislikes": 34, "categoryTitle": "Algorithms", "frontendQuestionId": "3129", "paidOnly": false, "title": "Find All Possible Stable Binary Arrays I", "titleSlug": "find-all-possible-stable-binary-arrays-i", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7672, "totalSubmissionRaw": 28444}, "3130": {"acRate": 28.329068334754997, "difficulty": "Hard", "likes": 58, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "3130", "paidOnly": false, "title": "Find All Possible Stable Binary Arrays II", "titleSlug": "find-all-possible-stable-binary-arrays-ii", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2989, "totalSubmissionRaw": 10551}, "3131": {"acRate": 82.2088689434852, "difficulty": "Easy", "likes": 116, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "3131", "paidOnly": false, "title": "Find the Integer Added to Array I", "titleSlug": "find-the-integer-added-to-array-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 54042, "totalSubmissionRaw": 65737}, "3132": {"acRate": 31.198246826785898, "difficulty": "Medium", "likes": 150, "dislikes": 36, "categoryTitle": "Algorithms", "frontendQuestionId": "3132", "paidOnly": false, "title": "Find the Integer Added to Array II", "titleSlug": "find-the-integer-added-to-array-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21212, "totalSubmissionRaw": 67991}, "3133": {"acRate": 37.94465311533363, "difficulty": "Medium", "likes": 194, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "3133", "paidOnly": false, "title": "Minimum Array End", "titleSlug": "minimum-array-end", "topicTags": [{"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13739, "totalSubmissionRaw": 36208}, "3134": {"acRate": 28.620672674447235, "difficulty": "Hard", "likes": 141, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "3134", "paidOnly": false, "title": "Find the Median of the Uniqueness Array", "titleSlug": "find-the-median-of-the-uniqueness-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5812, "totalSubmissionRaw": 20307}, "3135": {"acRate": 56.16438356164384, "difficulty": "Medium", "likes": 10, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "3135", "paidOnly": true, "title": "Equalize Strings by Adding or Removing Characters at Ends", "titleSlug": "equalize-strings-by-adding-or-removing-characters-at-ends", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 574, "totalSubmissionRaw": 1022}, "3136": {"acRate": 37.641971642788214, "difficulty": "Easy", "likes": 99, "dislikes": 95, "categoryTitle": "Algorithms", "frontendQuestionId": "3136", "paidOnly": false, "title": "Valid Word", "titleSlug": "valid-word", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 40566, "totalSubmissionRaw": 107768}, "3137": {"acRate": 62.55105246622683, "difficulty": "Medium", "likes": 111, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "3137", "paidOnly": false, "title": "Minimum Number of Operations to Make Word K-Periodic", "titleSlug": "minimum-number-of-operations-to-make-word-k-periodic", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23892, "totalSubmissionRaw": 38196}, "3138": {"acRate": 41.99608194505611, "difficulty": "Medium", "likes": 166, "dislikes": 95, "categoryTitle": "Algorithms", "frontendQuestionId": "3138", "paidOnly": false, "title": "Minimum Length of Anagram Concatenation", "titleSlug": "minimum-length-of-anagram-concatenation", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27654, "totalSubmissionRaw": 65849}, "3139": {"acRate": 16.590171717971035, "difficulty": "Hard", "likes": 116, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "3139", "paidOnly": false, "title": "Minimum Cost to Equalize Array", "titleSlug": "minimum-cost-to-equalize-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4193, "totalSubmissionRaw": 25274}, "3140": {"acRate": 63.54330708661418, "difficulty": "Medium", "likes": 4, "dislikes": 2, "categoryTitle": "Database", "frontendQuestionId": "3140", "paidOnly": true, "title": "Consecutive Available Seats II", "titleSlug": "consecutive-available-seats-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 807, "totalSubmissionRaw": 1270}, "3141": {"acRate": 72.0, "difficulty": "Hard", "likes": 11, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "3141", "paidOnly": true, "title": "Maximum Hamming Distances", "titleSlug": "maximum-hamming-distances", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 414, "totalSubmissionRaw": 575}, "3142": {"acRate": 43.14029997139237, "difficulty": "Easy", "likes": 64, "dislikes": 0, "categoryTitle": "Algorithms", "frontendQuestionId": "3142", "paidOnly": false, "title": "Check if Grid Satisfies Conditions", "titleSlug": "check-if-grid-satisfies-conditions", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 31668, "totalSubmissionRaw": 73407}, "3143": {"acRate": 38.906235650656626, "difficulty": "Medium", "likes": 142, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "3143", "paidOnly": false, "title": "Maximum Points Inside the Square", "titleSlug": "maximum-points-inside-the-square", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16946, "totalSubmissionRaw": 43556}, "3144": {"acRate": 40.92661729604015, "difficulty": "Medium", "likes": 129, "dislikes": 30, "categoryTitle": "Algorithms", "frontendQuestionId": "3144", "paidOnly": false, "title": "Minimum Substring Partition of Equal Character Frequency", "titleSlug": "minimum-substring-partition-of-equal-character-frequency", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13374, "totalSubmissionRaw": 32678}, "3145": {"acRate": 24.847857050369026, "difficulty": "Hard", "likes": 54, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "3145", "paidOnly": false, "title": "Find Products of Elements of Big Array", "titleSlug": "find-products-of-elements-of-big-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1919, "totalSubmissionRaw": 7723}, "3146": {"acRate": 89.07433680434724, "difficulty": "Easy", "likes": 115, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "3146", "paidOnly": false, "title": "Permutation Difference between Two Strings", "titleSlug": "permutation-difference-between-two-strings", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 66551, "totalSubmissionRaw": 74714}, "3147": {"acRate": 40.51245471964643, "difficulty": "Medium", "likes": 147, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "3147", "paidOnly": false, "title": "Taking Maximum Energy From the Mystic Dungeon", "titleSlug": "taking-maximum-energy-from-the-mystic-dungeon", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28966, "totalSubmissionRaw": 71499}, "3148": {"acRate": 47.93031891655745, "difficulty": "Medium", "likes": 221, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "3148", "paidOnly": false, "title": "Maximum Difference Score in a Grid", "titleSlug": "maximum-difference-score-in-a-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17554, "totalSubmissionRaw": 36624}, "3149": {"acRate": 23.026208249332534, "difficulty": "Hard", "likes": 102, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "3149", "paidOnly": false, "title": "Find the Minimum Cost Array Permutation", "titleSlug": "find-the-minimum-cost-array-permutation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4226, "totalSubmissionRaw": 18353}, "3150": {"acRate": 87.3015873015873, "difficulty": "Easy", "likes": 4, "dislikes": 2, "categoryTitle": "Database", "frontendQuestionId": "3150", "paidOnly": true, "title": "Invalid Tweets II", "titleSlug": "invalid-tweets-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1210, "totalSubmissionRaw": 1386}, "3151": {"acRate": 75.66869382702761, "difficulty": "Easy", "likes": 90, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "3151", "paidOnly": false, "title": "Special Array I", "titleSlug": "special-array-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 56240, "totalSubmissionRaw": 74324}, "3152": {"acRate": 30.03026675620177, "difficulty": "Medium", "likes": 180, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "3152", "paidOnly": false, "title": "Special Array II", "titleSlug": "special-array-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30857, "totalSubmissionRaw": 102753}, "3153": {"acRate": 43.69090874503016, "difficulty": "Medium", "likes": 168, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "3153", "paidOnly": false, "title": "Sum of Digit Differences of All Pairs", "titleSlug": "sum-of-digit-differences-of-all-pairs", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22967, "totalSubmissionRaw": 52567}, "3154": {"acRate": 36.430006697923645, "difficulty": "Hard", "likes": 126, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "3154", "paidOnly": false, "title": "Find Number of Ways to Reach the K-th Stair", "titleSlug": "find-number-of-ways-to-reach-the-k-th-stair", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10878, "totalSubmissionRaw": 29860}, "3155": {"acRate": 50.765136393878905, "difficulty": "Medium", "likes": 6, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "3155", "paidOnly": true, "title": "Maximum Number of Upgradable Servers", "titleSlug": "maximum-number-of-upgradable-servers", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 763, "totalSubmissionRaw": 1503}, "3156": {"acRate": 56.865284974093264, "difficulty": "Hard", "likes": 6, "dislikes": 1, "categoryTitle": "Database", "frontendQuestionId": "3156", "paidOnly": true, "title": "Employee Task Duration and Concurrent Tasks", "titleSlug": "employee-task-duration-and-concurrent-tasks", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 439, "totalSubmissionRaw": 772}, "3157": {"acRate": 69.1875, "difficulty": "Medium", "likes": 10, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "3157", "paidOnly": true, "title": "Find the Level of Tree with Minimum Sum", "titleSlug": "find-the-level-of-tree-with-minimum-sum", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1107, "totalSubmissionRaw": 1600}, "3158": {"acRate": 82.05114023929355, "difficulty": "Easy", "likes": 89, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "3158", "paidOnly": false, "title": "Find the XOR of Numbers Which Appear Twice", "titleSlug": "find-the-xor-of-numbers-which-appear-twice", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 44507, "totalSubmissionRaw": 54243}, "3159": {"acRate": 73.62862010221465, "difficulty": "Medium", "likes": 109, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "3159", "paidOnly": false, "title": "Find Occurrences of an Element in an Array", "titleSlug": "find-occurrences-of-an-element-in-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34574, "totalSubmissionRaw": 46958}, "3160": {"acRate": 41.165367541682684, "difficulty": "Medium", "likes": 106, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "3160", "paidOnly": false, "title": "Find the Number of Distinct Colors Among the Balls", "titleSlug": "find-the-number-of-distinct-colors-among-the-balls", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23554, "totalSubmissionRaw": 57218}, "3161": {"acRate": 13.690862914181087, "difficulty": "Hard", "likes": 96, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "3161", "paidOnly": false, "title": "Block Placement Queries", "titleSlug": "block-placement-queries", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4636, "totalSubmissionRaw": 33862}, "3162": {"acRate": 86.76091817384167, "difficulty": "Easy", "likes": 98, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "3162", "paidOnly": false, "title": "Find the Number of Good Pairs I", "titleSlug": "find-the-number-of-good-pairs-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 61305, "totalSubmissionRaw": 70660}, "3163": {"acRate": 55.84777051973872, "difficulty": "Medium", "likes": 105, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "3163", "paidOnly": false, "title": "String Compression III", "titleSlug": "string-compression-iii", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 39328, "totalSubmissionRaw": 70420}, "3164": {"acRate": 25.664446625049585, "difficulty": "Medium", "likes": 200, "dislikes": 34, "categoryTitle": "Algorithms", "frontendQuestionId": "3164", "paidOnly": false, "title": "Find the Number of Good Pairs II", "titleSlug": "find-the-number-of-good-pairs-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24584, "totalSubmissionRaw": 95793}, "3165": {"acRate": 17.11566091954023, "difficulty": "Hard", "likes": 104, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "3165", "paidOnly": false, "title": "Maximum Sum of Subsequence With Non-adjacent Elements", "titleSlug": "maximum-sum-of-subsequence-with-non-adjacent-elements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5718, "totalSubmissionRaw": 33408}, "3166": {"acRate": 61.33122028526149, "difficulty": "Medium", "likes": 4, "dislikes": 2, "categoryTitle": "Database", "frontendQuestionId": "3166", "paidOnly": true, "title": "Calculate Parking Fees and Duration", "titleSlug": "calculate-parking-fees-and-duration", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 774, "totalSubmissionRaw": 1262}, "3167": {"acRate": 77.41303282704557, "difficulty": "Medium", "likes": 9, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "3167", "paidOnly": true, "title": "Better Compression of String", "titleSlug": "better-compression-of-string", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1580, "totalSubmissionRaw": 2041}, "3168": {"acRate": 80.34834045349983, "difficulty": "Easy", "likes": 106, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "3168", "paidOnly": false, "title": "Minimum Number of Chairs in a Waiting Room", "titleSlug": "minimum-number-of-chairs-in-a-waiting-room", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 51345, "totalSubmissionRaw": 63903}, "3169": {"acRate": 33.667251324521274, "difficulty": "Medium", "likes": 192, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "3169", "paidOnly": false, "title": "Count Days Without Meetings", "titleSlug": "count-days-without-meetings", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 37238, "totalSubmissionRaw": 110606}, "3170": {"acRate": 35.850989196015156, "difficulty": "Medium", "likes": 189, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "3170", "paidOnly": false, "title": "Lexicographically Minimum String After Removing Stars", "titleSlug": "lexicographically-minimum-string-after-removing-stars", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25551, "totalSubmissionRaw": 71270}, "3171": {"acRate": 31.06971626188792, "difficulty": "Hard", "likes": 161, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "3171", "paidOnly": false, "title": "Find Subarray With Bitwise OR Closest to K", "titleSlug": "find-subarray-with-bitwise-or-closest-to-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11859, "totalSubmissionRaw": 38169}, "3172": {"acRate": 73.69207772795217, "difficulty": "Easy", "likes": 3, "dislikes": 0, "categoryTitle": "Database", "frontendQuestionId": "3172", "paidOnly": true, "title": "Second Day Verification", "titleSlug": "second-day-verification", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 986, "totalSubmissionRaw": 1338}, "3173": {"acRate": 95.85389930898322, "difficulty": "Easy", "likes": 9, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "3173", "paidOnly": true, "title": "Bitwise OR of Adjacent Elements", "titleSlug": "bitwise-or-of-adjacent-elements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1942, "totalSubmissionRaw": 2026}, "3174": {"acRate": 72.46250649072971, "difficulty": "Easy", "likes": 75, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "3174", "paidOnly": false, "title": "Clear Digits", "titleSlug": "clear-digits", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 47447, "totalSubmissionRaw": 65478}, "3175": {"acRate": 39.44479053106993, "difficulty": "Medium", "likes": 113, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "3175", "paidOnly": false, "title": "Find The First Player to win K Games in a Row", "titleSlug": "find-the-first-player-to-win-k-games-in-a-row", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30393, "totalSubmissionRaw": 77052}, "3176": {"acRate": 30.33488959876435, "difficulty": "Medium", "likes": 123, "dislikes": 68, "categoryTitle": "Algorithms", "frontendQuestionId": "3176", "paidOnly": false, "title": "Find the Maximum Length of a Good Subsequence I", "titleSlug": "find-the-maximum-length-of-a-good-subsequence-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17283, "totalSubmissionRaw": 56975}, "3177": {"acRate": 24.028760728805903, "difficulty": "Hard", "likes": 96, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "3177", "paidOnly": false, "title": "Find the Maximum Length of a Good Subsequence II", "titleSlug": "find-the-maximum-length-of-a-good-subsequence-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6383, "totalSubmissionRaw": 26564}, "3178": {"acRate": 61.823369677588325, "difficulty": "Easy", "likes": 128, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "3178", "paidOnly": false, "title": "Find the Child Who Has the Ball After K Seconds", "titleSlug": "find-the-child-who-has-the-ball-after-k-seconds", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 44851, "totalSubmissionRaw": 72547}, "3179": {"acRate": 54.60828129162104, "difficulty": "Medium", "likes": 94, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "3179", "paidOnly": false, "title": "Find the N-th Value After K Seconds", "titleSlug": "find-the-n-th-value-after-k-seconds", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 36901, "totalSubmissionRaw": 67574}, "3180": {"acRate": 29.30576698410451, "difficulty": "Medium", "likes": 160, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "3180", "paidOnly": false, "title": "Maximum Total Reward Using Operations I", "titleSlug": "maximum-total-reward-using-operations-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24834, "totalSubmissionRaw": 84741}, "3181": {"acRate": 20.74892572130141, "difficulty": "Hard", "likes": 108, "dislikes": 32, "categoryTitle": "Algorithms", "frontendQuestionId": "3181", "paidOnly": false, "title": "Maximum Total Reward Using Operations II", "titleSlug": "maximum-total-reward-using-operations-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6422, "totalSubmissionRaw": 30951}, "3182": {"acRate": 55.49215406562055, "difficulty": "Medium", "likes": 6, "dislikes": 2, "categoryTitle": "Database", "frontendQuestionId": "3182", "paidOnly": true, "title": "Find Top Scoring Students", "titleSlug": "find-top-scoring-students", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 778, "totalSubmissionRaw": 1402}, "3183": {"acRate": 58.3533173461231, "difficulty": "Medium", "likes": 11, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "3183", "paidOnly": true, "title": "The Number of Ways to Make the Sum", "titleSlug": "the-number-of-ways-to-make-the-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 730, "totalSubmissionRaw": 1251}, "3184": {"acRate": 79.13311157796453, "difficulty": "Easy", "likes": 99, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "3184", "paidOnly": false, "title": "Count Pairs That Form a Complete Day I", "titleSlug": "count-pairs-that-form-a-complete-day-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 54241, "totalSubmissionRaw": 68544}, "3185": {"acRate": 42.91693989071038, "difficulty": "Medium", "likes": 145, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "3185", "paidOnly": false, "title": "Count Pairs That Form a Complete Day II", "titleSlug": "count-pairs-that-form-a-complete-day-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 39269, "totalSubmissionRaw": 91500}, "3186": {"acRate": 26.032552128012444, "difficulty": "Medium", "likes": 222, "dislikes": 28, "categoryTitle": "Algorithms", "frontendQuestionId": "3186", "paidOnly": false, "title": "Maximum Total Damage With Spell Casting", "titleSlug": "maximum-total-damage-with-spell-casting", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22760, "totalSubmissionRaw": 87429}, "3187": {"acRate": 26.82761385009096, "difficulty": "Hard", "likes": 109, "dislikes": 10, "categoryTitle": "Algorithms", "frontendQuestionId": "3187", "paidOnly": false, "title": "Peaks in Array", "titleSlug": "peaks-in-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8701, "totalSubmissionRaw": 32433}, "3188": {"acRate": 48.8558352402746, "difficulty": "Hard", "likes": 4, "dislikes": 3, "categoryTitle": "Database", "frontendQuestionId": "3188", "paidOnly": true, "title": "Find Top Scoring Students II", "titleSlug": "find-top-scoring-students-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 427, "totalSubmissionRaw": 874}, "3189": {"acRate": 76.62674004532211, "difficulty": "Medium", "likes": 35, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "3189", "paidOnly": true, "title": "Minimum Moves to Get a Peaceful Board", "titleSlug": "minimum-moves-to-get-a-peaceful-board", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting Sort", "id": "VG9waWNUYWdOb2RlOjYxMDcy", "slug": "counting-sort"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 2357, "totalSubmissionRaw": 3077}, "3190": {"acRate": 89.7798079175451, "difficulty": "Easy", "likes": 117, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "3190", "paidOnly": false, "title": "Find Minimum Operations to Make All Elements Divisible by Three", "titleSlug": "find-minimum-operations-to-make-all-elements-divisible-by-three", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 76647, "totalSubmissionRaw": 85373}, "3191": {"acRate": 70.80525774222458, "difficulty": "Medium", "likes": 138, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "3191", "paidOnly": false, "title": "Minimum Operations to Make Binary Array Elements Equal to One I", "titleSlug": "minimum-operations-to-make-binary-array-elements-equal-to-one-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 42663, "totalSubmissionRaw": 60254}, "3192": {"acRate": 65.09159943046986, "difficulty": "Medium", "likes": 114, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "3192", "paidOnly": false, "title": "Minimum Operations to Make Binary Array Elements Equal to One II", "titleSlug": "minimum-operations-to-make-binary-array-elements-equal-to-one-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34287, "totalSubmissionRaw": 52675}, "3193": {"acRate": 33.357906376704754, "difficulty": "Hard", "likes": 88, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "3193", "paidOnly": false, "title": "Count the Number of Inversions", "titleSlug": "count-the-number-of-inversions", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6335, "totalSubmissionRaw": 18991}, "3194": {"acRate": 85.12254007467504, "difficulty": "Easy", "likes": 96, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "3194", "paidOnly": false, "title": "Minimum Average of Smallest and Largest Elements", "titleSlug": "minimum-average-of-smallest-and-largest-elements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 60643, "totalSubmissionRaw": 71242}, "3195": {"acRate": 73.96490963571604, "difficulty": "Medium", "likes": 99, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "3195", "paidOnly": false, "title": "Find the Minimum Area to Cover All Ones I", "titleSlug": "find-the-minimum-area-to-cover-all-ones-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 39248, "totalSubmissionRaw": 53063}, "3196": {"acRate": 28.392728459352522, "difficulty": "Medium", "likes": 156, "dislikes": 24, "categoryTitle": "Algorithms", "frontendQuestionId": "3196", "paidOnly": false, "title": "Maximize Total Cost of Alternating Subarrays", "titleSlug": "maximize-total-cost-of-alternating-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20882, "totalSubmissionRaw": 73547}, "3197": {"acRate": 36.96654148173438, "difficulty": "Hard", "likes": 64, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "3197", "paidOnly": false, "title": "Find the Minimum Area to Cover All Ones II", "titleSlug": "find-the-minimum-area-to-cover-all-ones-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4331, "totalSubmissionRaw": 11716}, "3198": {"acRate": 81.56028368794325, "difficulty": "Easy", "likes": 4, "dislikes": 1, "categoryTitle": "Database", "frontendQuestionId": "3198", "paidOnly": true, "title": "Find Cities in Each State", "titleSlug": "find-cities-in-each-state", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 805, "totalSubmissionRaw": 987}, "3199": {"acRate": 83.96739130434783, "difficulty": "Easy", "likes": 7, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "3199", "paidOnly": true, "title": "Count Triplets with Even XOR Set Bits I", "titleSlug": "count-triplets-with-even-xor-set-bits-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 618, "totalSubmissionRaw": 736}, "3200": {"acRate": 42.33635300993571, "difficulty": "Easy", "likes": 122, "dislikes": 18, "categoryTitle": "Algorithms", "frontendQuestionId": "3200", "paidOnly": false, "title": "Maximum Height of a Triangle", "titleSlug": "maximum-height-of-a-triangle", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34769, "totalSubmissionRaw": 82127}, "3201": {"acRate": 37.467353069943684, "difficulty": "Medium", "likes": 121, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "3201", "paidOnly": false, "title": "Find the Maximum Length of Valid Subsequence I", "titleSlug": "find-the-maximum-length-of-valid-subsequence-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24817, "totalSubmissionRaw": 66237}, "3202": {"acRate": 38.99794760352529, "difficulty": "Medium", "likes": 174, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "3202", "paidOnly": false, "title": "Find the Maximum Length of Valid Subsequence II", "titleSlug": "find-the-maximum-length-of-valid-subsequence-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16151, "totalSubmissionRaw": 41415}, "3203": {"acRate": 35.64276963372904, "difficulty": "Hard", "likes": 124, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "3203", "paidOnly": false, "title": "Find Minimum Diameter After Merging Two Trees", "titleSlug": "find-minimum-diameter-after-merging-two-trees", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8437, "totalSubmissionRaw": 23671}, "3204": {"acRate": 95.04310344827587, "difficulty": "Medium", "likes": 4, "dislikes": 2, "categoryTitle": "Database", "frontendQuestionId": "3204", "paidOnly": true, "title": "Bitwise User Permissions Analysis", "titleSlug": "bitwise-user-permissions-analysis", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 441, "totalSubmissionRaw": 464}, "3205": {"acRate": 79.90697674418604, "difficulty": "Medium", "likes": 16, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "3205", "paidOnly": true, "title": "Maximum Array Hopping Score I", "titleSlug": "maximum-array-hopping-score-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 859, "totalSubmissionRaw": 1075}, "3206": {"acRate": 66.81388768284101, "difficulty": "Easy", "likes": 80, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "3206", "paidOnly": false, "title": "Alternating Groups I", "titleSlug": "alternating-groups-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 44627, "totalSubmissionRaw": 66793}, "3207": {"acRate": 31.65639013452915, "difficulty": "Medium", "likes": 91, "dislikes": 36, "categoryTitle": "Algorithms", "frontendQuestionId": "3207", "paidOnly": false, "title": "Maximum Points After Enemy Battles", "titleSlug": "maximum-points-after-enemy-battles", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24849, "totalSubmissionRaw": 78496}, "3208": {"acRate": 40.241322432587495, "difficulty": "Medium", "likes": 136, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "3208", "paidOnly": false, "title": "Alternating Groups II", "titleSlug": "alternating-groups-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22445, "totalSubmissionRaw": 55776}, "3209": {"acRate": 34.097642663918585, "difficulty": "Hard", "likes": 134, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "3209", "paidOnly": false, "title": "Number of Subarrays With AND Value of K", "titleSlug": "number-of-subarrays-with-and-value-of-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10588, "totalSubmissionRaw": 31052}, "3210": {"acRate": 69.34800203020617, "difficulty": "Easy", "likes": 77, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "3210", "paidOnly": false, "title": "Find the Encrypted String", "titleSlug": "find-the-encrypted-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 50554, "totalSubmissionRaw": 72899}, "3211": {"acRate": 86.24555236421314, "difficulty": "Medium", "likes": 129, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "3211", "paidOnly": false, "title": "Generate Binary Strings Without Adjacent Zeros", "titleSlug": "generate-binary-strings-without-adjacent-zeros", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 40237, "totalSubmissionRaw": 46654}, "3212": {"acRate": 51.72445784529746, "difficulty": "Medium", "likes": 128, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "3212", "paidOnly": false, "title": "Count Submatrices With Equal Frequency of X and Y", "titleSlug": "count-submatrices-with-equal-frequency-of-x-and-y", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22301, "totalSubmissionRaw": 43115}, "3213": {"acRate": 20.4878494427188, "difficulty": "Hard", "likes": 135, "dislikes": 28, "categoryTitle": "Algorithms", "frontendQuestionId": "3213", "paidOnly": false, "title": "Construct String with Minimum Cost", "titleSlug": "construct-string-with-minimum-cost", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Suffix Array", "id": "VG9waWNUYWdOb2RlOjU2Njk4", "slug": "suffix-array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11213, "totalSubmissionRaw": 54730}, "3214": {"acRate": 52.78121137206428, "difficulty": "Hard", "likes": 1, "dislikes": 1, "categoryTitle": "Database", "frontendQuestionId": "3214", "paidOnly": true, "title": "Year on Year Growth Rate", "titleSlug": "year-on-year-growth-rate", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 427, "totalSubmissionRaw": 809}, "3215": {"acRate": 73.55371900826447, "difficulty": "Medium", "likes": 12, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "3215", "paidOnly": true, "title": "Count Triplets with Even XOR Set Bits II", "titleSlug": "count-triplets-with-even-xor-set-bits-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 356, "totalSubmissionRaw": 484}, "3216": {"acRate": 53.367209348781465, "difficulty": "Easy", "likes": 71, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "3216", "paidOnly": false, "title": "Lexicographically Smallest String After a Swap", "titleSlug": "lexicographically-smallest-string-after-a-swap", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 42745, "totalSubmissionRaw": 80096}, "3217": {"acRate": 61.31246567819879, "difficulty": "Medium", "likes": 111, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "3217", "paidOnly": false, "title": "Delete Nodes From Linked List Present in Array", "titleSlug": "delete-nodes-from-linked-list-present-in-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 40193, "totalSubmissionRaw": 65555}, "3218": {"acRate": 57.71872824321188, "difficulty": "Medium", "likes": 145, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "3218", "paidOnly": false, "title": "Minimum Cost for Cutting Cake I", "titleSlug": "minimum-cost-for-cutting-cake-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24871, "totalSubmissionRaw": 43090}, "3219": {"acRate": 55.932872655478775, "difficulty": "Hard", "likes": 96, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "3219", "paidOnly": false, "title": "Minimum Cost for Cutting Cake II", "titleSlug": "minimum-cost-for-cutting-cake-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19831, "totalSubmissionRaw": 35455}, "3220": {"acRate": 72.148114075437, "difficulty": "Medium", "likes": 19, "dislikes": 2, "categoryTitle": "Database", "frontendQuestionId": "3220", "paidOnly": false, "title": "Odd and Even Transactions", "titleSlug": "odd-and-even-transactions", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3128, "totalSubmissionRaw": 4339}, "3221": {"acRate": 68.72586872586872, "difficulty": "Medium", "likes": 12, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "3221", "paidOnly": true, "title": "Maximum Array Hopping Score II", "titleSlug": "maximum-array-hopping-score-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 356, "totalSubmissionRaw": 518}, "3222": {"acRate": 50.88726141019602, "difficulty": "Easy", "likes": 77, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "3222", "paidOnly": false, "title": "Find the Winning Player in Coin Game", "titleSlug": "find-the-winning-player-in-coin-game", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 35643, "totalSubmissionRaw": 70045}, "3223": {"acRate": 54.634781579258906, "difficulty": "Medium", "likes": 84, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "3223", "paidOnly": false, "title": "Minimum Length of String After Operations", "titleSlug": "minimum-length-of-string-after-operations", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27688, "totalSubmissionRaw": 50680}, "3224": {"acRate": 22.68705666997178, "difficulty": "Medium", "likes": 186, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "3224", "paidOnly": false, "title": "Minimum Array Changes to Make Differences Equal", "titleSlug": "minimum-array-changes-to-make-differences-equal", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11898, "totalSubmissionRaw": 52444}, "3225": {"acRate": 26.13957240822912, "difficulty": "Hard", "likes": 50, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "3225", "paidOnly": false, "title": "Maximum Score From Grid Operations", "titleSlug": "maximum-score-from-grid-operations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1296, "totalSubmissionRaw": 4958}, "3226": {"acRate": 64.27521557355631, "difficulty": "Easy", "likes": 78, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "3226", "paidOnly": false, "title": "Number of Bit Changes to Make Two Integers Equal", "titleSlug": "number-of-bit-changes-to-make-two-integers-equal", "topicTags": [{"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 39357, "totalSubmissionRaw": 61232}, "3227": {"acRate": 62.18357522249658, "difficulty": "Medium", "likes": 116, "dislikes": 24, "categoryTitle": "Algorithms", "frontendQuestionId": "3227", "paidOnly": false, "title": "Vowels Game in a String", "titleSlug": "vowels-game-in-a-string", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Brainteaser", "id": "VG9waWNUYWdOb2RlOjMy", "slug": "brainteaser"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 35005, "totalSubmissionRaw": 56293}, "3228": {"acRate": 53.64175268416035, "difficulty": "Medium", "likes": 141, "dislikes": 10, "categoryTitle": "Algorithms", "frontendQuestionId": "3228", "paidOnly": false, "title": "Maximum Number of Operations to Move Ones to the End", "titleSlug": "maximum-number-of-operations-to-move-ones-to-the-end", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25880, "totalSubmissionRaw": 48246}, "3229": {"acRate": 37.7311471695976, "difficulty": "Hard", "likes": 177, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "3229", "paidOnly": false, "title": "Minimum Operations to Make Array Equal to Target", "titleSlug": "minimum-operations-to-make-array-equal-to-target", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13324, "totalSubmissionRaw": 35313}, "3230": {"acRate": 45.30443756449948, "difficulty": "Medium", "likes": 3, "dislikes": 0, "categoryTitle": "Database", "frontendQuestionId": "3230", "paidOnly": true, "title": "Customer Purchasing Behavior Analysis", "titleSlug": "customer-purchasing-behavior-analysis", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 439, "totalSubmissionRaw": 969}, "3231": {"acRate": 56.83453237410072, "difficulty": "Hard", "likes": 6, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "3231", "paidOnly": true, "title": "Minimum Number of Increasing Subsequence to Be Removed", "titleSlug": "minimum-number-of-increasing-subsequence-to-be-removed", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 237, "totalSubmissionRaw": 417}, "3232": {"acRate": 83.14459665144597, "difficulty": "Easy", "likes": 82, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "3232", "paidOnly": false, "title": "Find if Digit Game Can Be Won", "titleSlug": "find-if-digit-game-can-be-won", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 54625, "totalSubmissionRaw": 65699}, "3233": {"acRate": 26.543172888436157, "difficulty": "Medium", "likes": 153, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "3233", "paidOnly": false, "title": "Find the Count of Numbers Which Are Not Special", "titleSlug": "find-the-count-of-numbers-which-are-not-special", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 31008, "totalSubmissionRaw": 116821}, "3234": {"acRate": 14.761904761904763, "difficulty": "Medium", "likes": 201, "dislikes": 37, "categoryTitle": "Algorithms", "frontendQuestionId": "3234", "paidOnly": false, "title": "Count the Number of Substrings With Dominant Ones", "titleSlug": "count-the-number-of-substrings-with-dominant-ones", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6231, "totalSubmissionRaw": 42210}, "3235": {"acRate": 29.124595627879618, "difficulty": "Hard", "likes": 88, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "3235", "paidOnly": false, "title": "Check if the Rectangle Corner Is Reachable", "titleSlug": "check-if-the-rectangle-corner-is-reachable", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5942, "totalSubmissionRaw": 20402}, "3236": {"acRate": 80.89171974522293, "difficulty": "Hard", "likes": 3, "dislikes": 0, "categoryTitle": "Database", "frontendQuestionId": "3236", "paidOnly": true, "title": "CEO Subordinate Hierarchy", "titleSlug": "ceo-subordinate-hierarchy", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 254, "totalSubmissionRaw": 314}, "3237": {"acRate": 81.42589118198875, "difficulty": "Medium", "likes": 12, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "3237", "paidOnly": true, "title": "Alt and Tab Simulation", "titleSlug": "alt-and-tab-simulation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 434, "totalSubmissionRaw": 533}, "3238": {"acRate": 60.95492249116127, "difficulty": "Easy", "likes": 52, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "3238", "paidOnly": false, "title": "Find the Number of Winning Players", "titleSlug": "find-the-number-of-winning-players", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 35861, "totalSubmissionRaw": 58832}, "3239": {"acRate": 78.03386520722526, "difficulty": "Medium", "likes": 48, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "3239", "paidOnly": false, "title": "Minimum Number of Flips to Make Binary Grid Palindromic I", "titleSlug": "minimum-number-of-flips-to-make-binary-grid-palindromic-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30370, "totalSubmissionRaw": 38919}, "3240": {"acRate": 22.41265989180444, "difficulty": "Medium", "likes": 102, "dislikes": 44, "categoryTitle": "Algorithms", "frontendQuestionId": "3240", "paidOnly": false, "title": "Minimum Number of Flips to Make Binary Grid Palindromic II", "titleSlug": "minimum-number-of-flips-to-make-binary-grid-palindromic-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8866, "totalSubmissionRaw": 39558}, "3241": {"acRate": 21.307692307692307, "difficulty": "Hard", "likes": 66, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "3241", "paidOnly": false, "title": "Time Taken to Mark All Nodes", "titleSlug": "time-taken-to-mark-all-nodes", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3047, "totalSubmissionRaw": 14300}, "3242": {"acRate": 83.50005182958434, "difficulty": "Easy", "likes": 65, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "3242", "paidOnly": false, "title": "Design Neighbor Sum Service", "titleSlug": "design-neighbor-sum-service", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 32221, "totalSubmissionRaw": 38588}, "3243": {"acRate": 47.10976401818576, "difficulty": "Medium", "likes": 81, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "3243", "paidOnly": false, "title": "Shortest Distance After Road Addition Queries I", "titleSlug": "shortest-distance-after-road-addition-queries-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23936, "totalSubmissionRaw": 50809}, "3244": {"acRate": 22.346291383089167, "difficulty": "Hard", "likes": 127, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "3244", "paidOnly": false, "title": "Shortest Distance After Road Addition Queries II", "titleSlug": "shortest-distance-after-road-addition-queries-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9683, "totalSubmissionRaw": 43342}, "3245": {"acRate": 13.209518282066163, "difficulty": "Hard", "likes": 42, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "3245", "paidOnly": false, "title": "Alternating Groups III", "titleSlug": "alternating-groups-iii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1138, "totalSubmissionRaw": 8611}, "3246": {"acRate": 89.66861598440545, "difficulty": "Easy", "likes": 4, "dislikes": 0, "categoryTitle": "Database", "frontendQuestionId": "3246", "paidOnly": true, "title": "Premier League Table Ranking", "titleSlug": "premier-league-table-ranking", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 460, "totalSubmissionRaw": 513}, "3247": {"acRate": 55.673758865248224, "difficulty": "Medium", "likes": 5, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "3247", "paidOnly": true, "title": "Number of Subsequences with Odd Sum", "titleSlug": "number-of-subsequences-with-odd-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 314, "totalSubmissionRaw": 564}, "3248": {"acRate": 81.36166007905138, "difficulty": "Easy", "likes": 74, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "3248", "paidOnly": false, "title": "Snake in Matrix", "titleSlug": "snake-in-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 41165, "totalSubmissionRaw": 50596}, "3249": {"acRate": 55.48725891150207, "difficulty": "Medium", "likes": 118, "dislikes": 30, "categoryTitle": "Algorithms", "frontendQuestionId": "3249", "paidOnly": false, "title": "Count the Number of Good Nodes", "titleSlug": "count-the-number-of-good-nodes", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22929, "totalSubmissionRaw": 41323}, "3250": {"acRate": 45.02998001332445, "difficulty": "Hard", "likes": 99, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "3250", "paidOnly": false, "title": "Find the Count of Monotonic Pairs I", "titleSlug": "find-the-count-of-monotonic-pairs-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13518, "totalSubmissionRaw": 30017}, "3251": {"acRate": 21.033765544098774, "difficulty": "Hard", "likes": 68, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "3251", "paidOnly": false, "title": "Find the Count of Monotonic Pairs II", "titleSlug": "find-the-count-of-monotonic-pairs-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4753, "totalSubmissionRaw": 22597}, "3252": {"acRate": 77.91666666666667, "difficulty": "Medium", "likes": 2, "dislikes": 4, "categoryTitle": "Database", "frontendQuestionId": "3252", "paidOnly": true, "title": "Premier League Table Ranking II", "titleSlug": "premier-league-table-ranking-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 187, "totalSubmissionRaw": 240}, "3253": {"acRate": 55.98802395209581, "difficulty": "Medium", "likes": 4, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "3253", "paidOnly": true, "title": "Construct String with Minimum Cost (Easy)", "titleSlug": "construct-string-with-minimum-cost-easy", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 187, "totalSubmissionRaw": 334}}
\ No newline at end of file
+{"1": {"acRate": 53.43112287323986, "difficulty": "Easy", "likes": 57597, "dislikes": 2024, "categoryTitle": "Algorithms", "frontendQuestionId": "1", "paidOnly": false, "title": "Two Sum", "titleSlug": "two-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 14168083, "totalSubmissionRaw": 26516596}, "2": {"acRate": 43.77194649698282, "difficulty": "Medium", "likes": 31432, "dislikes": 6287, "categoryTitle": "Algorithms", "frontendQuestionId": "2", "paidOnly": false, "title": "Add Two Numbers", "titleSlug": "add-two-numbers", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 4859289, "totalSubmissionRaw": 11101383}, "3": {"acRate": 35.25597977997743, "difficulty": "Medium", "likes": 39958, "dislikes": 1914, "categoryTitle": "Algorithms", "frontendQuestionId": "3", "paidOnly": false, "title": "Longest Substring Without Repeating Characters", "titleSlug": "longest-substring-without-repeating-characters", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 6159257, "totalSubmissionRaw": 17470145}, "4": {"acRate": 41.0949383327325, "difficulty": "Hard", "likes": 28521, "dislikes": 3184, "categoryTitle": "Algorithms", "frontendQuestionId": "4", "paidOnly": false, "title": "Median of Two Sorted Arrays", "titleSlug": "median-of-two-sorted-arrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 2783727, "totalSubmissionRaw": 6773890}, "5": {"acRate": 34.26940072194834, "difficulty": "Medium", "likes": 29476, "dislikes": 1798, "categoryTitle": "Algorithms", "frontendQuestionId": "5", "paidOnly": false, "title": "Longest Palindromic Substring", "titleSlug": "longest-palindromic-substring", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 3239574, "totalSubmissionRaw": 9453271}, "6": {"acRate": 48.95660232756367, "difficulty": "Medium", "likes": 7750, "dislikes": 14759, "categoryTitle": "Algorithms", "frontendQuestionId": "6", "paidOnly": false, "title": "Zigzag Conversion", "titleSlug": "zigzag-conversion", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 1434722, "totalSubmissionRaw": 2930604}, "7": {"acRate": 28.997892497371975, "difficulty": "Medium", "likes": 13181, "dislikes": 13566, "categoryTitle": "Algorithms", "frontendQuestionId": "7", "paidOnly": false, "title": "Reverse Integer", "titleSlug": "reverse-integer", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 3422767, "totalSubmissionRaw": 11803522}, "8": {"acRate": 17.744533590880845, "difficulty": "Medium", "likes": 4644, "dislikes": 13847, "categoryTitle": "Algorithms", "frontendQuestionId": "8", "paidOnly": false, "title": "String to Integer (atoi)", "titleSlug": "string-to-integer-atoi", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1639579, "totalSubmissionRaw": 9239937}, "9": {"acRate": 57.230013338495844, "difficulty": "Easy", "likes": 12810, "dislikes": 2747, "categoryTitle": "Algorithms", "frontendQuestionId": "9", "paidOnly": false, "title": "Palindrome Number", "titleSlug": "palindrome-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 5049147, "totalSubmissionRaw": 8822560}, "10": {"acRate": 28.315638411623432, "difficulty": "Hard", "likes": 12204, "dislikes": 2177, "categoryTitle": "Algorithms", "frontendQuestionId": "10", "paidOnly": false, "title": "Regular Expression Matching", "titleSlug": "regular-expression-matching", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1003118, "totalSubmissionRaw": 3542630}, "11": {"acRate": 55.92145804576244, "difficulty": "Medium", "likes": 29335, "dislikes": 1801, "categoryTitle": "Algorithms", "frontendQuestionId": "11", "paidOnly": false, "title": "Container With Most Water", "titleSlug": "container-with-most-water", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 3214278, "totalSubmissionRaw": 5747848}, "12": {"acRate": 65.8917740114579, "difficulty": "Medium", "likes": 7229, "dislikes": 5566, "categoryTitle": "Algorithms", "frontendQuestionId": "12", "paidOnly": false, "title": "Integer to Roman", "titleSlug": "integer-to-roman", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 1409514, "totalSubmissionRaw": 2139135}, "13": {"acRate": 62.29348072222079, "difficulty": "Easy", "likes": 14417, "dislikes": 956, "categoryTitle": "Algorithms", "frontendQuestionId": "13", "paidOnly": false, "title": "Roman to Integer", "titleSlug": "roman-to-integer", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 3922836, "totalSubmissionRaw": 6297349}, "14": {"acRate": 43.53098125364798, "difficulty": "Easy", "likes": 17750, "dislikes": 4572, "categoryTitle": "Algorithms", "frontendQuestionId": "14", "paidOnly": false, "title": "Longest Common Prefix", "titleSlug": "longest-common-prefix", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 3611162, "totalSubmissionRaw": 8295635}, "15": {"acRate": 35.12591055830343, "difficulty": "Medium", "likes": 31096, "dislikes": 2895, "categoryTitle": "Algorithms", "frontendQuestionId": "15", "paidOnly": false, "title": "3Sum", "titleSlug": "3sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 3804750, "totalSubmissionRaw": 10831776}, "16": {"acRate": 45.98855947885264, "difficulty": "Medium", "likes": 10500, "dislikes": 571, "categoryTitle": "Algorithms", "frontendQuestionId": "16", "paidOnly": false, "title": "3Sum Closest", "titleSlug": "3sum-closest", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 1279896, "totalSubmissionRaw": 2783075}, "17": {"acRate": 61.3975116830628, "difficulty": "Medium", "likes": 18716, "dislikes": 1009, "categoryTitle": "Algorithms", "frontendQuestionId": "17", "paidOnly": false, "title": "Letter Combinations of a Phone Number", "titleSlug": "letter-combinations-of-a-phone-number", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 2152282, "totalSubmissionRaw": 3505489}, "18": {"acRate": 36.5805173215927, "difficulty": "Medium", "likes": 11382, "dislikes": 1403, "categoryTitle": "Algorithms", "frontendQuestionId": "18", "paidOnly": false, "title": "4Sum", "titleSlug": "4sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1031589, "totalSubmissionRaw": 2820047}, "19": {"acRate": 46.36272080319215, "difficulty": "Medium", "likes": 18977, "dislikes": 815, "categoryTitle": "Algorithms", "frontendQuestionId": "19", "paidOnly": false, "title": "Remove Nth Node From End of List", "titleSlug": "remove-nth-node-from-end-of-list", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 2906646, "totalSubmissionRaw": 6269371}, "20": {"acRate": 40.871382932460484, "difficulty": "Easy", "likes": 24214, "dislikes": 1787, "categoryTitle": "Algorithms", "frontendQuestionId": "20", "paidOnly": false, "title": "Valid Parentheses", "titleSlug": "valid-parentheses", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 4949243, "totalSubmissionRaw": 12109313}, "21": {"acRate": 65.01923399420492, "difficulty": "Easy", "likes": 21933, "dislikes": 2140, "categoryTitle": "Algorithms", "frontendQuestionId": "21", "paidOnly": false, "title": "Merge Two Sorted Lists", "titleSlug": "merge-two-sorted-lists", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 4431546, "totalSubmissionRaw": 6815757}, "22": {"acRate": 75.27833090651718, "difficulty": "Medium", "likes": 21227, "dislikes": 963, "categoryTitle": "Algorithms", "frontendQuestionId": "22", "paidOnly": false, "title": "Generate Parentheses", "titleSlug": "generate-parentheses", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 1949549, "totalSubmissionRaw": 2589790}, "23": {"acRate": 53.79307912924914, "difficulty": "Hard", "likes": 19550, "dislikes": 721, "categoryTitle": "Algorithms", "frontendQuestionId": "23", "paidOnly": false, "title": "Merge k Sorted Lists", "titleSlug": "merge-k-sorted-lists", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Merge Sort", "id": "VG9waWNUYWdOb2RlOjYxMDUx", "slug": "merge-sort"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 2105190, "totalSubmissionRaw": 3913496}, "24": {"acRate": 65.03902165429581, "difficulty": "Medium", "likes": 11993, "dislikes": 450, "categoryTitle": "Algorithms", "frontendQuestionId": "24", "paidOnly": false, "title": "Swap Nodes in Pairs", "titleSlug": "swap-nodes-in-pairs", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1427477, "totalSubmissionRaw": 2194801}, "25": {"acRate": 59.99691143910777, "difficulty": "Hard", "likes": 13800, "dislikes": 708, "categoryTitle": "Algorithms", "frontendQuestionId": "25", "paidOnly": false, "title": "Reverse Nodes in k-Group", "titleSlug": "reverse-nodes-in-k-group", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1002355, "totalSubmissionRaw": 1670679}, "26": {"acRate": 57.16117089915562, "difficulty": "Easy", "likes": 14867, "dislikes": 18813, "categoryTitle": "Algorithms", "frontendQuestionId": "26", "paidOnly": false, "title": "Remove Duplicates from Sorted Array", "titleSlug": "remove-duplicates-from-sorted-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 4803062, "totalSubmissionRaw": 8402681}, "27": {"acRate": 57.84389107069167, "difficulty": "Easy", "likes": 2709, "dislikes": 3801, "categoryTitle": "Algorithms", "frontendQuestionId": "27", "paidOnly": false, "title": "Remove Element", "titleSlug": "remove-element", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 3228092, "totalSubmissionRaw": 5580701}, "28": {"acRate": 43.15940502498544, "difficulty": "Easy", "likes": 5947, "dislikes": 427, "categoryTitle": "Algorithms", "frontendQuestionId": "28", "paidOnly": false, "title": "Find the Index of the First Occurrence in a String", "titleSlug": "find-the-index-of-the-first-occurrence-in-a-string", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 2673293, "totalSubmissionRaw": 6194003}, "29": {"acRate": 17.692315446728294, "difficulty": "Medium", "likes": 5203, "dislikes": 14845, "categoryTitle": "Algorithms", "frontendQuestionId": "29", "paidOnly": false, "title": "Divide Two Integers", "titleSlug": "divide-two-integers", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 789777, "totalSubmissionRaw": 4463955}, "30": {"acRate": 32.58203725567898, "difficulty": "Hard", "likes": 1893, "dislikes": 272, "categoryTitle": "Algorithms", "frontendQuestionId": "30", "paidOnly": false, "title": "Substring with Concatenation of All Words", "titleSlug": "substring-with-concatenation-of-all-words", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 478520, "totalSubmissionRaw": 1468659}, "31": {"acRate": 40.80841146087017, "difficulty": "Medium", "likes": 18532, "dislikes": 4715, "categoryTitle": "Algorithms", "frontendQuestionId": "31", "paidOnly": false, "title": "Next Permutation", "titleSlug": "next-permutation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 1457823, "totalSubmissionRaw": 3572361}, "32": {"acRate": 34.60915369318651, "difficulty": "Hard", "likes": 12393, "dislikes": 411, "categoryTitle": "Algorithms", "frontendQuestionId": "32", "paidOnly": false, "title": "Longest Valid Parentheses", "titleSlug": "longest-valid-parentheses", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 775696, "totalSubmissionRaw": 2241299}, "33": {"acRate": 41.324715016882685, "difficulty": "Medium", "likes": 26432, "dislikes": 1597, "categoryTitle": "Algorithms", "frontendQuestionId": "33", "paidOnly": false, "title": "Search in Rotated Sorted Array", "titleSlug": "search-in-rotated-sorted-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 2942194, "totalSubmissionRaw": 7119695}, "34": {"acRate": 44.96788290693763, "difficulty": "Medium", "likes": 20611, "dislikes": 525, "categoryTitle": "Algorithms", "frontendQuestionId": "34", "paidOnly": false, "title": "Find First and Last Position of Element in Sorted Array", "titleSlug": "find-first-and-last-position-of-element-in-sorted-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 2184331, "totalSubmissionRaw": 4857535}, "35": {"acRate": 46.83831891582077, "difficulty": "Easy", "likes": 16291, "dislikes": 754, "categoryTitle": "Algorithms", "frontendQuestionId": "35", "paidOnly": false, "title": "Search Insert Position", "titleSlug": "search-insert-position", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 3102085, "totalSubmissionRaw": 6622964}, "36": {"acRate": 60.353769669516545, "difficulty": "Medium", "likes": 10777, "dislikes": 1137, "categoryTitle": "Algorithms", "frontendQuestionId": "36", "paidOnly": false, "title": "Valid Sudoku", "titleSlug": "valid-sudoku", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1628692, "totalSubmissionRaw": 2698578}, "37": {"acRate": 62.4329116846901, "difficulty": "Hard", "likes": 9585, "dislikes": 264, "categoryTitle": "Algorithms", "frontendQuestionId": "37", "paidOnly": false, "title": "Sudoku Solver", "titleSlug": "sudoku-solver", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 632696, "totalSubmissionRaw": 1013402}, "38": {"acRate": 56.07557702531234, "difficulty": "Medium", "likes": 4041, "dislikes": 8366, "categoryTitle": "Algorithms", "frontendQuestionId": "38", "paidOnly": false, "title": "Count and Say", "titleSlug": "count-and-say", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 973574, "totalSubmissionRaw": 1736185}, "39": {"acRate": 72.43522869666023, "difficulty": "Medium", "likes": 18945, "dislikes": 426, "categoryTitle": "Algorithms", "frontendQuestionId": "39", "paidOnly": false, "title": "Combination Sum", "titleSlug": "combination-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 2085082, "totalSubmissionRaw": 2878548}, "40": {"acRate": 56.25579594170183, "difficulty": "Medium", "likes": 10994, "dislikes": 320, "categoryTitle": "Algorithms", "frontendQuestionId": "40", "paidOnly": false, "title": "Combination Sum II", "titleSlug": "combination-sum-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1148341, "totalSubmissionRaw": 2041290}, "41": {"acRate": 39.83571329978793, "difficulty": "Hard", "likes": 16895, "dislikes": 1864, "categoryTitle": "Algorithms", "frontendQuestionId": "41", "paidOnly": false, "title": "First Missing Positive", "titleSlug": "first-missing-positive", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1269851, "totalSubmissionRaw": 3187720}, "42": {"acRate": 62.81986120938514, "difficulty": "Hard", "likes": 32235, "dislikes": 525, "categoryTitle": "Algorithms", "frontendQuestionId": "42", "paidOnly": false, "title": "Trapping Rain Water", "titleSlug": "trapping-rain-water", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 2269234, "totalSubmissionRaw": 3612286}, "43": {"acRate": 40.82548267379972, "difficulty": "Medium", "likes": 7094, "dislikes": 3361, "categoryTitle": "Algorithms", "frontendQuestionId": "43", "paidOnly": false, "title": "Multiply Strings", "titleSlug": "multiply-strings", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 835161, "totalSubmissionRaw": 2045687}, "44": {"acRate": 28.441706711085953, "difficulty": "Hard", "likes": 8295, "dislikes": 354, "categoryTitle": "Algorithms", "frontendQuestionId": "44", "paidOnly": false, "title": "Wildcard Matching", "titleSlug": "wildcard-matching", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 607859, "totalSubmissionRaw": 2137210}, "45": {"acRate": 40.64249848681962, "difficulty": "Medium", "likes": 14667, "dislikes": 589, "categoryTitle": "Algorithms", "frontendQuestionId": "45", "paidOnly": false, "title": "Jump Game II", "titleSlug": "jump-game-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1357712, "totalSubmissionRaw": 3340629}, "46": {"acRate": 79.02806484834295, "difficulty": "Medium", "likes": 19157, "dislikes": 329, "categoryTitle": "Algorithms", "frontendQuestionId": "46", "paidOnly": false, "title": "Permutations", "titleSlug": "permutations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 2200790, "totalSubmissionRaw": 2784824}, "47": {"acRate": 59.83281446677742, "difficulty": "Medium", "likes": 8543, "dislikes": 146, "categoryTitle": "Algorithms", "frontendQuestionId": "47", "paidOnly": false, "title": "Permutations II", "titleSlug": "permutations-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 969213, "totalSubmissionRaw": 1619869}, "48": {"acRate": 75.51300217956316, "difficulty": "Medium", "likes": 17711, "dislikes": 822, "categoryTitle": "Algorithms", "frontendQuestionId": "48", "paidOnly": false, "title": "Rotate Image", "titleSlug": "rotate-image", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1857705, "totalSubmissionRaw": 2460116}, "49": {"acRate": 69.1816887118745, "difficulty": "Medium", "likes": 19360, "dislikes": 631, "categoryTitle": "Algorithms", "frontendQuestionId": "49", "paidOnly": false, "title": "Group Anagrams", "titleSlug": "group-anagrams", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 3080697, "totalSubmissionRaw": 4453062}, "50": {"acRate": 35.3441777994021, "difficulty": "Medium", "likes": 9850, "dislikes": 9575, "categoryTitle": "Algorithms", "frontendQuestionId": "50", "paidOnly": false, "title": "Pow(x, n)", "titleSlug": "powx-n", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1787007, "totalSubmissionRaw": 5056009}, "51": {"acRate": 69.58797805292409, "difficulty": "Hard", "likes": 12461, "dislikes": 291, "categoryTitle": "Algorithms", "frontendQuestionId": "51", "paidOnly": false, "title": "N-Queens", "titleSlug": "n-queens", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 784816, "totalSubmissionRaw": 1127803}, "52": {"acRate": 74.71517263914606, "difficulty": "Hard", "likes": 3875, "dislikes": 266, "categoryTitle": "Algorithms", "frontendQuestionId": "52", "paidOnly": false, "title": "N-Queens II", "titleSlug": "n-queens-ii", "topicTags": [{"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 411572, "totalSubmissionRaw": 550856}, "53": {"acRate": 51.050966032509514, "difficulty": "Medium", "likes": 34195, "dislikes": 1449, "categoryTitle": "Algorithms", "frontendQuestionId": "53", "paidOnly": false, "title": "Maximum Subarray", "titleSlug": "maximum-subarray", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 4140138, "totalSubmissionRaw": 8109836}, "54": {"acRate": 50.80787487878825, "difficulty": "Medium", "likes": 14943, "dislikes": 1326, "categoryTitle": "Algorithms", "frontendQuestionId": "54", "paidOnly": false, "title": "Spiral Matrix", "titleSlug": "spiral-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1539902, "totalSubmissionRaw": 3030833}, "55": {"acRate": 38.7030139644662, "difficulty": "Medium", "likes": 19497, "dislikes": 1256, "categoryTitle": "Algorithms", "frontendQuestionId": "55", "paidOnly": false, "title": "Jump Game", "titleSlug": "jump-game", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 2073350, "totalSubmissionRaw": 5357083}, "56": {"acRate": 47.80849235116394, "difficulty": "Medium", "likes": 22319, "dislikes": 785, "categoryTitle": "Algorithms", "frontendQuestionId": "56", "paidOnly": false, "title": "Merge Intervals", "titleSlug": "merge-intervals", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 2560888, "totalSubmissionRaw": 5356572}, "57": {"acRate": 42.01791080573936, "difficulty": "Medium", "likes": 10444, "dislikes": 821, "categoryTitle": "Algorithms", "frontendQuestionId": "57", "paidOnly": false, "title": "Insert Interval", "titleSlug": "insert-interval", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1191267, "totalSubmissionRaw": 2835151}, "58": {"acRate": 53.18583880529335, "difficulty": "Easy", "likes": 5271, "dislikes": 290, "categoryTitle": "Algorithms", "frontendQuestionId": "58", "paidOnly": false, "title": "Length of Last Word", "titleSlug": "length-of-last-word", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 2176886, "totalSubmissionRaw": 4092984}, "59": {"acRate": 71.81712486808449, "difficulty": "Medium", "likes": 6421, "dislikes": 265, "categoryTitle": "Algorithms", "frontendQuestionId": "59", "paidOnly": false, "title": "Spiral Matrix II", "titleSlug": "spiral-matrix-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 602253, "totalSubmissionRaw": 838579}, "60": {"acRate": 47.84526610014555, "difficulty": "Hard", "likes": 6701, "dislikes": 481, "categoryTitle": "Algorithms", "frontendQuestionId": "60", "paidOnly": false, "title": "Permutation Sequence", "titleSlug": "permutation-sequence", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 417149, "totalSubmissionRaw": 871871}, "61": {"acRate": 38.43992189425616, "difficulty": "Medium", "likes": 9766, "dislikes": 1453, "categoryTitle": "Algorithms", "frontendQuestionId": "61", "paidOnly": false, "title": "Rotate List", "titleSlug": "rotate-list", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1041783, "totalSubmissionRaw": 2710159}, "62": {"acRate": 64.67412787252343, "difficulty": "Medium", "likes": 16719, "dislikes": 449, "categoryTitle": "Algorithms", "frontendQuestionId": "62", "paidOnly": false, "title": "Unique Paths", "titleSlug": "unique-paths", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1953541, "totalSubmissionRaw": 3020593}, "63": {"acRate": 42.0457045175569, "difficulty": "Medium", "likes": 8795, "dislikes": 511, "categoryTitle": "Algorithms", "frontendQuestionId": "63", "paidOnly": false, "title": "Unique Paths II", "titleSlug": "unique-paths-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1001564, "totalSubmissionRaw": 2382084}, "64": {"acRate": 64.68186163698151, "difficulty": "Medium", "likes": 12510, "dislikes": 171, "categoryTitle": "Algorithms", "frontendQuestionId": "64", "paidOnly": false, "title": "Minimum Path Sum", "titleSlug": "minimum-path-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1256401, "totalSubmissionRaw": 1942435}, "65": {"acRate": 20.222199496296938, "difficulty": "Hard", "likes": 1265, "dislikes": 2010, "categoryTitle": "Algorithms", "frontendQuestionId": "65", "paidOnly": false, "title": "Valid Number", "titleSlug": "valid-number", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 381638, "totalSubmissionRaw": 1887223}, "66": {"acRate": 45.92787827779144, "difficulty": "Easy", "likes": 9436, "dislikes": 5410, "categoryTitle": "Algorithms", "frontendQuestionId": "66", "paidOnly": false, "title": "Plus One", "titleSlug": "plus-one", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 2405406, "totalSubmissionRaw": 5237359}, "67": {"acRate": 54.14269325142046, "difficulty": "Easy", "likes": 9462, "dislikes": 982, "categoryTitle": "Algorithms", "frontendQuestionId": "67", "paidOnly": false, "title": "Add Binary", "titleSlug": "add-binary", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1554086, "totalSubmissionRaw": 2870355}, "68": {"acRate": 44.66740561986999, "difficulty": "Hard", "likes": 3738, "dislikes": 4764, "categoryTitle": "Algorithms", "frontendQuestionId": "68", "paidOnly": false, "title": "Text Justification", "titleSlug": "text-justification", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 443674, "totalSubmissionRaw": 993291}, "69": {"acRate": 39.212180984192265, "difficulty": "Easy", "likes": 8245, "dislikes": 4516, "categoryTitle": "Algorithms", "frontendQuestionId": "69", "paidOnly": false, "title": "Sqrt(x)", "titleSlug": "sqrtx", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 2107236, "totalSubmissionRaw": 5373927}, "70": {"acRate": 53.059508708674926, "difficulty": "Easy", "likes": 22049, "dislikes": 850, "categoryTitle": "Algorithms", "frontendQuestionId": "70", "paidOnly": false, "title": "Climbing Stairs", "titleSlug": "climbing-stairs", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 3490649, "totalSubmissionRaw": 6578742}, "71": {"acRate": 43.72199933399508, "difficulty": "Medium", "likes": 5634, "dislikes": 1291, "categoryTitle": "Algorithms", "frontendQuestionId": "71", "paidOnly": false, "title": "Simplify Path", "titleSlug": "simplify-path", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 821908, "totalSubmissionRaw": 1879859}, "72": {"acRate": 57.137227377061514, "difficulty": "Medium", "likes": 14915, "dislikes": 235, "categoryTitle": "Algorithms", "frontendQuestionId": "72", "paidOnly": false, "title": "Edit Distance", "titleSlug": "edit-distance", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 933719, "totalSubmissionRaw": 1634169}, "73": {"acRate": 56.99871189351653, "difficulty": "Medium", "likes": 14625, "dislikes": 745, "categoryTitle": "Algorithms", "frontendQuestionId": "73", "paidOnly": false, "title": "Set Matrix Zeroes", "titleSlug": "set-matrix-zeroes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1555824, "totalSubmissionRaw": 2729580}, "74": {"acRate": 50.816812739884185, "difficulty": "Medium", "likes": 15863, "dislikes": 422, "categoryTitle": "Algorithms", "frontendQuestionId": "74", "paidOnly": false, "title": "Search a 2D Matrix", "titleSlug": "search-a-2d-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1926933, "totalSubmissionRaw": 3791918}, "75": {"acRate": 64.64240409604544, "difficulty": "Medium", "likes": 18663, "dislikes": 661, "categoryTitle": "Algorithms", "frontendQuestionId": "75", "paidOnly": false, "title": "Sort Colors", "titleSlug": "sort-colors", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 2279880, "totalSubmissionRaw": 3526908}, "76": {"acRate": 43.516767714356824, "difficulty": "Hard", "likes": 17967, "dislikes": 741, "categoryTitle": "Algorithms", "frontendQuestionId": "76", "paidOnly": false, "title": "Minimum Window Substring", "titleSlug": "minimum-window-substring", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1440687, "totalSubmissionRaw": 3310647}, "77": {"acRate": 71.05197522585425, "difficulty": "Medium", "likes": 8257, "dislikes": 229, "categoryTitle": "Algorithms", "frontendQuestionId": "77", "paidOnly": false, "title": "Combinations", "titleSlug": "combinations", "topicTags": [{"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 951482, "totalSubmissionRaw": 1339136}, "78": {"acRate": 78.98176463194525, "difficulty": "Medium", "likes": 17351, "dislikes": 284, "categoryTitle": "Algorithms", "frontendQuestionId": "78", "paidOnly": false, "title": "Subsets", "titleSlug": "subsets", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 2079899, "totalSubmissionRaw": 2633393}, "79": {"acRate": 43.410777775515065, "difficulty": "Medium", "likes": 15954, "dislikes": 676, "categoryTitle": "Algorithms", "frontendQuestionId": "79", "paidOnly": false, "title": "Word Search", "titleSlug": "word-search", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1769303, "totalSubmissionRaw": 4075726}, "80": {"acRate": 59.7242022032578, "difficulty": "Medium", "likes": 6988, "dislikes": 1348, "categoryTitle": "Algorithms", "frontendQuestionId": "80", "paidOnly": false, "title": "Remove Duplicates from Sorted Array II", "titleSlug": "remove-duplicates-from-sorted-array-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1100979, "totalSubmissionRaw": 1843441}, "81": {"acRate": 38.03775408651619, "difficulty": "Medium", "likes": 8540, "dislikes": 1049, "categoryTitle": "Algorithms", "frontendQuestionId": "81", "paidOnly": false, "title": "Search in Rotated Sorted Array II", "titleSlug": "search-in-rotated-sorted-array-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 783906, "totalSubmissionRaw": 2060863}, "82": {"acRate": 48.08135987609645, "difficulty": "Medium", "likes": 8860, "dislikes": 244, "categoryTitle": "Algorithms", "frontendQuestionId": "82", "paidOnly": false, "title": "Remove Duplicates from Sorted List II", "titleSlug": "remove-duplicates-from-sorted-list-ii", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 778593, "totalSubmissionRaw": 1619324}, "83": {"acRate": 53.181108233327144, "difficulty": "Easy", "likes": 8745, "dislikes": 310, "categoryTitle": "Algorithms", "frontendQuestionId": "83", "paidOnly": false, "title": "Remove Duplicates from Sorted List", "titleSlug": "remove-duplicates-from-sorted-list", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 1619042, "totalSubmissionRaw": 3044394}, "84": {"acRate": 45.234204729110935, "difficulty": "Hard", "likes": 17334, "dislikes": 292, "categoryTitle": "Algorithms", "frontendQuestionId": "84", "paidOnly": false, "title": "Largest Rectangle in Histogram", "titleSlug": "largest-rectangle-in-histogram", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 963636, "totalSubmissionRaw": 2130321}, "85": {"acRate": 51.35684693853021, "difficulty": "Hard", "likes": 10610, "dislikes": 185, "categoryTitle": "Algorithms", "frontendQuestionId": "85", "paidOnly": false, "title": "Maximal Rectangle", "titleSlug": "maximal-rectangle", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 512717, "totalSubmissionRaw": 998343}, "86": {"acRate": 56.96829653461657, "difficulty": "Medium", "likes": 7370, "dislikes": 881, "categoryTitle": "Algorithms", "frontendQuestionId": "86", "paidOnly": false, "title": "Partition List", "titleSlug": "partition-list", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 657274, "totalSubmissionRaw": 1153754}, "87": {"acRate": 40.572982724594816, "difficulty": "Hard", "likes": 3337, "dislikes": 1281, "categoryTitle": "Algorithms", "frontendQuestionId": "87", "paidOnly": false, "title": "Scramble String", "titleSlug": "scramble-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 237044, "totalSubmissionRaw": 584241}, "88": {"acRate": 50.673156775435615, "difficulty": "Easy", "likes": 15168, "dislikes": 1996, "categoryTitle": "Algorithms", "frontendQuestionId": "88", "paidOnly": false, "title": "Merge Sorted Array", "titleSlug": "merge-sorted-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 3501151, "totalSubmissionRaw": 6909306}, "89": {"acRate": 59.843297340005265, "difficulty": "Medium", "likes": 2259, "dislikes": 2725, "categoryTitle": "Algorithms", "frontendQuestionId": "89", "paidOnly": false, "title": "Gray Code", "titleSlug": "gray-code", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 309026, "totalSubmissionRaw": 516392}, "90": {"acRate": 57.901501747748775, "difficulty": "Medium", "likes": 9807, "dislikes": 322, "categoryTitle": "Algorithms", "frontendQuestionId": "90", "paidOnly": false, "title": "Subsets II", "titleSlug": "subsets-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 994207, "totalSubmissionRaw": 1717066}, "91": {"acRate": 35.309016343588986, "difficulty": "Medium", "likes": 11970, "dislikes": 4526, "categoryTitle": "Algorithms", "frontendQuestionId": "91", "paidOnly": false, "title": "Decode Ways", "titleSlug": "decode-ways", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 1300400, "totalSubmissionRaw": 3682912}, "92": {"acRate": 48.150786054256756, "difficulty": "Medium", "likes": 11679, "dislikes": 626, "categoryTitle": "Algorithms", "frontendQuestionId": "92", "paidOnly": false, "title": "Reverse Linked List II", "titleSlug": "reverse-linked-list-ii", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 918076, "totalSubmissionRaw": 1906669}, "93": {"acRate": 50.76808132613267, "difficulty": "Medium", "likes": 5243, "dislikes": 791, "categoryTitle": "Algorithms", "frontendQuestionId": "93", "paidOnly": false, "title": "Restore IP Addresses", "titleSlug": "restore-ip-addresses", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 476330, "totalSubmissionRaw": 938247}, "94": {"acRate": 76.83984013873018, "difficulty": "Easy", "likes": 13546, "dislikes": 798, "categoryTitle": "Algorithms", "frontendQuestionId": "94", "paidOnly": false, "title": "Binary Tree Inorder Traversal", "titleSlug": "binary-tree-inorder-traversal", "topicTags": [{"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 2676344, "totalSubmissionRaw": 3483017}, "95": {"acRate": 58.44133656432269, "difficulty": "Medium", "likes": 7579, "dislikes": 525, "categoryTitle": "Algorithms", "frontendQuestionId": "95", "paidOnly": false, "title": "Unique Binary Search Trees II", "titleSlug": "unique-binary-search-trees-ii", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 465217, "totalSubmissionRaw": 796041}, "96": {"acRate": 61.41789357724423, "difficulty": "Medium", "likes": 10382, "dislikes": 407, "categoryTitle": "Algorithms", "frontendQuestionId": "96", "paidOnly": false, "title": "Unique Binary Search Trees", "titleSlug": "unique-binary-search-trees", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 684639, "totalSubmissionRaw": 1114723}, "97": {"acRate": 40.44580889414958, "difficulty": "Medium", "likes": 8244, "dislikes": 487, "categoryTitle": "Algorithms", "frontendQuestionId": "97", "paidOnly": false, "title": "Interleaving String", "titleSlug": "interleaving-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 550825, "totalSubmissionRaw": 1361884}, "98": {"acRate": 33.28826196283164, "difficulty": "Medium", "likes": 16902, "dislikes": 1382, "categoryTitle": "Algorithms", "frontendQuestionId": "98", "paidOnly": false, "title": "Validate Binary Search Tree", "titleSlug": "validate-binary-search-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 2466304, "totalSubmissionRaw": 7408944}, "99": {"acRate": 53.98949425044645, "difficulty": "Medium", "likes": 7945, "dislikes": 258, "categoryTitle": "Algorithms", "frontendQuestionId": "99", "paidOnly": false, "title": "Recover Binary Search Tree", "titleSlug": "recover-binary-search-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 475567, "totalSubmissionRaw": 880851}, "100": {"acRate": 63.01913832578968, "difficulty": "Easy", "likes": 11624, "dislikes": 242, "categoryTitle": "Algorithms", "frontendQuestionId": "100", "paidOnly": false, "title": "Same Tree", "titleSlug": "same-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 2320023, "totalSubmissionRaw": 3681459}, "101": {"acRate": 57.2928155586164, "difficulty": "Easy", "likes": 15364, "dislikes": 385, "categoryTitle": "Algorithms", "frontendQuestionId": "101", "paidOnly": false, "title": "Symmetric Tree", "titleSlug": "symmetric-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 2104321, "totalSubmissionRaw": 3672923}, "102": {"acRate": 68.19437460333833, "difficulty": "Medium", "likes": 15396, "dislikes": 318, "categoryTitle": "Algorithms", "frontendQuestionId": "102", "paidOnly": false, "title": "Binary Tree Level Order Traversal", "titleSlug": "binary-tree-level-order-traversal", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 2380026, "totalSubmissionRaw": 3490063}, "103": {"acRate": 59.75397250371161, "difficulty": "Medium", "likes": 10889, "dislikes": 304, "categoryTitle": "Algorithms", "frontendQuestionId": "103", "paidOnly": false, "title": "Binary Tree Zigzag Level Order Traversal", "titleSlug": "binary-tree-zigzag-level-order-traversal", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1246483, "totalSubmissionRaw": 2086026}, "104": {"acRate": 75.92550013078237, "difficulty": "Easy", "likes": 12914, "dislikes": 232, "categoryTitle": "Algorithms", "frontendQuestionId": "104", "paidOnly": false, "title": "Maximum Depth of Binary Tree", "titleSlug": "maximum-depth-of-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 3312013, "totalSubmissionRaw": 4362192}, "105": {"acRate": 64.72019944907768, "difficulty": "Medium", "likes": 15086, "dislikes": 512, "categoryTitle": "Algorithms", "frontendQuestionId": "105", "paidOnly": false, "title": "Construct Binary Tree from Preorder and Inorder Traversal", "titleSlug": "construct-binary-tree-from-preorder-and-inorder-traversal", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1311738, "totalSubmissionRaw": 2026783}, "106": {"acRate": 63.93276843379473, "difficulty": "Medium", "likes": 8051, "dislikes": 132, "categoryTitle": "Algorithms", "frontendQuestionId": "106", "paidOnly": false, "title": "Construct Binary Tree from Inorder and Postorder Traversal", "titleSlug": "construct-binary-tree-from-inorder-and-postorder-traversal", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 680259, "totalSubmissionRaw": 1064023}, "107": {"acRate": 64.07868201003653, "difficulty": "Medium", "likes": 4875, "dislikes": 323, "categoryTitle": "Algorithms", "frontendQuestionId": "107", "paidOnly": false, "title": "Binary Tree Level Order Traversal II", "titleSlug": "binary-tree-level-order-traversal-ii", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 666929, "totalSubmissionRaw": 1040797}, "108": {"acRate": 72.3815267994373, "difficulty": "Easy", "likes": 11008, "dislikes": 564, "categoryTitle": "Algorithms", "frontendQuestionId": "108", "paidOnly": false, "title": "Convert Sorted Array to Binary Search Tree", "titleSlug": "convert-sorted-array-to-binary-search-tree", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 1267284, "totalSubmissionRaw": 1750839}, "109": {"acRate": 62.55090398101657, "difficulty": "Medium", "likes": 7472, "dislikes": 162, "categoryTitle": "Algorithms", "frontendQuestionId": "109", "paidOnly": false, "title": "Convert Sorted List to Binary Search Tree", "titleSlug": "convert-sorted-list-to-binary-search-tree", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 543284, "totalSubmissionRaw": 868547}, "110": {"acRate": 53.07872848391063, "difficulty": "Easy", "likes": 10788, "dislikes": 705, "categoryTitle": "Algorithms", "frontendQuestionId": "110", "paidOnly": false, "title": "Balanced Binary Tree", "titleSlug": "balanced-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1602516, "totalSubmissionRaw": 3019128}, "111": {"acRate": 48.72002479100068, "difficulty": "Easy", "likes": 7312, "dislikes": 1312, "categoryTitle": "Algorithms", "frontendQuestionId": "111", "paidOnly": false, "title": "Minimum Depth of Binary Tree", "titleSlug": "minimum-depth-of-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1254597, "totalSubmissionRaw": 2575121}, "112": {"acRate": 51.122604406375395, "difficulty": "Easy", "likes": 9726, "dislikes": 1119, "categoryTitle": "Algorithms", "frontendQuestionId": "112", "paidOnly": false, "title": "Path Sum", "titleSlug": "path-sum", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1540204, "totalSubmissionRaw": 3012766}, "113": {"acRate": 58.99838908680738, "difficulty": "Medium", "likes": 7979, "dislikes": 155, "categoryTitle": "Algorithms", "frontendQuestionId": "113", "paidOnly": false, "title": "Path Sum II", "titleSlug": "path-sum-ii", "topicTags": [{"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 891799, "totalSubmissionRaw": 1511565}, "114": {"acRate": 66.01272132142661, "difficulty": "Medium", "likes": 12325, "dislikes": 564, "categoryTitle": "Algorithms", "frontendQuestionId": "114", "paidOnly": false, "title": "Flatten Binary Tree to Linked List", "titleSlug": "flatten-binary-tree-to-linked-list", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1009178, "totalSubmissionRaw": 1528764}, "115": {"acRate": 47.97422436666462, "difficulty": "Hard", "likes": 6670, "dislikes": 291, "categoryTitle": "Algorithms", "frontendQuestionId": "115", "paidOnly": false, "title": "Distinct Subsequences", "titleSlug": "distinct-subsequences", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 438281, "totalSubmissionRaw": 913576}, "116": {"acRate": 63.41599051498711, "difficulty": "Medium", "likes": 9754, "dislikes": 304, "categoryTitle": "Algorithms", "frontendQuestionId": "116", "paidOnly": false, "title": "Populating Next Right Pointers in Each Node", "titleSlug": "populating-next-right-pointers-in-each-node", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1079909, "totalSubmissionRaw": 1702897}, "117": {"acRate": 53.301368276179396, "difficulty": "Medium", "likes": 5860, "dislikes": 322, "categoryTitle": "Algorithms", "frontendQuestionId": "117", "paidOnly": false, "title": "Populating Next Right Pointers in Each Node II", "titleSlug": "populating-next-right-pointers-in-each-node-ii", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 657987, "totalSubmissionRaw": 1234468}, "118": {"acRate": 75.11792527508157, "difficulty": "Easy", "likes": 12944, "dislikes": 458, "categoryTitle": "Algorithms", "frontendQuestionId": "118", "paidOnly": false, "title": "Pascal's Triangle", "titleSlug": "pascals-triangle", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 1779286, "totalSubmissionRaw": 2368658}, "119": {"acRate": 64.50775100558877, "difficulty": "Easy", "likes": 4848, "dislikes": 344, "categoryTitle": "Algorithms", "frontendQuestionId": "119", "paidOnly": false, "title": "Pascal's Triangle II", "titleSlug": "pascals-triangle-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 922463, "totalSubmissionRaw": 1430003}, "120": {"acRate": 57.448694597089236, "difficulty": "Medium", "likes": 9579, "dislikes": 561, "categoryTitle": "Algorithms", "frontendQuestionId": "120", "paidOnly": false, "title": "Triangle", "titleSlug": "triangle", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 817206, "totalSubmissionRaw": 1422502}, "121": {"acRate": 54.01718601431086, "difficulty": "Easy", "likes": 31201, "dislikes": 1176, "categoryTitle": "Algorithms", "frontendQuestionId": "121", "paidOnly": false, "title": "Best Time to Buy and Sell Stock", "titleSlug": "best-time-to-buy-and-sell-stock", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 5060584, "totalSubmissionRaw": 9368466}, "122": {"acRate": 67.38149420281788, "difficulty": "Medium", "likes": 13691, "dislikes": 2711, "categoryTitle": "Algorithms", "frontendQuestionId": "122", "paidOnly": false, "title": "Best Time to Buy and Sell Stock II", "titleSlug": "best-time-to-buy-and-sell-stock-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 2057863, "totalSubmissionRaw": 3054046}, "123": {"acRate": 48.92280119092675, "difficulty": "Hard", "likes": 9710, "dislikes": 195, "categoryTitle": "Algorithms", "frontendQuestionId": "123", "paidOnly": false, "title": "Best Time to Buy and Sell Stock III", "titleSlug": "best-time-to-buy-and-sell-stock-iii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 650208, "totalSubmissionRaw": 1329048}, "124": {"acRate": 40.30064057375793, "difficulty": "Hard", "likes": 16753, "dislikes": 738, "categoryTitle": "Algorithms", "frontendQuestionId": "124", "paidOnly": false, "title": "Binary Tree Maximum Path Sum", "titleSlug": "binary-tree-maximum-path-sum", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1314884, "totalSubmissionRaw": 3262692}, "125": {"acRate": 48.429952316801604, "difficulty": "Easy", "likes": 9462, "dislikes": 8389, "categoryTitle": "Algorithms", "frontendQuestionId": "125", "paidOnly": false, "title": "Valid Palindrome", "titleSlug": "valid-palindrome", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 3270272, "totalSubmissionRaw": 6752608}, "126": {"acRate": 27.186776625081315, "difficulty": "Hard", "likes": 6033, "dislikes": 753, "categoryTitle": "Algorithms", "frontendQuestionId": "126", "paidOnly": false, "title": "Word Ladder II", "titleSlug": "word-ladder-ii", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 375715, "totalSubmissionRaw": 1381972}, "127": {"acRate": 40.10060617116962, "difficulty": "Hard", "likes": 12129, "dislikes": 1881, "categoryTitle": "Algorithms", "frontendQuestionId": "127", "paidOnly": false, "title": "Word Ladder", "titleSlug": "word-ladder", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 1129840, "totalSubmissionRaw": 2817515}, "128": {"acRate": 47.363905218748585, "difficulty": "Medium", "likes": 20157, "dislikes": 1035, "categoryTitle": "Algorithms", "frontendQuestionId": "128", "paidOnly": false, "title": "Longest Consecutive Sequence", "titleSlug": "longest-consecutive-sequence", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1956915, "totalSubmissionRaw": 4131659}, "129": {"acRate": 66.48630981861344, "difficulty": "Medium", "likes": 8073, "dislikes": 144, "categoryTitle": "Algorithms", "frontendQuestionId": "129", "paidOnly": false, "title": "Sum Root to Leaf Numbers", "titleSlug": "sum-root-to-leaf-numbers", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 927615, "totalSubmissionRaw": 1395197}, "130": {"acRate": 40.458997466812704, "difficulty": "Medium", "likes": 8697, "dislikes": 1878, "categoryTitle": "Algorithms", "frontendQuestionId": "130", "paidOnly": false, "title": "Surrounded Regions", "titleSlug": "surrounded-regions", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 765357, "totalSubmissionRaw": 1891682}, "131": {"acRate": 70.0381516712389, "difficulty": "Medium", "likes": 12922, "dislikes": 502, "categoryTitle": "Algorithms", "frontendQuestionId": "131", "paidOnly": false, "title": "Palindrome Partitioning", "titleSlug": "palindrome-partitioning", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 944877, "totalSubmissionRaw": 1349089}, "132": {"acRate": 34.2389889064426, "difficulty": "Hard", "likes": 5477, "dislikes": 138, "categoryTitle": "Algorithms", "frontendQuestionId": "132", "paidOnly": false, "title": "Palindrome Partitioning II", "titleSlug": "palindrome-partitioning-ii", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 295830, "totalSubmissionRaw": 864015}, "133": {"acRate": 58.63593490522852, "difficulty": "Medium", "likes": 9546, "dislikes": 3850, "categoryTitle": "Algorithms", "frontendQuestionId": "133", "paidOnly": false, "title": "Clone Graph", "titleSlug": "clone-graph", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1314196, "totalSubmissionRaw": 2241283}, "134": {"acRate": 45.57180092983895, "difficulty": "Medium", "likes": 12055, "dislikes": 1176, "categoryTitle": "Algorithms", "frontendQuestionId": "134", "paidOnly": false, "title": "Gas Station", "titleSlug": "gas-station", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 874534, "totalSubmissionRaw": 1919027}, "135": {"acRate": 43.70592941756001, "difficulty": "Hard", "likes": 7908, "dislikes": 669, "categoryTitle": "Algorithms", "frontendQuestionId": "135", "paidOnly": false, "title": "Candy", "titleSlug": "candy", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 578480, "totalSubmissionRaw": 1323558}, "136": {"acRate": 73.80114565882269, "difficulty": "Easy", "likes": 16575, "dislikes": 732, "categoryTitle": "Algorithms", "frontendQuestionId": "136", "paidOnly": false, "title": "Single Number", "titleSlug": "single-number", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 3000849, "totalSubmissionRaw": 4066128}, "137": {"acRate": 63.51026835110587, "difficulty": "Medium", "likes": 7967, "dislikes": 694, "categoryTitle": "Algorithms", "frontendQuestionId": "137", "paidOnly": false, "title": "Single Number II", "titleSlug": "single-number-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 626790, "totalSubmissionRaw": 986912}, "138": {"acRate": 57.276051440794575, "difficulty": "Medium", "likes": 13944, "dislikes": 1487, "categoryTitle": "Algorithms", "frontendQuestionId": "138", "paidOnly": false, "title": "Copy List with Random Pointer", "titleSlug": "copy-list-with-random-pointer", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1327030, "totalSubmissionRaw": 2316907}, "139": {"acRate": 47.1151900363024, "difficulty": "Medium", "likes": 17255, "dislikes": 796, "categoryTitle": "Algorithms", "frontendQuestionId": "139", "paidOnly": false, "title": "Word Break", "titleSlug": "word-break", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 1764813, "totalSubmissionRaw": 3745747}, "140": {"acRate": 51.47153724160394, "difficulty": "Hard", "likes": 7211, "dislikes": 538, "categoryTitle": "Algorithms", "frontendQuestionId": "140", "paidOnly": false, "title": "Word Break II", "titleSlug": "word-break-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 676370, "totalSubmissionRaw": 1314067}, "141": {"acRate": 50.94862358408703, "difficulty": "Easy", "likes": 15594, "dislikes": 1389, "categoryTitle": "Algorithms", "frontendQuestionId": "141", "paidOnly": false, "title": "Linked List Cycle", "titleSlug": "linked-list-cycle", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 3192267, "totalSubmissionRaw": 6265658}, "142": {"acRate": 52.29478154026127, "difficulty": "Medium", "likes": 13655, "dislikes": 968, "categoryTitle": "Algorithms", "frontendQuestionId": "142", "paidOnly": false, "title": "Linked List Cycle II", "titleSlug": "linked-list-cycle-ii", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1376851, "totalSubmissionRaw": 2632865}, "143": {"acRate": 59.749637585361185, "difficulty": "Medium", "likes": 11167, "dislikes": 411, "categoryTitle": "Algorithms", "frontendQuestionId": "143", "paidOnly": false, "title": "Reorder List", "titleSlug": "reorder-list", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1048543, "totalSubmissionRaw": 1754895}, "144": {"acRate": 70.49503610940853, "difficulty": "Easy", "likes": 8020, "dislikes": 211, "categoryTitle": "Algorithms", "frontendQuestionId": "144", "paidOnly": false, "title": "Binary Tree Preorder Traversal", "titleSlug": "binary-tree-preorder-traversal", "topicTags": [{"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1719454, "totalSubmissionRaw": 2439114}, "145": {"acRate": 72.03717812319677, "difficulty": "Easy", "likes": 6923, "dislikes": 193, "categoryTitle": "Algorithms", "frontendQuestionId": "145", "paidOnly": false, "title": "Binary Tree Postorder Traversal", "titleSlug": "binary-tree-postorder-traversal", "topicTags": [{"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1278359, "totalSubmissionRaw": 1774584}, "146": {"acRate": 43.041456567146305, "difficulty": "Medium", "likes": 20826, "dislikes": 1047, "categoryTitle": "Algorithms", "frontendQuestionId": "146", "paidOnly": false, "title": "LRU Cache", "titleSlug": "lru-cache", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Doubly-Linked List", "id": "VG9waWNUYWdOb2RlOjYxMDU4", "slug": "doubly-linked-list"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1728266, "totalSubmissionRaw": 4015354}, "147": {"acRate": 54.31640210141746, "difficulty": "Medium", "likes": 3117, "dislikes": 867, "categoryTitle": "Algorithms", "frontendQuestionId": "147", "paidOnly": false, "title": "Insertion Sort List", "titleSlug": "insertion-sort-list", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 383577, "totalSubmissionRaw": 706190}, "148": {"acRate": 59.1311462543384, "difficulty": "Medium", "likes": 11692, "dislikes": 352, "categoryTitle": "Algorithms", "frontendQuestionId": "148", "paidOnly": false, "title": "Sort List", "titleSlug": "sort-list", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Merge Sort", "id": "VG9waWNUYWdOb2RlOjYxMDUx", "slug": "merge-sort"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 851344, "totalSubmissionRaw": 1439757}, "149": {"acRate": 27.325839965489195, "difficulty": "Hard", "likes": 4202, "dislikes": 503, "categoryTitle": "Algorithms", "frontendQuestionId": "149", "paidOnly": false, "title": "Max Points on a Line", "titleSlug": "max-points-on-a-line", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 409205, "totalSubmissionRaw": 1497501}, "150": {"acRate": 52.39371674619006, "difficulty": "Medium", "likes": 7698, "dislikes": 1096, "categoryTitle": "Algorithms", "frontendQuestionId": "150", "paidOnly": false, "title": "Evaluate Reverse Polish Notation", "titleSlug": "evaluate-reverse-polish-notation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1127613, "totalSubmissionRaw": 2152186}, "151": {"acRate": 45.30461705266011, "difficulty": "Medium", "likes": 8550, "dislikes": 5199, "categoryTitle": "Algorithms", "frontendQuestionId": "151", "paidOnly": false, "title": "Reverse Words in a String", "titleSlug": "reverse-words-in-a-string", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1721539, "totalSubmissionRaw": 3799928}, "152": {"acRate": 33.835955507997554, "difficulty": "Medium", "likes": 18590, "dislikes": 703, "categoryTitle": "Algorithms", "frontendQuestionId": "152", "paidOnly": false, "title": "Maximum Product Subarray", "titleSlug": "maximum-product-subarray", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1347990, "totalSubmissionRaw": 3983894}, "153": {"acRate": 51.08240358410884, "difficulty": "Medium", "likes": 13318, "dislikes": 593, "categoryTitle": "Algorithms", "frontendQuestionId": "153", "paidOnly": false, "title": "Find Minimum in Rotated Sorted Array", "titleSlug": "find-minimum-in-rotated-sorted-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1956123, "totalSubmissionRaw": 3829349}, "154": {"acRate": 43.71335510971166, "difficulty": "Hard", "likes": 4693, "dislikes": 489, "categoryTitle": "Algorithms", "frontendQuestionId": "154", "paidOnly": false, "title": "Find Minimum in Rotated Sorted Array II", "titleSlug": "find-minimum-in-rotated-sorted-array-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 467986, "totalSubmissionRaw": 1070579}, "155": {"acRate": 54.78817161745197, "difficulty": "Medium", "likes": 14218, "dislikes": 881, "categoryTitle": "Algorithms", "frontendQuestionId": "155", "paidOnly": false, "title": "Min Stack", "titleSlug": "min-stack", "topicTags": [{"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1794104, "totalSubmissionRaw": 3274624}, "156": {"acRate": 63.09715218397525, "difficulty": "Medium", "likes": 263, "dislikes": 350, "categoryTitle": "Algorithms", "frontendQuestionId": "156", "paidOnly": true, "title": "Binary Tree Upside Down", "titleSlug": "binary-tree-upside-down", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 103603, "totalSubmissionRaw": 164196}, "157": {"acRate": 41.70510584232401, "difficulty": "Easy", "likes": 580, "dislikes": 3505, "categoryTitle": "Algorithms", "frontendQuestionId": "157", "paidOnly": true, "title": "Read N Characters Given Read4", "titleSlug": "read-n-characters-given-read4", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 193666, "totalSubmissionRaw": 464370}, "158": {"acRate": 42.457147040789245, "difficulty": "Hard", "likes": 869, "dislikes": 1804, "categoryTitle": "Algorithms", "frontendQuestionId": "158", "paidOnly": true, "title": "Read N Characters Given read4 II - Call Multiple Times", "titleSlug": "read-n-characters-given-read4-ii-call-multiple-times", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 185570, "totalSubmissionRaw": 437076}, "159": {"acRate": 55.623178845511475, "difficulty": "Medium", "likes": 2216, "dislikes": 36, "categoryTitle": "Algorithms", "frontendQuestionId": "159", "paidOnly": true, "title": "Longest Substring with At Most Two Distinct Characters", "titleSlug": "longest-substring-with-at-most-two-distinct-characters", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 264768, "totalSubmissionRaw": 476003}, "160": {"acRate": 58.52290437527194, "difficulty": "Easy", "likes": 15053, "dislikes": 1365, "categoryTitle": "Algorithms", "frontendQuestionId": "160", "paidOnly": false, "title": "Intersection of Two Linked Lists", "titleSlug": "intersection-of-two-linked-lists", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 1669130, "totalSubmissionRaw": 2852097}, "161": {"acRate": 34.359659408243054, "difficulty": "Medium", "likes": 1391, "dislikes": 187, "categoryTitle": "Algorithms", "frontendQuestionId": "161", "paidOnly": true, "title": "One Edit Distance", "titleSlug": "one-edit-distance", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 210400, "totalSubmissionRaw": 612346}, "162": {"acRate": 45.997194293628674, "difficulty": "Medium", "likes": 12159, "dislikes": 4699, "categoryTitle": "Algorithms", "frontendQuestionId": "162", "paidOnly": false, "title": "Find Peak Element", "titleSlug": "find-peak-element", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 1495794, "totalSubmissionRaw": 3251927}, "163": {"acRate": 34.08561719801478, "difficulty": "Easy", "likes": 1100, "dislikes": 2980, "categoryTitle": "Algorithms", "frontendQuestionId": "163", "paidOnly": true, "title": "Missing Ranges", "titleSlug": "missing-ranges", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 250471, "totalSubmissionRaw": 734829}, "164": {"acRate": 46.912445654094945, "difficulty": "Medium", "likes": 3284, "dislikes": 402, "categoryTitle": "Algorithms", "frontendQuestionId": "164", "paidOnly": false, "title": "Maximum Gap", "titleSlug": "maximum-gap", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Bucket Sort", "id": "VG9waWNUYWdOb2RlOjYxMDYw", "slug": "bucket-sort"}, {"name": "Radix Sort", "id": "VG9waWNUYWdOb2RlOjYxMDYx", "slug": "radix-sort"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 225624, "totalSubmissionRaw": 480947}, "165": {"acRate": 41.176930017320956, "difficulty": "Medium", "likes": 2643, "dislikes": 2736, "categoryTitle": "Algorithms", "frontendQuestionId": "165", "paidOnly": false, "title": "Compare Version Numbers", "titleSlug": "compare-version-numbers", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 506123, "totalSubmissionRaw": 1229144}, "166": {"acRate": 25.290756025341533, "difficulty": "Medium", "likes": 2090, "dislikes": 3676, "categoryTitle": "Algorithms", "frontendQuestionId": "166", "paidOnly": false, "title": "Fraction to Recurring Decimal", "titleSlug": "fraction-to-recurring-decimal", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 233092, "totalSubmissionRaw": 921649}, "167": {"acRate": 61.87749183050485, "difficulty": "Medium", "likes": 11798, "dislikes": 1421, "categoryTitle": "Algorithms", "frontendQuestionId": "167", "paidOnly": false, "title": "Two Sum II - Input Array Is Sorted", "titleSlug": "two-sum-ii-input-array-is-sorted", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 2185521, "totalSubmissionRaw": 3532022}, "168": {"acRate": 41.38439768922783, "difficulty": "Easy", "likes": 5585, "dislikes": 820, "categoryTitle": "Algorithms", "frontendQuestionId": "168", "paidOnly": false, "title": "Excel Sheet Column Title", "titleSlug": "excel-sheet-column-title", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 548956, "totalSubmissionRaw": 1326480}, "169": {"acRate": 65.11674830969298, "difficulty": "Easy", "likes": 19346, "dislikes": 643, "categoryTitle": "Algorithms", "frontendQuestionId": "169", "paidOnly": false, "title": "Majority Element", "titleSlug": "majority-element", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 3207855, "totalSubmissionRaw": 4926312}, "170": {"acRate": 38.262838673153645, "difficulty": "Easy", "likes": 670, "dislikes": 448, "categoryTitle": "Algorithms", "frontendQuestionId": "170", "paidOnly": true, "title": "Two Sum III - Data structure design", "titleSlug": "two-sum-iii-data-structure-design", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Data Stream", "id": "VG9waWNUYWdOb2RlOjYxMDYz", "slug": "data-stream"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 158156, "totalSubmissionRaw": 413341}, "171": {"acRate": 64.29312623268814, "difficulty": "Easy", "likes": 4781, "dislikes": 371, "categoryTitle": "Algorithms", "frontendQuestionId": "171", "paidOnly": false, "title": "Excel Sheet Column Number", "titleSlug": "excel-sheet-column-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 711288, "totalSubmissionRaw": 1106321}, "172": {"acRate": 43.70708478641331, "difficulty": "Medium", "likes": 3214, "dislikes": 1957, "categoryTitle": "Algorithms", "frontendQuestionId": "172", "paidOnly": false, "title": "Factorial Trailing Zeroes", "titleSlug": "factorial-trailing-zeroes", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 475995, "totalSubmissionRaw": 1089060}, "173": {"acRate": 72.82892594008158, "difficulty": "Medium", "likes": 8581, "dislikes": 512, "categoryTitle": "Algorithms", "frontendQuestionId": "173", "paidOnly": false, "title": "Binary Search Tree Iterator", "titleSlug": "binary-search-tree-iterator", "topicTags": [{"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}, {"name": "Iterator", "id": "VG9waWNUYWdOb2RlOjYxMDY0", "slug": "iterator"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 825084, "totalSubmissionRaw": 1132907}, "174": {"acRate": 38.37696939701394, "difficulty": "Hard", "likes": 5816, "dislikes": 109, "categoryTitle": "Algorithms", "frontendQuestionId": "174", "paidOnly": false, "title": "Dungeon Game", "titleSlug": "dungeon-game", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 232622, "totalSubmissionRaw": 606150}, "175": {"acRate": 76.53593326679025, "difficulty": "Easy", "likes": 3537, "dislikes": 226, "categoryTitle": "Database", "frontendQuestionId": "175", "paidOnly": false, "title": "Combine Two Tables", "titleSlug": "combine-two-tables", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1073489, "totalSubmissionRaw": 1402596}, "176": {"acRate": 41.28952453272952, "difficulty": "Medium", "likes": 3611, "dislikes": 960, "categoryTitle": "Database", "frontendQuestionId": "176", "paidOnly": false, "title": "Second Highest Salary", "titleSlug": "second-highest-salary", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 927596, "totalSubmissionRaw": 2246588}, "177": {"acRate": 37.94575309884279, "difficulty": "Medium", "likes": 1984, "dislikes": 1034, "categoryTitle": "Database", "frontendQuestionId": "177", "paidOnly": false, "title": "Nth Highest Salary", "titleSlug": "nth-highest-salary", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 414803, "totalSubmissionRaw": 1093147}, "178": {"acRate": 63.11399358932226, "difficulty": "Medium", "likes": 2171, "dislikes": 274, "categoryTitle": "Database", "frontendQuestionId": "178", "paidOnly": false, "title": "Rank Scores", "titleSlug": "rank-scores", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 412905, "totalSubmissionRaw": 654221}, "179": {"acRate": 36.75080072721058, "difficulty": "Medium", "likes": 8076, "dislikes": 673, "categoryTitle": "Algorithms", "frontendQuestionId": "179", "paidOnly": false, "title": "Largest Number", "titleSlug": "largest-number", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 498898, "totalSubmissionRaw": 1357516}, "180": {"acRate": 44.15781796559123, "difficulty": "Medium", "likes": 2135, "dislikes": 315, "categoryTitle": "Database", "frontendQuestionId": "180", "paidOnly": false, "title": "Consecutive Numbers", "titleSlug": "consecutive-numbers", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 411408, "totalSubmissionRaw": 931666}, "181": {"acRate": 70.04568349295553, "difficulty": "Easy", "likes": 2616, "dislikes": 256, "categoryTitle": "Database", "frontendQuestionId": "181", "paidOnly": false, "title": "Employees Earning More Than Their Managers", "titleSlug": "employees-earning-more-than-their-managers", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 678783, "totalSubmissionRaw": 969057}, "182": {"acRate": 71.41560669871386, "difficulty": "Easy", "likes": 2088, "dislikes": 71, "categoryTitle": "Database", "frontendQuestionId": "182", "paidOnly": false, "title": "Duplicate Emails", "titleSlug": "duplicate-emails", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 705082, "totalSubmissionRaw": 987294}, "183": {"acRate": 69.49306304527663, "difficulty": "Easy", "likes": 2640, "dislikes": 138, "categoryTitle": "Database", "frontendQuestionId": "183", "paidOnly": false, "title": "Customers Who Never Order", "titleSlug": "customers-who-never-order", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 851814, "totalSubmissionRaw": 1225754}, "184": {"acRate": 52.42312385169529, "difficulty": "Medium", "likes": 2068, "dislikes": 186, "categoryTitle": "Database", "frontendQuestionId": "184", "paidOnly": false, "title": "Department Highest Salary", "titleSlug": "department-highest-salary", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 407735, "totalSubmissionRaw": 777777}, "185": {"acRate": 54.56989895943296, "difficulty": "Hard", "likes": 2120, "dislikes": 243, "categoryTitle": "Database", "frontendQuestionId": "185", "paidOnly": false, "title": "Department Top Three Salaries", "titleSlug": "department-top-three-salaries", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 361853, "totalSubmissionRaw": 663100}, "186": {"acRate": 55.03274031793449, "difficulty": "Medium", "likes": 1074, "dislikes": 144, "categoryTitle": "Algorithms", "frontendQuestionId": "186", "paidOnly": true, "title": "Reverse Words in a String II", "titleSlug": "reverse-words-in-a-string-ii", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 165063, "totalSubmissionRaw": 299936}, "187": {"acRate": 49.44338396377057, "difficulty": "Medium", "likes": 3340, "dislikes": 537, "categoryTitle": "Algorithms", "frontendQuestionId": "187", "paidOnly": false, "title": "Repeated DNA Sequences", "titleSlug": "repeated-dna-sequences", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 392933, "totalSubmissionRaw": 794713}, "188": {"acRate": 44.1378901151062, "difficulty": "Hard", "likes": 7454, "dislikes": 210, "categoryTitle": "Algorithms", "frontendQuestionId": "188", "paidOnly": false, "title": "Best Time to Buy and Sell Stock IV", "titleSlug": "best-time-to-buy-and-sell-stock-iv", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 490974, "totalSubmissionRaw": 1112364}, "189": {"acRate": 41.29442806571933, "difficulty": "Medium", "likes": 18123, "dislikes": 1987, "categoryTitle": "Algorithms", "frontendQuestionId": "189", "paidOnly": false, "title": "Rotate Array", "titleSlug": "rotate-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 2408739, "totalSubmissionRaw": 5833085}, "190": {"acRate": 59.79655779827456, "difficulty": "Easy", "likes": 5125, "dislikes": 1450, "categoryTitle": "Algorithms", "frontendQuestionId": "190", "paidOnly": false, "title": "Reverse Bits", "titleSlug": "reverse-bits", "topicTags": [{"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 842208, "totalSubmissionRaw": 1408457}, "191": {"acRate": 72.08449609631971, "difficulty": "Easy", "likes": 6542, "dislikes": 1339, "categoryTitle": "Algorithms", "frontendQuestionId": "191", "paidOnly": false, "title": "Number of 1 Bits", "titleSlug": "number-of-1-bits", "topicTags": [{"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1552694, "totalSubmissionRaw": 2153992}, "192": {"acRate": 25.941726555567474, "difficulty": "Medium", "likes": 543, "dislikes": 307, "categoryTitle": "Shell", "frontendQuestionId": "192", "paidOnly": false, "title": "Word Frequency", "titleSlug": "word-frequency", "topicTags": [{"name": "Shell", "id": "VG9waWNUYWdOb2RlOjYxMDQ0", "slug": "shell"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 53207, "totalSubmissionRaw": 205102}, "193": {"acRate": 26.22608445159277, "difficulty": "Easy", "likes": 423, "dislikes": 967, "categoryTitle": "Shell", "frontendQuestionId": "193", "paidOnly": false, "title": "Valid Phone Numbers", "titleSlug": "valid-phone-numbers", "topicTags": [{"name": "Shell", "id": "VG9waWNUYWdOb2RlOjYxMDQ0", "slug": "shell"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 87400, "totalSubmissionRaw": 333256}, "194": {"acRate": 26.72348015656741, "difficulty": "Medium", "likes": 146, "dislikes": 287, "categoryTitle": "Shell", "frontendQuestionId": "194", "paidOnly": false, "title": "Transpose File", "titleSlug": "transpose-file", "topicTags": [{"name": "Shell", "id": "VG9waWNUYWdOb2RlOjYxMDQ0", "slug": "shell"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26968, "totalSubmissionRaw": 100915}, "195": {"acRate": 33.561308057613246, "difficulty": "Easy", "likes": 391, "dislikes": 468, "categoryTitle": "Shell", "frontendQuestionId": "195", "paidOnly": false, "title": "Tenth Line", "titleSlug": "tenth-line", "topicTags": [{"name": "Shell", "id": "VG9waWNUYWdOb2RlOjYxMDQ0", "slug": "shell"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 111589, "totalSubmissionRaw": 332493}, "196": {"acRate": 62.64614751055, "difficulty": "Easy", "likes": 1627, "dislikes": 333, "categoryTitle": "Database", "frontendQuestionId": "196", "paidOnly": false, "title": "Delete Duplicate Emails", "titleSlug": "delete-duplicate-emails", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 571979, "totalSubmissionRaw": 913032}, "197": {"acRate": 48.47524645217203, "difficulty": "Easy", "likes": 3003, "dislikes": 622, "categoryTitle": "Database", "frontendQuestionId": "197", "paidOnly": false, "title": "Rising Temperature", "titleSlug": "rising-temperature", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 751746, "totalSubmissionRaw": 1550787}, "198": {"acRate": 51.38151835208697, "difficulty": "Medium", "likes": 21171, "dislikes": 431, "categoryTitle": "Algorithms", "frontendQuestionId": "198", "paidOnly": false, "title": "House Robber", "titleSlug": "house-robber", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 2375921, "totalSubmissionRaw": 4624076}, "199": {"acRate": 63.65592251473008, "difficulty": "Medium", "likes": 12066, "dislikes": 979, "categoryTitle": "Algorithms", "frontendQuestionId": "199", "paidOnly": false, "title": "Binary Tree Right Side View", "titleSlug": "binary-tree-right-side-view", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 1427279, "totalSubmissionRaw": 2242178}, "200": {"acRate": 60.15357615461324, "difficulty": "Medium", "likes": 22879, "dislikes": 522, "categoryTitle": "Algorithms", "frontendQuestionId": "200", "paidOnly": false, "title": "Number of Islands", "titleSlug": "number-of-islands", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 2881533, "totalSubmissionRaw": 4790298}, "201": {"acRate": 47.17127789252505, "difficulty": "Medium", "likes": 4018, "dislikes": 303, "categoryTitle": "Algorithms", "frontendQuestionId": "201", "paidOnly": false, "title": "Bitwise AND of Numbers Range", "titleSlug": "bitwise-and-of-numbers-range", "topicTags": [{"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 409033, "totalSubmissionRaw": 867123}, "202": {"acRate": 56.62808175199283, "difficulty": "Easy", "likes": 10418, "dislikes": 1463, "categoryTitle": "Algorithms", "frontendQuestionId": "202", "paidOnly": false, "title": "Happy Number", "titleSlug": "happy-number", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1554839, "totalSubmissionRaw": 2745708}, "203": {"acRate": 49.61857307654838, "difficulty": "Easy", "likes": 8343, "dislikes": 246, "categoryTitle": "Algorithms", "frontendQuestionId": "203", "paidOnly": false, "title": "Remove Linked List Elements", "titleSlug": "remove-linked-list-elements", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1186716, "totalSubmissionRaw": 2391677}, "204": {"acRate": 33.89482412978834, "difficulty": "Medium", "likes": 7996, "dislikes": 1458, "categoryTitle": "Algorithms", "frontendQuestionId": "204", "paidOnly": false, "title": "Count Primes", "titleSlug": "count-primes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 912327, "totalSubmissionRaw": 2691643}, "205": {"acRate": 45.56922599690051, "difficulty": "Easy", "likes": 9080, "dislikes": 2109, "categoryTitle": "Algorithms", "frontendQuestionId": "205", "paidOnly": false, "title": "Isomorphic Strings", "titleSlug": "isomorphic-strings", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1445511, "totalSubmissionRaw": 3172124}, "206": {"acRate": 77.36910448826602, "difficulty": "Easy", "likes": 21694, "dislikes": 448, "categoryTitle": "Algorithms", "frontendQuestionId": "206", "paidOnly": false, "title": "Reverse Linked List", "titleSlug": "reverse-linked-list", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 4422173, "totalSubmissionRaw": 5715683}, "207": {"acRate": 47.30113696465105, "difficulty": "Medium", "likes": 16280, "dislikes": 728, "categoryTitle": "Algorithms", "frontendQuestionId": "207", "paidOnly": false, "title": "Course Schedule", "titleSlug": "course-schedule", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1676891, "totalSubmissionRaw": 3545139}, "208": {"acRate": 66.0093935964695, "difficulty": "Medium", "likes": 11595, "dislikes": 143, "categoryTitle": "Algorithms", "frontendQuestionId": "208", "paidOnly": false, "title": "Implement Trie (Prefix Tree)", "titleSlug": "implement-trie-prefix-tree", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1105356, "totalSubmissionRaw": 1674544}, "209": {"acRate": 47.64252859739261, "difficulty": "Medium", "likes": 12667, "dislikes": 440, "categoryTitle": "Algorithms", "frontendQuestionId": "209", "paidOnly": false, "title": "Minimum Size Subarray Sum", "titleSlug": "minimum-size-subarray-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1132942, "totalSubmissionRaw": 2378009}, "210": {"acRate": 51.222044009554246, "difficulty": "Medium", "likes": 10827, "dislikes": 349, "categoryTitle": "Algorithms", "frontendQuestionId": "210", "paidOnly": false, "title": "Course Schedule II", "titleSlug": "course-schedule-ii", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 1109761, "totalSubmissionRaw": 2166567}, "211": {"acRate": 45.74834429826064, "difficulty": "Medium", "likes": 7604, "dislikes": 457, "categoryTitle": "Algorithms", "frontendQuestionId": "211", "paidOnly": false, "title": "Design Add and Search Words Data Structure", "titleSlug": "design-add-and-search-words-data-structure", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 667695, "totalSubmissionRaw": 1459497}, "212": {"acRate": 36.51708979289029, "difficulty": "Hard", "likes": 9458, "dislikes": 463, "categoryTitle": "Algorithms", "frontendQuestionId": "212", "paidOnly": false, "title": "Word Search II", "titleSlug": "word-search-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 687143, "totalSubmissionRaw": 1881699}, "213": {"acRate": 42.39747611164358, "difficulty": "Medium", "likes": 9890, "dislikes": 154, "categoryTitle": "Algorithms", "frontendQuestionId": "213", "paidOnly": false, "title": "House Robber II", "titleSlug": "house-robber-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 817478, "totalSubmissionRaw": 1928125}, "214": {"acRate": 33.891769064570596, "difficulty": "Hard", "likes": 3630, "dislikes": 246, "categoryTitle": "Algorithms", "frontendQuestionId": "214", "paidOnly": false, "title": "Shortest Palindrome", "titleSlug": "shortest-palindrome", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 188080, "totalSubmissionRaw": 554943}, "215": {"acRate": 67.01006310295875, "difficulty": "Medium", "likes": 17156, "dislikes": 885, "categoryTitle": "Algorithms", "frontendQuestionId": "215", "paidOnly": false, "title": "Kth Largest Element in an Array", "titleSlug": "kth-largest-element-in-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Quickselect", "id": "VG9waWNUYWdOb2RlOjYxMDY5", "slug": "quickselect"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 2449816, "totalSubmissionRaw": 3655898}, "216": {"acRate": 70.35065215751021, "difficulty": "Medium", "likes": 6025, "dislikes": 112, "categoryTitle": "Algorithms", "frontendQuestionId": "216", "paidOnly": false, "title": "Combination Sum III", "titleSlug": "combination-sum-iii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 550101, "totalSubmissionRaw": 781941}, "217": {"acRate": 62.098497721093146, "difficulty": "Easy", "likes": 12077, "dislikes": 1303, "categoryTitle": "Algorithms", "frontendQuestionId": "217", "paidOnly": false, "title": "Contains Duplicate", "titleSlug": "contains-duplicate", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 4247733, "totalSubmissionRaw": 6840321}, "218": {"acRate": 42.96434100421448, "difficulty": "Hard", "likes": 5906, "dislikes": 266, "categoryTitle": "Algorithms", "frontendQuestionId": "218", "paidOnly": false, "title": "The Skyline Problem", "titleSlug": "the-skyline-problem", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Line Sweep", "id": "VG9waWNUYWdOb2RlOjU2MTE5", "slug": "line-sweep"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 295843, "totalSubmissionRaw": 688576}, "219": {"acRate": 46.10010307063859, "difficulty": "Easy", "likes": 6178, "dislikes": 3104, "categoryTitle": "Algorithms", "frontendQuestionId": "219", "paidOnly": false, "title": "Contains Duplicate II", "titleSlug": "contains-duplicate-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1021553, "totalSubmissionRaw": 2215950}, "220": {"acRate": 22.93249737730018, "difficulty": "Hard", "likes": 1016, "dislikes": 89, "categoryTitle": "Algorithms", "frontendQuestionId": "220", "paidOnly": false, "title": "Contains Duplicate III", "titleSlug": "contains-duplicate-iii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Bucket Sort", "id": "VG9waWNUYWdOb2RlOjYxMDYw", "slug": "bucket-sort"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 258818, "totalSubmissionRaw": 1128608}, "221": {"acRate": 47.10870010262539, "difficulty": "Medium", "likes": 10148, "dislikes": 227, "categoryTitle": "Algorithms", "frontendQuestionId": "221", "paidOnly": false, "title": "Maximal Square", "titleSlug": "maximal-square", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 711046, "totalSubmissionRaw": 1509373}, "222": {"acRate": 66.7529422589665, "difficulty": "Easy", "likes": 8694, "dislikes": 523, "categoryTitle": "Algorithms", "frontendQuestionId": "222", "paidOnly": false, "title": "Count Complete Tree Nodes", "titleSlug": "count-complete-tree-nodes", "topicTags": [{"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 783515, "totalSubmissionRaw": 1173755}, "223": {"acRate": 46.52956141367677, "difficulty": "Medium", "likes": 1997, "dislikes": 1646, "categoryTitle": "Algorithms", "frontendQuestionId": "223", "paidOnly": false, "title": "Rectangle Area", "titleSlug": "rectangle-area", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 228804, "totalSubmissionRaw": 491739}, "224": {"acRate": 43.80160048586178, "difficulty": "Hard", "likes": 6332, "dislikes": 502, "categoryTitle": "Algorithms", "frontendQuestionId": "224", "paidOnly": false, "title": "Basic Calculator", "titleSlug": "basic-calculator", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 490429, "totalSubmissionRaw": 1119660}, "225": {"acRate": 64.86450707228659, "difficulty": "Easy", "likes": 6113, "dislikes": 1212, "categoryTitle": "Algorithms", "frontendQuestionId": "225", "paidOnly": false, "title": "Implement Stack using Queues", "titleSlug": "implement-stack-using-queues", "topicTags": [{"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 730055, "totalSubmissionRaw": 1125511}, "226": {"acRate": 77.6158475925716, "difficulty": "Easy", "likes": 14013, "dislikes": 229, "categoryTitle": "Algorithms", "frontendQuestionId": "226", "paidOnly": false, "title": "Invert Binary Tree", "titleSlug": "invert-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 2197805, "totalSubmissionRaw": 2831648}, "227": {"acRate": 44.077792660485876, "difficulty": "Medium", "likes": 6158, "dislikes": 848, "categoryTitle": "Algorithms", "frontendQuestionId": "227", "paidOnly": false, "title": "Basic Calculator II", "titleSlug": "basic-calculator-ii", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 663745, "totalSubmissionRaw": 1505849}, "228": {"acRate": 51.32817931300203, "difficulty": "Easy", "likes": 3980, "dislikes": 2177, "categoryTitle": "Algorithms", "frontendQuestionId": "228", "paidOnly": false, "title": "Summary Ranges", "titleSlug": "summary-ranges", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 612781, "totalSubmissionRaw": 1193863}, "229": {"acRate": 52.352858732727015, "difficulty": "Medium", "likes": 9741, "dislikes": 431, "categoryTitle": "Algorithms", "frontendQuestionId": "229", "paidOnly": false, "title": "Majority Element II", "titleSlug": "majority-element-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 754545, "totalSubmissionRaw": 1441268}, "230": {"acRate": 73.38906500380705, "difficulty": "Medium", "likes": 11529, "dislikes": 232, "categoryTitle": "Algorithms", "frontendQuestionId": "230", "paidOnly": false, "title": "Kth Smallest Element in a BST", "titleSlug": "kth-smallest-element-in-a-bst", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1539284, "totalSubmissionRaw": 2097428}, "231": {"acRate": 47.91599161548178, "difficulty": "Easy", "likes": 6852, "dislikes": 437, "categoryTitle": "Algorithms", "frontendQuestionId": "231", "paidOnly": false, "title": "Power of Two", "titleSlug": "power-of-two", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1409271, "totalSubmissionRaw": 2941129}, "232": {"acRate": 66.81261403184452, "difficulty": "Easy", "likes": 7683, "dislikes": 435, "categoryTitle": "Algorithms", "frontendQuestionId": "232", "paidOnly": false, "title": "Implement Queue using Stacks", "titleSlug": "implement-queue-using-stacks", "topicTags": [{"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 997515, "totalSubmissionRaw": 1493004}, "233": {"acRate": 34.82074548527711, "difficulty": "Hard", "likes": 1568, "dislikes": 1477, "categoryTitle": "Algorithms", "frontendQuestionId": "233", "paidOnly": false, "title": "Number of Digit One", "titleSlug": "number-of-digit-one", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 97855, "totalSubmissionRaw": 281025}, "234": {"acRate": 53.90876253419614, "difficulty": "Easy", "likes": 16567, "dislikes": 887, "categoryTitle": "Algorithms", "frontendQuestionId": "234", "paidOnly": false, "title": "Palindrome Linked List", "titleSlug": "palindrome-linked-list", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 2047023, "totalSubmissionRaw": 3797203}, "235": {"acRate": 65.75220234076772, "difficulty": "Medium", "likes": 11181, "dislikes": 320, "categoryTitle": "Algorithms", "frontendQuestionId": "235", "paidOnly": false, "title": "Lowest Common Ancestor of a Binary Search Tree", "titleSlug": "lowest-common-ancestor-of-a-binary-search-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1592422, "totalSubmissionRaw": 2421854}, "236": {"acRate": 63.48458537081575, "difficulty": "Medium", "likes": 16661, "dislikes": 420, "categoryTitle": "Algorithms", "frontendQuestionId": "236", "paidOnly": false, "title": "Lowest Common Ancestor of a Binary Tree", "titleSlug": "lowest-common-ancestor-of-a-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1747459, "totalSubmissionRaw": 2752575}, "237": {"acRate": 80.51450626369673, "difficulty": "Medium", "likes": 5142, "dislikes": 1581, "categoryTitle": "Algorithms", "frontendQuestionId": "237", "paidOnly": false, "title": "Delete Node in a Linked List", "titleSlug": "delete-node-in-a-linked-list", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1476942, "totalSubmissionRaw": 1834380}, "238": {"acRate": 66.57417581779364, "difficulty": "Medium", "likes": 22736, "dislikes": 1430, "categoryTitle": "Algorithms", "frontendQuestionId": "238", "paidOnly": false, "title": "Product of Array Except Self", "titleSlug": "product-of-array-except-self", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 2865705, "totalSubmissionRaw": 4304535}, "239": {"acRate": 46.77433146666461, "difficulty": "Hard", "likes": 18297, "dislikes": 692, "categoryTitle": "Algorithms", "frontendQuestionId": "239", "paidOnly": false, "title": "Sliding Window Maximum", "titleSlug": "sliding-window-maximum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Monotonic Queue", "id": "VG9waWNUYWdOb2RlOjYxMDcx", "slug": "monotonic-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1094015, "totalSubmissionRaw": 2338916}, "240": {"acRate": 53.316011798253136, "difficulty": "Medium", "likes": 11961, "dislikes": 205, "categoryTitle": "Algorithms", "frontendQuestionId": "240", "paidOnly": false, "title": "Search a 2D Matrix II", "titleSlug": "search-a-2d-matrix-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 978802, "totalSubmissionRaw": 1835857}, "241": {"acRate": 65.83237711363384, "difficulty": "Medium", "likes": 5385, "dislikes": 278, "categoryTitle": "Algorithms", "frontendQuestionId": "241", "paidOnly": false, "title": "Different Ways to Add Parentheses", "titleSlug": "different-ways-to-add-parentheses", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 226046, "totalSubmissionRaw": 343366}, "242": {"acRate": 65.11391423854369, "difficulty": "Easy", "likes": 12212, "dislikes": 406, "categoryTitle": "Algorithms", "frontendQuestionId": "242", "paidOnly": false, "title": "Valid Anagram", "titleSlug": "valid-anagram", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 3803569, "totalSubmissionRaw": 5841408}, "243": {"acRate": 65.44273854544906, "difficulty": "Easy", "likes": 1266, "dislikes": 114, "categoryTitle": "Algorithms", "frontendQuestionId": "243", "paidOnly": true, "title": "Shortest Word Distance", "titleSlug": "shortest-word-distance", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 217175, "totalSubmissionRaw": 331855}, "244": {"acRate": 61.357714700166746, "difficulty": "Medium", "likes": 1051, "dislikes": 339, "categoryTitle": "Algorithms", "frontendQuestionId": "244", "paidOnly": true, "title": "Shortest Word Distance II", "titleSlug": "shortest-word-distance-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 155659, "totalSubmissionRaw": 253691}, "245": {"acRate": 58.579727493574616, "difficulty": "Medium", "likes": 504, "dislikes": 100, "categoryTitle": "Algorithms", "frontendQuestionId": "245", "paidOnly": true, "title": "Shortest Word Distance III", "titleSlug": "shortest-word-distance-iii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 83192, "totalSubmissionRaw": 142015}, "246": {"acRate": 47.67970710902263, "difficulty": "Easy", "likes": 595, "dislikes": 1017, "categoryTitle": "Algorithms", "frontendQuestionId": "246", "paidOnly": true, "title": "Strobogrammatic Number", "titleSlug": "strobogrammatic-number", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 176855, "totalSubmissionRaw": 370923}, "247": {"acRate": 52.568976357229545, "difficulty": "Medium", "likes": 926, "dislikes": 251, "categoryTitle": "Algorithms", "frontendQuestionId": "247", "paidOnly": true, "title": "Strobogrammatic Number II", "titleSlug": "strobogrammatic-number-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 143814, "totalSubmissionRaw": 273572}, "248": {"acRate": 42.18929605958895, "difficulty": "Hard", "likes": 301, "dislikes": 188, "categoryTitle": "Algorithms", "frontendQuestionId": "248", "paidOnly": true, "title": "Strobogrammatic Number III", "titleSlug": "strobogrammatic-number-iii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 36703, "totalSubmissionRaw": 86996}, "249": {"acRate": 65.97485366861775, "difficulty": "Medium", "likes": 1670, "dislikes": 386, "categoryTitle": "Algorithms", "frontendQuestionId": "249", "paidOnly": true, "title": "Group Shifted Strings", "titleSlug": "group-shifted-strings", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 247408, "totalSubmissionRaw": 375004}, "250": {"acRate": 56.58115856970484, "difficulty": "Medium", "likes": 1205, "dislikes": 430, "categoryTitle": "Algorithms", "frontendQuestionId": "250", "paidOnly": true, "title": "Count Univalue Subtrees", "titleSlug": "count-univalue-subtrees", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 155214, "totalSubmissionRaw": 274321}, "251": {"acRate": 49.640531298203236, "difficulty": "Medium", "likes": 716, "dislikes": 404, "categoryTitle": "Algorithms", "frontendQuestionId": "251", "paidOnly": true, "title": "Flatten 2D Vector", "titleSlug": "flatten-2d-vector", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Iterator", "id": "VG9waWNUYWdOb2RlOjYxMDY0", "slug": "iterator"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 129049, "totalSubmissionRaw": 259967}, "252": {"acRate": 58.31236353172834, "difficulty": "Easy", "likes": 2036, "dislikes": 103, "categoryTitle": "Algorithms", "frontendQuestionId": "252", "paidOnly": true, "title": "Meeting Rooms", "titleSlug": "meeting-rooms", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 413409, "totalSubmissionRaw": 708956}, "253": {"acRate": 51.44973712668474, "difficulty": "Medium", "likes": 6952, "dislikes": 161, "categoryTitle": "Algorithms", "frontendQuestionId": "253", "paidOnly": true, "title": "Meeting Rooms II", "titleSlug": "meeting-rooms-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 922036, "totalSubmissionRaw": 1792113}, "254": {"acRate": 49.67916127441917, "difficulty": "Medium", "likes": 1132, "dislikes": 71, "categoryTitle": "Algorithms", "frontendQuestionId": "254", "paidOnly": true, "title": "Factor Combinations", "titleSlug": "factor-combinations", "topicTags": [{"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 128983, "totalSubmissionRaw": 259632}, "255": {"acRate": 50.15420247455354, "difficulty": "Medium", "likes": 1203, "dislikes": 89, "categoryTitle": "Algorithms", "frontendQuestionId": "255", "paidOnly": true, "title": "Verify Preorder Sequence in Binary Search Tree", "titleSlug": "verify-preorder-sequence-in-binary-search-tree", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 82288, "totalSubmissionRaw": 164070}, "256": {"acRate": 62.79323771036217, "difficulty": "Medium", "likes": 2296, "dislikes": 130, "categoryTitle": "Algorithms", "frontendQuestionId": "256", "paidOnly": true, "title": "Paint House", "titleSlug": "paint-house", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 212719, "totalSubmissionRaw": 338761}, "257": {"acRate": 64.43818351645275, "difficulty": "Easy", "likes": 6593, "dislikes": 300, "categoryTitle": "Algorithms", "frontendQuestionId": "257", "paidOnly": false, "title": "Binary Tree Paths", "titleSlug": "binary-tree-paths", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 759555, "totalSubmissionRaw": 1178734}, "258": {"acRate": 67.00135343552296, "difficulty": "Easy", "likes": 4852, "dislikes": 1938, "categoryTitle": "Algorithms", "frontendQuestionId": "258", "paidOnly": false, "title": "Add Digits", "titleSlug": "add-digits", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 830193, "totalSubmissionRaw": 1239069}, "259": {"acRate": 50.82041286143515, "difficulty": "Medium", "likes": 1558, "dislikes": 160, "categoryTitle": "Algorithms", "frontendQuestionId": "259", "paidOnly": true, "title": "3Sum Smaller", "titleSlug": "3sum-smaller", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 154088, "totalSubmissionRaw": 303201}, "260": {"acRate": 70.78677923477636, "difficulty": "Medium", "likes": 6366, "dislikes": 266, "categoryTitle": "Algorithms", "frontendQuestionId": "260", "paidOnly": false, "title": "Single Number III", "titleSlug": "single-number-iii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 472884, "totalSubmissionRaw": 668040}, "261": {"acRate": 48.42100873336646, "difficulty": "Medium", "likes": 3285, "dislikes": 104, "categoryTitle": "Algorithms", "frontendQuestionId": "261", "paidOnly": true, "title": "Graph Valid Tree", "titleSlug": "graph-valid-tree", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 417984, "totalSubmissionRaw": 863231}, "262": {"acRate": 36.529805686683495, "difficulty": "Hard", "likes": 1245, "dislikes": 669, "categoryTitle": "Database", "frontendQuestionId": "262", "paidOnly": false, "title": "Trips and Users", "titleSlug": "trips-and-users", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 192995, "totalSubmissionRaw": 528320}, "263": {"acRate": 42.01591804607266, "difficulty": "Easy", "likes": 3368, "dislikes": 1708, "categoryTitle": "Algorithms", "frontendQuestionId": "263", "paidOnly": false, "title": "Ugly Number", "titleSlug": "ugly-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 540724, "totalSubmissionRaw": 1286956}, "264": {"acRate": 46.31035215312511, "difficulty": "Medium", "likes": 5987, "dislikes": 318, "categoryTitle": "Algorithms", "frontendQuestionId": "264", "paidOnly": false, "title": "Ugly Number II", "titleSlug": "ugly-number-ii", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 352926, "totalSubmissionRaw": 762275}, "265": {"acRate": 54.994629430719655, "difficulty": "Hard", "likes": 1306, "dislikes": 37, "categoryTitle": "Algorithms", "frontendQuestionId": "265", "paidOnly": true, "title": "Paint House II", "titleSlug": "paint-house-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 125440, "totalSubmissionRaw": 228095}, "266": {"acRate": 67.61196694966154, "difficulty": "Easy", "likes": 1057, "dislikes": 72, "categoryTitle": "Algorithms", "frontendQuestionId": "266", "paidOnly": true, "title": "Palindrome Permutation", "titleSlug": "palindrome-permutation", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 208255, "totalSubmissionRaw": 308015}, "267": {"acRate": 41.791888258319354, "difficulty": "Medium", "likes": 885, "dislikes": 96, "categoryTitle": "Algorithms", "frontendQuestionId": "267", "paidOnly": true, "title": "Palindrome Permutation II", "titleSlug": "palindrome-permutation-ii", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 70253, "totalSubmissionRaw": 168102}, "268": {"acRate": 67.78583655717264, "difficulty": "Easy", "likes": 12215, "dislikes": 3340, "categoryTitle": "Algorithms", "frontendQuestionId": "268", "paidOnly": false, "title": "Missing Number", "titleSlug": "missing-number", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 2414347, "totalSubmissionRaw": 3561733}, "269": {"acRate": 35.91829923327594, "difficulty": "Hard", "likes": 4434, "dislikes": 994, "categoryTitle": "Algorithms", "frontendQuestionId": "269", "paidOnly": true, "title": "Alien Dictionary", "titleSlug": "alien-dictionary", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 391730, "totalSubmissionRaw": 1090614}, "270": {"acRate": 51.19888601118004, "difficulty": "Easy", "likes": 1812, "dislikes": 142, "categoryTitle": "Algorithms", "frontendQuestionId": "270", "paidOnly": true, "title": "Closest Binary Search Tree Value", "titleSlug": "closest-binary-search-tree-value", "topicTags": [{"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 357017, "totalSubmissionRaw": 697314}, "271": {"acRate": 47.39732127946203, "difficulty": "Medium", "likes": 1465, "dislikes": 412, "categoryTitle": "Algorithms", "frontendQuestionId": "271", "paidOnly": true, "title": "Encode and Decode Strings", "titleSlug": "encode-and-decode-strings", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 212859, "totalSubmissionRaw": 449092}, "272": {"acRate": 59.39026187785584, "difficulty": "Hard", "likes": 1294, "dislikes": 46, "categoryTitle": "Algorithms", "frontendQuestionId": "272", "paidOnly": true, "title": "Closest Binary Search Tree Value II", "titleSlug": "closest-binary-search-tree-value-ii", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 120877, "totalSubmissionRaw": 203530}, "273": {"acRate": 33.92681803921888, "difficulty": "Hard", "likes": 3594, "dislikes": 6687, "categoryTitle": "Algorithms", "frontendQuestionId": "273", "paidOnly": false, "title": "Integer to English Words", "titleSlug": "integer-to-english-words", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 499626, "totalSubmissionRaw": 1472654}, "274": {"acRate": 39.24190598766308, "difficulty": "Medium", "likes": 1325, "dislikes": 603, "categoryTitle": "Algorithms", "frontendQuestionId": "274", "paidOnly": false, "title": "H-Index", "titleSlug": "h-index", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting Sort", "id": "VG9waWNUYWdOb2RlOjYxMDcy", "slug": "counting-sort"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 528078, "totalSubmissionRaw": 1345710}, "275": {"acRate": 38.35009893567559, "difficulty": "Medium", "likes": 352, "dislikes": 99, "categoryTitle": "Algorithms", "frontendQuestionId": "275", "paidOnly": false, "title": "H-Index II", "titleSlug": "h-index-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 212807, "totalSubmissionRaw": 554906}, "276": {"acRate": 46.93933147111323, "difficulty": "Medium", "likes": 1559, "dislikes": 388, "categoryTitle": "Algorithms", "frontendQuestionId": "276", "paidOnly": true, "title": "Paint Fence", "titleSlug": "paint-fence", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 115444, "totalSubmissionRaw": 245943}, "277": {"acRate": 47.50355473601544, "difficulty": "Medium", "likes": 2843, "dislikes": 282, "categoryTitle": "Algorithms", "frontendQuestionId": "277", "paidOnly": true, "title": "Find the Celebrity", "titleSlug": "find-the-celebrity", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 274619, "totalSubmissionRaw": 578102}, "278": {"acRate": 44.74410738974844, "difficulty": "Easy", "likes": 8394, "dislikes": 3311, "categoryTitle": "Algorithms", "frontendQuestionId": "278", "paidOnly": false, "title": "First Bad Version", "titleSlug": "first-bad-version", "topicTags": [{"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 1738837, "totalSubmissionRaw": 3886181}, "279": {"acRate": 55.03752707994638, "difficulty": "Medium", "likes": 11215, "dislikes": 472, "categoryTitle": "Algorithms", "frontendQuestionId": "279", "paidOnly": false, "title": "Perfect Squares", "titleSlug": "perfect-squares", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 879525, "totalSubmissionRaw": 1598046}, "280": {"acRate": 67.80028501149923, "difficulty": "Medium", "likes": 1212, "dislikes": 102, "categoryTitle": "Algorithms", "frontendQuestionId": "280", "paidOnly": true, "title": "Wiggle Sort", "titleSlug": "wiggle-sort", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 144159, "totalSubmissionRaw": 212623}, "281": {"acRate": 64.23242265024253, "difficulty": "Medium", "likes": 681, "dislikes": 40, "categoryTitle": "Algorithms", "frontendQuestionId": "281", "paidOnly": true, "title": "Zigzag Iterator", "titleSlug": "zigzag-iterator", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Iterator", "id": "VG9waWNUYWdOb2RlOjYxMDY0", "slug": "iterator"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 95477, "totalSubmissionRaw": 148643}, "282": {"acRate": 40.17863425802764, "difficulty": "Hard", "likes": 3402, "dislikes": 629, "categoryTitle": "Algorithms", "frontendQuestionId": "282", "paidOnly": false, "title": "Expression Add Operators", "titleSlug": "expression-add-operators", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 234098, "totalSubmissionRaw": 582643}, "283": {"acRate": 61.99739155006581, "difficulty": "Easy", "likes": 16835, "dislikes": 467, "categoryTitle": "Algorithms", "frontendQuestionId": "283", "paidOnly": false, "title": "Move Zeroes", "titleSlug": "move-zeroes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 3229561, "totalSubmissionRaw": 5209185}, "284": {"acRate": 59.7900165776386, "difficulty": "Medium", "likes": 1857, "dislikes": 1038, "categoryTitle": "Algorithms", "frontendQuestionId": "284", "paidOnly": false, "title": "Peeking Iterator", "titleSlug": "peeking-iterator", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Iterator", "id": "VG9waWNUYWdOb2RlOjYxMDY0", "slug": "iterator"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 223974, "totalSubmissionRaw": 374601}, "285": {"acRate": 50.037250264010325, "difficulty": "Medium", "likes": 2572, "dislikes": 92, "categoryTitle": "Algorithms", "frontendQuestionId": "285", "paidOnly": true, "title": "Inorder Successor in BST", "titleSlug": "inorder-successor-in-bst", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 337832, "totalSubmissionRaw": 675162}, "286": {"acRate": 61.72090220385675, "difficulty": "Medium", "likes": 3137, "dislikes": 65, "categoryTitle": "Algorithms", "frontendQuestionId": "286", "paidOnly": true, "title": "Walls and Gates", "titleSlug": "walls-and-gates", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 329786, "totalSubmissionRaw": 534324}, "287": {"acRate": 61.388468381803364, "difficulty": "Medium", "likes": 23384, "dislikes": 4690, "categoryTitle": "Algorithms", "frontendQuestionId": "287", "paidOnly": false, "title": "Find the Duplicate Number", "titleSlug": "find-the-duplicate-number", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1845508, "totalSubmissionRaw": 3006280}, "288": {"acRate": 26.45462482849557, "difficulty": "Medium", "likes": 203, "dislikes": 1822, "categoryTitle": "Algorithms", "frontendQuestionId": "288", "paidOnly": true, "title": "Unique Word Abbreviation", "titleSlug": "unique-word-abbreviation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 74233, "totalSubmissionRaw": 280605}, "289": {"acRate": 69.83645358644122, "difficulty": "Medium", "likes": 6370, "dislikes": 575, "categoryTitle": "Algorithms", "frontendQuestionId": "289", "paidOnly": false, "title": "Game of Life", "titleSlug": "game-of-life", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 493926, "totalSubmissionRaw": 707261}, "290": {"acRate": 42.31701379080664, "difficulty": "Easy", "likes": 7284, "dislikes": 1037, "categoryTitle": "Algorithms", "frontendQuestionId": "290", "paidOnly": false, "title": "Word Pattern", "titleSlug": "word-pattern", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 770005, "totalSubmissionRaw": 1819609}, "291": {"acRate": 48.32592408368826, "difficulty": "Medium", "likes": 917, "dislikes": 74, "categoryTitle": "Algorithms", "frontendQuestionId": "291", "paidOnly": true, "title": "Word Pattern II", "titleSlug": "word-pattern-ii", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 77725, "totalSubmissionRaw": 160835}, "292": {"acRate": 57.15130384252197, "difficulty": "Easy", "likes": 1731, "dislikes": 2695, "categoryTitle": "Algorithms", "frontendQuestionId": "292", "paidOnly": false, "title": "Nim Game", "titleSlug": "nim-game", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Brainteaser", "id": "VG9waWNUYWdOb2RlOjMy", "slug": "brainteaser"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 393401, "totalSubmissionRaw": 688350}, "293": {"acRate": 64.67989250023918, "difficulty": "Easy", "likes": 227, "dislikes": 466, "categoryTitle": "Algorithms", "frontendQuestionId": "293", "paidOnly": true, "title": "Flip Game", "titleSlug": "flip-game", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 74367, "totalSubmissionRaw": 114977}, "294": {"acRate": 52.1504081945326, "difficulty": "Medium", "likes": 621, "dislikes": 63, "categoryTitle": "Algorithms", "frontendQuestionId": "294", "paidOnly": true, "title": "Flip Game II", "titleSlug": "flip-game-ii", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 71481, "totalSubmissionRaw": 137067}, "295": {"acRate": 52.23057114377585, "difficulty": "Hard", "likes": 11962, "dislikes": 243, "categoryTitle": "Algorithms", "frontendQuestionId": "295", "paidOnly": false, "title": "Find Median from Data Stream", "titleSlug": "find-median-from-data-stream", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Data Stream", "id": "VG9waWNUYWdOb2RlOjYxMDYz", "slug": "data-stream"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 835240, "totalSubmissionRaw": 1599140}, "296": {"acRate": 60.97774675176658, "difficulty": "Hard", "likes": 1181, "dislikes": 104, "categoryTitle": "Algorithms", "frontendQuestionId": "296", "paidOnly": true, "title": "Best Meeting Point", "titleSlug": "best-meeting-point", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 85603, "totalSubmissionRaw": 140384}, "297": {"acRate": 57.33530970102182, "difficulty": "Hard", "likes": 10210, "dislikes": 398, "categoryTitle": "Algorithms", "frontendQuestionId": "297", "paidOnly": false, "title": "Serialize and Deserialize Binary Tree", "titleSlug": "serialize-and-deserialize-binary-tree", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 908994, "totalSubmissionRaw": 1585397}, "298": {"acRate": 53.68643901113245, "difficulty": "Medium", "likes": 1140, "dislikes": 238, "categoryTitle": "Algorithms", "frontendQuestionId": "298", "paidOnly": true, "title": "Binary Tree Longest Consecutive Sequence", "titleSlug": "binary-tree-longest-consecutive-sequence", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 150125, "totalSubmissionRaw": 279633}, "299": {"acRate": 50.54590695386828, "difficulty": "Medium", "likes": 2440, "dislikes": 1783, "categoryTitle": "Algorithms", "frontendQuestionId": "299", "paidOnly": false, "title": "Bulls and Cows", "titleSlug": "bulls-and-cows", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 382307, "totalSubmissionRaw": 756356}, "300": {"acRate": 56.067309780060704, "difficulty": "Medium", "likes": 20946, "dislikes": 447, "categoryTitle": "Algorithms", "frontendQuestionId": "300", "paidOnly": false, "title": "Longest Increasing Subsequence", "titleSlug": "longest-increasing-subsequence", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1799814, "totalSubmissionRaw": 3210096}, "301": {"acRate": 48.461012086154284, "difficulty": "Hard", "likes": 5862, "dislikes": 286, "categoryTitle": "Algorithms", "frontendQuestionId": "301", "paidOnly": false, "title": "Remove Invalid Parentheses", "titleSlug": "remove-invalid-parentheses", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 440498, "totalSubmissionRaw": 908974}, "302": {"acRate": 59.07130585196526, "difficulty": "Hard", "likes": 528, "dislikes": 101, "categoryTitle": "Algorithms", "frontendQuestionId": "302", "paidOnly": true, "title": "Smallest Rectangle Enclosing Black Pixels", "titleSlug": "smallest-rectangle-enclosing-black-pixels", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 50542, "totalSubmissionRaw": 85561}, "303": {"acRate": 64.50693773219301, "difficulty": "Easy", "likes": 3258, "dislikes": 1913, "categoryTitle": "Algorithms", "frontendQuestionId": "303", "paidOnly": false, "title": "Range Sum Query - Immutable", "titleSlug": "range-sum-query-immutable", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 563270, "totalSubmissionRaw": 873193}, "304": {"acRate": 55.09573684939395, "difficulty": "Medium", "likes": 4975, "dislikes": 345, "categoryTitle": "Algorithms", "frontendQuestionId": "304", "paidOnly": false, "title": "Range Sum Query 2D - Immutable", "titleSlug": "range-sum-query-2d-immutable", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 377952, "totalSubmissionRaw": 685993}, "305": {"acRate": 39.9058879078839, "difficulty": "Hard", "likes": 1867, "dislikes": 72, "categoryTitle": "Algorithms", "frontendQuestionId": "305", "paidOnly": true, "title": "Number of Islands II", "titleSlug": "number-of-islands-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 148748, "totalSubmissionRaw": 372747}, "306": {"acRate": 31.91338762203899, "difficulty": "Medium", "likes": 1175, "dislikes": 802, "categoryTitle": "Algorithms", "frontendQuestionId": "306", "paidOnly": false, "title": "Additive Number", "titleSlug": "additive-number", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 93781, "totalSubmissionRaw": 293861}, "307": {"acRate": 41.21667340342523, "difficulty": "Medium", "likes": 4765, "dislikes": 256, "categoryTitle": "Algorithms", "frontendQuestionId": "307", "paidOnly": false, "title": "Range Sum Query - Mutable", "titleSlug": "range-sum-query-mutable", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 278375, "totalSubmissionRaw": 675394}, "308": {"acRate": 44.22561545652851, "difficulty": "Hard", "likes": 800, "dislikes": 93, "categoryTitle": "Algorithms", "frontendQuestionId": "308", "paidOnly": true, "title": "Range Sum Query 2D - Mutable", "titleSlug": "range-sum-query-2d-mutable", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 78056, "totalSubmissionRaw": 176495}, "309": {"acRate": 58.904573968496024, "difficulty": "Medium", "likes": 9412, "dislikes": 324, "categoryTitle": "Algorithms", "frontendQuestionId": "309", "paidOnly": false, "title": "Best Time to Buy and Sell Stock with Cooldown", "titleSlug": "best-time-to-buy-and-sell-stock-with-cooldown", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 543873, "totalSubmissionRaw": 923312}, "310": {"acRate": 41.83262778589875, "difficulty": "Medium", "likes": 8263, "dislikes": 383, "categoryTitle": "Algorithms", "frontendQuestionId": "310", "paidOnly": false, "title": "Minimum Height Trees", "titleSlug": "minimum-height-trees", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 385194, "totalSubmissionRaw": 920798}, "311": {"acRate": 68.21632912861378, "difficulty": "Medium", "likes": 1063, "dislikes": 360, "categoryTitle": "Algorithms", "frontendQuestionId": "311", "paidOnly": true, "title": "Sparse Matrix Multiplication", "titleSlug": "sparse-matrix-multiplication", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 193982, "totalSubmissionRaw": 284364}, "312": {"acRate": 59.59740584570966, "difficulty": "Hard", "likes": 8997, "dislikes": 252, "categoryTitle": "Algorithms", "frontendQuestionId": "312", "paidOnly": false, "title": "Burst Balloons", "titleSlug": "burst-balloons", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 302610, "totalSubmissionRaw": 507757}, "313": {"acRate": 45.29205695919393, "difficulty": "Medium", "likes": 2163, "dislikes": 387, "categoryTitle": "Algorithms", "frontendQuestionId": "313", "paidOnly": false, "title": "Super Ugly Number", "titleSlug": "super-ugly-number", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 131616, "totalSubmissionRaw": 290592}, "314": {"acRate": 54.92997145454661, "difficulty": "Medium", "likes": 3258, "dislikes": 331, "categoryTitle": "Algorithms", "frontendQuestionId": "314", "paidOnly": true, "title": "Binary Tree Vertical Order Traversal", "titleSlug": "binary-tree-vertical-order-traversal", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 432005, "totalSubmissionRaw": 786465}, "315": {"acRate": 42.56042682413577, "difficulty": "Hard", "likes": 8846, "dislikes": 244, "categoryTitle": "Algorithms", "frontendQuestionId": "315", "paidOnly": false, "title": "Count of Smaller Numbers After Self", "titleSlug": "count-of-smaller-numbers-after-self", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Merge Sort", "id": "VG9waWNUYWdOb2RlOjYxMDUx", "slug": "merge-sort"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 328655, "totalSubmissionRaw": 772208}, "316": {"acRate": 50.01916013060944, "difficulty": "Medium", "likes": 8676, "dislikes": 634, "categoryTitle": "Algorithms", "frontendQuestionId": "316", "paidOnly": false, "title": "Remove Duplicate Letters", "titleSlug": "remove-duplicate-letters", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 343291, "totalSubmissionRaw": 686318}, "317": {"acRate": 43.42493085925912, "difficulty": "Hard", "likes": 1875, "dislikes": 302, "categoryTitle": "Algorithms", "frontendQuestionId": "317", "paidOnly": true, "title": "Shortest Distance from All Buildings", "titleSlug": "shortest-distance-from-all-buildings", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 181511, "totalSubmissionRaw": 417988}, "318": {"acRate": 60.083729584453174, "difficulty": "Medium", "likes": 3508, "dislikes": 140, "categoryTitle": "Algorithms", "frontendQuestionId": "318", "paidOnly": false, "title": "Maximum Product of Word Lengths", "titleSlug": "maximum-product-of-word-lengths", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 220873, "totalSubmissionRaw": 367610}, "319": {"acRate": 53.01159318256523, "difficulty": "Medium", "likes": 2667, "dislikes": 3121, "categoryTitle": "Algorithms", "frontendQuestionId": "319", "paidOnly": false, "title": "Bulb Switcher", "titleSlug": "bulb-switcher", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Brainteaser", "id": "VG9waWNUYWdOb2RlOjMy", "slug": "brainteaser"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 227398, "totalSubmissionRaw": 428959}, "320": {"acRate": 58.645042714679555, "difficulty": "Medium", "likes": 683, "dislikes": 226, "categoryTitle": "Algorithms", "frontendQuestionId": "320", "paidOnly": true, "title": "Generalized Abbreviation", "titleSlug": "generalized-abbreviation", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 68922, "totalSubmissionRaw": 117524}, "321": {"acRate": 30.5937163436469, "difficulty": "Hard", "likes": 1937, "dislikes": 354, "categoryTitle": "Algorithms", "frontendQuestionId": "321", "paidOnly": false, "title": "Create Maximum Number", "titleSlug": "create-maximum-number", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 62778, "totalSubmissionRaw": 205199}, "322": {"acRate": 44.60426646974934, "difficulty": "Medium", "likes": 19008, "dislikes": 456, "categoryTitle": "Algorithms", "frontendQuestionId": "322", "paidOnly": false, "title": "Coin Change", "titleSlug": "coin-change", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 1915979, "totalSubmissionRaw": 4295507}, "323": {"acRate": 63.14295956908379, "difficulty": "Medium", "likes": 2677, "dislikes": 103, "categoryTitle": "Algorithms", "frontendQuestionId": "323", "paidOnly": true, "title": "Number of Connected Components in an Undirected Graph", "titleSlug": "number-of-connected-components-in-an-undirected-graph", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 417440, "totalSubmissionRaw": 661103}, "324": {"acRate": 34.670628291073655, "difficulty": "Medium", "likes": 3077, "dislikes": 960, "categoryTitle": "Algorithms", "frontendQuestionId": "324", "paidOnly": false, "title": "Wiggle Sort II", "titleSlug": "wiggle-sort-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Quickselect", "id": "VG9waWNUYWdOb2RlOjYxMDY5", "slug": "quickselect"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 163947, "totalSubmissionRaw": 472870}, "325": {"acRate": 49.595925815719, "difficulty": "Medium", "likes": 2040, "dislikes": 64, "categoryTitle": "Algorithms", "frontendQuestionId": "325", "paidOnly": true, "title": "Maximum Size Subarray Sum Equals k", "titleSlug": "maximum-size-subarray-sum-equals-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 188343, "totalSubmissionRaw": 379756}, "326": {"acRate": 46.912418908131485, "difficulty": "Easy", "likes": 3104, "dislikes": 278, "categoryTitle": "Algorithms", "frontendQuestionId": "326", "paidOnly": false, "title": "Power of Three", "titleSlug": "power-of-three", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 876223, "totalSubmissionRaw": 1867787}, "327": {"acRate": 36.06331039807434, "difficulty": "Hard", "likes": 2312, "dislikes": 244, "categoryTitle": "Algorithms", "frontendQuestionId": "327", "paidOnly": false, "title": "Count of Range Sum", "titleSlug": "count-of-range-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Merge Sort", "id": "VG9waWNUYWdOb2RlOjYxMDUx", "slug": "merge-sort"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 79406, "totalSubmissionRaw": 220185}, "328": {"acRate": 61.55511630356515, "difficulty": "Medium", "likes": 10038, "dislikes": 534, "categoryTitle": "Algorithms", "frontendQuestionId": "328", "paidOnly": false, "title": "Odd Even Linked List", "titleSlug": "odd-even-linked-list", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 999327, "totalSubmissionRaw": 1623467}, "329": {"acRate": 53.968197375926984, "difficulty": "Hard", "likes": 8983, "dislikes": 136, "categoryTitle": "Algorithms", "frontendQuestionId": "329", "paidOnly": false, "title": "Longest Increasing Path in a Matrix", "titleSlug": "longest-increasing-path-in-a-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 544929, "totalSubmissionRaw": 1009724}, "330": {"acRate": 53.13951896002913, "difficulty": "Hard", "likes": 2306, "dislikes": 192, "categoryTitle": "Algorithms", "frontendQuestionId": "330", "paidOnly": false, "title": "Patching Array", "titleSlug": "patching-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 159096, "totalSubmissionRaw": 299393}, "331": {"acRate": 45.45036214297871, "difficulty": "Medium", "likes": 2335, "dislikes": 124, "categoryTitle": "Algorithms", "frontendQuestionId": "331", "paidOnly": false, "title": "Verify Preorder Serialization of a Binary Tree", "titleSlug": "verify-preorder-serialization-of-a-binary-tree", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 144204, "totalSubmissionRaw": 317278}, "332": {"acRate": 43.26364646765079, "difficulty": "Hard", "likes": 5897, "dislikes": 1873, "categoryTitle": "Algorithms", "frontendQuestionId": "332", "paidOnly": false, "title": "Reconstruct Itinerary", "titleSlug": "reconstruct-itinerary", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Eulerian Circuit", "id": "VG9waWNUYWdOb2RlOjYxMDc0", "slug": "eulerian-circuit"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 442193, "totalSubmissionRaw": 1022092}, "333": {"acRate": 44.178505002565416, "difficulty": "Medium", "likes": 1490, "dislikes": 131, "categoryTitle": "Algorithms", "frontendQuestionId": "333", "paidOnly": true, "title": "Largest BST Subtree", "titleSlug": "largest-bst-subtree", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 110213, "totalSubmissionRaw": 249472}, "334": {"acRate": 39.50047064850343, "difficulty": "Medium", "likes": 8142, "dislikes": 549, "categoryTitle": "Algorithms", "frontendQuestionId": "334", "paidOnly": false, "title": "Increasing Triplet Subsequence", "titleSlug": "increasing-triplet-subsequence", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 621479, "totalSubmissionRaw": 1573342}, "335": {"acRate": 30.826665285582344, "difficulty": "Hard", "likes": 386, "dislikes": 510, "categoryTitle": "Algorithms", "frontendQuestionId": "335", "paidOnly": false, "title": "Self Crossing", "titleSlug": "self-crossing", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 35713, "totalSubmissionRaw": 115851}, "336": {"acRate": 35.515227550944495, "difficulty": "Hard", "likes": 4469, "dislikes": 468, "categoryTitle": "Algorithms", "frontendQuestionId": "336", "paidOnly": false, "title": "Palindrome Pairs", "titleSlug": "palindrome-pairs", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 210047, "totalSubmissionRaw": 591428}, "337": {"acRate": 54.37681311504383, "difficulty": "Medium", "likes": 8543, "dislikes": 143, "categoryTitle": "Algorithms", "frontendQuestionId": "337", "paidOnly": false, "title": "House Robber III", "titleSlug": "house-robber-iii", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 393817, "totalSubmissionRaw": 724237}, "338": {"acRate": 78.71086702195929, "difficulty": "Easy", "likes": 11142, "dislikes": 544, "categoryTitle": "Algorithms", "frontendQuestionId": "338", "paidOnly": false, "title": "Counting Bits", "titleSlug": "counting-bits", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1171345, "totalSubmissionRaw": 1488162}, "339": {"acRate": 84.07149027400423, "difficulty": "Medium", "likes": 1732, "dislikes": 424, "categoryTitle": "Algorithms", "frontendQuestionId": "339", "paidOnly": true, "title": "Nested List Weight Sum", "titleSlug": "nested-list-weight-sum", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 294889, "totalSubmissionRaw": 350760}, "340": {"acRate": 48.965552767946896, "difficulty": "Medium", "likes": 2834, "dislikes": 78, "categoryTitle": "Algorithms", "frontendQuestionId": "340", "paidOnly": true, "title": "Longest Substring with At Most K Distinct Characters", "titleSlug": "longest-substring-with-at-most-k-distinct-characters", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 351698, "totalSubmissionRaw": 718243}, "341": {"acRate": 64.70351798342759, "difficulty": "Medium", "likes": 4893, "dislikes": 1757, "categoryTitle": "Algorithms", "frontendQuestionId": "341", "paidOnly": false, "title": "Flatten Nested List Iterator", "titleSlug": "flatten-nested-list-iterator", "topicTags": [{"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Iterator", "id": "VG9waWNUYWdOb2RlOjYxMDY0", "slug": "iterator"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 460394, "totalSubmissionRaw": 711544}, "342": {"acRate": 48.296956019675115, "difficulty": "Easy", "likes": 3933, "dislikes": 398, "categoryTitle": "Algorithms", "frontendQuestionId": "342", "paidOnly": false, "title": "Power of Four", "titleSlug": "power-of-four", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 695963, "totalSubmissionRaw": 1441008}, "343": {"acRate": 60.56174957118353, "difficulty": "Medium", "likes": 5115, "dislikes": 448, "categoryTitle": "Algorithms", "frontendQuestionId": "343", "paidOnly": false, "title": "Integer Break", "titleSlug": "integer-break", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 367197, "totalSubmissionRaw": 606319}, "344": {"acRate": 78.89585605543229, "difficulty": "Easy", "likes": 8673, "dislikes": 1180, "categoryTitle": "Algorithms", "frontendQuestionId": "344", "paidOnly": false, "title": "Reverse String", "titleSlug": "reverse-string", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 2786447, "totalSubmissionRaw": 3531804}, "345": {"acRate": 53.96352475357907, "difficulty": "Easy", "likes": 4603, "dislikes": 2791, "categoryTitle": "Algorithms", "frontendQuestionId": "345", "paidOnly": false, "title": "Reverse Vowels of a String", "titleSlug": "reverse-vowels-of-a-string", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 948716, "totalSubmissionRaw": 1758068}, "346": {"acRate": 78.72218483975963, "difficulty": "Easy", "likes": 1660, "dislikes": 171, "categoryTitle": "Algorithms", "frontendQuestionId": "346", "paidOnly": true, "title": "Moving Average from Data Stream", "titleSlug": "moving-average-from-data-stream", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Data Stream", "id": "VG9waWNUYWdOb2RlOjYxMDYz", "slug": "data-stream"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 402451, "totalSubmissionRaw": 511230}, "347": {"acRate": 63.140479545128954, "difficulty": "Medium", "likes": 17418, "dislikes": 663, "categoryTitle": "Algorithms", "frontendQuestionId": "347", "paidOnly": false, "title": "Top K Frequent Elements", "titleSlug": "top-k-frequent-elements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Bucket Sort", "id": "VG9waWNUYWdOb2RlOjYxMDYw", "slug": "bucket-sort"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}, {"name": "Quickselect", "id": "VG9waWNUYWdOb2RlOjYxMDY5", "slug": "quickselect"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 2269801, "totalSubmissionRaw": 3594842}, "348": {"acRate": 58.16093229488148, "difficulty": "Medium", "likes": 2068, "dislikes": 116, "categoryTitle": "Algorithms", "frontendQuestionId": "348", "paidOnly": true, "title": "Design Tic-Tac-Toe", "titleSlug": "design-tic-tac-toe", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 251585, "totalSubmissionRaw": 432567}, "349": {"acRate": 75.03532560381049, "difficulty": "Easy", "likes": 6106, "dislikes": 2295, "categoryTitle": "Algorithms", "frontendQuestionId": "349", "paidOnly": false, "title": "Intersection of Two Arrays", "titleSlug": "intersection-of-two-arrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1282960, "totalSubmissionRaw": 1709808}, "350": {"acRate": 58.613451479888504, "difficulty": "Easy", "likes": 7693, "dislikes": 976, "categoryTitle": "Algorithms", "frontendQuestionId": "350", "paidOnly": false, "title": "Intersection of Two Arrays II", "titleSlug": "intersection-of-two-arrays-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1412647, "totalSubmissionRaw": 2410106}, "351": {"acRate": 52.831282879748144, "difficulty": "Medium", "likes": 182, "dislikes": 208, "categoryTitle": "Algorithms", "frontendQuestionId": "351", "paidOnly": true, "title": "Android Unlock Patterns", "titleSlug": "android-unlock-patterns", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 76524, "totalSubmissionRaw": 144846}, "352": {"acRate": 60.14480177883833, "difficulty": "Hard", "likes": 1737, "dislikes": 364, "categoryTitle": "Algorithms", "frontendQuestionId": "352", "paidOnly": false, "title": "Data Stream as Disjoint Intervals", "titleSlug": "data-stream-as-disjoint-intervals", "topicTags": [{"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 110901, "totalSubmissionRaw": 184390}, "353": {"acRate": 38.85071041994313, "difficulty": "Medium", "likes": 945, "dislikes": 334, "categoryTitle": "Algorithms", "frontendQuestionId": "353", "paidOnly": true, "title": "Design Snake Game", "titleSlug": "design-snake-game", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 86214, "totalSubmissionRaw": 221911}, "354": {"acRate": 37.074053956183235, "difficulty": "Hard", "likes": 5987, "dislikes": 148, "categoryTitle": "Algorithms", "frontendQuestionId": "354", "paidOnly": false, "title": "Russian Doll Envelopes", "titleSlug": "russian-doll-envelopes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 225236, "totalSubmissionRaw": 607528}, "355": {"acRate": 40.33008677027276, "difficulty": "Medium", "likes": 3936, "dislikes": 536, "categoryTitle": "Algorithms", "frontendQuestionId": "355", "paidOnly": false, "title": "Design Twitter", "titleSlug": "design-twitter", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 195072, "totalSubmissionRaw": 483683}, "356": {"acRate": 35.68503829087358, "difficulty": "Medium", "likes": 300, "dislikes": 622, "categoryTitle": "Algorithms", "frontendQuestionId": "356", "paidOnly": true, "title": "Line Reflection", "titleSlug": "line-reflection", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 41658, "totalSubmissionRaw": 116738}, "357": {"acRate": 53.295117275681115, "difficulty": "Medium", "likes": 1537, "dislikes": 1496, "categoryTitle": "Algorithms", "frontendQuestionId": "357", "paidOnly": false, "title": "Count Numbers with Unique Digits", "titleSlug": "count-numbers-with-unique-digits", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 144012, "totalSubmissionRaw": 270217}, "358": {"acRate": 38.932451582427966, "difficulty": "Hard", "likes": 964, "dislikes": 39, "categoryTitle": "Algorithms", "frontendQuestionId": "358", "paidOnly": true, "title": "Rearrange String k Distance Apart", "titleSlug": "rearrange-string-k-distance-apart", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 65936, "totalSubmissionRaw": 169360}, "359": {"acRate": 76.05583574150086, "difficulty": "Easy", "likes": 1737, "dislikes": 191, "categoryTitle": "Algorithms", "frontendQuestionId": "359", "paidOnly": true, "title": "Logger Rate Limiter", "titleSlug": "logger-rate-limiter", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Data Stream", "id": "VG9waWNUYWdOb2RlOjYxMDYz", "slug": "data-stream"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 330563, "totalSubmissionRaw": 434632}, "360": {"acRate": 56.00830302672326, "difficulty": "Medium", "likes": 673, "dislikes": 212, "categoryTitle": "Algorithms", "frontendQuestionId": "360", "paidOnly": true, "title": "Sort Transformed Array", "titleSlug": "sort-transformed-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 66376, "totalSubmissionRaw": 118511}, "361": {"acRate": 51.84902833183273, "difficulty": "Medium", "likes": 961, "dislikes": 116, "categoryTitle": "Algorithms", "frontendQuestionId": "361", "paidOnly": true, "title": "Bomb Enemy", "titleSlug": "bomb-enemy", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 78893, "totalSubmissionRaw": 152160}, "362": {"acRate": 68.80308177626789, "difficulty": "Medium", "likes": 2037, "dislikes": 232, "categoryTitle": "Algorithms", "frontendQuestionId": "362", "paidOnly": true, "title": "Design Hit Counter", "titleSlug": "design-hit-counter", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Data Stream", "id": "VG9waWNUYWdOb2RlOjYxMDYz", "slug": "data-stream"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 249513, "totalSubmissionRaw": 362648}, "363": {"acRate": 44.25071965956973, "difficulty": "Hard", "likes": 3460, "dislikes": 172, "categoryTitle": "Algorithms", "frontendQuestionId": "363", "paidOnly": false, "title": "Max Sum of Rectangle No Larger Than K", "titleSlug": "max-sum-of-rectangle-no-larger-than-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 127281, "totalSubmissionRaw": 287636}, "364": {"acRate": 64.81482344280703, "difficulty": "Medium", "likes": 1126, "dislikes": 455, "categoryTitle": "Algorithms", "frontendQuestionId": "364", "paidOnly": true, "title": "Nested List Weight Sum II", "titleSlug": "nested-list-weight-sum-ii", "topicTags": [{"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 139114, "totalSubmissionRaw": 214633}, "365": {"acRate": 41.30961911506605, "difficulty": "Medium", "likes": 1517, "dislikes": 1473, "categoryTitle": "Algorithms", "frontendQuestionId": "365", "paidOnly": false, "title": "Water and Jug Problem", "titleSlug": "water-and-jug-problem", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 107329, "totalSubmissionRaw": 259816}, "366": {"acRate": 80.69162119656423, "difficulty": "Medium", "likes": 3225, "dislikes": 58, "categoryTitle": "Algorithms", "frontendQuestionId": "366", "paidOnly": true, "title": "Find Leaves of Binary Tree", "titleSlug": "find-leaves-of-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 260128, "totalSubmissionRaw": 322373}, "367": {"acRate": 43.81350380259855, "difficulty": "Easy", "likes": 4255, "dislikes": 309, "categoryTitle": "Algorithms", "frontendQuestionId": "367", "paidOnly": false, "title": "Valid Perfect Square", "titleSlug": "valid-perfect-square", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 646038, "totalSubmissionRaw": 1474518}, "368": {"acRate": 45.58458717972108, "difficulty": "Medium", "likes": 5963, "dislikes": 283, "categoryTitle": "Algorithms", "frontendQuestionId": "368", "paidOnly": false, "title": "Largest Divisible Subset", "titleSlug": "largest-divisible-subset", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 309811, "totalSubmissionRaw": 679639}, "369": {"acRate": 61.09774583518729, "difficulty": "Medium", "likes": 943, "dislikes": 46, "categoryTitle": "Algorithms", "frontendQuestionId": "369", "paidOnly": true, "title": "Plus One Linked List", "titleSlug": "plus-one-linked-list", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 81015, "totalSubmissionRaw": 132599}, "370": {"acRate": 71.76167952866982, "difficulty": "Medium", "likes": 1640, "dislikes": 83, "categoryTitle": "Algorithms", "frontendQuestionId": "370", "paidOnly": true, "title": "Range Addition", "titleSlug": "range-addition", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 95128, "totalSubmissionRaw": 132561}, "371": {"acRate": 52.36176381639316, "difficulty": "Medium", "likes": 4227, "dislikes": 5556, "categoryTitle": "Algorithms", "frontendQuestionId": "371", "paidOnly": false, "title": "Sum of Two Integers", "titleSlug": "sum-of-two-integers", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 507296, "totalSubmissionRaw": 968830}, "372": {"acRate": 35.07230846598894, "difficulty": "Medium", "likes": 942, "dislikes": 1441, "categoryTitle": "Algorithms", "frontendQuestionId": "372", "paidOnly": false, "title": "Super Pow", "titleSlug": "super-pow", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 74623, "totalSubmissionRaw": 212769}, "373": {"acRate": 40.08904935349914, "difficulty": "Medium", "likes": 6285, "dislikes": 452, "categoryTitle": "Algorithms", "frontendQuestionId": "373", "paidOnly": false, "title": "Find K Pairs with Smallest Sums", "titleSlug": "find-k-pairs-with-smallest-sums", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 314224, "totalSubmissionRaw": 783827}, "374": {"acRate": 54.050863659258084, "difficulty": "Easy", "likes": 3771, "dislikes": 543, "categoryTitle": "Algorithms", "frontendQuestionId": "374", "paidOnly": false, "title": "Guess Number Higher or Lower", "titleSlug": "guess-number-higher-or-lower", "topicTags": [{"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 693233, "totalSubmissionRaw": 1282559}, "375": {"acRate": 49.67763527393308, "difficulty": "Medium", "likes": 2158, "dislikes": 2125, "categoryTitle": "Algorithms", "frontendQuestionId": "375", "paidOnly": false, "title": "Guess Number Higher or Lower II", "titleSlug": "guess-number-higher-or-lower-ii", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 129139, "totalSubmissionRaw": 259954}, "376": {"acRate": 48.57500807182864, "difficulty": "Medium", "likes": 5119, "dislikes": 165, "categoryTitle": "Algorithms", "frontendQuestionId": "376", "paidOnly": false, "title": "Wiggle Subsequence", "titleSlug": "wiggle-subsequence", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 251245, "totalSubmissionRaw": 517231}, "377": {"acRate": 54.25664055035353, "difficulty": "Medium", "likes": 7406, "dislikes": 664, "categoryTitle": "Algorithms", "frontendQuestionId": "377", "paidOnly": false, "title": "Combination Sum IV", "titleSlug": "combination-sum-iv", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 499704, "totalSubmissionRaw": 921003}, "378": {"acRate": 62.701059093395486, "difficulty": "Medium", "likes": 9947, "dislikes": 353, "categoryTitle": "Algorithms", "frontendQuestionId": "378", "paidOnly": false, "title": "Kth Smallest Element in a Sorted Matrix", "titleSlug": "kth-smallest-element-in-a-sorted-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 633881, "totalSubmissionRaw": 1010950}, "379": {"acRate": 51.85420262707731, "difficulty": "Medium", "likes": 353, "dislikes": 470, "categoryTitle": "Algorithms", "frontendQuestionId": "379", "paidOnly": true, "title": "Design Phone Directory", "titleSlug": "design-phone-directory", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 66992, "totalSubmissionRaw": 129193}, "380": {"acRate": 54.59285054030049, "difficulty": "Medium", "likes": 9242, "dislikes": 628, "categoryTitle": "Algorithms", "frontendQuestionId": "380", "paidOnly": false, "title": "Insert Delete GetRandom O(1)", "titleSlug": "insert-delete-getrandom-o1", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Randomized", "id": "VG9waWNUYWdOb2RlOjYxMDc1", "slug": "randomized"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 966812, "totalSubmissionRaw": 1770946}, "381": {"acRate": 35.566025414669305, "difficulty": "Hard", "likes": 2295, "dislikes": 151, "categoryTitle": "Algorithms", "frontendQuestionId": "381", "paidOnly": false, "title": "Insert Delete GetRandom O(1) - Duplicates allowed", "titleSlug": "insert-delete-getrandom-o1-duplicates-allowed", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Randomized", "id": "VG9waWNUYWdOb2RlOjYxMDc1", "slug": "randomized"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 147052, "totalSubmissionRaw": 413462}, "382": {"acRate": 63.353712863682446, "difficulty": "Medium", "likes": 3080, "dislikes": 705, "categoryTitle": "Algorithms", "frontendQuestionId": "382", "paidOnly": false, "title": "Linked List Random Node", "titleSlug": "linked-list-random-node", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Reservoir Sampling", "id": "VG9waWNUYWdOb2RlOjM2", "slug": "reservoir-sampling"}, {"name": "Randomized", "id": "VG9waWNUYWdOb2RlOjYxMDc1", "slug": "randomized"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 247452, "totalSubmissionRaw": 390588}, "383": {"acRate": 62.315477831509035, "difficulty": "Easy", "likes": 5024, "dislikes": 502, "categoryTitle": "Algorithms", "frontendQuestionId": "383", "paidOnly": false, "title": "Ransom Note", "titleSlug": "ransom-note", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 1254472, "totalSubmissionRaw": 2013101}, "384": {"acRate": 58.480439216543736, "difficulty": "Medium", "likes": 1351, "dislikes": 930, "categoryTitle": "Algorithms", "frontendQuestionId": "384", "paidOnly": false, "title": "Shuffle an Array", "titleSlug": "shuffle-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Randomized", "id": "VG9waWNUYWdOb2RlOjYxMDc1", "slug": "randomized"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 342348, "totalSubmissionRaw": 585406}, "385": {"acRate": 38.63003600318566, "difficulty": "Medium", "likes": 458, "dislikes": 1388, "categoryTitle": "Algorithms", "frontendQuestionId": "385", "paidOnly": false, "title": "Mini Parser", "titleSlug": "mini-parser", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 58691, "totalSubmissionRaw": 151931}, "386": {"acRate": 64.55835681823952, "difficulty": "Medium", "likes": 1975, "dislikes": 146, "categoryTitle": "Algorithms", "frontendQuestionId": "386", "paidOnly": false, "title": "Lexicographical Numbers", "titleSlug": "lexicographical-numbers", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 127138, "totalSubmissionRaw": 196935}, "387": {"acRate": 62.45181271263227, "difficulty": "Easy", "likes": 8989, "dislikes": 298, "categoryTitle": "Algorithms", "frontendQuestionId": "387", "paidOnly": false, "title": "First Unique Character in a String", "titleSlug": "first-unique-character-in-a-string", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 1778953, "totalSubmissionRaw": 2848520}, "388": {"acRate": 47.73130218004986, "difficulty": "Medium", "likes": 1291, "dislikes": 2500, "categoryTitle": "Algorithms", "frontendQuestionId": "388", "paidOnly": false, "title": "Longest Absolute File Path", "titleSlug": "longest-absolute-file-path", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 159108, "totalSubmissionRaw": 333341}, "389": {"acRate": 59.59159915071943, "difficulty": "Easy", "likes": 5007, "dislikes": 481, "categoryTitle": "Algorithms", "frontendQuestionId": "389", "paidOnly": false, "title": "Find the Difference", "titleSlug": "find-the-difference", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 769874, "totalSubmissionRaw": 1291918}, "390": {"acRate": 45.81583529652771, "difficulty": "Medium", "likes": 1560, "dislikes": 709, "categoryTitle": "Algorithms", "frontendQuestionId": "390", "paidOnly": false, "title": "Elimination Game", "titleSlug": "elimination-game", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 76041, "totalSubmissionRaw": 165971}, "391": {"acRate": 33.98496352760416, "difficulty": "Hard", "likes": 882, "dislikes": 119, "categoryTitle": "Algorithms", "frontendQuestionId": "391", "paidOnly": false, "title": "Perfect Rectangle", "titleSlug": "perfect-rectangle", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Line Sweep", "id": "VG9waWNUYWdOb2RlOjU2MTE5", "slug": "line-sweep"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 45565, "totalSubmissionRaw": 134074}, "392": {"acRate": 48.085275399547726, "difficulty": "Easy", "likes": 9678, "dislikes": 540, "categoryTitle": "Algorithms", "frontendQuestionId": "392", "paidOnly": false, "title": "Is Subsequence", "titleSlug": "is-subsequence", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1579883, "totalSubmissionRaw": 3285588}, "393": {"acRate": 45.223411177789025, "difficulty": "Medium", "likes": 905, "dislikes": 2865, "categoryTitle": "Algorithms", "frontendQuestionId": "393", "paidOnly": false, "title": "UTF-8 Validation", "titleSlug": "utf-8-validation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 125097, "totalSubmissionRaw": 276620}, "394": {"acRate": 59.64830647176632, "difficulty": "Medium", "likes": 12726, "dislikes": 620, "categoryTitle": "Algorithms", "frontendQuestionId": "394", "paidOnly": false, "title": "Decode String", "titleSlug": "decode-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 847332, "totalSubmissionRaw": 1420548}, "395": {"acRate": 45.036910238579225, "difficulty": "Medium", "likes": 6236, "dislikes": 517, "categoryTitle": "Algorithms", "frontendQuestionId": "395", "paidOnly": false, "title": "Longest Substring with At Least K Repeating Characters", "titleSlug": "longest-substring-with-at-least-k-repeating-characters", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 231528, "totalSubmissionRaw": 514085}, "396": {"acRate": 42.8652417662821, "difficulty": "Medium", "likes": 1565, "dislikes": 268, "categoryTitle": "Algorithms", "frontendQuestionId": "396", "paidOnly": false, "title": "Rotate Function", "titleSlug": "rotate-function", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 88464, "totalSubmissionRaw": 206377}, "397": {"acRate": 36.01827551029305, "difficulty": "Medium", "likes": 1334, "dislikes": 479, "categoryTitle": "Algorithms", "frontendQuestionId": "397", "paidOnly": false, "title": "Integer Replacement", "titleSlug": "integer-replacement", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 123927, "totalSubmissionRaw": 344067}, "398": {"acRate": 63.704065998502976, "difficulty": "Medium", "likes": 1288, "dislikes": 1287, "categoryTitle": "Algorithms", "frontendQuestionId": "398", "paidOnly": false, "title": "Random Pick Index", "titleSlug": "random-pick-index", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Reservoir Sampling", "id": "VG9waWNUYWdOb2RlOjM2", "slug": "reservoir-sampling"}, {"name": "Randomized", "id": "VG9waWNUYWdOb2RlOjYxMDc1", "slug": "randomized"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 235749, "totalSubmissionRaw": 370069}, "399": {"acRate": 62.078491722793004, "difficulty": "Medium", "likes": 9328, "dislikes": 945, "categoryTitle": "Algorithms", "frontendQuestionId": "399", "paidOnly": false, "title": "Evaluate Division", "titleSlug": "evaluate-division", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 498183, "totalSubmissionRaw": 802505}, "400": {"acRate": 35.04382537140294, "difficulty": "Medium", "likes": 1079, "dislikes": 2060, "categoryTitle": "Algorithms", "frontendQuestionId": "400", "paidOnly": false, "title": "Nth Digit", "titleSlug": "nth-digit", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 99993, "totalSubmissionRaw": 285337}, "401": {"acRate": 54.96720967010605, "difficulty": "Easy", "likes": 1400, "dislikes": 2573, "categoryTitle": "Algorithms", "frontendQuestionId": "401", "paidOnly": false, "title": "Binary Watch", "titleSlug": "binary-watch", "topicTags": [{"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 149109, "totalSubmissionRaw": 271269}, "402": {"acRate": 33.8133244850789, "difficulty": "Medium", "likes": 9517, "dislikes": 493, "categoryTitle": "Algorithms", "frontendQuestionId": "402", "paidOnly": false, "title": "Remove K Digits", "titleSlug": "remove-k-digits", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 507491, "totalSubmissionRaw": 1500861}, "403": {"acRate": 46.17071601861841, "difficulty": "Hard", "likes": 5588, "dislikes": 253, "categoryTitle": "Algorithms", "frontendQuestionId": "403", "paidOnly": false, "title": "Frog Jump", "titleSlug": "frog-jump", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 273477, "totalSubmissionRaw": 592317}, "404": {"acRate": 60.8859342543127, "difficulty": "Easy", "likes": 5490, "dislikes": 310, "categoryTitle": "Algorithms", "frontendQuestionId": "404", "paidOnly": false, "title": "Sum of Left Leaves", "titleSlug": "sum-of-left-leaves", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 640738, "totalSubmissionRaw": 1052358}, "405": {"acRate": 49.071097968629466, "difficulty": "Easy", "likes": 1314, "dislikes": 221, "categoryTitle": "Algorithms", "frontendQuestionId": "405", "paidOnly": false, "title": "Convert a Number to Hexadecimal", "titleSlug": "convert-a-number-to-hexadecimal", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 152669, "totalSubmissionRaw": 311119}, "406": {"acRate": 73.65895170859751, "difficulty": "Medium", "likes": 7083, "dislikes": 719, "categoryTitle": "Algorithms", "frontendQuestionId": "406", "paidOnly": false, "title": "Queue Reconstruction by Height", "titleSlug": "queue-reconstruction-by-height", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 307269, "totalSubmissionRaw": 417149}, "407": {"acRate": 48.1745636438783, "difficulty": "Hard", "likes": 3755, "dislikes": 95, "categoryTitle": "Algorithms", "frontendQuestionId": "407", "paidOnly": false, "title": "Trapping Rain Water II", "titleSlug": "trapping-rain-water-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 90915, "totalSubmissionRaw": 188721}, "408": {"acRate": 36.01760863989769, "difficulty": "Easy", "likes": 741, "dislikes": 2221, "categoryTitle": "Algorithms", "frontendQuestionId": "408", "paidOnly": true, "title": "Valid Word Abbreviation", "titleSlug": "valid-word-abbreviation", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 205035, "totalSubmissionRaw": 569265}, "409": {"acRate": 55.351320636681145, "difficulty": "Easy", "likes": 5921, "dislikes": 411, "categoryTitle": "Algorithms", "frontendQuestionId": "409", "paidOnly": false, "title": "Longest Palindrome", "titleSlug": "longest-palindrome", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 810463, "totalSubmissionRaw": 1464216}, "410": {"acRate": 56.153420109368255, "difficulty": "Hard", "likes": 9882, "dislikes": 226, "categoryTitle": "Algorithms", "frontendQuestionId": "410", "paidOnly": false, "title": "Split Array Largest Sum", "titleSlug": "split-array-largest-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 376142, "totalSubmissionRaw": 669847}, "411": {"acRate": 39.800139687315315, "difficulty": "Hard", "likes": 181, "dislikes": 146, "categoryTitle": "Algorithms", "frontendQuestionId": "411", "paidOnly": true, "title": "Minimum Unique Word Abbreviation", "titleSlug": "minimum-unique-word-abbreviation", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14816, "totalSubmissionRaw": 37226}, "412": {"acRate": 72.77219591446341, "difficulty": "Easy", "likes": 2789, "dislikes": 382, "categoryTitle": "Algorithms", "frontendQuestionId": "412", "paidOnly": false, "title": "Fizz Buzz", "titleSlug": "fizz-buzz", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 1302557, "totalSubmissionRaw": 1789914}, "413": {"acRate": 65.02267089606795, "difficulty": "Medium", "likes": 5355, "dislikes": 295, "categoryTitle": "Algorithms", "frontendQuestionId": "413", "paidOnly": false, "title": "Arithmetic Slices", "titleSlug": "arithmetic-slices", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 312194, "totalSubmissionRaw": 480131}, "414": {"acRate": 35.42261519355489, "difficulty": "Easy", "likes": 3045, "dislikes": 3183, "categoryTitle": "Algorithms", "frontendQuestionId": "414", "paidOnly": false, "title": "Third Maximum Number", "titleSlug": "third-maximum-number", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 567323, "totalSubmissionRaw": 1601585}, "415": {"acRate": 51.661055035868856, "difficulty": "Easy", "likes": 5046, "dislikes": 755, "categoryTitle": "Algorithms", "frontendQuestionId": "415", "paidOnly": false, "title": "Add Strings", "titleSlug": "add-strings", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 698893, "totalSubmissionRaw": 1352842}, "416": {"acRate": 46.63410248602246, "difficulty": "Medium", "likes": 12322, "dislikes": 252, "categoryTitle": "Algorithms", "frontendQuestionId": "416", "paidOnly": false, "title": "Partition Equal Subset Sum", "titleSlug": "partition-equal-subset-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 900481, "totalSubmissionRaw": 1930944}, "417": {"acRate": 55.78825282070095, "difficulty": "Medium", "likes": 7431, "dislikes": 1487, "categoryTitle": "Algorithms", "frontendQuestionId": "417", "paidOnly": false, "title": "Pacific Atlantic Water Flow", "titleSlug": "pacific-atlantic-water-flow", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 498805, "totalSubmissionRaw": 894104}, "418": {"acRate": 36.23650247403064, "difficulty": "Medium", "likes": 1119, "dislikes": 542, "categoryTitle": "Algorithms", "frontendQuestionId": "418", "paidOnly": true, "title": "Sentence Screen Fitting", "titleSlug": "sentence-screen-fitting", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 102454, "totalSubmissionRaw": 282737}, "419": {"acRate": 75.57939551144693, "difficulty": "Medium", "likes": 2300, "dislikes": 972, "categoryTitle": "Algorithms", "frontendQuestionId": "419", "paidOnly": false, "title": "Battleships in a Board", "titleSlug": "battleships-in-a-board", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 214452, "totalSubmissionRaw": 283744}, "420": {"acRate": 13.956350246440833, "difficulty": "Hard", "likes": 882, "dislikes": 1733, "categoryTitle": "Algorithms", "frontendQuestionId": "420", "paidOnly": false, "title": "Strong Password Checker", "titleSlug": "strong-password-checker", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 43663, "totalSubmissionRaw": 312854}, "421": {"acRate": 53.31887925283523, "difficulty": "Medium", "likes": 5530, "dislikes": 395, "categoryTitle": "Algorithms", "frontendQuestionId": "421", "paidOnly": false, "title": "Maximum XOR of Two Numbers in an Array", "titleSlug": "maximum-xor-of-two-numbers-in-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 169441, "totalSubmissionRaw": 317788}, "422": {"acRate": 41.343854945480174, "difficulty": "Easy", "likes": 429, "dislikes": 270, "categoryTitle": "Algorithms", "frontendQuestionId": "422", "paidOnly": true, "title": "Valid Word Square", "titleSlug": "valid-word-square", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 59832, "totalSubmissionRaw": 144718}, "423": {"acRate": 51.21834240653769, "difficulty": "Medium", "likes": 828, "dislikes": 2730, "categoryTitle": "Algorithms", "frontendQuestionId": "423", "paidOnly": false, "title": "Reconstruct Original Digits from English", "titleSlug": "reconstruct-original-digits-from-english", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 82229, "totalSubmissionRaw": 160546}, "424": {"acRate": 54.91225554245408, "difficulty": "Medium", "likes": 10764, "dislikes": 545, "categoryTitle": "Algorithms", "frontendQuestionId": "424", "paidOnly": false, "title": "Longest Repeating Character Replacement", "titleSlug": "longest-repeating-character-replacement", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 827083, "totalSubmissionRaw": 1506190}, "425": {"acRate": 53.50679457003278, "difficulty": "Hard", "likes": 1094, "dislikes": 73, "categoryTitle": "Algorithms", "frontendQuestionId": "425", "paidOnly": true, "title": "Word Squares", "titleSlug": "word-squares", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 75245, "totalSubmissionRaw": 140627}, "426": {"acRate": 64.88807646968155, "difficulty": "Medium", "likes": 2611, "dislikes": 214, "categoryTitle": "Algorithms", "frontendQuestionId": "426", "paidOnly": true, "title": "Convert Binary Search Tree to Sorted Doubly Linked List", "titleSlug": "convert-binary-search-tree-to-sorted-doubly-linked-list", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}, {"name": "Doubly-Linked List", "id": "VG9waWNUYWdOb2RlOjYxMDU4", "slug": "doubly-linked-list"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 298883, "totalSubmissionRaw": 460614}, "427": {"acRate": 75.8382625891169, "difficulty": "Medium", "likes": 1519, "dislikes": 1839, "categoryTitle": "Algorithms", "frontendQuestionId": "427", "paidOnly": false, "title": "Construct Quad Tree", "titleSlug": "construct-quad-tree", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 131159, "totalSubmissionRaw": 172946}, "428": {"acRate": 67.46987047118454, "difficulty": "Hard", "likes": 1050, "dislikes": 57, "categoryTitle": "Algorithms", "frontendQuestionId": "428", "paidOnly": true, "title": "Serialize and Deserialize N-ary Tree", "titleSlug": "serialize-and-deserialize-n-ary-tree", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 89853, "totalSubmissionRaw": 133175}, "429": {"acRate": 70.92010602044681, "difficulty": "Medium", "likes": 3622, "dislikes": 137, "categoryTitle": "Algorithms", "frontendQuestionId": "429", "paidOnly": false, "title": "N-ary Tree Level Order Traversal", "titleSlug": "n-ary-tree-level-order-traversal", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 312791, "totalSubmissionRaw": 441047}, "430": {"acRate": 60.36604743104294, "difficulty": "Medium", "likes": 5042, "dislikes": 327, "categoryTitle": "Algorithms", "frontendQuestionId": "430", "paidOnly": false, "title": "Flatten a Multilevel Doubly Linked List", "titleSlug": "flatten-a-multilevel-doubly-linked-list", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Doubly-Linked List", "id": "VG9waWNUYWdOb2RlOjYxMDU4", "slug": "doubly-linked-list"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 336225, "totalSubmissionRaw": 556977}, "431": {"acRate": 79.63103087954455, "difficulty": "Hard", "likes": 519, "dislikes": 29, "categoryTitle": "Algorithms", "frontendQuestionId": "431", "paidOnly": true, "title": "Encode N-ary Tree to Binary Tree", "titleSlug": "encode-n-ary-tree-to-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 22100, "totalSubmissionRaw": 27753}, "432": {"acRate": 37.048165107521946, "difficulty": "Hard", "likes": 1576, "dislikes": 174, "categoryTitle": "Algorithms", "frontendQuestionId": "432", "paidOnly": false, "title": "All O`one Data Structure", "titleSlug": "all-oone-data-structure", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Doubly-Linked List", "id": "VG9waWNUYWdOb2RlOjYxMDU4", "slug": "doubly-linked-list"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 84711, "totalSubmissionRaw": 228651}, "433": {"acRate": 54.25352519110128, "difficulty": "Medium", "likes": 2988, "dislikes": 323, "categoryTitle": "Algorithms", "frontendQuestionId": "433", "paidOnly": false, "title": "Minimum Genetic Mutation", "titleSlug": "minimum-genetic-mutation", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 180489, "totalSubmissionRaw": 332671}, "434": {"acRate": 36.37166838462671, "difficulty": "Easy", "likes": 791, "dislikes": 1265, "categoryTitle": "Algorithms", "frontendQuestionId": "434", "paidOnly": false, "title": "Number of Segments in a String", "titleSlug": "number-of-segments-in-a-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 192659, "totalSubmissionRaw": 529697}, "435": {"acRate": 53.89069605351883, "difficulty": "Medium", "likes": 8199, "dislikes": 222, "categoryTitle": "Algorithms", "frontendQuestionId": "435", "paidOnly": false, "title": "Non-overlapping Intervals", "titleSlug": "non-overlapping-intervals", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 617778, "totalSubmissionRaw": 1146354}, "436": {"acRate": 52.525145486175504, "difficulty": "Medium", "likes": 2155, "dislikes": 359, "categoryTitle": "Algorithms", "frontendQuestionId": "436", "paidOnly": false, "title": "Find Right Interval", "titleSlug": "find-right-interval", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 118959, "totalSubmissionRaw": 226481}, "437": {"acRate": 46.12384031761205, "difficulty": "Medium", "likes": 10990, "dislikes": 521, "categoryTitle": "Algorithms", "frontendQuestionId": "437", "paidOnly": false, "title": "Path Sum III", "titleSlug": "path-sum-iii", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 591566, "totalSubmissionRaw": 1282564}, "438": {"acRate": 51.179565003199336, "difficulty": "Medium", "likes": 12351, "dislikes": 341, "categoryTitle": "Algorithms", "frontendQuestionId": "438", "paidOnly": false, "title": "Find All Anagrams in a String", "titleSlug": "find-all-anagrams-in-a-string", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 903826, "totalSubmissionRaw": 1765990}, "439": {"acRate": 61.101278987027676, "difficulty": "Medium", "likes": 495, "dislikes": 68, "categoryTitle": "Algorithms", "frontendQuestionId": "439", "paidOnly": true, "title": "Ternary Expression Parser", "titleSlug": "ternary-expression-parser", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 33489, "totalSubmissionRaw": 54809}, "440": {"acRate": 32.59760923666925, "difficulty": "Hard", "likes": 769, "dislikes": 89, "categoryTitle": "Algorithms", "frontendQuestionId": "440", "paidOnly": false, "title": "K-th Smallest in Lexicographical Order", "titleSlug": "k-th-smallest-in-lexicographical-order", "topicTags": [{"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23970, "totalSubmissionRaw": 73533}, "441": {"acRate": 46.780898585114265, "difficulty": "Easy", "likes": 3890, "dislikes": 1330, "categoryTitle": "Algorithms", "frontendQuestionId": "441", "paidOnly": false, "title": "Arranging Coins", "titleSlug": "arranging-coins", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 460143, "totalSubmissionRaw": 983613}, "442": {"acRate": 75.8791938611771, "difficulty": "Medium", "likes": 10468, "dislikes": 405, "categoryTitle": "Algorithms", "frontendQuestionId": "442", "paidOnly": false, "title": "Find All Duplicates in an Array", "titleSlug": "find-all-duplicates-in-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 807193, "totalSubmissionRaw": 1063787}, "443": {"acRate": 55.413698530550846, "difficulty": "Medium", "likes": 5089, "dislikes": 7975, "categoryTitle": "Algorithms", "frontendQuestionId": "443", "paidOnly": false, "title": "String Compression", "titleSlug": "string-compression", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 640282, "totalSubmissionRaw": 1155444}, "444": {"acRate": 28.452912984570585, "difficulty": "Medium", "likes": 571, "dislikes": 1510, "categoryTitle": "Algorithms", "frontendQuestionId": "444", "paidOnly": true, "title": "Sequence Reconstruction", "titleSlug": "sequence-reconstruction", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 56281, "totalSubmissionRaw": 197804}, "445": {"acRate": 61.32175552033383, "difficulty": "Medium", "likes": 5895, "dislikes": 289, "categoryTitle": "Algorithms", "frontendQuestionId": "445", "paidOnly": false, "title": "Add Two Numbers II", "titleSlug": "add-two-numbers-ii", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 486712, "totalSubmissionRaw": 793702}, "446": {"acRate": 54.5856453123874, "difficulty": "Hard", "likes": 3353, "dislikes": 155, "categoryTitle": "Algorithms", "frontendQuestionId": "446", "paidOnly": false, "title": "Arithmetic Slices II - Subsequence", "titleSlug": "arithmetic-slices-ii-subsequence", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 151497, "totalSubmissionRaw": 277540}, "447": {"acRate": 55.66239549453188, "difficulty": "Medium", "likes": 838, "dislikes": 1015, "categoryTitle": "Algorithms", "frontendQuestionId": "447", "paidOnly": false, "title": "Number of Boomerangs", "titleSlug": "number-of-boomerangs", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 101998, "totalSubmissionRaw": 183244}, "448": {"acRate": 61.25443862190223, "difficulty": "Easy", "likes": 9442, "dislikes": 493, "categoryTitle": "Algorithms", "frontendQuestionId": "448", "paidOnly": false, "title": "Find All Numbers Disappeared in an Array", "titleSlug": "find-all-numbers-disappeared-in-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 925311, "totalSubmissionRaw": 1510603}, "449": {"acRate": 57.88739767866578, "difficulty": "Medium", "likes": 3489, "dislikes": 171, "categoryTitle": "Algorithms", "frontendQuestionId": "449", "paidOnly": false, "title": "Serialize and Deserialize BST", "titleSlug": "serialize-and-deserialize-bst", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 239944, "totalSubmissionRaw": 414502}, "450": {"acRate": 51.806293833880524, "difficulty": "Medium", "likes": 9177, "dislikes": 287, "categoryTitle": "Algorithms", "frontendQuestionId": "450", "paidOnly": false, "title": "Delete Node in a BST", "titleSlug": "delete-node-in-a-bst", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 548022, "totalSubmissionRaw": 1057829}, "451": {"acRate": 72.90457164817019, "difficulty": "Medium", "likes": 8333, "dislikes": 293, "categoryTitle": "Algorithms", "frontendQuestionId": "451", "paidOnly": false, "title": "Sort Characters By Frequency", "titleSlug": "sort-characters-by-frequency", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Bucket Sort", "id": "VG9waWNUYWdOb2RlOjYxMDYw", "slug": "bucket-sort"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 779701, "totalSubmissionRaw": 1069482}, "452": {"acRate": 59.24275762092499, "difficulty": "Medium", "likes": 7483, "dislikes": 242, "categoryTitle": "Algorithms", "frontendQuestionId": "452", "paidOnly": false, "title": "Minimum Number of Arrows to Burst Balloons", "titleSlug": "minimum-number-of-arrows-to-burst-balloons", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 550882, "totalSubmissionRaw": 929873}, "453": {"acRate": 56.93181525463022, "difficulty": "Medium", "likes": 2579, "dislikes": 1893, "categoryTitle": "Algorithms", "frontendQuestionId": "453", "paidOnly": false, "title": "Minimum Moves to Equal Array Elements", "titleSlug": "minimum-moves-to-equal-array-elements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 176812, "totalSubmissionRaw": 310568}, "454": {"acRate": 57.343081595157585, "difficulty": "Medium", "likes": 4910, "dislikes": 143, "categoryTitle": "Algorithms", "frontendQuestionId": "454", "paidOnly": false, "title": "4Sum II", "titleSlug": "4sum-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 332708, "totalSubmissionRaw": 580205}, "455": {"acRate": 52.948736543117604, "difficulty": "Easy", "likes": 3974, "dislikes": 376, "categoryTitle": "Algorithms", "frontendQuestionId": "455", "paidOnly": false, "title": "Assign Cookies", "titleSlug": "assign-cookies", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 500149, "totalSubmissionRaw": 944591}, "456": {"acRate": 33.79277511943401, "difficulty": "Medium", "likes": 7218, "dislikes": 437, "categoryTitle": "Algorithms", "frontendQuestionId": "456", "paidOnly": false, "title": "132 Pattern", "titleSlug": "132-pattern", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 264762, "totalSubmissionRaw": 783487}, "457": {"acRate": 34.417415575380076, "difficulty": "Medium", "likes": 692, "dislikes": 788, "categoryTitle": "Algorithms", "frontendQuestionId": "457", "paidOnly": false, "title": "Circular Array Loop", "titleSlug": "circular-array-loop", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 83603, "totalSubmissionRaw": 242909}, "458": {"acRate": 59.556373795057326, "difficulty": "Hard", "likes": 1788, "dislikes": 3356, "categoryTitle": "Algorithms", "frontendQuestionId": "458", "paidOnly": false, "title": "Poor Pigs", "titleSlug": "poor-pigs", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 120663, "totalSubmissionRaw": 202603}, "459": {"acRate": 46.22902646304176, "difficulty": "Easy", "likes": 6407, "dislikes": 522, "categoryTitle": "Algorithms", "frontendQuestionId": "459", "paidOnly": false, "title": "Repeated Substring Pattern", "titleSlug": "repeated-substring-pattern", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 466290, "totalSubmissionRaw": 1008652}, "460": {"acRate": 44.705587067208036, "difficulty": "Hard", "likes": 5689, "dislikes": 330, "categoryTitle": "Algorithms", "frontendQuestionId": "460", "paidOnly": false, "title": "LFU Cache", "titleSlug": "lfu-cache", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Doubly-Linked List", "id": "VG9waWNUYWdOb2RlOjYxMDU4", "slug": "doubly-linked-list"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 261826, "totalSubmissionRaw": 585670}, "461": {"acRate": 75.54148054715593, "difficulty": "Easy", "likes": 3841, "dislikes": 218, "categoryTitle": "Algorithms", "frontendQuestionId": "461", "paidOnly": false, "title": "Hamming Distance", "titleSlug": "hamming-distance", "topicTags": [{"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 586322, "totalSubmissionRaw": 776159}, "462": {"acRate": 60.30740034263544, "difficulty": "Medium", "likes": 3356, "dislikes": 124, "categoryTitle": "Algorithms", "frontendQuestionId": "462", "paidOnly": false, "title": "Minimum Moves to Equal Array Elements II", "titleSlug": "minimum-moves-to-equal-array-elements-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 186219, "totalSubmissionRaw": 308783}, "463": {"acRate": 73.01902529644092, "difficulty": "Easy", "likes": 6846, "dislikes": 387, "categoryTitle": "Algorithms", "frontendQuestionId": "463", "paidOnly": false, "title": "Island Perimeter", "titleSlug": "island-perimeter", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 654838, "totalSubmissionRaw": 896805}, "464": {"acRate": 29.766816799429535, "difficulty": "Medium", "likes": 2662, "dislikes": 400, "categoryTitle": "Algorithms", "frontendQuestionId": "464", "paidOnly": false, "title": "Can I Win", "titleSlug": "can-i-win", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 97681, "totalSubmissionRaw": 328154}, "465": {"acRate": 49.6075500883143, "difficulty": "Hard", "likes": 1460, "dislikes": 151, "categoryTitle": "Algorithms", "frontendQuestionId": "465", "paidOnly": true, "title": "Optimal Account Balancing", "titleSlug": "optimal-account-balancing", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 94930, "totalSubmissionRaw": 191362}, "466": {"acRate": 30.584691265530374, "difficulty": "Hard", "likes": 406, "dislikes": 359, "categoryTitle": "Algorithms", "frontendQuestionId": "466", "paidOnly": false, "title": "Count The Repetitions", "titleSlug": "count-the-repetitions", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19595, "totalSubmissionRaw": 64068}, "467": {"acRate": 40.05793864088513, "difficulty": "Medium", "likes": 1442, "dislikes": 175, "categoryTitle": "Algorithms", "frontendQuestionId": "467", "paidOnly": false, "title": "Unique Substrings in Wraparound String", "titleSlug": "unique-substrings-in-wraparound-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 45908, "totalSubmissionRaw": 114604}, "468": {"acRate": 27.29456671810282, "difficulty": "Medium", "likes": 1022, "dislikes": 2711, "categoryTitle": "Algorithms", "frontendQuestionId": "468", "paidOnly": false, "title": "Validate IP Address", "titleSlug": "validate-ip-address", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 168039, "totalSubmissionRaw": 615647}, "469": {"acRate": 39.52758205249899, "difficulty": "Medium", "likes": 99, "dislikes": 237, "categoryTitle": "Algorithms", "frontendQuestionId": "469", "paidOnly": true, "title": "Convex Polygon", "titleSlug": "convex-polygon", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10827, "totalSubmissionRaw": 27391}, "470": {"acRate": 45.81323840533757, "difficulty": "Medium", "likes": 1109, "dislikes": 376, "categoryTitle": "Algorithms", "frontendQuestionId": "470", "paidOnly": false, "title": "Implement Rand10() Using Rand7()", "titleSlug": "implement-rand10-using-rand7", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Rejection Sampling", "id": "VG9waWNUYWdOb2RlOjU0NTY5", "slug": "rejection-sampling"}, {"name": "Randomized", "id": "VG9waWNUYWdOb2RlOjYxMDc1", "slug": "randomized"}, {"name": "Probability and Statistics", "id": "VG9waWNUYWdOb2RlOjYxMDc5", "slug": "probability-and-statistics"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 85969, "totalSubmissionRaw": 187651}, "471": {"acRate": 50.4592385108947, "difficulty": "Hard", "likes": 625, "dislikes": 53, "categoryTitle": "Algorithms", "frontendQuestionId": "471", "paidOnly": true, "title": "Encode String with Shortest Length", "titleSlug": "encode-string-with-shortest-length", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30985, "totalSubmissionRaw": 61406}, "472": {"acRate": 49.36165097002861, "difficulty": "Hard", "likes": 3872, "dislikes": 283, "categoryTitle": "Algorithms", "frontendQuestionId": "472", "paidOnly": false, "title": "Concatenated Words", "titleSlug": "concatenated-words", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 229932, "totalSubmissionRaw": 465811}, "473": {"acRate": 40.39332570073689, "difficulty": "Medium", "likes": 3827, "dislikes": 297, "categoryTitle": "Algorithms", "frontendQuestionId": "473", "paidOnly": false, "title": "Matchsticks to Square", "titleSlug": "matchsticks-to-square", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 168998, "totalSubmissionRaw": 418381}, "474": {"acRate": 47.87999792212016, "difficulty": "Medium", "likes": 5444, "dislikes": 461, "categoryTitle": "Algorithms", "frontendQuestionId": "474", "paidOnly": false, "title": "Ones and Zeroes", "titleSlug": "ones-and-zeroes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 211993, "totalSubmissionRaw": 442759}, "475": {"acRate": 38.37657309712388, "difficulty": "Medium", "likes": 2113, "dislikes": 1166, "categoryTitle": "Algorithms", "frontendQuestionId": "475", "paidOnly": false, "title": "Heaters", "titleSlug": "heaters", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 123411, "totalSubmissionRaw": 321577}, "476": {"acRate": 67.71372178702158, "difficulty": "Easy", "likes": 2674, "dislikes": 124, "categoryTitle": "Algorithms", "frontendQuestionId": "476", "paidOnly": false, "title": "Number Complement", "titleSlug": "number-complement", "topicTags": [{"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 342043, "totalSubmissionRaw": 505131}, "477": {"acRate": 52.93333144831032, "difficulty": "Medium", "likes": 2215, "dislikes": 91, "categoryTitle": "Algorithms", "frontendQuestionId": "477", "paidOnly": false, "title": "Total Hamming Distance", "titleSlug": "total-hamming-distance", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 112324, "totalSubmissionRaw": 212199}, "478": {"acRate": 40.02495547067732, "difficulty": "Medium", "likes": 456, "dislikes": 771, "categoryTitle": "Algorithms", "frontendQuestionId": "478", "paidOnly": false, "title": "Generate Random Point in a Circle", "titleSlug": "generate-random-point-in-a-circle", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}, {"name": "Rejection Sampling", "id": "VG9waWNUYWdOb2RlOjU0NTY5", "slug": "rejection-sampling"}, {"name": "Randomized", "id": "VG9waWNUYWdOb2RlOjYxMDc1", "slug": "randomized"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 42021, "totalSubmissionRaw": 104987}, "479": {"acRate": 33.600951134147316, "difficulty": "Hard", "likes": 177, "dislikes": 1560, "categoryTitle": "Algorithms", "frontendQuestionId": "479", "paidOnly": false, "title": "Largest Palindrome Product", "titleSlug": "largest-palindrome-product", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25153, "totalSubmissionRaw": 74858}, "480": {"acRate": 38.939449004108745, "difficulty": "Hard", "likes": 3223, "dislikes": 200, "categoryTitle": "Algorithms", "frontendQuestionId": "480", "paidOnly": false, "title": "Sliding Window Median", "titleSlug": "sliding-window-median", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 154288, "totalSubmissionRaw": 396227}, "481": {"acRate": 51.5288098428554, "difficulty": "Medium", "likes": 319, "dislikes": 1304, "categoryTitle": "Algorithms", "frontendQuestionId": "481", "paidOnly": false, "title": "Magical String", "titleSlug": "magical-string", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 38070, "totalSubmissionRaw": 73881}, "482": {"acRate": 44.00551936259872, "difficulty": "Easy", "likes": 1107, "dislikes": 1417, "categoryTitle": "Algorithms", "frontendQuestionId": "482", "paidOnly": false, "title": "License Key Formatting", "titleSlug": "license-key-formatting", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 289577, "totalSubmissionRaw": 658047}, "483": {"acRate": 41.32647575355722, "difficulty": "Hard", "likes": 388, "dislikes": 506, "categoryTitle": "Algorithms", "frontendQuestionId": "483", "paidOnly": false, "title": "Smallest Good Base", "titleSlug": "smallest-good-base", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23061, "totalSubmissionRaw": 55802}, "484": {"acRate": 66.9397753188614, "difficulty": "Medium", "likes": 701, "dislikes": 148, "categoryTitle": "Algorithms", "frontendQuestionId": "484", "paidOnly": true, "title": "Find Permutation", "titleSlug": "find-permutation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 39625, "totalSubmissionRaw": 59195}, "485": {"acRate": 60.14207918381717, "difficulty": "Easy", "likes": 5791, "dislikes": 457, "categoryTitle": "Algorithms", "frontendQuestionId": "485", "paidOnly": false, "title": "Max Consecutive Ones", "titleSlug": "max-consecutive-ones", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1284626, "totalSubmissionRaw": 2135983}, "486": {"acRate": 55.42684880234346, "difficulty": "Medium", "likes": 5844, "dislikes": 284, "categoryTitle": "Algorithms", "frontendQuestionId": "486", "paidOnly": false, "title": "Predict the Winner", "titleSlug": "predict-the-winner", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 240491, "totalSubmissionRaw": 433889}, "487": {"acRate": 50.48616052909375, "difficulty": "Medium", "likes": 1543, "dislikes": 26, "categoryTitle": "Algorithms", "frontendQuestionId": "487", "paidOnly": true, "title": "Max Consecutive Ones II", "titleSlug": "max-consecutive-ones-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 149695, "totalSubmissionRaw": 296507}, "488": {"acRate": 32.611692207897505, "difficulty": "Hard", "likes": 455, "dislikes": 493, "categoryTitle": "Algorithms", "frontendQuestionId": "488", "paidOnly": false, "title": "Zuma Game", "titleSlug": "zuma-game", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24132, "totalSubmissionRaw": 73998}, "489": {"acRate": 76.83878368024229, "difficulty": "Hard", "likes": 2774, "dislikes": 177, "categoryTitle": "Algorithms", "frontendQuestionId": "489", "paidOnly": true, "title": "Robot Room Cleaner", "titleSlug": "robot-room-cleaner", "topicTags": [{"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 169481, "totalSubmissionRaw": 220567}, "490": {"acRate": 58.308676872680195, "difficulty": "Medium", "likes": 1847, "dislikes": 184, "categoryTitle": "Algorithms", "frontendQuestionId": "490", "paidOnly": true, "title": "The Maze", "titleSlug": "the-maze", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 176572, "totalSubmissionRaw": 302824}, "491": {"acRate": 60.979976177218944, "difficulty": "Medium", "likes": 3649, "dislikes": 230, "categoryTitle": "Algorithms", "frontendQuestionId": "491", "paidOnly": false, "title": "Non-decreasing Subsequences", "titleSlug": "non-decreasing-subsequences", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 173038, "totalSubmissionRaw": 283762}, "492": {"acRate": 58.45645412130638, "difficulty": "Easy", "likes": 704, "dislikes": 389, "categoryTitle": "Algorithms", "frontendQuestionId": "492", "paidOnly": false, "title": "Construct the Rectangle", "titleSlug": "construct-the-rectangle", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 123287, "totalSubmissionRaw": 210904}, "493": {"acRate": 30.878627699026634, "difficulty": "Hard", "likes": 6198, "dislikes": 269, "categoryTitle": "Algorithms", "frontendQuestionId": "493", "paidOnly": false, "title": "Reverse Pairs", "titleSlug": "reverse-pairs", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Merge Sort", "id": "VG9waWNUYWdOb2RlOjYxMDUx", "slug": "merge-sort"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 199667, "totalSubmissionRaw": 646619}, "494": {"acRate": 47.31723648183777, "difficulty": "Medium", "likes": 10939, "dislikes": 362, "categoryTitle": "Algorithms", "frontendQuestionId": "494", "paidOnly": false, "title": "Target Sum", "titleSlug": "target-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 641661, "totalSubmissionRaw": 1356081}, "495": {"acRate": 56.66867271346487, "difficulty": "Easy", "likes": 1153, "dislikes": 129, "categoryTitle": "Algorithms", "frontendQuestionId": "495", "paidOnly": false, "title": "Teemo Attacking", "titleSlug": "teemo-attacking", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 158194, "totalSubmissionRaw": 279156}, "496": {"acRate": 72.8424286313925, "difficulty": "Easy", "likes": 8074, "dislikes": 771, "categoryTitle": "Algorithms", "frontendQuestionId": "496", "paidOnly": false, "title": "Next Greater Element I", "titleSlug": "next-greater-element-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 789598, "totalSubmissionRaw": 1083982}, "497": {"acRate": 40.18146777086593, "difficulty": "Medium", "likes": 482, "dislikes": 674, "categoryTitle": "Algorithms", "frontendQuestionId": "497", "paidOnly": false, "title": "Random Point in Non-overlapping Rectangles", "titleSlug": "random-point-in-non-overlapping-rectangles", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Reservoir Sampling", "id": "VG9waWNUYWdOb2RlOjM2", "slug": "reservoir-sampling"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}, {"name": "Randomized", "id": "VG9waWNUYWdOb2RlOjYxMDc1", "slug": "randomized"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 42115, "totalSubmissionRaw": 104812}, "498": {"acRate": 60.76673737214306, "difficulty": "Medium", "likes": 3454, "dislikes": 688, "categoryTitle": "Algorithms", "frontendQuestionId": "498", "paidOnly": false, "title": "Diagonal Traverse", "titleSlug": "diagonal-traverse", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 315699, "totalSubmissionRaw": 519526}, "499": {"acRate": 49.13827228159922, "difficulty": "Hard", "likes": 484, "dislikes": 72, "categoryTitle": "Algorithms", "frontendQuestionId": "499", "paidOnly": true, "title": "The Maze III", "titleSlug": "the-maze-iii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 32275, "totalSubmissionRaw": 65682}, "500": {"acRate": 71.0964354103976, "difficulty": "Easy", "likes": 1610, "dislikes": 1136, "categoryTitle": "Algorithms", "frontendQuestionId": "500", "paidOnly": false, "title": "Keyboard Row", "titleSlug": "keyboard-row", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 239103, "totalSubmissionRaw": 336308}, "501": {"acRate": 56.497148933437046, "difficulty": "Easy", "likes": 3899, "dislikes": 783, "categoryTitle": "Algorithms", "frontendQuestionId": "501", "paidOnly": false, "title": "Find Mode in Binary Search Tree", "titleSlug": "find-mode-in-binary-search-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 316662, "totalSubmissionRaw": 560492}, "502": {"acRate": 53.16184596797997, "difficulty": "Hard", "likes": 3796, "dislikes": 257, "categoryTitle": "Algorithms", "frontendQuestionId": "502", "paidOnly": false, "title": "IPO", "titleSlug": "ipo", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 232338, "totalSubmissionRaw": 437039}, "503": {"acRate": 64.50321293319992, "difficulty": "Medium", "likes": 8012, "dislikes": 196, "categoryTitle": "Algorithms", "frontendQuestionId": "503", "paidOnly": false, "title": "Next Greater Element II", "titleSlug": "next-greater-element-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 437053, "totalSubmissionRaw": 677570}, "504": {"acRate": 50.52153243342005, "difficulty": "Easy", "likes": 804, "dislikes": 230, "categoryTitle": "Algorithms", "frontendQuestionId": "504", "paidOnly": false, "title": "Base 7", "titleSlug": "base-7", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 139636, "totalSubmissionRaw": 276393}, "505": {"acRate": 53.54876839591077, "difficulty": "Medium", "likes": 1326, "dislikes": 57, "categoryTitle": "Algorithms", "frontendQuestionId": "505", "paidOnly": true, "title": "The Maze II", "titleSlug": "the-maze-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 109632, "totalSubmissionRaw": 204733}, "506": {"acRate": 71.98628487497348, "difficulty": "Easy", "likes": 1917, "dislikes": 126, "categoryTitle": "Algorithms", "frontendQuestionId": "506", "paidOnly": false, "title": "Relative Ranks", "titleSlug": "relative-ranks", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 301904, "totalSubmissionRaw": 419391}, "507": {"acRate": 41.66305794961761, "difficulty": "Easy", "likes": 1090, "dislikes": 1232, "categoryTitle": "Algorithms", "frontendQuestionId": "507", "paidOnly": false, "title": "Perfect Number", "titleSlug": "perfect-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 206849, "totalSubmissionRaw": 496482}, "508": {"acRate": 66.90464561070357, "difficulty": "Medium", "likes": 2261, "dislikes": 317, "categoryTitle": "Algorithms", "frontendQuestionId": "508", "paidOnly": false, "title": "Most Frequent Subtree Sum", "titleSlug": "most-frequent-subtree-sum", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 146562, "totalSubmissionRaw": 219063}, "509": {"acRate": 71.60140112200666, "difficulty": "Easy", "likes": 8209, "dislikes": 365, "categoryTitle": "Algorithms", "frontendQuestionId": "509", "paidOnly": false, "title": "Fibonacci Number", "titleSlug": "fibonacci-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1936787, "totalSubmissionRaw": 2704961}, "510": {"acRate": 60.89400745309923, "difficulty": "Medium", "likes": 863, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "510", "paidOnly": true, "title": "Inorder Successor in BST II", "titleSlug": "inorder-successor-in-bst-ii", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 66833, "totalSubmissionRaw": 109753}, "511": {"acRate": 74.89124262275134, "difficulty": "Easy", "likes": 860, "dislikes": 29, "categoryTitle": "Database", "frontendQuestionId": "511", "paidOnly": false, "title": "Game Play Analysis I", "titleSlug": "game-play-analysis-i", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 295413, "totalSubmissionRaw": 394456}, "512": {"acRate": 53.0521682445323, "difficulty": "Easy", "likes": 266, "dislikes": 43, "categoryTitle": "Database", "frontendQuestionId": "512", "paidOnly": true, "title": "Game Play Analysis II", "titleSlug": "game-play-analysis-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 88708, "totalSubmissionRaw": 167209}, "513": {"acRate": 71.32919417434569, "difficulty": "Medium", "likes": 3803, "dislikes": 295, "categoryTitle": "Algorithms", "frontendQuestionId": "513", "paidOnly": false, "title": "Find Bottom Left Tree Value", "titleSlug": "find-bottom-left-tree-value", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 370160, "totalSubmissionRaw": 518946}, "514": {"acRate": 58.99026495868923, "difficulty": "Hard", "likes": 1484, "dislikes": 79, "categoryTitle": "Algorithms", "frontendQuestionId": "514", "paidOnly": false, "title": "Freedom Trail", "titleSlug": "freedom-trail", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 109739, "totalSubmissionRaw": 186029}, "515": {"acRate": 65.69339536682696, "difficulty": "Medium", "likes": 3617, "dislikes": 113, "categoryTitle": "Algorithms", "frontendQuestionId": "515", "paidOnly": false, "title": "Find Largest Value in Each Tree Row", "titleSlug": "find-largest-value-in-each-tree-row", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 353281, "totalSubmissionRaw": 537773}, "516": {"acRate": 63.04807251462837, "difficulty": "Medium", "likes": 9578, "dislikes": 330, "categoryTitle": "Algorithms", "frontendQuestionId": "516", "paidOnly": false, "title": "Longest Palindromic Subsequence", "titleSlug": "longest-palindromic-subsequence", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 521184, "totalSubmissionRaw": 826644}, "517": {"acRate": 41.50874040189512, "difficulty": "Hard", "likes": 770, "dislikes": 217, "categoryTitle": "Algorithms", "frontendQuestionId": "517", "paidOnly": false, "title": "Super Washing Machines", "titleSlug": "super-washing-machines", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 30489, "totalSubmissionRaw": 73452}, "518": {"acRate": 64.53813997653161, "difficulty": "Medium", "likes": 9383, "dislikes": 169, "categoryTitle": "Algorithms", "frontendQuestionId": "518", "paidOnly": false, "title": "Coin Change II", "titleSlug": "coin-change-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 668799, "totalSubmissionRaw": 1036286}, "519": {"acRate": 42.32717888384979, "difficulty": "Medium", "likes": 432, "dislikes": 129, "categoryTitle": "Algorithms", "frontendQuestionId": "519", "paidOnly": false, "title": "Random Flip Matrix", "titleSlug": "random-flip-matrix", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Reservoir Sampling", "id": "VG9waWNUYWdOb2RlOjM2", "slug": "reservoir-sampling"}, {"name": "Randomized", "id": "VG9waWNUYWdOb2RlOjYxMDc1", "slug": "randomized"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22307, "totalSubmissionRaw": 52700}, "520": {"acRate": 56.410670156469365, "difficulty": "Easy", "likes": 3405, "dislikes": 461, "categoryTitle": "Algorithms", "frontendQuestionId": "520", "paidOnly": false, "title": "Detect Capital", "titleSlug": "detect-capital", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 443983, "totalSubmissionRaw": 787055}, "521": {"acRate": 60.895779054288546, "difficulty": "Easy", "likes": 41, "dislikes": 133, "categoryTitle": "Algorithms", "frontendQuestionId": "521", "paidOnly": false, "title": "Longest Uncommon Subsequence I", "titleSlug": "longest-uncommon-subsequence-i", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 117566, "totalSubmissionRaw": 193061}, "522": {"acRate": 41.97174622524323, "difficulty": "Medium", "likes": 515, "dislikes": 1308, "categoryTitle": "Algorithms", "frontendQuestionId": "522", "paidOnly": false, "title": "Longest Uncommon Subsequence II", "titleSlug": "longest-uncommon-subsequence-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 54400, "totalSubmissionRaw": 129611}, "523": {"acRate": 30.298359017684824, "difficulty": "Medium", "likes": 6278, "dislikes": 652, "categoryTitle": "Algorithms", "frontendQuestionId": "523", "paidOnly": false, "title": "Continuous Subarray Sum", "titleSlug": "continuous-subarray-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 588855, "totalSubmissionRaw": 1943521}, "524": {"acRate": 51.31777243240252, "difficulty": "Medium", "likes": 1798, "dislikes": 359, "categoryTitle": "Algorithms", "frontendQuestionId": "524", "paidOnly": false, "title": "Longest Word in Dictionary through Deleting", "titleSlug": "longest-word-in-dictionary-through-deleting", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 157660, "totalSubmissionRaw": 307223}, "525": {"acRate": 48.942390086009105, "difficulty": "Medium", "likes": 7980, "dislikes": 384, "categoryTitle": "Algorithms", "frontendQuestionId": "525", "paidOnly": false, "title": "Contiguous Array", "titleSlug": "contiguous-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 474633, "totalSubmissionRaw": 969777}, "526": {"acRate": 64.32042135092779, "difficulty": "Medium", "likes": 3222, "dislikes": 370, "categoryTitle": "Algorithms", "frontendQuestionId": "526", "paidOnly": false, "title": "Beautiful Arrangement", "titleSlug": "beautiful-arrangement", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 179764, "totalSubmissionRaw": 279482}, "527": {"acRate": 61.18803135696147, "difficulty": "Hard", "likes": 387, "dislikes": 291, "categoryTitle": "Algorithms", "frontendQuestionId": "527", "paidOnly": true, "title": "Word Abbreviation", "titleSlug": "word-abbreviation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 27709, "totalSubmissionRaw": 45285}, "528": {"acRate": 47.113513216269986, "difficulty": "Medium", "likes": 1914, "dislikes": 847, "categoryTitle": "Algorithms", "frontendQuestionId": "528", "paidOnly": false, "title": "Random Pick with Weight", "titleSlug": "random-pick-with-weight", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}, {"name": "Randomized", "id": "VG9waWNUYWdOb2RlOjYxMDc1", "slug": "randomized"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 479783, "totalSubmissionRaw": 1018360}, "529": {"acRate": 66.9850547772583, "difficulty": "Medium", "likes": 1965, "dislikes": 1064, "categoryTitle": "Algorithms", "frontendQuestionId": "529", "paidOnly": false, "title": "Minesweeper", "titleSlug": "minesweeper", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 163191, "totalSubmissionRaw": 243623}, "530": {"acRate": 58.49875488135004, "difficulty": "Easy", "likes": 4398, "dislikes": 228, "categoryTitle": "Algorithms", "frontendQuestionId": "530", "paidOnly": false, "title": "Minimum Absolute Difference in BST", "titleSlug": "minimum-absolute-difference-in-bst", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 410154, "totalSubmissionRaw": 701135}, "531": {"acRate": 62.352319318847414, "difficulty": "Medium", "likes": 433, "dislikes": 41, "categoryTitle": "Algorithms", "frontendQuestionId": "531", "paidOnly": true, "title": "Lonely Pixel I", "titleSlug": "lonely-pixel-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 43646, "totalSubmissionRaw": 69998}, "532": {"acRate": 43.27044304743135, "difficulty": "Medium", "likes": 3884, "dislikes": 2254, "categoryTitle": "Algorithms", "frontendQuestionId": "532", "paidOnly": false, "title": "K-diff Pairs in an Array", "titleSlug": "k-diff-pairs-in-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 350413, "totalSubmissionRaw": 809822}, "533": {"acRate": 48.636677195657704, "difficulty": "Medium", "likes": 87, "dislikes": 775, "categoryTitle": "Algorithms", "frontendQuestionId": "533", "paidOnly": true, "title": "Lonely Pixel II", "titleSlug": "lonely-pixel-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13396, "totalSubmissionRaw": 27543}, "534": {"acRate": 80.95213603118924, "difficulty": "Medium", "likes": 399, "dislikes": 16, "categoryTitle": "Database", "frontendQuestionId": "534", "paidOnly": true, "title": "Game Play Analysis III", "titleSlug": "game-play-analysis-iii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 78696, "totalSubmissionRaw": 97213}, "535": {"acRate": 86.47112752524431, "difficulty": "Medium", "likes": 2026, "dislikes": 3784, "categoryTitle": "Algorithms", "frontendQuestionId": "535", "paidOnly": false, "title": "Encode and Decode TinyURL", "titleSlug": "encode-and-decode-tinyurl", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 265979, "totalSubmissionRaw": 307593}, "536": {"acRate": 57.19890640534015, "difficulty": "Medium", "likes": 1063, "dislikes": 169, "categoryTitle": "Algorithms", "frontendQuestionId": "536", "paidOnly": true, "title": "Construct Binary Tree from String", "titleSlug": "construct-binary-tree-from-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 96657, "totalSubmissionRaw": 168984}, "537": {"acRate": 72.00702277237218, "difficulty": "Medium", "likes": 715, "dislikes": 1251, "categoryTitle": "Algorithms", "frontendQuestionId": "537", "paidOnly": false, "title": "Complex Number Multiplication", "titleSlug": "complex-number-multiplication", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 97612, "totalSubmissionRaw": 135559}, "538": {"acRate": 69.65778625039292, "difficulty": "Medium", "likes": 5243, "dislikes": 175, "categoryTitle": "Algorithms", "frontendQuestionId": "538", "paidOnly": false, "title": "Convert BST to Greater Tree", "titleSlug": "convert-bst-to-greater-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 308033, "totalSubmissionRaw": 442209}, "539": {"acRate": 56.97657613589621, "difficulty": "Medium", "likes": 1872, "dislikes": 264, "categoryTitle": "Algorithms", "frontendQuestionId": "539", "paidOnly": false, "title": "Minimum Time Difference", "titleSlug": "minimum-time-difference", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 153753, "totalSubmissionRaw": 269853}, "540": {"acRate": 59.2245835726594, "difficulty": "Medium", "likes": 11283, "dislikes": 196, "categoryTitle": "Algorithms", "frontendQuestionId": "540", "paidOnly": false, "title": "Single Element in a Sorted Array", "titleSlug": "single-element-in-a-sorted-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 711459, "totalSubmissionRaw": 1201288}, "541": {"acRate": 50.99650542723716, "difficulty": "Easy", "likes": 2000, "dislikes": 3846, "categoryTitle": "Algorithms", "frontendQuestionId": "541", "paidOnly": false, "title": "Reverse String II", "titleSlug": "reverse-string-ii", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 258589, "totalSubmissionRaw": 507072}, "542": {"acRate": 49.24672756687856, "difficulty": "Medium", "likes": 9545, "dislikes": 423, "categoryTitle": "Algorithms", "frontendQuestionId": "542", "paidOnly": false, "title": "01 Matrix", "titleSlug": "01-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 602710, "totalSubmissionRaw": 1223859}, "543": {"acRate": 61.21546773333737, "difficulty": "Easy", "likes": 13936, "dislikes": 1038, "categoryTitle": "Algorithms", "frontendQuestionId": "543", "paidOnly": false, "title": "Diameter of Binary Tree", "titleSlug": "diameter-of-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1619129, "totalSubmissionRaw": 2644967}, "544": {"acRate": 77.17966869602152, "difficulty": "Medium", "likes": 390, "dislikes": 134, "categoryTitle": "Algorithms", "frontendQuestionId": "544", "paidOnly": true, "title": "Output Contest Matches", "titleSlug": "output-contest-matches", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 27256, "totalSubmissionRaw": 35315}, "545": {"acRate": 45.763975320638686, "difficulty": "Medium", "likes": 1331, "dislikes": 2202, "categoryTitle": "Algorithms", "frontendQuestionId": "545", "paidOnly": true, "title": "Boundary of Binary Tree", "titleSlug": "boundary-of-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 137516, "totalSubmissionRaw": 300492}, "546": {"acRate": 47.92264047343054, "difficulty": "Hard", "likes": 2265, "dislikes": 125, "categoryTitle": "Algorithms", "frontendQuestionId": "546", "paidOnly": false, "title": "Remove Boxes", "titleSlug": "remove-boxes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 47130, "totalSubmissionRaw": 98346}, "547": {"acRate": 66.94449550033814, "difficulty": "Medium", "likes": 9792, "dislikes": 365, "categoryTitle": "Algorithms", "frontendQuestionId": "547", "paidOnly": false, "title": "Number of Provinces", "titleSlug": "number-of-provinces", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 965178, "totalSubmissionRaw": 1441764}, "548": {"acRate": 50.120934111759794, "difficulty": "Hard", "likes": 414, "dislikes": 131, "categoryTitle": "Algorithms", "frontendQuestionId": "548", "paidOnly": true, "title": "Split Array with Equal Sum", "titleSlug": "split-array-with-equal-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 24038, "totalSubmissionRaw": 47960}, "549": {"acRate": 49.510266270042806, "difficulty": "Medium", "likes": 1157, "dislikes": 95, "categoryTitle": "Algorithms", "frontendQuestionId": "549", "paidOnly": true, "title": "Binary Tree Longest Consecutive Sequence II", "titleSlug": "binary-tree-longest-consecutive-sequence-ii", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 54592, "totalSubmissionRaw": 110264}, "550": {"acRate": 37.34464727936272, "difficulty": "Medium", "likes": 932, "dislikes": 195, "categoryTitle": "Database", "frontendQuestionId": "550", "paidOnly": false, "title": "Game Play Analysis IV", "titleSlug": "game-play-analysis-iv", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 194828, "totalSubmissionRaw": 521707}, "551": {"acRate": 49.234733718569416, "difficulty": "Easy", "likes": 773, "dislikes": 51, "categoryTitle": "Algorithms", "frontendQuestionId": "551", "paidOnly": false, "title": "Student Attendance Record I", "titleSlug": "student-attendance-record-i", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 226979, "totalSubmissionRaw": 461015}, "552": {"acRate": 55.21962892675602, "difficulty": "Hard", "likes": 2274, "dislikes": 286, "categoryTitle": "Algorithms", "frontendQuestionId": "552", "paidOnly": false, "title": "Student Attendance Record II", "titleSlug": "student-attendance-record-ii", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 139376, "totalSubmissionRaw": 252403}, "553": {"acRate": 61.06960975681348, "difficulty": "Medium", "likes": 378, "dislikes": 1601, "categoryTitle": "Algorithms", "frontendQuestionId": "553", "paidOnly": false, "title": "Optimal Division", "titleSlug": "optimal-division", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 41611, "totalSubmissionRaw": 68137}, "554": {"acRate": 55.23542459172768, "difficulty": "Medium", "likes": 2528, "dislikes": 172, "categoryTitle": "Algorithms", "frontendQuestionId": "554", "paidOnly": false, "title": "Brick Wall", "titleSlug": "brick-wall", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 144186, "totalSubmissionRaw": 261039}, "555": {"acRate": 43.37380029237908, "difficulty": "Medium", "likes": 76, "dislikes": 260, "categoryTitle": "Algorithms", "frontendQuestionId": "555", "paidOnly": true, "title": "Split Concatenated Strings", "titleSlug": "split-concatenated-strings", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6824, "totalSubmissionRaw": 15733}, "556": {"acRate": 34.170859621367136, "difficulty": "Medium", "likes": 3687, "dislikes": 470, "categoryTitle": "Algorithms", "frontendQuestionId": "556", "paidOnly": false, "title": "Next Greater Element III", "titleSlug": "next-greater-element-iii", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 160479, "totalSubmissionRaw": 469637}, "557": {"acRate": 83.23857154999263, "difficulty": "Easy", "likes": 5930, "dislikes": 250, "categoryTitle": "Algorithms", "frontendQuestionId": "557", "paidOnly": false, "title": "Reverse Words in a String III", "titleSlug": "reverse-words-in-a-string-iii", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 930370, "totalSubmissionRaw": 1117715}, "558": {"acRate": 50.01150899345631, "difficulty": "Medium", "likes": 190, "dislikes": 472, "categoryTitle": "Algorithms", "frontendQuestionId": "558", "paidOnly": false, "title": "Logical OR of Two Binary Grids Represented as Quad-Trees", "titleSlug": "logical-or-of-two-binary-grids-represented-as-quad-trees", "topicTags": [{"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15209, "totalSubmissionRaw": 30411}, "559": {"acRate": 72.34769122943058, "difficulty": "Easy", "likes": 2772, "dislikes": 88, "categoryTitle": "Algorithms", "frontendQuestionId": "559", "paidOnly": false, "title": "Maximum Depth of N-ary Tree", "titleSlug": "maximum-depth-of-n-ary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 291096, "totalSubmissionRaw": 402357}, "560": {"acRate": 43.972904246694426, "difficulty": "Medium", "likes": 21738, "dislikes": 669, "categoryTitle": "Algorithms", "frontendQuestionId": "560", "paidOnly": false, "title": "Subarray Sum Equals K", "titleSlug": "subarray-sum-equals-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 1350540, "totalSubmissionRaw": 3071304}, "561": {"acRate": 79.20903218215727, "difficulty": "Easy", "likes": 2066, "dislikes": 263, "categoryTitle": "Algorithms", "frontendQuestionId": "561", "paidOnly": false, "title": "Array Partition", "titleSlug": "array-partition", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting Sort", "id": "VG9waWNUYWdOb2RlOjYxMDcy", "slug": "counting-sort"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 498186, "totalSubmissionRaw": 628951}, "562": {"acRate": 50.41193163242621, "difficulty": "Medium", "likes": 890, "dislikes": 117, "categoryTitle": "Algorithms", "frontendQuestionId": "562", "paidOnly": true, "title": "Longest Line of Consecutive One in Matrix", "titleSlug": "longest-line-of-consecutive-one-in-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 77099, "totalSubmissionRaw": 152938}, "563": {"acRate": 62.39510648971588, "difficulty": "Easy", "likes": 2241, "dislikes": 2186, "categoryTitle": "Algorithms", "frontendQuestionId": "563", "paidOnly": false, "title": "Binary Tree Tilt", "titleSlug": "binary-tree-tilt", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 218901, "totalSubmissionRaw": 350831}, "564": {"acRate": 22.590163475926104, "difficulty": "Hard", "likes": 779, "dislikes": 1450, "categoryTitle": "Algorithms", "frontendQuestionId": "564", "paidOnly": false, "title": "Find the Closest Palindrome", "titleSlug": "find-the-closest-palindrome", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 48462, "totalSubmissionRaw": 214527}, "565": {"acRate": 56.33932629128918, "difficulty": "Medium", "likes": 2210, "dislikes": 154, "categoryTitle": "Algorithms", "frontendQuestionId": "565", "paidOnly": false, "title": "Array Nesting", "titleSlug": "array-nesting", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 132647, "totalSubmissionRaw": 235443}, "566": {"acRate": 63.22930377952007, "difficulty": "Easy", "likes": 3499, "dislikes": 411, "categoryTitle": "Algorithms", "frontendQuestionId": "566", "paidOnly": false, "title": "Reshape the Matrix", "titleSlug": "reshape-the-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 385731, "totalSubmissionRaw": 610051}, "567": {"acRate": 44.663799641859484, "difficulty": "Medium", "likes": 11329, "dislikes": 420, "categoryTitle": "Algorithms", "frontendQuestionId": "567", "paidOnly": false, "title": "Permutation in String", "titleSlug": "permutation-in-string", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 908636, "totalSubmissionRaw": 2034394}, "568": {"acRate": 45.81721816358688, "difficulty": "Hard", "likes": 570, "dislikes": 113, "categoryTitle": "Algorithms", "frontendQuestionId": "568", "paidOnly": true, "title": "Maximum Vacation Days", "titleSlug": "maximum-vacation-days", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 38382, "totalSubmissionRaw": 83772}, "569": {"acRate": 65.86496483624644, "difficulty": "Hard", "likes": 323, "dislikes": 152, "categoryTitle": "Database", "frontendQuestionId": "569", "paidOnly": true, "title": "Median Employee Salary", "titleSlug": "median-employee-salary", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 41489, "totalSubmissionRaw": 62991}, "570": {"acRate": 49.71553752418561, "difficulty": "Medium", "likes": 1158, "dislikes": 128, "categoryTitle": "Database", "frontendQuestionId": "570", "paidOnly": false, "title": "Managers with at Least 5 Direct Reports", "titleSlug": "managers-with-at-least-5-direct-reports", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 413941, "totalSubmissionRaw": 832619}, "571": {"acRate": 42.35636529654306, "difficulty": "Hard", "likes": 308, "dislikes": 78, "categoryTitle": "Database", "frontendQuestionId": "571", "paidOnly": true, "title": "Find Median Given Frequency of Numbers", "titleSlug": "find-median-given-frequency-of-numbers", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29688, "totalSubmissionRaw": 70091}, "572": {"acRate": 48.47414423714194, "difficulty": "Easy", "likes": 8237, "dislikes": 517, "categoryTitle": "Algorithms", "frontendQuestionId": "572", "paidOnly": false, "title": "Subtree of Another Tree", "titleSlug": "subtree-of-another-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 902533, "totalSubmissionRaw": 1861884}, "573": {"acRate": 57.11602406274589, "difficulty": "Medium", "likes": 411, "dislikes": 39, "categoryTitle": "Algorithms", "frontendQuestionId": "573", "paidOnly": true, "title": "Squirrel Simulation", "titleSlug": "squirrel-simulation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 22502, "totalSubmissionRaw": 39397}, "574": {"acRate": 61.03902113953574, "difficulty": "Medium", "likes": 174, "dislikes": 413, "categoryTitle": "Database", "frontendQuestionId": "574", "paidOnly": true, "title": "Winning Candidate", "titleSlug": "winning-candidate", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 65949, "totalSubmissionRaw": 108044}, "575": {"acRate": 68.13255734590162, "difficulty": "Easy", "likes": 1533, "dislikes": 1371, "categoryTitle": "Algorithms", "frontendQuestionId": "575", "paidOnly": false, "title": "Distribute Candies", "titleSlug": "distribute-candies", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 295480, "totalSubmissionRaw": 433684}, "576": {"acRate": 48.09962568384682, "difficulty": "Medium", "likes": 3881, "dislikes": 293, "categoryTitle": "Algorithms", "frontendQuestionId": "576", "paidOnly": false, "title": "Out of Boundary Paths", "titleSlug": "out-of-boundary-paths", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 210483, "totalSubmissionRaw": 437598}, "577": {"acRate": 75.9891918380215, "difficulty": "Easy", "likes": 961, "dislikes": 223, "categoryTitle": "Database", "frontendQuestionId": "577", "paidOnly": false, "title": "Employee Bonus", "titleSlug": "employee-bonus", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 443495, "totalSubmissionRaw": 583630}, "578": {"acRate": 40.2328300116905, "difficulty": "Medium", "likes": 129, "dislikes": 914, "categoryTitle": "Database", "frontendQuestionId": "578", "paidOnly": true, "title": "Get Highest Answer Rate Question", "titleSlug": "get-highest-answer-rate-question", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 57470, "totalSubmissionRaw": 142847}, "579": {"acRate": 47.28699492625989, "difficulty": "Hard", "likes": 239, "dislikes": 403, "categoryTitle": "Database", "frontendQuestionId": "579", "paidOnly": true, "title": "Find Cumulative Salary of an Employee", "titleSlug": "find-cumulative-salary-of-an-employee", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 35975, "totalSubmissionRaw": 76078}, "580": {"acRate": 59.14451225819799, "difficulty": "Medium", "likes": 245, "dislikes": 36, "categoryTitle": "Database", "frontendQuestionId": "580", "paidOnly": true, "title": "Count Student Number in Departments", "titleSlug": "count-student-number-in-departments", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 68608, "totalSubmissionRaw": 116002}, "581": {"acRate": 37.005966974927205, "difficulty": "Medium", "likes": 7760, "dislikes": 261, "categoryTitle": "Algorithms", "frontendQuestionId": "581", "paidOnly": false, "title": "Shortest Unsorted Continuous Subarray", "titleSlug": "shortest-unsorted-continuous-subarray", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 334773, "totalSubmissionRaw": 904646}, "582": {"acRate": 69.57723525276411, "difficulty": "Medium", "likes": 1107, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "582", "paidOnly": true, "title": "Kill Process", "titleSlug": "kill-process", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 87093, "totalSubmissionRaw": 125175}, "583": {"acRate": 62.41717933836332, "difficulty": "Medium", "likes": 5790, "dislikes": 87, "categoryTitle": "Algorithms", "frontendQuestionId": "583", "paidOnly": false, "title": "Delete Operation for Two Strings", "titleSlug": "delete-operation-for-two-strings", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 268862, "totalSubmissionRaw": 430750}, "584": {"acRate": 70.54172700692146, "difficulty": "Easy", "likes": 2105, "dislikes": 368, "categoryTitle": "Database", "frontendQuestionId": "584", "paidOnly": false, "title": "Find Customer Referee", "titleSlug": "find-customer-referee", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1024880, "totalSubmissionRaw": 1452871}, "585": {"acRate": 48.50909443084843, "difficulty": "Medium", "likes": 582, "dislikes": 493, "categoryTitle": "Database", "frontendQuestionId": "585", "paidOnly": false, "title": "Investments in 2016", "titleSlug": "investments-in-2016", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 130228, "totalSubmissionRaw": 268461}, "586": {"acRate": 64.68109052191132, "difficulty": "Easy", "likes": 993, "dislikes": 74, "categoryTitle": "Database", "frontendQuestionId": "586", "paidOnly": false, "title": "Customer Placing the Largest Number of Orders", "titleSlug": "customer-placing-the-largest-number-of-orders", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 277011, "totalSubmissionRaw": 428272}, "587": {"acRate": 51.97563005862246, "difficulty": "Hard", "likes": 1478, "dislikes": 643, "categoryTitle": "Algorithms", "frontendQuestionId": "587", "paidOnly": false, "title": "Erect the Fence", "titleSlug": "erect-the-fence", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 58694, "totalSubmissionRaw": 112926}, "588": {"acRate": 48.08207037530229, "difficulty": "Hard", "likes": 1493, "dislikes": 167, "categoryTitle": "Algorithms", "frontendQuestionId": "588", "paidOnly": true, "title": "Design In-Memory File System", "titleSlug": "design-in-memory-file-system", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 107963, "totalSubmissionRaw": 224539}, "589": {"acRate": 75.64613380591551, "difficulty": "Easy", "likes": 3141, "dislikes": 202, "categoryTitle": "Algorithms", "frontendQuestionId": "589", "paidOnly": false, "title": "N-ary Tree Preorder Traversal", "titleSlug": "n-ary-tree-preorder-traversal", "topicTags": [{"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 434963, "totalSubmissionRaw": 574997}, "590": {"acRate": 78.06495645335984, "difficulty": "Easy", "likes": 2338, "dislikes": 99, "categoryTitle": "Algorithms", "frontendQuestionId": "590", "paidOnly": false, "title": "N-ary Tree Postorder Traversal", "titleSlug": "n-ary-tree-postorder-traversal", "topicTags": [{"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 263075, "totalSubmissionRaw": 336995}, "591": {"acRate": 39.03454015813566, "difficulty": "Hard", "likes": 170, "dislikes": 648, "categoryTitle": "Algorithms", "frontendQuestionId": "591", "paidOnly": false, "title": "Tag Validator", "titleSlug": "tag-validator", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 15946, "totalSubmissionRaw": 40851}, "592": {"acRate": 53.61323191940768, "difficulty": "Medium", "likes": 400, "dislikes": 508, "categoryTitle": "Algorithms", "frontendQuestionId": "592", "paidOnly": false, "title": "Fraction Addition and Subtraction", "titleSlug": "fraction-addition-and-subtraction", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 37147, "totalSubmissionRaw": 69287}, "593": {"acRate": 44.106314194710535, "difficulty": "Medium", "likes": 1052, "dislikes": 908, "categoryTitle": "Algorithms", "frontendQuestionId": "593", "paidOnly": false, "title": "Valid Square", "titleSlug": "valid-square", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 110919, "totalSubmissionRaw": 251481}, "594": {"acRate": 55.11642747462393, "difficulty": "Easy", "likes": 2161, "dislikes": 248, "categoryTitle": "Algorithms", "frontendQuestionId": "594", "paidOnly": false, "title": "Longest Harmonious Subsequence", "titleSlug": "longest-harmonious-subsequence", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 165830, "totalSubmissionRaw": 300873}, "595": {"acRate": 68.10316290297045, "difficulty": "Easy", "likes": 2733, "dislikes": 1323, "categoryTitle": "Database", "frontendQuestionId": "595", "paidOnly": false, "title": "Big Countries", "titleSlug": "big-countries", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1324898, "totalSubmissionRaw": 1945428}, "596": {"acRate": 56.66553654420099, "difficulty": "Easy", "likes": 1053, "dislikes": 1078, "categoryTitle": "Database", "frontendQuestionId": "596", "paidOnly": false, "title": "Classes More Than 5 Students", "titleSlug": "classes-more-than-5-students", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 457955, "totalSubmissionRaw": 808172}, "597": {"acRate": 41.78845744999809, "difficulty": "Easy", "likes": 306, "dislikes": 767, "categoryTitle": "Database", "frontendQuestionId": "597", "paidOnly": true, "title": "Friend Requests I: Overall Acceptance Rate", "titleSlug": "friend-requests-i-overall-acceptance-rate", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 76658, "totalSubmissionRaw": 183443}, "598": {"acRate": 56.362116185463684, "difficulty": "Easy", "likes": 943, "dislikes": 969, "categoryTitle": "Algorithms", "frontendQuestionId": "598", "paidOnly": false, "title": "Range Addition II", "titleSlug": "range-addition-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 105161, "totalSubmissionRaw": 186581}, "599": {"acRate": 56.05147074342721, "difficulty": "Easy", "likes": 1943, "dislikes": 396, "categoryTitle": "Algorithms", "frontendQuestionId": "599", "paidOnly": false, "title": "Minimum Index Sum of Two Lists", "titleSlug": "minimum-index-sum-of-two-lists", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 239013, "totalSubmissionRaw": 426417}, "600": {"acRate": 40.04288368048694, "difficulty": "Hard", "likes": 1532, "dislikes": 135, "categoryTitle": "Algorithms", "frontendQuestionId": "600", "paidOnly": false, "title": "Non-negative Integers without Consecutive Ones", "titleSlug": "non-negative-integers-without-consecutive-ones", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 40524, "totalSubmissionRaw": 101203}, "601": {"acRate": 48.81990682876946, "difficulty": "Hard", "likes": 681, "dislikes": 568, "categoryTitle": "Database", "frontendQuestionId": "601", "paidOnly": false, "title": "Human Traffic of Stadium", "titleSlug": "human-traffic-of-stadium", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 107416, "totalSubmissionRaw": 220025}, "602": {"acRate": 57.9667016108124, "difficulty": "Medium", "likes": 649, "dislikes": 131, "categoryTitle": "Database", "frontendQuestionId": "602", "paidOnly": false, "title": "Friend Requests II: Who Has the Most Friends", "titleSlug": "friend-requests-ii-who-has-the-most-friends", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 154272, "totalSubmissionRaw": 266139}, "603": {"acRate": 65.94695137829693, "difficulty": "Easy", "likes": 642, "dislikes": 75, "categoryTitle": "Database", "frontendQuestionId": "603", "paidOnly": true, "title": "Consecutive Available Seats", "titleSlug": "consecutive-available-seats", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 88636, "totalSubmissionRaw": 134405}, "604": {"acRate": 39.97656433091164, "difficulty": "Easy", "likes": 441, "dislikes": 159, "categoryTitle": "Algorithms", "frontendQuestionId": "604", "paidOnly": true, "title": "Design Compressed String Iterator", "titleSlug": "design-compressed-string-iterator", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Iterator", "id": "VG9waWNUYWdOb2RlOjYxMDY0", "slug": "iterator"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 34116, "totalSubmissionRaw": 85340}, "605": {"acRate": 28.96410757254636, "difficulty": "Easy", "likes": 6583, "dislikes": 1188, "categoryTitle": "Algorithms", "frontendQuestionId": "605", "paidOnly": false, "title": "Can Place Flowers", "titleSlug": "can-place-flowers", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 868348, "totalSubmissionRaw": 2998013}, "606": {"acRate": 69.45016215891359, "difficulty": "Medium", "likes": 77, "dislikes": 39, "categoryTitle": "Algorithms", "frontendQuestionId": "606", "paidOnly": false, "title": "Construct String from Binary Tree", "titleSlug": "construct-string-from-binary-tree", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 323569, "totalSubmissionRaw": 465901}, "607": {"acRate": 65.79164507340744, "difficulty": "Easy", "likes": 1172, "dislikes": 101, "categoryTitle": "Database", "frontendQuestionId": "607", "paidOnly": false, "title": "Sales Person", "titleSlug": "sales-person", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 227245, "totalSubmissionRaw": 345401}, "608": {"acRate": 72.66837624013246, "difficulty": "Medium", "likes": 1238, "dislikes": 127, "categoryTitle": "Database", "frontendQuestionId": "608", "paidOnly": false, "title": "Tree Node", "titleSlug": "tree-node", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 166343, "totalSubmissionRaw": 228907}, "609": {"acRate": 67.64820093726006, "difficulty": "Medium", "likes": 1514, "dislikes": 1649, "categoryTitle": "Algorithms", "frontendQuestionId": "609", "paidOnly": false, "title": "Find Duplicate File in System", "titleSlug": "find-duplicate-file-in-system", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 153303, "totalSubmissionRaw": 226618}, "610": {"acRate": 72.19837309453825, "difficulty": "Easy", "likes": 597, "dislikes": 169, "categoryTitle": "Database", "frontendQuestionId": "610", "paidOnly": false, "title": "Triangle Judgement", "titleSlug": "triangle-judgement", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 211238, "totalSubmissionRaw": 292580}, "611": {"acRate": 51.37368796494446, "difficulty": "Medium", "likes": 3823, "dislikes": 215, "categoryTitle": "Algorithms", "frontendQuestionId": "611", "paidOnly": false, "title": "Valid Triangle Number", "titleSlug": "valid-triangle-number", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 201652, "totalSubmissionRaw": 392520}, "612": {"acRate": 61.323613367880206, "difficulty": "Medium", "likes": 219, "dislikes": 70, "categoryTitle": "Database", "frontendQuestionId": "612", "paidOnly": true, "title": "Shortest Distance in a Plane", "titleSlug": "shortest-distance-in-a-plane", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 41892, "totalSubmissionRaw": 68313}, "613": {"acRate": 80.17360921548288, "difficulty": "Easy", "likes": 329, "dislikes": 40, "categoryTitle": "Database", "frontendQuestionId": "613", "paidOnly": true, "title": "Shortest Distance in a Line", "titleSlug": "shortest-distance-in-a-line", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 73427, "totalSubmissionRaw": 91585}, "614": {"acRate": 38.90443392165304, "difficulty": "Medium", "likes": 158, "dislikes": 744, "categoryTitle": "Database", "frontendQuestionId": "614", "paidOnly": true, "title": "Second Degree Follower", "titleSlug": "second-degree-follower", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 54225, "totalSubmissionRaw": 139380}, "615": {"acRate": 56.19602208273463, "difficulty": "Hard", "likes": 236, "dislikes": 74, "categoryTitle": "Database", "frontendQuestionId": "615", "paidOnly": true, "title": "Average Salary: Departments VS Company", "titleSlug": "average-salary-departments-vs-company", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 37154, "totalSubmissionRaw": 66115}, "616": {"acRate": 49.964739834222975, "difficulty": "Medium", "likes": 1078, "dislikes": 192, "categoryTitle": "Algorithms", "frontendQuestionId": "616", "paidOnly": true, "title": "Add Bold Tag in String", "titleSlug": "add-bold-tag-in-string", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 92107, "totalSubmissionRaw": 184344}, "617": {"acRate": 79.06449949539231, "difficulty": "Easy", "likes": 8786, "dislikes": 301, "categoryTitle": "Algorithms", "frontendQuestionId": "617", "paidOnly": false, "title": "Merge Two Binary Trees", "titleSlug": "merge-two-binary-trees", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 788126, "totalSubmissionRaw": 996814}, "618": {"acRate": 63.43724322103533, "difficulty": "Hard", "likes": 186, "dislikes": 170, "categoryTitle": "Database", "frontendQuestionId": "618", "paidOnly": true, "title": "Students Report By Geography", "titleSlug": "students-report-by-geography", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 24705, "totalSubmissionRaw": 38944}, "619": {"acRate": 65.26536903414129, "difficulty": "Easy", "likes": 645, "dislikes": 182, "categoryTitle": "Database", "frontendQuestionId": "619", "paidOnly": false, "title": "Biggest Single Number", "titleSlug": "biggest-single-number", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 239234, "totalSubmissionRaw": 366559}, "620": {"acRate": 74.06575970461112, "difficulty": "Easy", "likes": 1148, "dislikes": 543, "categoryTitle": "Database", "frontendQuestionId": "620", "paidOnly": false, "title": "Not Boring Movies", "titleSlug": "not-boring-movies", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 548005, "totalSubmissionRaw": 739891}, "621": {"acRate": 60.242425562303715, "difficulty": "Medium", "likes": 10534, "dislikes": 2081, "categoryTitle": "Algorithms", "frontendQuestionId": "621", "paidOnly": false, "title": "Task Scheduler", "titleSlug": "task-scheduler", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 663880, "totalSubmissionRaw": 1102017}, "622": {"acRate": 51.71932137420154, "difficulty": "Medium", "likes": 3538, "dislikes": 290, "categoryTitle": "Algorithms", "frontendQuestionId": "622", "paidOnly": false, "title": "Design Circular Queue", "titleSlug": "design-circular-queue", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 329540, "totalSubmissionRaw": 637170}, "623": {"acRate": 64.05247914334838, "difficulty": "Medium", "likes": 3555, "dislikes": 265, "categoryTitle": "Algorithms", "frontendQuestionId": "623", "paidOnly": false, "title": "Add One Row to Tree", "titleSlug": "add-one-row-to-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 277549, "totalSubmissionRaw": 433315}, "624": {"acRate": 45.9542747337333, "difficulty": "Medium", "likes": 1371, "dislikes": 111, "categoryTitle": "Algorithms", "frontendQuestionId": "624", "paidOnly": false, "title": "Maximum Distance in Arrays", "titleSlug": "maximum-distance-in-arrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 168344, "totalSubmissionRaw": 366333}, "625": {"acRate": 33.68133160804611, "difficulty": "Medium", "likes": 129, "dislikes": 112, "categoryTitle": "Algorithms", "frontendQuestionId": "625", "paidOnly": true, "title": "Minimum Factorization", "titleSlug": "minimum-factorization", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 11453, "totalSubmissionRaw": 34004}, "626": {"acRate": 70.5402801237513, "difficulty": "Medium", "likes": 1459, "dislikes": 588, "categoryTitle": "Database", "frontendQuestionId": "626", "paidOnly": false, "title": "Exchange Seats", "titleSlug": "exchange-seats", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 243055, "totalSubmissionRaw": 344562}, "627": {"acRate": 83.40872311032169, "difficulty": "Easy", "likes": 1728, "dislikes": 565, "categoryTitle": "Database", "frontendQuestionId": "627", "paidOnly": false, "title": "Swap Salary", "titleSlug": "swap-salary", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 422630, "totalSubmissionRaw": 506698}, "628": {"acRate": 45.182329563795506, "difficulty": "Easy", "likes": 4220, "dislikes": 677, "categoryTitle": "Algorithms", "frontendQuestionId": "628", "paidOnly": false, "title": "Maximum Product of Three Numbers", "titleSlug": "maximum-product-of-three-numbers", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 341526, "totalSubmissionRaw": 755884}, "629": {"acRate": 49.44691146412035, "difficulty": "Hard", "likes": 2683, "dislikes": 324, "categoryTitle": "Algorithms", "frontendQuestionId": "629", "paidOnly": false, "title": "K Inverse Pairs Array", "titleSlug": "k-inverse-pairs-array", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 130392, "totalSubmissionRaw": 263701}, "630": {"acRate": 40.28041539884361, "difficulty": "Hard", "likes": 3796, "dislikes": 98, "categoryTitle": "Algorithms", "frontendQuestionId": "630", "paidOnly": false, "title": "Course Schedule III", "titleSlug": "course-schedule-iii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 114112, "totalSubmissionRaw": 283294}, "631": {"acRate": 44.14178746280119, "difficulty": "Hard", "likes": 237, "dislikes": 275, "categoryTitle": "Algorithms", "frontendQuestionId": "631", "paidOnly": true, "title": "Design Excel Sum Formula", "titleSlug": "design-excel-sum-formula", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 18393, "totalSubmissionRaw": 41668}, "632": {"acRate": 63.0480495676326, "difficulty": "Hard", "likes": 3470, "dislikes": 75, "categoryTitle": "Algorithms", "frontendQuestionId": "632", "paidOnly": false, "title": "Smallest Range Covering Elements from K Lists", "titleSlug": "smallest-range-covering-elements-from-k-lists", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 112133, "totalSubmissionRaw": 177853}, "633": {"acRate": 36.6067841300146, "difficulty": "Medium", "likes": 3206, "dislikes": 607, "categoryTitle": "Algorithms", "frontendQuestionId": "633", "paidOnly": false, "title": "Sum of Square Numbers", "titleSlug": "sum-of-square-numbers", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 356251, "totalSubmissionRaw": 973183}, "634": {"acRate": 41.887807754680814, "difficulty": "Medium", "likes": 218, "dislikes": 163, "categoryTitle": "Algorithms", "frontendQuestionId": "634", "paidOnly": true, "title": "Find the Derangement of An Array", "titleSlug": "find-the-derangement-of-an-array", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 11365, "totalSubmissionRaw": 27132}, "635": {"acRate": 60.50666301257237, "difficulty": "Medium", "likes": 472, "dislikes": 212, "categoryTitle": "Algorithms", "frontendQuestionId": "635", "paidOnly": true, "title": "Design Log Storage System", "titleSlug": "design-log-storage-system", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 35325, "totalSubmissionRaw": 58382}, "636": {"acRate": 62.34312942437935, "difficulty": "Medium", "likes": 1952, "dislikes": 2797, "categoryTitle": "Algorithms", "frontendQuestionId": "636", "paidOnly": false, "title": "Exclusive Time of Functions", "titleSlug": "exclusive-time-of-functions", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 227919, "totalSubmissionRaw": 365588}, "637": {"acRate": 73.09265698506852, "difficulty": "Easy", "likes": 5280, "dislikes": 327, "categoryTitle": "Algorithms", "frontendQuestionId": "637", "paidOnly": false, "title": "Average of Levels in Binary Tree", "titleSlug": "average-of-levels-in-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 543169, "totalSubmissionRaw": 743125}, "638": {"acRate": 51.9008017776746, "difficulty": "Medium", "likes": 1507, "dislikes": 761, "categoryTitle": "Algorithms", "frontendQuestionId": "638", "paidOnly": false, "title": "Shopping Offers", "titleSlug": "shopping-offers", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 62596, "totalSubmissionRaw": 120607}, "639": {"acRate": 30.813152910866943, "difficulty": "Hard", "likes": 1572, "dislikes": 818, "categoryTitle": "Algorithms", "frontendQuestionId": "639", "paidOnly": false, "title": "Decode Ways II", "titleSlug": "decode-ways-ii", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 76306, "totalSubmissionRaw": 247641}, "640": {"acRate": 43.94041388894921, "difficulty": "Medium", "likes": 495, "dislikes": 834, "categoryTitle": "Algorithms", "frontendQuestionId": "640", "paidOnly": false, "title": "Solve the Equation", "titleSlug": "solve-the-equation", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 40470, "totalSubmissionRaw": 92102}, "641": {"acRate": 57.229629063681855, "difficulty": "Medium", "likes": 1180, "dislikes": 76, "categoryTitle": "Algorithms", "frontendQuestionId": "641", "paidOnly": false, "title": "Design Circular Deque", "titleSlug": "design-circular-deque", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 74904, "totalSubmissionRaw": 130884}, "642": {"acRate": 49.07929426079903, "difficulty": "Hard", "likes": 2110, "dislikes": 179, "categoryTitle": "Algorithms", "frontendQuestionId": "642", "paidOnly": true, "title": "Design Search Autocomplete System", "titleSlug": "design-search-autocomplete-system", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Data Stream", "id": "VG9waWNUYWdOb2RlOjYxMDYz", "slug": "data-stream"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 145206, "totalSubmissionRaw": 295860}, "643": {"acRate": 43.65636644988433, "difficulty": "Easy", "likes": 3530, "dislikes": 323, "categoryTitle": "Algorithms", "frontendQuestionId": "643", "paidOnly": false, "title": "Maximum Average Subarray I", "titleSlug": "maximum-average-subarray-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 535742, "totalSubmissionRaw": 1227182}, "644": {"acRate": 36.807985364900624, "difficulty": "Hard", "likes": 622, "dislikes": 71, "categoryTitle": "Algorithms", "frontendQuestionId": "644", "paidOnly": true, "title": "Maximum Average Subarray II", "titleSlug": "maximum-average-subarray-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 20724, "totalSubmissionRaw": 56303}, "645": {"acRate": 44.52042029192222, "difficulty": "Easy", "likes": 4749, "dislikes": 1163, "categoryTitle": "Algorithms", "frontendQuestionId": "645", "paidOnly": false, "title": "Set Mismatch", "titleSlug": "set-mismatch", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 468199, "totalSubmissionRaw": 1051649}, "646": {"acRate": 60.11939436364615, "difficulty": "Medium", "likes": 4601, "dislikes": 132, "categoryTitle": "Algorithms", "frontendQuestionId": "646", "paidOnly": false, "title": "Maximum Length of Pair Chain", "titleSlug": "maximum-length-of-pair-chain", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 245621, "totalSubmissionRaw": 408556}, "647": {"acRate": 70.51654590119941, "difficulty": "Medium", "likes": 10801, "dislikes": 239, "categoryTitle": "Algorithms", "frontendQuestionId": "647", "paidOnly": false, "title": "Palindromic Substrings", "titleSlug": "palindromic-substrings", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 853965, "totalSubmissionRaw": 1211011}, "648": {"acRate": 68.05956135553774, "difficulty": "Medium", "likes": 2933, "dislikes": 215, "categoryTitle": "Algorithms", "frontendQuestionId": "648", "paidOnly": false, "title": "Replace Words", "titleSlug": "replace-words", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 272541, "totalSubmissionRaw": 400449}, "649": {"acRate": 47.87025366885422, "difficulty": "Medium", "likes": 2382, "dislikes": 1826, "categoryTitle": "Algorithms", "frontendQuestionId": "649", "paidOnly": false, "title": "Dota2 Senate", "titleSlug": "dota2-senate", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 165217, "totalSubmissionRaw": 345135}, "650": {"acRate": 54.35907535701322, "difficulty": "Medium", "likes": 3529, "dislikes": 214, "categoryTitle": "Algorithms", "frontendQuestionId": "650", "paidOnly": false, "title": "2 Keys Keyboard", "titleSlug": "2-keys-keyboard", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 140764, "totalSubmissionRaw": 258953}, "651": {"acRate": 55.857053198951526, "difficulty": "Medium", "likes": 709, "dislikes": 93, "categoryTitle": "Algorithms", "frontendQuestionId": "651", "paidOnly": true, "title": "4 Keys Keyboard", "titleSlug": "4-keys-keyboard", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 30260, "totalSubmissionRaw": 54174}, "652": {"acRate": 59.58378704315195, "difficulty": "Medium", "likes": 5841, "dislikes": 474, "categoryTitle": "Algorithms", "frontendQuestionId": "652", "paidOnly": false, "title": "Find Duplicate Subtrees", "titleSlug": "find-duplicate-subtrees", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 269763, "totalSubmissionRaw": 452746}, "653": {"acRate": 61.485847088065334, "difficulty": "Easy", "likes": 6760, "dislikes": 272, "categoryTitle": "Algorithms", "frontendQuestionId": "653", "paidOnly": false, "title": "Two Sum IV - Input is a BST", "titleSlug": "two-sum-iv-input-is-a-bst", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 567226, "totalSubmissionRaw": 922531}, "654": {"acRate": 85.54361387020938, "difficulty": "Medium", "likes": 5224, "dislikes": 341, "categoryTitle": "Algorithms", "frontendQuestionId": "654", "paidOnly": false, "title": "Maximum Binary Tree", "titleSlug": "maximum-binary-tree", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 302376, "totalSubmissionRaw": 353476}, "655": {"acRate": 64.44879907953401, "difficulty": "Medium", "likes": 492, "dislikes": 453, "categoryTitle": "Algorithms", "frontendQuestionId": "655", "paidOnly": false, "title": "Print Binary Tree", "titleSlug": "print-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 71697, "totalSubmissionRaw": 111247}, "656": {"acRate": 32.161165572443565, "difficulty": "Hard", "likes": 246, "dislikes": 110, "categoryTitle": "Algorithms", "frontendQuestionId": "656", "paidOnly": true, "title": "Coin Path", "titleSlug": "coin-path", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 14304, "totalSubmissionRaw": 44476}, "657": {"acRate": 75.89307540689913, "difficulty": "Easy", "likes": 2431, "dislikes": 747, "categoryTitle": "Algorithms", "frontendQuestionId": "657", "paidOnly": false, "title": "Robot Return to Origin", "titleSlug": "robot-return-to-origin", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 443954, "totalSubmissionRaw": 584973}, "658": {"acRate": 47.70125989914841, "difficulty": "Medium", "likes": 8226, "dislikes": 700, "categoryTitle": "Algorithms", "frontendQuestionId": "658", "paidOnly": false, "title": "Find K Closest Elements", "titleSlug": "find-k-closest-elements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 575703, "totalSubmissionRaw": 1206904}, "659": {"acRate": 51.15066209116114, "difficulty": "Medium", "likes": 4434, "dislikes": 804, "categoryTitle": "Algorithms", "frontendQuestionId": "659", "paidOnly": false, "title": "Split Array into Consecutive Subsequences", "titleSlug": "split-array-into-consecutive-subsequences", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 131915, "totalSubmissionRaw": 257895}, "660": {"acRate": 57.446243695248214, "difficulty": "Hard", "likes": 162, "dislikes": 204, "categoryTitle": "Algorithms", "frontendQuestionId": "660", "paidOnly": true, "title": "Remove 9", "titleSlug": "remove-9", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 10820, "totalSubmissionRaw": 18835}, "661": {"acRate": 67.51439462813212, "difficulty": "Easy", "likes": 1132, "dislikes": 2914, "categoryTitle": "Algorithms", "frontendQuestionId": "661", "paidOnly": false, "title": "Image Smoother", "titleSlug": "image-smoother", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 169318, "totalSubmissionRaw": 250788}, "662": {"acRate": 43.137993516180735, "difficulty": "Medium", "likes": 8800, "dislikes": 1216, "categoryTitle": "Algorithms", "frontendQuestionId": "662", "paidOnly": false, "title": "Maximum Width of Binary Tree", "titleSlug": "maximum-width-of-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 404247, "totalSubmissionRaw": 937102}, "663": {"acRate": 41.57502848512149, "difficulty": "Medium", "likes": 483, "dislikes": 37, "categoryTitle": "Algorithms", "frontendQuestionId": "663", "paidOnly": true, "title": "Equal Tree Partition", "titleSlug": "equal-tree-partition", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 31380, "totalSubmissionRaw": 75478}, "664": {"acRate": 55.03985854054173, "difficulty": "Hard", "likes": 2208, "dislikes": 210, "categoryTitle": "Algorithms", "frontendQuestionId": "664", "paidOnly": false, "title": "Strange Printer", "titleSlug": "strange-printer", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 75327, "totalSubmissionRaw": 136859}, "665": {"acRate": 24.805178767572908, "difficulty": "Medium", "likes": 5724, "dislikes": 778, "categoryTitle": "Algorithms", "frontendQuestionId": "665", "paidOnly": false, "title": "Non-decreasing Array", "titleSlug": "non-decreasing-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 267155, "totalSubmissionRaw": 1077013}, "666": {"acRate": 61.45380175745706, "difficulty": "Medium", "likes": 399, "dislikes": 509, "categoryTitle": "Algorithms", "frontendQuestionId": "666", "paidOnly": true, "title": "Path Sum IV", "titleSlug": "path-sum-iv", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 35457, "totalSubmissionRaw": 57697}, "667": {"acRate": 60.25947685761841, "difficulty": "Medium", "likes": 794, "dislikes": 1053, "categoryTitle": "Algorithms", "frontendQuestionId": "667", "paidOnly": false, "title": "Beautiful Arrangement II", "titleSlug": "beautiful-arrangement-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 54668, "totalSubmissionRaw": 90721}, "668": {"acRate": 51.99075664366237, "difficulty": "Hard", "likes": 2158, "dislikes": 58, "categoryTitle": "Algorithms", "frontendQuestionId": "668", "paidOnly": false, "title": "Kth Smallest Number in Multiplication Table", "titleSlug": "kth-smallest-number-in-multiplication-table", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 66596, "totalSubmissionRaw": 128092}, "669": {"acRate": 66.28729289082375, "difficulty": "Medium", "likes": 5850, "dislikes": 260, "categoryTitle": "Algorithms", "frontendQuestionId": "669", "paidOnly": false, "title": "Trim a Binary Search Tree", "titleSlug": "trim-a-binary-search-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 300416, "totalSubmissionRaw": 453203}, "670": {"acRate": 48.94317663980617, "difficulty": "Medium", "likes": 3388, "dislikes": 207, "categoryTitle": "Algorithms", "frontendQuestionId": "670", "paidOnly": false, "title": "Maximum Swap", "titleSlug": "maximum-swap", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 260986, "totalSubmissionRaw": 533237}, "671": {"acRate": 44.68252966422621, "difficulty": "Easy", "likes": 1858, "dislikes": 1878, "categoryTitle": "Algorithms", "frontendQuestionId": "671", "paidOnly": false, "title": "Second Minimum Node In a Binary Tree", "titleSlug": "second-minimum-node-in-a-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 198226, "totalSubmissionRaw": 443632}, "672": {"acRate": 50.15545356485692, "difficulty": "Medium", "likes": 163, "dislikes": 224, "categoryTitle": "Algorithms", "frontendQuestionId": "672", "paidOnly": false, "title": "Bulb Switcher II", "titleSlug": "bulb-switcher-ii", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 23714, "totalSubmissionRaw": 47281}, "673": {"acRate": 48.567231006016506, "difficulty": "Medium", "likes": 6807, "dislikes": 270, "categoryTitle": "Algorithms", "frontendQuestionId": "673", "paidOnly": false, "title": "Number of Longest Increasing Subsequence", "titleSlug": "number-of-longest-increasing-subsequence", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 242977, "totalSubmissionRaw": 500290}, "674": {"acRate": 50.45706332893997, "difficulty": "Easy", "likes": 2345, "dislikes": 181, "categoryTitle": "Algorithms", "frontendQuestionId": "674", "paidOnly": false, "title": "Longest Continuous Increasing Subsequence", "titleSlug": "longest-continuous-increasing-subsequence", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 273722, "totalSubmissionRaw": 542485}, "675": {"acRate": 34.52310259367409, "difficulty": "Hard", "likes": 1232, "dislikes": 673, "categoryTitle": "Algorithms", "frontendQuestionId": "675", "paidOnly": false, "title": "Cut Off Trees for Golf Event", "titleSlug": "cut-off-trees-for-golf-event", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 70346, "totalSubmissionRaw": 203765}, "676": {"acRate": 57.64435849220742, "difficulty": "Medium", "likes": 1407, "dislikes": 210, "categoryTitle": "Algorithms", "frontendQuestionId": "676", "paidOnly": false, "title": "Implement Magic Dictionary", "titleSlug": "implement-magic-dictionary", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 86142, "totalSubmissionRaw": 149437}, "677": {"acRate": 56.83714491599348, "difficulty": "Medium", "likes": 1654, "dislikes": 156, "categoryTitle": "Algorithms", "frontendQuestionId": "677", "paidOnly": false, "title": "Map Sum Pairs", "titleSlug": "map-sum-pairs", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 119890, "totalSubmissionRaw": 210936}, "678": {"acRate": 38.159304805458, "difficulty": "Medium", "likes": 6195, "dislikes": 192, "categoryTitle": "Algorithms", "frontendQuestionId": "678", "paidOnly": false, "title": "Valid Parenthesis String", "titleSlug": "valid-parenthesis-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 395602, "totalSubmissionRaw": 1036711}, "679": {"acRate": 49.44121042418884, "difficulty": "Hard", "likes": 1470, "dislikes": 251, "categoryTitle": "Algorithms", "frontendQuestionId": "679", "paidOnly": false, "title": "24 Game", "titleSlug": "24-game", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 80516, "totalSubmissionRaw": 162852}, "680": {"acRate": 41.164513757613946, "difficulty": "Easy", "likes": 8263, "dislikes": 445, "categoryTitle": "Algorithms", "frontendQuestionId": "680", "paidOnly": false, "title": "Valid Palindrome II", "titleSlug": "valid-palindrome-ii", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 783932, "totalSubmissionRaw": 1904390}, "681": {"acRate": 46.778814773372666, "difficulty": "Medium", "likes": 730, "dislikes": 1065, "categoryTitle": "Algorithms", "frontendQuestionId": "681", "paidOnly": true, "title": "Next Closest Time", "titleSlug": "next-closest-time", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 110369, "totalSubmissionRaw": 235938}, "682": {"acRate": 77.06668766620427, "difficulty": "Easy", "likes": 2869, "dislikes": 1911, "categoryTitle": "Algorithms", "frontendQuestionId": "682", "paidOnly": false, "title": "Baseball Game", "titleSlug": "baseball-game", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 381671, "totalSubmissionRaw": 495247}, "683": {"acRate": 37.160429931514265, "difficulty": "Hard", "likes": 800, "dislikes": 693, "categoryTitle": "Algorithms", "frontendQuestionId": "683", "paidOnly": true, "title": "K Empty Slots", "titleSlug": "k-empty-slots", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}, {"name": "Monotonic Queue", "id": "VG9waWNUYWdOb2RlOjYxMDcx", "slug": "monotonic-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 61748, "totalSubmissionRaw": 166166}, "684": {"acRate": 63.31022561893298, "difficulty": "Medium", "likes": 6214, "dislikes": 404, "categoryTitle": "Algorithms", "frontendQuestionId": "684", "paidOnly": false, "title": "Redundant Connection", "titleSlug": "redundant-connection", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 382379, "totalSubmissionRaw": 603979}, "685": {"acRate": 34.58505997560153, "difficulty": "Hard", "likes": 2342, "dislikes": 317, "categoryTitle": "Algorithms", "frontendQuestionId": "685", "paidOnly": false, "title": "Redundant Connection II", "titleSlug": "redundant-connection-ii", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 72860, "totalSubmissionRaw": 210669}, "686": {"acRate": 35.43341760091593, "difficulty": "Medium", "likes": 2562, "dislikes": 983, "categoryTitle": "Algorithms", "frontendQuestionId": "686", "paidOnly": false, "title": "Repeated String Match", "titleSlug": "repeated-string-match", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 177025, "totalSubmissionRaw": 499599}, "687": {"acRate": 41.784454454032236, "difficulty": "Medium", "likes": 4248, "dislikes": 673, "categoryTitle": "Algorithms", "frontendQuestionId": "687", "paidOnly": false, "title": "Longest Univalue Path", "titleSlug": "longest-univalue-path", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 188221, "totalSubmissionRaw": 450457}, "688": {"acRate": 56.28197799561041, "difficulty": "Medium", "likes": 3845, "dislikes": 475, "categoryTitle": "Algorithms", "frontendQuestionId": "688", "paidOnly": false, "title": "Knight Probability in Chessboard", "titleSlug": "knight-probability-in-chessboard", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 159502, "totalSubmissionRaw": 283398}, "689": {"acRate": 50.25059283471127, "difficulty": "Hard", "likes": 1971, "dislikes": 116, "categoryTitle": "Algorithms", "frontendQuestionId": "689", "paidOnly": false, "title": "Maximum Sum of 3 Non-Overlapping Subarrays", "titleSlug": "maximum-sum-of-3-non-overlapping-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 78406, "totalSubmissionRaw": 156030}, "690": {"acRate": 67.32322793606671, "difficulty": "Medium", "likes": 2105, "dislikes": 1338, "categoryTitle": "Algorithms", "frontendQuestionId": "690", "paidOnly": false, "title": "Employee Importance", "titleSlug": "employee-importance", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 217006, "totalSubmissionRaw": 322335}, "691": {"acRate": 49.00510253700474, "difficulty": "Hard", "likes": 1225, "dislikes": 114, "categoryTitle": "Algorithms", "frontendQuestionId": "691", "paidOnly": false, "title": "Stickers to Spell Word", "titleSlug": "stickers-to-spell-word", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 75583, "totalSubmissionRaw": 154231}, "692": {"acRate": 58.326990738738175, "difficulty": "Medium", "likes": 7664, "dislikes": 346, "categoryTitle": "Algorithms", "frontendQuestionId": "692", "paidOnly": false, "title": "Top K Frequent Words", "titleSlug": "top-k-frequent-words", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Bucket Sort", "id": "VG9waWNUYWdOb2RlOjYxMDYw", "slug": "bucket-sort"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 633763, "totalSubmissionRaw": 1086569}, "693": {"acRate": 62.791603627435876, "difficulty": "Easy", "likes": 1361, "dislikes": 111, "categoryTitle": "Algorithms", "frontendQuestionId": "693", "paidOnly": false, "title": "Binary Number with Alternating Bits", "titleSlug": "binary-number-with-alternating-bits", "topicTags": [{"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 138615, "totalSubmissionRaw": 220757}, "694": {"acRate": 61.51854398556019, "difficulty": "Medium", "likes": 2234, "dislikes": 142, "categoryTitle": "Algorithms", "frontendQuestionId": "694", "paidOnly": true, "title": "Number of Distinct Islands", "titleSlug": "number-of-distinct-islands", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 171774, "totalSubmissionRaw": 279224}, "695": {"acRate": 72.39690394619971, "difficulty": "Medium", "likes": 9984, "dislikes": 203, "categoryTitle": "Algorithms", "frontendQuestionId": "695", "paidOnly": false, "title": "Max Area of Island", "titleSlug": "max-area-of-island", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 912893, "totalSubmissionRaw": 1260957}, "696": {"acRate": 65.63670296639401, "difficulty": "Easy", "likes": 3985, "dislikes": 869, "categoryTitle": "Algorithms", "frontendQuestionId": "696", "paidOnly": false, "title": "Count Binary Substrings", "titleSlug": "count-binary-substrings", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 213125, "totalSubmissionRaw": 324704}, "697": {"acRate": 56.701314810859216, "difficulty": "Easy", "likes": 3039, "dislikes": 1736, "categoryTitle": "Algorithms", "frontendQuestionId": "697", "paidOnly": false, "title": "Degree of an Array", "titleSlug": "degree-of-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 220325, "totalSubmissionRaw": 388569}, "698": {"acRate": 38.18419331959129, "difficulty": "Medium", "likes": 7138, "dislikes": 513, "categoryTitle": "Algorithms", "frontendQuestionId": "698", "paidOnly": false, "title": "Partition to K Equal Sum Subsets", "titleSlug": "partition-to-k-equal-sum-subsets", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 275639, "totalSubmissionRaw": 721869}, "699": {"acRate": 45.39490861618799, "difficulty": "Hard", "likes": 633, "dislikes": 75, "categoryTitle": "Algorithms", "frontendQuestionId": "699", "paidOnly": false, "title": "Falling Squares", "titleSlug": "falling-squares", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 27818, "totalSubmissionRaw": 61280}, "700": {"acRate": 80.41293274861766, "difficulty": "Easy", "likes": 5969, "dislikes": 194, "categoryTitle": "Algorithms", "frontendQuestionId": "700", "paidOnly": false, "title": "Search in a Binary Search Tree", "titleSlug": "search-in-a-binary-search-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 944696, "totalSubmissionRaw": 1174808}, "701": {"acRate": 73.68418327724567, "difficulty": "Medium", "likes": 5866, "dislikes": 177, "categoryTitle": "Algorithms", "frontendQuestionId": "701", "paidOnly": false, "title": "Insert into a Binary Search Tree", "titleSlug": "insert-into-a-binary-search-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 569282, "totalSubmissionRaw": 772598}, "702": {"acRate": 72.27030988122792, "difficulty": "Medium", "likes": 910, "dislikes": 49, "categoryTitle": "Algorithms", "frontendQuestionId": "702", "paidOnly": true, "title": "Search in a Sorted Array of Unknown Size", "titleSlug": "search-in-a-sorted-array-of-unknown-size", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 99608, "totalSubmissionRaw": 137827}, "703": {"acRate": 59.11595008266958, "difficulty": "Easy", "likes": 5832, "dislikes": 3713, "categoryTitle": "Algorithms", "frontendQuestionId": "703", "paidOnly": false, "title": "Kth Largest Element in a Stream", "titleSlug": "kth-largest-element-in-a-stream", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}, {"name": "Data Stream", "id": "VG9waWNUYWdOb2RlOjYxMDYz", "slug": "data-stream"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 689342, "totalSubmissionRaw": 1166084}, "704": {"acRate": 58.17489521953425, "difficulty": "Easy", "likes": 11904, "dislikes": 253, "categoryTitle": "Algorithms", "frontendQuestionId": "704", "paidOnly": false, "title": "Binary Search", "titleSlug": "binary-search", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 2593366, "totalSubmissionRaw": 4457875}, "705": {"acRate": 67.13422253173489, "difficulty": "Easy", "likes": 3784, "dislikes": 309, "categoryTitle": "Algorithms", "frontendQuestionId": "705", "paidOnly": false, "title": "Design HashSet", "titleSlug": "design-hashset", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 435734, "totalSubmissionRaw": 649049}, "706": {"acRate": 65.59431209303904, "difficulty": "Easy", "likes": 5113, "dislikes": 467, "categoryTitle": "Algorithms", "frontendQuestionId": "706", "paidOnly": false, "title": "Design HashMap", "titleSlug": "design-hashmap", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 599492, "totalSubmissionRaw": 913939}, "707": {"acRate": 28.38784665046133, "difficulty": "Medium", "likes": 2660, "dislikes": 1622, "categoryTitle": "Algorithms", "frontendQuestionId": "707", "paidOnly": false, "title": "Design Linked List", "titleSlug": "design-linked-list", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 347547, "totalSubmissionRaw": 1224282}, "708": {"acRate": 36.48962139092761, "difficulty": "Medium", "likes": 1222, "dislikes": 777, "categoryTitle": "Algorithms", "frontendQuestionId": "708", "paidOnly": true, "title": "Insert into a Sorted Circular Linked List", "titleSlug": "insert-into-a-sorted-circular-linked-list", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 180574, "totalSubmissionRaw": 494864}, "709": {"acRate": 83.58382336692979, "difficulty": "Easy", "likes": 1851, "dislikes": 2774, "categoryTitle": "Algorithms", "frontendQuestionId": "709", "paidOnly": false, "title": "To Lower Case", "titleSlug": "to-lower-case", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 544679, "totalSubmissionRaw": 651656}, "710": {"acRate": 33.52363446605345, "difficulty": "Hard", "likes": 866, "dislikes": 119, "categoryTitle": "Algorithms", "frontendQuestionId": "710", "paidOnly": false, "title": "Random Pick with Blacklist", "titleSlug": "random-pick-with-blacklist", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Randomized", "id": "VG9waWNUYWdOb2RlOjYxMDc1", "slug": "randomized"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 43042, "totalSubmissionRaw": 128393}, "711": {"acRate": 53.084242283592474, "difficulty": "Hard", "likes": 263, "dislikes": 272, "categoryTitle": "Algorithms", "frontendQuestionId": "711", "paidOnly": true, "title": "Number of Distinct Islands II", "titleSlug": "number-of-distinct-islands-ii", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11437, "totalSubmissionRaw": 21545}, "712": {"acRate": 65.22533175666798, "difficulty": "Medium", "likes": 3987, "dislikes": 107, "categoryTitle": "Algorithms", "frontendQuestionId": "712", "paidOnly": false, "title": "Minimum ASCII Delete Sum for Two Strings", "titleSlug": "minimum-ascii-delete-sum-for-two-strings", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 148929, "totalSubmissionRaw": 228330}, "713": {"acRate": 51.675921744755115, "difficulty": "Medium", "likes": 6861, "dislikes": 218, "categoryTitle": "Algorithms", "frontendQuestionId": "713", "paidOnly": false, "title": "Subarray Product Less Than K", "titleSlug": "subarray-product-less-than-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 423414, "totalSubmissionRaw": 819367}, "714": {"acRate": 69.13685480716782, "difficulty": "Medium", "likes": 7174, "dislikes": 214, "categoryTitle": "Algorithms", "frontendQuestionId": "714", "paidOnly": false, "title": "Best Time to Buy and Sell Stock with Transaction Fee", "titleSlug": "best-time-to-buy-and-sell-stock-with-transaction-fee", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 394190, "totalSubmissionRaw": 570159}, "715": {"acRate": 43.88016754266884, "difficulty": "Hard", "likes": 1494, "dislikes": 126, "categoryTitle": "Algorithms", "frontendQuestionId": "715", "paidOnly": false, "title": "Range Module", "titleSlug": "range-module", "topicTags": [{"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 75638, "totalSubmissionRaw": 172374}, "716": {"acRate": 45.068325004799334, "difficulty": "Hard", "likes": 1922, "dislikes": 510, "categoryTitle": "Algorithms", "frontendQuestionId": "716", "paidOnly": true, "title": "Max Stack", "titleSlug": "max-stack", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Doubly-Linked List", "id": "VG9waWNUYWdOb2RlOjYxMDU4", "slug": "doubly-linked-list"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 154944, "totalSubmissionRaw": 343797}, "717": {"acRate": 45.23104954596249, "difficulty": "Easy", "likes": 869, "dislikes": 2113, "categoryTitle": "Algorithms", "frontendQuestionId": "717", "paidOnly": false, "title": "1-bit and 2-bit Characters", "titleSlug": "1-bit-and-2-bit-characters", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 138023, "totalSubmissionRaw": 305150}, "718": {"acRate": 50.95366768615573, "difficulty": "Medium", "likes": 6803, "dislikes": 169, "categoryTitle": "Algorithms", "frontendQuestionId": "718", "paidOnly": false, "title": "Maximum Length of Repeated Subarray", "titleSlug": "maximum-length-of-repeated-subarray", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 308874, "totalSubmissionRaw": 606186}, "719": {"acRate": 45.1716179548026, "difficulty": "Hard", "likes": 3689, "dislikes": 117, "categoryTitle": "Algorithms", "frontendQuestionId": "719", "paidOnly": false, "title": "Find K-th Smallest Pair Distance", "titleSlug": "find-k-th-smallest-pair-distance", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 180456, "totalSubmissionRaw": 399491}, "720": {"acRate": 52.66788354292514, "difficulty": "Medium", "likes": 1967, "dislikes": 1494, "categoryTitle": "Algorithms", "frontendQuestionId": "720", "paidOnly": false, "title": "Longest Word in Dictionary", "titleSlug": "longest-word-in-dictionary", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 156678, "totalSubmissionRaw": 297483}, "721": {"acRate": 57.74699568846895, "difficulty": "Medium", "likes": 6798, "dislikes": 1167, "categoryTitle": "Algorithms", "frontendQuestionId": "721", "paidOnly": false, "title": "Accounts Merge", "titleSlug": "accounts-merge", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 415467, "totalSubmissionRaw": 719460}, "722": {"acRate": 38.90920939227681, "difficulty": "Medium", "likes": 719, "dislikes": 1813, "categoryTitle": "Algorithms", "frontendQuestionId": "722", "paidOnly": false, "title": "Remove Comments", "titleSlug": "remove-comments", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 74038, "totalSubmissionRaw": 190284}, "723": {"acRate": 76.90950525619348, "difficulty": "Medium", "likes": 1016, "dislikes": 525, "categoryTitle": "Algorithms", "frontendQuestionId": "723", "paidOnly": true, "title": "Candy Crush", "titleSlug": "candy-crush", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 73234, "totalSubmissionRaw": 95221}, "724": {"acRate": 58.382346360063096, "difficulty": "Easy", "likes": 8390, "dislikes": 855, "categoryTitle": "Algorithms", "frontendQuestionId": "724", "paidOnly": false, "title": "Find Pivot Index", "titleSlug": "find-pivot-index", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1161075, "totalSubmissionRaw": 1988747}, "725": {"acRate": 64.27882000446445, "difficulty": "Medium", "likes": 3958, "dislikes": 317, "categoryTitle": "Algorithms", "frontendQuestionId": "725", "paidOnly": false, "title": "Split Linked List in Parts", "titleSlug": "split-linked-list-in-parts", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 204451, "totalSubmissionRaw": 318069}, "726": {"acRate": 65.20513374835103, "difficulty": "Hard", "likes": 1876, "dislikes": 406, "categoryTitle": "Algorithms", "frontendQuestionId": "726", "paidOnly": false, "title": "Number of Atoms", "titleSlug": "number-of-atoms", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 147792, "totalSubmissionRaw": 226657}, "727": {"acRate": 43.52404484056843, "difficulty": "Hard", "likes": 1456, "dislikes": 91, "categoryTitle": "Algorithms", "frontendQuestionId": "727", "paidOnly": true, "title": "Minimum Window Subsequence", "titleSlug": "minimum-window-subsequence", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 92832, "totalSubmissionRaw": 213289}, "728": {"acRate": 78.90030887042121, "difficulty": "Easy", "likes": 1785, "dislikes": 375, "categoryTitle": "Algorithms", "frontendQuestionId": "728", "paidOnly": false, "title": "Self Dividing Numbers", "titleSlug": "self-dividing-numbers", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 252638, "totalSubmissionRaw": 320199}, "729": {"acRate": 56.58860080962489, "difficulty": "Medium", "likes": 4218, "dislikes": 112, "categoryTitle": "Algorithms", "frontendQuestionId": "729", "paidOnly": false, "title": "My Calendar I", "titleSlug": "my-calendar-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 289783, "totalSubmissionRaw": 512088}, "730": {"acRate": 45.80338637933751, "difficulty": "Hard", "likes": 1926, "dislikes": 98, "categoryTitle": "Algorithms", "frontendQuestionId": "730", "paidOnly": false, "title": "Count Different Palindromic Subsequences", "titleSlug": "count-different-palindromic-subsequences", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 37791, "totalSubmissionRaw": 82507}, "731": {"acRate": 55.74551826391697, "difficulty": "Medium", "likes": 1752, "dislikes": 148, "categoryTitle": "Algorithms", "frontendQuestionId": "731", "paidOnly": false, "title": "My Calendar II", "titleSlug": "my-calendar-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 103394, "totalSubmissionRaw": 185475}, "732": {"acRate": 71.6654112860016, "difficulty": "Hard", "likes": 1962, "dislikes": 269, "categoryTitle": "Algorithms", "frontendQuestionId": "732", "paidOnly": false, "title": "My Calendar III", "titleSlug": "my-calendar-iii", "topicTags": [{"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 92290, "totalSubmissionRaw": 128779}, "733": {"acRate": 64.62979820713537, "difficulty": "Easy", "likes": 8470, "dislikes": 878, "categoryTitle": "Algorithms", "frontendQuestionId": "733", "paidOnly": false, "title": "Flood Fill", "titleSlug": "flood-fill", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 963426, "totalSubmissionRaw": 1490684}, "734": {"acRate": 44.37906736976208, "difficulty": "Easy", "likes": 47, "dislikes": 58, "categoryTitle": "Algorithms", "frontendQuestionId": "734", "paidOnly": true, "title": "Sentence Similarity", "titleSlug": "sentence-similarity", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 67580, "totalSubmissionRaw": 152279}, "735": {"acRate": 44.63579548219677, "difficulty": "Medium", "likes": 8026, "dislikes": 1095, "categoryTitle": "Algorithms", "frontendQuestionId": "735", "paidOnly": false, "title": "Asteroid Collision", "titleSlug": "asteroid-collision", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 568649, "totalSubmissionRaw": 1273972}, "736": {"acRate": 51.9990866537276, "difficulty": "Hard", "likes": 476, "dislikes": 363, "categoryTitle": "Algorithms", "frontendQuestionId": "736", "paidOnly": false, "title": "Parse Lisp Expression", "titleSlug": "parse-lisp-expression", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22773, "totalSubmissionRaw": 43795}, "737": {"acRate": 50.147003497429175, "difficulty": "Medium", "likes": 840, "dislikes": 43, "categoryTitle": "Algorithms", "frontendQuestionId": "737", "paidOnly": true, "title": "Sentence Similarity II", "titleSlug": "sentence-similarity-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 71978, "totalSubmissionRaw": 143534}, "738": {"acRate": 48.28536302522474, "difficulty": "Medium", "likes": 1324, "dislikes": 105, "categoryTitle": "Algorithms", "frontendQuestionId": "738", "paidOnly": false, "title": "Monotone Increasing Digits", "titleSlug": "monotone-increasing-digits", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 55378, "totalSubmissionRaw": 114689}, "739": {"acRate": 66.25800838907955, "difficulty": "Medium", "likes": 13239, "dislikes": 327, "categoryTitle": "Algorithms", "frontendQuestionId": "739", "paidOnly": false, "title": "Daily Temperatures", "titleSlug": "daily-temperatures", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1049499, "totalSubmissionRaw": 1583957}, "740": {"acRate": 56.51747122180439, "difficulty": "Medium", "likes": 7543, "dislikes": 382, "categoryTitle": "Algorithms", "frontendQuestionId": "740", "paidOnly": false, "title": "Delete and Earn", "titleSlug": "delete-and-earn", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 354089, "totalSubmissionRaw": 626514}, "741": {"acRate": 37.15398365112947, "difficulty": "Hard", "likes": 4291, "dislikes": 159, "categoryTitle": "Algorithms", "frontendQuestionId": "741", "paidOnly": false, "title": "Cherry Pickup", "titleSlug": "cherry-pickup", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 83767, "totalSubmissionRaw": 225459}, "742": {"acRate": 46.437200459460534, "difficulty": "Medium", "likes": 860, "dislikes": 178, "categoryTitle": "Algorithms", "frontendQuestionId": "742", "paidOnly": true, "title": "Closest Leaf in a Binary Tree", "titleSlug": "closest-leaf-in-a-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 46896, "totalSubmissionRaw": 100988}, "743": {"acRate": 54.773575928836095, "difficulty": "Medium", "likes": 7469, "dislikes": 367, "categoryTitle": "Algorithms", "frontendQuestionId": "743", "paidOnly": false, "title": "Network Delay Time", "titleSlug": "network-delay-time", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 531880, "totalSubmissionRaw": 971053}, "744": {"acRate": 52.614218135013104, "difficulty": "Easy", "likes": 4451, "dislikes": 2196, "categoryTitle": "Algorithms", "frontendQuestionId": "744", "paidOnly": false, "title": "Find Smallest Letter Greater Than Target", "titleSlug": "find-smallest-letter-greater-than-target", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 508508, "totalSubmissionRaw": 966484}, "745": {"acRate": 41.1593123305099, "difficulty": "Hard", "likes": 2279, "dislikes": 484, "categoryTitle": "Algorithms", "frontendQuestionId": "745", "paidOnly": false, "title": "Prefix and Suffix Search", "titleSlug": "prefix-and-suffix-search", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 98351, "totalSubmissionRaw": 238952}, "746": {"acRate": 66.11263599320378, "difficulty": "Easy", "likes": 11464, "dislikes": 1771, "categoryTitle": "Algorithms", "frontendQuestionId": "746", "paidOnly": false, "title": "Min Cost Climbing Stairs", "titleSlug": "min-cost-climbing-stairs", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1246720, "totalSubmissionRaw": 1885753}, "747": {"acRate": 49.29712503207163, "difficulty": "Easy", "likes": 1205, "dislikes": 906, "categoryTitle": "Algorithms", "frontendQuestionId": "747", "paidOnly": false, "title": "Largest Number At Least Twice of Others", "titleSlug": "largest-number-at-least-twice-of-others", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 255542, "totalSubmissionRaw": 518371}, "748": {"acRate": 60.363799514832586, "difficulty": "Easy", "likes": 549, "dislikes": 1107, "categoryTitle": "Algorithms", "frontendQuestionId": "748", "paidOnly": false, "title": "Shortest Completing Word", "titleSlug": "shortest-completing-word", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 79379, "totalSubmissionRaw": 131501}, "749": {"acRate": 51.40894543751463, "difficulty": "Hard", "likes": 395, "dislikes": 458, "categoryTitle": "Algorithms", "frontendQuestionId": "749", "paidOnly": false, "title": "Contain Virus", "titleSlug": "contain-virus", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13172, "totalSubmissionRaw": 25622}, "750": {"acRate": 67.80218242865136, "difficulty": "Medium", "likes": 622, "dislikes": 92, "categoryTitle": "Algorithms", "frontendQuestionId": "750", "paidOnly": true, "title": "Number Of Corner Rectangles", "titleSlug": "number-of-corner-rectangles", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 38772, "totalSubmissionRaw": 57184}, "751": {"acRate": 55.61713967723985, "difficulty": "Medium", "likes": 89, "dislikes": 318, "categoryTitle": "Algorithms", "frontendQuestionId": "751", "paidOnly": true, "title": "IP to CIDR", "titleSlug": "ip-to-cidr", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24986, "totalSubmissionRaw": 44925}, "752": {"acRate": 60.355223295368376, "difficulty": "Medium", "likes": 4771, "dislikes": 220, "categoryTitle": "Algorithms", "frontendQuestionId": "752", "paidOnly": false, "title": "Open the Lock", "titleSlug": "open-the-lock", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 326323, "totalSubmissionRaw": 540672}, "753": {"acRate": 57.07981398880136, "difficulty": "Hard", "likes": 565, "dislikes": 103, "categoryTitle": "Algorithms", "frontendQuestionId": "753", "paidOnly": false, "title": "Cracking the Safe", "titleSlug": "cracking-the-safe", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Eulerian Circuit", "id": "VG9waWNUYWdOb2RlOjYxMDc0", "slug": "eulerian-circuit"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 60145, "totalSubmissionRaw": 105370}, "754": {"acRate": 43.32938071376659, "difficulty": "Medium", "likes": 1818, "dislikes": 812, "categoryTitle": "Algorithms", "frontendQuestionId": "754", "paidOnly": false, "title": "Reach a Number", "titleSlug": "reach-a-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 56638, "totalSubmissionRaw": 130715}, "755": {"acRate": 47.10261080752884, "difficulty": "Medium", "likes": 301, "dislikes": 764, "categoryTitle": "Algorithms", "frontendQuestionId": "755", "paidOnly": true, "title": "Pour Water", "titleSlug": "pour-water", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 38789, "totalSubmissionRaw": 82350}, "756": {"acRate": 52.91993890114638, "difficulty": "Medium", "likes": 537, "dislikes": 480, "categoryTitle": "Algorithms", "frontendQuestionId": "756", "paidOnly": false, "title": "Pyramid Transition Matrix", "titleSlug": "pyramid-transition-matrix", "topicTags": [{"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34299, "totalSubmissionRaw": 64813}, "757": {"acRate": 44.716680715556805, "difficulty": "Hard", "likes": 713, "dislikes": 83, "categoryTitle": "Algorithms", "frontendQuestionId": "757", "paidOnly": false, "title": "Set Intersection Size At Least Two", "titleSlug": "set-intersection-size-at-least-two", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23872, "totalSubmissionRaw": 53385}, "758": {"acRate": 51.555985906022215, "difficulty": "Medium", "likes": 270, "dislikes": 124, "categoryTitle": "Algorithms", "frontendQuestionId": "758", "paidOnly": true, "title": "Bold Words in String", "titleSlug": "bold-words-in-string", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19168, "totalSubmissionRaw": 37179}, "759": {"acRate": 72.24726488409163, "difficulty": "Hard", "likes": 1901, "dislikes": 135, "categoryTitle": "Algorithms", "frontendQuestionId": "759", "paidOnly": true, "title": "Employee Free Time", "titleSlug": "employee-free-time", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 152743, "totalSubmissionRaw": 211417}, "760": {"acRate": 83.69742021536159, "difficulty": "Easy", "likes": 612, "dislikes": 231, "categoryTitle": "Algorithms", "frontendQuestionId": "760", "paidOnly": true, "title": "Find Anagram Mappings", "titleSlug": "find-anagram-mappings", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 102911, "totalSubmissionRaw": 122956}, "761": {"acRate": 61.42542745894701, "difficulty": "Hard", "likes": 705, "dislikes": 218, "categoryTitle": "Algorithms", "frontendQuestionId": "761", "paidOnly": false, "title": "Special Binary String", "titleSlug": "special-binary-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 18142, "totalSubmissionRaw": 29535}, "762": {"acRate": 69.84179256027113, "difficulty": "Easy", "likes": 716, "dislikes": 509, "categoryTitle": "Algorithms", "frontendQuestionId": "762", "paidOnly": false, "title": "Prime Number of Set Bits in Binary Representation", "titleSlug": "prime-number-of-set-bits-in-binary-representation", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 101800, "totalSubmissionRaw": 145758}, "763": {"acRate": 79.96073024420879, "difficulty": "Medium", "likes": 10300, "dislikes": 401, "categoryTitle": "Algorithms", "frontendQuestionId": "763", "paidOnly": false, "title": "Partition Labels", "titleSlug": "partition-labels", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 553844, "totalSubmissionRaw": 692645}, "764": {"acRate": 48.38061580170411, "difficulty": "Medium", "likes": 1464, "dislikes": 233, "categoryTitle": "Algorithms", "frontendQuestionId": "764", "paidOnly": false, "title": "Largest Plus Sign", "titleSlug": "largest-plus-sign", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 59959, "totalSubmissionRaw": 123934}, "765": {"acRate": 57.58556058175789, "difficulty": "Hard", "likes": 2350, "dislikes": 118, "categoryTitle": "Algorithms", "frontendQuestionId": "765", "paidOnly": false, "title": "Couples Holding Hands", "titleSlug": "couples-holding-hands", "topicTags": [{"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 63905, "totalSubmissionRaw": 110974}, "766": {"acRate": 69.11381870302282, "difficulty": "Easy", "likes": 3541, "dislikes": 168, "categoryTitle": "Algorithms", "frontendQuestionId": "766", "paidOnly": false, "title": "Toeplitz Matrix", "titleSlug": "toeplitz-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 343806, "totalSubmissionRaw": 497449}, "767": {"acRate": 54.911121665394816, "difficulty": "Medium", "likes": 8526, "dislikes": 258, "categoryTitle": "Algorithms", "frontendQuestionId": "767", "paidOnly": false, "title": "Reorganize String", "titleSlug": "reorganize-string", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 411594, "totalSubmissionRaw": 749564}, "768": {"acRate": 53.42929789359957, "difficulty": "Hard", "likes": 1839, "dislikes": 55, "categoryTitle": "Algorithms", "frontendQuestionId": "768", "paidOnly": false, "title": "Max Chunks To Make Sorted II", "titleSlug": "max-chunks-to-make-sorted-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 65772, "totalSubmissionRaw": 123101}, "769": {"acRate": 58.53724995725765, "difficulty": "Medium", "likes": 2819, "dislikes": 245, "categoryTitle": "Algorithms", "frontendQuestionId": "769", "paidOnly": false, "title": "Max Chunks To Make Sorted", "titleSlug": "max-chunks-to-make-sorted", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 109563, "totalSubmissionRaw": 187168}, "770": {"acRate": 55.709988590395184, "difficulty": "Hard", "likes": 167, "dislikes": 1411, "categoryTitle": "Algorithms", "frontendQuestionId": "770", "paidOnly": false, "title": "Basic Calculator IV", "titleSlug": "basic-calculator-iv", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10742, "totalSubmissionRaw": 19282}, "771": {"acRate": 88.79553999528387, "difficulty": "Easy", "likes": 5108, "dislikes": 595, "categoryTitle": "Algorithms", "frontendQuestionId": "771", "paidOnly": false, "title": "Jewels and Stones", "titleSlug": "jewels-and-stones", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1084499, "totalSubmissionRaw": 1221344}, "772": {"acRate": 50.974351316621934, "difficulty": "Hard", "likes": 1136, "dislikes": 289, "categoryTitle": "Algorithms", "frontendQuestionId": "772", "paidOnly": true, "title": "Basic Calculator III", "titleSlug": "basic-calculator-iii", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 129718, "totalSubmissionRaw": 254477}, "773": {"acRate": 65.02470339125466, "difficulty": "Hard", "likes": 2027, "dislikes": 52, "categoryTitle": "Algorithms", "frontendQuestionId": "773", "paidOnly": false, "title": "Sliding Puzzle", "titleSlug": "sliding-puzzle", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 96734, "totalSubmissionRaw": 148765}, "774": {"acRate": 52.36291059165793, "difficulty": "Hard", "likes": 681, "dislikes": 97, "categoryTitle": "Algorithms", "frontendQuestionId": "774", "paidOnly": true, "title": "Minimize Max Distance to Gas Station", "titleSlug": "minimize-max-distance-to-gas-station", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 30958, "totalSubmissionRaw": 59122}, "775": {"acRate": 42.42125659176731, "difficulty": "Medium", "likes": 1832, "dislikes": 376, "categoryTitle": "Algorithms", "frontendQuestionId": "775", "paidOnly": false, "title": "Global and Local Inversions", "titleSlug": "global-and-local-inversions", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 77065, "totalSubmissionRaw": 181666}, "776": {"acRate": 82.61957455870163, "difficulty": "Medium", "likes": 1058, "dislikes": 103, "categoryTitle": "Algorithms", "frontendQuestionId": "776", "paidOnly": true, "title": "Split BST", "titleSlug": "split-bst", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 108634, "totalSubmissionRaw": 131487}, "777": {"acRate": 36.87190844980247, "difficulty": "Medium", "likes": 1223, "dislikes": 933, "categoryTitle": "Algorithms", "frontendQuestionId": "777", "paidOnly": false, "title": "Swap Adjacent in LR String", "titleSlug": "swap-adjacent-in-lr-string", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 77747, "totalSubmissionRaw": 210855}, "778": {"acRate": 61.35653585510319, "difficulty": "Hard", "likes": 3725, "dislikes": 249, "categoryTitle": "Algorithms", "frontendQuestionId": "778", "paidOnly": false, "title": "Swim in Rising Water", "titleSlug": "swim-in-rising-water", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 175376, "totalSubmissionRaw": 285831}, "779": {"acRate": 46.73307841953444, "difficulty": "Medium", "likes": 3795, "dislikes": 396, "categoryTitle": "Algorithms", "frontendQuestionId": "779", "paidOnly": false, "title": "K-th Symbol in Grammar", "titleSlug": "k-th-symbol-in-grammar", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 208995, "totalSubmissionRaw": 447210}, "780": {"acRate": 33.31947729281636, "difficulty": "Hard", "likes": 1526, "dislikes": 230, "categoryTitle": "Algorithms", "frontendQuestionId": "780", "paidOnly": false, "title": "Reaching Points", "titleSlug": "reaching-points", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 69736, "totalSubmissionRaw": 209295}, "781": {"acRate": 53.07067254878027, "difficulty": "Medium", "likes": 1335, "dislikes": 621, "categoryTitle": "Algorithms", "frontendQuestionId": "781", "paidOnly": false, "title": "Rabbits in Forest", "titleSlug": "rabbits-in-forest", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 60871, "totalSubmissionRaw": 114698}, "782": {"acRate": 50.901611630790036, "difficulty": "Hard", "likes": 359, "dislikes": 311, "categoryTitle": "Algorithms", "frontendQuestionId": "782", "paidOnly": false, "title": "Transform to Chessboard", "titleSlug": "transform-to-chessboard", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 18066, "totalSubmissionRaw": 35492}, "783": {"acRate": 59.74254851660551, "difficulty": "Easy", "likes": 3492, "dislikes": 419, "categoryTitle": "Algorithms", "frontendQuestionId": "783", "paidOnly": false, "title": "Minimum Distance Between BST Nodes", "titleSlug": "minimum-distance-between-bst-nodes", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 259667, "totalSubmissionRaw": 434643}, "784": {"acRate": 74.40422380796676, "difficulty": "Medium", "likes": 4662, "dislikes": 156, "categoryTitle": "Algorithms", "frontendQuestionId": "784", "paidOnly": false, "title": "Letter Case Permutation", "titleSlug": "letter-case-permutation", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 309468, "totalSubmissionRaw": 415928}, "785": {"acRate": 56.232295017343944, "difficulty": "Medium", "likes": 8310, "dislikes": 386, "categoryTitle": "Algorithms", "frontendQuestionId": "785", "paidOnly": false, "title": "Is Graph Bipartite?", "titleSlug": "is-graph-bipartite", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 597696, "totalSubmissionRaw": 1062905}, "786": {"acRate": 68.18540344514959, "difficulty": "Medium", "likes": 2010, "dislikes": 115, "categoryTitle": "Algorithms", "frontendQuestionId": "786", "paidOnly": false, "title": "K-th Smallest Prime Fraction", "titleSlug": "k-th-smallest-prime-fraction", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 150417, "totalSubmissionRaw": 220600}, "787": {"acRate": 39.529947588346324, "difficulty": "Medium", "likes": 9974, "dislikes": 415, "categoryTitle": "Algorithms", "frontendQuestionId": "787", "paidOnly": false, "title": "Cheapest Flights Within K Stops", "titleSlug": "cheapest-flights-within-k-stops", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 600433, "totalSubmissionRaw": 1518927}, "788": {"acRate": 56.4617845899778, "difficulty": "Medium", "likes": 748, "dislikes": 1928, "categoryTitle": "Algorithms", "frontendQuestionId": "788", "paidOnly": false, "title": "Rotated Digits", "titleSlug": "rotated-digits", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 109405, "totalSubmissionRaw": 193769}, "789": {"acRate": 62.03927461771216, "difficulty": "Medium", "likes": 292, "dislikes": 29, "categoryTitle": "Algorithms", "frontendQuestionId": "789", "paidOnly": false, "title": "Escape The Ghosts", "titleSlug": "escape-the-ghosts", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 30550, "totalSubmissionRaw": 49243}, "790": {"acRate": 50.064923019847896, "difficulty": "Medium", "likes": 3463, "dislikes": 1116, "categoryTitle": "Algorithms", "frontendQuestionId": "790", "paidOnly": false, "title": "Domino and Tromino Tiling", "titleSlug": "domino-and-tromino-tiling", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 143047, "totalSubmissionRaw": 285723}, "791": {"acRate": 70.92892249168457, "difficulty": "Medium", "likes": 3616, "dislikes": 414, "categoryTitle": "Algorithms", "frontendQuestionId": "791", "paidOnly": false, "title": "Custom Sort String", "titleSlug": "custom-sort-string", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 448241, "totalSubmissionRaw": 631958}, "792": {"acRate": 50.878817927231914, "difficulty": "Medium", "likes": 5500, "dislikes": 234, "categoryTitle": "Algorithms", "frontendQuestionId": "792", "paidOnly": false, "title": "Number of Matching Subsequences", "titleSlug": "number-of-matching-subsequences", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 233459, "totalSubmissionRaw": 458854}, "793": {"acRate": 44.87853454065445, "difficulty": "Hard", "likes": 437, "dislikes": 100, "categoryTitle": "Algorithms", "frontendQuestionId": "793", "paidOnly": false, "title": "Preimage Size of Factorial Zeroes Function", "titleSlug": "preimage-size-of-factorial-zeroes-function", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19379, "totalSubmissionRaw": 43181}, "794": {"acRate": 34.72224656861886, "difficulty": "Medium", "likes": 550, "dislikes": 1151, "categoryTitle": "Algorithms", "frontendQuestionId": "794", "paidOnly": false, "title": "Valid Tic-Tac-Toe State", "titleSlug": "valid-tic-tac-toe-state", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 59424, "totalSubmissionRaw": 171141}, "795": {"acRate": 53.31310517156753, "difficulty": "Medium", "likes": 2299, "dislikes": 119, "categoryTitle": "Algorithms", "frontendQuestionId": "795", "paidOnly": false, "title": "Number of Subarrays with Bounded Maximum", "titleSlug": "number-of-subarrays-with-bounded-maximum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 71688, "totalSubmissionRaw": 134466}, "796": {"acRate": 58.9346044489045, "difficulty": "Easy", "likes": 3644, "dislikes": 181, "categoryTitle": "Algorithms", "frontendQuestionId": "796", "paidOnly": false, "title": "Rotate String", "titleSlug": "rotate-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 352370, "totalSubmissionRaw": 597900}, "797": {"acRate": 82.60807814246705, "difficulty": "Medium", "likes": 7249, "dislikes": 147, "categoryTitle": "Algorithms", "frontendQuestionId": "797", "paidOnly": false, "title": "All Paths From Source to Target", "titleSlug": "all-paths-from-source-to-target", "topicTags": [{"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 540920, "totalSubmissionRaw": 654799}, "798": {"acRate": 51.65608312887863, "difficulty": "Hard", "likes": 540, "dislikes": 41, "categoryTitle": "Algorithms", "frontendQuestionId": "798", "paidOnly": false, "title": "Smallest Rotation with Highest Score", "titleSlug": "smallest-rotation-with-highest-score", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14317, "totalSubmissionRaw": 27716}, "799": {"acRate": 58.22404738459702, "difficulty": "Medium", "likes": 3652, "dislikes": 203, "categoryTitle": "Algorithms", "frontendQuestionId": "799", "paidOnly": false, "title": "Champagne Tower", "titleSlug": "champagne-tower", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 156101, "totalSubmissionRaw": 268104}, "800": {"acRate": 67.49351805270693, "difficulty": "Easy", "likes": 108, "dislikes": 684, "categoryTitle": "Algorithms", "frontendQuestionId": "800", "paidOnly": true, "title": "Similar RGB Color", "titleSlug": "similar-rgb-color", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 17441, "totalSubmissionRaw": 25841}, "801": {"acRate": 40.216115102187025, "difficulty": "Hard", "likes": 2814, "dislikes": 138, "categoryTitle": "Algorithms", "frontendQuestionId": "801", "paidOnly": false, "title": "Minimum Swaps To Make Sequences Increasing", "titleSlug": "minimum-swaps-to-make-sequences-increasing", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 80836, "totalSubmissionRaw": 201004}, "802": {"acRate": 63.799511596090895, "difficulty": "Medium", "likes": 5787, "dislikes": 460, "categoryTitle": "Algorithms", "frontendQuestionId": "802", "paidOnly": false, "title": "Find Eventual Safe States", "titleSlug": "find-eventual-safe-states", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 273275, "totalSubmissionRaw": 428334}, "803": {"acRate": 34.92439362673793, "difficulty": "Hard", "likes": 1116, "dislikes": 189, "categoryTitle": "Algorithms", "frontendQuestionId": "803", "paidOnly": false, "title": "Bricks Falling When Hit", "titleSlug": "bricks-falling-when-hit", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 30972, "totalSubmissionRaw": 88683}, "804": {"acRate": 82.94589524324698, "difficulty": "Easy", "likes": 2522, "dislikes": 1536, "categoryTitle": "Algorithms", "frontendQuestionId": "804", "paidOnly": false, "title": "Unique Morse Code Words", "titleSlug": "unique-morse-code-words", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 360346, "totalSubmissionRaw": 434435}, "805": {"acRate": 25.55250053674449, "difficulty": "Hard", "likes": 1271, "dislikes": 136, "categoryTitle": "Algorithms", "frontendQuestionId": "805", "paidOnly": false, "title": "Split Array With Same Average", "titleSlug": "split-array-with-same-average", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 36895, "totalSubmissionRaw": 144389}, "806": {"acRate": 68.92289436602309, "difficulty": "Easy", "likes": 601, "dislikes": 1333, "categoryTitle": "Algorithms", "frontendQuestionId": "806", "paidOnly": false, "title": "Number of Lines To Write String", "titleSlug": "number-of-lines-to-write-string", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 83640, "totalSubmissionRaw": 121353}, "807": {"acRate": 86.20372983095196, "difficulty": "Medium", "likes": 2573, "dislikes": 527, "categoryTitle": "Algorithms", "frontendQuestionId": "807", "paidOnly": false, "title": "Max Increase to Keep City Skyline", "titleSlug": "max-increase-to-keep-city-skyline", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 168024, "totalSubmissionRaw": 194915}, "808": {"acRate": 53.82849790725195, "difficulty": "Medium", "likes": 986, "dislikes": 2677, "categoryTitle": "Algorithms", "frontendQuestionId": "808", "paidOnly": false, "title": "Soup Servings", "titleSlug": "soup-servings", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Probability and Statistics", "id": "VG9waWNUYWdOb2RlOjYxMDc5", "slug": "probability-and-statistics"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 67776, "totalSubmissionRaw": 125911}, "809": {"acRate": 46.21246269584681, "difficulty": "Medium", "likes": 866, "dislikes": 1905, "categoryTitle": "Algorithms", "frontendQuestionId": "809", "paidOnly": false, "title": "Expressive Words", "titleSlug": "expressive-words", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 118925, "totalSubmissionRaw": 257344}, "810": {"acRate": 60.6618990447356, "difficulty": "Hard", "likes": 224, "dislikes": 281, "categoryTitle": "Algorithms", "frontendQuestionId": "810", "paidOnly": false, "title": "Chalkboard XOR Game", "titleSlug": "chalkboard-xor-game", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Brainteaser", "id": "VG9waWNUYWdOb2RlOjMy", "slug": "brainteaser"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 11621, "totalSubmissionRaw": 19157}, "811": {"acRate": 76.365604974698, "difficulty": "Medium", "likes": 1559, "dislikes": 1299, "categoryTitle": "Algorithms", "frontendQuestionId": "811", "paidOnly": false, "title": "Subdomain Visit Count", "titleSlug": "subdomain-visit-count", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 233454, "totalSubmissionRaw": 305706}, "812": {"acRate": 60.994673003502534, "difficulty": "Easy", "likes": 531, "dislikes": 1590, "categoryTitle": "Algorithms", "frontendQuestionId": "812", "paidOnly": false, "title": "Largest Triangle Area", "titleSlug": "largest-triangle-area", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 54159, "totalSubmissionRaw": 88793}, "813": {"acRate": 53.60412737807917, "difficulty": "Medium", "likes": 2104, "dislikes": 99, "categoryTitle": "Algorithms", "frontendQuestionId": "813", "paidOnly": false, "title": "Largest Sum of Averages", "titleSlug": "largest-sum-of-averages", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 54859, "totalSubmissionRaw": 102341}, "814": {"acRate": 72.26576452310775, "difficulty": "Medium", "likes": 4530, "dislikes": 115, "categoryTitle": "Algorithms", "frontendQuestionId": "814", "paidOnly": false, "title": "Binary Tree Pruning", "titleSlug": "binary-tree-pruning", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 248858, "totalSubmissionRaw": 344365}, "815": {"acRate": 47.58327771648574, "difficulty": "Hard", "likes": 4259, "dislikes": 123, "categoryTitle": "Algorithms", "frontendQuestionId": "815", "paidOnly": false, "title": "Bus Routes", "titleSlug": "bus-routes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 209609, "totalSubmissionRaw": 440508}, "816": {"acRate": 56.87854371829305, "difficulty": "Medium", "likes": 322, "dislikes": 661, "categoryTitle": "Algorithms", "frontendQuestionId": "816", "paidOnly": false, "title": "Ambiguous Coordinates", "titleSlug": "ambiguous-coordinates", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30496, "totalSubmissionRaw": 53616}, "817": {"acRate": 56.90900782610204, "difficulty": "Medium", "likes": 1101, "dislikes": 2231, "categoryTitle": "Algorithms", "frontendQuestionId": "817", "paidOnly": false, "title": "Linked List Components", "titleSlug": "linked-list-components", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 98386, "totalSubmissionRaw": 172883}, "818": {"acRate": 43.803399038999856, "difficulty": "Hard", "likes": 1909, "dislikes": 180, "categoryTitle": "Algorithms", "frontendQuestionId": "818", "paidOnly": false, "title": "Race Car", "titleSlug": "race-car", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 89977, "totalSubmissionRaw": 205411}, "819": {"acRate": 44.327567257783116, "difficulty": "Easy", "likes": 1709, "dislikes": 3059, "categoryTitle": "Algorithms", "frontendQuestionId": "819", "paidOnly": false, "title": "Most Common Word", "titleSlug": "most-common-word", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 366624, "totalSubmissionRaw": 827077}, "820": {"acRate": 60.47229137050165, "difficulty": "Medium", "likes": 1752, "dislikes": 653, "categoryTitle": "Algorithms", "frontendQuestionId": "820", "paidOnly": false, "title": "Short Encoding of Words", "titleSlug": "short-encoding-of-words", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 97413, "totalSubmissionRaw": 161087}, "821": {"acRate": 71.72863323905673, "difficulty": "Easy", "likes": 3143, "dislikes": 179, "categoryTitle": "Algorithms", "frontendQuestionId": "821", "paidOnly": false, "title": "Shortest Distance to a Character", "titleSlug": "shortest-distance-to-a-character", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 191476, "totalSubmissionRaw": 266945}, "822": {"acRate": 47.93953398806085, "difficulty": "Medium", "likes": 174, "dislikes": 756, "categoryTitle": "Algorithms", "frontendQuestionId": "822", "paidOnly": false, "title": "Card Flipping Game", "titleSlug": "card-flipping-game", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19916, "totalSubmissionRaw": 41544}, "823": {"acRate": 52.90294475165296, "difficulty": "Medium", "likes": 3301, "dislikes": 256, "categoryTitle": "Algorithms", "frontendQuestionId": "823", "paidOnly": false, "title": "Binary Trees With Factors", "titleSlug": "binary-trees-with-factors", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 150584, "totalSubmissionRaw": 284642}, "824": {"acRate": 68.4430226952528, "difficulty": "Easy", "likes": 911, "dislikes": 1242, "categoryTitle": "Algorithms", "frontendQuestionId": "824", "paidOnly": false, "title": "Goat Latin", "titleSlug": "goat-latin", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 183146, "totalSubmissionRaw": 267589}, "825": {"acRate": 47.90130692743519, "difficulty": "Medium", "likes": 765, "dislikes": 1216, "categoryTitle": "Algorithms", "frontendQuestionId": "825", "paidOnly": false, "title": "Friends Of Appropriate Ages", "titleSlug": "friends-of-appropriate-ages", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 93169, "totalSubmissionRaw": 194502}, "826": {"acRate": 55.91145666002699, "difficulty": "Medium", "likes": 2364, "dislikes": 169, "categoryTitle": "Algorithms", "frontendQuestionId": "826", "paidOnly": false, "title": "Most Profit Assigning Work", "titleSlug": "most-profit-assigning-work", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 208835, "totalSubmissionRaw": 373511}, "827": {"acRate": 48.22131106303768, "difficulty": "Hard", "likes": 3938, "dislikes": 77, "categoryTitle": "Algorithms", "frontendQuestionId": "827", "paidOnly": false, "title": "Making A Large Island", "titleSlug": "making-a-large-island", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 191698, "totalSubmissionRaw": 397539}, "828": {"acRate": 52.54660428916835, "difficulty": "Hard", "likes": 2157, "dislikes": 250, "categoryTitle": "Algorithms", "frontendQuestionId": "828", "paidOnly": false, "title": "Count Unique Characters of All Substrings of a Given String", "titleSlug": "count-unique-characters-of-all-substrings-of-a-given-string", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 73457, "totalSubmissionRaw": 139794}, "829": {"acRate": 41.87926988018206, "difficulty": "Hard", "likes": 1373, "dislikes": 1380, "categoryTitle": "Algorithms", "frontendQuestionId": "829", "paidOnly": false, "title": "Consecutive Numbers Sum", "titleSlug": "consecutive-numbers-sum", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 88150, "totalSubmissionRaw": 210486}, "830": {"acRate": 52.430511079800176, "difficulty": "Easy", "likes": 879, "dislikes": 124, "categoryTitle": "Algorithms", "frontendQuestionId": "830", "paidOnly": false, "title": "Positions of Large Groups", "titleSlug": "positions-of-large-groups", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 98238, "totalSubmissionRaw": 187368}, "831": {"acRate": 49.25624268435428, "difficulty": "Medium", "likes": 168, "dislikes": 449, "categoryTitle": "Algorithms", "frontendQuestionId": "831", "paidOnly": false, "title": "Masking Personal Information", "titleSlug": "masking-personal-information", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20199, "totalSubmissionRaw": 41008}, "832": {"acRate": 82.26467978965503, "difficulty": "Easy", "likes": 3454, "dislikes": 243, "categoryTitle": "Algorithms", "frontendQuestionId": "832", "paidOnly": false, "title": "Flipping an Image", "titleSlug": "flipping-an-image", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 447881, "totalSubmissionRaw": 544439}, "833": {"acRate": 52.27271152020072, "difficulty": "Medium", "likes": 1190, "dislikes": 1018, "categoryTitle": "Algorithms", "frontendQuestionId": "833", "paidOnly": false, "title": "Find And Replace in String", "titleSlug": "find-and-replace-in-string", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 150834, "totalSubmissionRaw": 288552}, "834": {"acRate": 65.27764672095839, "difficulty": "Hard", "likes": 5584, "dislikes": 137, "categoryTitle": "Algorithms", "frontendQuestionId": "834", "paidOnly": false, "title": "Sum of Distances in Tree", "titleSlug": "sum-of-distances-in-tree", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 159111, "totalSubmissionRaw": 243745}, "835": {"acRate": 63.69900734750896, "difficulty": "Medium", "likes": 1332, "dislikes": 481, "categoryTitle": "Algorithms", "frontendQuestionId": "835", "paidOnly": false, "title": "Image Overlap", "titleSlug": "image-overlap", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 94844, "totalSubmissionRaw": 148894}, "836": {"acRate": 45.013689562836596, "difficulty": "Easy", "likes": 1994, "dislikes": 472, "categoryTitle": "Algorithms", "frontendQuestionId": "836", "paidOnly": false, "title": "Rectangle Overlap", "titleSlug": "rectangle-overlap", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 149611, "totalSubmissionRaw": 332369}, "837": {"acRate": 44.96443323293465, "difficulty": "Medium", "likes": 1983, "dislikes": 1833, "categoryTitle": "Algorithms", "frontendQuestionId": "837", "paidOnly": false, "title": "New 21 Game", "titleSlug": "new-21-game", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Probability and Statistics", "id": "VG9waWNUYWdOb2RlOjYxMDc5", "slug": "probability-and-statistics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 77180, "totalSubmissionRaw": 171644}, "838": {"acRate": 57.22650398976007, "difficulty": "Medium", "likes": 3386, "dislikes": 229, "categoryTitle": "Algorithms", "frontendQuestionId": "838", "paidOnly": false, "title": "Push Dominoes", "titleSlug": "push-dominoes", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 126078, "totalSubmissionRaw": 220314}, "839": {"acRate": 55.06915451790001, "difficulty": "Hard", "likes": 2341, "dislikes": 215, "categoryTitle": "Algorithms", "frontendQuestionId": "839", "paidOnly": false, "title": "Similar String Groups", "titleSlug": "similar-string-groups", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 122275, "totalSubmissionRaw": 222039}, "840": {"acRate": 51.728132491375774, "difficulty": "Medium", "likes": 803, "dislikes": 1824, "categoryTitle": "Algorithms", "frontendQuestionId": "840", "paidOnly": false, "title": "Magic Squares In Grid", "titleSlug": "magic-squares-in-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 141551, "totalSubmissionRaw": 273646}, "841": {"acRate": 73.47524441221236, "difficulty": "Medium", "likes": 6144, "dislikes": 279, "categoryTitle": "Algorithms", "frontendQuestionId": "841", "paidOnly": false, "title": "Keys and Rooms", "titleSlug": "keys-and-rooms", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 472124, "totalSubmissionRaw": 642562}, "842": {"acRate": 39.114580807835914, "difficulty": "Medium", "likes": 1133, "dislikes": 306, "categoryTitle": "Algorithms", "frontendQuestionId": "842", "paidOnly": false, "title": "Split Array into Fibonacci Sequence", "titleSlug": "split-array-into-fibonacci-sequence", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 40333, "totalSubmissionRaw": 103115}, "843": {"acRate": 38.82121901187845, "difficulty": "Hard", "likes": 1544, "dislikes": 1788, "categoryTitle": "Algorithms", "frontendQuestionId": "843", "paidOnly": false, "title": "Guess the Word", "titleSlug": "guess-the-word", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 146481, "totalSubmissionRaw": 377322}, "844": {"acRate": 49.24839384661054, "difficulty": "Easy", "likes": 7535, "dislikes": 353, "categoryTitle": "Algorithms", "frontendQuestionId": "844", "paidOnly": false, "title": "Backspace String Compare", "titleSlug": "backspace-string-compare", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 849413, "totalSubmissionRaw": 1724748}, "845": {"acRate": 40.55315818484693, "difficulty": "Medium", "likes": 2781, "dislikes": 80, "categoryTitle": "Algorithms", "frontendQuestionId": "845", "paidOnly": false, "title": "Longest Mountain in Array", "titleSlug": "longest-mountain-in-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 133164, "totalSubmissionRaw": 328369}, "846": {"acRate": 56.73786869905286, "difficulty": "Medium", "likes": 3273, "dislikes": 258, "categoryTitle": "Algorithms", "frontendQuestionId": "846", "paidOnly": false, "title": "Hand of Straights", "titleSlug": "hand-of-straights", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 314679, "totalSubmissionRaw": 554619}, "847": {"acRate": 65.39749911574391, "difficulty": "Hard", "likes": 4317, "dislikes": 169, "categoryTitle": "Algorithms", "frontendQuestionId": "847", "paidOnly": false, "title": "Shortest Path Visiting All Nodes", "titleSlug": "shortest-path-visiting-all-nodes", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 125728, "totalSubmissionRaw": 192252}, "848": {"acRate": 44.8030576020836, "difficulty": "Medium", "likes": 1374, "dislikes": 126, "categoryTitle": "Algorithms", "frontendQuestionId": "848", "paidOnly": false, "title": "Shifting Letters", "titleSlug": "shifting-letters", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 100461, "totalSubmissionRaw": 224228}, "849": {"acRate": 48.26428470390494, "difficulty": "Medium", "likes": 3223, "dislikes": 196, "categoryTitle": "Algorithms", "frontendQuestionId": "849", "paidOnly": false, "title": "Maximize Distance to Closest Person", "titleSlug": "maximize-distance-to-closest-person", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 232018, "totalSubmissionRaw": 480724}, "850": {"acRate": 54.27706167917091, "difficulty": "Hard", "likes": 968, "dislikes": 62, "categoryTitle": "Algorithms", "frontendQuestionId": "850", "paidOnly": false, "title": "Rectangle Area II", "titleSlug": "rectangle-area-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Line Sweep", "id": "VG9waWNUYWdOb2RlOjU2MTE5", "slug": "line-sweep"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 35666, "totalSubmissionRaw": 65711}, "851": {"acRate": 60.02430279843115, "difficulty": "Medium", "likes": 1309, "dislikes": 813, "categoryTitle": "Algorithms", "frontendQuestionId": "851", "paidOnly": false, "title": "Loud and Rich", "titleSlug": "loud-and-rich", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 49891, "totalSubmissionRaw": 83118}, "852": {"acRate": 68.25511974981006, "difficulty": "Medium", "likes": 7564, "dislikes": 1922, "categoryTitle": "Algorithms", "frontendQuestionId": "852", "paidOnly": false, "title": "Peak Index in a Mountain Array", "titleSlug": "peak-index-in-a-mountain-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 856194, "totalSubmissionRaw": 1254404}, "853": {"acRate": 51.67998173519292, "difficulty": "Medium", "likes": 3585, "dislikes": 994, "categoryTitle": "Algorithms", "frontendQuestionId": "853", "paidOnly": false, "title": "Car Fleet", "titleSlug": "car-fleet", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 285207, "totalSubmissionRaw": 551872}, "854": {"acRate": 39.99660973852608, "difficulty": "Hard", "likes": 1135, "dislikes": 61, "categoryTitle": "Algorithms", "frontendQuestionId": "854", "paidOnly": false, "title": "K-Similar Strings", "titleSlug": "k-similar-strings", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 47190, "totalSubmissionRaw": 117985}, "855": {"acRate": 43.55367442632475, "difficulty": "Medium", "likes": 1334, "dislikes": 486, "categoryTitle": "Algorithms", "frontendQuestionId": "855", "paidOnly": false, "title": "Exam Room", "titleSlug": "exam-room", "topicTags": [{"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 62976, "totalSubmissionRaw": 144594}, "856": {"acRate": 64.0383944621824, "difficulty": "Medium", "likes": 5426, "dislikes": 209, "categoryTitle": "Algorithms", "frontendQuestionId": "856", "paidOnly": false, "title": "Score of Parentheses", "titleSlug": "score-of-parentheses", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 190942, "totalSubmissionRaw": 298168}, "857": {"acRate": 63.46495828850042, "difficulty": "Hard", "likes": 2909, "dislikes": 395, "categoryTitle": "Algorithms", "frontendQuestionId": "857", "paidOnly": false, "title": "Minimum Cost to Hire K Workers", "titleSlug": "minimum-cost-to-hire-k-workers", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 140969, "totalSubmissionRaw": 222121}, "858": {"acRate": 62.499226676565215, "difficulty": "Medium", "likes": 1109, "dislikes": 2548, "categoryTitle": "Algorithms", "frontendQuestionId": "858", "paidOnly": false, "title": "Mirror Reflection", "titleSlug": "mirror-reflection", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 80819, "totalSubmissionRaw": 129312}, "859": {"acRate": 33.166346957519785, "difficulty": "Easy", "likes": 3187, "dislikes": 1800, "categoryTitle": "Algorithms", "frontendQuestionId": "859", "paidOnly": false, "title": "Buddy Strings", "titleSlug": "buddy-strings", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 248801, "totalSubmissionRaw": 750161}, "860": {"acRate": 58.29066548628133, "difficulty": "Easy", "likes": 2847, "dislikes": 188, "categoryTitle": "Algorithms", "frontendQuestionId": "860", "paidOnly": false, "title": "Lemonade Change", "titleSlug": "lemonade-change", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 352917, "totalSubmissionRaw": 605444}, "861": {"acRate": 80.39959189686121, "difficulty": "Medium", "likes": 2294, "dislikes": 214, "categoryTitle": "Algorithms", "frontendQuestionId": "861", "paidOnly": false, "title": "Score After Flipping Matrix", "titleSlug": "score-after-flipping-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 147362, "totalSubmissionRaw": 183287}, "862": {"acRate": 26.098461428858577, "difficulty": "Hard", "likes": 4279, "dislikes": 118, "categoryTitle": "Algorithms", "frontendQuestionId": "862", "paidOnly": false, "title": "Shortest Subarray with Sum at Least K", "titleSlug": "shortest-subarray-with-sum-at-least-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}, {"name": "Monotonic Queue", "id": "VG9waWNUYWdOb2RlOjYxMDcx", "slug": "monotonic-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 102573, "totalSubmissionRaw": 393026}, "863": {"acRate": 64.8759927410385, "difficulty": "Medium", "likes": 11017, "dislikes": 234, "categoryTitle": "Algorithms", "frontendQuestionId": "863", "paidOnly": false, "title": "All Nodes Distance K in Binary Tree", "titleSlug": "all-nodes-distance-k-in-binary-tree", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 465458, "totalSubmissionRaw": 717458}, "864": {"acRate": 53.53741496598639, "difficulty": "Hard", "likes": 2333, "dislikes": 102, "categoryTitle": "Algorithms", "frontendQuestionId": "864", "paidOnly": false, "title": "Shortest Path to Get All Keys", "titleSlug": "shortest-path-to-get-all-keys", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 77913, "totalSubmissionRaw": 145530}, "865": {"acRate": 70.92486900964825, "difficulty": "Medium", "likes": 2646, "dislikes": 374, "categoryTitle": "Algorithms", "frontendQuestionId": "865", "paidOnly": false, "title": "Smallest Subtree with all the Deepest Nodes", "titleSlug": "smallest-subtree-with-all-the-deepest-nodes", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 142535, "totalSubmissionRaw": 200967}, "866": {"acRate": 26.108923341038636, "difficulty": "Medium", "likes": 439, "dislikes": 829, "categoryTitle": "Algorithms", "frontendQuestionId": "866", "paidOnly": false, "title": "Prime Palindrome", "titleSlug": "prime-palindrome", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34675, "totalSubmissionRaw": 132809}, "867": {"acRate": 72.26305829505131, "difficulty": "Easy", "likes": 3763, "dislikes": 443, "categoryTitle": "Algorithms", "frontendQuestionId": "867", "paidOnly": false, "title": "Transpose Matrix", "titleSlug": "transpose-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 418896, "totalSubmissionRaw": 579681}, "868": {"acRate": 63.7614713376275, "difficulty": "Easy", "likes": 638, "dislikes": 662, "categoryTitle": "Algorithms", "frontendQuestionId": "868", "paidOnly": false, "title": "Binary Gap", "titleSlug": "binary-gap", "topicTags": [{"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 84834, "totalSubmissionRaw": 133049}, "869": {"acRate": 62.58526826708645, "difficulty": "Medium", "likes": 2117, "dislikes": 436, "categoryTitle": "Algorithms", "frontendQuestionId": "869", "paidOnly": false, "title": "Reordered Power of 2", "titleSlug": "reordered-power-of-2", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 114501, "totalSubmissionRaw": 182952}, "870": {"acRate": 52.709382291538745, "difficulty": "Medium", "likes": 1617, "dislikes": 99, "categoryTitle": "Algorithms", "frontendQuestionId": "870", "paidOnly": false, "title": "Advantage Shuffle", "titleSlug": "advantage-shuffle", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 68674, "totalSubmissionRaw": 130288}, "871": {"acRate": 40.1025570391031, "difficulty": "Hard", "likes": 4669, "dislikes": 89, "categoryTitle": "Algorithms", "frontendQuestionId": "871", "paidOnly": false, "title": "Minimum Number of Refueling Stops", "titleSlug": "minimum-number-of-refueling-stops", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 139753, "totalSubmissionRaw": 348489}, "872": {"acRate": 70.05616797827263, "difficulty": "Easy", "likes": 4128, "dislikes": 114, "categoryTitle": "Algorithms", "frontendQuestionId": "872", "paidOnly": false, "title": "Leaf-Similar Trees", "titleSlug": "leaf-similar-trees", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 503768, "totalSubmissionRaw": 719092}, "873": {"acRate": 48.43244680065567, "difficulty": "Medium", "likes": 2024, "dislikes": 73, "categoryTitle": "Algorithms", "frontendQuestionId": "873", "paidOnly": false, "title": "Length of Longest Fibonacci Subsequence", "titleSlug": "length-of-longest-fibonacci-subsequence", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 65594, "totalSubmissionRaw": 135434}, "874": {"acRate": 40.563353475757715, "difficulty": "Medium", "likes": 205, "dislikes": 50, "categoryTitle": "Algorithms", "frontendQuestionId": "874", "paidOnly": false, "title": "Walking Robot Simulation", "titleSlug": "walking-robot-simulation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 42625, "totalSubmissionRaw": 105084}, "875": {"acRate": 48.40821308811881, "difficulty": "Medium", "likes": 10775, "dislikes": 687, "categoryTitle": "Algorithms", "frontendQuestionId": "875", "paidOnly": false, "title": "Koko Eating Bananas", "titleSlug": "koko-eating-bananas", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 751110, "totalSubmissionRaw": 1551618}, "876": {"acRate": 79.12161940697067, "difficulty": "Easy", "likes": 11719, "dislikes": 378, "categoryTitle": "Algorithms", "frontendQuestionId": "876", "paidOnly": false, "title": "Middle of the Linked List", "titleSlug": "middle-of-the-linked-list", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 2051855, "totalSubmissionRaw": 2593293}, "877": {"acRate": 70.79386029656516, "difficulty": "Medium", "likes": 3245, "dislikes": 2884, "categoryTitle": "Algorithms", "frontendQuestionId": "877", "paidOnly": false, "title": "Stone Game", "titleSlug": "stone-game", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 244585, "totalSubmissionRaw": 345489}, "878": {"acRate": 35.55464607281398, "difficulty": "Hard", "likes": 1278, "dislikes": 160, "categoryTitle": "Algorithms", "frontendQuestionId": "878", "paidOnly": false, "title": "Nth Magical Number", "titleSlug": "nth-magical-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 39962, "totalSubmissionRaw": 112396}, "879": {"acRate": 48.22812350977587, "difficulty": "Hard", "likes": 1839, "dislikes": 122, "categoryTitle": "Algorithms", "frontendQuestionId": "879", "paidOnly": false, "title": "Profitable Schemes", "titleSlug": "profitable-schemes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 64726, "totalSubmissionRaw": 134208}, "880": {"acRate": 36.49981447124304, "difficulty": "Medium", "likes": 2515, "dislikes": 359, "categoryTitle": "Algorithms", "frontendQuestionId": "880", "paidOnly": false, "title": "Decoded String at Index", "titleSlug": "decoded-string-at-index", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 98367, "totalSubmissionRaw": 269500}, "881": {"acRate": 59.536442607412624, "difficulty": "Medium", "likes": 6430, "dislikes": 161, "categoryTitle": "Algorithms", "frontendQuestionId": "881", "paidOnly": false, "title": "Boats to Save People", "titleSlug": "boats-to-save-people", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 426502, "totalSubmissionRaw": 716372}, "882": {"acRate": 50.50691082579106, "difficulty": "Hard", "likes": 815, "dislikes": 224, "categoryTitle": "Algorithms", "frontendQuestionId": "882", "paidOnly": false, "title": "Reachable Nodes In Subdivided Graph", "titleSlug": "reachable-nodes-in-subdivided-graph", "topicTags": [{"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 28795, "totalSubmissionRaw": 57012}, "883": {"acRate": 73.06694539592988, "difficulty": "Easy", "likes": 588, "dislikes": 1413, "categoryTitle": "Algorithms", "frontendQuestionId": "883", "paidOnly": false, "title": "Projection Area of 3D Shapes", "titleSlug": "projection-area-of-3d-shapes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 58021, "totalSubmissionRaw": 79408}, "884": {"acRate": 67.70616286061895, "difficulty": "Easy", "likes": 1339, "dislikes": 169, "categoryTitle": "Algorithms", "frontendQuestionId": "884", "paidOnly": false, "title": "Uncommon Words from Two Sentences", "titleSlug": "uncommon-words-from-two-sentences", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 145248, "totalSubmissionRaw": 214527}, "885": {"acRate": 84.57109191760874, "difficulty": "Medium", "likes": 1470, "dislikes": 1009, "categoryTitle": "Algorithms", "frontendQuestionId": "885", "paidOnly": false, "title": "Spiral Matrix III", "titleSlug": "spiral-matrix-iii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 152162, "totalSubmissionRaw": 179922}, "886": {"acRate": 50.727282613063906, "difficulty": "Medium", "likes": 4674, "dislikes": 111, "categoryTitle": "Algorithms", "frontendQuestionId": "886", "paidOnly": false, "title": "Possible Bipartition", "titleSlug": "possible-bipartition", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 214583, "totalSubmissionRaw": 423012}, "887": {"acRate": 27.93912040556728, "difficulty": "Hard", "likes": 3627, "dislikes": 191, "categoryTitle": "Algorithms", "frontendQuestionId": "887", "paidOnly": false, "title": "Super Egg Drop", "titleSlug": "super-egg-drop", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 75337, "totalSubmissionRaw": 269642}, "888": {"acRate": 62.05913405633159, "difficulty": "Easy", "likes": 2112, "dislikes": 382, "categoryTitle": "Algorithms", "frontendQuestionId": "888", "paidOnly": false, "title": "Fair Candy Swap", "titleSlug": "fair-candy-swap", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 127552, "totalSubmissionRaw": 205533}, "889": {"acRate": 71.60025127686887, "difficulty": "Medium", "likes": 2743, "dislikes": 114, "categoryTitle": "Algorithms", "frontendQuestionId": "889", "paidOnly": false, "title": "Construct Binary Tree from Preorder and Postorder Traversal", "titleSlug": "construct-binary-tree-from-preorder-and-postorder-traversal", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 104860, "totalSubmissionRaw": 146452}, "890": {"acRate": 76.7961956741133, "difficulty": "Medium", "likes": 3919, "dislikes": 171, "categoryTitle": "Algorithms", "frontendQuestionId": "890", "paidOnly": false, "title": "Find and Replace Pattern", "titleSlug": "find-and-replace-pattern", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 190238, "totalSubmissionRaw": 247718}, "891": {"acRate": 38.05458656896945, "difficulty": "Hard", "likes": 713, "dislikes": 171, "categoryTitle": "Algorithms", "frontendQuestionId": "891", "paidOnly": false, "title": "Sum of Subsequence Widths", "titleSlug": "sum-of-subsequence-widths", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 21709, "totalSubmissionRaw": 57047}, "892": {"acRate": 66.4976965871232, "difficulty": "Easy", "likes": 572, "dislikes": 747, "categoryTitle": "Algorithms", "frontendQuestionId": "892", "paidOnly": false, "title": "Surface Area of 3D Shapes", "titleSlug": "surface-area-of-3d-shapes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 41716, "totalSubmissionRaw": 62733}, "893": {"acRate": 71.99664834618608, "difficulty": "Medium", "likes": 535, "dislikes": 1481, "categoryTitle": "Algorithms", "frontendQuestionId": "893", "paidOnly": false, "title": "Groups of Special-Equivalent Strings", "titleSlug": "groups-of-special-equivalent-strings", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 50695, "totalSubmissionRaw": 70413}, "894": {"acRate": 82.77353823946203, "difficulty": "Medium", "likes": 5073, "dislikes": 353, "categoryTitle": "Algorithms", "frontendQuestionId": "894", "paidOnly": false, "title": "All Possible Full Binary Trees", "titleSlug": "all-possible-full-binary-trees", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 188083, "totalSubmissionRaw": 227226}, "895": {"acRate": 66.46058790071044, "difficulty": "Hard", "likes": 4697, "dislikes": 74, "categoryTitle": "Algorithms", "frontendQuestionId": "895", "paidOnly": false, "title": "Maximum Frequency Stack", "titleSlug": "maximum-frequency-stack", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 178770, "totalSubmissionRaw": 268988}, "896": {"acRate": 61.30018639341729, "difficulty": "Easy", "likes": 3057, "dislikes": 95, "categoryTitle": "Algorithms", "frontendQuestionId": "896", "paidOnly": false, "title": "Monotonic Array", "titleSlug": "monotonic-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 448257, "totalSubmissionRaw": 731249}, "897": {"acRate": 78.372208570009, "difficulty": "Easy", "likes": 4330, "dislikes": 672, "categoryTitle": "Algorithms", "frontendQuestionId": "897", "paidOnly": false, "title": "Increasing Order Search Tree", "titleSlug": "increasing-order-search-tree", "topicTags": [{"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 291815, "totalSubmissionRaw": 372345}, "898": {"acRate": 39.326207351417, "difficulty": "Medium", "likes": 1469, "dislikes": 206, "categoryTitle": "Algorithms", "frontendQuestionId": "898", "paidOnly": false, "title": "Bitwise ORs of Subarrays", "titleSlug": "bitwise-ors-of-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 37564, "totalSubmissionRaw": 95519}, "899": {"acRate": 65.98108572378507, "difficulty": "Hard", "likes": 1755, "dislikes": 613, "categoryTitle": "Algorithms", "frontendQuestionId": "899", "paidOnly": false, "title": "Orderly Queue", "titleSlug": "orderly-queue", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 71443, "totalSubmissionRaw": 108278}, "900": {"acRate": 59.62873169804145, "difficulty": "Medium", "likes": 748, "dislikes": 193, "categoryTitle": "Algorithms", "frontendQuestionId": "900", "paidOnly": false, "title": "RLE Iterator", "titleSlug": "rle-iterator", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}, {"name": "Iterator", "id": "VG9waWNUYWdOb2RlOjYxMDY0", "slug": "iterator"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 75261, "totalSubmissionRaw": 126216}, "901": {"acRate": 66.37134883864353, "difficulty": "Medium", "likes": 6372, "dislikes": 414, "categoryTitle": "Algorithms", "frontendQuestionId": "901", "paidOnly": false, "title": "Online Stock Span", "titleSlug": "online-stock-span", "topicTags": [{"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}, {"name": "Data Stream", "id": "VG9waWNUYWdOb2RlOjYxMDYz", "slug": "data-stream"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 344382, "totalSubmissionRaw": 518871}, "902": {"acRate": 42.60676098119655, "difficulty": "Hard", "likes": 1395, "dislikes": 97, "categoryTitle": "Algorithms", "frontendQuestionId": "902", "paidOnly": false, "title": "Numbers At Most N Given Digit Set", "titleSlug": "numbers-at-most-n-given-digit-set", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 45386, "totalSubmissionRaw": 106522}, "903": {"acRate": 57.36940298507462, "difficulty": "Hard", "likes": 723, "dislikes": 43, "categoryTitle": "Algorithms", "frontendQuestionId": "903", "paidOnly": false, "title": "Valid Permutations for DI Sequence", "titleSlug": "valid-permutations-for-di-sequence", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16605, "totalSubmissionRaw": 28944}, "904": {"acRate": 44.754254144336464, "difficulty": "Medium", "likes": 4690, "dislikes": 349, "categoryTitle": "Algorithms", "frontendQuestionId": "904", "paidOnly": false, "title": "Fruit Into Baskets", "titleSlug": "fruit-into-baskets", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 429981, "totalSubmissionRaw": 960764}, "905": {"acRate": 76.24513016785754, "difficulty": "Easy", "likes": 5380, "dislikes": 149, "categoryTitle": "Algorithms", "frontendQuestionId": "905", "paidOnly": false, "title": "Sort Array By Parity", "titleSlug": "sort-array-by-parity", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 823136, "totalSubmissionRaw": 1079587}, "906": {"acRate": 39.00378310214376, "difficulty": "Hard", "likes": 362, "dislikes": 420, "categoryTitle": "Algorithms", "frontendQuestionId": "906", "paidOnly": false, "title": "Super Palindromes", "titleSlug": "super-palindromes", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 24744, "totalSubmissionRaw": 63440}, "907": {"acRate": 37.25515720788704, "difficulty": "Medium", "likes": 8121, "dislikes": 631, "categoryTitle": "Algorithms", "frontendQuestionId": "907", "paidOnly": false, "title": "Sum of Subarray Minimums", "titleSlug": "sum-of-subarray-minimums", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 274743, "totalSubmissionRaw": 737463}, "908": {"acRate": 70.48553625718672, "difficulty": "Easy", "likes": 715, "dislikes": 2039, "categoryTitle": "Algorithms", "frontendQuestionId": "908", "paidOnly": false, "title": "Smallest Range I", "titleSlug": "smallest-range-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 93664, "totalSubmissionRaw": 132884}, "909": {"acRate": 43.8608519849249, "difficulty": "Medium", "likes": 2915, "dislikes": 1035, "categoryTitle": "Algorithms", "frontendQuestionId": "909", "paidOnly": false, "title": "Snakes and Ladders", "titleSlug": "snakes-and-ladders", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 199580, "totalSubmissionRaw": 455042}, "910": {"acRate": 36.458502861085975, "difficulty": "Medium", "likes": 1654, "dislikes": 461, "categoryTitle": "Algorithms", "frontendQuestionId": "910", "paidOnly": false, "title": "Smallest Range II", "titleSlug": "smallest-range-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 56005, "totalSubmissionRaw": 153613}, "911": {"acRate": 52.10096182466047, "difficulty": "Medium", "likes": 1014, "dislikes": 660, "categoryTitle": "Algorithms", "frontendQuestionId": "911", "paidOnly": false, "title": "Online Election", "titleSlug": "online-election", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 61265, "totalSubmissionRaw": 117589}, "912": {"acRate": 58.000545578133945, "difficulty": "Medium", "likes": 6478, "dislikes": 796, "categoryTitle": "Algorithms", "frontendQuestionId": "912", "paidOnly": false, "title": "Sort an Array", "titleSlug": "sort-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Merge Sort", "id": "VG9waWNUYWdOb2RlOjYxMDUx", "slug": "merge-sort"}, {"name": "Bucket Sort", "id": "VG9waWNUYWdOb2RlOjYxMDYw", "slug": "bucket-sort"}, {"name": "Radix Sort", "id": "VG9waWNUYWdOb2RlOjYxMDYx", "slug": "radix-sort"}, {"name": "Counting Sort", "id": "VG9waWNUYWdOb2RlOjYxMDcy", "slug": "counting-sort"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 778191, "totalSubmissionRaw": 1341696}, "913": {"acRate": 33.85328133853282, "difficulty": "Hard", "likes": 916, "dislikes": 162, "categoryTitle": "Algorithms", "frontendQuestionId": "913", "paidOnly": false, "title": "Cat and Mouse", "titleSlug": "cat-and-mouse", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 20314, "totalSubmissionRaw": 60006}, "914": {"acRate": 29.922258602172207, "difficulty": "Easy", "likes": 1819, "dislikes": 517, "categoryTitle": "Algorithms", "frontendQuestionId": "914", "paidOnly": false, "title": "X of a Kind in a Deck of Cards", "titleSlug": "x-of-a-kind-in-a-deck-of-cards", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 126207, "totalSubmissionRaw": 421783}, "915": {"acRate": 48.808089002201875, "difficulty": "Medium", "likes": 1661, "dislikes": 80, "categoryTitle": "Algorithms", "frontendQuestionId": "915", "paidOnly": false, "title": "Partition Array into Disjoint Intervals", "titleSlug": "partition-array-into-disjoint-intervals", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 84233, "totalSubmissionRaw": 172580}, "916": {"acRate": 51.9040251149232, "difficulty": "Medium", "likes": 2711, "dislikes": 232, "categoryTitle": "Algorithms", "frontendQuestionId": "916", "paidOnly": false, "title": "Word Subsets", "titleSlug": "word-subsets", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 115733, "totalSubmissionRaw": 222975}, "917": {"acRate": 65.25862950797313, "difficulty": "Easy", "likes": 2259, "dislikes": 78, "categoryTitle": "Algorithms", "frontendQuestionId": "917", "paidOnly": false, "title": "Reverse Only Letters", "titleSlug": "reverse-only-letters", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 229666, "totalSubmissionRaw": 351932}, "918": {"acRate": 45.486997682366344, "difficulty": "Medium", "likes": 6646, "dislikes": 304, "categoryTitle": "Algorithms", "frontendQuestionId": "918", "paidOnly": false, "title": "Maximum Sum Circular Subarray", "titleSlug": "maximum-sum-circular-subarray", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Monotonic Queue", "id": "VG9waWNUYWdOb2RlOjYxMDcx", "slug": "monotonic-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 277911, "totalSubmissionRaw": 610968}, "919": {"acRate": 65.8815479711002, "difficulty": "Medium", "likes": 1109, "dislikes": 113, "categoryTitle": "Algorithms", "frontendQuestionId": "919", "paidOnly": false, "title": "Complete Binary Tree Inserter", "titleSlug": "complete-binary-tree-inserter", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 56809, "totalSubmissionRaw": 86229}, "920": {"acRate": 60.38494709966099, "difficulty": "Hard", "likes": 2362, "dislikes": 197, "categoryTitle": "Algorithms", "frontendQuestionId": "920", "paidOnly": false, "title": "Number of Music Playlists", "titleSlug": "number-of-music-playlists", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 70715, "totalSubmissionRaw": 117107}, "921": {"acRate": 74.90049211173832, "difficulty": "Medium", "likes": 4101, "dislikes": 207, "categoryTitle": "Algorithms", "frontendQuestionId": "921", "paidOnly": false, "title": "Minimum Add to Make Parentheses Valid", "titleSlug": "minimum-add-to-make-parentheses-valid", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 372591, "totalSubmissionRaw": 497448}, "922": {"acRate": 70.82994698457978, "difficulty": "Easy", "likes": 2613, "dislikes": 97, "categoryTitle": "Algorithms", "frontendQuestionId": "922", "paidOnly": false, "title": "Sort Array By Parity II", "titleSlug": "sort-array-by-parity-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 263197, "totalSubmissionRaw": 371590}, "923": {"acRate": 45.50535954519811, "difficulty": "Medium", "likes": 2616, "dislikes": 317, "categoryTitle": "Algorithms", "frontendQuestionId": "923", "paidOnly": false, "title": "3Sum With Multiplicity", "titleSlug": "3sum-with-multiplicity", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 104857, "totalSubmissionRaw": 230429}, "924": {"acRate": 42.05031661817559, "difficulty": "Hard", "likes": 998, "dislikes": 595, "categoryTitle": "Algorithms", "frontendQuestionId": "924", "paidOnly": false, "title": "Minimize Malware Spread", "titleSlug": "minimize-malware-spread", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 54054, "totalSubmissionRaw": 128546}, "925": {"acRate": 32.30333013170533, "difficulty": "Easy", "likes": 2434, "dislikes": 380, "categoryTitle": "Algorithms", "frontendQuestionId": "925", "paidOnly": false, "title": "Long Pressed Name", "titleSlug": "long-pressed-name", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 147309, "totalSubmissionRaw": 456016}, "926": {"acRate": 61.506727253701335, "difficulty": "Medium", "likes": 4430, "dislikes": 178, "categoryTitle": "Algorithms", "frontendQuestionId": "926", "paidOnly": false, "title": "Flip String to Monotone Increasing", "titleSlug": "flip-string-to-monotone-increasing", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 193967, "totalSubmissionRaw": 315359}, "927": {"acRate": 40.00945539548505, "difficulty": "Hard", "likes": 833, "dislikes": 123, "categoryTitle": "Algorithms", "frontendQuestionId": "927", "paidOnly": false, "title": "Three Equal Parts", "titleSlug": "three-equal-parts", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 30466, "totalSubmissionRaw": 76147}, "928": {"acRate": 44.05900078122094, "difficulty": "Hard", "likes": 671, "dislikes": 89, "categoryTitle": "Algorithms", "frontendQuestionId": "928", "paidOnly": false, "title": "Minimize Malware Spread II", "titleSlug": "minimize-malware-spread-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23687, "totalSubmissionRaw": 53762}, "929": {"acRate": 67.2653141650966, "difficulty": "Easy", "likes": 2694, "dislikes": 342, "categoryTitle": "Algorithms", "frontendQuestionId": "929", "paidOnly": false, "title": "Unique Email Addresses", "titleSlug": "unique-email-addresses", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 498397, "totalSubmissionRaw": 740942}, "930": {"acRate": 63.51197965910518, "difficulty": "Medium", "likes": 3939, "dislikes": 133, "categoryTitle": "Algorithms", "frontendQuestionId": "930", "paidOnly": false, "title": "Binary Subarrays With Sum", "titleSlug": "binary-subarrays-with-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 268025, "totalSubmissionRaw": 422007}, "931": {"acRate": 63.07455092337694, "difficulty": "Medium", "likes": 6367, "dislikes": 163, "categoryTitle": "Algorithms", "frontendQuestionId": "931", "paidOnly": false, "title": "Minimum Falling Path Sum", "titleSlug": "minimum-falling-path-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 465113, "totalSubmissionRaw": 737402}, "932": {"acRate": 65.95794154834397, "difficulty": "Medium", "likes": 1070, "dislikes": 1518, "categoryTitle": "Algorithms", "frontendQuestionId": "932", "paidOnly": false, "title": "Beautiful Array", "titleSlug": "beautiful-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 45385, "totalSubmissionRaw": 68809}, "933": {"acRate": 75.97664679586612, "difficulty": "Easy", "likes": 560, "dislikes": 863, "categoryTitle": "Algorithms", "frontendQuestionId": "933", "paidOnly": false, "title": "Number of Recent Calls", "titleSlug": "number-of-recent-calls", "topicTags": [{"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Data Stream", "id": "VG9waWNUYWdOb2RlOjYxMDYz", "slug": "data-stream"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 290461, "totalSubmissionRaw": 382303}, "934": {"acRate": 57.883685833643185, "difficulty": "Medium", "likes": 5395, "dislikes": 208, "categoryTitle": "Algorithms", "frontendQuestionId": "934", "paidOnly": false, "title": "Shortest Bridge", "titleSlug": "shortest-bridge", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 211720, "totalSubmissionRaw": 365768}, "935": {"acRate": 60.456303380451494, "difficulty": "Medium", "likes": 3035, "dislikes": 444, "categoryTitle": "Algorithms", "frontendQuestionId": "935", "paidOnly": false, "title": "Knight Dialer", "titleSlug": "knight-dialer", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 178519, "totalSubmissionRaw": 295286}, "936": {"acRate": 62.53825706630519, "difficulty": "Hard", "likes": 1545, "dislikes": 219, "categoryTitle": "Algorithms", "frontendQuestionId": "936", "paidOnly": false, "title": "Stamping The Sequence", "titleSlug": "stamping-the-sequence", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 59053, "totalSubmissionRaw": 94427}, "937": {"acRate": 56.492732795406106, "difficulty": "Medium", "likes": 2102, "dislikes": 4386, "categoryTitle": "Algorithms", "frontendQuestionId": "937", "paidOnly": false, "title": "Reorder Data in Log Files", "titleSlug": "reorder-data-in-log-files", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 370298, "totalSubmissionRaw": 655479}, "938": {"acRate": 86.99243438240367, "difficulty": "Easy", "likes": 6957, "dislikes": 378, "categoryTitle": "Algorithms", "frontendQuestionId": "938", "paidOnly": false, "title": "Range Sum of BST", "titleSlug": "range-sum-of-bst", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 1093830, "totalSubmissionRaw": 1257387}, "939": {"acRate": 54.13376692182619, "difficulty": "Medium", "likes": 1978, "dislikes": 284, "categoryTitle": "Algorithms", "frontendQuestionId": "939", "paidOnly": false, "title": "Minimum Area Rectangle", "titleSlug": "minimum-area-rectangle", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 148156, "totalSubmissionRaw": 273685}, "940": {"acRate": 43.185984281831395, "difficulty": "Hard", "likes": 1724, "dislikes": 38, "categoryTitle": "Algorithms", "frontendQuestionId": "940", "paidOnly": false, "title": "Distinct Subsequences II", "titleSlug": "distinct-subsequences-ii", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 40993, "totalSubmissionRaw": 94922}, "941": {"acRate": 33.538581778198356, "difficulty": "Easy", "likes": 2942, "dislikes": 185, "categoryTitle": "Algorithms", "frontendQuestionId": "941", "paidOnly": false, "title": "Valid Mountain Array", "titleSlug": "valid-mountain-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 437707, "totalSubmissionRaw": 1305085}, "942": {"acRate": 79.07907761474958, "difficulty": "Easy", "likes": 2467, "dislikes": 1020, "categoryTitle": "Algorithms", "frontendQuestionId": "942", "paidOnly": false, "title": "DI String Match", "titleSlug": "di-string-match", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 162172, "totalSubmissionRaw": 205076}, "943": {"acRate": 44.12801896577271, "difficulty": "Hard", "likes": 1446, "dislikes": 148, "categoryTitle": "Algorithms", "frontendQuestionId": "943", "paidOnly": false, "title": "Find the Shortest Superstring", "titleSlug": "find-the-shortest-superstring", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 29782, "totalSubmissionRaw": 67490}, "944": {"acRate": 74.63028889592488, "difficulty": "Easy", "likes": 1709, "dislikes": 2880, "categoryTitle": "Algorithms", "frontendQuestionId": "944", "paidOnly": false, "title": "Delete Columns to Make Sorted", "titleSlug": "delete-columns-to-make-sorted", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 193282, "totalSubmissionRaw": 258986}, "945": {"acRate": 60.0430730813299, "difficulty": "Medium", "likes": 2650, "dislikes": 82, "categoryTitle": "Algorithms", "frontendQuestionId": "945", "paidOnly": false, "title": "Minimum Increment to Make Array Unique", "titleSlug": "minimum-increment-to-make-array-unique", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 239486, "totalSubmissionRaw": 398857}, "946": {"acRate": 69.54028081150892, "difficulty": "Medium", "likes": 5910, "dislikes": 122, "categoryTitle": "Algorithms", "frontendQuestionId": "946", "paidOnly": false, "title": "Validate Stack Sequences", "titleSlug": "validate-stack-sequences", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 313909, "totalSubmissionRaw": 451406}, "947": {"acRate": 58.97173544824881, "difficulty": "Medium", "likes": 5405, "dislikes": 649, "categoryTitle": "Algorithms", "frontendQuestionId": "947", "paidOnly": false, "title": "Most Stones Removed with Same Row or Column", "titleSlug": "most-stones-removed-with-same-row-or-column", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 222475, "totalSubmissionRaw": 377255}, "948": {"acRate": 58.99292746421438, "difficulty": "Medium", "likes": 3260, "dislikes": 534, "categoryTitle": "Algorithms", "frontendQuestionId": "948", "paidOnly": false, "title": "Bag of Tokens", "titleSlug": "bag-of-tokens", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 233635, "totalSubmissionRaw": 396039}, "949": {"acRate": 35.35410474531106, "difficulty": "Medium", "likes": 713, "dislikes": 1059, "categoryTitle": "Algorithms", "frontendQuestionId": "949", "paidOnly": false, "title": "Largest Time for Given Digits", "titleSlug": "largest-time-for-given-digits", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 89687, "totalSubmissionRaw": 253682}, "950": {"acRate": 83.03701496490531, "difficulty": "Medium", "likes": 3473, "dislikes": 659, "categoryTitle": "Algorithms", "frontendQuestionId": "950", "paidOnly": false, "title": "Reveal Cards In Increasing Order", "titleSlug": "reveal-cards-in-increasing-order", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 200644, "totalSubmissionRaw": 241632}, "951": {"acRate": 67.0597854584559, "difficulty": "Medium", "likes": 2306, "dislikes": 96, "categoryTitle": "Algorithms", "frontendQuestionId": "951", "paidOnly": false, "title": "Flip Equivalent Binary Trees", "titleSlug": "flip-equivalent-binary-trees", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 150909, "totalSubmissionRaw": 225037}, "952": {"acRate": 40.87316073756752, "difficulty": "Hard", "likes": 1633, "dislikes": 94, "categoryTitle": "Algorithms", "frontendQuestionId": "952", "paidOnly": false, "title": "Largest Component Size by Common Factor", "titleSlug": "largest-component-size-by-common-factor", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 54862, "totalSubmissionRaw": 134225}, "953": {"acRate": 55.15726520180464, "difficulty": "Easy", "likes": 4888, "dislikes": 1633, "categoryTitle": "Algorithms", "frontendQuestionId": "953", "paidOnly": false, "title": "Verifying an Alien Dictionary", "titleSlug": "verifying-an-alien-dictionary", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 516657, "totalSubmissionRaw": 936695}, "954": {"acRate": 39.19547553173848, "difficulty": "Medium", "likes": 1527, "dislikes": 160, "categoryTitle": "Algorithms", "frontendQuestionId": "954", "paidOnly": false, "title": "Array of Doubled Pairs", "titleSlug": "array-of-doubled-pairs", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 89818, "totalSubmissionRaw": 229154}, "955": {"acRate": 35.36846396901437, "difficulty": "Medium", "likes": 663, "dislikes": 87, "categoryTitle": "Algorithms", "frontendQuestionId": "955", "paidOnly": false, "title": "Delete Columns to Make Sorted II", "titleSlug": "delete-columns-to-make-sorted-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20820, "totalSubmissionRaw": 58866}, "956": {"acRate": 52.15932150476091, "difficulty": "Hard", "likes": 2370, "dislikes": 57, "categoryTitle": "Algorithms", "frontendQuestionId": "956", "paidOnly": false, "title": "Tallest Billboard", "titleSlug": "tallest-billboard", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 60147, "totalSubmissionRaw": 115314}, "957": {"acRate": 39.00122681677131, "difficulty": "Medium", "likes": 1491, "dislikes": 1751, "categoryTitle": "Algorithms", "frontendQuestionId": "957", "paidOnly": false, "title": "Prison Cells After N Days", "titleSlug": "prison-cells-after-n-days", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 162132, "totalSubmissionRaw": 415710}, "958": {"acRate": 57.170243056697565, "difficulty": "Medium", "likes": 4290, "dislikes": 60, "categoryTitle": "Algorithms", "frontendQuestionId": "958", "paidOnly": false, "title": "Check Completeness of a Binary Tree", "titleSlug": "check-completeness-of-a-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 243352, "totalSubmissionRaw": 425662}, "959": {"acRate": 77.9780406802898, "difficulty": "Medium", "likes": 3811, "dislikes": 801, "categoryTitle": "Algorithms", "frontendQuestionId": "959", "paidOnly": false, "title": "Regions Cut By Slashes", "titleSlug": "regions-cut-by-slashes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 131956, "totalSubmissionRaw": 169222}, "960": {"acRate": 58.334618944770135, "difficulty": "Hard", "likes": 602, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "960", "paidOnly": false, "title": "Delete Columns to Make Sorted III", "titleSlug": "delete-columns-to-make-sorted-iii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 15125, "totalSubmissionRaw": 25928}, "961": {"acRate": 76.93177606507835, "difficulty": "Easy", "likes": 1349, "dislikes": 329, "categoryTitle": "Algorithms", "frontendQuestionId": "961", "paidOnly": false, "title": "N-Repeated Element in Size 2N Array", "titleSlug": "n-repeated-element-in-size-2n-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 242859, "totalSubmissionRaw": 315681}, "962": {"acRate": 50.458117184235476, "difficulty": "Medium", "likes": 1687, "dislikes": 51, "categoryTitle": "Algorithms", "frontendQuestionId": "962", "paidOnly": false, "title": "Maximum Width Ramp", "titleSlug": "maximum-width-ramp", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 49509, "totalSubmissionRaw": 98119}, "963": {"acRate": 55.22540983606557, "difficulty": "Medium", "likes": 382, "dislikes": 461, "categoryTitle": "Algorithms", "frontendQuestionId": "963", "paidOnly": false, "title": "Minimum Area Rectangle II", "titleSlug": "minimum-area-rectangle-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29645, "totalSubmissionRaw": 53680}, "964": {"acRate": 48.653030086301435, "difficulty": "Hard", "likes": 317, "dislikes": 71, "categoryTitle": "Algorithms", "frontendQuestionId": "964", "paidOnly": false, "title": "Least Operators to Express Number", "titleSlug": "least-operators-to-express-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10204, "totalSubmissionRaw": 20973}, "965": {"acRate": 71.2352655719228, "difficulty": "Easy", "likes": 1899, "dislikes": 64, "categoryTitle": "Algorithms", "frontendQuestionId": "965", "paidOnly": false, "title": "Univalued Binary Tree", "titleSlug": "univalued-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 227529, "totalSubmissionRaw": 319405}, "966": {"acRate": 51.3704782714251, "difficulty": "Medium", "likes": 423, "dislikes": 811, "categoryTitle": "Algorithms", "frontendQuestionId": "966", "paidOnly": false, "title": "Vowel Spellchecker", "titleSlug": "vowel-spellchecker", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 42319, "totalSubmissionRaw": 82380}, "967": {"acRate": 58.20260214248516, "difficulty": "Medium", "likes": 2812, "dislikes": 196, "categoryTitle": "Algorithms", "frontendQuestionId": "967", "paidOnly": false, "title": "Numbers With Same Consecutive Differences", "titleSlug": "numbers-with-same-consecutive-differences", "topicTags": [{"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 135232, "totalSubmissionRaw": 232347}, "968": {"acRate": 46.75662152783382, "difficulty": "Hard", "likes": 5353, "dislikes": 77, "categoryTitle": "Algorithms", "frontendQuestionId": "968", "paidOnly": false, "title": "Binary Tree Cameras", "titleSlug": "binary-tree-cameras", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 144845, "totalSubmissionRaw": 309785}, "969": {"acRate": 70.9036611965862, "difficulty": "Medium", "likes": 1501, "dislikes": 1534, "categoryTitle": "Algorithms", "frontendQuestionId": "969", "paidOnly": false, "title": "Pancake Sorting", "titleSlug": "pancake-sorting", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 96870, "totalSubmissionRaw": 136622}, "970": {"acRate": 43.88212082302464, "difficulty": "Medium", "likes": 391, "dislikes": 84, "categoryTitle": "Algorithms", "frontendQuestionId": "970", "paidOnly": false, "title": "Powerful Integers", "titleSlug": "powerful-integers", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 56048, "totalSubmissionRaw": 127724}, "971": {"acRate": 50.68631717616062, "difficulty": "Medium", "likes": 953, "dislikes": 274, "categoryTitle": "Algorithms", "frontendQuestionId": "971", "paidOnly": false, "title": "Flip Binary Tree To Match Preorder Traversal", "titleSlug": "flip-binary-tree-to-match-preorder-traversal", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 43093, "totalSubmissionRaw": 85019}, "972": {"acRate": 44.19219495373297, "difficulty": "Hard", "likes": 95, "dislikes": 217, "categoryTitle": "Algorithms", "frontendQuestionId": "972", "paidOnly": false, "title": "Equal Rational Numbers", "titleSlug": "equal-rational-numbers", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 7689, "totalSubmissionRaw": 17399}, "973": {"acRate": 66.7420147680162, "difficulty": "Medium", "likes": 8422, "dislikes": 309, "categoryTitle": "Algorithms", "frontendQuestionId": "973", "paidOnly": false, "title": "K Closest Points to Origin", "titleSlug": "k-closest-points-to-origin", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Quickselect", "id": "VG9waWNUYWdOb2RlOjYxMDY5", "slug": "quickselect"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1261351, "totalSubmissionRaw": 1889892}, "974": {"acRate": 55.4582897853419, "difficulty": "Medium", "likes": 7224, "dislikes": 319, "categoryTitle": "Algorithms", "frontendQuestionId": "974", "paidOnly": false, "title": "Subarray Sums Divisible by K", "titleSlug": "subarray-sums-divisible-by-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 358701, "totalSubmissionRaw": 646795}, "975": {"acRate": 40.21516159912476, "difficulty": "Hard", "likes": 2003, "dislikes": 507, "categoryTitle": "Algorithms", "frontendQuestionId": "975", "paidOnly": false, "title": "Odd Even Jump", "titleSlug": "odd-even-jump", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 88219, "totalSubmissionRaw": 219369}, "976": {"acRate": 56.28260120212117, "difficulty": "Easy", "likes": 2977, "dislikes": 411, "categoryTitle": "Algorithms", "frontendQuestionId": "976", "paidOnly": false, "title": "Largest Perimeter Triangle", "titleSlug": "largest-perimeter-triangle", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 246551, "totalSubmissionRaw": 438059}, "977": {"acRate": 72.93652581697428, "difficulty": "Easy", "likes": 9348, "dislikes": 239, "categoryTitle": "Algorithms", "frontendQuestionId": "977", "paidOnly": false, "title": "Squares of a Sorted Array", "titleSlug": "squares-of-a-sorted-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 1926246, "totalSubmissionRaw": 2640984}, "978": {"acRate": 47.590646037557576, "difficulty": "Medium", "likes": 1978, "dislikes": 234, "categoryTitle": "Algorithms", "frontendQuestionId": "978", "paidOnly": false, "title": "Longest Turbulent Subarray", "titleSlug": "longest-turbulent-subarray", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 104763, "totalSubmissionRaw": 220136}, "979": {"acRate": 77.13871081040399, "difficulty": "Medium", "likes": 5819, "dislikes": 232, "categoryTitle": "Algorithms", "frontendQuestionId": "979", "paidOnly": false, "title": "Distribute Coins in Binary Tree", "titleSlug": "distribute-coins-in-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 199861, "totalSubmissionRaw": 259093}, "980": {"acRate": 81.91833705700773, "difficulty": "Hard", "likes": 5160, "dislikes": 190, "categoryTitle": "Algorithms", "frontendQuestionId": "980", "paidOnly": false, "title": "Unique Paths III", "titleSlug": "unique-paths-iii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 207527, "totalSubmissionRaw": 253334}, "981": {"acRate": 49.29270776383388, "difficulty": "Medium", "likes": 4801, "dislikes": 590, "categoryTitle": "Algorithms", "frontendQuestionId": "981", "paidOnly": false, "title": "Time Based Key-Value Store", "titleSlug": "time-based-key-value-store", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 472437, "totalSubmissionRaw": 958424}, "982": {"acRate": 58.31830337707569, "difficulty": "Hard", "likes": 440, "dislikes": 220, "categoryTitle": "Algorithms", "frontendQuestionId": "982", "paidOnly": false, "title": "Triples with Bitwise AND Equal To Zero", "titleSlug": "triples-with-bitwise-and-equal-to-zero", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18754, "totalSubmissionRaw": 32158}, "983": {"acRate": 65.23682604925982, "difficulty": "Medium", "likes": 7892, "dislikes": 149, "categoryTitle": "Algorithms", "frontendQuestionId": "983", "paidOnly": false, "title": "Minimum Cost For Tickets", "titleSlug": "minimum-cost-for-tickets", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 304731, "totalSubmissionRaw": 467115}, "984": {"acRate": 44.05557399251958, "difficulty": "Medium", "likes": 816, "dislikes": 369, "categoryTitle": "Algorithms", "frontendQuestionId": "984", "paidOnly": false, "title": "String Without AAA or BBB", "titleSlug": "string-without-aaa-or-bbb", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 49118, "totalSubmissionRaw": 111491}, "985": {"acRate": 68.2199188387852, "difficulty": "Medium", "likes": 2083, "dislikes": 320, "categoryTitle": "Algorithms", "frontendQuestionId": "985", "paidOnly": false, "title": "Sum of Even Numbers After Queries", "titleSlug": "sum-of-even-numbers-after-queries", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 141044, "totalSubmissionRaw": 206749}, "986": {"acRate": 71.83046315796545, "difficulty": "Medium", "likes": 5561, "dislikes": 113, "categoryTitle": "Algorithms", "frontendQuestionId": "986", "paidOnly": false, "title": "Interval List Intersections", "titleSlug": "interval-list-intersections", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 427696, "totalSubmissionRaw": 595424}, "987": {"acRate": 48.529733229079966, "difficulty": "Hard", "likes": 7650, "dislikes": 4333, "categoryTitle": "Algorithms", "frontendQuestionId": "987", "paidOnly": false, "title": "Vertical Order Traversal of a Binary Tree", "titleSlug": "vertical-order-traversal-of-a-binary-tree", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 461774, "totalSubmissionRaw": 951528}, "988": {"acRate": 60.56646523306276, "difficulty": "Medium", "likes": 2285, "dislikes": 329, "categoryTitle": "Algorithms", "frontendQuestionId": "988", "paidOnly": false, "title": "Smallest String Starting From Leaf", "titleSlug": "smallest-string-starting-from-leaf", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 192734, "totalSubmissionRaw": 318219}, "989": {"acRate": 45.141326125835384, "difficulty": "Easy", "likes": 3449, "dislikes": 292, "categoryTitle": "Algorithms", "frontendQuestionId": "989", "paidOnly": false, "title": "Add to Array-Form of Integer", "titleSlug": "add-to-array-form-of-integer", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 268562, "totalSubmissionRaw": 594936}, "990": {"acRate": 50.600649662675146, "difficulty": "Medium", "likes": 3751, "dislikes": 61, "categoryTitle": "Algorithms", "frontendQuestionId": "990", "paidOnly": false, "title": "Satisfiability of Equality Equations", "titleSlug": "satisfiability-of-equality-equations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 131630, "totalSubmissionRaw": 260135}, "991": {"acRate": 54.5738829425756, "difficulty": "Medium", "likes": 2701, "dislikes": 208, "categoryTitle": "Algorithms", "frontendQuestionId": "991", "paidOnly": false, "title": "Broken Calculator", "titleSlug": "broken-calculator", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 102791, "totalSubmissionRaw": 188352}, "992": {"acRate": 63.94390957410282, "difficulty": "Hard", "likes": 6065, "dislikes": 97, "categoryTitle": "Algorithms", "frontendQuestionId": "992", "paidOnly": false, "title": "Subarrays with K Different Integers", "titleSlug": "subarrays-with-k-different-integers", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 232791, "totalSubmissionRaw": 364055}, "993": {"acRate": 56.55173371639908, "difficulty": "Easy", "likes": 4031, "dislikes": 208, "categoryTitle": "Algorithms", "frontendQuestionId": "993", "paidOnly": false, "title": "Cousins in Binary Tree", "titleSlug": "cousins-in-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 285023, "totalSubmissionRaw": 504004}, "994": {"acRate": 54.77216453066034, "difficulty": "Medium", "likes": 12973, "dislikes": 405, "categoryTitle": "Algorithms", "frontendQuestionId": "994", "paidOnly": false, "title": "Rotting Oranges", "titleSlug": "rotting-oranges", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 935259, "totalSubmissionRaw": 1707545}, "995": {"acRate": 62.73513198102053, "difficulty": "Hard", "likes": 1875, "dislikes": 88, "categoryTitle": "Algorithms", "frontendQuestionId": "995", "paidOnly": false, "title": "Minimum Number of K Consecutive Bit Flips", "titleSlug": "minimum-number-of-k-consecutive-bit-flips", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 122565, "totalSubmissionRaw": 195369}, "996": {"acRate": 50.17860895146039, "difficulty": "Hard", "likes": 989, "dislikes": 45, "categoryTitle": "Algorithms", "frontendQuestionId": "996", "paidOnly": false, "title": "Number of Squareful Arrays", "titleSlug": "number-of-squareful-arrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 40596, "totalSubmissionRaw": 80903}, "997": {"acRate": 49.7578260155413, "difficulty": "Easy", "likes": 6636, "dislikes": 600, "categoryTitle": "Algorithms", "frontendQuestionId": "997", "paidOnly": false, "title": "Find the Town Judge", "titleSlug": "find-the-town-judge", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 608889, "totalSubmissionRaw": 1223704}, "998": {"acRate": 69.63714878582245, "difficulty": "Medium", "likes": 534, "dislikes": 788, "categoryTitle": "Algorithms", "frontendQuestionId": "998", "paidOnly": false, "title": "Maximum Binary Tree II", "titleSlug": "maximum-binary-tree-ii", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 37251, "totalSubmissionRaw": 53493}, "999": {"acRate": 69.33495047503537, "difficulty": "Easy", "likes": 711, "dislikes": 636, "categoryTitle": "Algorithms", "frontendQuestionId": "999", "paidOnly": false, "title": "Available Captures for Rook", "titleSlug": "available-captures-for-rook", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 68600, "totalSubmissionRaw": 98940}, "1000": {"acRate": 43.31911907015324, "difficulty": "Hard", "likes": 2471, "dislikes": 111, "categoryTitle": "Algorithms", "frontendQuestionId": "1000", "paidOnly": false, "title": "Minimum Cost to Merge Stones", "titleSlug": "minimum-cost-to-merge-stones", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 40736, "totalSubmissionRaw": 94037}, "1001": {"acRate": 37.28947278153192, "difficulty": "Hard", "likes": 614, "dislikes": 154, "categoryTitle": "Algorithms", "frontendQuestionId": "1001", "paidOnly": false, "title": "Grid Illumination", "titleSlug": "grid-illumination", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21742, "totalSubmissionRaw": 58306}, "1002": {"acRate": 74.59002244087692, "difficulty": "Easy", "likes": 4259, "dislikes": 412, "categoryTitle": "Algorithms", "frontendQuestionId": "1002", "paidOnly": false, "title": "Find Common Characters", "titleSlug": "find-common-characters", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 362964, "totalSubmissionRaw": 486612}, "1003": {"acRate": 59.98141721094198, "difficulty": "Medium", "likes": 999, "dislikes": 470, "categoryTitle": "Algorithms", "frontendQuestionId": "1003", "paidOnly": false, "title": "Check If Word Is Valid After Substitutions", "titleSlug": "check-if-word-is-valid-after-substitutions", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 65847, "totalSubmissionRaw": 109779}, "1004": {"acRate": 63.80487795121649, "difficulty": "Medium", "likes": 8676, "dislikes": 136, "categoryTitle": "Algorithms", "frontendQuestionId": "1004", "paidOnly": false, "title": "Max Consecutive Ones III", "titleSlug": "max-consecutive-ones-iii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 638020, "totalSubmissionRaw": 999954}, "1005": {"acRate": 51.374860464740046, "difficulty": "Easy", "likes": 1553, "dislikes": 114, "categoryTitle": "Algorithms", "frontendQuestionId": "1005", "paidOnly": false, "title": "Maximize Sum Of Array After K Negations", "titleSlug": "maximize-sum-of-array-after-k-negations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 95268, "totalSubmissionRaw": 185436}, "1006": {"acRate": 57.68980267211181, "difficulty": "Medium", "likes": 374, "dislikes": 355, "categoryTitle": "Algorithms", "frontendQuestionId": "1006", "paidOnly": false, "title": "Clumsy Factorial", "titleSlug": "clumsy-factorial", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 32773, "totalSubmissionRaw": 56809}, "1007": {"acRate": 52.26180507980006, "difficulty": "Medium", "likes": 2840, "dislikes": 253, "categoryTitle": "Algorithms", "frontendQuestionId": "1007", "paidOnly": false, "title": "Minimum Domino Rotations For Equal Row", "titleSlug": "minimum-domino-rotations-for-equal-row", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 205969, "totalSubmissionRaw": 394110}, "1008": {"acRate": 82.41469257839262, "difficulty": "Medium", "likes": 6174, "dislikes": 83, "categoryTitle": "Algorithms", "frontendQuestionId": "1008", "paidOnly": false, "title": "Construct Binary Search Tree from Preorder Traversal", "titleSlug": "construct-binary-search-tree-from-preorder-traversal", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 387354, "totalSubmissionRaw": 470006}, "1009": {"acRate": 60.80213993065746, "difficulty": "Easy", "likes": 2424, "dislikes": 112, "categoryTitle": "Algorithms", "frontendQuestionId": "1009", "paidOnly": false, "title": "Complement of Base 10 Integer", "titleSlug": "complement-of-base-10-integer", "topicTags": [{"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 254809, "totalSubmissionRaw": 419079}, "1010": {"acRate": 52.994679355180885, "difficulty": "Medium", "likes": 4209, "dislikes": 172, "categoryTitle": "Algorithms", "frontendQuestionId": "1010", "paidOnly": false, "title": "Pairs of Songs With Total Durations Divisible by 60", "titleSlug": "pairs-of-songs-with-total-durations-divisible-by-60", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 280777, "totalSubmissionRaw": 529821}, "1011": {"acRate": 70.17860409425772, "difficulty": "Medium", "likes": 9542, "dislikes": 231, "categoryTitle": "Algorithms", "frontendQuestionId": "1011", "paidOnly": false, "title": "Capacity To Ship Packages Within D Days", "titleSlug": "capacity-to-ship-packages-within-d-days", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 422005, "totalSubmissionRaw": 601330}, "1012": {"acRate": 42.501858646905056, "difficulty": "Hard", "likes": 775, "dislikes": 88, "categoryTitle": "Algorithms", "frontendQuestionId": "1012", "paidOnly": false, "title": "Numbers With Repeated Digits", "titleSlug": "numbers-with-repeated-digits", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17722, "totalSubmissionRaw": 41697}, "1013": {"acRate": 42.007354625160424, "difficulty": "Easy", "likes": 1709, "dislikes": 158, "categoryTitle": "Algorithms", "frontendQuestionId": "1013", "paidOnly": false, "title": "Partition Array Into Three Parts With Equal Sum", "titleSlug": "partition-array-into-three-parts-with-equal-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 97213, "totalSubmissionRaw": 231419}, "1014": {"acRate": 59.363404874499814, "difficulty": "Medium", "likes": 2570, "dislikes": 60, "categoryTitle": "Algorithms", "frontendQuestionId": "1014", "paidOnly": false, "title": "Best Sightseeing Pair", "titleSlug": "best-sightseeing-pair", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 97901, "totalSubmissionRaw": 164926}, "1015": {"acRate": 46.6123907281859, "difficulty": "Medium", "likes": 1142, "dislikes": 853, "categoryTitle": "Algorithms", "frontendQuestionId": "1015", "paidOnly": false, "title": "Smallest Integer Divisible by K", "titleSlug": "smallest-integer-divisible-by-k", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 63666, "totalSubmissionRaw": 136586}, "1016": {"acRate": 57.44428989967743, "difficulty": "Medium", "likes": 356, "dislikes": 532, "categoryTitle": "Algorithms", "frontendQuestionId": "1016", "paidOnly": false, "title": "Binary String With Substrings Representing 1 To N", "titleSlug": "binary-string-with-substrings-representing-1-to-n", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 38822, "totalSubmissionRaw": 67582}, "1017": {"acRate": 60.91568469429984, "difficulty": "Medium", "likes": 515, "dislikes": 291, "categoryTitle": "Algorithms", "frontendQuestionId": "1017", "paidOnly": false, "title": "Convert to Base -2", "titleSlug": "convert-to-base-2", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27967, "totalSubmissionRaw": 45911}, "1018": {"acRate": 46.81322454585589, "difficulty": "Easy", "likes": 730, "dislikes": 189, "categoryTitle": "Algorithms", "frontendQuestionId": "1018", "paidOnly": false, "title": "Binary Prefix Divisible By 5", "titleSlug": "binary-prefix-divisible-by-5", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 57262, "totalSubmissionRaw": 122319}, "1019": {"acRate": 61.174679804058364, "difficulty": "Medium", "likes": 3306, "dislikes": 120, "categoryTitle": "Algorithms", "frontendQuestionId": "1019", "paidOnly": false, "title": "Next Greater Node In Linked List", "titleSlug": "next-greater-node-in-linked-list", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 163972, "totalSubmissionRaw": 268038}, "1020": {"acRate": 69.2747383478027, "difficulty": "Medium", "likes": 4075, "dislikes": 79, "categoryTitle": "Algorithms", "frontendQuestionId": "1020", "paidOnly": false, "title": "Number of Enclaves", "titleSlug": "number-of-enclaves", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 244570, "totalSubmissionRaw": 353041}, "1021": {"acRate": 83.56555963134808, "difficulty": "Easy", "likes": 2978, "dislikes": 1607, "categoryTitle": "Algorithms", "frontendQuestionId": "1021", "paidOnly": false, "title": "Remove Outermost Parentheses", "titleSlug": "remove-outermost-parentheses", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 356066, "totalSubmissionRaw": 426092}, "1022": {"acRate": 73.13583980880755, "difficulty": "Easy", "likes": 3350, "dislikes": 187, "categoryTitle": "Algorithms", "frontendQuestionId": "1022", "paidOnly": false, "title": "Sum of Root To Leaf Binary Numbers", "titleSlug": "sum-of-root-to-leaf-binary-numbers", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 216662, "totalSubmissionRaw": 296246}, "1023": {"acRate": 62.64290684958743, "difficulty": "Medium", "likes": 905, "dislikes": 329, "categoryTitle": "Algorithms", "frontendQuestionId": "1023", "paidOnly": false, "title": "Camelcase Matching", "titleSlug": "camelcase-matching", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 50410, "totalSubmissionRaw": 80469}, "1024": {"acRate": 51.47194681060006, "difficulty": "Medium", "likes": 1764, "dislikes": 61, "categoryTitle": "Algorithms", "frontendQuestionId": "1024", "paidOnly": false, "title": "Video Stitching", "titleSlug": "video-stitching", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 70759, "totalSubmissionRaw": 137471}, "1025": {"acRate": 69.13287123910186, "difficulty": "Easy", "likes": 2195, "dislikes": 4136, "categoryTitle": "Algorithms", "frontendQuestionId": "1025", "paidOnly": false, "title": "Divisor Game", "titleSlug": "divisor-game", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Brainteaser", "id": "VG9waWNUYWdOb2RlOjMy", "slug": "brainteaser"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 270790, "totalSubmissionRaw": 391695}, "1026": {"acRate": 78.09164949834033, "difficulty": "Medium", "likes": 4934, "dislikes": 166, "categoryTitle": "Algorithms", "frontendQuestionId": "1026", "paidOnly": false, "title": "Maximum Difference Between Node and Ancestor", "titleSlug": "maximum-difference-between-node-and-ancestor", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 332427, "totalSubmissionRaw": 425688}, "1027": {"acRate": 49.19578102114126, "difficulty": "Medium", "likes": 4683, "dislikes": 211, "categoryTitle": "Algorithms", "frontendQuestionId": "1027", "paidOnly": false, "title": "Longest Arithmetic Subsequence", "titleSlug": "longest-arithmetic-subsequence", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 180366, "totalSubmissionRaw": 366629}, "1028": {"acRate": 75.07073860864475, "difficulty": "Hard", "likes": 1636, "dislikes": 45, "categoryTitle": "Algorithms", "frontendQuestionId": "1028", "paidOnly": false, "title": "Recover a Tree From Preorder Traversal", "titleSlug": "recover-a-tree-from-preorder-traversal", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 53858, "totalSubmissionRaw": 71743}, "1029": {"acRate": 66.89915784927662, "difficulty": "Medium", "likes": 4724, "dislikes": 352, "categoryTitle": "Algorithms", "frontendQuestionId": "1029", "paidOnly": false, "title": "Two City Scheduling", "titleSlug": "two-city-scheduling", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 247848, "totalSubmissionRaw": 370480}, "1030": {"acRate": 71.50575741026923, "difficulty": "Easy", "likes": 756, "dislikes": 327, "categoryTitle": "Algorithms", "frontendQuestionId": "1030", "paidOnly": false, "title": "Matrix Cells in Distance Order", "titleSlug": "matrix-cells-in-distance-order", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 61540, "totalSubmissionRaw": 86063}, "1031": {"acRate": 59.846543085343875, "difficulty": "Medium", "likes": 2554, "dislikes": 84, "categoryTitle": "Algorithms", "frontendQuestionId": "1031", "paidOnly": false, "title": "Maximum Sum of Two Non-Overlapping Subarrays", "titleSlug": "maximum-sum-of-two-non-overlapping-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 72382, "totalSubmissionRaw": 120946}, "1032": {"acRate": 52.10812297957218, "difficulty": "Hard", "likes": 1814, "dislikes": 184, "categoryTitle": "Algorithms", "frontendQuestionId": "1032", "paidOnly": false, "title": "Stream of Characters", "titleSlug": "stream-of-characters", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Data Stream", "id": "VG9waWNUYWdOb2RlOjYxMDYz", "slug": "data-stream"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 90912, "totalSubmissionRaw": 174468}, "1033": {"acRate": 48.57287430424108, "difficulty": "Medium", "likes": 219, "dislikes": 649, "categoryTitle": "Algorithms", "frontendQuestionId": "1033", "paidOnly": false, "title": "Moving Stones Until Consecutive", "titleSlug": "moving-stones-until-consecutive", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Brainteaser", "id": "VG9waWNUYWdOb2RlOjMy", "slug": "brainteaser"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25918, "totalSubmissionRaw": 53359}, "1034": {"acRate": 49.185004620762626, "difficulty": "Medium", "likes": 742, "dislikes": 886, "categoryTitle": "Algorithms", "frontendQuestionId": "1034", "paidOnly": false, "title": "Coloring A Border", "titleSlug": "coloring-a-border", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 36723, "totalSubmissionRaw": 74663}, "1035": {"acRate": 63.38657698767434, "difficulty": "Medium", "likes": 3821, "dislikes": 58, "categoryTitle": "Algorithms", "frontendQuestionId": "1035", "paidOnly": false, "title": "Uncrossed Lines", "titleSlug": "uncrossed-lines", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 162662, "totalSubmissionRaw": 256619}, "1036": {"acRate": 34.8205535072572, "difficulty": "Hard", "likes": 671, "dislikes": 169, "categoryTitle": "Algorithms", "frontendQuestionId": "1036", "paidOnly": false, "title": "Escape a Large Maze", "titleSlug": "escape-a-large-maze", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22383, "totalSubmissionRaw": 64281}, "1037": {"acRate": 37.21999823887614, "difficulty": "Easy", "likes": 420, "dislikes": 528, "categoryTitle": "Algorithms", "frontendQuestionId": "1037", "paidOnly": false, "title": "Valid Boomerang", "titleSlug": "valid-boomerang", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 54949, "totalSubmissionRaw": 147633}, "1038": {"acRate": 88.25021776340235, "difficulty": "Medium", "likes": 4317, "dislikes": 166, "categoryTitle": "Algorithms", "frontendQuestionId": "1038", "paidOnly": false, "title": "Binary Search Tree to Greater Sum Tree", "titleSlug": "binary-search-tree-to-greater-sum-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 289759, "totalSubmissionRaw": 328338}, "1039": {"acRate": 59.540996775597186, "difficulty": "Medium", "likes": 1837, "dislikes": 176, "categoryTitle": "Algorithms", "frontendQuestionId": "1039", "paidOnly": false, "title": "Minimum Score Triangulation of Polygon", "titleSlug": "minimum-score-triangulation-of-polygon", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 53366, "totalSubmissionRaw": 89629}, "1040": {"acRate": 56.92283180200754, "difficulty": "Medium", "likes": 373, "dislikes": 646, "categoryTitle": "Algorithms", "frontendQuestionId": "1040", "paidOnly": false, "title": "Moving Stones Until Consecutive II", "titleSlug": "moving-stones-until-consecutive-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10718, "totalSubmissionRaw": 18829}, "1041": {"acRate": 55.86570640927682, "difficulty": "Medium", "likes": 3737, "dislikes": 703, "categoryTitle": "Algorithms", "frontendQuestionId": "1041", "paidOnly": false, "title": "Robot Bounded In Circle", "titleSlug": "robot-bounded-in-circle", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 240546, "totalSubmissionRaw": 430579}, "1042": {"acRate": 51.5359372145903, "difficulty": "Medium", "likes": 1452, "dislikes": 716, "categoryTitle": "Algorithms", "frontendQuestionId": "1042", "paidOnly": false, "title": "Flower Planting With No Adjacent", "titleSlug": "flower-planting-with-no-adjacent", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 81820, "totalSubmissionRaw": 158763}, "1043": {"acRate": 76.64907601229177, "difficulty": "Medium", "likes": 4722, "dislikes": 422, "categoryTitle": "Algorithms", "frontendQuestionId": "1043", "paidOnly": false, "title": "Partition Array for Maximum Sum", "titleSlug": "partition-array-for-maximum-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 200293, "totalSubmissionRaw": 261312}, "1044": {"acRate": 30.56953179594689, "difficulty": "Hard", "likes": 2232, "dislikes": 386, "categoryTitle": "Algorithms", "frontendQuestionId": "1044", "paidOnly": false, "title": "Longest Duplicate Substring", "titleSlug": "longest-duplicate-substring", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "Suffix Array", "id": "VG9waWNUYWdOb2RlOjU2Njk4", "slug": "suffix-array"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 69992, "totalSubmissionRaw": 228960}, "1045": {"acRate": 62.12373077286743, "difficulty": "Medium", "likes": 750, "dislikes": 66, "categoryTitle": "Database", "frontendQuestionId": "1045", "paidOnly": false, "title": "Customers Who Bought All Products", "titleSlug": "customers-who-bought-all-products", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 203677, "totalSubmissionRaw": 327858}, "1046": {"acRate": 65.54331912924047, "difficulty": "Easy", "likes": 6036, "dislikes": 126, "categoryTitle": "Algorithms", "frontendQuestionId": "1046", "paidOnly": false, "title": "Last Stone Weight", "titleSlug": "last-stone-weight", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 651396, "totalSubmissionRaw": 993842}, "1047": {"acRate": 69.95531909698767, "difficulty": "Easy", "likes": 6616, "dislikes": 260, "categoryTitle": "Algorithms", "frontendQuestionId": "1047", "paidOnly": false, "title": "Remove All Adjacent Duplicates In String", "titleSlug": "remove-all-adjacent-duplicates-in-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 601680, "totalSubmissionRaw": 860094}, "1048": {"acRate": 61.304337717743195, "difficulty": "Medium", "likes": 7310, "dislikes": 254, "categoryTitle": "Algorithms", "frontendQuestionId": "1048", "paidOnly": false, "title": "Longest String Chain", "titleSlug": "longest-string-chain", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 421894, "totalSubmissionRaw": 688196}, "1049": {"acRate": 55.92479336340791, "difficulty": "Medium", "likes": 3121, "dislikes": 119, "categoryTitle": "Algorithms", "frontendQuestionId": "1049", "paidOnly": false, "title": "Last Stone Weight II", "titleSlug": "last-stone-weight-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 92357, "totalSubmissionRaw": 165145}, "1050": {"acRate": 70.16101315969387, "difficulty": "Easy", "likes": 655, "dislikes": 51, "categoryTitle": "Database", "frontendQuestionId": "1050", "paidOnly": false, "title": "Actors and Directors Who Cooperated At Least Three Times", "titleSlug": "actors-and-directors-who-cooperated-at-least-three-times", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 189854, "totalSubmissionRaw": 270596}, "1051": {"acRate": 80.79297219639454, "difficulty": "Easy", "likes": 1603, "dislikes": 113, "categoryTitle": "Algorithms", "frontendQuestionId": "1051", "paidOnly": false, "title": "Height Checker", "titleSlug": "height-checker", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting Sort", "id": "VG9waWNUYWdOb2RlOjYxMDcy", "slug": "counting-sort"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 510060, "totalSubmissionRaw": 631318}, "1052": {"acRate": 64.29576776463689, "difficulty": "Medium", "likes": 2443, "dislikes": 237, "categoryTitle": "Algorithms", "frontendQuestionId": "1052", "paidOnly": false, "title": "Grumpy Bookstore Owner", "titleSlug": "grumpy-bookstore-owner", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 197343, "totalSubmissionRaw": 306930}, "1053": {"acRate": 49.71235437940457, "difficulty": "Medium", "likes": 449, "dislikes": 41, "categoryTitle": "Algorithms", "frontendQuestionId": "1053", "paidOnly": false, "title": "Previous Permutation With One Swap", "titleSlug": "previous-permutation-with-one-swap", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 41478, "totalSubmissionRaw": 83436}, "1054": {"acRate": 46.67254852533401, "difficulty": "Medium", "likes": 1268, "dislikes": 50, "categoryTitle": "Algorithms", "frontendQuestionId": "1054", "paidOnly": false, "title": "Distant Barcodes", "titleSlug": "distant-barcodes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 44436, "totalSubmissionRaw": 95208}, "1055": {"acRate": 60.37276351709645, "difficulty": "Medium", "likes": 1271, "dislikes": 67, "categoryTitle": "Algorithms", "frontendQuestionId": "1055", "paidOnly": true, "title": "Shortest Way to Form String", "titleSlug": "shortest-way-to-form-string", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 92218, "totalSubmissionRaw": 152748}, "1056": {"acRate": 48.831296047352566, "difficulty": "Easy", "likes": 314, "dislikes": 180, "categoryTitle": "Algorithms", "frontendQuestionId": "1056", "paidOnly": true, "title": "Confusing Number", "titleSlug": "confusing-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 46859, "totalSubmissionRaw": 95961}, "1057": {"acRate": 58.64414750429734, "difficulty": "Medium", "likes": 982, "dislikes": 195, "categoryTitle": "Algorithms", "frontendQuestionId": "1057", "paidOnly": true, "title": "Campus Bikes", "titleSlug": "campus-bikes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 72326, "totalSubmissionRaw": 123331}, "1058": {"acRate": 45.13096037609134, "difficulty": "Medium", "likes": 150, "dislikes": 146, "categoryTitle": "Algorithms", "frontendQuestionId": "1058", "paidOnly": true, "title": "Minimize Rounding Error to Meet Target", "titleSlug": "minimize-rounding-error-to-meet-target", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9408, "totalSubmissionRaw": 20846}, "1059": {"acRate": 37.53720528901369, "difficulty": "Medium", "likes": 710, "dislikes": 390, "categoryTitle": "Algorithms", "frontendQuestionId": "1059", "paidOnly": true, "title": "All Paths from Source Lead to Destination", "titleSlug": "all-paths-from-source-lead-to-destination", "topicTags": [{"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 62427, "totalSubmissionRaw": 166307}, "1060": {"acRate": 57.31347558356007, "difficulty": "Medium", "likes": 1657, "dislikes": 62, "categoryTitle": "Algorithms", "frontendQuestionId": "1060", "paidOnly": true, "title": "Missing Element in Sorted Array", "titleSlug": "missing-element-in-sorted-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 140077, "totalSubmissionRaw": 244405}, "1061": {"acRate": 76.64212434361744, "difficulty": "Medium", "likes": 2353, "dislikes": 153, "categoryTitle": "Algorithms", "frontendQuestionId": "1061", "paidOnly": false, "title": "Lexicographically Smallest Equivalent String", "titleSlug": "lexicographically-smallest-equivalent-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 82027, "totalSubmissionRaw": 107026}, "1062": {"acRate": 62.35051070163733, "difficulty": "Medium", "likes": 706, "dislikes": 73, "categoryTitle": "Algorithms", "frontendQuestionId": "1062", "paidOnly": true, "title": "Longest Repeating Substring", "titleSlug": "longest-repeating-substring", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "Suffix Array", "id": "VG9waWNUYWdOb2RlOjU2Njk4", "slug": "suffix-array"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 48590, "totalSubmissionRaw": 77931}, "1063": {"acRate": 79.14251985404593, "difficulty": "Hard", "likes": 310, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "1063", "paidOnly": true, "title": "Number of Valid Subarrays", "titleSlug": "number-of-valid-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 14749, "totalSubmissionRaw": 18636}, "1064": {"acRate": 64.156104547082, "difficulty": "Easy", "likes": 437, "dislikes": 67, "categoryTitle": "Algorithms", "frontendQuestionId": "1064", "paidOnly": true, "title": "Fixed Point", "titleSlug": "fixed-point", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 44797, "totalSubmissionRaw": 69825}, "1065": {"acRate": 67.54373352504194, "difficulty": "Easy", "likes": 377, "dislikes": 108, "categoryTitle": "Algorithms", "frontendQuestionId": "1065", "paidOnly": true, "title": "Index Pairs of a String", "titleSlug": "index-pairs-of-a-string", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 28186, "totalSubmissionRaw": 41730}, "1066": {"acRate": 55.18778940147487, "difficulty": "Medium", "likes": 935, "dislikes": 86, "categoryTitle": "Algorithms", "frontendQuestionId": "1066", "paidOnly": true, "title": "Campus Bikes II", "titleSlug": "campus-bikes-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 51488, "totalSubmissionRaw": 93296}, "1067": {"acRate": 46.32140475661258, "difficulty": "Hard", "likes": 94, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "1067", "paidOnly": true, "title": "Digit Count in Range", "titleSlug": "digit-count-in-range", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4168, "totalSubmissionRaw": 8998}, "1068": {"acRate": 83.91767432187528, "difficulty": "Easy", "likes": 903, "dislikes": 217, "categoryTitle": "Database", "frontendQuestionId": "1068", "paidOnly": false, "title": "Product Sales Analysis I", "titleSlug": "product-sales-analysis-i", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 564917, "totalSubmissionRaw": 673180}, "1069": {"acRate": 81.92544638195677, "difficulty": "Easy", "likes": 80, "dislikes": 181, "categoryTitle": "Database", "frontendQuestionId": "1069", "paidOnly": true, "title": "Product Sales Analysis II", "titleSlug": "product-sales-analysis-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 54922, "totalSubmissionRaw": 67039}, "1070": {"acRate": 43.28822120054394, "difficulty": "Medium", "likes": 435, "dislikes": 900, "categoryTitle": "Database", "frontendQuestionId": "1070", "paidOnly": false, "title": "Product Sales Analysis III", "titleSlug": "product-sales-analysis-iii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 180492, "totalSubmissionRaw": 416952}, "1071": {"acRate": 51.650716287146295, "difficulty": "Easy", "likes": 5197, "dislikes": 1356, "categoryTitle": "Algorithms", "frontendQuestionId": "1071", "paidOnly": false, "title": "Greatest Common Divisor of Strings", "titleSlug": "greatest-common-divisor-of-strings", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 523502, "totalSubmissionRaw": 1013539}, "1072": {"acRate": 64.11252804991517, "difficulty": "Medium", "likes": 746, "dislikes": 53, "categoryTitle": "Algorithms", "frontendQuestionId": "1072", "paidOnly": false, "title": "Flip Columns For Maximum Number of Equal Rows", "titleSlug": "flip-columns-for-maximum-number-of-equal-rows", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23427, "totalSubmissionRaw": 36541}, "1073": {"acRate": 36.99232943076302, "difficulty": "Medium", "likes": 321, "dislikes": 126, "categoryTitle": "Algorithms", "frontendQuestionId": "1073", "paidOnly": false, "title": "Adding Two Negabinary Numbers", "titleSlug": "adding-two-negabinary-numbers", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18326, "totalSubmissionRaw": 49540}, "1074": {"acRate": 74.44382395196433, "difficulty": "Hard", "likes": 3723, "dislikes": 103, "categoryTitle": "Algorithms", "frontendQuestionId": "1074", "paidOnly": false, "title": "Number of Submatrices That Sum to Target", "titleSlug": "number-of-submatrices-that-sum-to-target", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 155968, "totalSubmissionRaw": 209511}, "1075": {"acRate": 62.7928304015135, "difficulty": "Easy", "likes": 615, "dislikes": 169, "categoryTitle": "Database", "frontendQuestionId": "1075", "paidOnly": false, "title": "Project Employees I", "titleSlug": "project-employees-i", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 282785, "totalSubmissionRaw": 450346}, "1076": {"acRate": 49.97951274478002, "difficulty": "Easy", "likes": 203, "dislikes": 62, "categoryTitle": "Database", "frontendQuestionId": "1076", "paidOnly": true, "title": "Project Employees II", "titleSlug": "project-employees-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 58549, "totalSubmissionRaw": 117146}, "1077": {"acRate": 76.63904128244037, "difficulty": "Medium", "likes": 270, "dislikes": 9, "categoryTitle": "Database", "frontendQuestionId": "1077", "paidOnly": true, "title": "Project Employees III", "titleSlug": "project-employees-iii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 59091, "totalSubmissionRaw": 77103}, "1078": {"acRate": 63.50871271254378, "difficulty": "Easy", "likes": 493, "dislikes": 360, "categoryTitle": "Algorithms", "frontendQuestionId": "1078", "paidOnly": false, "title": "Occurrences After Bigram", "titleSlug": "occurrences-after-bigram", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 75261, "totalSubmissionRaw": 118505}, "1079": {"acRate": 76.4373897707231, "difficulty": "Medium", "likes": 2491, "dislikes": 70, "categoryTitle": "Algorithms", "frontendQuestionId": "1079", "paidOnly": false, "title": "Letter Tile Possibilities", "titleSlug": "letter-tile-possibilities", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 104016, "totalSubmissionRaw": 136080}, "1080": {"acRate": 55.93259232699892, "difficulty": "Medium", "likes": 700, "dislikes": 714, "categoryTitle": "Algorithms", "frontendQuestionId": "1080", "paidOnly": false, "title": "Insufficient Nodes in Root to Leaf Paths", "titleSlug": "insufficient-nodes-in-root-to-leaf-paths", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 38999, "totalSubmissionRaw": 69725}, "1081": {"acRate": 61.15491138939392, "difficulty": "Medium", "likes": 2609, "dislikes": 192, "categoryTitle": "Algorithms", "frontendQuestionId": "1081", "paidOnly": false, "title": "Smallest Subsequence of Distinct Characters", "titleSlug": "smallest-subsequence-of-distinct-characters", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 71982, "totalSubmissionRaw": 117705}, "1082": {"acRate": 74.42680776014109, "difficulty": "Easy", "likes": 196, "dislikes": 75, "categoryTitle": "Database", "frontendQuestionId": "1082", "paidOnly": true, "title": "Sales Analysis I", "titleSlug": "sales-analysis-i", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 59924, "totalSubmissionRaw": 80514}, "1083": {"acRate": 49.73014971260527, "difficulty": "Easy", "likes": 271, "dislikes": 46, "categoryTitle": "Database", "frontendQuestionId": "1083", "paidOnly": true, "title": "Sales Analysis II", "titleSlug": "sales-analysis-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 59525, "totalSubmissionRaw": 119696}, "1084": {"acRate": 46.58933778957371, "difficulty": "Easy", "likes": 730, "dislikes": 154, "categoryTitle": "Database", "frontendQuestionId": "1084", "paidOnly": false, "title": "Sales Analysis III", "titleSlug": "sales-analysis-iii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 142186, "totalSubmissionRaw": 305190}, "1085": {"acRate": 76.44933228593874, "difficulty": "Easy", "likes": 117, "dislikes": 151, "categoryTitle": "Algorithms", "frontendQuestionId": "1085", "paidOnly": true, "title": "Sum of Digits in the Minimum Number", "titleSlug": "sum-of-digits-in-the-minimum-number", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24330, "totalSubmissionRaw": 31825}, "1086": {"acRate": 74.51658921736183, "difficulty": "Easy", "likes": 798, "dislikes": 126, "categoryTitle": "Algorithms", "frontendQuestionId": "1086", "paidOnly": true, "title": "High Five", "titleSlug": "high-five", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 105512, "totalSubmissionRaw": 141596}, "1087": {"acRate": 66.43242298666932, "difficulty": "Medium", "likes": 645, "dislikes": 51, "categoryTitle": "Algorithms", "frontendQuestionId": "1087", "paidOnly": true, "title": "Brace Expansion", "titleSlug": "brace-expansion", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 53223, "totalSubmissionRaw": 80116}, "1088": {"acRate": 47.15876911459317, "difficulty": "Hard", "likes": 492, "dislikes": 144, "categoryTitle": "Algorithms", "frontendQuestionId": "1088", "paidOnly": true, "title": "Confusing Number II", "titleSlug": "confusing-number-ii", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 37470, "totalSubmissionRaw": 79455}, "1089": {"acRate": 52.08755041087024, "difficulty": "Easy", "likes": 2614, "dislikes": 753, "categoryTitle": "Algorithms", "frontendQuestionId": "1089", "paidOnly": false, "title": "Duplicate Zeros", "titleSlug": "duplicate-zeros", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 436165, "totalSubmissionRaw": 837369}, "1090": {"acRate": 62.38900567914405, "difficulty": "Medium", "likes": 452, "dislikes": 628, "categoryTitle": "Algorithms", "frontendQuestionId": "1090", "paidOnly": false, "title": "Largest Values From Labels", "titleSlug": "largest-values-from-labels", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 39768, "totalSubmissionRaw": 63742}, "1091": {"acRate": 47.937644050196845, "difficulty": "Medium", "likes": 6566, "dislikes": 241, "categoryTitle": "Algorithms", "frontendQuestionId": "1091", "paidOnly": false, "title": "Shortest Path in Binary Matrix", "titleSlug": "shortest-path-in-binary-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 508742, "totalSubmissionRaw": 1061255}, "1092": {"acRate": 59.465443330341806, "difficulty": "Hard", "likes": 4910, "dislikes": 69, "categoryTitle": "Algorithms", "frontendQuestionId": "1092", "paidOnly": false, "title": "Shortest Common Supersequence ", "titleSlug": "shortest-common-supersequence", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 130532, "totalSubmissionRaw": 219509}, "1093": {"acRate": 42.015322365313125, "difficulty": "Medium", "likes": 156, "dislikes": 103, "categoryTitle": "Algorithms", "frontendQuestionId": "1093", "paidOnly": false, "title": "Statistics from a Large Sample", "titleSlug": "statistics-from-a-large-sample", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Probability and Statistics", "id": "VG9waWNUYWdOb2RlOjYxMDc5", "slug": "probability-and-statistics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20456, "totalSubmissionRaw": 48687}, "1094": {"acRate": 55.97792208429661, "difficulty": "Medium", "likes": 4460, "dislikes": 101, "categoryTitle": "Algorithms", "frontendQuestionId": "1094", "paidOnly": false, "title": "Car Pooling", "titleSlug": "car-pooling", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 228091, "totalSubmissionRaw": 407466}, "1095": {"acRate": 40.27303277176071, "difficulty": "Hard", "likes": 3258, "dislikes": 131, "categoryTitle": "Algorithms", "frontendQuestionId": "1095", "paidOnly": false, "title": "Find in Mountain Array", "titleSlug": "find-in-mountain-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 144050, "totalSubmissionRaw": 357685}, "1096": {"acRate": 63.79588543767648, "difficulty": "Hard", "likes": 482, "dislikes": 289, "categoryTitle": "Algorithms", "frontendQuestionId": "1096", "paidOnly": false, "title": "Brace Expansion II", "titleSlug": "brace-expansion-ii", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25304, "totalSubmissionRaw": 39664}, "1097": {"acRate": 51.06270038431323, "difficulty": "Hard", "likes": 183, "dislikes": 33, "categoryTitle": "Database", "frontendQuestionId": "1097", "paidOnly": true, "title": "Game Play Analysis V", "titleSlug": "game-play-analysis-v", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 24049, "totalSubmissionRaw": 47097}, "1098": {"acRate": 43.14962956708951, "difficulty": "Medium", "likes": 202, "dislikes": 605, "categoryTitle": "Database", "frontendQuestionId": "1098", "paidOnly": true, "title": "Unpopular Books", "titleSlug": "unpopular-books", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 40886, "totalSubmissionRaw": 94754}, "1099": {"acRate": 61.85322117655608, "difficulty": "Easy", "likes": 1136, "dislikes": 131, "categoryTitle": "Algorithms", "frontendQuestionId": "1099", "paidOnly": true, "title": "Two Sum Less Than K", "titleSlug": "two-sum-less-than-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 136181, "totalSubmissionRaw": 220168}, "1100": {"acRate": 74.7840050267921, "difficulty": "Medium", "likes": 573, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "1100", "paidOnly": true, "title": "Find K-Length Substrings With No Repeated Characters", "titleSlug": "find-k-length-substrings-with-no-repeated-characters", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 42846, "totalSubmissionRaw": 57293}, "1101": {"acRate": 65.31378032125902, "difficulty": "Medium", "likes": 1039, "dislikes": 36, "categoryTitle": "Algorithms", "frontendQuestionId": "1101", "paidOnly": true, "title": "The Earliest Moment When Everyone Become Friends", "titleSlug": "the-earliest-moment-when-everyone-become-friends", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 100433, "totalSubmissionRaw": 153770}, "1102": {"acRate": 53.77781172038084, "difficulty": "Medium", "likes": 1296, "dislikes": 124, "categoryTitle": "Algorithms", "frontendQuestionId": "1102", "paidOnly": true, "title": "Path With Maximum Minimum Value", "titleSlug": "path-with-maximum-minimum-value", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 63375, "totalSubmissionRaw": 117846}, "1103": {"acRate": 65.4817810244369, "difficulty": "Easy", "likes": 981, "dislikes": 197, "categoryTitle": "Algorithms", "frontendQuestionId": "1103", "paidOnly": false, "title": "Distribute Candies to People", "titleSlug": "distribute-candies-to-people", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 90357, "totalSubmissionRaw": 137988}, "1104": {"acRate": 75.48600847774188, "difficulty": "Medium", "likes": 1493, "dislikes": 317, "categoryTitle": "Algorithms", "frontendQuestionId": "1104", "paidOnly": false, "title": "Path In Zigzag Labelled Binary Tree", "titleSlug": "path-in-zigzag-labelled-binary-tree", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 46479, "totalSubmissionRaw": 61573}, "1105": {"acRate": 68.84285559570341, "difficulty": "Medium", "likes": 2526, "dislikes": 242, "categoryTitle": "Algorithms", "frontendQuestionId": "1105", "paidOnly": false, "title": "Filling Bookcase Shelves", "titleSlug": "filling-bookcase-shelves", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 139846, "totalSubmissionRaw": 203138}, "1106": {"acRate": 59.75299866725899, "difficulty": "Hard", "likes": 1190, "dislikes": 63, "categoryTitle": "Algorithms", "frontendQuestionId": "1106", "paidOnly": false, "title": "Parsing A Boolean Expression", "titleSlug": "parsing-a-boolean-expression", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33626, "totalSubmissionRaw": 56275}, "1107": {"acRate": 44.59452905228441, "difficulty": "Medium", "likes": 150, "dislikes": 166, "categoryTitle": "Database", "frontendQuestionId": "1107", "paidOnly": true, "title": "New Users Daily Count", "titleSlug": "new-users-daily-count", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 36778, "totalSubmissionRaw": 82472}, "1108": {"acRate": 89.25799032687581, "difficulty": "Easy", "likes": 2121, "dislikes": 1757, "categoryTitle": "Algorithms", "frontendQuestionId": "1108", "paidOnly": false, "title": "Defanging an IP Address", "titleSlug": "defanging-an-ip-address", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 678398, "totalSubmissionRaw": 760042}, "1109": {"acRate": 62.417706207698906, "difficulty": "Medium", "likes": 1651, "dislikes": 161, "categoryTitle": "Algorithms", "frontendQuestionId": "1109", "paidOnly": false, "title": "Corporate Flight Bookings", "titleSlug": "corporate-flight-bookings", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 67599, "totalSubmissionRaw": 108301}, "1110": {"acRate": 72.41637733931748, "difficulty": "Medium", "likes": 4565, "dislikes": 139, "categoryTitle": "Algorithms", "frontendQuestionId": "1110", "paidOnly": false, "title": "Delete Nodes And Return Forest", "titleSlug": "delete-nodes-and-return-forest", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 342066, "totalSubmissionRaw": 472360}, "1111": {"acRate": 72.02311539557905, "difficulty": "Medium", "likes": 440, "dislikes": 1768, "categoryTitle": "Algorithms", "frontendQuestionId": "1111", "paidOnly": false, "title": "Maximum Nesting Depth of Two Valid Parentheses Strings", "titleSlug": "maximum-nesting-depth-of-two-valid-parentheses-strings", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27793, "totalSubmissionRaw": 38589}, "1112": {"acRate": 70.8991193495349, "difficulty": "Medium", "likes": 301, "dislikes": 14, "categoryTitle": "Database", "frontendQuestionId": "1112", "paidOnly": true, "title": "Highest Grade For Each Student", "titleSlug": "highest-grade-for-each-student", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 62956, "totalSubmissionRaw": 88797}, "1113": {"acRate": 64.86832779019682, "difficulty": "Easy", "likes": 110, "dislikes": 403, "categoryTitle": "Database", "frontendQuestionId": "1113", "paidOnly": true, "title": "Reported Posts", "titleSlug": "reported-posts", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 47590, "totalSubmissionRaw": 73364}, "1114": {"acRate": 69.7785307280123, "difficulty": "Easy", "likes": 1481, "dislikes": 203, "categoryTitle": "Concurrency", "frontendQuestionId": "1114", "paidOnly": false, "title": "Print in Order", "titleSlug": "print-in-order", "topicTags": [{"name": "Concurrency", "id": "VG9waWNUYWdOb2RlOjYxMDQ1", "slug": "concurrency"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 164341, "totalSubmissionRaw": 235518}, "1115": {"acRate": 66.64194354045259, "difficulty": "Medium", "likes": 684, "dislikes": 55, "categoryTitle": "Concurrency", "frontendQuestionId": "1115", "paidOnly": false, "title": "Print FooBar Alternately", "titleSlug": "print-foobar-alternately", "topicTags": [{"name": "Concurrency", "id": "VG9waWNUYWdOb2RlOjYxMDQ1", "slug": "concurrency"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 88054, "totalSubmissionRaw": 132130}, "1116": {"acRate": 61.33023438674391, "difficulty": "Medium", "likes": 490, "dislikes": 333, "categoryTitle": "Concurrency", "frontendQuestionId": "1116", "paidOnly": false, "title": "Print Zero Even Odd", "titleSlug": "print-zero-even-odd", "topicTags": [{"name": "Concurrency", "id": "VG9waWNUYWdOb2RlOjYxMDQ1", "slug": "concurrency"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 53039, "totalSubmissionRaw": 86481}, "1117": {"acRate": 56.604318327112246, "difficulty": "Medium", "likes": 519, "dislikes": 166, "categoryTitle": "Concurrency", "frontendQuestionId": "1117", "paidOnly": false, "title": "Building H2O", "titleSlug": "building-h2o", "topicTags": [{"name": "Concurrency", "id": "VG9waWNUYWdOb2RlOjYxMDQ1", "slug": "concurrency"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 54896, "totalSubmissionRaw": 96982}, "1118": {"acRate": 58.35745540222147, "difficulty": "Easy", "likes": 42, "dislikes": 177, "categoryTitle": "Algorithms", "frontendQuestionId": "1118", "paidOnly": true, "title": "Number of Days in a Month", "titleSlug": "number-of-days-in-a-month", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8669, "totalSubmissionRaw": 14855}, "1119": {"acRate": 91.17242733699922, "difficulty": "Easy", "likes": 360, "dislikes": 115, "categoryTitle": "Algorithms", "frontendQuestionId": "1119", "paidOnly": true, "title": "Remove Vowels from a String", "titleSlug": "remove-vowels-from-a-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 111420, "totalSubmissionRaw": 122208}, "1120": {"acRate": 66.65040370412888, "difficulty": "Medium", "likes": 837, "dislikes": 36, "categoryTitle": "Algorithms", "frontendQuestionId": "1120", "paidOnly": true, "title": "Maximum Average Subtree", "titleSlug": "maximum-average-subtree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 69671, "totalSubmissionRaw": 104532}, "1121": {"acRate": 61.33100262205019, "difficulty": "Hard", "likes": 122, "dislikes": 30, "categoryTitle": "Algorithms", "frontendQuestionId": "1121", "paidOnly": true, "title": "Divide Array Into Increasing Sequences", "titleSlug": "divide-array-into-increasing-sequences", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4912, "totalSubmissionRaw": 8009}, "1122": {"acRate": 74.78047346563496, "difficulty": "Easy", "likes": 3157, "dislikes": 185, "categoryTitle": "Algorithms", "frontendQuestionId": "1122", "paidOnly": false, "title": "Relative Sort Array", "titleSlug": "relative-sort-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting Sort", "id": "VG9waWNUYWdOb2RlOjYxMDcy", "slug": "counting-sort"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 338345, "totalSubmissionRaw": 452451}, "1123": {"acRate": 72.55031197820546, "difficulty": "Medium", "likes": 1971, "dislikes": 846, "categoryTitle": "Algorithms", "frontendQuestionId": "1123", "paidOnly": false, "title": "Lowest Common Ancestor of Deepest Leaves", "titleSlug": "lowest-common-ancestor-of-deepest-leaves", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 115577, "totalSubmissionRaw": 159306}, "1124": {"acRate": 35.26539432537167, "difficulty": "Medium", "likes": 1430, "dislikes": 116, "categoryTitle": "Algorithms", "frontendQuestionId": "1124", "paidOnly": false, "title": "Longest Well-Performing Interval", "titleSlug": "longest-well-performing-interval", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33944, "totalSubmissionRaw": 96253}, "1125": {"acRate": 55.50248756218905, "difficulty": "Hard", "likes": 2181, "dislikes": 56, "categoryTitle": "Algorithms", "frontendQuestionId": "1125", "paidOnly": false, "title": "Smallest Sufficient Team", "titleSlug": "smallest-sufficient-team", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 64147, "totalSubmissionRaw": 115575}, "1126": {"acRate": 65.69231428938981, "difficulty": "Medium", "likes": 272, "dislikes": 31, "categoryTitle": "Database", "frontendQuestionId": "1126", "paidOnly": true, "title": "Active Businesses", "titleSlug": "active-businesses", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 45959, "totalSubmissionRaw": 69961}, "1127": {"acRate": 46.92625957334429, "difficulty": "Hard", "likes": 181, "dislikes": 133, "categoryTitle": "Database", "frontendQuestionId": "1127", "paidOnly": true, "title": "User Purchase Platform", "titleSlug": "user-purchase-platform", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15992, "totalSubmissionRaw": 34079}, "1128": {"acRate": 48.4792482166969, "difficulty": "Easy", "likes": 687, "dislikes": 334, "categoryTitle": "Algorithms", "frontendQuestionId": "1128", "paidOnly": false, "title": "Number of Equivalent Domino Pairs", "titleSlug": "number-of-equivalent-domino-pairs", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 71089, "totalSubmissionRaw": 146638}, "1129": {"acRate": 47.14225640501633, "difficulty": "Medium", "likes": 3491, "dislikes": 189, "categoryTitle": "Algorithms", "frontendQuestionId": "1129", "paidOnly": false, "title": "Shortest Path with Alternating Colors", "titleSlug": "shortest-path-with-alternating-colors", "topicTags": [{"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 119953, "totalSubmissionRaw": 254449}, "1130": {"acRate": 67.70949352489538, "difficulty": "Medium", "likes": 4283, "dislikes": 275, "categoryTitle": "Algorithms", "frontendQuestionId": "1130", "paidOnly": false, "title": "Minimum Cost Tree From Leaf Values", "titleSlug": "minimum-cost-tree-from-leaf-values", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 102739, "totalSubmissionRaw": 151735}, "1131": {"acRate": 48.51162158488515, "difficulty": "Medium", "likes": 646, "dislikes": 406, "categoryTitle": "Algorithms", "frontendQuestionId": "1131", "paidOnly": false, "title": "Maximum of Absolute Value Expression", "titleSlug": "maximum-of-absolute-value-expression", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24983, "totalSubmissionRaw": 51499}, "1132": {"acRate": 32.24888439841711, "difficulty": "Medium", "likes": 154, "dislikes": 566, "categoryTitle": "Database", "frontendQuestionId": "1132", "paidOnly": true, "title": "Reported Posts II", "titleSlug": "reported-posts-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 38302, "totalSubmissionRaw": 118769}, "1133": {"acRate": 69.1842994541201, "difficulty": "Easy", "likes": 319, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "1133", "paidOnly": true, "title": "Largest Unique Number", "titleSlug": "largest-unique-number", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 66536, "totalSubmissionRaw": 96173}, "1134": {"acRate": 77.78908034046087, "difficulty": "Easy", "likes": 208, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "1134", "paidOnly": true, "title": "Armstrong Number", "titleSlug": "armstrong-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 37471, "totalSubmissionRaw": 48170}, "1135": {"acRate": 62.09980354926474, "difficulty": "Medium", "likes": 1120, "dislikes": 59, "categoryTitle": "Algorithms", "frontendQuestionId": "1135", "paidOnly": true, "title": "Connecting Cities With Minimum Cost", "titleSlug": "connecting-cities-with-minimum-cost", "topicTags": [{"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Minimum Spanning Tree", "id": "VG9waWNUYWdOb2RlOjYxMDgz", "slug": "minimum-spanning-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 75550, "totalSubmissionRaw": 121659}, "1136": {"acRate": 61.47077962534786, "difficulty": "Medium", "likes": 1167, "dislikes": 27, "categoryTitle": "Algorithms", "frontendQuestionId": "1136", "paidOnly": true, "title": "Parallel Courses", "titleSlug": "parallel-courses", "topicTags": [{"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 88797, "totalSubmissionRaw": 144452}, "1137": {"acRate": 63.78024164058158, "difficulty": "Easy", "likes": 4451, "dislikes": 193, "categoryTitle": "Algorithms", "frontendQuestionId": "1137", "paidOnly": false, "title": "N-th Tribonacci Number", "titleSlug": "n-th-tribonacci-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 806672, "totalSubmissionRaw": 1264769}, "1138": {"acRate": 51.67934938165596, "difficulty": "Medium", "likes": 904, "dislikes": 179, "categoryTitle": "Algorithms", "frontendQuestionId": "1138", "paidOnly": false, "title": "Alphabet Board Path", "titleSlug": "alphabet-board-path", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 52361, "totalSubmissionRaw": 101319}, "1139": {"acRate": 50.2833771545428, "difficulty": "Medium", "likes": 710, "dislikes": 112, "categoryTitle": "Algorithms", "frontendQuestionId": "1139", "paidOnly": false, "title": "Largest 1-Bordered Square", "titleSlug": "largest-1-bordered-square", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25818, "totalSubmissionRaw": 51345}, "1140": {"acRate": 67.45700867803853, "difficulty": "Medium", "likes": 2842, "dislikes": 626, "categoryTitle": "Algorithms", "frontendQuestionId": "1140", "paidOnly": false, "title": "Stone Game II", "titleSlug": "stone-game-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 97244, "totalSubmissionRaw": 144157}, "1141": {"acRate": 48.76278386540863, "difficulty": "Easy", "likes": 686, "dislikes": 808, "categoryTitle": "Database", "frontendQuestionId": "1141", "paidOnly": false, "title": "User Activity for the Past 30 Days I", "titleSlug": "user-activity-for-the-past-30-days-i", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 254938, "totalSubmissionRaw": 522818}, "1142": {"acRate": 35.749092022205126, "difficulty": "Easy", "likes": 99, "dislikes": 369, "categoryTitle": "Database", "frontendQuestionId": "1142", "paidOnly": true, "title": "User Activity for the Past 30 Days II", "titleSlug": "user-activity-for-the-past-30-days-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 43211, "totalSubmissionRaw": 120873}, "1143": {"acRate": 57.73959808892863, "difficulty": "Medium", "likes": 13590, "dislikes": 197, "categoryTitle": "Algorithms", "frontendQuestionId": "1143", "paidOnly": false, "title": "Longest Common Subsequence", "titleSlug": "longest-common-subsequence", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1174313, "totalSubmissionRaw": 2033810}, "1144": {"acRate": 48.02213568354171, "difficulty": "Medium", "likes": 435, "dislikes": 168, "categoryTitle": "Algorithms", "frontendQuestionId": "1144", "paidOnly": false, "title": "Decrease Elements To Make Array Zigzag", "titleSlug": "decrease-elements-to-make-array-zigzag", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21087, "totalSubmissionRaw": 43911}, "1145": {"acRate": 52.11611442775028, "difficulty": "Medium", "likes": 1353, "dislikes": 212, "categoryTitle": "Algorithms", "frontendQuestionId": "1145", "paidOnly": false, "title": "Binary Tree Coloring Game", "titleSlug": "binary-tree-coloring-game", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 46966, "totalSubmissionRaw": 90118}, "1146": {"acRate": 36.894738240059496, "difficulty": "Medium", "likes": 3714, "dislikes": 502, "categoryTitle": "Algorithms", "frontendQuestionId": "1146", "paidOnly": false, "title": "Snapshot Array", "titleSlug": "snapshot-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 222248, "totalSubmissionRaw": 602384}, "1147": {"acRate": 58.72091658253704, "difficulty": "Hard", "likes": 674, "dislikes": 32, "categoryTitle": "Algorithms", "frontendQuestionId": "1147", "paidOnly": false, "title": "Longest Chunked Palindrome Decomposition", "titleSlug": "longest-chunked-palindrome-decomposition", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25011, "totalSubmissionRaw": 42593}, "1148": {"acRate": 76.14120168631392, "difficulty": "Easy", "likes": 1491, "dislikes": 85, "categoryTitle": "Database", "frontendQuestionId": "1148", "paidOnly": false, "title": "Article Views I", "titleSlug": "article-views-i", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 730386, "totalSubmissionRaw": 959252}, "1149": {"acRate": 47.061514117588885, "difficulty": "Medium", "likes": 130, "dislikes": 27, "categoryTitle": "Database", "frontendQuestionId": "1149", "paidOnly": true, "title": "Article Views II", "titleSlug": "article-views-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 38067, "totalSubmissionRaw": 80885}, "1150": {"acRate": 58.98523039649629, "difficulty": "Easy", "likes": 455, "dislikes": 35, "categoryTitle": "Algorithms", "frontendQuestionId": "1150", "paidOnly": true, "title": "Check If a Number Is Majority Element in a Sorted Array", "titleSlug": "check-if-a-number-is-majority-element-in-a-sorted-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 50640, "totalSubmissionRaw": 85852}, "1151": {"acRate": 60.224171799863115, "difficulty": "Medium", "likes": 1205, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "1151", "paidOnly": true, "title": "Minimum Swaps to Group All 1's Together", "titleSlug": "minimum-swaps-to-group-all-1s-together", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 67754, "totalSubmissionRaw": 112503}, "1152": {"acRate": 42.75257199072916, "difficulty": "Medium", "likes": 495, "dislikes": 3752, "categoryTitle": "Algorithms", "frontendQuestionId": "1152", "paidOnly": true, "title": "Analyze User Website Visit Pattern", "titleSlug": "analyze-user-website-visit-pattern", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 102559, "totalSubmissionRaw": 239891}, "1153": {"acRate": 34.94637649241529, "difficulty": "Hard", "likes": 880, "dislikes": 336, "categoryTitle": "Algorithms", "frontendQuestionId": "1153", "paidOnly": true, "title": "String Transforms Into Another String", "titleSlug": "string-transforms-into-another-string", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 52364, "totalSubmissionRaw": 149840}, "1154": {"acRate": 48.898668264135296, "difficulty": "Easy", "likes": 454, "dislikes": 477, "categoryTitle": "Algorithms", "frontendQuestionId": "1154", "paidOnly": false, "title": "Day of the Year", "titleSlug": "day-of-the-year", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 63669, "totalSubmissionRaw": 130206}, "1155": {"acRate": 61.07667693522581, "difficulty": "Medium", "likes": 5062, "dislikes": 172, "categoryTitle": "Algorithms", "frontendQuestionId": "1155", "paidOnly": false, "title": "Number of Dice Rolls With Target Sum", "titleSlug": "number-of-dice-rolls-with-target-sum", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 297000, "totalSubmissionRaw": 486274}, "1156": {"acRate": 44.04833193607197, "difficulty": "Medium", "likes": 1021, "dislikes": 97, "categoryTitle": "Algorithms", "frontendQuestionId": "1156", "paidOnly": false, "title": "Swap For Longest Repeated Character Substring", "titleSlug": "swap-for-longest-repeated-character-substring", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33101, "totalSubmissionRaw": 75147}, "1157": {"acRate": 41.860069503511625, "difficulty": "Hard", "likes": 633, "dislikes": 61, "categoryTitle": "Algorithms", "frontendQuestionId": "1157", "paidOnly": false, "title": "Online Majority Element In Subarray", "titleSlug": "online-majority-element-in-subarray", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17225, "totalSubmissionRaw": 41149}, "1158": {"acRate": 57.139708313434475, "difficulty": "Medium", "likes": 648, "dislikes": 67, "categoryTitle": "Database", "frontendQuestionId": "1158", "paidOnly": false, "title": "Market Analysis I", "titleSlug": "market-analysis-i", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 108876, "totalSubmissionRaw": 190545}, "1159": {"acRate": 57.088685734442514, "difficulty": "Hard", "likes": 120, "dislikes": 79, "categoryTitle": "Database", "frontendQuestionId": "1159", "paidOnly": true, "title": "Market Analysis II", "titleSlug": "market-analysis-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 19421, "totalSubmissionRaw": 34019}, "1160": {"acRate": 70.65727637519251, "difficulty": "Easy", "likes": 2116, "dislikes": 183, "categoryTitle": "Algorithms", "frontendQuestionId": "1160", "paidOnly": false, "title": "Find Words That Can Be Formed by Characters", "titleSlug": "find-words-that-can-be-formed-by-characters", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 267471, "totalSubmissionRaw": 378547}, "1161": {"acRate": 67.15378137106282, "difficulty": "Medium", "likes": 3539, "dislikes": 98, "categoryTitle": "Algorithms", "frontendQuestionId": "1161", "paidOnly": false, "title": "Maximum Level Sum of a Binary Tree", "titleSlug": "maximum-level-sum-of-a-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 299015, "totalSubmissionRaw": 445269}, "1162": {"acRate": 51.62175542361045, "difficulty": "Medium", "likes": 4137, "dislikes": 111, "categoryTitle": "Algorithms", "frontendQuestionId": "1162", "paidOnly": false, "title": "As Far from Land as Possible", "titleSlug": "as-far-from-land-as-possible", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 157451, "totalSubmissionRaw": 305009}, "1163": {"acRate": 34.567573153807544, "difficulty": "Hard", "likes": 594, "dislikes": 449, "categoryTitle": "Algorithms", "frontendQuestionId": "1163", "paidOnly": false, "title": "Last Substring in Lexicographical Order", "titleSlug": "last-substring-in-lexicographical-order", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 35121, "totalSubmissionRaw": 101601}, "1164": {"acRate": 56.2153660384324, "difficulty": "Medium", "likes": 906, "dislikes": 245, "categoryTitle": "Database", "frontendQuestionId": "1164", "paidOnly": false, "title": "Product Price at a Given Date", "titleSlug": "product-price-at-a-given-date", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 146180, "totalSubmissionRaw": 260038}, "1165": {"acRate": 87.54127495430724, "difficulty": "Easy", "likes": 527, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "1165", "paidOnly": true, "title": "Single-Row Keyboard", "titleSlug": "single-row-keyboard", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 86692, "totalSubmissionRaw": 99030}, "1166": {"acRate": 63.16537415242194, "difficulty": "Medium", "likes": 577, "dislikes": 70, "categoryTitle": "Algorithms", "frontendQuestionId": "1166", "paidOnly": true, "title": "Design File System", "titleSlug": "design-file-system", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 62227, "totalSubmissionRaw": 98515}, "1167": {"acRate": 70.19479794597008, "difficulty": "Medium", "likes": 1313, "dislikes": 156, "categoryTitle": "Algorithms", "frontendQuestionId": "1167", "paidOnly": true, "title": "Minimum Cost to Connect Sticks", "titleSlug": "minimum-cost-to-connect-sticks", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 125761, "totalSubmissionRaw": 179160}, "1168": {"acRate": 64.85251241102151, "difficulty": "Hard", "likes": 1155, "dislikes": 40, "categoryTitle": "Algorithms", "frontendQuestionId": "1168", "paidOnly": true, "title": "Optimize Water Distribution in a Village", "titleSlug": "optimize-water-distribution-in-a-village", "topicTags": [{"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Minimum Spanning Tree", "id": "VG9waWNUYWdOb2RlOjYxMDgz", "slug": "minimum-spanning-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 49380, "totalSubmissionRaw": 76142}, "1169": {"acRate": 31.128280949428465, "difficulty": "Medium", "likes": 548, "dislikes": 2325, "categoryTitle": "Algorithms", "frontendQuestionId": "1169", "paidOnly": false, "title": "Invalid Transactions", "titleSlug": "invalid-transactions", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 78320, "totalSubmissionRaw": 251603}, "1170": {"acRate": 62.40393086059722, "difficulty": "Medium", "likes": 708, "dislikes": 975, "categoryTitle": "Algorithms", "frontendQuestionId": "1170", "paidOnly": false, "title": "Compare Strings by Frequency of the Smallest Character", "titleSlug": "compare-strings-by-frequency-of-the-smallest-character", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 82171, "totalSubmissionRaw": 131676}, "1171": {"acRate": 52.7523701796894, "difficulty": "Medium", "likes": 3307, "dislikes": 215, "categoryTitle": "Algorithms", "frontendQuestionId": "1171", "paidOnly": false, "title": "Remove Zero Sum Consecutive Nodes from Linked List", "titleSlug": "remove-zero-sum-consecutive-nodes-from-linked-list", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 167426, "totalSubmissionRaw": 317381}, "1172": {"acRate": 32.75272215758123, "difficulty": "Hard", "likes": 483, "dislikes": 64, "categoryTitle": "Algorithms", "frontendQuestionId": "1172", "paidOnly": false, "title": "Dinner Plate Stacks", "titleSlug": "dinner-plate-stacks", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18860, "totalSubmissionRaw": 57583}, "1173": {"acRate": 80.93546852703345, "difficulty": "Easy", "likes": 292, "dislikes": 13, "categoryTitle": "Database", "frontendQuestionId": "1173", "paidOnly": true, "title": "Immediate Food Delivery I", "titleSlug": "immediate-food-delivery-i", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 76569, "totalSubmissionRaw": 94605}, "1174": {"acRate": 52.083867935680495, "difficulty": "Medium", "likes": 735, "dislikes": 130, "categoryTitle": "Database", "frontendQuestionId": "1174", "paidOnly": false, "title": "Immediate Food Delivery II", "titleSlug": "immediate-food-delivery-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 180639, "totalSubmissionRaw": 346824}, "1175": {"acRate": 57.83143264433357, "difficulty": "Easy", "likes": 406, "dislikes": 522, "categoryTitle": "Algorithms", "frontendQuestionId": "1175", "paidOnly": false, "title": "Prime Arrangements", "titleSlug": "prime-arrangements", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 32455, "totalSubmissionRaw": 56120}, "1176": {"acRate": 53.525682494501226, "difficulty": "Easy", "likes": 154, "dislikes": 289, "categoryTitle": "Algorithms", "frontendQuestionId": "1176", "paidOnly": true, "title": "Diet Plan Performance", "titleSlug": "diet-plan-performance", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33096, "totalSubmissionRaw": 61832}, "1177": {"acRate": 39.289141102612604, "difficulty": "Medium", "likes": 805, "dislikes": 277, "categoryTitle": "Algorithms", "frontendQuestionId": "1177", "paidOnly": false, "title": "Can Make Palindrome from Substring", "titleSlug": "can-make-palindrome-from-substring", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28663, "totalSubmissionRaw": 72954}, "1178": {"acRate": 46.79746534182186, "difficulty": "Hard", "likes": 1270, "dislikes": 87, "categoryTitle": "Algorithms", "frontendQuestionId": "1178", "paidOnly": false, "title": "Number of Valid Words for Each Puzzle", "titleSlug": "number-of-valid-words-for-each-puzzle", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 31461, "totalSubmissionRaw": 67228}, "1179": {"acRate": 76.93477536810221, "difficulty": "Easy", "likes": 740, "dislikes": 605, "categoryTitle": "Database", "frontendQuestionId": "1179", "paidOnly": false, "title": "Reformat Department Table", "titleSlug": "reformat-department-table", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 122424, "totalSubmissionRaw": 159127}, "1180": {"acRate": 80.02409845941992, "difficulty": "Easy", "likes": 355, "dislikes": 50, "categoryTitle": "Algorithms", "frontendQuestionId": "1180", "paidOnly": true, "title": "Count Substrings with Only One Distinct Letter", "titleSlug": "count-substrings-with-only-one-distinct-letter", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 27894, "totalSubmissionRaw": 34857}, "1181": {"acRate": 45.96804688977122, "difficulty": "Medium", "likes": 74, "dislikes": 154, "categoryTitle": "Algorithms", "frontendQuestionId": "1181", "paidOnly": true, "title": "Before and After Puzzle", "titleSlug": "before-and-after-puzzle", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9725, "totalSubmissionRaw": 21156}, "1182": {"acRate": 55.413033113397624, "difficulty": "Medium", "likes": 516, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "1182", "paidOnly": true, "title": "Shortest Distance to Target Color", "titleSlug": "shortest-distance-to-target-color", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 36029, "totalSubmissionRaw": 65019}, "1183": {"acRate": 68.20319849482597, "difficulty": "Hard", "likes": 164, "dislikes": 28, "categoryTitle": "Algorithms", "frontendQuestionId": "1183", "paidOnly": true, "title": "Maximum Number of Ones", "titleSlug": "maximum-number-of-ones", "topicTags": [{"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5075, "totalSubmissionRaw": 7441}, "1184": {"acRate": 54.12466820492357, "difficulty": "Easy", "likes": 759, "dislikes": 88, "categoryTitle": "Algorithms", "frontendQuestionId": "1184", "paidOnly": false, "title": "Distance Between Bus Stops", "titleSlug": "distance-between-bus-stops", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 62396, "totalSubmissionRaw": 115282}, "1185": {"acRate": 57.73874679345238, "difficulty": "Easy", "likes": 403, "dislikes": 2453, "categoryTitle": "Algorithms", "frontendQuestionId": "1185", "paidOnly": false, "title": "Day of the Week", "titleSlug": "day-of-the-week", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 69100, "totalSubmissionRaw": 119677}, "1186": {"acRate": 44.18058051870949, "difficulty": "Medium", "likes": 1823, "dislikes": 66, "categoryTitle": "Algorithms", "frontendQuestionId": "1186", "paidOnly": false, "title": "Maximum Subarray Sum with One Deletion", "titleSlug": "maximum-subarray-sum-with-one-deletion", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 54324, "totalSubmissionRaw": 122959}, "1187": {"acRate": 58.156912814117604, "difficulty": "Hard", "likes": 2235, "dislikes": 50, "categoryTitle": "Algorithms", "frontendQuestionId": "1187", "paidOnly": false, "title": "Make Array Strictly Increasing", "titleSlug": "make-array-strictly-increasing", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 58760, "totalSubmissionRaw": 101037}, "1188": {"acRate": 72.42448151487827, "difficulty": "Medium", "likes": 520, "dislikes": 41, "categoryTitle": "Concurrency", "frontendQuestionId": "1188", "paidOnly": true, "title": "Design Bounded Blocking Queue", "titleSlug": "design-bounded-blocking-queue", "topicTags": [{"name": "Concurrency", "id": "VG9waWNUYWdOb2RlOjYxMDQ1", "slug": "concurrency"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 51404, "totalSubmissionRaw": 70976}, "1189": {"acRate": 59.71363622619934, "difficulty": "Easy", "likes": 1704, "dislikes": 105, "categoryTitle": "Algorithms", "frontendQuestionId": "1189", "paidOnly": false, "title": "Maximum Number of Balloons", "titleSlug": "maximum-number-of-balloons", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 217239, "totalSubmissionRaw": 363801}, "1190": {"acRate": 71.70602189240675, "difficulty": "Medium", "likes": 2810, "dislikes": 117, "categoryTitle": "Algorithms", "frontendQuestionId": "1190", "paidOnly": false, "title": "Reverse Substrings Between Each Pair of Parentheses", "titleSlug": "reverse-substrings-between-each-pair-of-parentheses", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 217944, "totalSubmissionRaw": 303941}, "1191": {"acRate": 23.86146876490224, "difficulty": "Medium", "likes": 1446, "dislikes": 118, "categoryTitle": "Algorithms", "frontendQuestionId": "1191", "paidOnly": false, "title": "K-Concatenation Maximum Sum", "titleSlug": "k-concatenation-maximum-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 36027, "totalSubmissionRaw": 150984}, "1192": {"acRate": 56.36292003338353, "difficulty": "Hard", "likes": 6216, "dislikes": 184, "categoryTitle": "Algorithms", "frontendQuestionId": "1192", "paidOnly": false, "title": "Critical Connections in a Network", "titleSlug": "critical-connections-in-a-network", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Biconnected Component", "id": "VG9waWNUYWdOb2RlOjYxMDg0", "slug": "biconnected-component"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 241771, "totalSubmissionRaw": 428954}, "1193": {"acRate": 57.96120208157372, "difficulty": "Medium", "likes": 827, "dislikes": 82, "categoryTitle": "Database", "frontendQuestionId": "1193", "paidOnly": false, "title": "Monthly Transactions I", "titleSlug": "monthly-transactions-i", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 212732, "totalSubmissionRaw": 367024}, "1194": {"acRate": 49.14158615416696, "difficulty": "Hard", "likes": 149, "dislikes": 56, "categoryTitle": "Database", "frontendQuestionId": "1194", "paidOnly": true, "title": "Tournament Winners", "titleSlug": "tournament-winners", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 21210, "totalSubmissionRaw": 43161}, "1195": {"acRate": 72.76635861103571, "difficulty": "Medium", "likes": 605, "dislikes": 408, "categoryTitle": "Concurrency", "frontendQuestionId": "1195", "paidOnly": false, "title": "Fizz Buzz Multithreaded", "titleSlug": "fizz-buzz-multithreaded", "topicTags": [{"name": "Concurrency", "id": "VG9waWNUYWdOb2RlOjYxMDQ1", "slug": "concurrency"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 50943, "totalSubmissionRaw": 70009}, "1196": {"acRate": 67.03370950659216, "difficulty": "Easy", "likes": 221, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "1196", "paidOnly": true, "title": "How Many Apples Can You Put into the Basket", "titleSlug": "how-many-apples-can-you-put-into-the-basket", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 36709, "totalSubmissionRaw": 54762}, "1197": {"acRate": 40.667321002659726, "difficulty": "Medium", "likes": 1513, "dislikes": 406, "categoryTitle": "Algorithms", "frontendQuestionId": "1197", "paidOnly": true, "title": "Minimum Knight Moves", "titleSlug": "minimum-knight-moves", "topicTags": [{"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 159933, "totalSubmissionRaw": 393273}, "1198": {"acRate": 76.49610005379236, "difficulty": "Medium", "likes": 574, "dislikes": 30, "categoryTitle": "Algorithms", "frontendQuestionId": "1198", "paidOnly": true, "title": "Find Smallest Common Element in All Rows", "titleSlug": "find-smallest-common-element-in-all-rows", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 45506, "totalSubmissionRaw": 59488}, "1199": {"acRate": 45.75262866629773, "difficulty": "Hard", "likes": 235, "dislikes": 30, "categoryTitle": "Algorithms", "frontendQuestionId": "1199", "paidOnly": true, "title": "Minimum Time to Build Blocks", "titleSlug": "minimum-time-to-build-blocks", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 6614, "totalSubmissionRaw": 14456}, "1200": {"acRate": 69.69141587698289, "difficulty": "Easy", "likes": 2353, "dislikes": 75, "categoryTitle": "Algorithms", "frontendQuestionId": "1200", "paidOnly": false, "title": "Minimum Absolute Difference", "titleSlug": "minimum-absolute-difference", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 200774, "totalSubmissionRaw": 288090}, "1201": {"acRate": 29.75333190025795, "difficulty": "Medium", "likes": 1220, "dislikes": 499, "categoryTitle": "Algorithms", "frontendQuestionId": "1201", "paidOnly": false, "title": "Ugly Number III", "titleSlug": "ugly-number-iii", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33219, "totalSubmissionRaw": 111648}, "1202": {"acRate": 58.52314911056335, "difficulty": "Medium", "likes": 3699, "dislikes": 141, "categoryTitle": "Algorithms", "frontendQuestionId": "1202", "paidOnly": false, "title": "Smallest String With Swaps", "titleSlug": "smallest-string-with-swaps", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 118237, "totalSubmissionRaw": 202036}, "1203": {"acRate": 66.24631392198701, "difficulty": "Hard", "likes": 1772, "dislikes": 298, "categoryTitle": "Algorithms", "frontendQuestionId": "1203", "paidOnly": false, "title": "Sort Items by Groups Respecting Dependencies", "titleSlug": "sort-items-by-groups-respecting-dependencies", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 55264, "totalSubmissionRaw": 83422}, "1204": {"acRate": 67.40785322343271, "difficulty": "Medium", "likes": 722, "dislikes": 33, "categoryTitle": "Database", "frontendQuestionId": "1204", "paidOnly": false, "title": "Last Person to Fit in the Bus", "titleSlug": "last-person-to-fit-in-the-bus", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 143361, "totalSubmissionRaw": 212677}, "1205": {"acRate": 41.709899417681314, "difficulty": "Medium", "likes": 156, "dislikes": 546, "categoryTitle": "Database", "frontendQuestionId": "1205", "paidOnly": true, "title": "Monthly Transactions II", "titleSlug": "monthly-transactions-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 23637, "totalSubmissionRaw": 56670}, "1206": {"acRate": 61.783633139092984, "difficulty": "Hard", "likes": 667, "dislikes": 92, "categoryTitle": "Algorithms", "frontendQuestionId": "1206", "paidOnly": false, "title": "Design Skiplist", "titleSlug": "design-skiplist", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24386, "totalSubmissionRaw": 39470}, "1207": {"acRate": 77.39705454067852, "difficulty": "Easy", "likes": 5091, "dislikes": 137, "categoryTitle": "Algorithms", "frontendQuestionId": "1207", "paidOnly": false, "title": "Unique Number of Occurrences", "titleSlug": "unique-number-of-occurrences", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 677667, "totalSubmissionRaw": 875575}, "1208": {"acRate": 58.32103966556414, "difficulty": "Medium", "likes": 1794, "dislikes": 137, "categoryTitle": "Algorithms", "frontendQuestionId": "1208", "paidOnly": false, "title": "Get Equal Substrings Within Budget", "titleSlug": "get-equal-substrings-within-budget", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 161691, "totalSubmissionRaw": 277242}, "1209": {"acRate": 58.18458597373173, "difficulty": "Medium", "likes": 5783, "dislikes": 115, "categoryTitle": "Algorithms", "frontendQuestionId": "1209", "paidOnly": false, "title": "Remove All Adjacent Duplicates in String II", "titleSlug": "remove-all-adjacent-duplicates-in-string-ii", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 328702, "totalSubmissionRaw": 564934}, "1210": {"acRate": 49.89180212369785, "difficulty": "Hard", "likes": 270, "dislikes": 72, "categoryTitle": "Algorithms", "frontendQuestionId": "1210", "paidOnly": false, "title": "Minimum Moves to Reach Target with Rotations", "titleSlug": "minimum-moves-to-reach-target-with-rotations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9914, "totalSubmissionRaw": 19871}, "1211": {"acRate": 45.178298403342374, "difficulty": "Easy", "likes": 637, "dislikes": 420, "categoryTitle": "Database", "frontendQuestionId": "1211", "paidOnly": false, "title": "Queries Quality and Percentage", "titleSlug": "queries-quality-and-percentage", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 212155, "totalSubmissionRaw": 469598}, "1212": {"acRate": 55.7363060831269, "difficulty": "Medium", "likes": 309, "dislikes": 25, "categoryTitle": "Database", "frontendQuestionId": "1212", "paidOnly": true, "title": "Team Scores in Football Tournament", "titleSlug": "team-scores-in-football-tournament", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 40498, "totalSubmissionRaw": 72660}, "1213": {"acRate": 79.8051396890181, "difficulty": "Easy", "likes": 583, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "1213", "paidOnly": true, "title": "Intersection of Three Sorted Arrays", "titleSlug": "intersection-of-three-sorted-arrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 88381, "totalSubmissionRaw": 110746}, "1214": {"acRate": 67.25956538768013, "difficulty": "Medium", "likes": 547, "dislikes": 46, "categoryTitle": "Algorithms", "frontendQuestionId": "1214", "paidOnly": true, "title": "Two Sum BSTs", "titleSlug": "two-sum-bsts", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 49801, "totalSubmissionRaw": 74043}, "1215": {"acRate": 47.30368037787837, "difficulty": "Medium", "likes": 183, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "1215", "paidOnly": true, "title": "Stepping Numbers", "titleSlug": "stepping-numbers", "topicTags": [{"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9614, "totalSubmissionRaw": 20324}, "1216": {"acRate": 49.266579671925065, "difficulty": "Hard", "likes": 769, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "1216", "paidOnly": true, "title": "Valid Palindrome III", "titleSlug": "valid-palindrome-iii", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 72111, "totalSubmissionRaw": 146369}, "1217": {"acRate": 71.80080878354002, "difficulty": "Easy", "likes": 2306, "dislikes": 314, "categoryTitle": "Algorithms", "frontendQuestionId": "1217", "paidOnly": false, "title": "Minimum Cost to Move Chips to The Same Position", "titleSlug": "minimum-cost-to-move-chips-to-the-same-position", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 133342, "totalSubmissionRaw": 185711}, "1218": {"acRate": 54.67489656814597, "difficulty": "Medium", "likes": 3216, "dislikes": 89, "categoryTitle": "Algorithms", "frontendQuestionId": "1218", "paidOnly": false, "title": "Longest Arithmetic Subsequence of Given Difference", "titleSlug": "longest-arithmetic-subsequence-of-given-difference", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 146953, "totalSubmissionRaw": 268776}, "1219": {"acRate": 68.02910734575528, "difficulty": "Medium", "likes": 3290, "dislikes": 97, "categoryTitle": "Algorithms", "frontendQuestionId": "1219", "paidOnly": false, "title": "Path with Maximum Gold", "titleSlug": "path-with-maximum-gold", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 219134, "totalSubmissionRaw": 322118}, "1220": {"acRate": 61.80979860728603, "difficulty": "Hard", "likes": 3253, "dislikes": 216, "categoryTitle": "Algorithms", "frontendQuestionId": "1220", "paidOnly": false, "title": "Count Vowels Permutation", "titleSlug": "count-vowels-permutation", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 169446, "totalSubmissionRaw": 274141}, "1221": {"acRate": 86.33493870283603, "difficulty": "Easy", "likes": 2749, "dislikes": 940, "categoryTitle": "Algorithms", "frontendQuestionId": "1221", "paidOnly": false, "title": "Split a String in Balanced Strings", "titleSlug": "split-a-string-in-balanced-strings", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 317116, "totalSubmissionRaw": 367309}, "1222": {"acRate": 71.98967512823884, "difficulty": "Medium", "likes": 945, "dislikes": 150, "categoryTitle": "Algorithms", "frontendQuestionId": "1222", "paidOnly": false, "title": "Queens That Can Attack the King", "titleSlug": "queens-that-can-attack-the-king", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 43787, "totalSubmissionRaw": 60824}, "1223": {"acRate": 49.38650802631791, "difficulty": "Hard", "likes": 932, "dislikes": 190, "categoryTitle": "Algorithms", "frontendQuestionId": "1223", "paidOnly": false, "title": "Dice Roll Simulation", "titleSlug": "dice-roll-simulation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30550, "totalSubmissionRaw": 61859}, "1224": {"acRate": 37.23965167601098, "difficulty": "Hard", "likes": 540, "dislikes": 66, "categoryTitle": "Algorithms", "frontendQuestionId": "1224", "paidOnly": false, "title": "Maximum Equal Frequency", "titleSlug": "maximum-equal-frequency", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15609, "totalSubmissionRaw": 41915}, "1225": {"acRate": 57.45963401506997, "difficulty": "Hard", "likes": 322, "dislikes": 23, "categoryTitle": "Database", "frontendQuestionId": "1225", "paidOnly": true, "title": "Report Contiguous Dates", "titleSlug": "report-contiguous-dates", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24021, "totalSubmissionRaw": 41805}, "1226": {"acRate": 54.03032721468476, "difficulty": "Medium", "likes": 354, "dislikes": 332, "categoryTitle": "Concurrency", "frontendQuestionId": "1226", "paidOnly": false, "title": "The Dining Philosophers", "titleSlug": "the-dining-philosophers", "topicTags": [{"name": "Concurrency", "id": "VG9waWNUYWdOb2RlOjYxMDQ1", "slug": "concurrency"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 35204, "totalSubmissionRaw": 65156}, "1227": {"acRate": 66.53433117337471, "difficulty": "Medium", "likes": 617, "dislikes": 973, "categoryTitle": "Algorithms", "frontendQuestionId": "1227", "paidOnly": false, "title": "Airplane Seat Assignment Probability", "titleSlug": "airplane-seat-assignment-probability", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Brainteaser", "id": "VG9waWNUYWdOb2RlOjMy", "slug": "brainteaser"}, {"name": "Probability and Statistics", "id": "VG9waWNUYWdOb2RlOjYxMDc5", "slug": "probability-and-statistics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 43741, "totalSubmissionRaw": 65742}, "1228": {"acRate": 51.957581075782755, "difficulty": "Easy", "likes": 314, "dislikes": 43, "categoryTitle": "Algorithms", "frontendQuestionId": "1228", "paidOnly": true, "title": "Missing Number In Arithmetic Progression", "titleSlug": "missing-number-in-arithmetic-progression", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 27829, "totalSubmissionRaw": 53561}, "1229": {"acRate": 55.00041652782406, "difficulty": "Medium", "likes": 885, "dislikes": 33, "categoryTitle": "Algorithms", "frontendQuestionId": "1229", "paidOnly": true, "title": "Meeting Scheduler", "titleSlug": "meeting-scheduler", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 79226, "totalSubmissionRaw": 144035}, "1230": {"acRate": 58.16991666437471, "difficulty": "Medium", "likes": 400, "dislikes": 52, "categoryTitle": "Algorithms", "frontendQuestionId": "1230", "paidOnly": true, "title": "Toss Strange Coins", "titleSlug": "toss-strange-coins", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Probability and Statistics", "id": "VG9waWNUYWdOb2RlOjYxMDc5", "slug": "probability-and-statistics"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 21150, "totalSubmissionRaw": 36359}, "1231": {"acRate": 58.85622180588845, "difficulty": "Hard", "likes": 988, "dislikes": 62, "categoryTitle": "Algorithms", "frontendQuestionId": "1231", "paidOnly": true, "title": "Divide Chocolate", "titleSlug": "divide-chocolate", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 56233, "totalSubmissionRaw": 95543}, "1232": {"acRate": 39.51275700336523, "difficulty": "Easy", "likes": 2603, "dislikes": 278, "categoryTitle": "Algorithms", "frontendQuestionId": "1232", "paidOnly": false, "title": "Check If It Is a Straight Line", "titleSlug": "check-if-it-is-a-straight-line", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 262422, "totalSubmissionRaw": 664145}, "1233": {"acRate": 66.03897445872184, "difficulty": "Medium", "likes": 813, "dislikes": 115, "categoryTitle": "Algorithms", "frontendQuestionId": "1233", "paidOnly": false, "title": "Remove Sub-Folders from the Filesystem", "titleSlug": "remove-sub-folders-from-the-filesystem", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 54323, "totalSubmissionRaw": 82259}, "1234": {"acRate": 38.572187354340784, "difficulty": "Medium", "likes": 1195, "dislikes": 216, "categoryTitle": "Algorithms", "frontendQuestionId": "1234", "paidOnly": false, "title": "Replace the Substring for Balanced String", "titleSlug": "replace-the-substring-for-balanced-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 35584, "totalSubmissionRaw": 92253}, "1235": {"acRate": 54.34418439279878, "difficulty": "Hard", "likes": 6813, "dislikes": 108, "categoryTitle": "Algorithms", "frontendQuestionId": "1235", "paidOnly": false, "title": "Maximum Profit in Job Scheduling", "titleSlug": "maximum-profit-in-job-scheduling", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 317918, "totalSubmissionRaw": 585010}, "1236": {"acRate": 67.9744844459979, "difficulty": "Medium", "likes": 288, "dislikes": 326, "categoryTitle": "Algorithms", "frontendQuestionId": "1236", "paidOnly": true, "title": "Web Crawler", "titleSlug": "web-crawler", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 38895, "totalSubmissionRaw": 57220}, "1237": {"acRate": 69.67448780585882, "difficulty": "Medium", "likes": 517, "dislikes": 1427, "categoryTitle": "Algorithms", "frontendQuestionId": "1237", "paidOnly": false, "title": "Find Positive Integer Solution for a Given Equation", "titleSlug": "find-positive-integer-solution-for-a-given-equation", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 69308, "totalSubmissionRaw": 99474}, "1238": {"acRate": 70.4068957729514, "difficulty": "Medium", "likes": 421, "dislikes": 191, "categoryTitle": "Algorithms", "frontendQuestionId": "1238", "paidOnly": false, "title": "Circular Permutation in Binary Representation", "titleSlug": "circular-permutation-in-binary-representation", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18705, "totalSubmissionRaw": 26567}, "1239": {"acRate": 54.10845155526559, "difficulty": "Medium", "likes": 4426, "dislikes": 331, "categoryTitle": "Algorithms", "frontendQuestionId": "1239", "paidOnly": false, "title": "Maximum Length of a Concatenated String with Unique Characters", "titleSlug": "maximum-length-of-a-concatenated-string-with-unique-characters", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 291927, "totalSubmissionRaw": 539522}, "1240": {"acRate": 54.3432251091998, "difficulty": "Hard", "likes": 687, "dislikes": 568, "categoryTitle": "Algorithms", "frontendQuestionId": "1240", "paidOnly": false, "title": "Tiling a Rectangle with the Fewest Squares", "titleSlug": "tiling-a-rectangle-with-the-fewest-squares", "topicTags": [{"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24136, "totalSubmissionRaw": 44414}, "1241": {"acRate": 65.91004547031648, "difficulty": "Easy", "likes": 177, "dislikes": 536, "categoryTitle": "Database", "frontendQuestionId": "1241", "paidOnly": true, "title": "Number of Comments per Post", "titleSlug": "number-of-comments-per-post", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 36093, "totalSubmissionRaw": 54761}, "1242": {"acRate": 49.395670995671, "difficulty": "Medium", "likes": 534, "dislikes": 90, "categoryTitle": "Concurrency", "frontendQuestionId": "1242", "paidOnly": true, "title": "Web Crawler Multithreaded", "titleSlug": "web-crawler-multithreaded", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Concurrency", "id": "VG9waWNUYWdOb2RlOjYxMDQ1", "slug": "concurrency"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 57052, "totalSubmissionRaw": 115500}, "1243": {"acRate": 52.386939459747786, "difficulty": "Easy", "likes": 152, "dislikes": 72, "categoryTitle": "Algorithms", "frontendQuestionId": "1243", "paidOnly": true, "title": "Array Transformation", "titleSlug": "array-transformation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13750, "totalSubmissionRaw": 26247}, "1244": {"acRate": 67.8961452231142, "difficulty": "Medium", "likes": 773, "dislikes": 95, "categoryTitle": "Algorithms", "frontendQuestionId": "1244", "paidOnly": true, "title": "Design A Leaderboard", "titleSlug": "design-a-leaderboard", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 75102, "totalSubmissionRaw": 110614}, "1245": {"acRate": 61.19510631477721, "difficulty": "Medium", "likes": 855, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "1245", "paidOnly": true, "title": "Tree Diameter", "titleSlug": "tree-diameter", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 45818, "totalSubmissionRaw": 74872}, "1246": {"acRate": 46.37977269825054, "difficulty": "Hard", "likes": 310, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "1246", "paidOnly": true, "title": "Palindrome Removal", "titleSlug": "palindrome-removal", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10896, "totalSubmissionRaw": 23493}, "1247": {"acRate": 64.41890685913795, "difficulty": "Medium", "likes": 1383, "dislikes": 243, "categoryTitle": "Algorithms", "frontendQuestionId": "1247", "paidOnly": false, "title": "Minimum Swaps to Make Strings Equal", "titleSlug": "minimum-swaps-to-make-strings-equal", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 41145, "totalSubmissionRaw": 63871}, "1248": {"acRate": 71.36748035106802, "difficulty": "Medium", "likes": 4574, "dislikes": 116, "categoryTitle": "Algorithms", "frontendQuestionId": "1248", "paidOnly": false, "title": "Count Number of Nice Subarrays", "titleSlug": "count-number-of-nice-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 267685, "totalSubmissionRaw": 375081}, "1249": {"acRate": 69.17474055346176, "difficulty": "Medium", "likes": 6894, "dislikes": 146, "categoryTitle": "Algorithms", "frontendQuestionId": "1249", "paidOnly": false, "title": "Minimum Remove to Make Valid Parentheses", "titleSlug": "minimum-remove-to-make-valid-parentheses", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 762812, "totalSubmissionRaw": 1102732}, "1250": {"acRate": 59.83572493705233, "difficulty": "Hard", "likes": 514, "dislikes": 378, "categoryTitle": "Algorithms", "frontendQuestionId": "1250", "paidOnly": false, "title": "Check If It Is a Good Array", "titleSlug": "check-if-it-is-a-good-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24477, "totalSubmissionRaw": 40907}, "1251": {"acRate": 37.7493411564449, "difficulty": "Easy", "likes": 1204, "dislikes": 167, "categoryTitle": "Database", "frontendQuestionId": "1251", "paidOnly": false, "title": "Average Selling Price", "titleSlug": "average-selling-price", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 275877, "totalSubmissionRaw": 730812}, "1252": {"acRate": 78.78891389380057, "difficulty": "Easy", "likes": 1222, "dislikes": 1523, "categoryTitle": "Algorithms", "frontendQuestionId": "1252", "paidOnly": false, "title": "Cells with Odd Values in a Matrix", "titleSlug": "cells-with-odd-values-in-a-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 117634, "totalSubmissionRaw": 149303}, "1253": {"acRate": 46.77947149458175, "difficulty": "Medium", "likes": 463, "dislikes": 34, "categoryTitle": "Algorithms", "frontendQuestionId": "1253", "paidOnly": false, "title": "Reconstruct a 2-Row Binary Matrix", "titleSlug": "reconstruct-a-2-row-binary-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28448, "totalSubmissionRaw": 60813}, "1254": {"acRate": 66.42717893045449, "difficulty": "Medium", "likes": 4547, "dislikes": 165, "categoryTitle": "Algorithms", "frontendQuestionId": "1254", "paidOnly": false, "title": "Number of Closed Islands", "titleSlug": "number-of-closed-islands", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 230680, "totalSubmissionRaw": 347267}, "1255": {"acRate": 82.09077607108271, "difficulty": "Hard", "likes": 1742, "dislikes": 110, "categoryTitle": "Algorithms", "frontendQuestionId": "1255", "paidOnly": false, "title": "Maximum Score Words Formed by Letters", "titleSlug": "maximum-score-words-formed-by-letters", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 116132, "totalSubmissionRaw": 141468}, "1256": {"acRate": 69.81585268214572, "difficulty": "Medium", "likes": 78, "dislikes": 253, "categoryTitle": "Algorithms", "frontendQuestionId": "1256", "paidOnly": true, "title": "Encode Number", "titleSlug": "encode-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7848, "totalSubmissionRaw": 11241}, "1257": {"acRate": 65.93120496502392, "difficulty": "Medium", "likes": 437, "dislikes": 36, "categoryTitle": "Algorithms", "frontendQuestionId": "1257", "paidOnly": true, "title": "Smallest Common Region", "titleSlug": "smallest-common-region", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25071, "totalSubmissionRaw": 38026}, "1258": {"acRate": 56.3676127760821, "difficulty": "Medium", "likes": 354, "dislikes": 162, "categoryTitle": "Algorithms", "frontendQuestionId": "1258", "paidOnly": true, "title": "Synonymous Sentences", "titleSlug": "synonymous-sentences", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23454, "totalSubmissionRaw": 41609}, "1259": {"acRate": 59.60348211140744, "difficulty": "Hard", "likes": 232, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "1259", "paidOnly": true, "title": "Handshakes That Don't Cross", "titleSlug": "handshakes-that-dont-cross", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 11845, "totalSubmissionRaw": 19873}, "1260": {"acRate": 67.43105878554175, "difficulty": "Easy", "likes": 1728, "dislikes": 343, "categoryTitle": "Algorithms", "frontendQuestionId": "1260", "paidOnly": false, "title": "Shift 2D Grid", "titleSlug": "shift-2d-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 108593, "totalSubmissionRaw": 161043}, "1261": {"acRate": 77.51077962941382, "difficulty": "Medium", "likes": 994, "dislikes": 94, "categoryTitle": "Algorithms", "frontendQuestionId": "1261", "paidOnly": false, "title": "Find Elements in a Contaminated Binary Tree", "titleSlug": "find-elements-in-a-contaminated-binary-tree", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 66510, "totalSubmissionRaw": 85808}, "1262": {"acRate": 50.599333286048655, "difficulty": "Medium", "likes": 1815, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "1262", "paidOnly": false, "title": "Greatest Sum Divisible by Three", "titleSlug": "greatest-sum-divisible-by-three", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 57072, "totalSubmissionRaw": 112792}, "1263": {"acRate": 49.07721734934776, "difficulty": "Hard", "likes": 849, "dislikes": 57, "categoryTitle": "Algorithms", "frontendQuestionId": "1263", "paidOnly": false, "title": "Minimum Moves to Move a Box to Their Target Location", "titleSlug": "minimum-moves-to-move-a-box-to-their-target-location", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28480, "totalSubmissionRaw": 58031}, "1264": {"acRate": 65.19726459758022, "difficulty": "Medium", "likes": 249, "dislikes": 22, "categoryTitle": "Database", "frontendQuestionId": "1264", "paidOnly": true, "title": "Page Recommendations", "titleSlug": "page-recommendations", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 43379, "totalSubmissionRaw": 66535}, "1265": {"acRate": 94.04924760601915, "difficulty": "Medium", "likes": 579, "dislikes": 103, "categoryTitle": "Algorithms", "frontendQuestionId": "1265", "paidOnly": true, "title": "Print Immutable Linked List in Reverse", "titleSlug": "print-immutable-linked-list-in-reverse", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 59125, "totalSubmissionRaw": 62866}, "1266": {"acRate": 82.46809820888107, "difficulty": "Easy", "likes": 2201, "dislikes": 228, "categoryTitle": "Algorithms", "frontendQuestionId": "1266", "paidOnly": false, "title": "Minimum Time Visiting All Points", "titleSlug": "minimum-time-visiting-all-points", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 235693, "totalSubmissionRaw": 285799}, "1267": {"acRate": 60.61711415415895, "difficulty": "Medium", "likes": 1301, "dislikes": 86, "categoryTitle": "Algorithms", "frontendQuestionId": "1267", "paidOnly": false, "title": "Count Servers that Communicate", "titleSlug": "count-servers-that-communicate", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 60822, "totalSubmissionRaw": 100338}, "1268": {"acRate": 65.10906374702526, "difficulty": "Medium", "likes": 4734, "dislikes": 241, "categoryTitle": "Algorithms", "frontendQuestionId": "1268", "paidOnly": false, "title": "Search Suggestions System", "titleSlug": "search-suggestions-system", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 323382, "totalSubmissionRaw": 496679}, "1269": {"acRate": 50.303145233386616, "difficulty": "Hard", "likes": 1548, "dislikes": 64, "categoryTitle": "Algorithms", "frontendQuestionId": "1269", "paidOnly": false, "title": "Number of Ways to Stay in the Same Place After Some Steps", "titleSlug": "number-of-ways-to-stay-in-the-same-place-after-some-steps", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 92842, "totalSubmissionRaw": 184565}, "1270": {"acRate": 84.73741876416467, "difficulty": "Medium", "likes": 422, "dislikes": 28, "categoryTitle": "Database", "frontendQuestionId": "1270", "paidOnly": true, "title": "All People Report to the Given Manager", "titleSlug": "all-people-report-to-the-given-manager", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 56452, "totalSubmissionRaw": 66621}, "1271": {"acRate": 58.12914162428725, "difficulty": "Easy", "likes": 78, "dislikes": 125, "categoryTitle": "Algorithms", "frontendQuestionId": "1271", "paidOnly": true, "title": "Hexspeak", "titleSlug": "hexspeak", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11316, "totalSubmissionRaw": 19467}, "1272": {"acRate": 66.2464409147073, "difficulty": "Medium", "likes": 462, "dislikes": 33, "categoryTitle": "Algorithms", "frontendQuestionId": "1272", "paidOnly": true, "title": "Remove Interval", "titleSlug": "remove-interval", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 36994, "totalSubmissionRaw": 55843}, "1273": {"acRate": 61.16949451065579, "difficulty": "Medium", "likes": 225, "dislikes": 64, "categoryTitle": "Algorithms", "frontendQuestionId": "1273", "paidOnly": true, "title": "Delete Tree Nodes", "titleSlug": "delete-tree-nodes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10419, "totalSubmissionRaw": 17033}, "1274": {"acRate": 68.6639070137281, "difficulty": "Hard", "likes": 526, "dislikes": 59, "categoryTitle": "Algorithms", "frontendQuestionId": "1274", "paidOnly": true, "title": "Number of Ships in a Rectangle", "titleSlug": "number-of-ships-in-a-rectangle", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 29360, "totalSubmissionRaw": 42759}, "1275": {"acRate": 53.91800747938217, "difficulty": "Easy", "likes": 1493, "dislikes": 348, "categoryTitle": "Algorithms", "frontendQuestionId": "1275", "paidOnly": false, "title": "Find Winner on a Tic Tac Toe Game", "titleSlug": "find-winner-on-a-tic-tac-toe-game", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 130624, "totalSubmissionRaw": 242264}, "1276": {"acRate": 51.18296379616037, "difficulty": "Medium", "likes": 331, "dislikes": 235, "categoryTitle": "Algorithms", "frontendQuestionId": "1276", "paidOnly": false, "title": "Number of Burgers with No Waste of Ingredients", "titleSlug": "number-of-burgers-with-no-waste-of-ingredients", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26847, "totalSubmissionRaw": 52453}, "1277": {"acRate": 75.45382510899302, "difficulty": "Medium", "likes": 4872, "dislikes": 82, "categoryTitle": "Algorithms", "frontendQuestionId": "1277", "paidOnly": false, "title": "Count Square Submatrices with All Ones", "titleSlug": "count-square-submatrices-with-all-ones", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 231395, "totalSubmissionRaw": 306671}, "1278": {"acRate": 61.12336845578077, "difficulty": "Hard", "likes": 1148, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "1278", "paidOnly": false, "title": "Palindrome Partitioning III", "titleSlug": "palindrome-partitioning-iii", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29643, "totalSubmissionRaw": 48497}, "1279": {"acRate": 72.89201737307174, "difficulty": "Easy", "likes": 75, "dislikes": 353, "categoryTitle": "Concurrency", "frontendQuestionId": "1279", "paidOnly": true, "title": "Traffic Light Controlled Intersection", "titleSlug": "traffic-light-controlled-intersection", "topicTags": [{"name": "Concurrency", "id": "VG9waWNUYWdOb2RlOjYxMDQ1", "slug": "concurrency"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14601, "totalSubmissionRaw": 20031}, "1280": {"acRate": 58.18554287386597, "difficulty": "Easy", "likes": 1783, "dislikes": 242, "categoryTitle": "Database", "frontendQuestionId": "1280", "paidOnly": false, "title": "Students and Examinations", "titleSlug": "students-and-examinations", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 298226, "totalSubmissionRaw": 512546}, "1281": {"acRate": 86.56077675158159, "difficulty": "Easy", "likes": 2575, "dislikes": 234, "categoryTitle": "Algorithms", "frontendQuestionId": "1281", "paidOnly": false, "title": "Subtract the Product and Sum of Digits of an Integer", "titleSlug": "subtract-the-product-and-sum-of-digits-of-an-integer", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 511729, "totalSubmissionRaw": 591179}, "1282": {"acRate": 87.43622448979592, "difficulty": "Medium", "likes": 3000, "dislikes": 708, "categoryTitle": "Algorithms", "frontendQuestionId": "1282", "paidOnly": false, "title": "Group the People Given the Group Size They Belong To", "titleSlug": "group-the-people-given-the-group-size-they-belong-to", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 213876, "totalSubmissionRaw": 244608}, "1283": {"acRate": 61.01918063585919, "difficulty": "Medium", "likes": 2934, "dislikes": 206, "categoryTitle": "Algorithms", "frontendQuestionId": "1283", "paidOnly": false, "title": "Find the Smallest Divisor Given a Threshold", "titleSlug": "find-the-smallest-divisor-given-a-threshold", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 209487, "totalSubmissionRaw": 343314}, "1284": {"acRate": 72.12423312883436, "difficulty": "Hard", "likes": 968, "dislikes": 100, "categoryTitle": "Algorithms", "frontendQuestionId": "1284", "paidOnly": false, "title": "Minimum Number of Flips to Convert Binary Matrix to Zero Matrix", "titleSlug": "minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 33858, "totalSubmissionRaw": 46944}, "1285": {"acRate": 82.28670064113102, "difficulty": "Medium", "likes": 561, "dislikes": 33, "categoryTitle": "Database", "frontendQuestionId": "1285", "paidOnly": true, "title": "Find the Start and End Number of Continuous Ranges", "titleSlug": "find-the-start-and-end-number-of-continuous-ranges", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 40044, "totalSubmissionRaw": 48664}, "1286": {"acRate": 73.30465311773723, "difficulty": "Medium", "likes": 1363, "dislikes": 105, "categoryTitle": "Algorithms", "frontendQuestionId": "1286", "paidOnly": false, "title": "Iterator for Combination", "titleSlug": "iterator-for-combination", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Iterator", "id": "VG9waWNUYWdOb2RlOjYxMDY0", "slug": "iterator"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 74122, "totalSubmissionRaw": 101115}, "1287": {"acRate": 60.992438118091705, "difficulty": "Easy", "likes": 1705, "dislikes": 78, "categoryTitle": "Algorithms", "frontendQuestionId": "1287", "paidOnly": false, "title": "Element Appearing More Than 25% In Sorted Array", "titleSlug": "element-appearing-more-than-25-in-sorted-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 220115, "totalSubmissionRaw": 360889}, "1288": {"acRate": 56.31380014346411, "difficulty": "Medium", "likes": 2229, "dislikes": 60, "categoryTitle": "Algorithms", "frontendQuestionId": "1288", "paidOnly": false, "title": "Remove Covered Intervals", "titleSlug": "remove-covered-intervals", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 122469, "totalSubmissionRaw": 217476}, "1289": {"acRate": 64.31456742292706, "difficulty": "Hard", "likes": 2255, "dislikes": 123, "categoryTitle": "Algorithms", "frontendQuestionId": "1289", "paidOnly": false, "title": "Minimum Falling Path Sum II", "titleSlug": "minimum-falling-path-sum-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 144091, "totalSubmissionRaw": 224041}, "1290": {"acRate": 81.11720497641855, "difficulty": "Easy", "likes": 4161, "dislikes": 159, "categoryTitle": "Algorithms", "frontendQuestionId": "1290", "paidOnly": false, "title": "Convert Binary Number in a Linked List to Integer", "titleSlug": "convert-binary-number-in-a-linked-list-to-integer", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 492074, "totalSubmissionRaw": 606620}, "1291": {"acRate": 65.27972794435655, "difficulty": "Medium", "likes": 2863, "dislikes": 175, "categoryTitle": "Algorithms", "frontendQuestionId": "1291", "paidOnly": false, "title": "Sequential Digits", "titleSlug": "sequential-digits", "topicTags": [{"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 220370, "totalSubmissionRaw": 337578}, "1292": {"acRate": 53.617200411612465, "difficulty": "Medium", "likes": 1083, "dislikes": 93, "categoryTitle": "Algorithms", "frontendQuestionId": "1292", "paidOnly": false, "title": "Maximum Side Length of a Square with Sum Less than or Equal to Threshold", "titleSlug": "maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34389, "totalSubmissionRaw": 64138}, "1293": {"acRate": 45.30056055388012, "difficulty": "Hard", "likes": 4520, "dislikes": 84, "categoryTitle": "Algorithms", "frontendQuestionId": "1293", "paidOnly": false, "title": "Shortest Path in a Grid with Obstacles Elimination", "titleSlug": "shortest-path-in-a-grid-with-obstacles-elimination", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 215851, "totalSubmissionRaw": 476489}, "1294": {"acRate": 66.7459727385378, "difficulty": "Easy", "likes": 140, "dislikes": 30, "categoryTitle": "Database", "frontendQuestionId": "1294", "paidOnly": true, "title": "Weather Type in Each Country", "titleSlug": "weather-type-in-each-country", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 40398, "totalSubmissionRaw": 60525}, "1295": {"acRate": 77.40248703203022, "difficulty": "Easy", "likes": 2391, "dislikes": 129, "categoryTitle": "Algorithms", "frontendQuestionId": "1295", "paidOnly": false, "title": "Find Numbers with Even Number of Digits", "titleSlug": "find-numbers-with-even-number-of-digits", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 703114, "totalSubmissionRaw": 908385}, "1296": {"acRate": 58.51973257555212, "difficulty": "Medium", "likes": 1864, "dislikes": 113, "categoryTitle": "Algorithms", "frontendQuestionId": "1296", "paidOnly": false, "title": "Divide Array in Sets of K Consecutive Numbers", "titleSlug": "divide-array-in-sets-of-k-consecutive-numbers", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 99260, "totalSubmissionRaw": 169618}, "1297": {"acRate": 52.11513831368553, "difficulty": "Medium", "likes": 1089, "dislikes": 405, "categoryTitle": "Algorithms", "frontendQuestionId": "1297", "paidOnly": false, "title": "Maximum Number of Occurrences of a Substring", "titleSlug": "maximum-number-of-occurrences-of-a-substring", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 55746, "totalSubmissionRaw": 106967}, "1298": {"acRate": 57.86653517422749, "difficulty": "Hard", "likes": 344, "dislikes": 146, "categoryTitle": "Algorithms", "frontendQuestionId": "1298", "paidOnly": false, "title": "Maximum Candies You Can Get from Boxes", "titleSlug": "maximum-candies-you-can-get-from-boxes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17603, "totalSubmissionRaw": 30420}, "1299": {"acRate": 71.2527323274124, "difficulty": "Easy", "likes": 2597, "dislikes": 245, "categoryTitle": "Algorithms", "frontendQuestionId": "1299", "paidOnly": false, "title": "Replace Elements with Greatest Element on Right Side", "titleSlug": "replace-elements-with-greatest-element-on-right-side", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 402900, "totalSubmissionRaw": 565452}, "1300": {"acRate": 44.656217204373874, "difficulty": "Medium", "likes": 1146, "dislikes": 149, "categoryTitle": "Algorithms", "frontendQuestionId": "1300", "paidOnly": false, "title": "Sum of Mutated Array Closest to Target", "titleSlug": "sum-of-mutated-array-closest-to-target", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 39573, "totalSubmissionRaw": 88617}, "1301": {"acRate": 39.73941368078176, "difficulty": "Hard", "likes": 515, "dislikes": 24, "categoryTitle": "Algorithms", "frontendQuestionId": "1301", "paidOnly": false, "title": "Number of Paths with Max Score", "titleSlug": "number-of-paths-with-max-score", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14152, "totalSubmissionRaw": 35612}, "1302": {"acRate": 86.32666926942052, "difficulty": "Medium", "likes": 4700, "dislikes": 123, "categoryTitle": "Algorithms", "frontendQuestionId": "1302", "paidOnly": false, "title": "Deepest Leaves Sum", "titleSlug": "deepest-leaves-sum", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 340519, "totalSubmissionRaw": 394454}, "1303": {"acRate": 89.54576237176754, "difficulty": "Easy", "likes": 333, "dislikes": 16, "categoryTitle": "Database", "frontendQuestionId": "1303", "paidOnly": true, "title": "Find the Team Size", "titleSlug": "find-the-team-size", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 71401, "totalSubmissionRaw": 79737}, "1304": {"acRate": 76.1776129823824, "difficulty": "Easy", "likes": 1993, "dislikes": 599, "categoryTitle": "Algorithms", "frontendQuestionId": "1304", "paidOnly": false, "title": "Find N Unique Integers Sum up to Zero", "titleSlug": "find-n-unique-integers-sum-up-to-zero", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 224759, "totalSubmissionRaw": 295046}, "1305": {"acRate": 79.8348277150329, "difficulty": "Medium", "likes": 3067, "dislikes": 94, "categoryTitle": "Algorithms", "frontendQuestionId": "1305", "paidOnly": false, "title": "All Elements in Two Binary Search Trees", "titleSlug": "all-elements-in-two-binary-search-trees", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 222241, "totalSubmissionRaw": 278376}, "1306": {"acRate": 65.13950888303125, "difficulty": "Medium", "likes": 4151, "dislikes": 104, "categoryTitle": "Algorithms", "frontendQuestionId": "1306", "paidOnly": false, "title": "Jump Game III", "titleSlug": "jump-game-iii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 239460, "totalSubmissionRaw": 367611}, "1307": {"acRate": 34.5905538566089, "difficulty": "Hard", "likes": 504, "dislikes": 129, "categoryTitle": "Algorithms", "frontendQuestionId": "1307", "paidOnly": false, "title": "Verbal Arithmetic Puzzle", "titleSlug": "verbal-arithmetic-puzzle", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14252, "totalSubmissionRaw": 41202}, "1308": {"acRate": 86.41638935108153, "difficulty": "Medium", "likes": 215, "dislikes": 63, "categoryTitle": "Database", "frontendQuestionId": "1308", "paidOnly": true, "title": "Running Total for Different Genders", "titleSlug": "running-total-for-different-genders", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 41549, "totalSubmissionRaw": 48080}, "1309": {"acRate": 79.81497056349875, "difficulty": "Easy", "likes": 1540, "dislikes": 110, "categoryTitle": "Algorithms", "frontendQuestionId": "1309", "paidOnly": false, "title": "Decrypt String from Alphabet to Integer Mapping", "titleSlug": "decrypt-string-from-alphabet-to-integer-mapping", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 128115, "totalSubmissionRaw": 160515}, "1310": {"acRate": 73.21629502365367, "difficulty": "Medium", "likes": 1499, "dislikes": 37, "categoryTitle": "Algorithms", "frontendQuestionId": "1310", "paidOnly": false, "title": "XOR Queries of a Subarray", "titleSlug": "xor-queries-of-a-subarray", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 60514, "totalSubmissionRaw": 82651}, "1311": {"acRate": 47.65115883719612, "difficulty": "Medium", "likes": 404, "dislikes": 422, "categoryTitle": "Algorithms", "frontendQuestionId": "1311", "paidOnly": false, "title": "Get Watched Videos by Your Friends", "titleSlug": "get-watched-videos-by-your-friends", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25227, "totalSubmissionRaw": 52941}, "1312": {"acRate": 71.19558184323309, "difficulty": "Hard", "likes": 5066, "dislikes": 66, "categoryTitle": "Algorithms", "frontendQuestionId": "1312", "paidOnly": false, "title": "Minimum Insertion Steps to Make a String Palindrome", "titleSlug": "minimum-insertion-steps-to-make-a-string-palindrome", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 187055, "totalSubmissionRaw": 262734}, "1313": {"acRate": 85.80937259279055, "difficulty": "Easy", "likes": 1271, "dislikes": 1318, "categoryTitle": "Algorithms", "frontendQuestionId": "1313", "paidOnly": false, "title": "Decompress Run-Length Encoded List", "titleSlug": "decompress-run-length-encoded-list", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 272921, "totalSubmissionRaw": 318055}, "1314": {"acRate": 75.58854913468271, "difficulty": "Medium", "likes": 2396, "dislikes": 377, "categoryTitle": "Algorithms", "frontendQuestionId": "1314", "paidOnly": false, "title": "Matrix Block Sum", "titleSlug": "matrix-block-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 90673, "totalSubmissionRaw": 119956}, "1315": {"acRate": 85.58733384865701, "difficulty": "Medium", "likes": 2751, "dislikes": 76, "categoryTitle": "Algorithms", "frontendQuestionId": "1315", "paidOnly": false, "title": "Sum of Nodes with Even-Valued Grandparent", "titleSlug": "sum-of-nodes-with-even-valued-grandparent", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 158334, "totalSubmissionRaw": 184997}, "1316": {"acRate": 50.80363176916522, "difficulty": "Hard", "likes": 317, "dislikes": 204, "categoryTitle": "Algorithms", "frontendQuestionId": "1316", "paidOnly": false, "title": "Distinct Echo Substrings", "titleSlug": "distinct-echo-substrings", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17290, "totalSubmissionRaw": 34033}, "1317": {"acRate": 53.964041000810695, "difficulty": "Easy", "likes": 413, "dislikes": 314, "categoryTitle": "Algorithms", "frontendQuestionId": "1317", "paidOnly": false, "title": "Convert Integer to the Sum of Two No-Zero Integers", "titleSlug": "convert-integer-to-the-sum-of-two-no-zero-integers", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 48593, "totalSubmissionRaw": 90047}, "1318": {"acRate": 71.14081175891681, "difficulty": "Medium", "likes": 1985, "dislikes": 100, "categoryTitle": "Algorithms", "frontendQuestionId": "1318", "paidOnly": false, "title": "Minimum Flips to Make a OR b Equal to c", "titleSlug": "minimum-flips-to-make-a-or-b-equal-to-c", "topicTags": [{"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 134454, "totalSubmissionRaw": 188997}, "1319": {"acRate": 63.233488231189106, "difficulty": "Medium", "likes": 5049, "dislikes": 72, "categoryTitle": "Algorithms", "frontendQuestionId": "1319", "paidOnly": false, "title": "Number of Operations to Make Network Connected", "titleSlug": "number-of-operations-to-make-network-connected", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 233778, "totalSubmissionRaw": 369706}, "1320": {"acRate": 59.08308300974431, "difficulty": "Hard", "likes": 1003, "dislikes": 38, "categoryTitle": "Algorithms", "frontendQuestionId": "1320", "paidOnly": false, "title": "Minimum Distance to Type a Word Using Two Fingers", "titleSlug": "minimum-distance-to-type-a-word-using-two-fingers", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 32257, "totalSubmissionRaw": 54596}, "1321": {"acRate": 52.37745889211687, "difficulty": "Medium", "likes": 785, "dislikes": 293, "categoryTitle": "Database", "frontendQuestionId": "1321", "paidOnly": false, "title": "Restaurant Growth", "titleSlug": "restaurant-growth", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 107091, "totalSubmissionRaw": 204460}, "1322": {"acRate": 59.29071471210723, "difficulty": "Easy", "likes": 260, "dislikes": 64, "categoryTitle": "Database", "frontendQuestionId": "1322", "paidOnly": true, "title": "Ads Performance", "titleSlug": "ads-performance", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 43702, "totalSubmissionRaw": 73708}, "1323": {"acRate": 82.39883220167538, "difficulty": "Easy", "likes": 2797, "dislikes": 218, "categoryTitle": "Algorithms", "frontendQuestionId": "1323", "paidOnly": false, "title": "Maximum 69 Number", "titleSlug": "maximum-69-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 272076, "totalSubmissionRaw": 330194}, "1324": {"acRate": 64.49575023270718, "difficulty": "Medium", "likes": 784, "dislikes": 117, "categoryTitle": "Algorithms", "frontendQuestionId": "1324", "paidOnly": false, "title": "Print Words Vertically", "titleSlug": "print-words-vertically", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 42266, "totalSubmissionRaw": 65533}, "1325": {"acRate": 77.4459127250182, "difficulty": "Medium", "likes": 2747, "dislikes": 54, "categoryTitle": "Algorithms", "frontendQuestionId": "1325", "paidOnly": false, "title": "Delete Leaves With a Given Value", "titleSlug": "delete-leaves-with-a-given-value", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 214851, "totalSubmissionRaw": 277418}, "1326": {"acRate": 50.81015301638334, "difficulty": "Hard", "likes": 3408, "dislikes": 197, "categoryTitle": "Algorithms", "frontendQuestionId": "1326", "paidOnly": false, "title": "Minimum Number of Taps to Open to Water a Garden", "titleSlug": "minimum-number-of-taps-to-open-to-water-a-garden", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 135280, "totalSubmissionRaw": 266246}, "1327": {"acRate": 71.02558999444835, "difficulty": "Easy", "likes": 374, "dislikes": 35, "categoryTitle": "Database", "frontendQuestionId": "1327", "paidOnly": false, "title": "List the Products Ordered in a Period", "titleSlug": "list-the-products-ordered-in-a-period", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 135611, "totalSubmissionRaw": 190933}, "1328": {"acRate": 51.71232568533522, "difficulty": "Medium", "likes": 2336, "dislikes": 747, "categoryTitle": "Algorithms", "frontendQuestionId": "1328", "paidOnly": false, "title": "Break a Palindrome", "titleSlug": "break-a-palindrome", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 172397, "totalSubmissionRaw": 333377}, "1329": {"acRate": 82.904730444631, "difficulty": "Medium", "likes": 3395, "dislikes": 231, "categoryTitle": "Algorithms", "frontendQuestionId": "1329", "paidOnly": false, "title": "Sort the Matrix Diagonally", "titleSlug": "sort-the-matrix-diagonally", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 166898, "totalSubmissionRaw": 201313}, "1330": {"acRate": 41.784511784511785, "difficulty": "Hard", "likes": 479, "dislikes": 54, "categoryTitle": "Algorithms", "frontendQuestionId": "1330", "paidOnly": false, "title": "Reverse Subarray To Maximize Array Value", "titleSlug": "reverse-subarray-to-maximize-array-value", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6205, "totalSubmissionRaw": 14850}, "1331": {"acRate": 62.530653793358724, "difficulty": "Easy", "likes": 1702, "dislikes": 90, "categoryTitle": "Algorithms", "frontendQuestionId": "1331", "paidOnly": false, "title": "Rank Transform of an Array", "titleSlug": "rank-transform-of-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 121629, "totalSubmissionRaw": 194511}, "1332": {"acRate": 76.49492732525587, "difficulty": "Easy", "likes": 1665, "dislikes": 1768, "categoryTitle": "Algorithms", "frontendQuestionId": "1332", "paidOnly": false, "title": "Remove Palindromic Subsequences", "titleSlug": "remove-palindromic-subsequences", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 136623, "totalSubmissionRaw": 178604}, "1333": {"acRate": 61.619366942082785, "difficulty": "Medium", "likes": 306, "dislikes": 224, "categoryTitle": "Algorithms", "frontendQuestionId": "1333", "paidOnly": false, "title": "Filter Restaurants by Vegan-Friendly, Price and Distance", "titleSlug": "filter-restaurants-by-vegan-friendly-price-and-distance", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30875, "totalSubmissionRaw": 50106}, "1334": {"acRate": 68.24960791762861, "difficulty": "Medium", "likes": 3171, "dislikes": 139, "categoryTitle": "Algorithms", "frontendQuestionId": "1334", "paidOnly": false, "title": "Find the City With the Smallest Number of Neighbors at a Threshold Distance", "titleSlug": "find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 210186, "totalSubmissionRaw": 307968}, "1335": {"acRate": 59.584014886624544, "difficulty": "Hard", "likes": 3416, "dislikes": 318, "categoryTitle": "Algorithms", "frontendQuestionId": "1335", "paidOnly": false, "title": "Minimum Difficulty of a Job Schedule", "titleSlug": "minimum-difficulty-of-a-job-schedule", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 198525, "totalSubmissionRaw": 333185}, "1336": {"acRate": 47.58025697041508, "difficulty": "Hard", "likes": 92, "dislikes": 316, "categoryTitle": "Database", "frontendQuestionId": "1336", "paidOnly": true, "title": "Number of Transactions per Visit", "titleSlug": "number-of-transactions-per-visit", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12850, "totalSubmissionRaw": 27007}, "1337": {"acRate": 73.59278738387803, "difficulty": "Easy", "likes": 4176, "dislikes": 233, "categoryTitle": "Algorithms", "frontendQuestionId": "1337", "paidOnly": false, "title": "The K Weakest Rows in a Matrix", "titleSlug": "the-k-weakest-rows-in-a-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 370667, "totalSubmissionRaw": 503673}, "1338": {"acRate": 68.96405625976733, "difficulty": "Medium", "likes": 3258, "dislikes": 150, "categoryTitle": "Algorithms", "frontendQuestionId": "1338", "paidOnly": false, "title": "Reduce Array Size to The Half", "titleSlug": "reduce-array-size-to-the-half", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 198580, "totalSubmissionRaw": 287948}, "1339": {"acRate": 47.70979832636931, "difficulty": "Medium", "likes": 3011, "dislikes": 104, "categoryTitle": "Algorithms", "frontendQuestionId": "1339", "paidOnly": false, "title": "Maximum Product of Splitted Binary Tree", "titleSlug": "maximum-product-of-splitted-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 126399, "totalSubmissionRaw": 264933}, "1340": {"acRate": 63.485319778469005, "difficulty": "Hard", "likes": 1108, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "1340", "paidOnly": false, "title": "Jump Game V", "titleSlug": "jump-game-v", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33472, "totalSubmissionRaw": 52724}, "1341": {"acRate": 40.23832781197966, "difficulty": "Medium", "likes": 596, "dislikes": 188, "categoryTitle": "Database", "frontendQuestionId": "1341", "paidOnly": false, "title": "Movie Rating", "titleSlug": "movie-rating", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 115753, "totalSubmissionRaw": 287669}, "1342": {"acRate": 85.26708945333465, "difficulty": "Easy", "likes": 3966, "dislikes": 170, "categoryTitle": "Algorithms", "frontendQuestionId": "1342", "paidOnly": false, "title": "Number of Steps to Reduce a Number to Zero", "titleSlug": "number-of-steps-to-reduce-a-number-to-zero", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 700630, "totalSubmissionRaw": 821689}, "1343": {"acRate": 68.77852661836968, "difficulty": "Medium", "likes": 1601, "dislikes": 104, "categoryTitle": "Algorithms", "frontendQuestionId": "1343", "paidOnly": false, "title": "Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold", "titleSlug": "number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 106234, "totalSubmissionRaw": 154459}, "1344": {"acRate": 63.8756103303205, "difficulty": "Medium", "likes": 1316, "dislikes": 240, "categoryTitle": "Algorithms", "frontendQuestionId": "1344", "paidOnly": false, "title": "Angle Between Hands of a Clock", "titleSlug": "angle-between-hands-of-a-clock", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 124804, "totalSubmissionRaw": 195386}, "1345": {"acRate": 46.17758067559917, "difficulty": "Hard", "likes": 3739, "dislikes": 129, "categoryTitle": "Algorithms", "frontendQuestionId": "1345", "paidOnly": false, "title": "Jump Game IV", "titleSlug": "jump-game-iv", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 146817, "totalSubmissionRaw": 317940}, "1346": {"acRate": 37.38473327897181, "difficulty": "Easy", "likes": 1926, "dislikes": 207, "categoryTitle": "Algorithms", "frontendQuestionId": "1346", "paidOnly": false, "title": "Check If N and Its Double Exist", "titleSlug": "check-if-n-and-its-double-exist", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 365401, "totalSubmissionRaw": 977407}, "1347": {"acRate": 82.06093488668824, "difficulty": "Medium", "likes": 2715, "dislikes": 118, "categoryTitle": "Algorithms", "frontendQuestionId": "1347", "paidOnly": false, "title": "Minimum Number of Steps to Make Two Strings Anagram", "titleSlug": "minimum-number-of-steps-to-make-two-strings-anagram", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 285548, "totalSubmissionRaw": 347972}, "1348": {"acRate": 44.67170436036421, "difficulty": "Medium", "likes": 193, "dislikes": 299, "categoryTitle": "Algorithms", "frontendQuestionId": "1348", "paidOnly": false, "title": "Tweet Counts Per Frequency", "titleSlug": "tweet-counts-per-frequency", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33460, "totalSubmissionRaw": 74902}, "1349": {"acRate": 50.768407597871644, "difficulty": "Hard", "likes": 829, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "1349", "paidOnly": false, "title": "Maximum Students Taking Exam", "titleSlug": "maximum-students-taking-exam", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17079, "totalSubmissionRaw": 33641}, "1350": {"acRate": 89.7312694661387, "difficulty": "Easy", "likes": 177, "dislikes": 9, "categoryTitle": "Database", "frontendQuestionId": "1350", "paidOnly": true, "title": "Students With Invalid Departments", "titleSlug": "students-with-invalid-departments", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 57332, "totalSubmissionRaw": 63893}, "1351": {"acRate": 77.4021565103158, "difficulty": "Easy", "likes": 4973, "dislikes": 132, "categoryTitle": "Algorithms", "frontendQuestionId": "1351", "paidOnly": false, "title": "Count Negative Numbers in a Sorted Matrix", "titleSlug": "count-negative-numbers-in-a-sorted-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 433651, "totalSubmissionRaw": 560257}, "1352": {"acRate": 51.76721232821942, "difficulty": "Medium", "likes": 1483, "dislikes": 73, "categoryTitle": "Algorithms", "frontendQuestionId": "1352", "paidOnly": false, "title": "Product of the Last K Numbers", "titleSlug": "product-of-the-last-k-numbers", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Data Stream", "id": "VG9waWNUYWdOb2RlOjYxMDYz", "slug": "data-stream"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 90633, "totalSubmissionRaw": 175078}, "1353": {"acRate": 32.47798225842406, "difficulty": "Medium", "likes": 3046, "dislikes": 426, "categoryTitle": "Algorithms", "frontendQuestionId": "1353", "paidOnly": false, "title": "Maximum Number of Events That Can Be Attended", "titleSlug": "maximum-number-of-events-that-can-be-attended", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 91787, "totalSubmissionRaw": 282613}, "1354": {"acRate": 36.20050406653246, "difficulty": "Hard", "likes": 2038, "dislikes": 166, "categoryTitle": "Algorithms", "frontendQuestionId": "1354", "paidOnly": false, "title": "Construct Target Array With Multiple Sums", "titleSlug": "construct-target-array-with-multiple-sums", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 67077, "totalSubmissionRaw": 185293}, "1355": {"acRate": 72.4084008949407, "difficulty": "Medium", "likes": 147, "dislikes": 48, "categoryTitle": "Database", "frontendQuestionId": "1355", "paidOnly": true, "title": "Activity Participants", "titleSlug": "activity-participants", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 30098, "totalSubmissionRaw": 41567}, "1356": {"acRate": 78.30880726012616, "difficulty": "Easy", "likes": 2456, "dislikes": 120, "categoryTitle": "Algorithms", "frontendQuestionId": "1356", "paidOnly": false, "title": "Sort Integers by The Number of 1 Bits", "titleSlug": "sort-integers-by-the-number-of-1-bits", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 230047, "totalSubmissionRaw": 293769}, "1357": {"acRate": 71.24269455552138, "difficulty": "Medium", "likes": 194, "dislikes": 228, "categoryTitle": "Algorithms", "frontendQuestionId": "1357", "paidOnly": false, "title": "Apply Discount Every n Orders", "titleSlug": "apply-discount-every-n-orders", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23161, "totalSubmissionRaw": 32510}, "1358": {"acRate": 67.59473762513018, "difficulty": "Medium", "likes": 3266, "dislikes": 56, "categoryTitle": "Algorithms", "frontendQuestionId": "1358", "paidOnly": false, "title": "Number of Substrings Containing All Three Characters", "titleSlug": "number-of-substrings-containing-all-three-characters", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 127216, "totalSubmissionRaw": 188204}, "1359": {"acRate": 64.99736398419435, "difficulty": "Hard", "likes": 3036, "dislikes": 228, "categoryTitle": "Algorithms", "frontendQuestionId": "1359", "paidOnly": false, "title": "Count All Valid Pickup and Delivery Options", "titleSlug": "count-all-valid-pickup-and-delivery-options", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 124520, "totalSubmissionRaw": 191577}, "1360": {"acRate": 50.1903435468895, "difficulty": "Easy", "likes": 372, "dislikes": 1280, "categoryTitle": "Algorithms", "frontendQuestionId": "1360", "paidOnly": false, "title": "Number of Days Between Two Dates", "titleSlug": "number-of-days-between-two-dates", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 54055, "totalSubmissionRaw": 107700}, "1361": {"acRate": 43.834922112882815, "difficulty": "Medium", "likes": 2132, "dislikes": 509, "categoryTitle": "Algorithms", "frontendQuestionId": "1361", "paidOnly": false, "title": "Validate Binary Tree Nodes", "titleSlug": "validate-binary-tree-nodes", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 116753, "totalSubmissionRaw": 266347}, "1362": {"acRate": 60.92092827890371, "difficulty": "Medium", "likes": 322, "dislikes": 95, "categoryTitle": "Algorithms", "frontendQuestionId": "1362", "paidOnly": false, "title": "Closest Divisors", "titleSlug": "closest-divisors", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23206, "totalSubmissionRaw": 38092}, "1363": {"acRate": 32.67633140539322, "difficulty": "Hard", "likes": 604, "dislikes": 87, "categoryTitle": "Algorithms", "frontendQuestionId": "1363", "paidOnly": false, "title": "Largest Multiple of Three", "titleSlug": "largest-multiple-of-three", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21751, "totalSubmissionRaw": 66565}, "1364": {"acRate": 75.01277838627236, "difficulty": "Medium", "likes": 88, "dislikes": 387, "categoryTitle": "Database", "frontendQuestionId": "1364", "paidOnly": true, "title": "Number of Trusted Contacts of a Customer", "titleSlug": "number-of-trusted-contacts-of-a-customer", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 20546, "totalSubmissionRaw": 27390}, "1365": {"acRate": 86.89976965329869, "difficulty": "Easy", "likes": 5473, "dislikes": 136, "categoryTitle": "Algorithms", "frontendQuestionId": "1365", "paidOnly": false, "title": "How Many Numbers Are Smaller Than the Current Number", "titleSlug": "how-many-numbers-are-smaller-than-the-current-number", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 588520, "totalSubmissionRaw": 677240}, "1366": {"acRate": 58.55356896630969, "difficulty": "Medium", "likes": 1456, "dislikes": 168, "categoryTitle": "Algorithms", "frontendQuestionId": "1366", "paidOnly": false, "title": "Rank Teams by Votes", "titleSlug": "rank-teams-by-votes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 76437, "totalSubmissionRaw": 130542}, "1367": {"acRate": 44.025097122039256, "difficulty": "Medium", "likes": 2245, "dislikes": 67, "categoryTitle": "Algorithms", "frontendQuestionId": "1367", "paidOnly": false, "title": "Linked List in Binary Tree", "titleSlug": "linked-list-in-binary-tree", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 78307, "totalSubmissionRaw": 177869}, "1368": {"acRate": 62.3269435569755, "difficulty": "Hard", "likes": 1768, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "1368", "paidOnly": false, "title": "Minimum Cost to Make at Least One Valid Path in a Grid", "titleSlug": "minimum-cost-to-make-at-least-one-valid-path-in-a-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 49161, "totalSubmissionRaw": 78876}, "1369": {"acRate": 67.65540602398609, "difficulty": "Hard", "likes": 161, "dislikes": 13, "categoryTitle": "Database", "frontendQuestionId": "1369", "paidOnly": true, "title": "Get the Second Most Recent Activity", "titleSlug": "get-the-second-most-recent-activity", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22170, "totalSubmissionRaw": 32769}, "1370": {"acRate": 76.56072322037754, "difficulty": "Easy", "likes": 781, "dislikes": 865, "categoryTitle": "Algorithms", "frontendQuestionId": "1370", "paidOnly": false, "title": "Increasing Decreasing String", "titleSlug": "increasing-decreasing-string", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 80793, "totalSubmissionRaw": 105528}, "1371": {"acRate": 64.15618735192272, "difficulty": "Medium", "likes": 1629, "dislikes": 60, "categoryTitle": "Algorithms", "frontendQuestionId": "1371", "paidOnly": false, "title": "Find the Longest Substring Containing Vowels in Even Counts", "titleSlug": "find-the-longest-substring-containing-vowels-in-even-counts", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28162, "totalSubmissionRaw": 43896}, "1372": {"acRate": 65.93567945650784, "difficulty": "Medium", "likes": 3462, "dislikes": 75, "categoryTitle": "Algorithms", "frontendQuestionId": "1372", "paidOnly": false, "title": "Longest ZigZag Path in a Binary Tree", "titleSlug": "longest-zigzag-path-in-a-binary-tree", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 180521, "totalSubmissionRaw": 273784}, "1373": {"acRate": 41.75099711473184, "difficulty": "Hard", "likes": 2669, "dislikes": 182, "categoryTitle": "Algorithms", "frontendQuestionId": "1373", "paidOnly": false, "title": "Maximum Sum BST in Binary Tree", "titleSlug": "maximum-sum-bst-in-binary-tree", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 78719, "totalSubmissionRaw": 188544}, "1374": {"acRate": 77.96296296296296, "difficulty": "Easy", "likes": 485, "dislikes": 1275, "categoryTitle": "Algorithms", "frontendQuestionId": "1374", "paidOnly": false, "title": "Generate a String With Characters That Have Odd Counts", "titleSlug": "generate-a-string-with-characters-that-have-odd-counts", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 97251, "totalSubmissionRaw": 124740}, "1375": {"acRate": 65.77148377786746, "difficulty": "Medium", "likes": 942, "dislikes": 138, "categoryTitle": "Algorithms", "frontendQuestionId": "1375", "paidOnly": false, "title": "Number of Times Binary String Is Prefix-Aligned", "titleSlug": "number-of-times-binary-string-is-prefix-aligned", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 53782, "totalSubmissionRaw": 81771}, "1376": {"acRate": 60.040115589123374, "difficulty": "Medium", "likes": 4090, "dislikes": 300, "categoryTitle": "Algorithms", "frontendQuestionId": "1376", "paidOnly": false, "title": "Time Needed to Inform All Employees", "titleSlug": "time-needed-to-inform-all-employees", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 222107, "totalSubmissionRaw": 369931}, "1377": {"acRate": 35.53100987925357, "difficulty": "Hard", "likes": 790, "dislikes": 145, "categoryTitle": "Algorithms", "frontendQuestionId": "1377", "paidOnly": false, "title": "Frog Position After T Seconds", "titleSlug": "frog-position-after-t-seconds", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 31074, "totalSubmissionRaw": 87456}, "1378": {"acRate": 83.195583198882, "difficulty": "Easy", "likes": 1254, "dislikes": 114, "categoryTitle": "Database", "frontendQuestionId": "1378", "paidOnly": false, "title": "Replace Employee ID With The Unique Identifier", "titleSlug": "replace-employee-id-with-the-unique-identifier", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 554833, "totalSubmissionRaw": 666903}, "1379": {"acRate": 85.89085329047367, "difficulty": "Easy", "likes": 1750, "dislikes": 2004, "categoryTitle": "Algorithms", "frontendQuestionId": "1379", "paidOnly": false, "title": "Find a Corresponding Node of a Binary Tree in a Clone of That Tree", "titleSlug": "find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 236204, "totalSubmissionRaw": 275005}, "1380": {"acRate": 79.90128996074033, "difficulty": "Easy", "likes": 2181, "dislikes": 113, "categoryTitle": "Algorithms", "frontendQuestionId": "1380", "paidOnly": false, "title": "Lucky Numbers in a Matrix", "titleSlug": "lucky-numbers-in-a-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 249309, "totalSubmissionRaw": 312022}, "1381": {"acRate": 77.18892947642084, "difficulty": "Medium", "likes": 1824, "dislikes": 97, "categoryTitle": "Algorithms", "frontendQuestionId": "1381", "paidOnly": false, "title": "Design a Stack With Increment Operation", "titleSlug": "design-a-stack-with-increment-operation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 117276, "totalSubmissionRaw": 151934}, "1382": {"acRate": 84.67574428802216, "difficulty": "Medium", "likes": 3647, "dislikes": 90, "categoryTitle": "Algorithms", "frontendQuestionId": "1382", "paidOnly": false, "title": "Balance a Binary Search Tree", "titleSlug": "balance-a-binary-search-tree", "topicTags": [{"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 256830, "totalSubmissionRaw": 303310}, "1383": {"acRate": 47.69927813708972, "difficulty": "Hard", "likes": 3102, "dislikes": 83, "categoryTitle": "Algorithms", "frontendQuestionId": "1383", "paidOnly": false, "title": "Maximum Performance of a Team", "titleSlug": "maximum-performance-of-a-team", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 96540, "totalSubmissionRaw": 202393}, "1384": {"acRate": 61.255371506225444, "difficulty": "Hard", "likes": 228, "dislikes": 129, "categoryTitle": "Database", "frontendQuestionId": "1384", "paidOnly": true, "title": "Total Sales Amount by Year", "titleSlug": "total-sales-amount-by-year", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16678, "totalSubmissionRaw": 27226}, "1385": {"acRate": 68.85191475233997, "difficulty": "Easy", "likes": 912, "dislikes": 3053, "categoryTitle": "Algorithms", "frontendQuestionId": "1385", "paidOnly": false, "title": "Find the Distance Value Between Two Arrays", "titleSlug": "find-the-distance-value-between-two-arrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 107840, "totalSubmissionRaw": 156626}, "1386": {"acRate": 42.19920669898634, "difficulty": "Medium", "likes": 905, "dislikes": 398, "categoryTitle": "Algorithms", "frontendQuestionId": "1386", "paidOnly": false, "title": "Cinema Seat Allocation", "titleSlug": "cinema-seat-allocation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 49790, "totalSubmissionRaw": 117988}, "1387": {"acRate": 70.14574032394938, "difficulty": "Medium", "likes": 1449, "dislikes": 115, "categoryTitle": "Algorithms", "frontendQuestionId": "1387", "paidOnly": false, "title": "Sort Integers by The Power Value", "titleSlug": "sort-integers-by-the-power-value", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 95058, "totalSubmissionRaw": 135515}, "1388": {"acRate": 52.181551411251405, "difficulty": "Hard", "likes": 1063, "dislikes": 18, "categoryTitle": "Algorithms", "frontendQuestionId": "1388", "paidOnly": false, "title": "Pizza With 3n Slices", "titleSlug": "pizza-with-3n-slices", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27029, "totalSubmissionRaw": 51797}, "1389": {"acRate": 85.95886884336477, "difficulty": "Easy", "likes": 2051, "dislikes": 1869, "categoryTitle": "Algorithms", "frontendQuestionId": "1389", "paidOnly": false, "title": "Create Target Array in the Given Order", "titleSlug": "create-target-array-in-the-given-order", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 258768, "totalSubmissionRaw": 301037}, "1390": {"acRate": 43.11055912265079, "difficulty": "Medium", "likes": 416, "dislikes": 190, "categoryTitle": "Algorithms", "frontendQuestionId": "1390", "paidOnly": false, "title": "Four Divisors", "titleSlug": "four-divisors", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 36794, "totalSubmissionRaw": 85348}, "1391": {"acRate": 48.14647304915279, "difficulty": "Medium", "likes": 827, "dislikes": 315, "categoryTitle": "Algorithms", "frontendQuestionId": "1391", "paidOnly": false, "title": "Check if There is a Valid Path in a Grid", "titleSlug": "check-if-there-is-a-valid-path-in-a-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29807, "totalSubmissionRaw": 61909}, "1392": {"acRate": 46.43432832922259, "difficulty": "Hard", "likes": 1361, "dislikes": 38, "categoryTitle": "Algorithms", "frontendQuestionId": "1392", "paidOnly": false, "title": "Longest Happy Prefix", "titleSlug": "longest-happy-prefix", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 47819, "totalSubmissionRaw": 102982}, "1393": {"acRate": 85.36782005145156, "difficulty": "Medium", "likes": 818, "dislikes": 45, "categoryTitle": "Database", "frontendQuestionId": "1393", "paidOnly": false, "title": "Capital Gain/Loss", "titleSlug": "capital-gainloss", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 116475, "totalSubmissionRaw": 136439}, "1394": {"acRate": 67.61525766199313, "difficulty": "Easy", "likes": 1153, "dislikes": 30, "categoryTitle": "Algorithms", "frontendQuestionId": "1394", "paidOnly": false, "title": "Find Lucky Integer in an Array", "titleSlug": "find-lucky-integer-in-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 131509, "totalSubmissionRaw": 194497}, "1395": {"acRate": 70.15598218438777, "difficulty": "Medium", "likes": 3345, "dislikes": 228, "categoryTitle": "Algorithms", "frontendQuestionId": "1395", "paidOnly": false, "title": "Count Number of Teams", "titleSlug": "count-number-of-teams", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 220206, "totalSubmissionRaw": 313878}, "1396": {"acRate": 74.70789785445825, "difficulty": "Medium", "likes": 3507, "dislikes": 174, "categoryTitle": "Algorithms", "frontendQuestionId": "1396", "paidOnly": false, "title": "Design Underground System", "titleSlug": "design-underground-system", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 233956, "totalSubmissionRaw": 313161}, "1397": {"acRate": 42.54895865713398, "difficulty": "Hard", "likes": 488, "dislikes": 128, "categoryTitle": "Algorithms", "frontendQuestionId": "1397", "paidOnly": false, "title": "Find All Good Strings", "titleSlug": "find-all-good-strings", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6844, "totalSubmissionRaw": 16085}, "1398": {"acRate": 72.60008929900282, "difficulty": "Medium", "likes": 305, "dislikes": 17, "categoryTitle": "Database", "frontendQuestionId": "1398", "paidOnly": true, "title": "Customers Who Bought Products A and B but Not C", "titleSlug": "customers-who-bought-products-a-and-b-but-not-c", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 53658, "totalSubmissionRaw": 73909}, "1399": {"acRate": 66.41433711597011, "difficulty": "Easy", "likes": 443, "dislikes": 984, "categoryTitle": "Algorithms", "frontendQuestionId": "1399", "paidOnly": false, "title": "Count Largest Group", "titleSlug": "count-largest-group", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 47991, "totalSubmissionRaw": 72260}, "1400": {"acRate": 62.1588075070968, "difficulty": "Medium", "likes": 1054, "dislikes": 92, "categoryTitle": "Algorithms", "frontendQuestionId": "1400", "paidOnly": false, "title": "Construct K Palindrome Strings", "titleSlug": "construct-k-palindrome-strings", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 54085, "totalSubmissionRaw": 87011}, "1401": {"acRate": 46.671642984724485, "difficulty": "Medium", "likes": 372, "dislikes": 82, "categoryTitle": "Algorithms", "frontendQuestionId": "1401", "paidOnly": false, "title": "Circle and Rectangle Overlapping", "titleSlug": "circle-and-rectangle-overlapping", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17507, "totalSubmissionRaw": 37511}, "1402": {"acRate": 76.24158026186332, "difficulty": "Hard", "likes": 3308, "dislikes": 309, "categoryTitle": "Algorithms", "frontendQuestionId": "1402", "paidOnly": false, "title": "Reducing Dishes", "titleSlug": "reducing-dishes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 151107, "totalSubmissionRaw": 198195}, "1403": {"acRate": 72.71045684887956, "difficulty": "Easy", "likes": 586, "dislikes": 502, "categoryTitle": "Algorithms", "frontendQuestionId": "1403", "paidOnly": false, "title": "Minimum Subsequence in Non-Increasing Order", "titleSlug": "minimum-subsequence-in-non-increasing-order", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 75472, "totalSubmissionRaw": 103798}, "1404": {"acRate": 61.464568123956774, "difficulty": "Medium", "likes": 1374, "dislikes": 87, "categoryTitle": "Algorithms", "frontendQuestionId": "1404", "paidOnly": false, "title": "Number of Steps to Reduce a Number in Binary Representation to One", "titleSlug": "number-of-steps-to-reduce-a-number-in-binary-representation-to-one", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 145821, "totalSubmissionRaw": 237244}, "1405": {"acRate": 57.5039536816147, "difficulty": "Medium", "likes": 2011, "dislikes": 251, "categoryTitle": "Algorithms", "frontendQuestionId": "1405", "paidOnly": false, "title": "Longest Happy String", "titleSlug": "longest-happy-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 85812, "totalSubmissionRaw": 149228}, "1406": {"acRate": 63.7993637059563, "difficulty": "Hard", "likes": 2190, "dislikes": 71, "categoryTitle": "Algorithms", "frontendQuestionId": "1406", "paidOnly": false, "title": "Stone Game III", "titleSlug": "stone-game-iii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 90842, "totalSubmissionRaw": 142387}, "1407": {"acRate": 57.609295453736344, "difficulty": "Easy", "likes": 633, "dislikes": 67, "categoryTitle": "Database", "frontendQuestionId": "1407", "paidOnly": false, "title": "Top Travellers", "titleSlug": "top-travellers", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 129455, "totalSubmissionRaw": 224712}, "1408": {"acRate": 64.06769583883523, "difficulty": "Easy", "likes": 904, "dislikes": 88, "categoryTitle": "Algorithms", "frontendQuestionId": "1408", "paidOnly": false, "title": "String Matching in an Array", "titleSlug": "string-matching-in-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 92672, "totalSubmissionRaw": 144647}, "1409": {"acRate": 84.3360859876786, "difficulty": "Medium", "likes": 491, "dislikes": 627, "categoryTitle": "Algorithms", "frontendQuestionId": "1409", "paidOnly": false, "title": "Queries on a Permutation With Key", "titleSlug": "queries-on-a-permutation-with-key", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 51472, "totalSubmissionRaw": 61032}, "1410": {"acRate": 50.86740892704205, "difficulty": "Medium", "likes": 191, "dislikes": 322, "categoryTitle": "Algorithms", "frontendQuestionId": "1410", "paidOnly": false, "title": "HTML Entity Parser", "titleSlug": "html-entity-parser", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25539, "totalSubmissionRaw": 50207}, "1411": {"acRate": 63.76653811377854, "difficulty": "Hard", "likes": 1081, "dislikes": 51, "categoryTitle": "Algorithms", "frontendQuestionId": "1411", "paidOnly": false, "title": "Number of Ways to Paint N \u00d7 3 Grid", "titleSlug": "number-of-ways-to-paint-n-3-grid", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34557, "totalSubmissionRaw": 54193}, "1412": {"acRate": 58.871574422353575, "difficulty": "Hard", "likes": 215, "dislikes": 25, "categoryTitle": "Database", "frontendQuestionId": "1412", "paidOnly": true, "title": "Find the Quiet Students in All Exams", "titleSlug": "find-the-quiet-students-in-all-exams", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27390, "totalSubmissionRaw": 46525}, "1413": {"acRate": 65.43472607489598, "difficulty": "Easy", "likes": 1560, "dislikes": 335, "categoryTitle": "Algorithms", "frontendQuestionId": "1413", "paidOnly": false, "title": "Minimum Value to Get Positive Step by Step Sum", "titleSlug": "minimum-value-to-get-positive-step-by-step-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 150969, "totalSubmissionRaw": 230718}, "1414": {"acRate": 65.39019694950392, "difficulty": "Medium", "likes": 1016, "dislikes": 67, "categoryTitle": "Algorithms", "frontendQuestionId": "1414", "paidOnly": false, "title": "Find the Minimum Number of Fibonacci Numbers Whose Sum Is K", "titleSlug": "find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 44158, "totalSubmissionRaw": 67530}, "1415": {"acRate": 74.88195197236665, "difficulty": "Medium", "likes": 968, "dislikes": 27, "categoryTitle": "Algorithms", "frontendQuestionId": "1415", "paidOnly": false, "title": "The k-th Lexicographical String of All Happy Strings of Length n", "titleSlug": "the-k-th-lexicographical-string-of-all-happy-strings-of-length-n", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 40756, "totalSubmissionRaw": 54427}, "1416": {"acRate": 47.46342783464128, "difficulty": "Hard", "likes": 1600, "dislikes": 52, "categoryTitle": "Algorithms", "frontendQuestionId": "1416", "paidOnly": false, "title": "Restore The Array", "titleSlug": "restore-the-array", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 59634, "totalSubmissionRaw": 125642}, "1417": {"acRate": 52.65491405905686, "difficulty": "Easy", "likes": 591, "dislikes": 106, "categoryTitle": "Algorithms", "frontendQuestionId": "1417", "paidOnly": false, "title": "Reformat The String", "titleSlug": "reformat-the-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 59737, "totalSubmissionRaw": 113450}, "1418": {"acRate": 75.0069614965952, "difficulty": "Medium", "likes": 393, "dislikes": 479, "categoryTitle": "Algorithms", "frontendQuestionId": "1418", "paidOnly": false, "title": "Display Table of Food Orders in a Restaurant", "titleSlug": "display-table-of-food-orders-in-a-restaurant", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29630, "totalSubmissionRaw": 39503}, "1419": {"acRate": 50.37293791651355, "difficulty": "Medium", "likes": 1037, "dislikes": 89, "categoryTitle": "Algorithms", "frontendQuestionId": "1419", "paidOnly": false, "title": "Minimum Number of Frogs Croaking", "titleSlug": "minimum-number-of-frogs-croaking", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 50719, "totalSubmissionRaw": 100687}, "1420": {"acRate": 68.1761124709722, "difficulty": "Hard", "likes": 1353, "dislikes": 90, "categoryTitle": "Algorithms", "frontendQuestionId": "1420", "paidOnly": false, "title": "Build Array Where You Can Find The Maximum Exactly K Comparisons", "titleSlug": "build-array-where-you-can-find-the-maximum-exactly-k-comparisons", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 65175, "totalSubmissionRaw": 95598}, "1421": {"acRate": 82.82770116684345, "difficulty": "Easy", "likes": 58, "dislikes": 295, "categoryTitle": "Database", "frontendQuestionId": "1421", "paidOnly": true, "title": "NPV Queries", "titleSlug": "npv-queries", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 27329, "totalSubmissionRaw": 32995}, "1422": {"acRate": 62.25895420459121, "difficulty": "Easy", "likes": 1547, "dislikes": 66, "categoryTitle": "Algorithms", "frontendQuestionId": "1422", "paidOnly": false, "title": "Maximum Score After Splitting a String", "titleSlug": "maximum-score-after-splitting-a-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 165465, "totalSubmissionRaw": 265769}, "1423": {"acRate": 53.65579544153019, "difficulty": "Medium", "likes": 6195, "dislikes": 242, "categoryTitle": "Algorithms", "frontendQuestionId": "1423", "paidOnly": false, "title": "Maximum Points You Can Obtain from Cards", "titleSlug": "maximum-points-you-can-obtain-from-cards", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 299819, "totalSubmissionRaw": 558783}, "1424": {"acRate": 57.08693091807875, "difficulty": "Medium", "likes": 2165, "dislikes": 152, "categoryTitle": "Algorithms", "frontendQuestionId": "1424", "paidOnly": false, "title": "Diagonal Traverse II", "titleSlug": "diagonal-traverse-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 137656, "totalSubmissionRaw": 241134}, "1425": {"acRate": 56.57299057977772, "difficulty": "Hard", "likes": 2131, "dislikes": 103, "categoryTitle": "Algorithms", "frontendQuestionId": "1425", "paidOnly": false, "title": "Constrained Subsequence Sum", "titleSlug": "constrained-subsequence-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Monotonic Queue", "id": "VG9waWNUYWdOb2RlOjYxMDcx", "slug": "monotonic-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 78852, "totalSubmissionRaw": 139381}, "1426": {"acRate": 60.258851105027404, "difficulty": "Easy", "likes": 155, "dislikes": 51, "categoryTitle": "Algorithms", "frontendQuestionId": "1426", "paidOnly": true, "title": "Counting Elements", "titleSlug": "counting-elements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 130084, "totalSubmissionRaw": 215876}, "1427": {"acRate": 54.787649466767206, "difficulty": "Easy", "likes": 246, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "1427", "paidOnly": true, "title": "Perform String Shifts", "titleSlug": "perform-string-shifts", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 81375, "totalSubmissionRaw": 148528}, "1428": {"acRate": 54.557938288338946, "difficulty": "Medium", "likes": 1223, "dislikes": 149, "categoryTitle": "Algorithms", "frontendQuestionId": "1428", "paidOnly": true, "title": "Leftmost Column with at Least a One", "titleSlug": "leftmost-column-with-at-least-a-one", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 184348, "totalSubmissionRaw": 337894}, "1429": {"acRate": 53.905719923560056, "difficulty": "Medium", "likes": 555, "dislikes": 32, "categoryTitle": "Algorithms", "frontendQuestionId": "1429", "paidOnly": true, "title": "First Unique Number", "titleSlug": "first-unique-number", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Data Stream", "id": "VG9waWNUYWdOb2RlOjYxMDYz", "slug": "data-stream"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 86599, "totalSubmissionRaw": 160649}, "1430": {"acRate": 46.98040948593313, "difficulty": "Medium", "likes": 215, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "1430", "paidOnly": true, "title": "Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree", "titleSlug": "check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 44653, "totalSubmissionRaw": 95046}, "1431": {"acRate": 87.66105925418337, "difficulty": "Easy", "likes": 4465, "dislikes": 568, "categoryTitle": "Algorithms", "frontendQuestionId": "1431", "paidOnly": false, "title": "Kids With the Greatest Number of Candies", "titleSlug": "kids-with-the-greatest-number-of-candies", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 987584, "totalSubmissionRaw": 1126594}, "1432": {"acRate": 41.06369955843134, "difficulty": "Medium", "likes": 232, "dislikes": 293, "categoryTitle": "Algorithms", "frontendQuestionId": "1432", "paidOnly": false, "title": "Max Difference You Can Get From Changing an Integer", "titleSlug": "max-difference-you-can-get-from-changing-an-integer", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18785, "totalSubmissionRaw": 45746}, "1433": {"acRate": 69.84807779924903, "difficulty": "Medium", "likes": 757, "dislikes": 148, "categoryTitle": "Algorithms", "frontendQuestionId": "1433", "paidOnly": false, "title": "Check If a String Can Break Another String", "titleSlug": "check-if-a-string-can-break-another-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 44459, "totalSubmissionRaw": 63651}, "1434": {"acRate": 43.91989774179804, "difficulty": "Hard", "likes": 898, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "1434", "paidOnly": false, "title": "Number of Ways to Wear Different Hats to Each Other", "titleSlug": "number-of-ways-to-wear-different-hats-to-each-other", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 15462, "totalSubmissionRaw": 35205}, "1435": {"acRate": 75.10380070265091, "difficulty": "Easy", "likes": 153, "dislikes": 260, "categoryTitle": "Database", "frontendQuestionId": "1435", "paidOnly": true, "title": "Create a Session Bar Chart", "titleSlug": "create-a-session-bar-chart", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23515, "totalSubmissionRaw": 31310}, "1436": {"acRate": 79.46740223842093, "difficulty": "Easy", "likes": 2211, "dislikes": 103, "categoryTitle": "Algorithms", "frontendQuestionId": "1436", "paidOnly": false, "title": "Destination City", "titleSlug": "destination-city", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 275705, "totalSubmissionRaw": 346940}, "1437": {"acRate": 58.05752902443251, "difficulty": "Easy", "likes": 629, "dislikes": 224, "categoryTitle": "Algorithms", "frontendQuestionId": "1437", "paidOnly": false, "title": "Check If All 1's Are at Least Length K Places Away", "titleSlug": "check-if-all-1s-are-at-least-length-k-places-away", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 80412, "totalSubmissionRaw": 138504}, "1438": {"acRate": 56.60650084378898, "difficulty": "Medium", "likes": 4061, "dislikes": 192, "categoryTitle": "Algorithms", "frontendQuestionId": "1438", "paidOnly": false, "title": "Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit", "titleSlug": "longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}, {"name": "Monotonic Queue", "id": "VG9waWNUYWdOb2RlOjYxMDcx", "slug": "monotonic-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 231446, "totalSubmissionRaw": 408869}, "1439": {"acRate": 61.812365619592015, "difficulty": "Hard", "likes": 1231, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "1439", "paidOnly": false, "title": "Find the Kth Smallest Sum of a Matrix With Sorted Rows", "titleSlug": "find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 35361, "totalSubmissionRaw": 57207}, "1440": {"acRate": 72.60895957265994, "difficulty": "Medium", "likes": 214, "dislikes": 25, "categoryTitle": "Database", "frontendQuestionId": "1440", "paidOnly": true, "title": "Evaluate Boolean Expression", "titleSlug": "evaluate-boolean-expression", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29904, "totalSubmissionRaw": 41185}, "1441": {"acRate": 79.9975548282737, "difficulty": "Medium", "likes": 986, "dislikes": 482, "categoryTitle": "Algorithms", "frontendQuestionId": "1441", "paidOnly": false, "title": "Build an Array With Stack Operations", "titleSlug": "build-an-array-with-stack-operations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 170126, "totalSubmissionRaw": 212664}, "1442": {"acRate": 84.96079685028771, "difficulty": "Medium", "likes": 1930, "dislikes": 129, "categoryTitle": "Algorithms", "frontendQuestionId": "1442", "paidOnly": false, "title": "Count Triplets That Can Form Two Arrays of Equal XOR", "titleSlug": "count-triplets-that-can-form-two-arrays-of-equal-xor", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 126239, "totalSubmissionRaw": 148585}, "1443": {"acRate": 62.46536062941066, "difficulty": "Medium", "likes": 3654, "dislikes": 321, "categoryTitle": "Algorithms", "frontendQuestionId": "1443", "paidOnly": false, "title": "Minimum Time to Collect All Apples in a Tree", "titleSlug": "minimum-time-to-collect-all-apples-in-a-tree", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 123301, "totalSubmissionRaw": 197391}, "1444": {"acRate": 62.04379562043796, "difficulty": "Hard", "likes": 1835, "dislikes": 95, "categoryTitle": "Algorithms", "frontendQuestionId": "1444", "paidOnly": false, "title": "Number of Ways of Cutting a Pizza", "titleSlug": "number-of-ways-of-cutting-a-pizza", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 68935, "totalSubmissionRaw": 111106}, "1445": {"acRate": 86.30040837161818, "difficulty": "Medium", "likes": 240, "dislikes": 23, "categoryTitle": "Database", "frontendQuestionId": "1445", "paidOnly": true, "title": "Apples & Oranges", "titleSlug": "apples-oranges", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 54100, "totalSubmissionRaw": 62688}, "1446": {"acRate": 60.31411084165328, "difficulty": "Easy", "likes": 1743, "dislikes": 34, "categoryTitle": "Algorithms", "frontendQuestionId": "1446", "paidOnly": false, "title": "Consecutive Characters", "titleSlug": "consecutive-characters", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 172353, "totalSubmissionRaw": 285759}, "1447": {"acRate": 67.0873031304686, "difficulty": "Medium", "likes": 416, "dislikes": 43, "categoryTitle": "Algorithms", "frontendQuestionId": "1447", "paidOnly": false, "title": "Simplified Fractions", "titleSlug": "simplified-fractions", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34503, "totalSubmissionRaw": 51430}, "1448": {"acRate": 73.04703831589072, "difficulty": "Medium", "likes": 5863, "dislikes": 174, "categoryTitle": "Algorithms", "frontendQuestionId": "1448", "paidOnly": false, "title": "Count Good Nodes in Binary Tree", "titleSlug": "count-good-nodes-in-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 546861, "totalSubmissionRaw": 748643}, "1449": {"acRate": 48.358379402527966, "difficulty": "Hard", "likes": 694, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "1449", "paidOnly": false, "title": "Form Largest Integer With Digits That Add up to Target", "titleSlug": "form-largest-integer-with-digits-that-add-up-to-target", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18632, "totalSubmissionRaw": 38529}, "1450": {"acRate": 75.68523272952028, "difficulty": "Easy", "likes": 879, "dislikes": 154, "categoryTitle": "Algorithms", "frontendQuestionId": "1450", "paidOnly": false, "title": "Number of Students Doing Homework at a Given Time", "titleSlug": "number-of-students-doing-homework-at-a-given-time", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 127351, "totalSubmissionRaw": 168264}, "1451": {"acRate": 64.78587646765988, "difficulty": "Medium", "likes": 758, "dislikes": 74, "categoryTitle": "Algorithms", "frontendQuestionId": "1451", "paidOnly": false, "title": "Rearrange Words in a Sentence", "titleSlug": "rearrange-words-in-a-sentence", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 53357, "totalSubmissionRaw": 82359}, "1452": {"acRate": 58.09092372433141, "difficulty": "Medium", "likes": 354, "dislikes": 226, "categoryTitle": "Algorithms", "frontendQuestionId": "1452", "paidOnly": false, "title": "People Whose List of Favorite Companies Is Not a Subset of Another List", "titleSlug": "people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25262, "totalSubmissionRaw": 43487}, "1453": {"acRate": 38.270869332062205, "difficulty": "Hard", "likes": 146, "dislikes": 269, "categoryTitle": "Algorithms", "frontendQuestionId": "1453", "paidOnly": false, "title": "Maximum Number of Darts Inside of a Circular Dartboard", "titleSlug": "maximum-number-of-darts-inside-of-a-circular-dartboard", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6423, "totalSubmissionRaw": 16783}, "1454": {"acRate": 36.583278896668475, "difficulty": "Medium", "likes": 404, "dislikes": 39, "categoryTitle": "Database", "frontendQuestionId": "1454", "paidOnly": true, "title": "Active Users", "titleSlug": "active-users", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 39762, "totalSubmissionRaw": 108689}, "1455": {"acRate": 64.40009606520039, "difficulty": "Easy", "likes": 829, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "1455", "paidOnly": false, "title": "Check If a Word Occurs As a Prefix of Any Word in a Sentence", "titleSlug": "check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 83127, "totalSubmissionRaw": 129079}, "1456": {"acRate": 58.87762930915122, "difficulty": "Medium", "likes": 3508, "dislikes": 132, "categoryTitle": "Algorithms", "frontendQuestionId": "1456", "paidOnly": false, "title": "Maximum Number of Vowels in a Substring of Given Length", "titleSlug": "maximum-number-of-vowels-in-a-substring-of-given-length", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 361446, "totalSubmissionRaw": 613894}, "1457": {"acRate": 68.35113697110526, "difficulty": "Medium", "likes": 3257, "dislikes": 129, "categoryTitle": "Algorithms", "frontendQuestionId": "1457", "paidOnly": false, "title": "Pseudo-Palindromic Paths in a Binary Tree", "titleSlug": "pseudo-palindromic-paths-in-a-binary-tree", "topicTags": [{"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 221200, "totalSubmissionRaw": 323623}, "1458": {"acRate": 62.45743518269216, "difficulty": "Hard", "likes": 1657, "dislikes": 33, "categoryTitle": "Algorithms", "frontendQuestionId": "1458", "paidOnly": false, "title": "Max Dot Product of Two Subsequences", "titleSlug": "max-dot-product-of-two-subsequences", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 78870, "totalSubmissionRaw": 126278}, "1459": {"acRate": 68.52955008622041, "difficulty": "Medium", "likes": 96, "dislikes": 161, "categoryTitle": "Database", "frontendQuestionId": "1459", "paidOnly": true, "title": "Rectangles Area", "titleSlug": "rectangles-area", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17486, "totalSubmissionRaw": 25516}, "1460": {"acRate": 75.97346772782028, "difficulty": "Easy", "likes": 1444, "dislikes": 160, "categoryTitle": "Algorithms", "frontendQuestionId": "1460", "paidOnly": false, "title": "Make Two Arrays Equal by Reversing Subarrays", "titleSlug": "make-two-arrays-equal-by-reversing-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 295163, "totalSubmissionRaw": 388508}, "1461": {"acRate": 56.54021772483501, "difficulty": "Medium", "likes": 2242, "dislikes": 98, "categoryTitle": "Algorithms", "frontendQuestionId": "1461", "paidOnly": false, "title": "Check If a String Contains All Binary Codes of Size K", "titleSlug": "check-if-a-string-contains-all-binary-codes-of-size-k", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 123455, "totalSubmissionRaw": 218349}, "1462": {"acRate": 50.10084679919322, "difficulty": "Medium", "likes": 1469, "dislikes": 66, "categoryTitle": "Algorithms", "frontendQuestionId": "1462", "paidOnly": false, "title": "Course Schedule IV", "titleSlug": "course-schedule-iv", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 63839, "totalSubmissionRaw": 127421}, "1463": {"acRate": 71.85250632254717, "difficulty": "Hard", "likes": 4121, "dislikes": 48, "categoryTitle": "Algorithms", "frontendQuestionId": "1463", "paidOnly": false, "title": "Cherry Pickup II", "titleSlug": "cherry-pickup-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 177286, "totalSubmissionRaw": 246736}, "1464": {"acRate": 82.8339789553488, "difficulty": "Easy", "likes": 2477, "dislikes": 236, "categoryTitle": "Algorithms", "frontendQuestionId": "1464", "paidOnly": false, "title": "Maximum Product of Two Elements in an Array", "titleSlug": "maximum-product-of-two-elements-in-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 388967, "totalSubmissionRaw": 469574}, "1465": {"acRate": 41.08145964597192, "difficulty": "Medium", "likes": 2619, "dislikes": 350, "categoryTitle": "Algorithms", "frontendQuestionId": "1465", "paidOnly": false, "title": "Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts", "titleSlug": "maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 168351, "totalSubmissionRaw": 409798}, "1466": {"acRate": 64.51823081399762, "difficulty": "Medium", "likes": 4185, "dislikes": 122, "categoryTitle": "Algorithms", "frontendQuestionId": "1466", "paidOnly": false, "title": "Reorder Routes to Make All Paths Lead to the City Zero", "titleSlug": "reorder-routes-to-make-all-paths-lead-to-the-city-zero", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 203982, "totalSubmissionRaw": 316163}, "1467": {"acRate": 60.6267217630854, "difficulty": "Hard", "likes": 284, "dislikes": 172, "categoryTitle": "Algorithms", "frontendQuestionId": "1467", "paidOnly": false, "title": "Probability of a Two Boxes Having The Same Number of Distinct Balls", "titleSlug": "probability-of-a-two-boxes-having-the-same-number-of-distinct-balls", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}, {"name": "Probability and Statistics", "id": "VG9waWNUYWdOb2RlOjYxMDc5", "slug": "probability-and-statistics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8803, "totalSubmissionRaw": 14520}, "1468": {"acRate": 78.39887200375999, "difficulty": "Medium", "likes": 127, "dislikes": 22, "categoryTitle": "Database", "frontendQuestionId": "1468", "paidOnly": true, "title": "Calculate Salaries", "titleSlug": "calculate-salaries", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25021, "totalSubmissionRaw": 31915}, "1469": {"acRate": 83.70197904540163, "difficulty": "Easy", "likes": 508, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "1469", "paidOnly": true, "title": "Find All The Lonely Nodes", "titleSlug": "find-all-the-lonely-nodes", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 56082, "totalSubmissionRaw": 67002}, "1470": {"acRate": 88.59534598897734, "difficulty": "Easy", "likes": 5767, "dislikes": 310, "categoryTitle": "Algorithms", "frontendQuestionId": "1470", "paidOnly": false, "title": "Shuffle the Array", "titleSlug": "shuffle-the-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 723380, "totalSubmissionRaw": 816497}, "1471": {"acRate": 61.37007070035118, "difficulty": "Medium", "likes": 699, "dislikes": 155, "categoryTitle": "Algorithms", "frontendQuestionId": "1471", "paidOnly": false, "title": "The k Strongest Values in an Array", "titleSlug": "the-k-strongest-values-in-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 39668, "totalSubmissionRaw": 64638}, "1472": {"acRate": 77.66129362511774, "difficulty": "Medium", "likes": 3860, "dislikes": 239, "categoryTitle": "Algorithms", "frontendQuestionId": "1472", "paidOnly": false, "title": "Design Browser History", "titleSlug": "design-browser-history", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Doubly-Linked List", "id": "VG9waWNUYWdOb2RlOjYxMDU4", "slug": "doubly-linked-list"}, {"name": "Data Stream", "id": "VG9waWNUYWdOb2RlOjYxMDYz", "slug": "data-stream"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 246535, "totalSubmissionRaw": 317448}, "1473": {"acRate": 61.00058824096665, "difficulty": "Hard", "likes": 2065, "dislikes": 152, "categoryTitle": "Algorithms", "frontendQuestionId": "1473", "paidOnly": false, "title": "Paint House III", "titleSlug": "paint-house-iii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 63257, "totalSubmissionRaw": 103699}, "1474": {"acRate": 73.24526680087764, "difficulty": "Easy", "likes": 405, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "1474", "paidOnly": true, "title": "Delete N Nodes After M Nodes of a Linked List", "titleSlug": "delete-n-nodes-after-m-nodes-of-a-linked-list", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 32381, "totalSubmissionRaw": 44209}, "1475": {"acRate": 78.33019355972239, "difficulty": "Easy", "likes": 2132, "dislikes": 120, "categoryTitle": "Algorithms", "frontendQuestionId": "1475", "paidOnly": false, "title": "Final Prices With a Special Discount in a Shop", "titleSlug": "final-prices-with-a-special-discount-in-a-shop", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 160497, "totalSubmissionRaw": 204898}, "1476": {"acRate": 88.23166731220704, "difficulty": "Medium", "likes": 633, "dislikes": 1442, "categoryTitle": "Algorithms", "frontendQuestionId": "1476", "paidOnly": false, "title": "Subrectangle Queries", "titleSlug": "subrectangle-queries", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 111620, "totalSubmissionRaw": 126508}, "1477": {"acRate": 36.52875275564484, "difficulty": "Medium", "likes": 1701, "dislikes": 86, "categoryTitle": "Algorithms", "frontendQuestionId": "1477", "paidOnly": false, "title": "Find Two Non-overlapping Sub-arrays Each With Target Sum", "titleSlug": "find-two-non-overlapping-sub-arrays-each-with-target-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 48550, "totalSubmissionRaw": 132909}, "1478": {"acRate": 55.41755153699294, "difficulty": "Hard", "likes": 1112, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "1478", "paidOnly": false, "title": "Allocate Mailboxes", "titleSlug": "allocate-mailboxes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25834, "totalSubmissionRaw": 46617}, "1479": {"acRate": 77.46472851646003, "difficulty": "Hard", "likes": 152, "dislikes": 39, "categoryTitle": "Database", "frontendQuestionId": "1479", "paidOnly": true, "title": "Sales by Day of the Week", "titleSlug": "sales-by-day-of-the-week", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 18119, "totalSubmissionRaw": 23390}, "1480": {"acRate": 86.83060792563722, "difficulty": "Easy", "likes": 7896, "dislikes": 345, "categoryTitle": "Algorithms", "frontendQuestionId": "1480", "paidOnly": false, "title": "Running Sum of 1d Array", "titleSlug": "running-sum-of-1d-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 1881890, "totalSubmissionRaw": 2167313}, "1481": {"acRate": 63.10146938260704, "difficulty": "Medium", "likes": 2245, "dislikes": 226, "categoryTitle": "Algorithms", "frontendQuestionId": "1481", "paidOnly": false, "title": "Least Number of Unique Integers after K Removals", "titleSlug": "least-number-of-unique-integers-after-k-removals", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 250148, "totalSubmissionRaw": 396420}, "1482": {"acRate": 55.78611282935637, "difficulty": "Medium", "likes": 4654, "dislikes": 226, "categoryTitle": "Algorithms", "frontendQuestionId": "1482", "paidOnly": false, "title": "Minimum Number of Days to Make m Bouquets", "titleSlug": "minimum-number-of-days-to-make-m-bouquets", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 267848, "totalSubmissionRaw": 480137}, "1483": {"acRate": 34.84448152783572, "difficulty": "Hard", "likes": 1932, "dislikes": 119, "categoryTitle": "Algorithms", "frontendQuestionId": "1483", "paidOnly": false, "title": "Kth Ancestor of a Tree Node", "titleSlug": "kth-ancestor-of-a-tree-node", "topicTags": [{"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 37585, "totalSubmissionRaw": 107865}, "1484": {"acRate": 77.05924018678098, "difficulty": "Easy", "likes": 1424, "dislikes": 108, "categoryTitle": "Database", "frontendQuestionId": "1484", "paidOnly": false, "title": "Group Sold Products By The Date", "titleSlug": "group-sold-products-by-the-date", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 229550, "totalSubmissionRaw": 297888}, "1485": {"acRate": 80.71052053591039, "difficulty": "Medium", "likes": 421, "dislikes": 86, "categoryTitle": "Algorithms", "frontendQuestionId": "1485", "paidOnly": true, "title": "Clone Binary Tree With Random Pointer", "titleSlug": "clone-binary-tree-with-random-pointer", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 29398, "totalSubmissionRaw": 36424}, "1486": {"acRate": 86.10642631154225, "difficulty": "Easy", "likes": 1388, "dislikes": 333, "categoryTitle": "Algorithms", "frontendQuestionId": "1486", "paidOnly": false, "title": "XOR Operation in an Array", "titleSlug": "xor-operation-in-an-array", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 201669, "totalSubmissionRaw": 234209}, "1487": {"acRate": 37.199587695980036, "difficulty": "Medium", "likes": 444, "dislikes": 719, "categoryTitle": "Algorithms", "frontendQuestionId": "1487", "paidOnly": false, "title": "Making File Names Unique", "titleSlug": "making-file-names-unique", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34285, "totalSubmissionRaw": 92165}, "1488": {"acRate": 27.026535276051295, "difficulty": "Medium", "likes": 1530, "dislikes": 292, "categoryTitle": "Algorithms", "frontendQuestionId": "1488", "paidOnly": false, "title": "Avoid Flood in The City", "titleSlug": "avoid-flood-in-the-city", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 37135, "totalSubmissionRaw": 137402}, "1489": {"acRate": 67.52358031894204, "difficulty": "Hard", "likes": 1849, "dislikes": 158, "categoryTitle": "Algorithms", "frontendQuestionId": "1489", "paidOnly": false, "title": "Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree", "titleSlug": "find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree", "topicTags": [{"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Minimum Spanning Tree", "id": "VG9waWNUYWdOb2RlOjYxMDgz", "slug": "minimum-spanning-tree"}, {"name": "Strongly Connected Component", "id": "VG9waWNUYWdOb2RlOjYxMDg1", "slug": "strongly-connected-component"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 55553, "totalSubmissionRaw": 82272}, "1490": {"acRate": 83.11020430979066, "difficulty": "Medium", "likes": 409, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "1490", "paidOnly": true, "title": "Clone N-ary Tree", "titleSlug": "clone-n-ary-tree", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 29734, "totalSubmissionRaw": 35777}, "1491": {"acRate": 63.477932399004665, "difficulty": "Easy", "likes": 2226, "dislikes": 187, "categoryTitle": "Algorithms", "frontendQuestionId": "1491", "paidOnly": false, "title": "Average Salary Excluding the Minimum and Maximum Salary", "titleSlug": "average-salary-excluding-the-minimum-and-maximum-salary", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 346175, "totalSubmissionRaw": 545347}, "1492": {"acRate": 68.2245752144259, "difficulty": "Medium", "likes": 1785, "dislikes": 293, "categoryTitle": "Algorithms", "frontendQuestionId": "1492", "paidOnly": false, "title": "The kth Factor of n", "titleSlug": "the-kth-factor-of-n", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 251673, "totalSubmissionRaw": 368890}, "1493": {"acRate": 67.75840962852392, "difficulty": "Medium", "likes": 3970, "dislikes": 83, "categoryTitle": "Algorithms", "frontendQuestionId": "1493", "paidOnly": false, "title": "Longest Subarray of 1's After Deleting One Element", "titleSlug": "longest-subarray-of-1s-after-deleting-one-element", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 302768, "totalSubmissionRaw": 446833}, "1494": {"acRate": 29.497101628021703, "difficulty": "Hard", "likes": 1041, "dislikes": 72, "categoryTitle": "Algorithms", "frontendQuestionId": "1494", "paidOnly": false, "title": "Parallel Courses II", "titleSlug": "parallel-courses-ii", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19133, "totalSubmissionRaw": 64864}, "1495": {"acRate": 49.013387571719136, "difficulty": "Easy", "likes": 86, "dislikes": 38, "categoryTitle": "Database", "frontendQuestionId": "1495", "paidOnly": true, "title": "Friendly Movies Streamed Last Month", "titleSlug": "friendly-movies-streamed-last-month", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 32291, "totalSubmissionRaw": 65882}, "1496": {"acRate": 62.468189541249764, "difficulty": "Easy", "likes": 1471, "dislikes": 46, "categoryTitle": "Algorithms", "frontendQuestionId": "1496", "paidOnly": false, "title": "Path Crossing", "titleSlug": "path-crossing", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 165447, "totalSubmissionRaw": 264848}, "1497": {"acRate": 38.4678076609617, "difficulty": "Medium", "likes": 1746, "dislikes": 92, "categoryTitle": "Algorithms", "frontendQuestionId": "1497", "paidOnly": false, "title": "Check If Array Pairs Are Divisible by k", "titleSlug": "check-if-array-pairs-are-divisible-by-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 52864, "totalSubmissionRaw": 137424}, "1498": {"acRate": 43.62879179911781, "difficulty": "Medium", "likes": 3913, "dislikes": 373, "categoryTitle": "Algorithms", "frontendQuestionId": "1498", "paidOnly": false, "title": "Number of Subsequences That Satisfy the Given Sum Condition", "titleSlug": "number-of-subsequences-that-satisfy-the-given-sum-condition", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 123934, "totalSubmissionRaw": 284064}, "1499": {"acRate": 44.13879368080999, "difficulty": "Hard", "likes": 1326, "dislikes": 60, "categoryTitle": "Algorithms", "frontendQuestionId": "1499", "paidOnly": false, "title": "Max Value of Equation", "titleSlug": "max-value-of-equation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Monotonic Queue", "id": "VG9waWNUYWdOb2RlOjYxMDcx", "slug": "monotonic-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 44815, "totalSubmissionRaw": 101532}, "1500": {"acRate": 43.214320459188635, "difficulty": "Medium", "likes": 49, "dislikes": 121, "categoryTitle": "Algorithms", "frontendQuestionId": "1500", "paidOnly": true, "title": "Design a File Sharing System", "titleSlug": "design-a-file-sharing-system", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Data Stream", "id": "VG9waWNUYWdOb2RlOjYxMDYz", "slug": "data-stream"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4442, "totalSubmissionRaw": 10279}, "1501": {"acRate": 50.19744453946375, "difficulty": "Medium", "likes": 296, "dislikes": 145, "categoryTitle": "Database", "frontendQuestionId": "1501", "paidOnly": true, "title": "Countries You Can Safely Invest In", "titleSlug": "countries-you-can-safely-invest-in", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 39915, "totalSubmissionRaw": 79516}, "1502": {"acRate": 69.57401537668491, "difficulty": "Easy", "likes": 2168, "dislikes": 112, "categoryTitle": "Algorithms", "frontendQuestionId": "1502", "paidOnly": false, "title": "Can Make Arithmetic Progression From Sequence", "titleSlug": "can-make-arithmetic-progression-from-sequence", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 253742, "totalSubmissionRaw": 364708}, "1503": {"acRate": 68.51245681032914, "difficulty": "Medium", "likes": 1498, "dislikes": 409, "categoryTitle": "Algorithms", "frontendQuestionId": "1503", "paidOnly": false, "title": "Last Moment Before All Ants Fall Out of a Plank", "titleSlug": "last-moment-before-all-ants-fall-out-of-a-plank", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Brainteaser", "id": "VG9waWNUYWdOb2RlOjMy", "slug": "brainteaser"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 90420, "totalSubmissionRaw": 131976}, "1504": {"acRate": 57.22822932565188, "difficulty": "Medium", "likes": 2108, "dislikes": 163, "categoryTitle": "Algorithms", "frontendQuestionId": "1504", "paidOnly": false, "title": "Count Submatrices With All Ones", "titleSlug": "count-submatrices-with-all-ones", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 53244, "totalSubmissionRaw": 93038}, "1505": {"acRate": 39.74286254490452, "difficulty": "Hard", "likes": 486, "dislikes": 26, "categoryTitle": "Algorithms", "frontendQuestionId": "1505", "paidOnly": false, "title": "Minimum Possible Integer After at Most K Adjacent Swaps On Digits", "titleSlug": "minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10510, "totalSubmissionRaw": 26445}, "1506": {"acRate": 78.39059073692604, "difficulty": "Medium", "likes": 473, "dislikes": 201, "categoryTitle": "Algorithms", "frontendQuestionId": "1506", "paidOnly": true, "title": "Find Root of N-Ary Tree", "titleSlug": "find-root-of-n-ary-tree", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 35391, "totalSubmissionRaw": 45147}, "1507": {"acRate": 66.46510153914674, "difficulty": "Easy", "likes": 469, "dislikes": 435, "categoryTitle": "Algorithms", "frontendQuestionId": "1507", "paidOnly": false, "title": "Reformat Date", "titleSlug": "reformat-date", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 77600, "totalSubmissionRaw": 116753}, "1508": {"acRate": 63.233499970243415, "difficulty": "Medium", "likes": 1502, "dislikes": 251, "categoryTitle": "Algorithms", "frontendQuestionId": "1508", "paidOnly": false, "title": "Range Sum of Sorted Subarray Sums", "titleSlug": "range-sum-of-sorted-subarray-sums", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 170001, "totalSubmissionRaw": 268847}, "1509": {"acRate": 59.21909280176736, "difficulty": "Medium", "likes": 2471, "dislikes": 276, "categoryTitle": "Algorithms", "frontendQuestionId": "1509", "paidOnly": false, "title": "Minimum Difference Between Largest and Smallest Value in Three Moves", "titleSlug": "minimum-difference-between-largest-and-smallest-value-in-three-moves", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 232673, "totalSubmissionRaw": 392902}, "1510": {"acRate": 59.67933156438774, "difficulty": "Hard", "likes": 1598, "dislikes": 70, "categoryTitle": "Algorithms", "frontendQuestionId": "1510", "paidOnly": false, "title": "Stone Game IV", "titleSlug": "stone-game-iv", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 73996, "totalSubmissionRaw": 123990}, "1511": {"acRate": 67.75198143909313, "difficulty": "Easy", "likes": 318, "dislikes": 57, "categoryTitle": "Database", "frontendQuestionId": "1511", "paidOnly": true, "title": "Customer Order Frequency", "titleSlug": "customer-order-frequency", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 43511, "totalSubmissionRaw": 64221}, "1512": {"acRate": 89.20559105326694, "difficulty": "Easy", "likes": 5442, "dislikes": 258, "categoryTitle": "Algorithms", "frontendQuestionId": "1512", "paidOnly": false, "title": "Number of Good Pairs", "titleSlug": "number-of-good-pairs", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 817274, "totalSubmissionRaw": 916167}, "1513": {"acRate": 46.97564417238878, "difficulty": "Medium", "likes": 872, "dislikes": 33, "categoryTitle": "Algorithms", "frontendQuestionId": "1513", "paidOnly": false, "title": "Number of Substrings With Only 1s", "titleSlug": "number-of-substrings-with-only-1s", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 47273, "totalSubmissionRaw": 100633}, "1514": {"acRate": 55.528681315405024, "difficulty": "Medium", "likes": 3144, "dislikes": 75, "categoryTitle": "Algorithms", "frontendQuestionId": "1514", "paidOnly": false, "title": "Path with Maximum Probability", "titleSlug": "path-with-maximum-probability", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 148999, "totalSubmissionRaw": 268328}, "1515": {"acRate": 35.06850602806045, "difficulty": "Hard", "likes": 234, "dislikes": 264, "categoryTitle": "Algorithms", "frontendQuestionId": "1515", "paidOnly": false, "title": "Best Position for a Service Centre", "titleSlug": "best-position-for-a-service-centre", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}, {"name": "Randomized", "id": "VG9waWNUYWdOb2RlOjYxMDc1", "slug": "randomized"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14922, "totalSubmissionRaw": 42551}, "1516": {"acRate": 61.86645213193886, "difficulty": "Hard", "likes": 33, "dislikes": 62, "categoryTitle": "Algorithms", "frontendQuestionId": "1516", "paidOnly": true, "title": "Move Sub-Tree of N-Ary Tree", "titleSlug": "move-sub-tree-of-n-ary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2307, "totalSubmissionRaw": 3729}, "1517": {"acRate": 44.245568052338214, "difficulty": "Easy", "likes": 461, "dislikes": 252, "categoryTitle": "Database", "frontendQuestionId": "1517", "paidOnly": false, "title": "Find Users With Valid E-Mails", "titleSlug": "find-users-with-valid-e-mails", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 129309, "totalSubmissionRaw": 292253}, "1518": {"acRate": 71.01284764981648, "difficulty": "Easy", "likes": 1673, "dislikes": 135, "categoryTitle": "Algorithms", "frontendQuestionId": "1518", "paidOnly": false, "title": "Water Bottles", "titleSlug": "water-bottles", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 235850, "totalSubmissionRaw": 332123}, "1519": {"acRate": 54.99201148793315, "difficulty": "Medium", "likes": 2256, "dislikes": 807, "categoryTitle": "Algorithms", "frontendQuestionId": "1519", "paidOnly": false, "title": "Number of Nodes in the Sub-Tree With the Same Label", "titleSlug": "number-of-nodes-in-the-sub-tree-with-the-same-label", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 85016, "totalSubmissionRaw": 154597}, "1520": {"acRate": 39.66023728736366, "difficulty": "Hard", "likes": 823, "dislikes": 77, "categoryTitle": "Algorithms", "frontendQuestionId": "1520", "paidOnly": false, "title": "Maximum Number of Non-Overlapping Substrings", "titleSlug": "maximum-number-of-non-overlapping-substrings", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17416, "totalSubmissionRaw": 43913}, "1521": {"acRate": 45.521687681070716, "difficulty": "Hard", "likes": 386, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "1521", "paidOnly": false, "title": "Find a Value of a Mysterious Function Closest to Target", "titleSlug": "find-a-value-of-a-mysterious-function-closest-to-target", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11156, "totalSubmissionRaw": 24507}, "1522": {"acRate": 74.46233382570162, "difficulty": "Medium", "likes": 608, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "1522", "paidOnly": true, "title": "Diameter of N-Ary Tree", "titleSlug": "diameter-of-n-ary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 50409, "totalSubmissionRaw": 67698}, "1523": {"acRate": 49.9778621355418, "difficulty": "Easy", "likes": 2746, "dislikes": 158, "categoryTitle": "Algorithms", "frontendQuestionId": "1523", "paidOnly": false, "title": "Count Odd Numbers in an Interval Range", "titleSlug": "count-odd-numbers-in-an-interval-range", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 344280, "totalSubmissionRaw": 688865}, "1524": {"acRate": 43.71089819311371, "difficulty": "Medium", "likes": 1353, "dislikes": 59, "categoryTitle": "Algorithms", "frontendQuestionId": "1524", "paidOnly": false, "title": "Number of Sub-arrays With Odd Sum", "titleSlug": "number-of-sub-arrays-with-odd-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 39964, "totalSubmissionRaw": 91428}, "1525": {"acRate": 68.31151001800262, "difficulty": "Medium", "likes": 2052, "dislikes": 49, "categoryTitle": "Algorithms", "frontendQuestionId": "1525", "paidOnly": false, "title": "Number of Good Ways to Split a String", "titleSlug": "number-of-good-ways-to-split-a-string", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 105488, "totalSubmissionRaw": 154422}, "1526": {"acRate": 70.78265512121061, "difficulty": "Hard", "likes": 1490, "dislikes": 71, "categoryTitle": "Algorithms", "frontendQuestionId": "1526", "paidOnly": false, "title": "Minimum Number of Increments on Subarrays to Form a Target Array", "titleSlug": "minimum-number-of-increments-on-subarrays-to-form-a-target-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 42425, "totalSubmissionRaw": 59936}, "1527": {"acRate": 40.337560157897585, "difficulty": "Easy", "likes": 654, "dislikes": 571, "categoryTitle": "Database", "frontendQuestionId": "1527", "paidOnly": false, "title": "Patients With a Condition", "titleSlug": "patients-with-a-condition", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 238705, "totalSubmissionRaw": 591771}, "1528": {"acRate": 84.8204525319333, "difficulty": "Easy", "likes": 2752, "dislikes": 521, "categoryTitle": "Algorithms", "frontendQuestionId": "1528", "paidOnly": false, "title": "Shuffle String", "titleSlug": "shuffle-string", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 401147, "totalSubmissionRaw": 472937}, "1529": {"acRate": 73.39229245122095, "difficulty": "Medium", "likes": 1025, "dislikes": 43, "categoryTitle": "Algorithms", "frontendQuestionId": "1529", "paidOnly": false, "title": "Minimum Suffix Flips", "titleSlug": "minimum-suffix-flips", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 55933, "totalSubmissionRaw": 76211}, "1530": {"acRate": 71.89631583851084, "difficulty": "Medium", "likes": 2389, "dislikes": 103, "categoryTitle": "Algorithms", "frontendQuestionId": "1530", "paidOnly": false, "title": "Number of Good Leaf Nodes Pairs", "titleSlug": "number-of-good-leaf-nodes-pairs", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 146616, "totalSubmissionRaw": 203927}, "1531": {"acRate": 52.508308276626046, "difficulty": "Hard", "likes": 2431, "dislikes": 214, "categoryTitle": "Algorithms", "frontendQuestionId": "1531", "paidOnly": false, "title": "String Compression II", "titleSlug": "string-compression-ii", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 99540, "totalSubmissionRaw": 189570}, "1532": {"acRate": 68.38892572186278, "difficulty": "Medium", "likes": 152, "dislikes": 11, "categoryTitle": "Database", "frontendQuestionId": "1532", "paidOnly": true, "title": "The Most Recent Three Orders", "titleSlug": "the-most-recent-three-orders", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29913, "totalSubmissionRaw": 43740}, "1533": {"acRate": 56.18274192903149, "difficulty": "Medium", "likes": 247, "dislikes": 33, "categoryTitle": "Algorithms", "frontendQuestionId": "1533", "paidOnly": true, "title": "Find the Index of the Large Integer", "titleSlug": "find-the-index-of-the-large-integer", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 14044, "totalSubmissionRaw": 24997}, "1534": {"acRate": 81.39421292225934, "difficulty": "Easy", "likes": 764, "dislikes": 1201, "categoryTitle": "Algorithms", "frontendQuestionId": "1534", "paidOnly": false, "title": "Count Good Triplets", "titleSlug": "count-good-triplets", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 124980, "totalSubmissionRaw": 153549}, "1535": {"acRate": 57.02866390407768, "difficulty": "Medium", "likes": 1575, "dislikes": 81, "categoryTitle": "Algorithms", "frontendQuestionId": "1535", "paidOnly": false, "title": "Find the Winner of an Array Game", "titleSlug": "find-the-winner-of-an-array-game", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 116290, "totalSubmissionRaw": 203915}, "1536": {"acRate": 47.73223455613296, "difficulty": "Medium", "likes": 565, "dislikes": 71, "categoryTitle": "Algorithms", "frontendQuestionId": "1536", "paidOnly": false, "title": "Minimum Swaps to Arrange a Binary Grid", "titleSlug": "minimum-swaps-to-arrange-a-binary-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15523, "totalSubmissionRaw": 32521}, "1537": {"acRate": 39.55044883303411, "difficulty": "Hard", "likes": 986, "dislikes": 51, "categoryTitle": "Algorithms", "frontendQuestionId": "1537", "paidOnly": false, "title": "Get the Maximum Score", "titleSlug": "get-the-maximum-score", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27537, "totalSubmissionRaw": 69625}, "1538": {"acRate": 69.82131039046989, "difficulty": "Medium", "likes": 138, "dislikes": 116, "categoryTitle": "Algorithms", "frontendQuestionId": "1538", "paidOnly": true, "title": "Guess the Majority in a Hidden Array", "titleSlug": "guess-the-majority-in-a-hidden-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 4220, "totalSubmissionRaw": 6044}, "1539": {"acRate": 60.534567930077586, "difficulty": "Easy", "likes": 6684, "dislikes": 455, "categoryTitle": "Algorithms", "frontendQuestionId": "1539", "paidOnly": false, "title": "Kth Missing Positive Number", "titleSlug": "kth-missing-positive-number", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 466391, "totalSubmissionRaw": 770454}, "1540": {"acRate": 35.374290139390816, "difficulty": "Medium", "likes": 393, "dislikes": 316, "categoryTitle": "Algorithms", "frontendQuestionId": "1540", "paidOnly": false, "title": "Can Convert String in K Moves", "titleSlug": "can-convert-string-in-k-moves", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20556, "totalSubmissionRaw": 58110}, "1541": {"acRate": 52.69890391205373, "difficulty": "Medium", "likes": 1117, "dislikes": 264, "categoryTitle": "Algorithms", "frontendQuestionId": "1541", "paidOnly": false, "title": "Minimum Insertions to Balance a Parentheses String", "titleSlug": "minimum-insertions-to-balance-a-parentheses-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 65051, "totalSubmissionRaw": 123439}, "1542": {"acRate": 43.860361274609296, "difficulty": "Hard", "likes": 816, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "1542", "paidOnly": false, "title": "Find Longest Awesome Substring", "titleSlug": "find-longest-awesome-substring", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15127, "totalSubmissionRaw": 34489}, "1543": {"acRate": 59.35778507207079, "difficulty": "Easy", "likes": 88, "dislikes": 44, "categoryTitle": "Database", "frontendQuestionId": "1543", "paidOnly": true, "title": "Fix Product Name Format", "titleSlug": "fix-product-name-format", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20796, "totalSubmissionRaw": 35035}, "1544": {"acRate": 68.34520471235062, "difficulty": "Easy", "likes": 3028, "dislikes": 169, "categoryTitle": "Algorithms", "frontendQuestionId": "1544", "paidOnly": false, "title": "Make The String Great", "titleSlug": "make-the-string-great", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 322206, "totalSubmissionRaw": 471439}, "1545": {"acRate": 58.97764773471215, "difficulty": "Medium", "likes": 926, "dislikes": 57, "categoryTitle": "Algorithms", "frontendQuestionId": "1545", "paidOnly": false, "title": "Find Kth Bit in Nth Binary String", "titleSlug": "find-kth-bit-in-nth-binary-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 44143, "totalSubmissionRaw": 74847}, "1546": {"acRate": 47.835860077443066, "difficulty": "Medium", "likes": 1066, "dislikes": 28, "categoryTitle": "Algorithms", "frontendQuestionId": "1546", "paidOnly": false, "title": "Maximum Number of Non-Overlapping Subarrays With Sum Equals Target", "titleSlug": "maximum-number-of-non-overlapping-subarrays-with-sum-equals-target", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29155, "totalSubmissionRaw": 60948}, "1547": {"acRate": 61.6999161165615, "difficulty": "Hard", "likes": 4275, "dislikes": 111, "categoryTitle": "Algorithms", "frontendQuestionId": "1547", "paidOnly": false, "title": "Minimum Cost to Cut a Stick", "titleSlug": "minimum-cost-to-cut-a-stick", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 135340, "totalSubmissionRaw": 219352}, "1548": {"acRate": 59.24502635606189, "difficulty": "Hard", "likes": 377, "dislikes": 185, "categoryTitle": "Algorithms", "frontendQuestionId": "1548", "paidOnly": true, "title": "The Most Similar Path in a Graph", "titleSlug": "the-most-similar-path-in-a-graph", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 17421, "totalSubmissionRaw": 29405}, "1549": {"acRate": 64.86304786276594, "difficulty": "Medium", "likes": 134, "dislikes": 12, "categoryTitle": "Database", "frontendQuestionId": "1549", "paidOnly": true, "title": "The Most Recent Orders for Each Product", "titleSlug": "the-most-recent-orders-for-each-product", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 29908, "totalSubmissionRaw": 46110}, "1550": {"acRate": 68.31948843897787, "difficulty": "Easy", "likes": 1131, "dislikes": 94, "categoryTitle": "Algorithms", "frontendQuestionId": "1550", "paidOnly": false, "title": "Three Consecutive Odds", "titleSlug": "three-consecutive-odds", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 276504, "totalSubmissionRaw": 404722}, "1551": {"acRate": 82.40563334152134, "difficulty": "Medium", "likes": 1444, "dislikes": 183, "categoryTitle": "Algorithms", "frontendQuestionId": "1551", "paidOnly": false, "title": "Minimum Operations to Make Array Equal", "titleSlug": "minimum-operations-to-make-array-equal", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 100642, "totalSubmissionRaw": 122130}, "1552": {"acRate": 71.08859198181948, "difficulty": "Medium", "likes": 2883, "dislikes": 253, "categoryTitle": "Algorithms", "frontendQuestionId": "1552", "paidOnly": false, "title": "Magnetic Force Between Two Balls", "titleSlug": "magnetic-force-between-two-balls", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 168293, "totalSubmissionRaw": 236737}, "1553": {"acRate": 35.46078882750153, "difficulty": "Hard", "likes": 993, "dislikes": 58, "categoryTitle": "Algorithms", "frontendQuestionId": "1553", "paidOnly": false, "title": "Minimum Number of Days to Eat N Oranges", "titleSlug": "minimum-number-of-days-to-eat-n-oranges", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 36970, "totalSubmissionRaw": 104256}, "1554": {"acRate": 41.658549692674576, "difficulty": "Medium", "likes": 376, "dislikes": 98, "categoryTitle": "Algorithms", "frontendQuestionId": "1554", "paidOnly": true, "title": "Strings Differ by One Character", "titleSlug": "strings-differ-by-one-character", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24806, "totalSubmissionRaw": 59546}, "1555": {"acRate": 51.34362021068844, "difficulty": "Medium", "likes": 141, "dislikes": 28, "categoryTitle": "Database", "frontendQuestionId": "1555", "paidOnly": true, "title": "Bank Account Summary", "titleSlug": "bank-account-summary", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18667, "totalSubmissionRaw": 36357}, "1556": {"acRate": 53.74286307998298, "difficulty": "Easy", "likes": 489, "dislikes": 40, "categoryTitle": "Algorithms", "frontendQuestionId": "1556", "paidOnly": false, "title": "Thousand Separator", "titleSlug": "thousand-separator", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 54312, "totalSubmissionRaw": 101059}, "1557": {"acRate": 81.05594238736687, "difficulty": "Medium", "likes": 3696, "dislikes": 129, "categoryTitle": "Algorithms", "frontendQuestionId": "1557", "paidOnly": false, "title": "Minimum Number of Vertices to Reach All Nodes", "titleSlug": "minimum-number-of-vertices-to-reach-all-nodes", "topicTags": [{"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 186838, "totalSubmissionRaw": 230505}, "1558": {"acRate": 63.72064986508984, "difficulty": "Medium", "likes": 627, "dislikes": 35, "categoryTitle": "Algorithms", "frontendQuestionId": "1558", "paidOnly": false, "title": "Minimum Numbers of Function Calls to Make Target Array", "titleSlug": "minimum-numbers-of-function-calls-to-make-target-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22199, "totalSubmissionRaw": 34838}, "1559": {"acRate": 48.77935671933486, "difficulty": "Medium", "likes": 1162, "dislikes": 28, "categoryTitle": "Algorithms", "frontendQuestionId": "1559", "paidOnly": false, "title": "Detect Cycles in 2D Grid", "titleSlug": "detect-cycles-in-2d-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 44178, "totalSubmissionRaw": 90567}, "1560": {"acRate": 58.95275731992097, "difficulty": "Easy", "likes": 317, "dislikes": 633, "categoryTitle": "Algorithms", "frontendQuestionId": "1560", "paidOnly": false, "title": "Most Visited Sector in  a Circular Track", "titleSlug": "most-visited-sector-in-a-circular-track", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 32819, "totalSubmissionRaw": 55670}, "1561": {"acRate": 84.47671682736112, "difficulty": "Medium", "likes": 1890, "dislikes": 212, "categoryTitle": "Algorithms", "frontendQuestionId": "1561", "paidOnly": false, "title": "Maximum Number of Coins You Can Get", "titleSlug": "maximum-number-of-coins-you-can-get", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 168749, "totalSubmissionRaw": 199758}, "1562": {"acRate": 42.9676382832224, "difficulty": "Medium", "likes": 648, "dislikes": 134, "categoryTitle": "Algorithms", "frontendQuestionId": "1562", "paidOnly": false, "title": "Find Latest Group of Size M", "titleSlug": "find-latest-group-of-size-m", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18721, "totalSubmissionRaw": 43570}, "1563": {"acRate": 40.935044265393415, "difficulty": "Hard", "likes": 648, "dislikes": 88, "categoryTitle": "Algorithms", "frontendQuestionId": "1563", "paidOnly": false, "title": "Stone Game V", "titleSlug": "stone-game-v", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20576, "totalSubmissionRaw": 50265}, "1564": {"acRate": 67.38557587059634, "difficulty": "Medium", "likes": 337, "dislikes": 30, "categoryTitle": "Algorithms", "frontendQuestionId": "1564", "paidOnly": true, "title": "Put Boxes Into the Warehouse I", "titleSlug": "put-boxes-into-the-warehouse-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 16622, "totalSubmissionRaw": 24667}, "1565": {"acRate": 82.10693098492943, "difficulty": "Easy", "likes": 77, "dislikes": 45, "categoryTitle": "Database", "frontendQuestionId": "1565", "paidOnly": true, "title": "Unique Orders and Customers Per Month", "titleSlug": "unique-orders-and-customers-per-month", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22283, "totalSubmissionRaw": 27139}, "1566": {"acRate": 43.27974588395044, "difficulty": "Easy", "likes": 655, "dislikes": 135, "categoryTitle": "Algorithms", "frontendQuestionId": "1566", "paidOnly": false, "title": "Detect Pattern of Length M Repeated K or More Times", "titleSlug": "detect-pattern-of-length-m-repeated-k-or-more-times", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 35697, "totalSubmissionRaw": 82480}, "1567": {"acRate": 44.28021324324079, "difficulty": "Medium", "likes": 2414, "dislikes": 69, "categoryTitle": "Algorithms", "frontendQuestionId": "1567", "paidOnly": false, "title": "Maximum Length of Subarray With Positive Product", "titleSlug": "maximum-length-of-subarray-with-positive-product", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 97513, "totalSubmissionRaw": 220218}, "1568": {"acRate": 60.00414416341372, "difficulty": "Hard", "likes": 1218, "dislikes": 217, "categoryTitle": "Algorithms", "frontendQuestionId": "1568", "paidOnly": false, "title": "Minimum Number of Days to Disconnect Island", "titleSlug": "minimum-number-of-days-to-disconnect-island", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Strongly Connected Component", "id": "VG9waWNUYWdOb2RlOjYxMDg1", "slug": "strongly-connected-component"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 89768, "totalSubmissionRaw": 149604}, "1569": {"acRate": 53.51665383042854, "difficulty": "Hard", "likes": 1789, "dislikes": 207, "categoryTitle": "Algorithms", "frontendQuestionId": "1569", "paidOnly": false, "title": "Number of Ways to Reorder Array to Get Same BST", "titleSlug": "number-of-ways-to-reorder-array-to-get-same-bst", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 56284, "totalSubmissionRaw": 105171}, "1570": {"acRate": 89.82918664556146, "difficulty": "Medium", "likes": 1213, "dislikes": 147, "categoryTitle": "Algorithms", "frontendQuestionId": "1570", "paidOnly": true, "title": "Dot Product of Two Sparse Vectors", "titleSlug": "dot-product-of-two-sparse-vectors", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 271833, "totalSubmissionRaw": 302611}, "1571": {"acRate": 87.72858713802793, "difficulty": "Easy", "likes": 159, "dislikes": 11, "categoryTitle": "Database", "frontendQuestionId": "1571", "paidOnly": true, "title": "Warehouse Manager", "titleSlug": "warehouse-manager", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 43080, "totalSubmissionRaw": 49106}, "1572": {"acRate": 83.15726776948438, "difficulty": "Easy", "likes": 3492, "dislikes": 55, "categoryTitle": "Algorithms", "frontendQuestionId": "1572", "paidOnly": false, "title": "Matrix Diagonal Sum", "titleSlug": "matrix-diagonal-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 375564, "totalSubmissionRaw": 451631}, "1573": {"acRate": 33.493737711684894, "difficulty": "Medium", "likes": 740, "dislikes": 84, "categoryTitle": "Algorithms", "frontendQuestionId": "1573", "paidOnly": false, "title": "Number of Ways to Split a String", "titleSlug": "number-of-ways-to-split-a-string", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30834, "totalSubmissionRaw": 92059}, "1574": {"acRate": 38.09478458589779, "difficulty": "Medium", "likes": 1618, "dislikes": 61, "categoryTitle": "Algorithms", "frontendQuestionId": "1574", "paidOnly": false, "title": "Shortest Subarray to be Removed to Make Array Sorted", "titleSlug": "shortest-subarray-to-be-removed-to-make-array-sorted", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 32000, "totalSubmissionRaw": 84001}, "1575": {"acRate": 65.26314619727074, "difficulty": "Hard", "likes": 1624, "dislikes": 60, "categoryTitle": "Algorithms", "frontendQuestionId": "1575", "paidOnly": false, "title": "Count All Possible Routes", "titleSlug": "count-all-possible-routes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 58729, "totalSubmissionRaw": 89988}, "1576": {"acRate": 46.23643912674673, "difficulty": "Easy", "likes": 562, "dislikes": 178, "categoryTitle": "Algorithms", "frontendQuestionId": "1576", "paidOnly": false, "title": "Replace All ?'s to Avoid Consecutive Repeating Characters", "titleSlug": "replace-all-s-to-avoid-consecutive-repeating-characters", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 62139, "totalSubmissionRaw": 134394}, "1577": {"acRate": 41.474362663290556, "difficulty": "Medium", "likes": 374, "dislikes": 53, "categoryTitle": "Algorithms", "frontendQuestionId": "1577", "paidOnly": false, "title": "Number of Ways Where Square of Number Is Equal to Product of Two Numbers", "titleSlug": "number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21621, "totalSubmissionRaw": 52131}, "1578": {"acRate": 63.72024179039801, "difficulty": "Medium", "likes": 3820, "dislikes": 135, "categoryTitle": "Algorithms", "frontendQuestionId": "1578", "paidOnly": false, "title": "Minimum Time to Make Rope Colorful", "titleSlug": "minimum-time-to-make-rope-colorful", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 261742, "totalSubmissionRaw": 410768}, "1579": {"acRate": 70.93951907257492, "difficulty": "Hard", "likes": 2531, "dislikes": 44, "categoryTitle": "Algorithms", "frontendQuestionId": "1579", "paidOnly": false, "title": "Remove Max Number of Edges to Keep Graph Fully Traversable", "titleSlug": "remove-max-number-of-edges-to-keep-graph-fully-traversable", "topicTags": [{"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 130218, "totalSubmissionRaw": 183562}, "1580": {"acRate": 66.21011438892234, "difficulty": "Medium", "likes": 220, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "1580", "paidOnly": true, "title": "Put Boxes Into the Warehouse II", "titleSlug": "put-boxes-into-the-warehouse-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 8798, "totalSubmissionRaw": 13288}, "1581": {"acRate": 67.94699020770352, "difficulty": "Easy", "likes": 2109, "dislikes": 291, "categoryTitle": "Database", "frontendQuestionId": "1581", "paidOnly": false, "title": "Customer Who Visited but Did Not Make Any Transactions", "titleSlug": "customer-who-visited-but-did-not-make-any-transactions", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 503689, "totalSubmissionRaw": 741297}, "1582": {"acRate": 68.65158229161383, "difficulty": "Easy", "likes": 1452, "dislikes": 69, "categoryTitle": "Algorithms", "frontendQuestionId": "1582", "paidOnly": false, "title": "Special Positions in a Binary Matrix", "titleSlug": "special-positions-in-a-binary-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 148884, "totalSubmissionRaw": 216869}, "1583": {"acRate": 61.633658112038034, "difficulty": "Medium", "likes": 286, "dislikes": 860, "categoryTitle": "Algorithms", "frontendQuestionId": "1583", "paidOnly": false, "title": "Count Unhappy Friends", "titleSlug": "count-unhappy-friends", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29035, "totalSubmissionRaw": 47109}, "1584": {"acRate": 67.35182114322045, "difficulty": "Medium", "likes": 5076, "dislikes": 129, "categoryTitle": "Algorithms", "frontendQuestionId": "1584", "paidOnly": false, "title": "Min Cost to Connect All Points", "titleSlug": "min-cost-to-connect-all-points", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Minimum Spanning Tree", "id": "VG9waWNUYWdOb2RlOjYxMDgz", "slug": "minimum-spanning-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 308270, "totalSubmissionRaw": 457700}, "1585": {"acRate": 48.68864226160897, "difficulty": "Hard", "likes": 438, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "1585", "paidOnly": false, "title": "Check If String Is Transformable With Substring Sort Operations", "titleSlug": "check-if-string-is-transformable-with-substring-sort-operations", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8818, "totalSubmissionRaw": 18111}, "1586": {"acRate": 63.58555841390934, "difficulty": "Medium", "likes": 261, "dislikes": 48, "categoryTitle": "Algorithms", "frontendQuestionId": "1586", "paidOnly": true, "title": "Binary Search Tree Iterator II", "titleSlug": "binary-search-tree-iterator-ii", "topicTags": [{"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}, {"name": "Iterator", "id": "VG9waWNUYWdOb2RlOjYxMDY0", "slug": "iterator"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 14336, "totalSubmissionRaw": 22546}, "1587": {"acRate": 83.378731958842, "difficulty": "Easy", "likes": 480, "dislikes": 5, "categoryTitle": "Database", "frontendQuestionId": "1587", "paidOnly": false, "title": "Bank Account Summary II", "titleSlug": "bank-account-summary-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 108662, "totalSubmissionRaw": 130324}, "1588": {"acRate": 83.17860506096847, "difficulty": "Easy", "likes": 3706, "dislikes": 301, "categoryTitle": "Algorithms", "frontendQuestionId": "1588", "paidOnly": false, "title": "Sum of All Odd Length Subarrays", "titleSlug": "sum-of-all-odd-length-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 205803, "totalSubmissionRaw": 247423}, "1589": {"acRate": 38.2657193344132, "difficulty": "Medium", "likes": 769, "dislikes": 39, "categoryTitle": "Algorithms", "frontendQuestionId": "1589", "paidOnly": false, "title": "Maximum Sum Obtained of Any Permutation", "titleSlug": "maximum-sum-obtained-of-any-permutation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20789, "totalSubmissionRaw": 54328}, "1590": {"acRate": 29.18365213755618, "difficulty": "Medium", "likes": 1548, "dislikes": 69, "categoryTitle": "Algorithms", "frontendQuestionId": "1590", "paidOnly": false, "title": "Make Sum Divisible by P", "titleSlug": "make-sum-divisible-by-p", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30712, "totalSubmissionRaw": 105237}, "1591": {"acRate": 59.19773720750836, "difficulty": "Hard", "likes": 628, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "1591", "paidOnly": false, "title": "Strange Printer II", "titleSlug": "strange-printer-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11511, "totalSubmissionRaw": 19445}, "1592": {"acRate": 43.32882595063673, "difficulty": "Easy", "likes": 458, "dislikes": 349, "categoryTitle": "Algorithms", "frontendQuestionId": "1592", "paidOnly": false, "title": "Rearrange Spaces Between Words", "titleSlug": "rearrange-spaces-between-words", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 58318, "totalSubmissionRaw": 134594}, "1593": {"acRate": 56.74316363316627, "difficulty": "Medium", "likes": 843, "dislikes": 37, "categoryTitle": "Algorithms", "frontendQuestionId": "1593", "paidOnly": false, "title": "Split a String Into the Max Number of Unique Substrings", "titleSlug": "split-a-string-into-the-max-number-of-unique-substrings", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 32267, "totalSubmissionRaw": 56865}, "1594": {"acRate": 33.91793020130584, "difficulty": "Medium", "likes": 835, "dislikes": 41, "categoryTitle": "Algorithms", "frontendQuestionId": "1594", "paidOnly": false, "title": "Maximum Non Negative Product in a Matrix", "titleSlug": "maximum-non-negative-product-in-a-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24987, "totalSubmissionRaw": 73669}, "1595": {"acRate": 48.250601915885454, "difficulty": "Hard", "likes": 472, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "1595", "paidOnly": false, "title": "Minimum Cost to Connect Two Groups of Points", "titleSlug": "minimum-cost-to-connect-two-groups-of-points", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9419, "totalSubmissionRaw": 19521}, "1596": {"acRate": 78.44046123986756, "difficulty": "Medium", "likes": 242, "dislikes": 17, "categoryTitle": "Database", "frontendQuestionId": "1596", "paidOnly": true, "title": "The Most Frequently Ordered Products for Each Customer", "titleSlug": "the-most-frequently-ordered-products-for-each-customer", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34353, "totalSubmissionRaw": 43795}, "1597": {"acRate": 62.520018841262356, "difficulty": "Hard", "likes": 267, "dislikes": 46, "categoryTitle": "Algorithms", "frontendQuestionId": "1597", "paidOnly": true, "title": "Build Binary Expression Tree From Infix Expression", "titleSlug": "build-binary-expression-tree-from-infix-expression", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13273, "totalSubmissionRaw": 21230}, "1598": {"acRate": 71.76431285994512, "difficulty": "Easy", "likes": 1445, "dislikes": 96, "categoryTitle": "Algorithms", "frontendQuestionId": "1598", "paidOnly": false, "title": "Crawler Log Folder", "titleSlug": "crawler-log-folder", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 251337, "totalSubmissionRaw": 350226}, "1599": {"acRate": 44.200136147038805, "difficulty": "Medium", "likes": 109, "dislikes": 247, "categoryTitle": "Algorithms", "frontendQuestionId": "1599", "paidOnly": false, "title": "Maximum Profit of Operating a Centennial Wheel", "titleSlug": "maximum-profit-of-operating-a-centennial-wheel", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12986, "totalSubmissionRaw": 29380}, "1600": {"acRate": 65.5564263322884, "difficulty": "Medium", "likes": 294, "dislikes": 306, "categoryTitle": "Algorithms", "frontendQuestionId": "1600", "paidOnly": false, "title": "Throne Inheritance", "titleSlug": "throne-inheritance", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18403, "totalSubmissionRaw": 28072}, "1601": {"acRate": 64.52597653146917, "difficulty": "Hard", "likes": 1417, "dislikes": 72, "categoryTitle": "Algorithms", "frontendQuestionId": "1601", "paidOnly": false, "title": "Maximum Number of Achievable Transfer Requests", "titleSlug": "maximum-number-of-achievable-transfer-requests", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 56859, "totalSubmissionRaw": 88118}, "1602": {"acRate": 75.43825603208487, "difficulty": "Medium", "likes": 329, "dislikes": 10, "categoryTitle": "Algorithms", "frontendQuestionId": "1602", "paidOnly": true, "title": "Find Nearest Right Node in Binary Tree", "titleSlug": "find-nearest-right-node-in-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 23324, "totalSubmissionRaw": 30918}, "1603": {"acRate": 87.98613268992914, "difficulty": "Easy", "likes": 1950, "dislikes": 448, "categoryTitle": "Algorithms", "frontendQuestionId": "1603", "paidOnly": false, "title": "Design Parking System", "titleSlug": "design-parking-system", "topicTags": [{"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 288817, "totalSubmissionRaw": 328253}, "1604": {"acRate": 45.88510648726809, "difficulty": "Medium", "likes": 311, "dislikes": 422, "categoryTitle": "Algorithms", "frontendQuestionId": "1604", "paidOnly": false, "title": "Alert Using Same Key-Card Three or More Times in a One Hour Period", "titleSlug": "alert-using-same-key-card-three-or-more-times-in-a-one-hour-period", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 37445, "totalSubmissionRaw": 81606}, "1605": {"acRate": 83.1350773794977, "difficulty": "Medium", "likes": 2119, "dislikes": 88, "categoryTitle": "Algorithms", "frontendQuestionId": "1605", "paidOnly": false, "title": "Find Valid Matrix Given Row and Column Sums", "titleSlug": "find-valid-matrix-given-row-and-column-sums", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 146277, "totalSubmissionRaw": 175951}, "1606": {"acRate": 43.64696169914693, "difficulty": "Hard", "likes": 609, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "1606", "paidOnly": false, "title": "Find Servers That Handled Most Number of Requests", "titleSlug": "find-servers-that-handled-most-number-of-requests", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 17447, "totalSubmissionRaw": 39973}, "1607": {"acRate": 54.35146508972012, "difficulty": "Easy", "likes": 134, "dislikes": 14, "categoryTitle": "Database", "frontendQuestionId": "1607", "paidOnly": true, "title": "Sellers With No Sales", "titleSlug": "sellers-with-no-sales", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 34742, "totalSubmissionRaw": 63921}, "1608": {"acRate": 66.88953000771579, "difficulty": "Easy", "likes": 2198, "dislikes": 425, "categoryTitle": "Algorithms", "frontendQuestionId": "1608", "paidOnly": false, "title": "Special Array With X Elements Greater Than or Equal X", "titleSlug": "special-array-with-x-elements-greater-than-or-equal-x", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 199391, "totalSubmissionRaw": 298090}, "1609": {"acRate": 65.88083134828058, "difficulty": "Medium", "likes": 1772, "dislikes": 94, "categoryTitle": "Algorithms", "frontendQuestionId": "1609", "paidOnly": false, "title": "Even Odd Tree", "titleSlug": "even-odd-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 160964, "totalSubmissionRaw": 244326}, "1610": {"acRate": 37.44527520043239, "difficulty": "Hard", "likes": 579, "dislikes": 748, "categoryTitle": "Algorithms", "frontendQuestionId": "1610", "paidOnly": false, "title": "Maximum Number of Visible Points", "titleSlug": "maximum-number-of-visible-points", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 41568, "totalSubmissionRaw": 111010}, "1611": {"acRate": 74.05944529318975, "difficulty": "Hard", "likes": 925, "dislikes": 1024, "categoryTitle": "Algorithms", "frontendQuestionId": "1611", "paidOnly": false, "title": "Minimum One Bit Operations to Make Integers Zero", "titleSlug": "minimum-one-bit-operations-to-make-integers-zero", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 59624, "totalSubmissionRaw": 80504}, "1612": {"acRate": 70.60985955320955, "difficulty": "Medium", "likes": 140, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "1612", "paidOnly": true, "title": "Check If Two Expression Trees are Equivalent", "titleSlug": "check-if-two-expression-trees-are-equivalent", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7491, "totalSubmissionRaw": 10609}, "1613": {"acRate": 72.97787176195152, "difficulty": "Medium", "likes": 226, "dislikes": 28, "categoryTitle": "Database", "frontendQuestionId": "1613", "paidOnly": true, "title": "Find the Missing IDs", "titleSlug": "find-the-missing-ids", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19326, "totalSubmissionRaw": 26482}, "1614": {"acRate": 83.90611727681618, "difficulty": "Easy", "likes": 2469, "dislikes": 504, "categoryTitle": "Algorithms", "frontendQuestionId": "1614", "paidOnly": false, "title": "Maximum Nesting Depth of the Parentheses", "titleSlug": "maximum-nesting-depth-of-the-parentheses", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 361532, "totalSubmissionRaw": 430877}, "1615": {"acRate": 65.15490629676786, "difficulty": "Medium", "likes": 2351, "dislikes": 369, "categoryTitle": "Algorithms", "frontendQuestionId": "1615", "paidOnly": false, "title": "Maximal Network Rank", "titleSlug": "maximal-network-rank", "topicTags": [{"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 145846, "totalSubmissionRaw": 223845}, "1616": {"acRate": 31.074575128785327, "difficulty": "Medium", "likes": 735, "dislikes": 248, "categoryTitle": "Algorithms", "frontendQuestionId": "1616", "paidOnly": false, "title": "Split Two Strings to Make Palindrome", "titleSlug": "split-two-strings-to-make-palindrome", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25818, "totalSubmissionRaw": 83084}, "1617": {"acRate": 66.33135740374829, "difficulty": "Hard", "likes": 545, "dislikes": 41, "categoryTitle": "Algorithms", "frontendQuestionId": "1617", "paidOnly": false, "title": "Count Subtrees With Max Distance Between Cities", "titleSlug": "count-subtrees-with-max-distance-between-cities", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11078, "totalSubmissionRaw": 16701}, "1618": {"acRate": 60.945755547728076, "difficulty": "Medium", "likes": 108, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "1618", "paidOnly": true, "title": "Maximum Font to Fit a Sentence in a Screen", "titleSlug": "maximum-font-to-fit-a-sentence-in-a-screen", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6921, "totalSubmissionRaw": 11356}, "1619": {"acRate": 68.86335757469553, "difficulty": "Easy", "likes": 500, "dislikes": 128, "categoryTitle": "Algorithms", "frontendQuestionId": "1619", "paidOnly": false, "title": "Mean of Array After Removing Some Elements", "titleSlug": "mean-of-array-after-removing-some-elements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 62875, "totalSubmissionRaw": 91304}, "1620": {"acRate": 38.07520926164994, "difficulty": "Medium", "likes": 80, "dislikes": 266, "categoryTitle": "Algorithms", "frontendQuestionId": "1620", "paidOnly": false, "title": "Coordinate With Maximum Network Quality", "titleSlug": "coordinate-with-maximum-network-quality", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9143, "totalSubmissionRaw": 24013}, "1621": {"acRate": 43.73362629933237, "difficulty": "Medium", "likes": 461, "dislikes": 47, "categoryTitle": "Algorithms", "frontendQuestionId": "1621", "paidOnly": false, "title": "Number of Sets of K Non-Overlapping Line Segments", "titleSlug": "number-of-sets-of-k-non-overlapping-line-segments", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10350, "totalSubmissionRaw": 23666}, "1622": {"acRate": 17.449088658865886, "difficulty": "Hard", "likes": 370, "dislikes": 138, "categoryTitle": "Algorithms", "frontendQuestionId": "1622", "paidOnly": false, "title": "Fancy Sequence", "titleSlug": "fancy-sequence", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12407, "totalSubmissionRaw": 71104}, "1623": {"acRate": 81.97013956507627, "difficulty": "Easy", "likes": 73, "dislikes": 138, "categoryTitle": "Database", "frontendQuestionId": "1623", "paidOnly": true, "title": "All Valid Triplets That Can Represent a Country", "titleSlug": "all-valid-triplets-that-can-represent-a-country", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20204, "totalSubmissionRaw": 24648}, "1624": {"acRate": 68.54138387108001, "difficulty": "Easy", "likes": 1343, "dislikes": 64, "categoryTitle": "Algorithms", "frontendQuestionId": "1624", "paidOnly": false, "title": "Largest Substring Between Two Equal Characters", "titleSlug": "largest-substring-between-two-equal-characters", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 157541, "totalSubmissionRaw": 229848}, "1625": {"acRate": 65.55082943428329, "difficulty": "Medium", "likes": 355, "dislikes": 274, "categoryTitle": "Algorithms", "frontendQuestionId": "1625", "paidOnly": false, "title": "Lexicographically Smallest String After Applying Operations", "titleSlug": "lexicographically-smallest-string-after-applying-operations", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15411, "totalSubmissionRaw": 23510}, "1626": {"acRate": 50.3899655213411, "difficulty": "Medium", "likes": 2948, "dislikes": 95, "categoryTitle": "Algorithms", "frontendQuestionId": "1626", "paidOnly": false, "title": "Best Team With No Conflicts", "titleSlug": "best-team-with-no-conflicts", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 84766, "totalSubmissionRaw": 168220}, "1627": {"acRate": 47.26351351351351, "difficulty": "Hard", "likes": 581, "dislikes": 33, "categoryTitle": "Algorithms", "frontendQuestionId": "1627", "paidOnly": false, "title": "Graph Connectivity With Threshold", "titleSlug": "graph-connectivity-with-threshold", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18187, "totalSubmissionRaw": 38480}, "1628": {"acRate": 82.53963367708172, "difficulty": "Medium", "likes": 536, "dislikes": 72, "categoryTitle": "Algorithms", "frontendQuestionId": "1628", "paidOnly": true, "title": "Design an Expression Tree With Evaluate Function", "titleSlug": "design-an-expression-tree-with-evaluate-function", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26813, "totalSubmissionRaw": 32485}, "1629": {"acRate": 59.118090161084716, "difficulty": "Easy", "likes": 764, "dislikes": 109, "categoryTitle": "Algorithms", "frontendQuestionId": "1629", "paidOnly": false, "title": "Slowest Key", "titleSlug": "slowest-key", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 102026, "totalSubmissionRaw": 172580}, "1630": {"acRate": 83.74214194538166, "difficulty": "Medium", "likes": 1819, "dislikes": 203, "categoryTitle": "Algorithms", "frontendQuestionId": "1630", "paidOnly": false, "title": "Arithmetic Subarrays", "titleSlug": "arithmetic-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 139738, "totalSubmissionRaw": 166867}, "1631": {"acRate": 60.101176348296114, "difficulty": "Medium", "likes": 5927, "dislikes": 204, "categoryTitle": "Algorithms", "frontendQuestionId": "1631", "paidOnly": false, "title": "Path With Minimum Effort", "titleSlug": "path-with-minimum-effort", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 277525, "totalSubmissionRaw": 461764}, "1632": {"acRate": 40.981934731934736, "difficulty": "Hard", "likes": 874, "dislikes": 55, "categoryTitle": "Algorithms", "frontendQuestionId": "1632", "paidOnly": false, "title": "Rank Transform of a Matrix", "titleSlug": "rank-transform-of-a-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 22504, "totalSubmissionRaw": 54912}, "1633": {"acRate": 56.88813947535776, "difficulty": "Easy", "likes": 695, "dislikes": 74, "categoryTitle": "Database", "frontendQuestionId": "1633", "paidOnly": false, "title": "Percentage of Users Attended a Contest", "titleSlug": "percentage-of-users-attended-a-contest", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 215581, "totalSubmissionRaw": 378957}, "1634": {"acRate": 55.50764192139738, "difficulty": "Medium", "likes": 144, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "1634", "paidOnly": true, "title": "Add Two Polynomials Represented as Linked Lists", "titleSlug": "add-two-polynomials-represented-as-linked-lists", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10169, "totalSubmissionRaw": 18320}, "1635": {"acRate": 47.74462941596616, "difficulty": "Hard", "likes": 110, "dislikes": 35, "categoryTitle": "Database", "frontendQuestionId": "1635", "paidOnly": true, "title": "Hopper Company Queries I", "titleSlug": "hopper-company-queries-i", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 8690, "totalSubmissionRaw": 18201}, "1636": {"acRate": 79.78200557200272, "difficulty": "Easy", "likes": 3406, "dislikes": 155, "categoryTitle": "Algorithms", "frontendQuestionId": "1636", "paidOnly": false, "title": "Sort Array by Increasing Frequency", "titleSlug": "sort-array-by-increasing-frequency", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 274340, "totalSubmissionRaw": 343862}, "1637": {"acRate": 87.39828502079064, "difficulty": "Easy", "likes": 933, "dislikes": 1726, "categoryTitle": "Algorithms", "frontendQuestionId": "1637", "paidOnly": false, "title": "Widest Vertical Area Between Two Points Containing No Points", "titleSlug": "widest-vertical-area-between-two-points-containing-no-points", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 175716, "totalSubmissionRaw": 201052}, "1638": {"acRate": 71.28789429396647, "difficulty": "Medium", "likes": 1153, "dislikes": 347, "categoryTitle": "Algorithms", "frontendQuestionId": "1638", "paidOnly": false, "title": "Count Substrings That Differ by One Character", "titleSlug": "count-substrings-that-differ-by-one-character", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 31346, "totalSubmissionRaw": 43971}, "1639": {"acRate": 51.00136909358983, "difficulty": "Hard", "likes": 1573, "dislikes": 87, "categoryTitle": "Algorithms", "frontendQuestionId": "1639", "paidOnly": false, "title": "Number of Ways to Form a Target String Given a Dictionary", "titleSlug": "number-of-ways-to-form-a-target-string-given-a-dictionary", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 58113, "totalSubmissionRaw": 113944}, "1640": {"acRate": 56.63912257573492, "difficulty": "Easy", "likes": 900, "dislikes": 141, "categoryTitle": "Algorithms", "frontendQuestionId": "1640", "paidOnly": false, "title": "Check Array Formation Through Concatenation", "titleSlug": "check-array-formation-through-concatenation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 83349, "totalSubmissionRaw": 147158}, "1641": {"acRate": 78.56173112001399, "difficulty": "Medium", "likes": 3862, "dislikes": 90, "categoryTitle": "Algorithms", "frontendQuestionId": "1641", "paidOnly": false, "title": "Count Sorted Vowel Strings", "titleSlug": "count-sorted-vowel-strings", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 188644, "totalSubmissionRaw": 240122}, "1642": {"acRate": 49.82518951266326, "difficulty": "Medium", "likes": 5898, "dislikes": 140, "categoryTitle": "Algorithms", "frontendQuestionId": "1642", "paidOnly": false, "title": "Furthest Building You Can Reach", "titleSlug": "furthest-building-you-can-reach", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 231297, "totalSubmissionRaw": 464217}, "1643": {"acRate": 48.33042973286876, "difficulty": "Hard", "likes": 550, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "1643", "paidOnly": false, "title": "Kth Smallest Instructions", "titleSlug": "kth-smallest-instructions", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13316, "totalSubmissionRaw": 27552}, "1644": {"acRate": 64.85690530029295, "difficulty": "Medium", "likes": 637, "dislikes": 37, "categoryTitle": "Algorithms", "frontendQuestionId": "1644", "paidOnly": true, "title": "Lowest Common Ancestor of a Binary Tree II", "titleSlug": "lowest-common-ancestor-of-a-binary-tree-ii", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 83465, "totalSubmissionRaw": 128691}, "1645": {"acRate": 39.15859493523165, "difficulty": "Hard", "likes": 61, "dislikes": 17, "categoryTitle": "Database", "frontendQuestionId": "1645", "paidOnly": true, "title": "Hopper Company Queries II", "titleSlug": "hopper-company-queries-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6711, "totalSubmissionRaw": 17138}, "1646": {"acRate": 50.52941983267042, "difficulty": "Easy", "likes": 760, "dislikes": 945, "categoryTitle": "Algorithms", "frontendQuestionId": "1646", "paidOnly": false, "title": "Get Maximum in Generated Array", "titleSlug": "get-maximum-in-generated-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 110523, "totalSubmissionRaw": 218730}, "1647": {"acRate": 61.259795523625314, "difficulty": "Medium", "likes": 4933, "dislikes": 73, "categoryTitle": "Algorithms", "frontendQuestionId": "1647", "paidOnly": false, "title": "Minimum Deletions to Make Character Frequencies Unique", "titleSlug": "minimum-deletions-to-make-character-frequencies-unique", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 277124, "totalSubmissionRaw": 452375}, "1648": {"acRate": 29.98466800330228, "difficulty": "Medium", "likes": 1077, "dislikes": 386, "categoryTitle": "Algorithms", "frontendQuestionId": "1648", "paidOnly": false, "title": "Sell Diminishing-Valued Colored Balls", "titleSlug": "sell-diminishing-valued-colored-balls", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 38136, "totalSubmissionRaw": 127185}, "1649": {"acRate": 39.13331957182035, "difficulty": "Hard", "likes": 653, "dislikes": 81, "categoryTitle": "Algorithms", "frontendQuestionId": "1649", "paidOnly": false, "title": "Create Sorted Array through Instructions", "titleSlug": "create-sorted-array-through-instructions", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Merge Sort", "id": "VG9waWNUYWdOb2RlOjYxMDUx", "slug": "merge-sort"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 26541, "totalSubmissionRaw": 67822}, "1650": {"acRate": 80.16452830667924, "difficulty": "Medium", "likes": 1389, "dislikes": 53, "categoryTitle": "Algorithms", "frontendQuestionId": "1650", "paidOnly": true, "title": "Lowest Common Ancestor of a Binary Tree III", "titleSlug": "lowest-common-ancestor-of-a-binary-tree-iii", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 252485, "totalSubmissionRaw": 314958}, "1651": {"acRate": 65.20465072313073, "difficulty": "Hard", "likes": 34, "dislikes": 62, "categoryTitle": "Database", "frontendQuestionId": "1651", "paidOnly": true, "title": "Hopper Company Queries III", "titleSlug": "hopper-company-queries-iii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6898, "totalSubmissionRaw": 10579}, "1652": {"acRate": 66.42149742506273, "difficulty": "Easy", "likes": 804, "dislikes": 97, "categoryTitle": "Algorithms", "frontendQuestionId": "1652", "paidOnly": false, "title": "Defuse the Bomb", "titleSlug": "defuse-the-bomb", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 50300, "totalSubmissionRaw": 75729}, "1653": {"acRate": 65.85363852654032, "difficulty": "Medium", "likes": 2073, "dislikes": 66, "categoryTitle": "Algorithms", "frontendQuestionId": "1653", "paidOnly": false, "title": "Minimum Deletions to Make String Balanced", "titleSlug": "minimum-deletions-to-make-string-balanced", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 160538, "totalSubmissionRaw": 243780}, "1654": {"acRate": 29.545122226800835, "difficulty": "Medium", "likes": 1485, "dislikes": 271, "categoryTitle": "Algorithms", "frontendQuestionId": "1654", "paidOnly": false, "title": "Minimum Jumps to Reach Home", "titleSlug": "minimum-jumps-to-reach-home", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 44453, "totalSubmissionRaw": 150458}, "1655": {"acRate": 39.60425949701684, "difficulty": "Hard", "likes": 427, "dislikes": 26, "categoryTitle": "Algorithms", "frontendQuestionId": "1655", "paidOnly": false, "title": "Distribute Repeating Integers", "titleSlug": "distribute-repeating-integers", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15732, "totalSubmissionRaw": 39723}, "1656": {"acRate": 84.34012500708121, "difficulty": "Easy", "likes": 528, "dislikes": 3495, "categoryTitle": "Algorithms", "frontendQuestionId": "1656", "paidOnly": false, "title": "Design an Ordered Stream", "titleSlug": "design-an-ordered-stream", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Data Stream", "id": "VG9waWNUYWdOb2RlOjYxMDYz", "slug": "data-stream"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 89328, "totalSubmissionRaw": 105914}, "1657": {"acRate": 54.50056089899188, "difficulty": "Medium", "likes": 3697, "dislikes": 296, "categoryTitle": "Algorithms", "frontendQuestionId": "1657", "paidOnly": false, "title": "Determine if Two Strings Are Close", "titleSlug": "determine-if-two-strings-are-close", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 364859, "totalSubmissionRaw": 669460}, "1658": {"acRate": 39.774262971039086, "difficulty": "Medium", "likes": 5462, "dislikes": 120, "categoryTitle": "Algorithms", "frontendQuestionId": "1658", "paidOnly": false, "title": "Minimum Operations to Reduce X to Zero", "titleSlug": "minimum-operations-to-reduce-x-to-zero", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 195720, "totalSubmissionRaw": 492077}, "1659": {"acRate": 39.66007630939993, "difficulty": "Hard", "likes": 330, "dislikes": 53, "categoryTitle": "Algorithms", "frontendQuestionId": "1659", "paidOnly": false, "title": "Maximize Grid Happiness", "titleSlug": "maximize-grid-happiness", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5717, "totalSubmissionRaw": 14415}, "1660": {"acRate": 74.42121825129242, "difficulty": "Medium", "likes": 267, "dislikes": 46, "categoryTitle": "Algorithms", "frontendQuestionId": "1660", "paidOnly": true, "title": "Correct a Binary Tree", "titleSlug": "correct-a-binary-tree", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 19866, "totalSubmissionRaw": 26694}, "1661": {"acRate": 67.90546082451975, "difficulty": "Easy", "likes": 1403, "dislikes": 139, "categoryTitle": "Database", "frontendQuestionId": "1661", "paidOnly": false, "title": "Average Time of Process per Machine", "titleSlug": "average-time-of-process-per-machine", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 314593, "totalSubmissionRaw": 463286}, "1662": {"acRate": 85.56606909912601, "difficulty": "Easy", "likes": 2992, "dislikes": 200, "categoryTitle": "Algorithms", "frontendQuestionId": "1662", "paidOnly": false, "title": "Check If Two String Arrays are Equivalent", "titleSlug": "check-if-two-string-arrays-are-equivalent", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 507038, "totalSubmissionRaw": 592569}, "1663": {"acRate": 66.89635913010088, "difficulty": "Medium", "likes": 1875, "dislikes": 63, "categoryTitle": "Algorithms", "frontendQuestionId": "1663", "paidOnly": false, "title": "Smallest String With A Given Numeric Value", "titleSlug": "smallest-string-with-a-given-numeric-value", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 95819, "totalSubmissionRaw": 143235}, "1664": {"acRate": 63.666264141349934, "difficulty": "Medium", "likes": 1316, "dislikes": 40, "categoryTitle": "Algorithms", "frontendQuestionId": "1664", "paidOnly": false, "title": "Ways to Make a Fair Array", "titleSlug": "ways-to-make-a-fair-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 40069, "totalSubmissionRaw": 62936}, "1665": {"acRate": 58.33814380091078, "difficulty": "Hard", "likes": 578, "dislikes": 37, "categoryTitle": "Algorithms", "frontendQuestionId": "1665", "paidOnly": false, "title": "Minimum Initial Energy to Finish Tasks", "titleSlug": "minimum-initial-energy-to-finish-tasks", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18191, "totalSubmissionRaw": 31182}, "1666": {"acRate": 73.98058252427184, "difficulty": "Medium", "likes": 64, "dislikes": 190, "categoryTitle": "Algorithms", "frontendQuestionId": "1666", "paidOnly": true, "title": "Change the Root of a Binary Tree", "titleSlug": "change-the-root-of-a-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4953, "totalSubmissionRaw": 6695}, "1667": {"acRate": 61.454285385627195, "difficulty": "Easy", "likes": 877, "dislikes": 107, "categoryTitle": "Database", "frontendQuestionId": "1667", "paidOnly": false, "title": "Fix Names in a Table", "titleSlug": "fix-names-in-a-table", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 245750, "totalSubmissionRaw": 399892}, "1668": {"acRate": 38.929215279431276, "difficulty": "Easy", "likes": 705, "dislikes": 267, "categoryTitle": "Algorithms", "frontendQuestionId": "1668", "paidOnly": false, "title": "Maximum Repeating Substring", "titleSlug": "maximum-repeating-substring", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 57224, "totalSubmissionRaw": 146995}, "1669": {"acRate": 81.71687746598326, "difficulty": "Medium", "likes": 2091, "dislikes": 219, "categoryTitle": "Algorithms", "frontendQuestionId": "1669", "paidOnly": false, "title": "Merge In Between Linked Lists", "titleSlug": "merge-in-between-linked-lists", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 221608, "totalSubmissionRaw": 271190}, "1670": {"acRate": 56.45802236997694, "difficulty": "Medium", "likes": 747, "dislikes": 104, "categoryTitle": "Algorithms", "frontendQuestionId": "1670", "paidOnly": false, "title": "Design Front Middle Back Queue", "titleSlug": "design-front-middle-back-queue", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Data Stream", "id": "VG9waWNUYWdOb2RlOjYxMDYz", "slug": "data-stream"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29125, "totalSubmissionRaw": 51587}, "1671": {"acRate": 41.96903346887707, "difficulty": "Hard", "likes": 1590, "dislikes": 23, "categoryTitle": "Algorithms", "frontendQuestionId": "1671", "paidOnly": false, "title": "Minimum Number of Removals to Make Mountain Array", "titleSlug": "minimum-number-of-removals-to-make-mountain-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 32202, "totalSubmissionRaw": 76728}, "1672": {"acRate": 88.1817068081669, "difficulty": "Easy", "likes": 4371, "dislikes": 366, "categoryTitle": "Algorithms", "frontendQuestionId": "1672", "paidOnly": false, "title": "Richest Customer Wealth", "titleSlug": "richest-customer-wealth", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 921324, "totalSubmissionRaw": 1044802}, "1673": {"acRate": 50.66906068368792, "difficulty": "Medium", "likes": 2044, "dislikes": 98, "categoryTitle": "Algorithms", "frontendQuestionId": "1673", "paidOnly": false, "title": "Find the Most Competitive Subsequence", "titleSlug": "find-the-most-competitive-subsequence", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 65470, "totalSubmissionRaw": 129211}, "1674": {"acRate": 40.301603076524216, "difficulty": "Medium", "likes": 664, "dislikes": 77, "categoryTitle": "Algorithms", "frontendQuestionId": "1674", "paidOnly": false, "title": "Minimum Moves to Make Array Complementary", "titleSlug": "minimum-moves-to-make-array-complementary", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9327, "totalSubmissionRaw": 23143}, "1675": {"acRate": 54.04661041011255, "difficulty": "Hard", "likes": 3035, "dislikes": 171, "categoryTitle": "Algorithms", "frontendQuestionId": "1675", "paidOnly": false, "title": "Minimize Deviation in Array", "titleSlug": "minimize-deviation-in-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 95175, "totalSubmissionRaw": 176098}, "1676": {"acRate": 78.57910427066001, "difficulty": "Medium", "likes": 473, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "1676", "paidOnly": true, "title": "Lowest Common Ancestor of a Binary Tree IV", "titleSlug": "lowest-common-ancestor-of-a-binary-tree-iv", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 45337, "totalSubmissionRaw": 57696}, "1677": {"acRate": 38.17902251510159, "difficulty": "Easy", "likes": 37, "dislikes": 134, "categoryTitle": "Database", "frontendQuestionId": "1677", "paidOnly": true, "title": "Product's Worth Over Invoices", "titleSlug": "products-worth-over-invoices", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17381, "totalSubmissionRaw": 45525}, "1678": {"acRate": 87.3615943275171, "difficulty": "Easy", "likes": 1578, "dislikes": 88, "categoryTitle": "Algorithms", "frontendQuestionId": "1678", "paidOnly": false, "title": "Goal Parser Interpretation", "titleSlug": "goal-parser-interpretation", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 264157, "totalSubmissionRaw": 302372}, "1679": {"acRate": 55.15523541848361, "difficulty": "Medium", "likes": 3152, "dislikes": 90, "categoryTitle": "Algorithms", "frontendQuestionId": "1679", "paidOnly": false, "title": "Max Number of K-Sum Pairs", "titleSlug": "max-number-of-k-sum-pairs", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 329483, "totalSubmissionRaw": 597375}, "1680": {"acRate": 57.13272759217891, "difficulty": "Medium", "likes": 1420, "dislikes": 435, "categoryTitle": "Algorithms", "frontendQuestionId": "1680", "paidOnly": false, "title": "Concatenation of Consecutive Binary Numbers", "titleSlug": "concatenation-of-consecutive-binary-numbers", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 91049, "totalSubmissionRaw": 159364}, "1681": {"acRate": 38.97839783978398, "difficulty": "Hard", "likes": 276, "dislikes": 97, "categoryTitle": "Algorithms", "frontendQuestionId": "1681", "paidOnly": false, "title": "Minimum Incompatibility", "titleSlug": "minimum-incompatibility", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8661, "totalSubmissionRaw": 22220}, "1682": {"acRate": 50.13513513513514, "difficulty": "Medium", "likes": 150, "dislikes": 28, "categoryTitle": "Algorithms", "frontendQuestionId": "1682", "paidOnly": true, "title": "Longest Palindromic Subsequence II", "titleSlug": "longest-palindromic-subsequence-ii", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5565, "totalSubmissionRaw": 11100}, "1683": {"acRate": 85.35873321672707, "difficulty": "Easy", "likes": 991, "dislikes": 366, "categoryTitle": "Database", "frontendQuestionId": "1683", "paidOnly": false, "title": "Invalid Tweets", "titleSlug": "invalid-tweets", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 606117, "totalSubmissionRaw": 710082}, "1684": {"acRate": 83.5234406541289, "difficulty": "Easy", "likes": 1722, "dislikes": 73, "categoryTitle": "Algorithms", "frontendQuestionId": "1684", "paidOnly": false, "title": "Count the Number of Consistent Strings", "titleSlug": "count-the-number-of-consistent-strings", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 188259, "totalSubmissionRaw": 225397}, "1685": {"acRate": 68.42208866716288, "difficulty": "Medium", "likes": 2067, "dislikes": 73, "categoryTitle": "Algorithms", "frontendQuestionId": "1685", "paidOnly": false, "title": "Sum of Absolute Differences in a Sorted Array", "titleSlug": "sum-of-absolute-differences-in-a-sorted-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 111229, "totalSubmissionRaw": 162563}, "1686": {"acRate": 57.40781998440458, "difficulty": "Medium", "likes": 832, "dislikes": 72, "categoryTitle": "Algorithms", "frontendQuestionId": "1686", "paidOnly": false, "title": "Stone Game VI", "titleSlug": "stone-game-vi", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20614, "totalSubmissionRaw": 35908}, "1687": {"acRate": 39.099917423616844, "difficulty": "Hard", "likes": 376, "dislikes": 30, "categoryTitle": "Algorithms", "frontendQuestionId": "1687", "paidOnly": false, "title": "Delivering Boxes from Storage to Ports", "titleSlug": "delivering-boxes-from-storage-to-ports", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}, {"name": "Monotonic Queue", "id": "VG9waWNUYWdOb2RlOjYxMDcx", "slug": "monotonic-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6629, "totalSubmissionRaw": 16954}, "1688": {"acRate": 85.725929629655, "difficulty": "Easy", "likes": 1759, "dislikes": 238, "categoryTitle": "Algorithms", "frontendQuestionId": "1688", "paidOnly": false, "title": "Count of Matches in Tournament", "titleSlug": "count-of-matches-in-tournament", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 250318, "totalSubmissionRaw": 291998}, "1689": {"acRate": 88.73135448005749, "difficulty": "Medium", "likes": 2420, "dislikes": 1493, "categoryTitle": "Algorithms", "frontendQuestionId": "1689", "paidOnly": false, "title": "Partitioning Into Minimum Number Of Deci-Binary Numbers", "titleSlug": "partitioning-into-minimum-number-of-deci-binary-numbers", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 224737, "totalSubmissionRaw": 253278}, "1690": {"acRate": 58.11323751290399, "difficulty": "Medium", "likes": 988, "dislikes": 171, "categoryTitle": "Algorithms", "frontendQuestionId": "1690", "paidOnly": false, "title": "Stone Game VII", "titleSlug": "stone-game-vii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 36591, "totalSubmissionRaw": 62965}, "1691": {"acRate": 58.077180886718374, "difficulty": "Hard", "likes": 1156, "dislikes": 33, "categoryTitle": "Algorithms", "frontendQuestionId": "1691", "paidOnly": false, "title": "Maximum Height by Stacking Cuboids ", "titleSlug": "maximum-height-by-stacking-cuboids", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30325, "totalSubmissionRaw": 52215}, "1692": {"acRate": 62.60394392967451, "difficulty": "Hard", "likes": 73, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "1692", "paidOnly": true, "title": "Count Ways to Distribute Candies", "titleSlug": "count-ways-to-distribute-candies", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2635, "totalSubmissionRaw": 4209}, "1693": {"acRate": 86.56339208548307, "difficulty": "Easy", "likes": 554, "dislikes": 32, "categoryTitle": "Database", "frontendQuestionId": "1693", "paidOnly": false, "title": "Daily Leads and Partners", "titleSlug": "daily-leads-and-partners", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 132210, "totalSubmissionRaw": 152732}, "1694": {"acRate": 66.0049256165341, "difficulty": "Easy", "likes": 353, "dislikes": 203, "categoryTitle": "Algorithms", "frontendQuestionId": "1694", "paidOnly": false, "title": "Reformat Phone Number", "titleSlug": "reformat-phone-number", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 39665, "totalSubmissionRaw": 60094}, "1695": {"acRate": 58.44682675056784, "difficulty": "Medium", "likes": 2799, "dislikes": 49, "categoryTitle": "Algorithms", "frontendQuestionId": "1695", "paidOnly": false, "title": "Maximum Erasure Value", "titleSlug": "maximum-erasure-value", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 132264, "totalSubmissionRaw": 226298}, "1696": {"acRate": 45.66730526298177, "difficulty": "Medium", "likes": 3412, "dislikes": 114, "categoryTitle": "Algorithms", "frontendQuestionId": "1696", "paidOnly": false, "title": "Jump Game VI", "titleSlug": "jump-game-vi", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Monotonic Queue", "id": "VG9waWNUYWdOb2RlOjYxMDcx", "slug": "monotonic-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 109175, "totalSubmissionRaw": 239065}, "1697": {"acRate": 62.56393553368076, "difficulty": "Hard", "likes": 1963, "dislikes": 46, "categoryTitle": "Algorithms", "frontendQuestionId": "1697", "paidOnly": false, "title": "Checking Existence of Edge Length Limited Paths", "titleSlug": "checking-existence-of-edge-length-limited-paths", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 51863, "totalSubmissionRaw": 82896}, "1698": {"acRate": 64.20480549199084, "difficulty": "Medium", "likes": 194, "dislikes": 43, "categoryTitle": "Algorithms", "frontendQuestionId": "1698", "paidOnly": true, "title": "Number of Distinct Substrings in a String", "titleSlug": "number-of-distinct-substrings-in-a-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "Suffix Array", "id": "VG9waWNUYWdOb2RlOjU2Njk4", "slug": "suffix-array"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11223, "totalSubmissionRaw": 17480}, "1699": {"acRate": 81.20944230226654, "difficulty": "Medium", "likes": 293, "dislikes": 16, "categoryTitle": "Database", "frontendQuestionId": "1699", "paidOnly": true, "title": "Number of Calls Between Two Persons", "titleSlug": "number-of-calls-between-two-persons", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 43175, "totalSubmissionRaw": 53165}, "1700": {"acRate": 78.31450007655796, "difficulty": "Easy", "likes": 2405, "dislikes": 239, "categoryTitle": "Algorithms", "frontendQuestionId": "1700", "paidOnly": false, "title": "Number of Students Unable to Eat Lunch", "titleSlug": "number-of-students-unable-to-eat-lunch", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 255736, "totalSubmissionRaw": 326550}, "1701": {"acRate": 73.05278906703586, "difficulty": "Medium", "likes": 1211, "dislikes": 97, "categoryTitle": "Algorithms", "frontendQuestionId": "1701", "paidOnly": false, "title": "Average Waiting Time", "titleSlug": "average-waiting-time", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 196286, "totalSubmissionRaw": 268691}, "1702": {"acRate": 47.02206263163347, "difficulty": "Medium", "likes": 495, "dislikes": 55, "categoryTitle": "Algorithms", "frontendQuestionId": "1702", "paidOnly": false, "title": "Maximum Binary String After Change", "titleSlug": "maximum-binary-string-after-change", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13619, "totalSubmissionRaw": 28963}, "1703": {"acRate": 42.637841083962016, "difficulty": "Hard", "likes": 713, "dislikes": 26, "categoryTitle": "Algorithms", "frontendQuestionId": "1703", "paidOnly": false, "title": "Minimum Adjacent Swaps for K Consecutive Ones", "titleSlug": "minimum-adjacent-swaps-for-k-consecutive-ones", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11360, "totalSubmissionRaw": 26643}, "1704": {"acRate": 78.65476425887738, "difficulty": "Easy", "likes": 2246, "dislikes": 124, "categoryTitle": "Algorithms", "frontendQuestionId": "1704", "paidOnly": false, "title": "Determine if String Halves Are Alike", "titleSlug": "determine-if-string-halves-are-alike", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 361959, "totalSubmissionRaw": 460187}, "1705": {"acRate": 39.40164125053989, "difficulty": "Medium", "likes": 831, "dislikes": 187, "categoryTitle": "Algorithms", "frontendQuestionId": "1705", "paidOnly": false, "title": "Maximum Number of Eaten Apples", "titleSlug": "maximum-number-of-eaten-apples", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23719, "totalSubmissionRaw": 60198}, "1706": {"acRate": 71.86948227223834, "difficulty": "Medium", "likes": 3092, "dislikes": 180, "categoryTitle": "Algorithms", "frontendQuestionId": "1706", "paidOnly": false, "title": "Where Will the Ball Fall", "titleSlug": "where-will-the-ball-fall", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 141649, "totalSubmissionRaw": 197092}, "1707": {"acRate": 51.323816618680404, "difficulty": "Hard", "likes": 1225, "dislikes": 38, "categoryTitle": "Algorithms", "frontendQuestionId": "1707", "paidOnly": false, "title": "Maximum XOR With an Element From Array", "titleSlug": "maximum-xor-with-an-element-from-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25491, "totalSubmissionRaw": 49667}, "1708": {"acRate": 64.96209305782666, "difficulty": "Easy", "likes": 103, "dislikes": 112, "categoryTitle": "Algorithms", "frontendQuestionId": "1708", "paidOnly": true, "title": "Largest Subarray Length K", "titleSlug": "largest-subarray-length-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8739, "totalSubmissionRaw": 13453}, "1709": {"acRate": 70.5054288975387, "difficulty": "Medium", "likes": 209, "dislikes": 15, "categoryTitle": "Database", "frontendQuestionId": "1709", "paidOnly": true, "title": "Biggest Window Between Visits", "titleSlug": "biggest-window-between-visits", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 24091, "totalSubmissionRaw": 34169}, "1710": {"acRate": 73.74889405325061, "difficulty": "Easy", "likes": 3831, "dislikes": 222, "categoryTitle": "Algorithms", "frontendQuestionId": "1710", "paidOnly": false, "title": "Maximum Units on a Truck", "titleSlug": "maximum-units-on-a-truck", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 312581, "totalSubmissionRaw": 423845}, "1711": {"acRate": 30.464352899063986, "difficulty": "Medium", "likes": 1046, "dislikes": 237, "categoryTitle": "Algorithms", "frontendQuestionId": "1711", "paidOnly": false, "title": "Count Good Meals", "titleSlug": "count-good-meals", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 40000, "totalSubmissionRaw": 131301}, "1712": {"acRate": 33.04265290383817, "difficulty": "Medium", "likes": 1405, "dislikes": 104, "categoryTitle": "Algorithms", "frontendQuestionId": "1712", "paidOnly": false, "title": "Ways to Split Array Into Three Subarrays", "titleSlug": "ways-to-split-array-into-three-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33420, "totalSubmissionRaw": 101142}, "1713": {"acRate": 47.69871280699744, "difficulty": "Hard", "likes": 718, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "1713", "paidOnly": false, "title": "Minimum Operations to Make a Subsequence", "titleSlug": "minimum-operations-to-make-a-subsequence", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12488, "totalSubmissionRaw": 26181}, "1714": {"acRate": 49.666080843585235, "difficulty": "Hard", "likes": 31, "dislikes": 24, "categoryTitle": "Algorithms", "frontendQuestionId": "1714", "paidOnly": true, "title": "Sum Of Special Evenly-Spaced Elements In Array", "titleSlug": "sum-of-special-evenly-spaced-elements-in-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1413, "totalSubmissionRaw": 2845}, "1715": {"acRate": 75.60285727983126, "difficulty": "Medium", "likes": 82, "dislikes": 22, "categoryTitle": "Database", "frontendQuestionId": "1715", "paidOnly": true, "title": "Count Apples and Oranges", "titleSlug": "count-apples-and-oranges", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15770, "totalSubmissionRaw": 20859}, "1716": {"acRate": 78.37417178653175, "difficulty": "Easy", "likes": 1433, "dislikes": 51, "categoryTitle": "Algorithms", "frontendQuestionId": "1716", "paidOnly": false, "title": "Calculate Money in Leetcode Bank", "titleSlug": "calculate-money-in-leetcode-bank", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 162646, "totalSubmissionRaw": 207525}, "1717": {"acRate": 63.071434575118836, "difficulty": "Medium", "likes": 1402, "dislikes": 115, "categoryTitle": "Algorithms", "frontendQuestionId": "1717", "paidOnly": false, "title": "Maximum Score From Removing Substrings", "titleSlug": "maximum-score-from-removing-substrings", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 135070, "totalSubmissionRaw": 214154}, "1718": {"acRate": 53.92742996803911, "difficulty": "Medium", "likes": 564, "dislikes": 54, "categoryTitle": "Algorithms", "frontendQuestionId": "1718", "paidOnly": false, "title": "Construct the Lexicographically Largest Valid Sequence", "titleSlug": "construct-the-lexicographically-largest-valid-sequence", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14342, "totalSubmissionRaw": 26594}, "1719": {"acRate": 44.684926259337296, "difficulty": "Hard", "likes": 219, "dislikes": 153, "categoryTitle": "Algorithms", "frontendQuestionId": "1719", "paidOnly": false, "title": "Number Of Ways To Reconstruct A Tree", "titleSlug": "number-of-ways-to-reconstruct-a-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4666, "totalSubmissionRaw": 10442}, "1720": {"acRate": 86.51628582146759, "difficulty": "Easy", "likes": 1592, "dislikes": 215, "categoryTitle": "Algorithms", "frontendQuestionId": "1720", "paidOnly": false, "title": "Decode XORed Array", "titleSlug": "decode-xored-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 159132, "totalSubmissionRaw": 183933}, "1721": {"acRate": 68.03596724731082, "difficulty": "Medium", "likes": 5357, "dislikes": 182, "categoryTitle": "Algorithms", "frontendQuestionId": "1721", "paidOnly": false, "title": "Swapping Nodes in a Linked List", "titleSlug": "swapping-nodes-in-a-linked-list", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 349644, "totalSubmissionRaw": 513910}, "1722": {"acRate": 48.91680994577437, "difficulty": "Medium", "likes": 841, "dislikes": 26, "categoryTitle": "Algorithms", "frontendQuestionId": "1722", "paidOnly": false, "title": "Minimize Hamming Distance After Swap Operations", "titleSlug": "minimize-hamming-distance-after-swap-operations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18493, "totalSubmissionRaw": 37805}, "1723": {"acRate": 42.50336675145893, "difficulty": "Hard", "likes": 1047, "dislikes": 30, "categoryTitle": "Algorithms", "frontendQuestionId": "1723", "paidOnly": false, "title": "Find Minimum Time to Finish All Jobs", "titleSlug": "find-minimum-time-to-finish-all-jobs", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28405, "totalSubmissionRaw": 66830}, "1724": {"acRate": 51.50033715441672, "difficulty": "Hard", "likes": 105, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "1724", "paidOnly": true, "title": "Checking Existence of Edge Length Limited Paths II", "titleSlug": "checking-existence-of-edge-length-limited-paths-ii", "topicTags": [{"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Minimum Spanning Tree", "id": "VG9waWNUYWdOb2RlOjYxMDgz", "slug": "minimum-spanning-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3055, "totalSubmissionRaw": 5932}, "1725": {"acRate": 78.79790697424546, "difficulty": "Easy", "likes": 590, "dislikes": 72, "categoryTitle": "Algorithms", "frontendQuestionId": "1725", "paidOnly": false, "title": "Number Of Rectangles That Can Form The Largest Square", "titleSlug": "number-of-rectangles-that-can-form-the-largest-square", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 73338, "totalSubmissionRaw": 93071}, "1726": {"acRate": 61.224315798448295, "difficulty": "Medium", "likes": 627, "dislikes": 27, "categoryTitle": "Algorithms", "frontendQuestionId": "1726", "paidOnly": false, "title": "Tuple with Same Product", "titleSlug": "tuple-with-same-product", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28724, "totalSubmissionRaw": 46916}, "1727": {"acRate": 75.36392208758943, "difficulty": "Medium", "likes": 1913, "dislikes": 102, "categoryTitle": "Algorithms", "frontendQuestionId": "1727", "paidOnly": false, "title": "Largest Submatrix With Rearrangements", "titleSlug": "largest-submatrix-with-rearrangements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 72895, "totalSubmissionRaw": 96724}, "1728": {"acRate": 40.02608270390697, "difficulty": "Hard", "likes": 270, "dislikes": 44, "categoryTitle": "Algorithms", "frontendQuestionId": "1728", "paidOnly": false, "title": "Cat and Mouse II", "titleSlug": "cat-and-mouse-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7366, "totalSubmissionRaw": 18403}, "1729": {"acRate": 69.15502924032278, "difficulty": "Easy", "likes": 579, "dislikes": 32, "categoryTitle": "Database", "frontendQuestionId": "1729", "paidOnly": false, "title": "Find Followers Count", "titleSlug": "find-followers-count", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 217940, "totalSubmissionRaw": 315147}, "1730": {"acRate": 55.0478771154038, "difficulty": "Medium", "likes": 675, "dislikes": 40, "categoryTitle": "Algorithms", "frontendQuestionId": "1730", "paidOnly": true, "title": "Shortest Path to Get Food", "titleSlug": "shortest-path-to-get-food", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 66227, "totalSubmissionRaw": 120308}, "1731": {"acRate": 48.92373302550783, "difficulty": "Easy", "likes": 540, "dislikes": 72, "categoryTitle": "Database", "frontendQuestionId": "1731", "paidOnly": false, "title": "The Number of Employees Which Report to Each Employee", "titleSlug": "the-number-of-employees-which-report-to-each-employee", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 152574, "totalSubmissionRaw": 311852}, "1732": {"acRate": 83.42533901886212, "difficulty": "Easy", "likes": 2886, "dislikes": 345, "categoryTitle": "Algorithms", "frontendQuestionId": "1732", "paidOnly": false, "title": "Find the Highest Altitude", "titleSlug": "find-the-highest-altitude", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 434319, "totalSubmissionRaw": 520609}, "1733": {"acRate": 42.78416347381865, "difficulty": "Medium", "likes": 215, "dislikes": 397, "categoryTitle": "Algorithms", "frontendQuestionId": "1733", "paidOnly": false, "title": "Minimum Number of People to Teach", "titleSlug": "minimum-number-of-people-to-teach", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9715, "totalSubmissionRaw": 22707}, "1734": {"acRate": 65.13757750131701, "difficulty": "Medium", "likes": 764, "dislikes": 30, "categoryTitle": "Algorithms", "frontendQuestionId": "1734", "paidOnly": false, "title": "Decode XORed Permutation", "titleSlug": "decode-xored-permutation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16074, "totalSubmissionRaw": 24677}, "1735": {"acRate": 51.928063571727314, "difficulty": "Hard", "likes": 290, "dislikes": 33, "categoryTitle": "Algorithms", "frontendQuestionId": "1735", "paidOnly": false, "title": "Count Ways to Make Array With Product", "titleSlug": "count-ways-to-make-array-with-product", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6208, "totalSubmissionRaw": 11955}, "1736": {"acRate": 42.85730557200784, "difficulty": "Easy", "likes": 367, "dislikes": 183, "categoryTitle": "Algorithms", "frontendQuestionId": "1736", "paidOnly": false, "title": "Latest Time by Replacing Hidden Digits", "titleSlug": "latest-time-by-replacing-hidden-digits", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 37627, "totalSubmissionRaw": 87796}, "1737": {"acRate": 36.82892760192921, "difficulty": "Medium", "likes": 323, "dislikes": 341, "categoryTitle": "Algorithms", "frontendQuestionId": "1737", "paidOnly": false, "title": "Change Minimum Characters to Satisfy One of Three Conditions", "titleSlug": "change-minimum-characters-to-satisfy-one-of-three-conditions", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13974, "totalSubmissionRaw": 37943}, "1738": {"acRate": 61.91464137522229, "difficulty": "Medium", "likes": 507, "dislikes": 78, "categoryTitle": "Algorithms", "frontendQuestionId": "1738", "paidOnly": false, "title": "Find Kth Largest XOR Coordinate Value", "titleSlug": "find-kth-largest-xor-coordinate-value", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}, {"name": "Quickselect", "id": "VG9waWNUYWdOb2RlOjYxMDY5", "slug": "quickselect"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22979, "totalSubmissionRaw": 37114}, "1739": {"acRate": 51.99231877100337, "difficulty": "Hard", "likes": 306, "dislikes": 44, "categoryTitle": "Algorithms", "frontendQuestionId": "1739", "paidOnly": false, "title": "Building Boxes", "titleSlug": "building-boxes", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7581, "totalSubmissionRaw": 14581}, "1740": {"acRate": 73.57021517553794, "difficulty": "Medium", "likes": 460, "dislikes": 18, "categoryTitle": "Algorithms", "frontendQuestionId": "1740", "paidOnly": true, "title": "Find Distance in a Binary Tree", "titleSlug": "find-distance-in-a-binary-tree", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 31182, "totalSubmissionRaw": 42384}, "1741": {"acRate": 86.82093042982999, "difficulty": "Easy", "likes": 714, "dislikes": 19, "categoryTitle": "Database", "frontendQuestionId": "1741", "paidOnly": false, "title": "Find Total Time Spent by Each Employee", "titleSlug": "find-total-time-spent-by-each-employee", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 143288, "totalSubmissionRaw": 165037}, "1742": {"acRate": 73.56806731993578, "difficulty": "Easy", "likes": 605, "dislikes": 162, "categoryTitle": "Algorithms", "frontendQuestionId": "1742", "paidOnly": false, "title": "Maximum Number of Balls in a Box", "titleSlug": "maximum-number-of-balls-in-a-box", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 66443, "totalSubmissionRaw": 90315}, "1743": {"acRate": 74.77276636735817, "difficulty": "Medium", "likes": 1949, "dislikes": 69, "categoryTitle": "Algorithms", "frontendQuestionId": "1743", "paidOnly": false, "title": "Restore the Array From Adjacent Pairs", "titleSlug": "restore-the-array-from-adjacent-pairs", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 108669, "totalSubmissionRaw": 145333}, "1744": {"acRate": 34.47261345852895, "difficulty": "Medium", "likes": 131, "dislikes": 328, "categoryTitle": "Algorithms", "frontendQuestionId": "1744", "paidOnly": false, "title": "Can You Eat Your Favorite Candy on Your Favorite Day?", "titleSlug": "can-you-eat-your-favorite-candy-on-your-favorite-day", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11014, "totalSubmissionRaw": 31950}, "1745": {"acRate": 44.38055679516666, "difficulty": "Hard", "likes": 914, "dislikes": 27, "categoryTitle": "Algorithms", "frontendQuestionId": "1745", "paidOnly": false, "title": "Palindrome Partitioning IV", "titleSlug": "palindrome-partitioning-iv", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25857, "totalSubmissionRaw": 58262}, "1746": {"acRate": 62.321476690918885, "difficulty": "Medium", "likes": 275, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "1746", "paidOnly": true, "title": "Maximum Subarray Sum After One Operation", "titleSlug": "maximum-subarray-sum-after-one-operation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9251, "totalSubmissionRaw": 14844}, "1747": {"acRate": 63.44975576700455, "difficulty": "Medium", "likes": 185, "dislikes": 13, "categoryTitle": "Database", "frontendQuestionId": "1747", "paidOnly": true, "title": "Leetflex Banned Accounts", "titleSlug": "leetflex-banned-accounts", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 22472, "totalSubmissionRaw": 35417}, "1748": {"acRate": 78.06984115986212, "difficulty": "Easy", "likes": 1549, "dislikes": 33, "categoryTitle": "Algorithms", "frontendQuestionId": "1748", "paidOnly": false, "title": "Sum of Unique Elements", "titleSlug": "sum-of-unique-elements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 180282, "totalSubmissionRaw": 230924}, "1749": {"acRate": 60.30075628774111, "difficulty": "Medium", "likes": 1273, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "1749", "paidOnly": false, "title": "Maximum Absolute Sum of Any Subarray", "titleSlug": "maximum-absolute-sum-of-any-subarray", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 41142, "totalSubmissionRaw": 68228}, "1750": {"acRate": 55.94160830309679, "difficulty": "Medium", "likes": 1215, "dislikes": 105, "categoryTitle": "Algorithms", "frontendQuestionId": "1750", "paidOnly": false, "title": "Minimum Length of String After Deleting Similar Ends", "titleSlug": "minimum-length-of-string-after-deleting-similar-ends", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 165741, "totalSubmissionRaw": 296275}, "1751": {"acRate": 61.5018726894733, "difficulty": "Hard", "likes": 2076, "dislikes": 40, "categoryTitle": "Algorithms", "frontendQuestionId": "1751", "paidOnly": false, "title": "Maximum Number of Events That Can Be Attended II", "titleSlug": "maximum-number-of-events-that-can-be-attended-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 76028, "totalSubmissionRaw": 123619}, "1752": {"acRate": 51.359641805823884, "difficulty": "Easy", "likes": 3200, "dislikes": 181, "categoryTitle": "Algorithms", "frontendQuestionId": "1752", "paidOnly": false, "title": "Check if Array Is Sorted and Rotated", "titleSlug": "check-if-array-is-sorted-and-rotated", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 286309, "totalSubmissionRaw": 557458}, "1753": {"acRate": 67.42521013704247, "difficulty": "Medium", "likes": 944, "dislikes": 57, "categoryTitle": "Algorithms", "frontendQuestionId": "1753", "paidOnly": false, "title": "Maximum Score From Removing Stones", "titleSlug": "maximum-score-from-removing-stones", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 42755, "totalSubmissionRaw": 63411}, "1754": {"acRate": 48.65063337617037, "difficulty": "Medium", "likes": 547, "dislikes": 77, "categoryTitle": "Algorithms", "frontendQuestionId": "1754", "paidOnly": false, "title": "Largest Merge Of Two Strings", "titleSlug": "largest-merge-of-two-strings", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23850, "totalSubmissionRaw": 49023}, "1755": {"acRate": 39.745285433910745, "difficulty": "Hard", "likes": 898, "dislikes": 67, "categoryTitle": "Algorithms", "frontendQuestionId": "1755", "paidOnly": false, "title": "Closest Subsequence Sum", "titleSlug": "closest-subsequence-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18631, "totalSubmissionRaw": 46876}, "1756": {"acRate": 75.77288687162799, "difficulty": "Medium", "likes": 289, "dislikes": 24, "categoryTitle": "Algorithms", "frontendQuestionId": "1756", "paidOnly": true, "title": "Design Most Recently Used Queue", "titleSlug": "design-most-recently-used-queue", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17696, "totalSubmissionRaw": 23354}, "1757": {"acRate": 89.25531422150969, "difficulty": "Easy", "likes": 2389, "dislikes": 107, "categoryTitle": "Database", "frontendQuestionId": "1757", "paidOnly": false, "title": "Recyclable and Low Fat Products", "titleSlug": "recyclable-and-low-fat-products", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1194741, "totalSubmissionRaw": 1338566}, "1758": {"acRate": 63.760854325171714, "difficulty": "Easy", "likes": 1426, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "1758", "paidOnly": false, "title": "Minimum Changes To Make Alternating Binary String", "titleSlug": "minimum-changes-to-make-alternating-binary-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 148251, "totalSubmissionRaw": 232511}, "1759": {"acRate": 57.674582216013945, "difficulty": "Medium", "likes": 1482, "dislikes": 98, "categoryTitle": "Algorithms", "frontendQuestionId": "1759", "paidOnly": false, "title": "Count Number of Homogenous Substrings", "titleSlug": "count-number-of-homogenous-substrings", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 113131, "totalSubmissionRaw": 196154}, "1760": {"acRate": 60.34513458171351, "difficulty": "Medium", "likes": 1989, "dislikes": 49, "categoryTitle": "Algorithms", "frontendQuestionId": "1760", "paidOnly": false, "title": "Minimum Limit of Balls in a Bag", "titleSlug": "minimum-limit-of-balls-in-a-bag", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 40669, "totalSubmissionRaw": 67394}, "1761": {"acRate": 42.55384282935965, "difficulty": "Hard", "likes": 323, "dislikes": 286, "categoryTitle": "Algorithms", "frontendQuestionId": "1761", "paidOnly": false, "title": "Minimum Degree of a Connected Trio in a Graph", "titleSlug": "minimum-degree-of-a-connected-trio-in-a-graph", "topicTags": [{"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23631, "totalSubmissionRaw": 55532}, "1762": {"acRate": 79.85102447053197, "difficulty": "Medium", "likes": 1215, "dislikes": 150, "categoryTitle": "Algorithms", "frontendQuestionId": "1762", "paidOnly": true, "title": "Buildings With an Ocean View", "titleSlug": "buildings-with-an-ocean-view", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 227048, "totalSubmissionRaw": 284340}, "1763": {"acRate": 60.80798140742447, "difficulty": "Easy", "likes": 1340, "dislikes": 885, "categoryTitle": "Algorithms", "frontendQuestionId": "1763", "paidOnly": false, "title": "Longest Nice Substring", "titleSlug": "longest-nice-substring", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 58085, "totalSubmissionRaw": 95522}, "1764": {"acRate": 53.69492656875835, "difficulty": "Medium", "likes": 331, "dislikes": 43, "categoryTitle": "Algorithms", "frontendQuestionId": "1764", "paidOnly": false, "title": "Form Array by Concatenating Subarrays of Another Array", "titleSlug": "form-array-by-concatenating-subarrays-of-another-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16087, "totalSubmissionRaw": 29960}, "1765": {"acRate": 62.84468328781605, "difficulty": "Medium", "likes": 826, "dislikes": 50, "categoryTitle": "Algorithms", "frontendQuestionId": "1765", "paidOnly": false, "title": "Map of Highest Peak", "titleSlug": "map-of-highest-peak", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28534, "totalSubmissionRaw": 45404}, "1766": {"acRate": 41.327318540193446, "difficulty": "Hard", "likes": 401, "dislikes": 33, "categoryTitle": "Algorithms", "frontendQuestionId": "1766", "paidOnly": false, "title": "Tree of Coprimes", "titleSlug": "tree-of-coprimes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10169, "totalSubmissionRaw": 24606}, "1767": {"acRate": 77.32751091703058, "difficulty": "Hard", "likes": 172, "dislikes": 13, "categoryTitle": "Database", "frontendQuestionId": "1767", "paidOnly": true, "title": "Find the Subtasks That Did Not Execute", "titleSlug": "find-the-subtasks-that-did-not-execute", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13281, "totalSubmissionRaw": 17175}, "1768": {"acRate": 80.4787686024797, "difficulty": "Easy", "likes": 3905, "dislikes": 98, "categoryTitle": "Algorithms", "frontendQuestionId": "1768", "paidOnly": false, "title": "Merge Strings Alternately", "titleSlug": "merge-strings-alternately", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 991623, "totalSubmissionRaw": 1232156}, "1769": {"acRate": 85.92491010734626, "difficulty": "Medium", "likes": 2252, "dislikes": 93, "categoryTitle": "Algorithms", "frontendQuestionId": "1769", "paidOnly": false, "title": "Minimum Number of Operations to Move All Balls to Each Box", "titleSlug": "minimum-number-of-operations-to-move-all-balls-to-each-box", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 130953, "totalSubmissionRaw": 152404}, "1770": {"acRate": 40.67450924558187, "difficulty": "Hard", "likes": 2520, "dislikes": 512, "categoryTitle": "Algorithms", "frontendQuestionId": "1770", "paidOnly": false, "title": "Maximum Score from Performing Multiplication Operations", "titleSlug": "maximum-score-from-performing-multiplication-operations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 114273, "totalSubmissionRaw": 280945}, "1771": {"acRate": 36.47898493259318, "difficulty": "Hard", "likes": 540, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "1771", "paidOnly": false, "title": "Maximize Palindrome Length From Subsequences", "titleSlug": "maximize-palindrome-length-from-subsequences", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11500, "totalSubmissionRaw": 31525}, "1772": {"acRate": 65.7975622681505, "difficulty": "Medium", "likes": 89, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "1772", "paidOnly": true, "title": "Sort Features by Popularity", "titleSlug": "sort-features-by-popularity", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6208, "totalSubmissionRaw": 9435}, "1773": {"acRate": 84.71042834245688, "difficulty": "Easy", "likes": 1891, "dislikes": 228, "categoryTitle": "Algorithms", "frontendQuestionId": "1773", "paidOnly": false, "title": "Count Items Matching a Rule", "titleSlug": "count-items-matching-a-rule", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 234132, "totalSubmissionRaw": 276391}, "1774": {"acRate": 47.64532800756178, "difficulty": "Medium", "likes": 707, "dislikes": 89, "categoryTitle": "Algorithms", "frontendQuestionId": "1774", "paidOnly": false, "title": "Closest Dessert Cost", "titleSlug": "closest-dessert-cost", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 31252, "totalSubmissionRaw": 65593}, "1775": {"acRate": 53.756987243801056, "difficulty": "Medium", "likes": 921, "dislikes": 45, "categoryTitle": "Algorithms", "frontendQuestionId": "1775", "paidOnly": false, "title": "Equal Sum Arrays With Minimum Number of Operations", "titleSlug": "equal-sum-arrays-with-minimum-number-of-operations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30005, "totalSubmissionRaw": 55816}, "1776": {"acRate": 55.4166928342649, "difficulty": "Hard", "likes": 891, "dislikes": 35, "categoryTitle": "Algorithms", "frontendQuestionId": "1776", "paidOnly": false, "title": "Car Fleet II", "titleSlug": "car-fleet-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26472, "totalSubmissionRaw": 47769}, "1777": {"acRate": 82.22013170272812, "difficulty": "Easy", "likes": 134, "dislikes": 13, "categoryTitle": "Database", "frontendQuestionId": "1777", "paidOnly": true, "title": "Product's Price for Each Store", "titleSlug": "products-price-for-each-store", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 20976, "totalSubmissionRaw": 25512}, "1778": {"acRate": 40.19986943202933, "difficulty": "Medium", "likes": 167, "dislikes": 67, "categoryTitle": "Algorithms", "frontendQuestionId": "1778", "paidOnly": true, "title": "Shortest Path in a Hidden Grid", "titleSlug": "shortest-path-in-a-hidden-grid", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8005, "totalSubmissionRaw": 19913}, "1779": {"acRate": 68.69963316214233, "difficulty": "Easy", "likes": 845, "dislikes": 187, "categoryTitle": "Algorithms", "frontendQuestionId": "1779", "paidOnly": false, "title": "Find Nearest Point That Has the Same X or Y Coordinate", "titleSlug": "find-nearest-point-that-has-the-same-x-or-y-coordinate", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 117047, "totalSubmissionRaw": 170375}, "1780": {"acRate": 67.97691637630662, "difficulty": "Medium", "likes": 973, "dislikes": 32, "categoryTitle": "Algorithms", "frontendQuestionId": "1780", "paidOnly": false, "title": "Check if Number is a Sum of Powers of Three", "titleSlug": "check-if-number-is-a-sum-of-powers-of-three", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 43701, "totalSubmissionRaw": 64288}, "1781": {"acRate": 67.09824908872548, "difficulty": "Medium", "likes": 1115, "dislikes": 178, "categoryTitle": "Algorithms", "frontendQuestionId": "1781", "paidOnly": false, "title": "Sum of Beauty of All Substrings", "titleSlug": "sum-of-beauty-of-all-substrings", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 63689, "totalSubmissionRaw": 94920}, "1782": {"acRate": 40.377423623496924, "difficulty": "Hard", "likes": 314, "dislikes": 163, "categoryTitle": "Algorithms", "frontendQuestionId": "1782", "paidOnly": false, "title": "Count Pairs Of Nodes", "titleSlug": "count-pairs-of-nodes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7018, "totalSubmissionRaw": 17381}, "1783": {"acRate": 83.59902294786913, "difficulty": "Medium", "likes": 231, "dislikes": 9, "categoryTitle": "Database", "frontendQuestionId": "1783", "paidOnly": true, "title": "Grand Slam Titles", "titleSlug": "grand-slam-titles", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26011, "totalSubmissionRaw": 31114}, "1784": {"acRate": 39.21335336569776, "difficulty": "Easy", "likes": 337, "dislikes": 967, "categoryTitle": "Algorithms", "frontendQuestionId": "1784", "paidOnly": false, "title": "Check if Binary String Has at Most One Segment of Ones", "titleSlug": "check-if-binary-string-has-at-most-one-segment-of-ones", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 45153, "totalSubmissionRaw": 115147}, "1785": {"acRate": 43.63016532997025, "difficulty": "Medium", "likes": 264, "dislikes": 192, "categoryTitle": "Algorithms", "frontendQuestionId": "1785", "paidOnly": false, "title": "Minimum Elements to Add to Form a Given Sum", "titleSlug": "minimum-elements-to-add-to-form-a-given-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22141, "totalSubmissionRaw": 50747}, "1786": {"acRate": 39.215655699360674, "difficulty": "Medium", "likes": 1094, "dislikes": 211, "categoryTitle": "Algorithms", "frontendQuestionId": "1786", "paidOnly": false, "title": "Number of Restricted Paths From First to Last Node", "titleSlug": "number-of-restricted-paths-from-first-to-last-node", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25149, "totalSubmissionRaw": 64129}, "1787": {"acRate": 39.790307207273266, "difficulty": "Hard", "likes": 401, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "1787", "paidOnly": false, "title": "Make the XOR of All Segments Equal to Zero", "titleSlug": "make-the-xor-of-all-segments-equal-to-zero", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5427, "totalSubmissionRaw": 13639}, "1788": {"acRate": 67.12529274004683, "difficulty": "Hard", "likes": 75, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "1788", "paidOnly": true, "title": "Maximize the Beauty of the Garden", "titleSlug": "maximize-the-beauty-of-the-garden", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2293, "totalSubmissionRaw": 3416}, "1789": {"acRate": 64.67584516007355, "difficulty": "Easy", "likes": 511, "dislikes": 219, "categoryTitle": "Database", "frontendQuestionId": "1789", "paidOnly": false, "title": "Primary Department for Each Employee", "titleSlug": "primary-department-for-each-employee", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 137171, "totalSubmissionRaw": 212090}, "1790": {"acRate": 45.78017424217705, "difficulty": "Easy", "likes": 1092, "dislikes": 59, "categoryTitle": "Algorithms", "frontendQuestionId": "1790", "paidOnly": false, "title": "Check if One String Swap Can Make Strings Equal", "titleSlug": "check-if-one-string-swap-can-make-strings-equal", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 112242, "totalSubmissionRaw": 245176}, "1791": {"acRate": 86.67773842836596, "difficulty": "Easy", "likes": 1796, "dislikes": 174, "categoryTitle": "Algorithms", "frontendQuestionId": "1791", "paidOnly": false, "title": "Find Center of Star Graph", "titleSlug": "find-center-of-star-graph", "topicTags": [{"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 342898, "totalSubmissionRaw": 395601}, "1792": {"acRate": 54.07873864346489, "difficulty": "Medium", "likes": 726, "dislikes": 85, "categoryTitle": "Algorithms", "frontendQuestionId": "1792", "paidOnly": false, "title": "Maximum Average Pass Ratio", "titleSlug": "maximum-average-pass-ratio", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22500, "totalSubmissionRaw": 41606}, "1793": {"acRate": 64.3415457994212, "difficulty": "Hard", "likes": 1857, "dislikes": 48, "categoryTitle": "Algorithms", "frontendQuestionId": "1793", "paidOnly": false, "title": "Maximum Score of a Good Subarray", "titleSlug": "maximum-score-of-a-good-subarray", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 75813, "totalSubmissionRaw": 117829}, "1794": {"acRate": 65.34589152322182, "difficulty": "Medium", "likes": 44, "dislikes": 59, "categoryTitle": "Algorithms", "frontendQuestionId": "1794", "paidOnly": true, "title": "Count Pairs of Equal Substrings With Minimum Difference", "titleSlug": "count-pairs-of-equal-substrings-with-minimum-difference", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2012, "totalSubmissionRaw": 3079}, "1795": {"acRate": 85.30819397888143, "difficulty": "Easy", "likes": 856, "dislikes": 56, "categoryTitle": "Database", "frontendQuestionId": "1795", "paidOnly": false, "title": "Rearrange Products Table", "titleSlug": "rearrange-products-table", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 135643, "totalSubmissionRaw": 159004}, "1796": {"acRate": 50.628688304721024, "difficulty": "Easy", "likes": 529, "dislikes": 130, "categoryTitle": "Algorithms", "frontendQuestionId": "1796", "paidOnly": false, "title": "Second Largest Digit in a String", "titleSlug": "second-largest-digit-in-a-string", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 60398, "totalSubmissionRaw": 119296}, "1797": {"acRate": 57.68849933988558, "difficulty": "Medium", "likes": 375, "dislikes": 50, "categoryTitle": "Algorithms", "frontendQuestionId": "1797", "paidOnly": false, "title": "Design Authentication Manager", "titleSlug": "design-authentication-manager", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Doubly-Linked List", "id": "VG9waWNUYWdOb2RlOjYxMDU4", "slug": "doubly-linked-list"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 31461, "totalSubmissionRaw": 54536}, "1798": {"acRate": 61.01751611726067, "difficulty": "Medium", "likes": 814, "dislikes": 59, "categoryTitle": "Algorithms", "frontendQuestionId": "1798", "paidOnly": false, "title": "Maximum Number of Consecutive Values You Can Make", "titleSlug": "maximum-number-of-consecutive-values-you-can-make", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20065, "totalSubmissionRaw": 32884}, "1799": {"acRate": 57.75094523722405, "difficulty": "Hard", "likes": 1630, "dislikes": 111, "categoryTitle": "Algorithms", "frontendQuestionId": "1799", "paidOnly": false, "title": "Maximize Score After N Operations", "titleSlug": "maximize-score-after-n-operations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 61555, "totalSubmissionRaw": 106587}, "1800": {"acRate": 61.968468326339156, "difficulty": "Easy", "likes": 722, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "1800", "paidOnly": false, "title": "Maximum Ascending Subarray Sum", "titleSlug": "maximum-ascending-subarray-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 58919, "totalSubmissionRaw": 95079}, "1801": {"acRate": 49.91004290261568, "difficulty": "Medium", "likes": 293, "dislikes": 237, "categoryTitle": "Algorithms", "frontendQuestionId": "1801", "paidOnly": false, "title": "Number of Orders in the Backlog", "titleSlug": "number-of-orders-in-the-backlog", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21638, "totalSubmissionRaw": 43354}, "1802": {"acRate": 39.208973160635594, "difficulty": "Medium", "likes": 2544, "dislikes": 448, "categoryTitle": "Algorithms", "frontendQuestionId": "1802", "paidOnly": false, "title": "Maximum Value at a Given Index in a Bounded Array", "titleSlug": "maximum-value-at-a-given-index-in-a-bounded-array", "topicTags": [{"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 73409, "totalSubmissionRaw": 187225}, "1803": {"acRate": 48.11745085156921, "difficulty": "Hard", "likes": 527, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "1803", "paidOnly": false, "title": "Count Pairs With XOR in a Range", "titleSlug": "count-pairs-with-xor-in-a-range", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9521, "totalSubmissionRaw": 19787}, "1804": {"acRate": 61.42703337574631, "difficulty": "Medium", "likes": 320, "dislikes": 18, "categoryTitle": "Algorithms", "frontendQuestionId": "1804", "paidOnly": true, "title": "Implement Trie II (Prefix Tree)", "titleSlug": "implement-trie-ii-prefix-tree", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 18828, "totalSubmissionRaw": 30651}, "1805": {"acRate": 38.097766287327936, "difficulty": "Easy", "likes": 612, "dislikes": 101, "categoryTitle": "Algorithms", "frontendQuestionId": "1805", "paidOnly": false, "title": "Number of Different Integers in a String", "titleSlug": "number-of-different-integers-in-a-string", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 49513, "totalSubmissionRaw": 129963}, "1806": {"acRate": 72.824042729256, "difficulty": "Medium", "likes": 318, "dislikes": 167, "categoryTitle": "Algorithms", "frontendQuestionId": "1806", "paidOnly": false, "title": "Minimum Number of Operations to Reinitialize a Permutation", "titleSlug": "minimum-number-of-operations-to-reinitialize-a-permutation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19361, "totalSubmissionRaw": 26586}, "1807": {"acRate": 67.02654453488618, "difficulty": "Medium", "likes": 482, "dislikes": 41, "categoryTitle": "Algorithms", "frontendQuestionId": "1807", "paidOnly": false, "title": "Evaluate the Bracket Pairs of a String", "titleSlug": "evaluate-the-bracket-pairs-of-a-string", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 31538, "totalSubmissionRaw": 47053}, "1808": {"acRate": 33.19639972305562, "difficulty": "Hard", "likes": 224, "dislikes": 167, "categoryTitle": "Algorithms", "frontendQuestionId": "1808", "paidOnly": false, "title": "Maximize Number of Nice Divisors", "titleSlug": "maximize-number-of-nice-divisors", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7191, "totalSubmissionRaw": 21664}, "1809": {"acRate": 58.59618591835255, "difficulty": "Easy", "likes": 90, "dislikes": 61, "categoryTitle": "Database", "frontendQuestionId": "1809", "paidOnly": true, "title": "Ad-Free Sessions", "titleSlug": "ad-free-sessions", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16162, "totalSubmissionRaw": 27582}, "1810": {"acRate": 56.86508613337882, "difficulty": "Medium", "likes": 86, "dislikes": 26, "categoryTitle": "Algorithms", "frontendQuestionId": "1810", "paidOnly": true, "title": "Minimum Path Cost in a Hidden Grid", "titleSlug": "minimum-path-cost-in-a-hidden-grid", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3334, "totalSubmissionRaw": 5863}, "1811": {"acRate": 60.99702208299493, "difficulty": "Medium", "likes": 197, "dislikes": 26, "categoryTitle": "Database", "frontendQuestionId": "1811", "paidOnly": true, "title": "Find Interview Candidates", "titleSlug": "find-interview-candidates", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15772, "totalSubmissionRaw": 25857}, "1812": {"acRate": 78.63108520424427, "difficulty": "Easy", "likes": 813, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "1812", "paidOnly": false, "title": "Determine Color of a Chessboard Square", "titleSlug": "determine-color-of-a-chessboard-square", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 86331, "totalSubmissionRaw": 109793}, "1813": {"acRate": 33.68874425727412, "difficulty": "Medium", "likes": 403, "dislikes": 69, "categoryTitle": "Algorithms", "frontendQuestionId": "1813", "paidOnly": false, "title": "Sentence Similarity III", "titleSlug": "sentence-similarity-iii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17599, "totalSubmissionRaw": 52236}, "1814": {"acRate": 48.74642117781791, "difficulty": "Medium", "likes": 1822, "dislikes": 85, "categoryTitle": "Algorithms", "frontendQuestionId": "1814", "paidOnly": false, "title": "Count Nice Pairs in an Array", "titleSlug": "count-nice-pairs-in-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 110669, "totalSubmissionRaw": 227030}, "1815": {"acRate": 40.00716118636988, "difficulty": "Hard", "likes": 341, "dislikes": 27, "categoryTitle": "Algorithms", "frontendQuestionId": "1815", "paidOnly": false, "title": "Maximum Number of Groups Getting Fresh Donuts", "titleSlug": "maximum-number-of-groups-getting-fresh-donuts", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6704, "totalSubmissionRaw": 16757}, "1816": {"acRate": 85.47678884726635, "difficulty": "Easy", "likes": 1138, "dislikes": 33, "categoryTitle": "Algorithms", "frontendQuestionId": "1816", "paidOnly": false, "title": "Truncate Sentence", "titleSlug": "truncate-sentence", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 180262, "totalSubmissionRaw": 210890}, "1817": {"acRate": 80.53598135248386, "difficulty": "Medium", "likes": 827, "dislikes": 306, "categoryTitle": "Algorithms", "frontendQuestionId": "1817", "paidOnly": false, "title": "Finding the Users Active Minutes", "titleSlug": "finding-the-users-active-minutes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 59773, "totalSubmissionRaw": 74219}, "1818": {"acRate": 30.740776096606364, "difficulty": "Medium", "likes": 1021, "dislikes": 76, "categoryTitle": "Algorithms", "frontendQuestionId": "1818", "paidOnly": false, "title": "Minimum Absolute Sum Difference", "titleSlug": "minimum-absolute-sum-difference", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25762, "totalSubmissionRaw": 83804}, "1819": {"acRate": 40.9689516832374, "difficulty": "Hard", "likes": 413, "dislikes": 44, "categoryTitle": "Algorithms", "frontendQuestionId": "1819", "paidOnly": false, "title": "Number of Different Subsequences GCDs", "titleSlug": "number-of-different-subsequences-gcds", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9395, "totalSubmissionRaw": 22932}, "1820": {"acRate": 50.22930243784697, "difficulty": "Medium", "likes": 214, "dislikes": 62, "categoryTitle": "Algorithms", "frontendQuestionId": "1820", "paidOnly": true, "title": "Maximum Number of Accepted Invitations", "titleSlug": "maximum-number-of-accepted-invitations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8324, "totalSubmissionRaw": 16572}, "1821": {"acRate": 87.7478096546985, "difficulty": "Easy", "likes": 58, "dislikes": 25, "categoryTitle": "Database", "frontendQuestionId": "1821", "paidOnly": true, "title": "Find Customers With Positive Revenue this Year", "titleSlug": "find-customers-with-positive-revenue-this-year", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25539, "totalSubmissionRaw": 29105}, "1822": {"acRate": 65.32077257312818, "difficulty": "Easy", "likes": 2161, "dislikes": 218, "categoryTitle": "Algorithms", "frontendQuestionId": "1822", "paidOnly": false, "title": "Sign of the Product of an Array", "titleSlug": "sign-of-the-product-of-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 347871, "totalSubmissionRaw": 532558}, "1823": {"acRate": 81.73125115034475, "difficulty": "Medium", "likes": 3774, "dislikes": 107, "categoryTitle": "Algorithms", "frontendQuestionId": "1823", "paidOnly": false, "title": "Find the Winner of the Circular Game", "titleSlug": "find-the-winner-of-the-circular-game", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 288638, "totalSubmissionRaw": 353155}, "1824": {"acRate": 50.21924606546789, "difficulty": "Medium", "likes": 1192, "dislikes": 48, "categoryTitle": "Algorithms", "frontendQuestionId": "1824", "paidOnly": false, "title": "Minimum Sideway Jumps", "titleSlug": "minimum-sideway-jumps", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 44322, "totalSubmissionRaw": 88257}, "1825": {"acRate": 37.17603843941896, "difficulty": "Hard", "likes": 461, "dislikes": 129, "categoryTitle": "Algorithms", "frontendQuestionId": "1825", "paidOnly": false, "title": "Finding MK Average", "titleSlug": "finding-mk-average", "topicTags": [{"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Data Stream", "id": "VG9waWNUYWdOb2RlOjYxMDYz", "slug": "data-stream"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20039, "totalSubmissionRaw": 53903}, "1826": {"acRate": 50.00485767026134, "difficulty": "Easy", "likes": 67, "dislikes": 76, "categoryTitle": "Algorithms", "frontendQuestionId": "1826", "paidOnly": true, "title": "Faulty Sensor", "titleSlug": "faulty-sensor", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5147, "totalSubmissionRaw": 10293}, "1827": {"acRate": 80.06451714922753, "difficulty": "Easy", "likes": 1233, "dislikes": 63, "categoryTitle": "Algorithms", "frontendQuestionId": "1827", "paidOnly": false, "title": "Minimum Operations to Make the Array Increasing", "titleSlug": "minimum-operations-to-make-the-array-increasing", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 101263, "totalSubmissionRaw": 126477}, "1828": {"acRate": 86.35898774941793, "difficulty": "Medium", "likes": 1144, "dislikes": 83, "categoryTitle": "Algorithms", "frontendQuestionId": "1828", "paidOnly": false, "title": "Queries on Number of Points Inside a Circle", "titleSlug": "queries-on-number-of-points-inside-a-circle", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 79376, "totalSubmissionRaw": 91914}, "1829": {"acRate": 77.1727775371366, "difficulty": "Medium", "likes": 774, "dislikes": 61, "categoryTitle": "Algorithms", "frontendQuestionId": "1829", "paidOnly": false, "title": "Maximum XOR for Each Query", "titleSlug": "maximum-xor-for-each-query", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30288, "totalSubmissionRaw": 39247}, "1830": {"acRate": 50.05452562704471, "difficulty": "Hard", "likes": 180, "dislikes": 126, "categoryTitle": "Algorithms", "frontendQuestionId": "1830", "paidOnly": false, "title": "Minimum Number of Operations to Make String Sorted", "titleSlug": "minimum-number-of-operations-to-make-string-sorted", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4131, "totalSubmissionRaw": 8253}, "1831": {"acRate": 81.77301469984397, "difficulty": "Medium", "likes": 87, "dislikes": 2, "categoryTitle": "Database", "frontendQuestionId": "1831", "paidOnly": true, "title": "Maximum Transaction Each Day", "titleSlug": "maximum-transaction-each-day", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19915, "totalSubmissionRaw": 24354}, "1832": {"acRate": 83.35287248732658, "difficulty": "Easy", "likes": 2768, "dislikes": 57, "categoryTitle": "Algorithms", "frontendQuestionId": "1832", "paidOnly": false, "title": "Check if the Sentence Is Pangram", "titleSlug": "check-if-the-sentence-is-pangram", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 359761, "totalSubmissionRaw": 431612}, "1833": {"acRate": 73.84002016360012, "difficulty": "Medium", "likes": 2174, "dislikes": 672, "categoryTitle": "Algorithms", "frontendQuestionId": "1833", "paidOnly": false, "title": "Maximum Ice Cream Bars", "titleSlug": "maximum-ice-cream-bars", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 161130, "totalSubmissionRaw": 218215}, "1834": {"acRate": 45.66853820928153, "difficulty": "Medium", "likes": 3167, "dislikes": 267, "categoryTitle": "Algorithms", "frontendQuestionId": "1834", "paidOnly": false, "title": "Single-Threaded CPU", "titleSlug": "single-threaded-cpu", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 110295, "totalSubmissionRaw": 241512}, "1835": {"acRate": 61.557250987605926, "difficulty": "Hard", "likes": 602, "dislikes": 50, "categoryTitle": "Algorithms", "frontendQuestionId": "1835", "paidOnly": false, "title": "Find XOR Sum of All Pairs Bitwise AND", "titleSlug": "find-xor-sum-of-all-pairs-bitwise-and", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20413, "totalSubmissionRaw": 33161}, "1836": {"acRate": 74.59369534615877, "difficulty": "Medium", "likes": 398, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "1836", "paidOnly": true, "title": "Remove Duplicates From an Unsorted Linked List", "titleSlug": "remove-duplicates-from-an-unsorted-linked-list", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 34973, "totalSubmissionRaw": 46885}, "1837": {"acRate": 77.57165345782217, "difficulty": "Easy", "likes": 510, "dislikes": 45, "categoryTitle": "Algorithms", "frontendQuestionId": "1837", "paidOnly": false, "title": "Sum of Digits in Base K", "titleSlug": "sum-of-digits-in-base-k", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 57161, "totalSubmissionRaw": 73688}, "1838": {"acRate": 44.21322877813459, "difficulty": "Medium", "likes": 4649, "dislikes": 214, "categoryTitle": "Algorithms", "frontendQuestionId": "1838", "paidOnly": false, "title": "Frequency of the Most Frequent Element", "titleSlug": "frequency-of-the-most-frequent-element", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 155165, "totalSubmissionRaw": 350947}, "1839": {"acRate": 49.515246047037955, "difficulty": "Medium", "likes": 756, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "1839", "paidOnly": false, "title": "Longest Substring Of All Vowels in Order", "titleSlug": "longest-substring-of-all-vowels-in-order", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 32380, "totalSubmissionRaw": 65394}, "1840": {"acRate": 36.31964809384164, "difficulty": "Hard", "likes": 376, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "1840", "paidOnly": false, "title": "Maximum Building Height", "titleSlug": "maximum-building-height", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7431, "totalSubmissionRaw": 20460}, "1841": {"acRate": 53.45368612714524, "difficulty": "Medium", "likes": 107, "dislikes": 97, "categoryTitle": "Database", "frontendQuestionId": "1841", "paidOnly": true, "title": "League Statistics", "titleSlug": "league-statistics", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 13798, "totalSubmissionRaw": 25813}, "1842": {"acRate": 53.275671696724324, "difficulty": "Hard", "likes": 121, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "1842", "paidOnly": true, "title": "Next Palindrome Using Same Digits", "titleSlug": "next-palindrome-using-same-digits", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5790, "totalSubmissionRaw": 10868}, "1843": {"acRate": 44.86035686578743, "difficulty": "Medium", "likes": 93, "dislikes": 57, "categoryTitle": "Database", "frontendQuestionId": "1843", "paidOnly": true, "title": "Suspicious Bank Accounts", "titleSlug": "suspicious-bank-accounts", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 11565, "totalSubmissionRaw": 25780}, "1844": {"acRate": 81.50210864679495, "difficulty": "Easy", "likes": 835, "dislikes": 108, "categoryTitle": "Algorithms", "frontendQuestionId": "1844", "paidOnly": false, "title": "Replace All Digits with Characters", "titleSlug": "replace-all-digits-with-characters", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 91022, "totalSubmissionRaw": 111681}, "1845": {"acRate": 69.39997671104507, "difficulty": "Medium", "likes": 1416, "dislikes": 88, "categoryTitle": "Algorithms", "frontendQuestionId": "1845", "paidOnly": false, "title": "Seat Reservation Manager", "titleSlug": "seat-reservation-manager", "topicTags": [{"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 125158, "totalSubmissionRaw": 180343}, "1846": {"acRate": 65.86089880197234, "difficulty": "Medium", "likes": 1079, "dislikes": 271, "categoryTitle": "Algorithms", "frontendQuestionId": "1846", "paidOnly": false, "title": "Maximum Element After Decreasing and Rearranging", "titleSlug": "maximum-element-after-decreasing-and-rearranging", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 105384, "totalSubmissionRaw": 160011}, "1847": {"acRate": 38.27594667539053, "difficulty": "Hard", "likes": 510, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "1847", "paidOnly": false, "title": "Closest Room", "titleSlug": "closest-room", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9360, "totalSubmissionRaw": 24454}, "1848": {"acRate": 54.4998249095366, "difficulty": "Easy", "likes": 363, "dislikes": 67, "categoryTitle": "Algorithms", "frontendQuestionId": "1848", "paidOnly": false, "title": "Minimum Distance to the Target Element", "titleSlug": "minimum-distance-to-the-target-element", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 46690, "totalSubmissionRaw": 85670}, "1849": {"acRate": 35.94353601100704, "difficulty": "Medium", "likes": 525, "dislikes": 117, "categoryTitle": "Algorithms", "frontendQuestionId": "1849", "paidOnly": false, "title": "Splitting a String Into Descending Consecutive Values", "titleSlug": "splitting-a-string-into-descending-consecutive-values", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27169, "totalSubmissionRaw": 75588}, "1850": {"acRate": 71.31165883443624, "difficulty": "Medium", "likes": 775, "dislikes": 105, "categoryTitle": "Algorithms", "frontendQuestionId": "1850", "paidOnly": false, "title": "Minimum Adjacent Swaps to Reach the Kth Smallest Number", "titleSlug": "minimum-adjacent-swaps-to-reach-the-kth-smallest-number", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22307, "totalSubmissionRaw": 31281}, "1851": {"acRate": 50.18963508790941, "difficulty": "Hard", "likes": 957, "dislikes": 35, "categoryTitle": "Algorithms", "frontendQuestionId": "1851", "paidOnly": false, "title": "Minimum Interval to Include Each Query", "titleSlug": "minimum-interval-to-include-each-query", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Line Sweep", "id": "VG9waWNUYWdOb2RlOjU2MTE5", "slug": "line-sweep"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 37052, "totalSubmissionRaw": 73825}, "1852": {"acRate": 71.45020825444908, "difficulty": "Medium", "likes": 134, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "1852", "paidOnly": true, "title": "Distinct Numbers in Each Subarray", "titleSlug": "distinct-numbers-in-each-subarray", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7548, "totalSubmissionRaw": 10564}, "1853": {"acRate": 85.7556084077907, "difficulty": "Easy", "likes": 63, "dislikes": 42, "categoryTitle": "Database", "frontendQuestionId": "1853", "paidOnly": true, "title": "Convert Date Format", "titleSlug": "convert-date-format", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13341, "totalSubmissionRaw": 15557}, "1854": {"acRate": 61.08121657754011, "difficulty": "Easy", "likes": 1311, "dislikes": 235, "categoryTitle": "Algorithms", "frontendQuestionId": "1854", "paidOnly": false, "title": "Maximum Population Year", "titleSlug": "maximum-population-year", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 73102, "totalSubmissionRaw": 119680}, "1855": {"acRate": 53.49751525445052, "difficulty": "Medium", "likes": 1196, "dislikes": 28, "categoryTitle": "Algorithms", "frontendQuestionId": "1855", "paidOnly": false, "title": "Maximum Distance Between a Pair of Values", "titleSlug": "maximum-distance-between-a-pair-of-values", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 51027, "totalSubmissionRaw": 95382}, "1856": {"acRate": 38.128743308422116, "difficulty": "Medium", "likes": 1434, "dislikes": 122, "categoryTitle": "Algorithms", "frontendQuestionId": "1856", "paidOnly": false, "title": "Maximum Subarray Min-Product", "titleSlug": "maximum-subarray-min-product", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28775, "totalSubmissionRaw": 75468}, "1857": {"acRate": 49.91012493007645, "difficulty": "Hard", "likes": 2124, "dislikes": 69, "categoryTitle": "Algorithms", "frontendQuestionId": "1857", "paidOnly": false, "title": "Largest Color Value in a Directed Graph", "titleSlug": "largest-color-value-in-a-directed-graph", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 66917, "totalSubmissionRaw": 134075}, "1858": {"acRate": 68.61269676526553, "difficulty": "Medium", "likes": 179, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "1858", "paidOnly": true, "title": "Longest Word With All Prefixes", "titleSlug": "longest-word-with-all-prefixes", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7933, "totalSubmissionRaw": 11562}, "1859": {"acRate": 83.28923931887809, "difficulty": "Easy", "likes": 2197, "dislikes": 78, "categoryTitle": "Algorithms", "frontendQuestionId": "1859", "paidOnly": false, "title": "Sorting the Sentence", "titleSlug": "sorting-the-sentence", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 175353, "totalSubmissionRaw": 210535}, "1860": {"acRate": 72.23881645992198, "difficulty": "Medium", "likes": 222, "dislikes": 85, "categoryTitle": "Algorithms", "frontendQuestionId": "1860", "paidOnly": false, "title": "Incremental Memory Leak", "titleSlug": "incremental-memory-leak", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20557, "totalSubmissionRaw": 28457}, "1861": {"acRate": 67.76476147838632, "difficulty": "Medium", "likes": 982, "dislikes": 56, "categoryTitle": "Algorithms", "frontendQuestionId": "1861", "paidOnly": false, "title": "Rotating the Box", "titleSlug": "rotating-the-box", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 54491, "totalSubmissionRaw": 80412}, "1862": {"acRate": 28.944000974955824, "difficulty": "Hard", "likes": 443, "dislikes": 37, "categoryTitle": "Algorithms", "frontendQuestionId": "1862", "paidOnly": false, "title": "Sum of Floored Pairs", "titleSlug": "sum-of-floored-pairs", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9500, "totalSubmissionRaw": 32822}, "1863": {"acRate": 87.78807603188186, "difficulty": "Easy", "likes": 2152, "dislikes": 252, "categoryTitle": "Algorithms", "frontendQuestionId": "1863", "paidOnly": false, "title": "Sum of All Subset XOR Totals", "titleSlug": "sum-of-all-subset-xor-totals", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 182613, "totalSubmissionRaw": 208013}, "1864": {"acRate": 43.430121947416026, "difficulty": "Medium", "likes": 584, "dislikes": 36, "categoryTitle": "Algorithms", "frontendQuestionId": "1864", "paidOnly": false, "title": "Minimum Number of Swaps to Make the Binary String Alternating", "titleSlug": "minimum-number-of-swaps-to-make-the-binary-string-alternating", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27850, "totalSubmissionRaw": 64126}, "1865": {"acRate": 50.94343292872705, "difficulty": "Medium", "likes": 612, "dislikes": 107, "categoryTitle": "Algorithms", "frontendQuestionId": "1865", "paidOnly": false, "title": "Finding Pairs With a Certain Sum", "titleSlug": "finding-pairs-with-a-certain-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26189, "totalSubmissionRaw": 51408}, "1866": {"acRate": 57.70763101440393, "difficulty": "Hard", "likes": 709, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "1866", "paidOnly": false, "title": "Number of Ways to Rearrange Sticks With K Sticks Visible", "titleSlug": "number-of-ways-to-rearrange-sticks-with-k-sticks-visible", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15064, "totalSubmissionRaw": 26104}, "1867": {"acRate": 71.05399121673986, "difficulty": "Medium", "likes": 72, "dislikes": 266, "categoryTitle": "Database", "frontendQuestionId": "1867", "paidOnly": true, "title": "Orders With Maximum Quantity Above Average", "titleSlug": "orders-with-maximum-quantity-above-average", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16503, "totalSubmissionRaw": 23226}, "1868": {"acRate": 58.68293498245028, "difficulty": "Medium", "likes": 368, "dislikes": 66, "categoryTitle": "Algorithms", "frontendQuestionId": "1868", "paidOnly": true, "title": "Product of Two Run-Length Encoded Arrays", "titleSlug": "product-of-two-run-length-encoded-arrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 45643, "totalSubmissionRaw": 77779}, "1869": {"acRate": 61.21729448877343, "difficulty": "Easy", "likes": 516, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "1869", "paidOnly": false, "title": "Longer Contiguous Segments of Ones than Zeros", "titleSlug": "longer-contiguous-segments-of-ones-than-zeros", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 49485, "totalSubmissionRaw": 80835}, "1870": {"acRate": 46.84312342110653, "difficulty": "Medium", "likes": 2311, "dislikes": 279, "categoryTitle": "Algorithms", "frontendQuestionId": "1870", "paidOnly": false, "title": "Minimum Speed to Arrive on Time", "titleSlug": "minimum-speed-to-arrive-on-time", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 102912, "totalSubmissionRaw": 219695}, "1871": {"acRate": 24.922958196674298, "difficulty": "Medium", "likes": 1670, "dislikes": 104, "categoryTitle": "Algorithms", "frontendQuestionId": "1871", "paidOnly": false, "title": "Jump Game VII", "titleSlug": "jump-game-vii", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 47797, "totalSubmissionRaw": 191779}, "1872": {"acRate": 53.08923243829672, "difficulty": "Hard", "likes": 444, "dislikes": 23, "categoryTitle": "Algorithms", "frontendQuestionId": "1872", "paidOnly": false, "title": "Stone Game VIII", "titleSlug": "stone-game-viii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9787, "totalSubmissionRaw": 18435}, "1873": {"acRate": 57.56696392181158, "difficulty": "Easy", "likes": 1079, "dislikes": 77, "categoryTitle": "Database", "frontendQuestionId": "1873", "paidOnly": false, "title": "Calculate Special Bonus", "titleSlug": "calculate-special-bonus", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 247174, "totalSubmissionRaw": 429370}, "1874": {"acRate": 89.41324241880496, "difficulty": "Medium", "likes": 244, "dislikes": 27, "categoryTitle": "Algorithms", "frontendQuestionId": "1874", "paidOnly": true, "title": "Minimize Product Sum of Two Arrays", "titleSlug": "minimize-product-sum-of-two-arrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 19932, "totalSubmissionRaw": 22292}, "1875": {"acRate": 67.63416393806537, "difficulty": "Medium", "likes": 73, "dislikes": 5, "categoryTitle": "Database", "frontendQuestionId": "1875", "paidOnly": true, "title": "Group Employees of the Same Salary", "titleSlug": "group-employees-of-the-same-salary", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12187, "totalSubmissionRaw": 18019}, "1876": {"acRate": 73.88354200380434, "difficulty": "Easy", "likes": 1505, "dislikes": 46, "categoryTitle": "Algorithms", "frontendQuestionId": "1876", "paidOnly": false, "title": "Substrings of Size Three with Distinct Characters", "titleSlug": "substrings-of-size-three-with-distinct-characters", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 130120, "totalSubmissionRaw": 176115}, "1877": {"acRate": 81.44687509893221, "difficulty": "Medium", "likes": 1947, "dislikes": 440, "categoryTitle": "Algorithms", "frontendQuestionId": "1877", "paidOnly": false, "title": "Minimize Maximum Pair Sum in Array", "titleSlug": "minimize-maximum-pair-sum-in-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 180088, "totalSubmissionRaw": 221111}, "1878": {"acRate": 48.07704047371955, "difficulty": "Medium", "likes": 207, "dislikes": 518, "categoryTitle": "Algorithms", "frontendQuestionId": "1878", "paidOnly": false, "title": "Get Biggest Three Rhombus Sums in a Grid", "titleSlug": "get-biggest-three-rhombus-sums-in-a-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15751, "totalSubmissionRaw": 32762}, "1879": {"acRate": 47.74911809443672, "difficulty": "Hard", "likes": 675, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "1879", "paidOnly": false, "title": "Minimum XOR Sum of Two Arrays", "titleSlug": "minimum-xor-sum-of-two-arrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14754, "totalSubmissionRaw": 30899}, "1880": {"acRate": 74.29497568881686, "difficulty": "Easy", "likes": 573, "dislikes": 39, "categoryTitle": "Algorithms", "frontendQuestionId": "1880", "paidOnly": false, "title": "Check if Word Equals Summation of Two Words", "titleSlug": "check-if-word-equals-summation-of-two-words", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 68760, "totalSubmissionRaw": 92550}, "1881": {"acRate": 38.06529818438545, "difficulty": "Medium", "likes": 381, "dislikes": 63, "categoryTitle": "Algorithms", "frontendQuestionId": "1881", "paidOnly": false, "title": "Maximum Value after Insertion", "titleSlug": "maximum-value-after-insertion", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28576, "totalSubmissionRaw": 75071}, "1882": {"acRate": 40.296674006257966, "difficulty": "Medium", "likes": 925, "dislikes": 271, "categoryTitle": "Algorithms", "frontendQuestionId": "1882", "paidOnly": false, "title": "Process Tasks Using Servers", "titleSlug": "process-tasks-using-servers", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34772, "totalSubmissionRaw": 86290}, "1883": {"acRate": 37.85942492012779, "difficulty": "Hard", "likes": 335, "dislikes": 50, "categoryTitle": "Algorithms", "frontendQuestionId": "1883", "paidOnly": false, "title": "Minimum Skips to Arrive at Meeting On Time", "titleSlug": "minimum-skips-to-arrive-at-meeting-on-time", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7110, "totalSubmissionRaw": 18780}, "1884": {"acRate": 73.07742677124108, "difficulty": "Medium", "likes": 1455, "dislikes": 144, "categoryTitle": "Algorithms", "frontendQuestionId": "1884", "paidOnly": false, "title": "Egg Drop With 2 Eggs and N Floors", "titleSlug": "egg-drop-with-2-eggs-and-n-floors", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 50221, "totalSubmissionRaw": 68723}, "1885": {"acRate": 60.893823264201984, "difficulty": "Medium", "likes": 237, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "1885", "paidOnly": true, "title": "Count Pairs in Two Arrays", "titleSlug": "count-pairs-in-two-arrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 10805, "totalSubmissionRaw": 17744}, "1886": {"acRate": 57.15826539352219, "difficulty": "Easy", "likes": 1437, "dislikes": 122, "categoryTitle": "Algorithms", "frontendQuestionId": "1886", "paidOnly": false, "title": "Determine Whether Matrix Can Be Obtained By Rotation", "titleSlug": "determine-whether-matrix-can-be-obtained-by-rotation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 72072, "totalSubmissionRaw": 126092}, "1887": {"acRate": 72.88513864685561, "difficulty": "Medium", "likes": 1225, "dislikes": 48, "categoryTitle": "Algorithms", "frontendQuestionId": "1887", "paidOnly": false, "title": "Reduction Operations to Make the Array Elements Equal", "titleSlug": "reduction-operations-to-make-the-array-elements-equal", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 95360, "totalSubmissionRaw": 130836}, "1888": {"acRate": 39.986108551745644, "difficulty": "Medium", "likes": 1207, "dislikes": 73, "categoryTitle": "Algorithms", "frontendQuestionId": "1888", "paidOnly": false, "title": "Minimum Number of Flips to Make the Binary String Alternating", "titleSlug": "minimum-number-of-flips-to-make-the-binary-string-alternating", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28209, "totalSubmissionRaw": 70547}, "1889": {"acRate": 31.922635473393733, "difficulty": "Hard", "likes": 403, "dislikes": 36, "categoryTitle": "Algorithms", "frontendQuestionId": "1889", "paidOnly": false, "title": "Minimum Space Wasted From Packaging", "titleSlug": "minimum-space-wasted-from-packaging", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13072, "totalSubmissionRaw": 40949}, "1890": {"acRate": 77.30626217316886, "difficulty": "Easy", "likes": 408, "dislikes": 11, "categoryTitle": "Database", "frontendQuestionId": "1890", "paidOnly": false, "title": "The Latest Login in 2020", "titleSlug": "the-latest-login-in-2020", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 91682, "totalSubmissionRaw": 118597}, "1891": {"acRate": 49.66777665918067, "difficulty": "Medium", "likes": 571, "dislikes": 41, "categoryTitle": "Algorithms", "frontendQuestionId": "1891", "paidOnly": true, "title": "Cutting Ribbons", "titleSlug": "cutting-ribbons", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 64136, "totalSubmissionRaw": 129130}, "1892": {"acRate": 43.61175699040124, "difficulty": "Hard", "likes": 85, "dislikes": 22, "categoryTitle": "Database", "frontendQuestionId": "1892", "paidOnly": true, "title": "Page Recommendations II", "titleSlug": "page-recommendations-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7315, "totalSubmissionRaw": 16773}, "1893": {"acRate": 50.047630388187656, "difficulty": "Easy", "likes": 600, "dislikes": 112, "categoryTitle": "Algorithms", "frontendQuestionId": "1893", "paidOnly": false, "title": "Check if All the Integers in a Range Are Covered", "titleSlug": "check-if-all-the-integers-in-a-range-are-covered", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 46233, "totalSubmissionRaw": 92378}, "1894": {"acRate": 45.76061740052927, "difficulty": "Medium", "likes": 591, "dislikes": 67, "categoryTitle": "Algorithms", "frontendQuestionId": "1894", "paidOnly": false, "title": "Find the Student that Will Replace the Chalk", "titleSlug": "find-the-student-that-will-replace-the-chalk", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 39253, "totalSubmissionRaw": 85779}, "1895": {"acRate": 53.01889285242436, "difficulty": "Medium", "likes": 304, "dislikes": 261, "categoryTitle": "Algorithms", "frontendQuestionId": "1895", "paidOnly": false, "title": "Largest Magic Square", "titleSlug": "largest-magic-square", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12039, "totalSubmissionRaw": 22707}, "1896": {"acRate": 54.00311931375098, "difficulty": "Hard", "likes": 237, "dislikes": 40, "categoryTitle": "Algorithms", "frontendQuestionId": "1896", "paidOnly": false, "title": "Minimum Cost to Change the Final Value of Expression", "titleSlug": "minimum-cost-to-change-the-final-value-of-expression", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4155, "totalSubmissionRaw": 7694}, "1897": {"acRate": 67.19990091180198, "difficulty": "Easy", "likes": 1100, "dislikes": 78, "categoryTitle": "Algorithms", "frontendQuestionId": "1897", "paidOnly": false, "title": "Redistribute Characters to Make All Strings Equal", "titleSlug": "redistribute-characters-to-make-all-strings-equal", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 141062, "totalSubmissionRaw": 209914}, "1898": {"acRate": 43.95114029513521, "difficulty": "Medium", "likes": 975, "dislikes": 127, "categoryTitle": "Algorithms", "frontendQuestionId": "1898", "paidOnly": false, "title": "Maximum Number of Removable Characters", "titleSlug": "maximum-number-of-removable-characters", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 31124, "totalSubmissionRaw": 70814}, "1899": {"acRate": 66.29391688415981, "difficulty": "Medium", "likes": 805, "dislikes": 64, "categoryTitle": "Algorithms", "frontendQuestionId": "1899", "paidOnly": false, "title": "Merge Triplets to Form Target Triplet", "titleSlug": "merge-triplets-to-form-target-triplet", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 66039, "totalSubmissionRaw": 99616}, "1900": {"acRate": 50.9994498441225, "difficulty": "Hard", "likes": 229, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "1900", "paidOnly": false, "title": "The Earliest and Latest Rounds Where Players Compete", "titleSlug": "the-earliest-and-latest-rounds-where-players-compete", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5562, "totalSubmissionRaw": 10906}, "1901": {"acRate": 51.9655278626248, "difficulty": "Medium", "likes": 2084, "dislikes": 132, "categoryTitle": "Algorithms", "frontendQuestionId": "1901", "paidOnly": false, "title": "Find a Peak Element II", "titleSlug": "find-a-peak-element-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 80981, "totalSubmissionRaw": 155836}, "1902": {"acRate": 44.15415971836205, "difficulty": "Medium", "likes": 101, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "1902", "paidOnly": true, "title": "Depth of BST Given Insertion Order", "titleSlug": "depth-of-bst-given-insertion-order", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2383, "totalSubmissionRaw": 5397}, "1903": {"acRate": 63.63186840232874, "difficulty": "Easy", "likes": 2068, "dislikes": 125, "categoryTitle": "Algorithms", "frontendQuestionId": "1903", "paidOnly": false, "title": "Largest Odd Number in String", "titleSlug": "largest-odd-number-in-string", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 284392, "totalSubmissionRaw": 446935}, "1904": {"acRate": 43.91345323175999, "difficulty": "Medium", "likes": 213, "dislikes": 261, "categoryTitle": "Algorithms", "frontendQuestionId": "1904", "paidOnly": false, "title": "The Number of Full Rounds You Have Played", "titleSlug": "the-number-of-full-rounds-you-have-played", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22366, "totalSubmissionRaw": 50932}, "1905": {"acRate": 67.52227643632624, "difficulty": "Medium", "likes": 2083, "dislikes": 64, "categoryTitle": "Algorithms", "frontendQuestionId": "1905", "paidOnly": false, "title": "Count Sub Islands", "titleSlug": "count-sub-islands", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 97147, "totalSubmissionRaw": 143874}, "1906": {"acRate": 44.51701212358232, "difficulty": "Medium", "likes": 532, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "1906", "paidOnly": false, "title": "Minimum Absolute Difference Queries", "titleSlug": "minimum-absolute-difference-queries", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11383, "totalSubmissionRaw": 25570}, "1907": {"acRate": 60.188763104917776, "difficulty": "Medium", "likes": 451, "dislikes": 86, "categoryTitle": "Database", "frontendQuestionId": "1907", "paidOnly": false, "title": "Count Salary Categories", "titleSlug": "count-salary-categories", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 115105, "totalSubmissionRaw": 191241}, "1908": {"acRate": 63.13878804803128, "difficulty": "Medium", "likes": 102, "dislikes": 39, "categoryTitle": "Algorithms", "frontendQuestionId": "1908", "paidOnly": true, "title": "Game of Nim", "titleSlug": "game-of-nim", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Brainteaser", "id": "VG9waWNUYWdOb2RlOjMy", "slug": "brainteaser"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 4522, "totalSubmissionRaw": 7162}, "1909": {"acRate": 27.704192915544617, "difficulty": "Easy", "likes": 1244, "dislikes": 335, "categoryTitle": "Algorithms", "frontendQuestionId": "1909", "paidOnly": false, "title": "Remove One Element to Make the Array Strictly Increasing", "titleSlug": "remove-one-element-to-make-the-array-strictly-increasing", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 68208, "totalSubmissionRaw": 246200}, "1910": {"acRate": 77.77327052783261, "difficulty": "Medium", "likes": 1790, "dislikes": 60, "categoryTitle": "Algorithms", "frontendQuestionId": "1910", "paidOnly": false, "title": "Remove All Occurrences of a Substring", "titleSlug": "remove-all-occurrences-of-a-substring", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 128455, "totalSubmissionRaw": 165166}, "1911": {"acRate": 59.02142941944676, "difficulty": "Medium", "likes": 1238, "dislikes": 26, "categoryTitle": "Algorithms", "frontendQuestionId": "1911", "paidOnly": false, "title": "Maximum Alternating Subsequence Sum", "titleSlug": "maximum-alternating-subsequence-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 39771, "totalSubmissionRaw": 67384}, "1912": {"acRate": 36.54893502291723, "difficulty": "Hard", "likes": 241, "dislikes": 48, "categoryTitle": "Algorithms", "frontendQuestionId": "1912", "paidOnly": false, "title": "Design Movie Rental System", "titleSlug": "design-movie-rental-system", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6778, "totalSubmissionRaw": 18545}, "1913": {"acRate": 82.8657982230712, "difficulty": "Easy", "likes": 1518, "dislikes": 67, "categoryTitle": "Algorithms", "frontendQuestionId": "1913", "paidOnly": false, "title": "Maximum Product Difference Between Two Pairs", "titleSlug": "maximum-product-difference-between-two-pairs", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 252478, "totalSubmissionRaw": 304683}, "1914": {"acRate": 49.71574428588003, "difficulty": "Medium", "likes": 239, "dislikes": 271, "categoryTitle": "Algorithms", "frontendQuestionId": "1914", "paidOnly": false, "title": "Cyclically Rotating a Grid", "titleSlug": "cyclically-rotating-a-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12855, "totalSubmissionRaw": 25857}, "1915": {"acRate": 66.97006374566288, "difficulty": "Medium", "likes": 1725, "dislikes": 270, "categoryTitle": "Algorithms", "frontendQuestionId": "1915", "paidOnly": false, "title": "Number of Wonderful Substrings", "titleSlug": "number-of-wonderful-substrings", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 82996, "totalSubmissionRaw": 123930}, "1916": {"acRate": 49.17339484813533, "difficulty": "Hard", "likes": 486, "dislikes": 53, "categoryTitle": "Algorithms", "frontendQuestionId": "1916", "paidOnly": false, "title": "Count Ways to Build Rooms in an Ant Colony", "titleSlug": "count-ways-to-build-rooms-in-an-ant-colony", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7674, "totalSubmissionRaw": 15606}, "1917": {"acRate": 26.998812789126784, "difficulty": "Hard", "likes": 66, "dislikes": 60, "categoryTitle": "Database", "frontendQuestionId": "1917", "paidOnly": true, "title": "Leetcodify Friends Recommendations", "titleSlug": "leetcodify-friends-recommendations", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6595, "totalSubmissionRaw": 24427}, "1918": {"acRate": 52.50599520383693, "difficulty": "Medium", "likes": 205, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "1918", "paidOnly": true, "title": "Kth Smallest Subarray Sum", "titleSlug": "kth-smallest-subarray-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4379, "totalSubmissionRaw": 8340}, "1919": {"acRate": 41.61192707948926, "difficulty": "Hard", "likes": 58, "dislikes": 6, "categoryTitle": "Database", "frontendQuestionId": "1919", "paidOnly": true, "title": "Leetcodify Similar Friends", "titleSlug": "leetcodify-similar-friends", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5638, "totalSubmissionRaw": 13549}, "1920": {"acRate": 89.96384327562474, "difficulty": "Easy", "likes": 3372, "dislikes": 399, "categoryTitle": "Algorithms", "frontendQuestionId": "1920", "paidOnly": false, "title": "Build Array from Permutation", "titleSlug": "build-array-from-permutation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 556851, "totalSubmissionRaw": 618972}, "1921": {"acRate": 50.916658546431506, "difficulty": "Medium", "likes": 1505, "dislikes": 234, "categoryTitle": "Algorithms", "frontendQuestionId": "1921", "paidOnly": false, "title": "Eliminate Maximum Number of Monsters", "titleSlug": "eliminate-maximum-number-of-monsters", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 109731, "totalSubmissionRaw": 215511}, "1922": {"acRate": 46.2165139008457, "difficulty": "Medium", "likes": 1433, "dislikes": 439, "categoryTitle": "Algorithms", "frontendQuestionId": "1922", "paidOnly": false, "title": "Count Good Numbers", "titleSlug": "count-good-numbers", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 73011, "totalSubmissionRaw": 157976}, "1923": {"acRate": 28.360040153176936, "difficulty": "Hard", "likes": 477, "dislikes": 35, "categoryTitle": "Algorithms", "frontendQuestionId": "1923", "paidOnly": false, "title": "Longest Common Subpath", "titleSlug": "longest-common-subpath", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "Suffix Array", "id": "VG9waWNUYWdOb2RlOjU2Njk4", "slug": "suffix-array"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7628, "totalSubmissionRaw": 26897}, "1924": {"acRate": 50.73375262054507, "difficulty": "Hard", "likes": 13, "dislikes": 43, "categoryTitle": "Algorithms", "frontendQuestionId": "1924", "paidOnly": true, "title": "Erect the Fence II", "titleSlug": "erect-the-fence-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 726, "totalSubmissionRaw": 1431}, "1925": {"acRate": 67.92086945196162, "difficulty": "Easy", "likes": 425, "dislikes": 40, "categoryTitle": "Algorithms", "frontendQuestionId": "1925", "paidOnly": false, "title": "Count Square Sum Triples", "titleSlug": "count-square-sum-triples", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 46934, "totalSubmissionRaw": 69101}, "1926": {"acRate": 46.816986139096805, "difficulty": "Medium", "likes": 2316, "dislikes": 111, "categoryTitle": "Algorithms", "frontendQuestionId": "1926", "paidOnly": false, "title": "Nearest Exit from Entrance in Maze", "titleSlug": "nearest-exit-from-entrance-in-maze", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 161248, "totalSubmissionRaw": 344422}, "1927": {"acRate": 47.936533058995764, "difficulty": "Medium", "likes": 497, "dislikes": 86, "categoryTitle": "Algorithms", "frontendQuestionId": "1927", "paidOnly": false, "title": "Sum Game", "titleSlug": "sum-game", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12115, "totalSubmissionRaw": 25273}, "1928": {"acRate": 38.51544350078074, "difficulty": "Hard", "likes": 787, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "1928", "paidOnly": false, "title": "Minimum Cost to Reach Destination in Time", "titleSlug": "minimum-cost-to-reach-destination-in-time", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20226, "totalSubmissionRaw": 52514}, "1929": {"acRate": 90.0396990434421, "difficulty": "Easy", "likes": 3359, "dislikes": 393, "categoryTitle": "Algorithms", "frontendQuestionId": "1929", "paidOnly": false, "title": "Concatenation of Array", "titleSlug": "concatenation-of-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 833508, "totalSubmissionRaw": 925712}, "1930": {"acRate": 66.09328156484986, "difficulty": "Medium", "likes": 1726, "dislikes": 75, "categoryTitle": "Algorithms", "frontendQuestionId": "1930", "paidOnly": false, "title": "Unique Length-3 Palindromic Subsequences", "titleSlug": "unique-length-3-palindromic-subsequences", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 107584, "totalSubmissionRaw": 162776}, "1931": {"acRate": 57.74385479896629, "difficulty": "Hard", "likes": 480, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "1931", "paidOnly": false, "title": "Painting a Grid With Three Different Colors", "titleSlug": "painting-a-grid-with-three-different-colors", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9608, "totalSubmissionRaw": 16639}, "1932": {"acRate": 36.28180508881421, "difficulty": "Hard", "likes": 576, "dislikes": 40, "categoryTitle": "Algorithms", "frontendQuestionId": "1932", "paidOnly": false, "title": "Merge BSTs to Create Single BST", "titleSlug": "merge-bsts-to-create-single-bst", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9069, "totalSubmissionRaw": 24996}, "1933": {"acRate": 50.72522159548751, "difficulty": "Easy", "likes": 57, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "1933", "paidOnly": true, "title": "Check if String Is Decomposable Into Value-Equal Substrings", "titleSlug": "check-if-string-is-decomposable-into-value-equal-substrings", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3777, "totalSubmissionRaw": 7446}, "1934": {"acRate": 59.03336262999335, "difficulty": "Medium", "likes": 892, "dislikes": 81, "categoryTitle": "Database", "frontendQuestionId": "1934", "paidOnly": false, "title": "Confirmation Rate", "titleSlug": "confirmation-rate", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 232397, "totalSubmissionRaw": 393672}, "1935": {"acRate": 73.53151568454999, "difficulty": "Easy", "likes": 593, "dislikes": 29, "categoryTitle": "Algorithms", "frontendQuestionId": "1935", "paidOnly": false, "title": "Maximum Number of Words You Can Type", "titleSlug": "maximum-number-of-words-you-can-type", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 62704, "totalSubmissionRaw": 85275}, "1936": {"acRate": 42.94958726415095, "difficulty": "Medium", "likes": 375, "dislikes": 26, "categoryTitle": "Algorithms", "frontendQuestionId": "1936", "paidOnly": false, "title": "Add Minimum Number of Rungs", "titleSlug": "add-minimum-number-of-rungs", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29137, "totalSubmissionRaw": 67840}, "1937": {"acRate": 42.86060993134281, "difficulty": "Medium", "likes": 2984, "dislikes": 214, "categoryTitle": "Algorithms", "frontendQuestionId": "1937", "paidOnly": false, "title": "Maximum Number of Points with Cost", "titleSlug": "maximum-number-of-points-with-cost", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 134167, "totalSubmissionRaw": 313010}, "1938": {"acRate": 42.96363912977332, "difficulty": "Hard", "likes": 384, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "1938", "paidOnly": false, "title": "Maximum Genetic Difference Query", "titleSlug": "maximum-genetic-difference-query", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5648, "totalSubmissionRaw": 13146}, "1939": {"acRate": 56.35057329855814, "difficulty": "Easy", "likes": 62, "dislikes": 47, "categoryTitle": "Database", "frontendQuestionId": "1939", "paidOnly": true, "title": "Users That Actively Request Confirmation Messages", "titleSlug": "users-that-actively-request-confirmation-messages", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11451, "totalSubmissionRaw": 20321}, "1940": {"acRate": 81.23873603268052, "difficulty": "Medium", "likes": 186, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "1940", "paidOnly": true, "title": "Longest Common Subsequence Between Sorted Arrays", "titleSlug": "longest-common-subsequence-between-sorted-arrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 13522, "totalSubmissionRaw": 16645}, "1941": {"acRate": 77.8082358674464, "difficulty": "Easy", "likes": 888, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "1941", "paidOnly": false, "title": "Check if All Characters Have Equal Number of Occurrences", "titleSlug": "check-if-all-characters-have-equal-number-of-occurrences", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 102183, "totalSubmissionRaw": 131327}, "1942": {"acRate": 42.374552186771176, "difficulty": "Medium", "likes": 579, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "1942", "paidOnly": false, "title": "The Number of the Smallest Unoccupied Chair", "titleSlug": "the-number-of-the-smallest-unoccupied-chair", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17624, "totalSubmissionRaw": 41591}, "1943": {"acRate": 50.11969449405327, "difficulty": "Medium", "likes": 478, "dislikes": 34, "categoryTitle": "Algorithms", "frontendQuestionId": "1943", "paidOnly": false, "title": "Describe the Painting", "titleSlug": "describe-the-painting", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13190, "totalSubmissionRaw": 26317}, "1944": {"acRate": 69.82605316154562, "difficulty": "Hard", "likes": 1761, "dislikes": 52, "categoryTitle": "Algorithms", "frontendQuestionId": "1944", "paidOnly": false, "title": "Number of Visible People in a Queue", "titleSlug": "number-of-visible-people-in-a-queue", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 59290, "totalSubmissionRaw": 84911}, "1945": {"acRate": 62.89015229353608, "difficulty": "Easy", "likes": 610, "dislikes": 66, "categoryTitle": "Algorithms", "frontendQuestionId": "1945", "paidOnly": false, "title": "Sum of Digits of String After Convert", "titleSlug": "sum-of-digits-of-string-after-convert", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 55088, "totalSubmissionRaw": 87594}, "1946": {"acRate": 36.007952973720606, "difficulty": "Medium", "likes": 215, "dislikes": 226, "categoryTitle": "Algorithms", "frontendQuestionId": "1946", "paidOnly": false, "title": "Largest Number After Mutating Substring", "titleSlug": "largest-number-after-mutating-substring", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20827, "totalSubmissionRaw": 57840}, "1947": {"acRate": 62.29628183858691, "difficulty": "Medium", "likes": 782, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "1947", "paidOnly": false, "title": "Maximum Compatibility Score Sum", "titleSlug": "maximum-compatibility-score-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25534, "totalSubmissionRaw": 40988}, "1948": {"acRate": 55.57070268930475, "difficulty": "Hard", "likes": 320, "dislikes": 75, "categoryTitle": "Algorithms", "frontendQuestionId": "1948", "paidOnly": false, "title": "Delete Duplicate Folders in System", "titleSlug": "delete-duplicate-folders-in-system", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8968, "totalSubmissionRaw": 16138}, "1949": {"acRate": 54.47233088655443, "difficulty": "Medium", "likes": 147, "dislikes": 84, "categoryTitle": "Database", "frontendQuestionId": "1949", "paidOnly": true, "title": "Strong Friendship", "titleSlug": "strong-friendship", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12393, "totalSubmissionRaw": 22751}, "1950": {"acRate": 49.78625452153897, "difficulty": "Medium", "likes": 139, "dislikes": 54, "categoryTitle": "Algorithms", "frontendQuestionId": "1950", "paidOnly": true, "title": "Maximum of Minimum Values in All Subarrays", "titleSlug": "maximum-of-minimum-values-in-all-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3028, "totalSubmissionRaw": 6082}, "1951": {"acRate": 68.78713736455785, "difficulty": "Medium", "likes": 94, "dislikes": 7, "categoryTitle": "Database", "frontendQuestionId": "1951", "paidOnly": true, "title": "All the Pairs With the Maximum Number of Common Followers", "titleSlug": "all-the-pairs-with-the-maximum-number-of-common-followers", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11808, "totalSubmissionRaw": 17166}, "1952": {"acRate": 61.086538780108015, "difficulty": "Easy", "likes": 531, "dislikes": 31, "categoryTitle": "Algorithms", "frontendQuestionId": "1952", "paidOnly": false, "title": "Three Divisors", "titleSlug": "three-divisors", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 73750, "totalSubmissionRaw": 120730}, "1953": {"acRate": 40.78522798303854, "difficulty": "Medium", "likes": 646, "dislikes": 146, "categoryTitle": "Algorithms", "frontendQuestionId": "1953", "paidOnly": false, "title": "Maximum Number of Weeks for Which You Can Work", "titleSlug": "maximum-number-of-weeks-for-which-you-can-work", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24142, "totalSubmissionRaw": 59193}, "1954": {"acRate": 54.548300256683156, "difficulty": "Medium", "likes": 382, "dislikes": 92, "categoryTitle": "Algorithms", "frontendQuestionId": "1954", "paidOnly": false, "title": "Minimum Garden Perimeter to Collect Enough Apples", "titleSlug": "minimum-garden-perimeter-to-collect-enough-apples", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17426, "totalSubmissionRaw": 31946}, "1955": {"acRate": 51.325798272379565, "difficulty": "Hard", "likes": 520, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "1955", "paidOnly": false, "title": "Count Number of Special Subsequences", "titleSlug": "count-number-of-special-subsequences", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11943, "totalSubmissionRaw": 23269}, "1956": {"acRate": 47.2992700729927, "difficulty": "Hard", "likes": 31, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "1956", "paidOnly": true, "title": "Minimum Time For K Virus Variants to Spread", "titleSlug": "minimum-time-for-k-virus-variants-to-spread", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 972, "totalSubmissionRaw": 2055}, "1957": {"acRate": 58.4978869956236, "difficulty": "Easy", "likes": 439, "dislikes": 24, "categoryTitle": "Algorithms", "frontendQuestionId": "1957", "paidOnly": false, "title": "Delete Characters to Make Fancy String", "titleSlug": "delete-characters-to-make-fancy-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 38897, "totalSubmissionRaw": 66493}, "1958": {"acRate": 48.6376831870169, "difficulty": "Medium", "likes": 161, "dislikes": 272, "categoryTitle": "Algorithms", "frontendQuestionId": "1958", "paidOnly": false, "title": "Check if Move is Legal", "titleSlug": "check-if-move-is-legal", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13906, "totalSubmissionRaw": 28591}, "1959": {"acRate": 43.11690928323175, "difficulty": "Medium", "likes": 566, "dislikes": 52, "categoryTitle": "Algorithms", "frontendQuestionId": "1959", "paidOnly": false, "title": "Minimum Total Space Wasted With K Resizing Operations", "titleSlug": "minimum-total-space-wasted-with-k-resizing-operations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8560, "totalSubmissionRaw": 19853}, "1960": {"acRate": 30.82574935292644, "difficulty": "Hard", "likes": 244, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "1960", "paidOnly": false, "title": "Maximum Product of the Length of Two Palindromic Substrings", "titleSlug": "maximum-product-of-the-length-of-two-palindromic-substrings", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3692, "totalSubmissionRaw": 11977}, "1961": {"acRate": 52.782695712416285, "difficulty": "Easy", "likes": 486, "dislikes": 91, "categoryTitle": "Algorithms", "frontendQuestionId": "1961", "paidOnly": false, "title": "Check If String Is a Prefix of Array", "titleSlug": "check-if-string-is-a-prefix-of-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 54856, "totalSubmissionRaw": 103928}, "1962": {"acRate": 62.604899960153105, "difficulty": "Medium", "likes": 1815, "dislikes": 155, "categoryTitle": "Algorithms", "frontendQuestionId": "1962", "paidOnly": false, "title": "Remove Stones to Minimize the Total", "titleSlug": "remove-stones-to-minimize-the-total", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 103695, "totalSubmissionRaw": 165634}, "1963": {"acRate": 72.00816348843354, "difficulty": "Medium", "likes": 1805, "dislikes": 76, "categoryTitle": "Algorithms", "frontendQuestionId": "1963", "paidOnly": false, "title": "Minimum Number of Swaps to Make the String Balanced", "titleSlug": "minimum-number-of-swaps-to-make-the-string-balanced", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 79034, "totalSubmissionRaw": 109757}, "1964": {"acRate": 62.904898888900775, "difficulty": "Hard", "likes": 1793, "dislikes": 72, "categoryTitle": "Algorithms", "frontendQuestionId": "1964", "paidOnly": false, "title": "Find the Longest Valid Obstacle Course at Each Position", "titleSlug": "find-the-longest-valid-obstacle-course-at-each-position", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 58823, "totalSubmissionRaw": 93511}, "1965": {"acRate": 72.38198185832103, "difficulty": "Easy", "likes": 699, "dislikes": 36, "categoryTitle": "Database", "frontendQuestionId": "1965", "paidOnly": false, "title": "Employees With Missing Information", "titleSlug": "employees-with-missing-information", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 126551, "totalSubmissionRaw": 174840}, "1966": {"acRate": 64.09731696225556, "difficulty": "Medium", "likes": 72, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "1966", "paidOnly": true, "title": "Binary Searchable Numbers in an Unsorted Array", "titleSlug": "binary-searchable-numbers-in-an-unsorted-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2819, "totalSubmissionRaw": 4398}, "1967": {"acRate": 81.10060472787247, "difficulty": "Easy", "likes": 695, "dislikes": 35, "categoryTitle": "Algorithms", "frontendQuestionId": "1967", "paidOnly": false, "title": "Number of Strings That Appear as Substrings in Word", "titleSlug": "number-of-strings-that-appear-as-substrings-in-word", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 73761, "totalSubmissionRaw": 90950}, "1968": {"acRate": 50.32188132030827, "difficulty": "Medium", "likes": 620, "dislikes": 49, "categoryTitle": "Algorithms", "frontendQuestionId": "1968", "paidOnly": false, "title": "Array With Elements Not Equal to Average of Neighbors", "titleSlug": "array-with-elements-not-equal-to-average-of-neighbors", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 38068, "totalSubmissionRaw": 75649}, "1969": {"acRate": 35.68437226959115, "difficulty": "Medium", "likes": 242, "dislikes": 367, "categoryTitle": "Algorithms", "frontendQuestionId": "1969", "paidOnly": false, "title": "Minimum Non-Zero Product of the Array Elements", "titleSlug": "minimum-non-zero-product-of-the-array-elements", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11844, "totalSubmissionRaw": 33191}, "1970": {"acRate": 61.95975711394214, "difficulty": "Hard", "likes": 1897, "dislikes": 35, "categoryTitle": "Algorithms", "frontendQuestionId": "1970", "paidOnly": false, "title": "Last Day Where You Can Still Cross", "titleSlug": "last-day-where-you-can-still-cross", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 57244, "totalSubmissionRaw": 92389}, "1971": {"acRate": 54.023125086766136, "difficulty": "Easy", "likes": 3881, "dislikes": 224, "categoryTitle": "Algorithms", "frontendQuestionId": "1971", "paidOnly": false, "title": "Find if Path Exists in Graph", "titleSlug": "find-if-path-exists-in-graph", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 459189, "totalSubmissionRaw": 849983}, "1972": {"acRate": 50.39966780857469, "difficulty": "Hard", "likes": 133, "dislikes": 42, "categoryTitle": "Database", "frontendQuestionId": "1972", "paidOnly": true, "title": "First and Last Call On the Same Day", "titleSlug": "first-and-last-call-on-the-same-day", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 9710, "totalSubmissionRaw": 19266}, "1973": {"acRate": 77.0118864812603, "difficulty": "Medium", "likes": 175, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "1973", "paidOnly": true, "title": "Count Nodes Equal to Sum of Descendants", "titleSlug": "count-nodes-equal-to-sum-of-descendants", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 13541, "totalSubmissionRaw": 17583}, "1974": {"acRate": 75.56839885074652, "difficulty": "Easy", "likes": 692, "dislikes": 29, "categoryTitle": "Algorithms", "frontendQuestionId": "1974", "paidOnly": false, "title": "Minimum Time to Type Word Using Special Typewriter", "titleSlug": "minimum-time-to-type-word-using-special-typewriter", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 45502, "totalSubmissionRaw": 60213}, "1975": {"acRate": 49.796678647322715, "difficulty": "Medium", "likes": 554, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "1975", "paidOnly": false, "title": "Maximum Matrix Sum", "titleSlug": "maximum-matrix-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18981, "totalSubmissionRaw": 38117}, "1976": {"acRate": 27.57046182437193, "difficulty": "Medium", "likes": 2795, "dislikes": 131, "categoryTitle": "Algorithms", "frontendQuestionId": "1976", "paidOnly": false, "title": "Number of Ways to Arrive at Destination", "titleSlug": "number-of-ways-to-arrive-at-destination", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 72397, "totalSubmissionRaw": 262589}, "1977": {"acRate": 20.897345246512824, "difficulty": "Hard", "likes": 516, "dislikes": 56, "categoryTitle": "Algorithms", "frontendQuestionId": "1977", "paidOnly": false, "title": "Number of Ways to Separate Numbers", "titleSlug": "number-of-ways-to-separate-numbers", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Suffix Array", "id": "VG9waWNUYWdOb2RlOjU2Njk4", "slug": "suffix-array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6502, "totalSubmissionRaw": 31114}, "1978": {"acRate": 48.444428448027644, "difficulty": "Easy", "likes": 365, "dislikes": 34, "categoryTitle": "Database", "frontendQuestionId": "1978", "paidOnly": false, "title": "Employees Whose Manager Left the Company", "titleSlug": "employees-whose-manager-left-the-company", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 134598, "totalSubmissionRaw": 277840}, "1979": {"acRate": 78.0158486128418, "difficulty": "Easy", "likes": 1125, "dislikes": 48, "categoryTitle": "Algorithms", "frontendQuestionId": "1979", "paidOnly": false, "title": "Find Greatest Common Divisor of Array", "titleSlug": "find-greatest-common-divisor-of-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 144625, "totalSubmissionRaw": 185379}, "1980": {"acRate": 74.68102177914592, "difficulty": "Medium", "likes": 1989, "dislikes": 74, "categoryTitle": "Algorithms", "frontendQuestionId": "1980", "paidOnly": false, "title": "Find Unique Binary String", "titleSlug": "find-unique-binary-string", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 142407, "totalSubmissionRaw": 190687}, "1981": {"acRate": 35.14661322262783, "difficulty": "Medium", "likes": 950, "dislikes": 142, "categoryTitle": "Algorithms", "frontendQuestionId": "1981", "paidOnly": false, "title": "Minimize the Difference Between Target and Chosen Elements", "titleSlug": "minimize-the-difference-between-target-and-chosen-elements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29461, "totalSubmissionRaw": 83823}, "1982": {"acRate": 48.93434905418129, "difficulty": "Hard", "likes": 584, "dislikes": 40, "categoryTitle": "Algorithms", "frontendQuestionId": "1982", "paidOnly": false, "title": "Find Array Given Subset Sums", "titleSlug": "find-array-given-subset-sums", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5717, "totalSubmissionRaw": 11683}, "1983": {"acRate": 53.38168986473241, "difficulty": "Medium", "likes": 94, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "1983", "paidOnly": true, "title": "Widest Pair of Indices With Equal Range Sum", "titleSlug": "widest-pair-of-indices-with-equal-range-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2723, "totalSubmissionRaw": 5101}, "1984": {"acRate": 57.17259691980882, "difficulty": "Easy", "likes": 998, "dislikes": 283, "categoryTitle": "Algorithms", "frontendQuestionId": "1984", "paidOnly": false, "title": "Minimum Difference Between Highest and Lowest of K Scores", "titleSlug": "minimum-difference-between-highest-and-lowest-of-k-scores", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 80742, "totalSubmissionRaw": 141225}, "1985": {"acRate": 45.713357295383105, "difficulty": "Medium", "likes": 1247, "dislikes": 145, "categoryTitle": "Algorithms", "frontendQuestionId": "1985", "paidOnly": false, "title": "Find the Kth Largest Integer in the Array", "titleSlug": "find-the-kth-largest-integer-in-the-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Quickselect", "id": "VG9waWNUYWdOb2RlOjYxMDY5", "slug": "quickselect"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 68933, "totalSubmissionRaw": 150794}, "1986": {"acRate": 33.24716766437441, "difficulty": "Medium", "likes": 1116, "dislikes": 67, "categoryTitle": "Algorithms", "frontendQuestionId": "1986", "paidOnly": false, "title": "Minimum Number of Work Sessions to Finish the Tasks", "titleSlug": "minimum-number-of-work-sessions-to-finish-the-tasks", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26881, "totalSubmissionRaw": 80852}, "1987": {"acRate": 52.313712833340055, "difficulty": "Hard", "likes": 698, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "1987", "paidOnly": false, "title": "Number of Unique Good Subsequences", "titleSlug": "number-of-unique-good-subsequences", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12967, "totalSubmissionRaw": 24787}, "1988": {"acRate": 67.00480825612759, "difficulty": "Medium", "likes": 77, "dislikes": 155, "categoryTitle": "Database", "frontendQuestionId": "1988", "paidOnly": true, "title": "Find Cutoff Score for Each School", "titleSlug": "find-cutoff-score-for-each-school", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 11427, "totalSubmissionRaw": 17054}, "1989": {"acRate": 51.34881538822425, "difficulty": "Medium", "likes": 71, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "1989", "paidOnly": true, "title": "Maximum Number of People That Can Be Caught in Tag", "titleSlug": "maximum-number-of-people-that-can-be-caught-in-tag", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2189, "totalSubmissionRaw": 4263}, "1990": {"acRate": 49.15924164266095, "difficulty": "Medium", "likes": 24, "dislikes": 191, "categoryTitle": "Database", "frontendQuestionId": "1990", "paidOnly": true, "title": "Count the Number of Experiments", "titleSlug": "count-the-number-of-experiments", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7338, "totalSubmissionRaw": 14927}, "1991": {"acRate": 67.58598679530057, "difficulty": "Easy", "likes": 1372, "dislikes": 64, "categoryTitle": "Algorithms", "frontendQuestionId": "1991", "paidOnly": false, "title": "Find the Middle Index in Array", "titleSlug": "find-the-middle-index-in-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 101649, "totalSubmissionRaw": 150397}, "1992": {"acRate": 75.77080090457869, "difficulty": "Medium", "likes": 1375, "dislikes": 88, "categoryTitle": "Algorithms", "frontendQuestionId": "1992", "paidOnly": false, "title": "Find All Groups of Farmland", "titleSlug": "find-all-groups-of-farmland", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 128996, "totalSubmissionRaw": 170245}, "1993": {"acRate": 46.020503775560826, "difficulty": "Medium", "likes": 462, "dislikes": 78, "categoryTitle": "Algorithms", "frontendQuestionId": "1993", "paidOnly": false, "title": "Operations on Tree", "titleSlug": "operations-on-tree", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16699, "totalSubmissionRaw": 36286}, "1994": {"acRate": 34.8526863084922, "difficulty": "Hard", "likes": 472, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "1994", "paidOnly": false, "title": "The Number of Good Subsets", "titleSlug": "the-number-of-good-subsets", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8044, "totalSubmissionRaw": 23080}, "1995": {"acRate": 61.65659581186399, "difficulty": "Easy", "likes": 636, "dislikes": 232, "categoryTitle": "Algorithms", "frontendQuestionId": "1995", "paidOnly": false, "title": "Count Special Quadruplets", "titleSlug": "count-special-quadruplets", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 42958, "totalSubmissionRaw": 69673}, "1996": {"acRate": 44.00864420292896, "difficulty": "Medium", "likes": 3014, "dislikes": 93, "categoryTitle": "Algorithms", "frontendQuestionId": "1996", "paidOnly": false, "title": "The Number of Weak Characters in the Game", "titleSlug": "the-number-of-weak-characters-in-the-game", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 104877, "totalSubmissionRaw": 238310}, "1997": {"acRate": 37.63828952530404, "difficulty": "Medium", "likes": 489, "dislikes": 97, "categoryTitle": "Algorithms", "frontendQuestionId": "1997", "paidOnly": false, "title": "First Day Where You Have Been in All the Rooms", "titleSlug": "first-day-where-you-have-been-in-all-the-rooms", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9594, "totalSubmissionRaw": 25490}, "1998": {"acRate": 46.130750605326874, "difficulty": "Hard", "likes": 496, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "1998", "paidOnly": false, "title": "GCD Sort of an Array", "titleSlug": "gcd-sort-of-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9526, "totalSubmissionRaw": 20650}, "1999": {"acRate": 49.14127423822715, "difficulty": "Medium", "likes": 28, "dislikes": 10, "categoryTitle": "Algorithms", "frontendQuestionId": "1999", "paidOnly": true, "title": "Smallest Greater Multiple Made of Two Digits", "titleSlug": "smallest-greater-multiple-made-of-two-digits", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1774, "totalSubmissionRaw": 3610}, "2000": {"acRate": 86.29549846358539, "difficulty": "Easy", "likes": 1329, "dislikes": 37, "categoryTitle": "Algorithms", "frontendQuestionId": "2000", "paidOnly": false, "title": "Reverse Prefix of Word", "titleSlug": "reverse-prefix-of-word", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 272409, "totalSubmissionRaw": 315670}, "2001": {"acRate": 50.066465256797585, "difficulty": "Medium", "likes": 528, "dislikes": 49, "categoryTitle": "Algorithms", "frontendQuestionId": "2001", "paidOnly": false, "title": "Number of Pairs of Interchangeable Rectangles", "titleSlug": "number-of-pairs-of-interchangeable-rectangles", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 41430, "totalSubmissionRaw": 82750}, "2002": {"acRate": 60.25761545692742, "difficulty": "Medium", "likes": 941, "dislikes": 74, "categoryTitle": "Algorithms", "frontendQuestionId": "2002", "paidOnly": false, "title": "Maximum Product of the Length of Two Palindromic Subsequences", "titleSlug": "maximum-product-of-the-length-of-two-palindromic-subsequences", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30127, "totalSubmissionRaw": 49997}, "2003": {"acRate": 46.77630145937704, "difficulty": "Hard", "likes": 450, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "2003", "paidOnly": false, "title": "Smallest Missing Genetic Value in Each Subtree", "titleSlug": "smallest-missing-genetic-value-in-each-subtree", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8590, "totalSubmissionRaw": 18364}, "2004": {"acRate": 43.476738369184595, "difficulty": "Hard", "likes": 117, "dislikes": 14, "categoryTitle": "Database", "frontendQuestionId": "2004", "paidOnly": true, "title": "The Number of Seniors and Juniors to Join the Company", "titleSlug": "the-number-of-seniors-and-juniors-to-join-the-company", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 8691, "totalSubmissionRaw": 19990}, "2005": {"acRate": 59.22242314647378, "difficulty": "Hard", "likes": 16, "dislikes": 45, "categoryTitle": "Algorithms", "frontendQuestionId": "2005", "paidOnly": true, "title": "Subtree Removal Game with Fibonacci Tree", "titleSlug": "subtree-removal-game-with-fibonacci-tree", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 655, "totalSubmissionRaw": 1106}, "2006": {"acRate": 84.10574173205251, "difficulty": "Easy", "likes": 1633, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "2006", "paidOnly": false, "title": "Count Number of Pairs With Absolute Difference K", "titleSlug": "count-number-of-pairs-with-absolute-difference-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 160571, "totalSubmissionRaw": 190916}, "2007": {"acRate": 40.49888815986747, "difficulty": "Medium", "likes": 2444, "dislikes": 116, "categoryTitle": "Algorithms", "frontendQuestionId": "2007", "paidOnly": false, "title": "Find Original Array From Doubled Array", "titleSlug": "find-original-array-from-doubled-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 136411, "totalSubmissionRaw": 336826}, "2008": {"acRate": 44.283071864081656, "difficulty": "Medium", "likes": 1275, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "2008", "paidOnly": false, "title": "Maximum Earnings From Taxi", "titleSlug": "maximum-earnings-from-taxi", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 32320, "totalSubmissionRaw": 72985}, "2009": {"acRate": 52.64126388850018, "difficulty": "Hard", "likes": 1875, "dislikes": 50, "categoryTitle": "Algorithms", "frontendQuestionId": "2009", "paidOnly": false, "title": "Minimum Number of Operations to Make Array Continuous", "titleSlug": "minimum-number-of-operations-to-make-array-continuous", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 75237, "totalSubmissionRaw": 142924}, "2010": {"acRate": 62.4265505984766, "difficulty": "Hard", "likes": 38, "dislikes": 10, "categoryTitle": "Database", "frontendQuestionId": "2010", "paidOnly": true, "title": "The Number of Seniors and Juniors to Join the Company II", "titleSlug": "the-number-of-seniors-and-juniors-to-join-the-company-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5737, "totalSubmissionRaw": 9190}, "2011": {"acRate": 89.33299028190542, "difficulty": "Easy", "likes": 1610, "dislikes": 187, "categoryTitle": "Algorithms", "frontendQuestionId": "2011", "paidOnly": false, "title": "Final Value of Variable After Performing Operations", "titleSlug": "final-value-of-variable-after-performing-operations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 409707, "totalSubmissionRaw": 458629}, "2012": {"acRate": 48.33530674908186, "difficulty": "Medium", "likes": 605, "dislikes": 64, "categoryTitle": "Algorithms", "frontendQuestionId": "2012", "paidOnly": false, "title": "Sum of Beauty in the Array", "titleSlug": "sum-of-beauty-in-the-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24085, "totalSubmissionRaw": 49829}, "2013": {"acRate": 51.22006566584171, "difficulty": "Medium", "likes": 886, "dislikes": 232, "categoryTitle": "Algorithms", "frontendQuestionId": "2013", "paidOnly": false, "title": "Detect Squares", "titleSlug": "detect-squares", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 72227, "totalSubmissionRaw": 141014}, "2014": {"acRate": 55.73955839318968, "difficulty": "Hard", "likes": 460, "dislikes": 80, "categoryTitle": "Algorithms", "frontendQuestionId": "2014", "paidOnly": false, "title": "Longest Subsequence Repeated k Times", "titleSlug": "longest-subsequence-repeated-k-times", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8381, "totalSubmissionRaw": 15036}, "2015": {"acRate": 59.31168470718845, "difficulty": "Medium", "likes": 54, "dislikes": 28, "categoryTitle": "Algorithms", "frontendQuestionId": "2015", "paidOnly": true, "title": "Average Height of Buildings in Each Segment", "titleSlug": "average-height-of-buildings-in-each-segment", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2137, "totalSubmissionRaw": 3603}, "2016": {"acRate": 56.59726706791, "difficulty": "Easy", "likes": 1010, "dislikes": 31, "categoryTitle": "Algorithms", "frontendQuestionId": "2016", "paidOnly": false, "title": "Maximum Difference Between Increasing Elements", "titleSlug": "maximum-difference-between-increasing-elements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 87639, "totalSubmissionRaw": 154848}, "2017": {"acRate": 46.10574913208645, "difficulty": "Medium", "likes": 915, "dislikes": 40, "categoryTitle": "Algorithms", "frontendQuestionId": "2017", "paidOnly": false, "title": "Grid Game", "titleSlug": "grid-game", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25366, "totalSubmissionRaw": 55017}, "2018": {"acRate": 49.7008312779757, "difficulty": "Medium", "likes": 292, "dislikes": 294, "categoryTitle": "Algorithms", "frontendQuestionId": "2018", "paidOnly": false, "title": "Check if Word Can Be Placed In Crossword", "titleSlug": "check-if-word-can-be-placed-in-crossword", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21763, "totalSubmissionRaw": 43788}, "2019": {"acRate": 33.72843833594687, "difficulty": "Hard", "likes": 270, "dislikes": 81, "categoryTitle": "Algorithms", "frontendQuestionId": "2019", "paidOnly": false, "title": "The Score of Students Solving Math Expression", "titleSlug": "the-score-of-students-solving-math-expression", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7313, "totalSubmissionRaw": 21682}, "2020": {"acRate": 71.95154777927321, "difficulty": "Medium", "likes": 27, "dislikes": 213, "categoryTitle": "Database", "frontendQuestionId": "2020", "paidOnly": true, "title": "Number of Accounts That Did Not Stream", "titleSlug": "number-of-accounts-that-did-not-stream", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10692, "totalSubmissionRaw": 14860}, "2021": {"acRate": 61.529126213592235, "difficulty": "Medium", "likes": 151, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "2021", "paidOnly": true, "title": "Brightest Position on Street", "titleSlug": "brightest-position-on-street", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6084, "totalSubmissionRaw": 9888}, "2022": {"acRate": 62.01541071681041, "difficulty": "Easy", "likes": 783, "dislikes": 56, "categoryTitle": "Algorithms", "frontendQuestionId": "2022", "paidOnly": false, "title": "Convert 1D Array Into 2D Array", "titleSlug": "convert-1d-array-into-2d-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 87727, "totalSubmissionRaw": 141460}, "2023": {"acRate": 74.94975821139232, "difficulty": "Medium", "likes": 702, "dislikes": 53, "categoryTitle": "Algorithms", "frontendQuestionId": "2023", "paidOnly": false, "title": "Number of Pairs of Strings With Concatenation Equal to Target", "titleSlug": "number-of-pairs-of-strings-with-concatenation-equal-to-target", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 47737, "totalSubmissionRaw": 63692}, "2024": {"acRate": 67.39370988762387, "difficulty": "Medium", "likes": 2877, "dislikes": 45, "categoryTitle": "Algorithms", "frontendQuestionId": "2024", "paidOnly": false, "title": "Maximize the Confusion of an Exam", "titleSlug": "maximize-the-confusion-of-an-exam", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 109628, "totalSubmissionRaw": 162668}, "2025": {"acRate": 34.365796353287664, "difficulty": "Hard", "likes": 476, "dislikes": 53, "categoryTitle": "Algorithms", "frontendQuestionId": "2025", "paidOnly": false, "title": "Maximum Number of Ways to Partition an Array", "titleSlug": "maximum-number-of-ways-to-partition-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10385, "totalSubmissionRaw": 30219}, "2026": {"acRate": 84.27362004740941, "difficulty": "Easy", "likes": 52, "dislikes": 11, "categoryTitle": "Database", "frontendQuestionId": "2026", "paidOnly": true, "title": "Low-Quality Problems", "titleSlug": "low-quality-problems", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12443, "totalSubmissionRaw": 14765}, "2027": {"acRate": 55.27650090541858, "difficulty": "Easy", "likes": 479, "dislikes": 71, "categoryTitle": "Algorithms", "frontendQuestionId": "2027", "paidOnly": false, "title": "Minimum Moves to Convert String", "titleSlug": "minimum-moves-to-convert-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 39683, "totalSubmissionRaw": 71790}, "2028": {"acRate": 46.840744645513496, "difficulty": "Medium", "likes": 487, "dislikes": 43, "categoryTitle": "Algorithms", "frontendQuestionId": "2028", "paidOnly": false, "title": "Find Missing Observations", "titleSlug": "find-missing-observations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 32432, "totalSubmissionRaw": 69240}, "2029": {"acRate": 28.494587732192972, "difficulty": "Medium", "likes": 236, "dislikes": 273, "categoryTitle": "Algorithms", "frontendQuestionId": "2029", "paidOnly": false, "title": "Stone Game IX", "titleSlug": "stone-game-ix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8529, "totalSubmissionRaw": 29932}, "2030": {"acRate": 39.325992956804704, "difficulty": "Hard", "likes": 483, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "2030", "paidOnly": false, "title": "Smallest K-Length Subsequence With Occurrences of a Letter", "titleSlug": "smallest-k-length-subsequence-with-occurrences-of-a-letter", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8822, "totalSubmissionRaw": 22433}, "2031": {"acRate": 51.955237017477685, "difficulty": "Medium", "likes": 172, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2031", "paidOnly": true, "title": "Count Subarrays With More Ones Than Zeros", "titleSlug": "count-subarrays-with-more-ones-than-zeros", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Merge Sort", "id": "VG9waWNUYWdOb2RlOjYxMDUx", "slug": "merge-sort"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4132, "totalSubmissionRaw": 7953}, "2032": {"acRate": 75.47214967274695, "difficulty": "Easy", "likes": 755, "dislikes": 51, "categoryTitle": "Algorithms", "frontendQuestionId": "2032", "paidOnly": false, "title": "Two Out of Three", "titleSlug": "two-out-of-three", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 72531, "totalSubmissionRaw": 96103}, "2033": {"acRate": 53.418008618734405, "difficulty": "Medium", "likes": 549, "dislikes": 40, "categoryTitle": "Algorithms", "frontendQuestionId": "2033", "paidOnly": false, "title": "Minimum Operations to Make a Uni-Value Grid", "titleSlug": "minimum-operations-to-make-a-uni-value-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23552, "totalSubmissionRaw": 44090}, "2034": {"acRate": 48.64674074178655, "difficulty": "Medium", "likes": 1163, "dislikes": 64, "categoryTitle": "Algorithms", "frontendQuestionId": "2034", "paidOnly": false, "title": "Stock Price Fluctuation ", "titleSlug": "stock-price-fluctuation", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Data Stream", "id": "VG9waWNUYWdOb2RlOjYxMDYz", "slug": "data-stream"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 68912, "totalSubmissionRaw": 141658}, "2035": {"acRate": 20.537589545219895, "difficulty": "Hard", "likes": 3071, "dislikes": 198, "categoryTitle": "Algorithms", "frontendQuestionId": "2035", "paidOnly": false, "title": "Partition Array Into Two Arrays to Minimize Sum Difference", "titleSlug": "partition-array-into-two-arrays-to-minimize-sum-difference", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29042, "totalSubmissionRaw": 141409}, "2036": {"acRate": 40.08560997104368, "difficulty": "Medium", "likes": 98, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "2036", "paidOnly": true, "title": "Maximum Alternating Subarray Sum", "titleSlug": "maximum-alternating-subarray-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3184, "totalSubmissionRaw": 7943}, "2037": {"acRate": 87.62329898675736, "difficulty": "Easy", "likes": 1326, "dislikes": 318, "categoryTitle": "Algorithms", "frontendQuestionId": "2037", "paidOnly": false, "title": "Minimum Number of Moves to Seat Everyone", "titleSlug": "minimum-number-of-moves-to-seat-everyone", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 234961, "totalSubmissionRaw": 268149}, "2038": {"acRate": 62.79886626441079, "difficulty": "Medium", "likes": 1571, "dislikes": 124, "categoryTitle": "Algorithms", "frontendQuestionId": "2038", "paidOnly": false, "title": "Remove Colored Pieces if Both Neighbors are the Same Color", "titleSlug": "remove-colored-pieces-if-both-neighbors-are-the-same-color", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 144460, "totalSubmissionRaw": 230036}, "2039": {"acRate": 52.3065931822821, "difficulty": "Medium", "likes": 668, "dislikes": 61, "categoryTitle": "Algorithms", "frontendQuestionId": "2039", "paidOnly": false, "title": "The Time When the Network Becomes Idle", "titleSlug": "the-time-when-the-network-becomes-idle", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15375, "totalSubmissionRaw": 29394}, "2040": {"acRate": 29.011010378436186, "difficulty": "Hard", "likes": 686, "dislikes": 37, "categoryTitle": "Algorithms", "frontendQuestionId": "2040", "paidOnly": false, "title": "Kth Smallest Product of Two Sorted Arrays", "titleSlug": "kth-smallest-product-of-two-sorted-arrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11936, "totalSubmissionRaw": 41143}, "2041": {"acRate": 78.18963006117099, "difficulty": "Medium", "likes": 53, "dislikes": 28, "categoryTitle": "Database", "frontendQuestionId": "2041", "paidOnly": true, "title": "Accepted Candidates From the Interviews", "titleSlug": "accepted-candidates-from-the-interviews", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 10736, "totalSubmissionRaw": 13731}, "2042": {"acRate": 70.02051035257182, "difficulty": "Easy", "likes": 614, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "2042", "paidOnly": false, "title": "Check if Numbers Are Ascending in a Sentence", "titleSlug": "check-if-numbers-are-ascending-in-a-sentence", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 61109, "totalSubmissionRaw": 87273}, "2043": {"acRate": 63.850453782227035, "difficulty": "Medium", "likes": 260, "dislikes": 217, "categoryTitle": "Algorithms", "frontendQuestionId": "2043", "paidOnly": false, "title": "Simple Bank System", "titleSlug": "simple-bank-system", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30041, "totalSubmissionRaw": 47049}, "2044": {"acRate": 77.89010528521293, "difficulty": "Medium", "likes": 623, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "2044", "paidOnly": false, "title": "Count Number of Maximum Bitwise-OR Subsets", "titleSlug": "count-number-of-maximum-bitwise-or-subsets", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29740, "totalSubmissionRaw": 38182}, "2045": {"acRate": 63.18554705502811, "difficulty": "Hard", "likes": 1197, "dislikes": 64, "categoryTitle": "Algorithms", "frontendQuestionId": "2045", "paidOnly": false, "title": "Second Minimum Time to Reach Destination", "titleSlug": "second-minimum-time-to-reach-destination", "topicTags": [{"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 82260, "totalSubmissionRaw": 130188}, "2046": {"acRate": 67.10140453773731, "difficulty": "Medium", "likes": 166, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "2046", "paidOnly": true, "title": "Sort Linked List Already Sorted Using Absolute Values", "titleSlug": "sort-linked-list-already-sorted-using-absolute-values", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8693, "totalSubmissionRaw": 12954}, "2047": {"acRate": 29.170470973141597, "difficulty": "Easy", "likes": 299, "dislikes": 803, "categoryTitle": "Algorithms", "frontendQuestionId": "2047", "paidOnly": false, "title": "Number of Valid Words in a Sentence", "titleSlug": "number-of-valid-words-in-a-sentence", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30669, "totalSubmissionRaw": 105142}, "2048": {"acRate": 48.70562001323996, "difficulty": "Medium", "likes": 198, "dislikes": 279, "categoryTitle": "Algorithms", "frontendQuestionId": "2048", "paidOnly": false, "title": "Next Greater Numerically Balanced Number", "titleSlug": "next-greater-numerically-balanced-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13979, "totalSubmissionRaw": 28701}, "2049": {"acRate": 49.961687189265284, "difficulty": "Medium", "likes": 1072, "dislikes": 82, "categoryTitle": "Algorithms", "frontendQuestionId": "2049", "paidOnly": false, "title": "Count Nodes With the Highest Score", "titleSlug": "count-nodes-with-the-highest-score", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28037, "totalSubmissionRaw": 56117}, "2050": {"acRate": 67.13613084420949, "difficulty": "Hard", "likes": 1527, "dislikes": 39, "categoryTitle": "Algorithms", "frontendQuestionId": "2050", "paidOnly": false, "title": "Parallel Courses III", "titleSlug": "parallel-courses-iii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 81274, "totalSubmissionRaw": 121059}, "2051": {"acRate": 69.93938359088192, "difficulty": "Medium", "likes": 57, "dislikes": 8, "categoryTitle": "Database", "frontendQuestionId": "2051", "paidOnly": true, "title": "The Category of Each Member in the Store", "titleSlug": "the-category-of-each-member-in-the-store", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8192, "totalSubmissionRaw": 11713}, "2052": {"acRate": 49.406802003691006, "difficulty": "Medium", "likes": 43, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "2052", "paidOnly": true, "title": "Minimum Cost to Separate Sentence Into Rows", "titleSlug": "minimum-cost-to-separate-sentence-into-rows", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1874, "totalSubmissionRaw": 3793}, "2053": {"acRate": 82.12160789435495, "difficulty": "Easy", "likes": 1231, "dislikes": 48, "categoryTitle": "Algorithms", "frontendQuestionId": "2053", "paidOnly": false, "title": "Kth Distinct String in an Array", "titleSlug": "kth-distinct-string-in-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 226360, "totalSubmissionRaw": 275640}, "2054": {"acRate": 46.69428334714168, "difficulty": "Medium", "likes": 834, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "2054", "paidOnly": false, "title": "Two Best Non-Overlapping Events", "titleSlug": "two-best-non-overlapping-events", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19726, "totalSubmissionRaw": 42245}, "2055": {"acRate": 45.147363248999184, "difficulty": "Medium", "likes": 1217, "dislikes": 63, "categoryTitle": "Algorithms", "frontendQuestionId": "2055", "paidOnly": false, "title": "Plates Between Candles", "titleSlug": "plates-between-candles", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 56049, "totalSubmissionRaw": 124144}, "2056": {"acRate": 52.73041759327898, "difficulty": "Hard", "likes": 59, "dislikes": 290, "categoryTitle": "Algorithms", "frontendQuestionId": "2056", "paidOnly": false, "title": "Number of Valid Move Combinations On Chessboard", "titleSlug": "number-of-valid-move-combinations-on-chessboard", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4268, "totalSubmissionRaw": 8094}, "2057": {"acRate": 73.12183836796139, "difficulty": "Easy", "likes": 422, "dislikes": 138, "categoryTitle": "Algorithms", "frontendQuestionId": "2057", "paidOnly": false, "title": "Smallest Index With Equal Value", "titleSlug": "smallest-index-with-equal-value", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 66059, "totalSubmissionRaw": 90341}, "2058": {"acRate": 69.67674727695801, "difficulty": "Medium", "likes": 1246, "dislikes": 66, "categoryTitle": "Algorithms", "frontendQuestionId": "2058", "paidOnly": false, "title": "Find the Minimum and Maximum Number of Nodes Between Critical Points", "titleSlug": "find-the-minimum-and-maximum-number-of-nodes-between-critical-points", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 174573, "totalSubmissionRaw": 250547}, "2059": {"acRate": 49.54270923209664, "difficulty": "Medium", "likes": 640, "dislikes": 33, "categoryTitle": "Algorithms", "frontendQuestionId": "2059", "paidOnly": false, "title": "Minimum Operations to Convert Number", "titleSlug": "minimum-operations-to-convert-number", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17226, "totalSubmissionRaw": 34770}, "2060": {"acRate": 43.832238976408604, "difficulty": "Hard", "likes": 311, "dislikes": 153, "categoryTitle": "Algorithms", "frontendQuestionId": "2060", "paidOnly": false, "title": "Check if an Original String Exists Given Two Encoded Strings", "titleSlug": "check-if-an-original-string-exists-given-two-encoded-strings", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16889, "totalSubmissionRaw": 38531}, "2061": {"acRate": 62.51598238386135, "difficulty": "Medium", "likes": 120, "dislikes": 26, "categoryTitle": "Algorithms", "frontendQuestionId": "2061", "paidOnly": true, "title": "Number of Spaces Cleaning Robot Cleaned", "titleSlug": "number-of-spaces-cleaning-robot-cleaned", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 8801, "totalSubmissionRaw": 14078}, "2062": {"acRate": 68.11401683684902, "difficulty": "Easy", "likes": 947, "dislikes": 242, "categoryTitle": "Algorithms", "frontendQuestionId": "2062", "paidOnly": false, "title": "Count Vowel Substrings of a String", "titleSlug": "count-vowel-substrings-of-a-string", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 42559, "totalSubmissionRaw": 62482}, "2063": {"acRate": 54.011822061896176, "difficulty": "Medium", "likes": 833, "dislikes": 28, "categoryTitle": "Algorithms", "frontendQuestionId": "2063", "paidOnly": false, "title": "Vowels of All Substrings", "titleSlug": "vowels-of-all-substrings", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30245, "totalSubmissionRaw": 55997}, "2064": {"acRate": 53.40441636226018, "difficulty": "Medium", "likes": 1068, "dislikes": 43, "categoryTitle": "Algorithms", "frontendQuestionId": "2064", "paidOnly": false, "title": "Minimized Maximum of Products Distributed to Any Store", "titleSlug": "minimized-maximum-of-products-distributed-to-any-store", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 32456, "totalSubmissionRaw": 60774}, "2065": {"acRate": 58.82767440039669, "difficulty": "Hard", "likes": 643, "dislikes": 47, "categoryTitle": "Algorithms", "frontendQuestionId": "2065", "paidOnly": false, "title": "Maximum Path Quality of a Graph", "titleSlug": "maximum-path-quality-of-a-graph", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22541, "totalSubmissionRaw": 38317}, "2066": {"acRate": 82.03899815094974, "difficulty": "Medium", "likes": 70, "dislikes": 2, "categoryTitle": "Database", "frontendQuestionId": "2066", "paidOnly": true, "title": "Account Balance", "titleSlug": "account-balance", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9761, "totalSubmissionRaw": 11898}, "2067": {"acRate": 46.94444444444444, "difficulty": "Medium", "likes": 103, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "2067", "paidOnly": true, "title": "Number of Equal Count Substrings", "titleSlug": "number-of-equal-count-substrings", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2704, "totalSubmissionRaw": 5760}, "2068": {"acRate": 63.87321178120617, "difficulty": "Easy", "likes": 526, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "2068", "paidOnly": false, "title": "Check Whether Two Strings are Almost Equivalent", "titleSlug": "check-whether-two-strings-are-almost-equivalent", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 56927, "totalSubmissionRaw": 89125}, "2069": {"acRate": 26.307634415742527, "difficulty": "Medium", "likes": 166, "dislikes": 307, "categoryTitle": "Algorithms", "frontendQuestionId": "2069", "paidOnly": false, "title": "Walking Robot Simulation II", "titleSlug": "walking-robot-simulation-ii", "topicTags": [{"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11885, "totalSubmissionRaw": 45177}, "2070": {"acRate": 49.81843971631206, "difficulty": "Medium", "likes": 588, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "2070", "paidOnly": false, "title": "Most Beautiful Item for Each Query", "titleSlug": "most-beautiful-item-for-each-query", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17561, "totalSubmissionRaw": 35250}, "2071": {"acRate": 33.65800099171212, "difficulty": "Hard", "likes": 536, "dislikes": 23, "categoryTitle": "Algorithms", "frontendQuestionId": "2071", "paidOnly": false, "title": "Maximum Number of Tasks You Can Assign", "titleSlug": "maximum-number-of-tasks-you-can-assign", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Monotonic Queue", "id": "VG9waWNUYWdOb2RlOjYxMDcx", "slug": "monotonic-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9503, "totalSubmissionRaw": 28234}, "2072": {"acRate": 74.08584024896265, "difficulty": "Easy", "likes": 66, "dislikes": 2, "categoryTitle": "Database", "frontendQuestionId": "2072", "paidOnly": true, "title": "The Winner University", "titleSlug": "the-winner-university", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 11427, "totalSubmissionRaw": 15424}, "2073": {"acRate": 69.91000765892265, "difficulty": "Easy", "likes": 1653, "dislikes": 145, "categoryTitle": "Algorithms", "frontendQuestionId": "2073", "paidOnly": false, "title": "Time Needed to Buy Tickets", "titleSlug": "time-needed-to-buy-tickets", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 219067, "totalSubmissionRaw": 313357}, "2074": {"acRate": 58.361077162965145, "difficulty": "Medium", "likes": 721, "dislikes": 338, "categoryTitle": "Algorithms", "frontendQuestionId": "2074", "paidOnly": false, "title": "Reverse Nodes in Even Length Groups", "titleSlug": "reverse-nodes-in-even-length-groups", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27697, "totalSubmissionRaw": 47458}, "2075": {"acRate": 49.01010517632501, "difficulty": "Medium", "likes": 247, "dislikes": 62, "categoryTitle": "Algorithms", "frontendQuestionId": "2075", "paidOnly": false, "title": "Decode the Slanted Ciphertext", "titleSlug": "decode-the-slanted-ciphertext", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14259, "totalSubmissionRaw": 29094}, "2076": {"acRate": 55.40650406504065, "difficulty": "Hard", "likes": 614, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "2076", "paidOnly": false, "title": "Process Restricted Friend Requests", "titleSlug": "process-restricted-friend-requests", "topicTags": [{"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17719, "totalSubmissionRaw": 31980}, "2077": {"acRate": 55.460873739798366, "difficulty": "Medium", "likes": 129, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "2077", "paidOnly": true, "title": "Paths in Maze That Lead to Same Room", "titleSlug": "paths-in-maze-that-lead-to-same-room", "topicTags": [{"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4621, "totalSubmissionRaw": 8332}, "2078": {"acRate": 66.1016751025752, "difficulty": "Easy", "likes": 900, "dislikes": 27, "categoryTitle": "Algorithms", "frontendQuestionId": "2078", "paidOnly": false, "title": "Two Furthest Houses With Different Colors", "titleSlug": "two-furthest-houses-with-different-colors", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 56548, "totalSubmissionRaw": 85547}, "2079": {"acRate": 79.79830004378218, "difficulty": "Medium", "likes": 908, "dislikes": 69, "categoryTitle": "Algorithms", "frontendQuestionId": "2079", "paidOnly": false, "title": "Watering Plants", "titleSlug": "watering-plants", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 52856, "totalSubmissionRaw": 66237}, "2080": {"acRate": 40.39761795693999, "difficulty": "Medium", "likes": 658, "dislikes": 27, "categoryTitle": "Algorithms", "frontendQuestionId": "2080", "paidOnly": false, "title": "Range Frequency Queries", "titleSlug": "range-frequency-queries", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22047, "totalSubmissionRaw": 54575}, "2081": {"acRate": 42.427385892116185, "difficulty": "Hard", "likes": 124, "dislikes": 150, "categoryTitle": "Algorithms", "frontendQuestionId": "2081", "paidOnly": false, "title": "Sum of k-Mirror Numbers", "titleSlug": "sum-of-k-mirror-numbers", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7362, "totalSubmissionRaw": 17352}, "2082": {"acRate": 77.25198412698413, "difficulty": "Easy", "likes": 96, "dislikes": 25, "categoryTitle": "Database", "frontendQuestionId": "2082", "paidOnly": true, "title": "The Number of Rich Customers", "titleSlug": "the-number-of-rich-customers", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 23361, "totalSubmissionRaw": 30240}, "2083": {"acRate": 74.28986349114145, "difficulty": "Medium", "likes": 133, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "2083", "paidOnly": true, "title": "Substrings That Begin and End With the Same Letter", "titleSlug": "substrings-that-begin-and-end-with-the-same-letter", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 12789, "totalSubmissionRaw": 17215}, "2084": {"acRate": 87.02046035805625, "difficulty": "Medium", "likes": 84, "dislikes": 18, "categoryTitle": "Database", "frontendQuestionId": "2084", "paidOnly": true, "title": "Drop Type 1 Orders for Customers With Type 0 Orders", "titleSlug": "drop-type-1-orders-for-customers-with-type-0-orders", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10888, "totalSubmissionRaw": 12512}, "2085": {"acRate": 71.07417226232174, "difficulty": "Easy", "likes": 809, "dislikes": 18, "categoryTitle": "Algorithms", "frontendQuestionId": "2085", "paidOnly": false, "title": "Count Common Words With One Occurrence", "titleSlug": "count-common-words-with-one-occurrence", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 73458, "totalSubmissionRaw": 103354}, "2086": {"acRate": 46.816680252263076, "difficulty": "Medium", "likes": 537, "dislikes": 30, "categoryTitle": "Algorithms", "frontendQuestionId": "2086", "paidOnly": false, "title": "Minimum Number of Food Buckets to Feed the Hamsters", "titleSlug": "minimum-number-of-food-buckets-to-feed-the-hamsters", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21825, "totalSubmissionRaw": 46618}, "2087": {"acRate": 50.98622288910107, "difficulty": "Medium", "likes": 674, "dislikes": 90, "categoryTitle": "Algorithms", "frontendQuestionId": "2087", "paidOnly": false, "title": "Minimum Cost Homecoming of a Robot in a Grid", "titleSlug": "minimum-cost-homecoming-of-a-robot-in-a-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18689, "totalSubmissionRaw": 36655}, "2088": {"acRate": 65.02908855850032, "difficulty": "Hard", "likes": 369, "dislikes": 18, "categoryTitle": "Algorithms", "frontendQuestionId": "2088", "paidOnly": false, "title": "Count Fertile Pyramids in a Land", "titleSlug": "count-fertile-pyramids-in-a-land", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10060, "totalSubmissionRaw": 15470}, "2089": {"acRate": 76.53884091229341, "difficulty": "Easy", "likes": 1798, "dislikes": 94, "categoryTitle": "Algorithms", "frontendQuestionId": "2089", "paidOnly": false, "title": "Find Target Indices After Sorting Array", "titleSlug": "find-target-indices-after-sorting-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 190109, "totalSubmissionRaw": 248383}, "2090": {"acRate": 46.00491537611213, "difficulty": "Medium", "likes": 1891, "dislikes": 94, "categoryTitle": "Algorithms", "frontendQuestionId": "2090", "paidOnly": false, "title": "K Radius Subarray Averages", "titleSlug": "k-radius-subarray-averages", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 128598, "totalSubmissionRaw": 279531}, "2091": {"acRate": 54.95590396864283, "difficulty": "Medium", "likes": 958, "dislikes": 52, "categoryTitle": "Algorithms", "frontendQuestionId": "2091", "paidOnly": false, "title": "Removing Minimum and Maximum From Array", "titleSlug": "removing-minimum-and-maximum-from-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 44866, "totalSubmissionRaw": 81640}, "2092": {"acRate": 45.529002373654734, "difficulty": "Hard", "likes": 1583, "dislikes": 81, "categoryTitle": "Algorithms", "frontendQuestionId": "2092", "paidOnly": false, "title": "Find All People With Secret", "titleSlug": "find-all-people-with-secret", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 98782, "totalSubmissionRaw": 216965}, "2093": {"acRate": 59.852305475504316, "difficulty": "Medium", "likes": 227, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "2093", "paidOnly": true, "title": "Minimum Cost to Reach City With Discounts", "titleSlug": "minimum-cost-to-reach-city-with-discounts", "topicTags": [{"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 9969, "totalSubmissionRaw": 16656}, "2094": {"acRate": 60.913668135962084, "difficulty": "Easy", "likes": 700, "dislikes": 263, "categoryTitle": "Algorithms", "frontendQuestionId": "2094", "paidOnly": false, "title": "Finding 3-Digit Even Numbers", "titleSlug": "finding-3-digit-even-numbers", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33028, "totalSubmissionRaw": 54221}, "2095": {"acRate": 59.47196030530102, "difficulty": "Medium", "likes": 4199, "dislikes": 79, "categoryTitle": "Algorithms", "frontendQuestionId": "2095", "paidOnly": false, "title": "Delete the Middle Node of a Linked List", "titleSlug": "delete-the-middle-node-of-a-linked-list", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 470086, "totalSubmissionRaw": 790433}, "2096": {"acRate": 56.37087188829521, "difficulty": "Medium", "likes": 3085, "dislikes": 160, "categoryTitle": "Algorithms", "frontendQuestionId": "2096", "paidOnly": false, "title": "Step-By-Step Directions From a Binary Tree Node to Another", "titleSlug": "step-by-step-directions-from-a-binary-tree-node-to-another", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 202987, "totalSubmissionRaw": 360092}, "2097": {"acRate": 44.13465589215273, "difficulty": "Hard", "likes": 507, "dislikes": 27, "categoryTitle": "Algorithms", "frontendQuestionId": "2097", "paidOnly": false, "title": "Valid Arrangement of Pairs", "titleSlug": "valid-arrangement-of-pairs", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Eulerian Circuit", "id": "VG9waWNUYWdOb2RlOjYxMDc0", "slug": "eulerian-circuit"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11524, "totalSubmissionRaw": 26111}, "2098": {"acRate": 36.66144901610018, "difficulty": "Medium", "likes": 84, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "2098", "paidOnly": true, "title": "Subsequence of Size K With the Largest Even Sum", "titleSlug": "subsequence-of-size-k-with-the-largest-even-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3279, "totalSubmissionRaw": 8944}, "2099": {"acRate": 43.888718335919286, "difficulty": "Easy", "likes": 1255, "dislikes": 133, "categoryTitle": "Algorithms", "frontendQuestionId": "2099", "paidOnly": false, "title": "Find Subsequence of Length K With the Largest Sum", "titleSlug": "find-subsequence-of-length-k-with-the-largest-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 52896, "totalSubmissionRaw": 120523}, "2100": {"acRate": 49.53933766186659, "difficulty": "Medium", "likes": 889, "dislikes": 45, "categoryTitle": "Algorithms", "frontendQuestionId": "2100", "paidOnly": false, "title": "Find Good Days to Rob the Bank", "titleSlug": "find-good-days-to-rob-the-bank", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27315, "totalSubmissionRaw": 55138}, "2101": {"acRate": 48.72782757962998, "difficulty": "Medium", "likes": 3076, "dislikes": 153, "categoryTitle": "Algorithms", "frontendQuestionId": "2101", "paidOnly": false, "title": "Detonate the Maximum Bombs", "titleSlug": "detonate-the-maximum-bombs", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 127740, "totalSubmissionRaw": 262147}, "2102": {"acRate": 64.65431278045538, "difficulty": "Hard", "likes": 384, "dislikes": 43, "categoryTitle": "Algorithms", "frontendQuestionId": "2102", "paidOnly": false, "title": "Sequentially Ordinal Rank Tracker", "titleSlug": "sequentially-ordinal-rank-tracker", "topicTags": [{"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Data Stream", "id": "VG9waWNUYWdOb2RlOjYxMDYz", "slug": "data-stream"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15561, "totalSubmissionRaw": 24068}, "2103": {"acRate": 80.90381775996626, "difficulty": "Easy", "likes": 959, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "2103", "paidOnly": false, "title": "Rings and Rods", "titleSlug": "rings-and-rods", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 76711, "totalSubmissionRaw": 94818}, "2104": {"acRate": 60.94228717971995, "difficulty": "Medium", "likes": 2394, "dislikes": 117, "categoryTitle": "Algorithms", "frontendQuestionId": "2104", "paidOnly": false, "title": "Sum of Subarray Ranges", "titleSlug": "sum-of-subarray-ranges", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 107412, "totalSubmissionRaw": 176251}, "2105": {"acRate": 48.33238851095994, "difficulty": "Medium", "likes": 277, "dislikes": 160, "categoryTitle": "Algorithms", "frontendQuestionId": "2105", "paidOnly": false, "title": "Watering Plants II", "titleSlug": "watering-plants-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20462, "totalSubmissionRaw": 42336}, "2106": {"acRate": 36.34923201293452, "difficulty": "Hard", "likes": 553, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "2106", "paidOnly": false, "title": "Maximum Fruits Harvested After at Most K Steps", "titleSlug": "maximum-fruits-harvested-after-at-most-k-steps", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11241, "totalSubmissionRaw": 30925}, "2107": {"acRate": 55.33462657613967, "difficulty": "Medium", "likes": 77, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "2107", "paidOnly": true, "title": "Number of Unique Flavors After Sharing K Candies", "titleSlug": "number-of-unique-flavors-after-sharing-k-candies", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3423, "totalSubmissionRaw": 6186}, "2108": {"acRate": 83.88058533750234, "difficulty": "Easy", "likes": 1532, "dislikes": 53, "categoryTitle": "Algorithms", "frontendQuestionId": "2108", "paidOnly": false, "title": "Find First Palindromic String in the Array", "titleSlug": "find-first-palindromic-string-in-the-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 300191, "totalSubmissionRaw": 357879}, "2109": {"acRate": 59.22443734812535, "difficulty": "Medium", "likes": 560, "dislikes": 68, "categoryTitle": "Algorithms", "frontendQuestionId": "2109", "paidOnly": false, "title": "Adding Spaces to a String", "titleSlug": "adding-spaces-to-a-string", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 46551, "totalSubmissionRaw": 78601}, "2110": {"acRate": 59.13891018320061, "difficulty": "Medium", "likes": 713, "dislikes": 31, "categoryTitle": "Algorithms", "frontendQuestionId": "2110", "paidOnly": false, "title": "Number of Smooth Descent Periods of a Stock", "titleSlug": "number-of-smooth-descent-periods-of-a-stock", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 37801, "totalSubmissionRaw": 63919}, "2111": {"acRate": 38.78660093840946, "difficulty": "Hard", "likes": 697, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "2111", "paidOnly": false, "title": "Minimum Operations to Make the Array K-Increasing", "titleSlug": "minimum-operations-to-make-the-array-k-increasing", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13061, "totalSubmissionRaw": 33674}, "2112": {"acRate": 70.22462960012746, "difficulty": "Medium", "likes": 60, "dislikes": 8, "categoryTitle": "Database", "frontendQuestionId": "2112", "paidOnly": true, "title": "The Airport With the Most Traffic", "titleSlug": "the-airport-with-the-most-traffic", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8816, "totalSubmissionRaw": 12554}, "2113": {"acRate": 73.7987987987988, "difficulty": "Medium", "likes": 59, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "2113", "paidOnly": true, "title": "Elements in Array After Removing and Replacing Elements", "titleSlug": "elements-in-array-after-removing-and-replacing-elements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1966, "totalSubmissionRaw": 2664}, "2114": {"acRate": 86.5767472333395, "difficulty": "Easy", "likes": 1745, "dislikes": 60, "categoryTitle": "Algorithms", "frontendQuestionId": "2114", "paidOnly": false, "title": "Maximum Number of Words Found in Sentences", "titleSlug": "maximum-number-of-words-found-in-sentences", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 303931, "totalSubmissionRaw": 351054}, "2115": {"acRate": 50.20112672542824, "difficulty": "Medium", "likes": 1879, "dislikes": 91, "categoryTitle": "Algorithms", "frontendQuestionId": "2115", "paidOnly": false, "title": "Find All Possible Recipes from Given Supplies", "titleSlug": "find-all-possible-recipes-from-given-supplies", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 96595, "totalSubmissionRaw": 192416}, "2116": {"acRate": 31.99071870537839, "difficulty": "Medium", "likes": 1157, "dislikes": 44, "categoryTitle": "Algorithms", "frontendQuestionId": "2116", "paidOnly": false, "title": "Check if a Parentheses String Can Be Valid", "titleSlug": "check-if-a-parentheses-string-can-be-valid", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26885, "totalSubmissionRaw": 84040}, "2117": {"acRate": 26.124669214936784, "difficulty": "Hard", "likes": 89, "dislikes": 154, "categoryTitle": "Algorithms", "frontendQuestionId": "2117", "paidOnly": false, "title": "Abbreviating the Product of a Range", "titleSlug": "abbreviating-the-product-of-a-range", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3554, "totalSubmissionRaw": 13604}, "2118": {"acRate": 55.590191188694924, "difficulty": "Hard", "likes": 23, "dislikes": 37, "categoryTitle": "Database", "frontendQuestionId": "2118", "paidOnly": true, "title": "Build the Equation", "titleSlug": "build-the-equation", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2675, "totalSubmissionRaw": 4812}, "2119": {"acRate": 80.21294557483245, "difficulty": "Easy", "likes": 680, "dislikes": 38, "categoryTitle": "Algorithms", "frontendQuestionId": "2119", "paidOnly": false, "title": "A Number After a Double Reversal", "titleSlug": "a-number-after-a-double-reversal", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 93116, "totalSubmissionRaw": 116086}, "2120": {"acRate": 82.71961989361152, "difficulty": "Medium", "likes": 539, "dislikes": 51, "categoryTitle": "Algorithms", "frontendQuestionId": "2120", "paidOnly": false, "title": "Execution of All Suffix Instructions Staying in a Grid", "titleSlug": "execution-of-all-suffix-instructions-staying-in-a-grid", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 32034, "totalSubmissionRaw": 38726}, "2121": {"acRate": 44.49716592236344, "difficulty": "Medium", "likes": 905, "dislikes": 39, "categoryTitle": "Algorithms", "frontendQuestionId": "2121", "paidOnly": false, "title": "Intervals Between Identical Elements", "titleSlug": "intervals-between-identical-elements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20725, "totalSubmissionRaw": 46576}, "2122": {"acRate": 39.471793029105285, "difficulty": "Hard", "likes": 372, "dislikes": 33, "categoryTitle": "Algorithms", "frontendQuestionId": "2122", "paidOnly": false, "title": "Recover the Original Array", "titleSlug": "recover-the-original-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10985, "totalSubmissionRaw": 27830}, "2123": {"acRate": 40.63886424134871, "difficulty": "Hard", "likes": 52, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "2123", "paidOnly": true, "title": "Minimum Operations to Remove Adjacent Ones in Matrix", "titleSlug": "minimum-operations-to-remove-adjacent-ones-in-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 916, "totalSubmissionRaw": 2254}, "2124": {"acRate": 72.1288280896807, "difficulty": "Easy", "likes": 738, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "2124", "paidOnly": false, "title": "Check if All A's Appears Before All B's", "titleSlug": "check-if-all-as-appears-before-all-bs", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 86155, "totalSubmissionRaw": 119446}, "2125": {"acRate": 85.59912933656584, "difficulty": "Medium", "likes": 1854, "dislikes": 190, "categoryTitle": "Algorithms", "frontendQuestionId": "2125", "paidOnly": false, "title": "Number of Laser Beams in a Bank", "titleSlug": "number-of-laser-beams-in-a-bank", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 210787, "totalSubmissionRaw": 246249}, "2126": {"acRate": 51.690815920837565, "difficulty": "Medium", "likes": 556, "dislikes": 189, "categoryTitle": "Algorithms", "frontendQuestionId": "2126", "paidOnly": false, "title": "Destroying Asteroids", "titleSlug": "destroying-asteroids", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 46805, "totalSubmissionRaw": 90548}, "2127": {"acRate": 37.34969663541092, "difficulty": "Hard", "likes": 1034, "dislikes": 37, "categoryTitle": "Algorithms", "frontendQuestionId": "2127", "paidOnly": false, "title": "Maximum Employees to Be Invited to a Meeting", "titleSlug": "maximum-employees-to-be-invited-to-a-meeting", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13543, "totalSubmissionRaw": 36260}, "2128": {"acRate": 76.21205565550065, "difficulty": "Medium", "likes": 475, "dislikes": 184, "categoryTitle": "Algorithms", "frontendQuestionId": "2128", "paidOnly": true, "title": "Remove All Ones With Row and Column Flips", "titleSlug": "remove-all-ones-with-row-and-column-flips", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33467, "totalSubmissionRaw": 43913}, "2129": {"acRate": 64.709757344555, "difficulty": "Easy", "likes": 735, "dislikes": 51, "categoryTitle": "Algorithms", "frontendQuestionId": "2129", "paidOnly": false, "title": "Capitalize the Title", "titleSlug": "capitalize-the-title", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 65814, "totalSubmissionRaw": 101707}, "2130": {"acRate": 80.96635602920654, "difficulty": "Medium", "likes": 3531, "dislikes": 102, "categoryTitle": "Algorithms", "frontendQuestionId": "2130", "paidOnly": false, "title": "Maximum Twin Sum of a Linked List", "titleSlug": "maximum-twin-sum-of-a-linked-list", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 309819, "totalSubmissionRaw": 382652}, "2131": {"acRate": 48.02860619104792, "difficulty": "Medium", "likes": 2435, "dislikes": 61, "categoryTitle": "Algorithms", "frontendQuestionId": "2131", "paidOnly": false, "title": "Longest Palindrome by Concatenating Two Letter Words", "titleSlug": "longest-palindrome-by-concatenating-two-letter-words", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 119609, "totalSubmissionRaw": 249036}, "2132": {"acRate": 32.38871749669458, "difficulty": "Hard", "likes": 386, "dislikes": 44, "categoryTitle": "Algorithms", "frontendQuestionId": "2132", "paidOnly": false, "title": "Stamping the Grid", "titleSlug": "stamping-the-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7349, "totalSubmissionRaw": 22690}, "2133": {"acRate": 51.849529362320965, "difficulty": "Easy", "likes": 968, "dislikes": 52, "categoryTitle": "Algorithms", "frontendQuestionId": "2133", "paidOnly": false, "title": "Check if Every Row and Column Contains All Numbers", "titleSlug": "check-if-every-row-and-column-contains-all-numbers", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 77724, "totalSubmissionRaw": 149903}, "2134": {"acRate": 65.48869265561059, "difficulty": "Medium", "likes": 1940, "dislikes": 39, "categoryTitle": "Algorithms", "frontendQuestionId": "2134", "paidOnly": false, "title": "Minimum Swaps to Group All 1's Together II", "titleSlug": "minimum-swaps-to-group-all-1s-together-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 152032, "totalSubmissionRaw": 232150}, "2135": {"acRate": 43.09392941522114, "difficulty": "Medium", "likes": 693, "dislikes": 159, "categoryTitle": "Algorithms", "frontendQuestionId": "2135", "paidOnly": false, "title": "Count Words Obtained After Adding a Letter", "titleSlug": "count-words-obtained-after-adding-a-letter", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 35203, "totalSubmissionRaw": 81689}, "2136": {"acRate": 71.80052151238591, "difficulty": "Hard", "likes": 1585, "dislikes": 81, "categoryTitle": "Algorithms", "frontendQuestionId": "2136", "paidOnly": false, "title": "Earliest Possible Day of Full Bloom", "titleSlug": "earliest-possible-day-of-full-bloom", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 55071, "totalSubmissionRaw": 76700}, "2137": {"acRate": 67.6019057702488, "difficulty": "Medium", "likes": 102, "dislikes": 10, "categoryTitle": "Algorithms", "frontendQuestionId": "2137", "paidOnly": true, "title": "Pour Water Between Buckets to Make Water Levels Equal", "titleSlug": "pour-water-between-buckets-to-make-water-levels-equal", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2554, "totalSubmissionRaw": 3778}, "2138": {"acRate": 66.88938790692548, "difficulty": "Easy", "likes": 464, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "2138", "paidOnly": false, "title": "Divide a String Into Groups of Size k", "titleSlug": "divide-a-string-into-groups-of-size-k", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 48553, "totalSubmissionRaw": 72587}, "2139": {"acRate": 50.97988304621707, "difficulty": "Medium", "likes": 990, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "2139", "paidOnly": false, "title": "Minimum Moves to Reach Target Score", "titleSlug": "minimum-moves-to-reach-target-score", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 45159, "totalSubmissionRaw": 88582}, "2140": {"acRate": 55.05341520861373, "difficulty": "Medium", "likes": 2334, "dislikes": 59, "categoryTitle": "Algorithms", "frontendQuestionId": "2140", "paidOnly": false, "title": "Solving Questions With Brainpower", "titleSlug": "solving-questions-with-brainpower", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 104716, "totalSubmissionRaw": 190208}, "2141": {"acRate": 49.96393856442703, "difficulty": "Hard", "likes": 2003, "dislikes": 56, "categoryTitle": "Algorithms", "frontendQuestionId": "2141", "paidOnly": false, "title": "Maximum Running Time of N Computers", "titleSlug": "maximum-running-time-of-n-computers", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 60963, "totalSubmissionRaw": 122014}, "2142": {"acRate": 48.39898883505372, "difficulty": "Medium", "likes": 105, "dislikes": 11, "categoryTitle": "Database", "frontendQuestionId": "2142", "paidOnly": true, "title": "The Number of Passengers in Each Bus I", "titleSlug": "the-number-of-passengers-in-each-bus-i", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9190, "totalSubmissionRaw": 18988}, "2143": {"acRate": 51.941287878787875, "difficulty": "Hard", "likes": 38, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "2143", "paidOnly": true, "title": "Choose Numbers From Two Arrays in Range", "titleSlug": "choose-numbers-from-two-arrays-in-range", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1097, "totalSubmissionRaw": 2112}, "2144": {"acRate": 61.3999928850099, "difficulty": "Easy", "likes": 593, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "2144", "paidOnly": false, "title": "Minimum Cost of Buying Candies With Discount", "titleSlug": "minimum-cost-of-buying-candies-with-discount", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 51778, "totalSubmissionRaw": 84329}, "2145": {"acRate": 38.67158671586716, "difficulty": "Medium", "likes": 521, "dislikes": 46, "categoryTitle": "Algorithms", "frontendQuestionId": "2145", "paidOnly": false, "title": "Count the Hidden Sequences", "titleSlug": "count-the-hidden-sequences", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18864, "totalSubmissionRaw": 48780}, "2146": {"acRate": 43.36032388663968, "difficulty": "Medium", "likes": 503, "dislikes": 158, "categoryTitle": "Algorithms", "frontendQuestionId": "2146", "paidOnly": false, "title": "K Highest Ranked Items Within a Price Range", "titleSlug": "k-highest-ranked-items-within-a-price-range", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16065, "totalSubmissionRaw": 37050}, "2147": {"acRate": 49.34005817908158, "difficulty": "Hard", "likes": 1055, "dislikes": 107, "categoryTitle": "Algorithms", "frontendQuestionId": "2147", "paidOnly": false, "title": "Number of Ways to Divide a Long Corridor", "titleSlug": "number-of-ways-to-divide-a-long-corridor", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 68185, "totalSubmissionRaw": 138194}, "2148": {"acRate": 59.398630900262674, "difficulty": "Easy", "likes": 646, "dislikes": 40, "categoryTitle": "Algorithms", "frontendQuestionId": "2148", "paidOnly": false, "title": "Count Elements With Strictly Smaller and Greater Elements ", "titleSlug": "count-elements-with-strictly-smaller-and-greater-elements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 59698, "totalSubmissionRaw": 100504}, "2149": {"acRate": 84.02523021636596, "difficulty": "Medium", "likes": 3281, "dislikes": 185, "categoryTitle": "Algorithms", "frontendQuestionId": "2149", "paidOnly": false, "title": "Rearrange Array Elements by Sign", "titleSlug": "rearrange-array-elements-by-sign", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 404032, "totalSubmissionRaw": 480847}, "2150": {"acRate": 60.81465800423389, "difficulty": "Medium", "likes": 646, "dislikes": 62, "categoryTitle": "Algorithms", "frontendQuestionId": "2150", "paidOnly": false, "title": "Find All Lonely Numbers in the Array", "titleSlug": "find-all-lonely-numbers-in-the-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 49983, "totalSubmissionRaw": 82189}, "2151": {"acRate": 50.15825114088032, "difficulty": "Hard", "likes": 505, "dislikes": 80, "categoryTitle": "Algorithms", "frontendQuestionId": "2151", "paidOnly": false, "title": "Maximum Good People Based on Statements", "titleSlug": "maximum-good-people-based-on-statements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13629, "totalSubmissionRaw": 27164}, "2152": {"acRate": 43.36377150138034, "difficulty": "Medium", "likes": 71, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "2152", "paidOnly": true, "title": "Minimum Number of Lines to Cover Points", "titleSlug": "minimum-number-of-lines-to-cover-points", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2042, "totalSubmissionRaw": 4709}, "2153": {"acRate": 40.029054410987854, "difficulty": "Hard", "likes": 78, "dislikes": 28, "categoryTitle": "Database", "frontendQuestionId": "2153", "paidOnly": true, "title": "The Number of Passengers in Each Bus II", "titleSlug": "the-number-of-passengers-in-each-bus-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 3031, "totalSubmissionRaw": 7572}, "2154": {"acRate": 71.36394680218255, "difficulty": "Easy", "likes": 710, "dislikes": 38, "categoryTitle": "Algorithms", "frontendQuestionId": "2154", "paidOnly": false, "title": "Keep Multiplying Found Values by Two", "titleSlug": "keep-multiplying-found-values-by-two", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 97177, "totalSubmissionRaw": 136171}, "2155": {"acRate": 64.35777585076458, "difficulty": "Medium", "likes": 503, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "2155", "paidOnly": false, "title": "All Divisions With the Highest Score of a Binary Array", "titleSlug": "all-divisions-with-the-highest-score-of-a-binary-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30429, "totalSubmissionRaw": 47281}, "2156": {"acRate": 23.66974088713219, "difficulty": "Hard", "likes": 424, "dislikes": 383, "categoryTitle": "Algorithms", "frontendQuestionId": "2156", "paidOnly": false, "title": "Find Substring With Given Hash Value", "titleSlug": "find-substring-with-given-hash-value", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13474, "totalSubmissionRaw": 56925}, "2157": {"acRate": 26.133868300485265, "difficulty": "Hard", "likes": 472, "dislikes": 56, "categoryTitle": "Algorithms", "frontendQuestionId": "2157", "paidOnly": false, "title": "Groups of Strings", "titleSlug": "groups-of-strings", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9640, "totalSubmissionRaw": 36887}, "2158": {"acRate": 55.302517162471396, "difficulty": "Hard", "likes": 421, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "2158", "paidOnly": true, "title": "Amount of New Area Painted Each Day", "titleSlug": "amount-of-new-area-painted-each-day", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30209, "totalSubmissionRaw": 54625}, "2159": {"acRate": 60.396039603960396, "difficulty": "Medium", "likes": 72, "dislikes": 18, "categoryTitle": "Database", "frontendQuestionId": "2159", "paidOnly": true, "title": "Order Two Columns Independently", "titleSlug": "order-two-columns-independently", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7991, "totalSubmissionRaw": 13231}, "2160": {"acRate": 86.23410336251047, "difficulty": "Easy", "likes": 1403, "dislikes": 139, "categoryTitle": "Algorithms", "frontendQuestionId": "2160", "paidOnly": false, "title": "Minimum Sum of Four Digit Number After Splitting Digits", "titleSlug": "minimum-sum-of-four-digit-number-after-splitting-digits", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 134871, "totalSubmissionRaw": 156401}, "2161": {"acRate": 85.13132167203932, "difficulty": "Medium", "likes": 1106, "dislikes": 86, "categoryTitle": "Algorithms", "frontendQuestionId": "2161", "paidOnly": false, "title": "Partition Array According to Given Pivot", "titleSlug": "partition-array-according-to-given-pivot", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 80547, "totalSubmissionRaw": 94615}, "2162": {"acRate": 41.17225309195196, "difficulty": "Medium", "likes": 208, "dislikes": 622, "categoryTitle": "Algorithms", "frontendQuestionId": "2162", "paidOnly": false, "title": "Minimum Cost to Set Cooking Time", "titleSlug": "minimum-cost-to-set-cooking-time", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16079, "totalSubmissionRaw": 39053}, "2163": {"acRate": 48.18566955240376, "difficulty": "Hard", "likes": 670, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2163", "paidOnly": false, "title": "Minimum Difference in Sums After Removal of Elements", "titleSlug": "minimum-difference-in-sums-after-removal-of-elements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10464, "totalSubmissionRaw": 21716}, "2164": {"acRate": 62.62288406724449, "difficulty": "Easy", "likes": 731, "dislikes": 63, "categoryTitle": "Algorithms", "frontendQuestionId": "2164", "paidOnly": false, "title": "Sort Even and Odd Indices Independently", "titleSlug": "sort-even-and-odd-indices-independently", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 64593, "totalSubmissionRaw": 103146}, "2165": {"acRate": 52.26145065534746, "difficulty": "Medium", "likes": 635, "dislikes": 23, "categoryTitle": "Algorithms", "frontendQuestionId": "2165", "paidOnly": false, "title": "Smallest Value of the Rearranged Number", "titleSlug": "smallest-value-of-the-rearranged-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 36444, "totalSubmissionRaw": 69734}, "2166": {"acRate": 32.564873907053894, "difficulty": "Medium", "likes": 588, "dislikes": 47, "categoryTitle": "Algorithms", "frontendQuestionId": "2166", "paidOnly": false, "title": "Design Bitset", "titleSlug": "design-bitset", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23166, "totalSubmissionRaw": 71138}, "2167": {"acRate": 41.5563290933342, "difficulty": "Hard", "likes": 669, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "2167", "paidOnly": false, "title": "Minimum Time to Remove All Cars Containing Illegal Goods", "titleSlug": "minimum-time-to-remove-all-cars-containing-illegal-goods", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12774, "totalSubmissionRaw": 30739}, "2168": {"acRate": 60.0132625994695, "difficulty": "Medium", "likes": 73, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "2168", "paidOnly": true, "title": "Unique Substrings With Equal Digit Frequency", "titleSlug": "unique-substrings-with-equal-digit-frequency", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2715, "totalSubmissionRaw": 4524}, "2169": {"acRate": 74.49615030749116, "difficulty": "Easy", "likes": 604, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "2169", "paidOnly": false, "title": "Count Operations to Obtain Zero", "titleSlug": "count-operations-to-obtain-zero", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 76921, "totalSubmissionRaw": 103255}, "2170": {"acRate": 33.374004057272224, "difficulty": "Medium", "likes": 579, "dislikes": 331, "categoryTitle": "Algorithms", "frontendQuestionId": "2170", "paidOnly": false, "title": "Minimum Operations to Make the Array Alternating", "titleSlug": "minimum-operations-to-make-the-array-alternating", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22703, "totalSubmissionRaw": 68027}, "2171": {"acRate": 42.93725133924376, "difficulty": "Medium", "likes": 872, "dislikes": 48, "categoryTitle": "Algorithms", "frontendQuestionId": "2171", "paidOnly": false, "title": "Removing Minimum Number of Magic Beans", "titleSlug": "removing-minimum-number-of-magic-beans", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27412, "totalSubmissionRaw": 63842}, "2172": {"acRate": 49.21163279607568, "difficulty": "Hard", "likes": 513, "dislikes": 29, "categoryTitle": "Algorithms", "frontendQuestionId": "2172", "paidOnly": false, "title": "Maximum AND Sum of Array", "titleSlug": "maximum-and-sum-of-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14045, "totalSubmissionRaw": 28540}, "2173": {"acRate": 52.886551801297834, "difficulty": "Hard", "likes": 97, "dislikes": 4, "categoryTitle": "Database", "frontendQuestionId": "2173", "paidOnly": true, "title": "Longest Winning Streak", "titleSlug": "longest-winning-streak", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 4727, "totalSubmissionRaw": 8938}, "2174": {"acRate": 67.25036759791472, "difficulty": "Medium", "likes": 91, "dislikes": 23, "categoryTitle": "Algorithms", "frontendQuestionId": "2174", "paidOnly": true, "title": "Remove All Ones With Row and Column Flips II", "titleSlug": "remove-all-ones-with-row-and-column-flips-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5031, "totalSubmissionRaw": 7481}, "2175": {"acRate": 60.39310216947895, "difficulty": "Medium", "likes": 39, "dislikes": 16, "categoryTitle": "Database", "frontendQuestionId": "2175", "paidOnly": true, "title": "The Change in Global Rankings", "titleSlug": "the-change-in-global-rankings", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6514, "totalSubmissionRaw": 10786}, "2176": {"acRate": 79.61903439796131, "difficulty": "Easy", "likes": 640, "dislikes": 28, "categoryTitle": "Algorithms", "frontendQuestionId": "2176", "paidOnly": false, "title": "Count Equal and Divisible Pairs in an Array", "titleSlug": "count-equal-and-divisible-pairs-in-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 80295, "totalSubmissionRaw": 100849}, "2177": {"acRate": 64.55996376328902, "difficulty": "Medium", "likes": 671, "dislikes": 218, "categoryTitle": "Algorithms", "frontendQuestionId": "2177", "paidOnly": false, "title": "Find Three Consecutive Integers That Sum to a Given Number", "titleSlug": "find-three-consecutive-integers-that-sum-to-a-given-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 48461, "totalSubmissionRaw": 75063}, "2178": {"acRate": 59.25761702666751, "difficulty": "Medium", "likes": 783, "dislikes": 73, "categoryTitle": "Algorithms", "frontendQuestionId": "2178", "paidOnly": false, "title": "Maximum Split of Positive Even Integers", "titleSlug": "maximum-split-of-positive-even-integers", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 46773, "totalSubmissionRaw": 78931}, "2179": {"acRate": 41.466423249617606, "difficulty": "Hard", "likes": 619, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "2179", "paidOnly": false, "title": "Count Good Triplets in an Array", "titleSlug": "count-good-triplets-in-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Merge Sort", "id": "VG9waWNUYWdOb2RlOjYxMDUx", "slug": "merge-sort"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8404, "totalSubmissionRaw": 20267}, "2180": {"acRate": 67.26612612994052, "difficulty": "Easy", "likes": 618, "dislikes": 31, "categoryTitle": "Algorithms", "frontendQuestionId": "2180", "paidOnly": false, "title": "Count Integers With Even Digit Sum", "titleSlug": "count-integers-with-even-digit-sum", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 63542, "totalSubmissionRaw": 94459}, "2181": {"acRate": 89.8343073175716, "difficulty": "Medium", "likes": 2295, "dislikes": 48, "categoryTitle": "Algorithms", "frontendQuestionId": "2181", "paidOnly": false, "title": "Merge Nodes in Between Zeros", "titleSlug": "merge-nodes-in-between-zeros", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 272550, "totalSubmissionRaw": 303388}, "2182": {"acRate": 54.48976186503302, "difficulty": "Medium", "likes": 659, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "2182", "paidOnly": false, "title": "Construct String With Repeat Limit", "titleSlug": "construct-string-with-repeat-limit", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22842, "totalSubmissionRaw": 41930}, "2183": {"acRate": 29.56048498208873, "difficulty": "Hard", "likes": 843, "dislikes": 35, "categoryTitle": "Algorithms", "frontendQuestionId": "2183", "paidOnly": false, "title": "Count Array Pairs Divisible by K", "titleSlug": "count-array-pairs-divisible-by-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17165, "totalSubmissionRaw": 58065}, "2184": {"acRate": 48.99010839305811, "difficulty": "Medium", "likes": 178, "dislikes": 124, "categoryTitle": "Algorithms", "frontendQuestionId": "2184", "paidOnly": true, "title": "Number of Ways to Build Sturdy Brick Wall", "titleSlug": "number-of-ways-to-build-sturdy-brick-wall", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8271, "totalSubmissionRaw": 16883}, "2185": {"acRate": 78.2534567978477, "difficulty": "Easy", "likes": 695, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "2185", "paidOnly": false, "title": "Counting Words With a Given Prefix", "titleSlug": "counting-words-with-a-given-prefix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 100058, "totalSubmissionRaw": 127864}, "2186": {"acRate": 72.7364585058804, "difficulty": "Medium", "likes": 573, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "2186", "paidOnly": false, "title": "Minimum Number of Steps to Make Two Strings Anagram II", "titleSlug": "minimum-number-of-steps-to-make-two-strings-anagram-ii", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 43912, "totalSubmissionRaw": 60371}, "2187": {"acRate": 38.78476860608145, "difficulty": "Medium", "likes": 2801, "dislikes": 181, "categoryTitle": "Algorithms", "frontendQuestionId": "2187", "paidOnly": false, "title": "Minimum Time to Complete Trips", "titleSlug": "minimum-time-to-complete-trips", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 117296, "totalSubmissionRaw": 302428}, "2188": {"acRate": 41.822470429081825, "difficulty": "Hard", "likes": 565, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "2188", "paidOnly": false, "title": "Minimum Time to Finish the Race", "titleSlug": "minimum-time-to-finish-the-race", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12057, "totalSubmissionRaw": 28829}, "2189": {"acRate": 63.18283166109253, "difficulty": "Medium", "likes": 66, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "2189", "paidOnly": true, "title": "Number of Ways to Build House of Cards", "titleSlug": "number-of-ways-to-build-house-of-cards", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2267, "totalSubmissionRaw": 3588}, "2190": {"acRate": 59.0460295425122, "difficulty": "Easy", "likes": 371, "dislikes": 235, "categoryTitle": "Algorithms", "frontendQuestionId": "2190", "paidOnly": false, "title": "Most Frequent Number Following Key In an Array", "titleSlug": "most-frequent-number-following-key-in-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 37855, "totalSubmissionRaw": 64111}, "2191": {"acRate": 60.26478295733547, "difficulty": "Medium", "likes": 919, "dislikes": 136, "categoryTitle": "Algorithms", "frontendQuestionId": "2191", "paidOnly": false, "title": "Sort the Jumbled Numbers", "titleSlug": "sort-the-jumbled-numbers", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 145801, "totalSubmissionRaw": 241934}, "2192": {"acRate": 62.194124559341944, "difficulty": "Medium", "likes": 1605, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "2192", "paidOnly": false, "title": "All Ancestors of a Node in a Directed Acyclic Graph", "titleSlug": "all-ancestors-of-a-node-in-a-directed-acyclic-graph", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 132318, "totalSubmissionRaw": 212750}, "2193": {"acRate": 51.195040899795494, "difficulty": "Hard", "likes": 975, "dislikes": 72, "categoryTitle": "Algorithms", "frontendQuestionId": "2193", "paidOnly": false, "title": "Minimum Number of Moves to Make Palindrome", "titleSlug": "minimum-number-of-moves-to-make-palindrome", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24033, "totalSubmissionRaw": 46944}, "2194": {"acRate": 84.16438861782991, "difficulty": "Easy", "likes": 609, "dislikes": 95, "categoryTitle": "Algorithms", "frontendQuestionId": "2194", "paidOnly": false, "title": "Cells in a Range on an Excel Sheet", "titleSlug": "cells-in-a-range-on-an-excel-sheet", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 72968, "totalSubmissionRaw": 86697}, "2195": {"acRate": 25.50397303898834, "difficulty": "Medium", "likes": 750, "dislikes": 308, "categoryTitle": "Algorithms", "frontendQuestionId": "2195", "paidOnly": false, "title": "Append K Integers With Minimal Sum", "titleSlug": "append-k-integers-with-minimal-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 32995, "totalSubmissionRaw": 129372}, "2196": {"acRate": 81.81263663598824, "difficulty": "Medium", "likes": 1567, "dislikes": 35, "categoryTitle": "Algorithms", "frontendQuestionId": "2196", "paidOnly": false, "title": "Create Binary Tree From Descriptions", "titleSlug": "create-binary-tree-from-descriptions", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 151562, "totalSubmissionRaw": 185255}, "2197": {"acRate": 39.20618251339634, "difficulty": "Hard", "likes": 425, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "2197", "paidOnly": false, "title": "Replace Non-Coprime Numbers in Array", "titleSlug": "replace-non-coprime-numbers-in-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14560, "totalSubmissionRaw": 37137}, "2198": {"acRate": 54.78387566779991, "difficulty": "Medium", "likes": 27, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "2198", "paidOnly": true, "title": "Number of Single Divisor Triplets", "titleSlug": "number-of-single-divisor-triplets", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1128, "totalSubmissionRaw": 2059}, "2199": {"acRate": 49.3293142426526, "difficulty": "Hard", "likes": 44, "dislikes": 14, "categoryTitle": "Database", "frontendQuestionId": "2199", "paidOnly": true, "title": "Finding the Topic of Each Post", "titleSlug": "finding-the-topic-of-each-post", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3273, "totalSubmissionRaw": 6635}, "2200": {"acRate": 66.10855625364337, "difficulty": "Easy", "likes": 414, "dislikes": 67, "categoryTitle": "Algorithms", "frontendQuestionId": "2200", "paidOnly": false, "title": "Find All K-Distant Indices in an Array", "titleSlug": "find-all-k-distant-indices-in-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 40826, "totalSubmissionRaw": 61756}, "2201": {"acRate": 56.579021930073104, "difficulty": "Medium", "likes": 214, "dislikes": 198, "categoryTitle": "Algorithms", "frontendQuestionId": "2201", "paidOnly": false, "title": "Count Artifacts That Can Be Extracted", "titleSlug": "count-artifacts-that-can-be-extracted", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19969, "totalSubmissionRaw": 35294}, "2202": {"acRate": 23.070301740328034, "difficulty": "Medium", "likes": 615, "dislikes": 320, "categoryTitle": "Algorithms", "frontendQuestionId": "2202", "paidOnly": false, "title": "Maximize the Topmost Element After K Moves", "titleSlug": "maximize-the-topmost-element-after-k-moves", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29482, "totalSubmissionRaw": 127792}, "2203": {"acRate": 37.09137009870506, "difficulty": "Hard", "likes": 673, "dislikes": 18, "categoryTitle": "Algorithms", "frontendQuestionId": "2203", "paidOnly": false, "title": "Minimum Weighted Subgraph With the Required Paths", "titleSlug": "minimum-weighted-subgraph-with-the-required-paths", "topicTags": [{"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12288, "totalSubmissionRaw": 33129}, "2204": {"acRate": 68.41480308727489, "difficulty": "Hard", "likes": 112, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "2204", "paidOnly": true, "title": "Distance to a Cycle in Undirected Graph", "titleSlug": "distance-to-a-cycle-in-undirected-graph", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3457, "totalSubmissionRaw": 5053}, "2205": {"acRate": 50.05928385107896, "difficulty": "Easy", "likes": 27, "dislikes": 76, "categoryTitle": "Database", "frontendQuestionId": "2205", "paidOnly": true, "title": "The Number of Users That Are Eligible for Discount", "titleSlug": "the-number-of-users-that-are-eligible-for-discount", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6333, "totalSubmissionRaw": 12651}, "2206": {"acRate": 73.75820955404568, "difficulty": "Easy", "likes": 717, "dislikes": 35, "categoryTitle": "Algorithms", "frontendQuestionId": "2206", "paidOnly": false, "title": "Divide Array Into Equal Pairs", "titleSlug": "divide-array-into-equal-pairs", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 84551, "totalSubmissionRaw": 114630}, "2207": {"acRate": 34.833889963086655, "difficulty": "Medium", "likes": 502, "dislikes": 33, "categoryTitle": "Algorithms", "frontendQuestionId": "2207", "paidOnly": false, "title": "Maximize Number of Subsequences in a String", "titleSlug": "maximize-number-of-subsequences-in-a-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19801, "totalSubmissionRaw": 56874}, "2208": {"acRate": 46.87937720242395, "difficulty": "Medium", "likes": 592, "dislikes": 29, "categoryTitle": "Algorithms", "frontendQuestionId": "2208", "paidOnly": false, "title": "Minimum Operations to Halve Array Sum", "titleSlug": "minimum-operations-to-halve-array-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 31795, "totalSubmissionRaw": 67823}, "2209": {"acRate": 36.92593028732925, "difficulty": "Hard", "likes": 500, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2209", "paidOnly": false, "title": "Minimum White Tiles After Covering With Carpets", "titleSlug": "minimum-white-tiles-after-covering-with-carpets", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12543, "totalSubmissionRaw": 33968}, "2210": {"acRate": 61.05923427421741, "difficulty": "Easy", "likes": 690, "dislikes": 92, "categoryTitle": "Algorithms", "frontendQuestionId": "2210", "paidOnly": false, "title": "Count Hills and Valleys in an Array", "titleSlug": "count-hills-and-valleys-in-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 51584, "totalSubmissionRaw": 84487}, "2211": {"acRate": 43.957910559939876, "difficulty": "Medium", "likes": 666, "dislikes": 230, "categoryTitle": "Algorithms", "frontendQuestionId": "2211", "paidOnly": false, "title": "Count Collisions on a Road", "titleSlug": "count-collisions-on-a-road", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29243, "totalSubmissionRaw": 66525}, "2212": {"acRate": 50.23853444437377, "difficulty": "Medium", "likes": 494, "dislikes": 51, "categoryTitle": "Algorithms", "frontendQuestionId": "2212", "paidOnly": false, "title": "Maximum Points in an Archery Competition", "titleSlug": "maximum-points-in-an-archery-competition", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15796, "totalSubmissionRaw": 31442}, "2213": {"acRate": 32.40679315377471, "difficulty": "Hard", "likes": 296, "dislikes": 82, "categoryTitle": "Algorithms", "frontendQuestionId": "2213", "paidOnly": false, "title": "Longest Substring of One Repeating Character", "titleSlug": "longest-substring-of-one-repeating-character", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4885, "totalSubmissionRaw": 15074}, "2214": {"acRate": 57.69519863603865, "difficulty": "Medium", "likes": 313, "dislikes": 234, "categoryTitle": "Algorithms", "frontendQuestionId": "2214", "paidOnly": true, "title": "Minimum Health to Beat Game", "titleSlug": "minimum-health-to-beat-game", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 31471, "totalSubmissionRaw": 54547}, "2215": {"acRate": 79.29235635213495, "difficulty": "Easy", "likes": 2345, "dislikes": 96, "categoryTitle": "Algorithms", "frontendQuestionId": "2215", "paidOnly": false, "title": "Find the Difference of Two Arrays", "titleSlug": "find-the-difference-of-two-arrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 376044, "totalSubmissionRaw": 474250}, "2216": {"acRate": 48.60016545478295, "difficulty": "Medium", "likes": 793, "dislikes": 94, "categoryTitle": "Algorithms", "frontendQuestionId": "2216", "paidOnly": false, "title": "Minimum Deletions to Make Array Beautiful", "titleSlug": "minimum-deletions-to-make-array-beautiful", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33486, "totalSubmissionRaw": 68901}, "2217": {"acRate": 37.191697191697195, "difficulty": "Medium", "likes": 618, "dislikes": 288, "categoryTitle": "Algorithms", "frontendQuestionId": "2217", "paidOnly": false, "title": "Find Palindrome With Fixed Length", "titleSlug": "find-palindrome-with-fixed-length", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22845, "totalSubmissionRaw": 61425}, "2218": {"acRate": 60.54072369946319, "difficulty": "Hard", "likes": 2309, "dislikes": 37, "categoryTitle": "Algorithms", "frontendQuestionId": "2218", "paidOnly": false, "title": "Maximum Value of K Coins From Piles", "titleSlug": "maximum-value-of-k-coins-from-piles", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 67894, "totalSubmissionRaw": 112146}, "2219": {"acRate": 62.058526740666, "difficulty": "Medium", "likes": 66, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2219", "paidOnly": true, "title": "Maximum Sum Score of Array", "titleSlug": "maximum-sum-score-of-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4305, "totalSubmissionRaw": 6937}, "2220": {"acRate": 85.30592355214907, "difficulty": "Easy", "likes": 936, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "2220", "paidOnly": false, "title": "Minimum Bit Flips to Convert Number", "titleSlug": "minimum-bit-flips-to-convert-number", "topicTags": [{"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 103281, "totalSubmissionRaw": 121072}, "2221": {"acRate": 78.8320184721955, "difficulty": "Medium", "likes": 1095, "dislikes": 54, "categoryTitle": "Algorithms", "frontendQuestionId": "2221", "paidOnly": false, "title": "Find Triangular Sum of an Array", "titleSlug": "find-triangular-sum-of-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 81938, "totalSubmissionRaw": 103940}, "2222": {"acRate": 50.697429243370365, "difficulty": "Medium", "likes": 979, "dislikes": 50, "categoryTitle": "Algorithms", "frontendQuestionId": "2222", "paidOnly": false, "title": "Number of Ways to Select Buildings", "titleSlug": "number-of-ways-to-select-buildings", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 37508, "totalSubmissionRaw": 73985}, "2223": {"acRate": 40.496923805016564, "difficulty": "Hard", "likes": 264, "dislikes": 185, "categoryTitle": "Algorithms", "frontendQuestionId": "2223", "paidOnly": false, "title": "Sum of Scores of Built Strings", "titleSlug": "sum-of-scores-of-built-strings", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "Suffix Array", "id": "VG9waWNUYWdOb2RlOjU2Njk4", "slug": "suffix-array"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8557, "totalSubmissionRaw": 21130}, "2224": {"acRate": 65.2772101893475, "difficulty": "Easy", "likes": 453, "dislikes": 36, "categoryTitle": "Algorithms", "frontendQuestionId": "2224", "paidOnly": false, "title": "Minimum Number of Operations to Convert Time", "titleSlug": "minimum-number-of-operations-to-convert-time", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 43128, "totalSubmissionRaw": 66069}, "2225": {"acRate": 73.20080305020221, "difficulty": "Medium", "likes": 2149, "dislikes": 155, "categoryTitle": "Algorithms", "frontendQuestionId": "2225", "paidOnly": false, "title": "Find Players With Zero or One Losses", "titleSlug": "find-players-with-zero-or-one-losses", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 253041, "totalSubmissionRaw": 345681}, "2226": {"acRate": 38.33908523000306, "difficulty": "Medium", "likes": 1119, "dislikes": 41, "categoryTitle": "Algorithms", "frontendQuestionId": "2226", "paidOnly": false, "title": "Maximum Candies Allocated to K Children", "titleSlug": "maximum-candies-allocated-to-k-children", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 43881, "totalSubmissionRaw": 114455}, "2227": {"acRate": 40.56200178510972, "difficulty": "Hard", "likes": 334, "dislikes": 77, "categoryTitle": "Algorithms", "frontendQuestionId": "2227", "paidOnly": false, "title": "Encrypt and Decrypt Strings", "titleSlug": "encrypt-and-decrypt-strings", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13179, "totalSubmissionRaw": 32491}, "2228": {"acRate": 44.88193183032375, "difficulty": "Medium", "likes": 62, "dislikes": 9, "categoryTitle": "Database", "frontendQuestionId": "2228", "paidOnly": true, "title": "Users With Two Purchases Within Seven Days", "titleSlug": "users-with-two-purchases-within-seven-days", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8401, "totalSubmissionRaw": 18718}, "2229": {"acRate": 61.186561829878485, "difficulty": "Easy", "likes": 81, "dislikes": 10, "categoryTitle": "Algorithms", "frontendQuestionId": "2229", "paidOnly": true, "title": "Check if an Array Is Consecutive", "titleSlug": "check-if-an-array-is-consecutive", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5992, "totalSubmissionRaw": 9793}, "2230": {"acRate": 49.94978544690952, "difficulty": "Easy", "likes": 20, "dislikes": 44, "categoryTitle": "Database", "frontendQuestionId": "2230", "paidOnly": true, "title": "The Users That Are Eligible for Discount", "titleSlug": "the-users-that-are-eligible-for-discount", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5471, "totalSubmissionRaw": 10953}, "2231": {"acRate": 61.951019291284716, "difficulty": "Easy", "likes": 616, "dislikes": 297, "categoryTitle": "Algorithms", "frontendQuestionId": "2231", "paidOnly": false, "title": "Largest Number After Digit Swaps by Parity", "titleSlug": "largest-number-after-digit-swaps-by-parity", "topicTags": [{"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 45280, "totalSubmissionRaw": 73090}, "2232": {"acRate": 67.58552715248632, "difficulty": "Medium", "likes": 206, "dislikes": 333, "categoryTitle": "Algorithms", "frontendQuestionId": "2232", "paidOnly": false, "title": "Minimize Result by Adding Parentheses to Expression", "titleSlug": "minimize-result-by-adding-parentheses-to-expression", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21256, "totalSubmissionRaw": 31451}, "2233": {"acRate": 41.7123670956911, "difficulty": "Medium", "likes": 736, "dislikes": 45, "categoryTitle": "Algorithms", "frontendQuestionId": "2233", "paidOnly": false, "title": "Maximum Product After K Increments", "titleSlug": "maximum-product-after-k-increments", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33543, "totalSubmissionRaw": 80415}, "2234": {"acRate": 29.598216063393462, "difficulty": "Hard", "likes": 432, "dislikes": 38, "categoryTitle": "Algorithms", "frontendQuestionId": "2234", "paidOnly": false, "title": "Maximum Total Beauty of the Gardens", "titleSlug": "maximum-total-beauty-of-the-gardens", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7433, "totalSubmissionRaw": 25113}, "2235": {"acRate": 87.9183563825139, "difficulty": "Easy", "likes": 1638, "dislikes": 3117, "categoryTitle": "Algorithms", "frontendQuestionId": "2235", "paidOnly": false, "title": "Add Two Integers", "titleSlug": "add-two-integers", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 543274, "totalSubmissionRaw": 617931}, "2236": {"acRate": 84.58477411768, "difficulty": "Easy", "likes": 1270, "dislikes": 1535, "categoryTitle": "Algorithms", "frontendQuestionId": "2236", "paidOnly": false, "title": "Root Equals Sum of Children", "titleSlug": "root-equals-sum-of-children", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 241673, "totalSubmissionRaw": 285718}, "2237": {"acRate": 63.581094332222, "difficulty": "Medium", "likes": 77, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "2237", "paidOnly": true, "title": "Count Positions on Street With Required Brightness", "titleSlug": "count-positions-on-street-with-required-brightness", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3242, "totalSubmissionRaw": 5099}, "2238": {"acRate": 71.47639182522903, "difficulty": "Medium", "likes": 67, "dislikes": 5, "categoryTitle": "Database", "frontendQuestionId": "2238", "paidOnly": true, "title": "Number of Times a Driver Was a Passenger", "titleSlug": "number-of-times-a-driver-was-a-passenger", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8114, "totalSubmissionRaw": 11352}, "2239": {"acRate": 45.704620217363846, "difficulty": "Easy", "likes": 583, "dislikes": 39, "categoryTitle": "Algorithms", "frontendQuestionId": "2239", "paidOnly": false, "title": "Find Closest Number to Zero", "titleSlug": "find-closest-number-to-zero", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 83223, "totalSubmissionRaw": 182090}, "2240": {"acRate": 57.23681564021079, "difficulty": "Medium", "likes": 447, "dislikes": 34, "categoryTitle": "Algorithms", "frontendQuestionId": "2240", "paidOnly": false, "title": "Number of Ways to Buy Pens and Pencils", "titleSlug": "number-of-ways-to-buy-pens-and-pencils", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28457, "totalSubmissionRaw": 49718}, "2241": {"acRate": 42.13014199696123, "difficulty": "Medium", "likes": 262, "dislikes": 347, "categoryTitle": "Algorithms", "frontendQuestionId": "2241", "paidOnly": false, "title": "Design an ATM Machine", "titleSlug": "design-an-atm-machine", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22460, "totalSubmissionRaw": 53311}, "2242": {"acRate": 38.73616901231859, "difficulty": "Hard", "likes": 520, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "2242", "paidOnly": false, "title": "Maximum Score of a Node Sequence", "titleSlug": "maximum-score-of-a-node-sequence", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12358, "totalSubmissionRaw": 31903}, "2243": {"acRate": 66.23526730481214, "difficulty": "Easy", "likes": 545, "dislikes": 45, "categoryTitle": "Algorithms", "frontendQuestionId": "2243", "paidOnly": false, "title": "Calculate Digit Sum of a String", "titleSlug": "calculate-digit-sum-of-a-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 40687, "totalSubmissionRaw": 61428}, "2244": {"acRate": 62.92104321208606, "difficulty": "Medium", "likes": 2772, "dislikes": 83, "categoryTitle": "Algorithms", "frontendQuestionId": "2244", "paidOnly": false, "title": "Minimum Rounds to Complete All Tasks", "titleSlug": "minimum-rounds-to-complete-all-tasks", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 152934, "totalSubmissionRaw": 243057}, "2245": {"acRate": 36.42407587979789, "difficulty": "Medium", "likes": 186, "dislikes": 401, "categoryTitle": "Algorithms", "frontendQuestionId": "2245", "paidOnly": false, "title": "Maximum Trailing Zeros in a Cornered Path", "titleSlug": "maximum-trailing-zeros-in-a-cornered-path", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8218, "totalSubmissionRaw": 22562}, "2246": {"acRate": 54.41789446261615, "difficulty": "Hard", "likes": 2377, "dislikes": 61, "categoryTitle": "Algorithms", "frontendQuestionId": "2246", "paidOnly": false, "title": "Longest Path With Different Adjacent Characters", "titleSlug": "longest-path-with-different-adjacent-characters", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 75200, "totalSubmissionRaw": 138189}, "2247": {"acRate": 49.98629010145325, "difficulty": "Hard", "likes": 59, "dislikes": 0, "categoryTitle": "Algorithms", "frontendQuestionId": "2247", "paidOnly": true, "title": "Maximum Cost of Trip With K Highways", "titleSlug": "maximum-cost-of-trip-with-k-highways", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1823, "totalSubmissionRaw": 3647}, "2248": {"acRate": 68.23946229570565, "difficulty": "Easy", "likes": 715, "dislikes": 41, "categoryTitle": "Algorithms", "frontendQuestionId": "2248", "paidOnly": false, "title": "Intersection of Multiple Arrays", "titleSlug": "intersection-of-multiple-arrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 86095, "totalSubmissionRaw": 126166}, "2249": {"acRate": 53.28769438810007, "difficulty": "Medium", "likes": 234, "dislikes": 220, "categoryTitle": "Algorithms", "frontendQuestionId": "2249", "paidOnly": false, "title": "Count Lattice Points Inside a Circle", "titleSlug": "count-lattice-points-inside-a-circle", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25207, "totalSubmissionRaw": 47315}, "2250": {"acRate": 35.218609634483045, "difficulty": "Medium", "likes": 505, "dislikes": 136, "categoryTitle": "Algorithms", "frontendQuestionId": "2250", "paidOnly": false, "title": "Count Number of Rectangles Containing Each Point", "titleSlug": "count-number-of-rectangles-containing-each-point", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17093, "totalSubmissionRaw": 48534}, "2251": {"acRate": 56.723435738931414, "difficulty": "Hard", "likes": 1653, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "2251", "paidOnly": false, "title": "Number of Flowers in Full Bloom", "titleSlug": "number-of-flowers-in-full-bloom", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 82035, "totalSubmissionRaw": 144622}, "2252": {"acRate": 55.652782639131956, "difficulty": "Hard", "likes": 30, "dislikes": 10, "categoryTitle": "Database", "frontendQuestionId": "2252", "paidOnly": true, "title": "Dynamic Pivoting of a Table", "titleSlug": "dynamic-pivoting-of-a-table", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1590, "totalSubmissionRaw": 2857}, "2253": {"acRate": 66.66666666666666, "difficulty": "Hard", "likes": 16, "dislikes": 13, "categoryTitle": "Database", "frontendQuestionId": "2253", "paidOnly": true, "title": "Dynamic Unpivoting of a Table", "titleSlug": "dynamic-unpivoting-of-a-table", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 958, "totalSubmissionRaw": 1437}, "2254": {"acRate": 64.08719346049047, "difficulty": "Hard", "likes": 81, "dislikes": 10, "categoryTitle": "Algorithms", "frontendQuestionId": "2254", "paidOnly": true, "title": "Design Video Sharing Platform", "titleSlug": "design-video-sharing-platform", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3528, "totalSubmissionRaw": 5505}, "2255": {"acRate": 72.6688865060105, "difficulty": "Easy", "likes": 539, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "2255", "paidOnly": false, "title": "Count Prefixes of a Given String", "titleSlug": "count-prefixes-of-a-given-string", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 64368, "totalSubmissionRaw": 88582}, "2256": {"acRate": 43.23879716391492, "difficulty": "Medium", "likes": 1508, "dislikes": 178, "categoryTitle": "Algorithms", "frontendQuestionId": "2256", "paidOnly": false, "title": "Minimum Average Difference", "titleSlug": "minimum-average-difference", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 86475, "totalSubmissionRaw": 199994}, "2257": {"acRate": 52.59465306753207, "difficulty": "Medium", "likes": 420, "dislikes": 37, "categoryTitle": "Algorithms", "frontendQuestionId": "2257", "paidOnly": false, "title": "Count Unguarded Cells in the Grid", "titleSlug": "count-unguarded-cells-in-the-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17017, "totalSubmissionRaw": 32355}, "2258": {"acRate": 35.17348240870146, "difficulty": "Hard", "likes": 732, "dislikes": 34, "categoryTitle": "Algorithms", "frontendQuestionId": "2258", "paidOnly": false, "title": "Escape the Spreading Fire", "titleSlug": "escape-the-spreading-fire", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11577, "totalSubmissionRaw": 32914}, "2259": {"acRate": 45.79002212400737, "difficulty": "Easy", "likes": 827, "dislikes": 54, "categoryTitle": "Algorithms", "frontendQuestionId": "2259", "paidOnly": false, "title": "Remove Digit From Number to Maximize Result", "titleSlug": "remove-digit-from-number-to-maximize-result", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 89205, "totalSubmissionRaw": 194812}, "2260": {"acRate": 51.51975885696075, "difficulty": "Medium", "likes": 957, "dislikes": 36, "categoryTitle": "Algorithms", "frontendQuestionId": "2260", "paidOnly": false, "title": "Minimum Consecutive Cards to Pick Up", "titleSlug": "minimum-consecutive-cards-to-pick-up", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 77570, "totalSubmissionRaw": 150587}, "2261": {"acRate": 52.09990667081463, "difficulty": "Medium", "likes": 668, "dislikes": 153, "categoryTitle": "Algorithms", "frontendQuestionId": "2261", "paidOnly": false, "title": "K Divisible Elements Subarrays", "titleSlug": "k-divisible-elements-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 35169, "totalSubmissionRaw": 67503}, "2262": {"acRate": 55.72310576674424, "difficulty": "Hard", "likes": 1112, "dislikes": 32, "categoryTitle": "Algorithms", "frontendQuestionId": "2262", "paidOnly": false, "title": "Total Appeal of A String", "titleSlug": "total-appeal-of-a-string", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34477, "totalSubmissionRaw": 61872}, "2263": {"acRate": 65.99746789654549, "difficulty": "Hard", "likes": 83, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "2263", "paidOnly": true, "title": "Make Array Non-decreasing or Non-increasing", "titleSlug": "make-array-non-decreasing-or-non-increasing", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3649, "totalSubmissionRaw": 5529}, "2264": {"acRate": 68.98736221398877, "difficulty": "Easy", "likes": 1000, "dislikes": 48, "categoryTitle": "Algorithms", "frontendQuestionId": "2264", "paidOnly": false, "title": "Largest 3-Same-Digit Number in String", "titleSlug": "largest-3-same-digit-number-in-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 149516, "totalSubmissionRaw": 216730}, "2265": {"acRate": 86.33413652792616, "difficulty": "Medium", "likes": 2194, "dislikes": 54, "categoryTitle": "Algorithms", "frontendQuestionId": "2265", "paidOnly": false, "title": "Count Nodes Equal to Average of Subtree", "titleSlug": "count-nodes-equal-to-average-of-subtree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 151912, "totalSubmissionRaw": 175959}, "2266": {"acRate": 47.864313067911446, "difficulty": "Medium", "likes": 872, "dislikes": 30, "categoryTitle": "Algorithms", "frontendQuestionId": "2266", "paidOnly": false, "title": "Count Number of Texts", "titleSlug": "count-number-of-texts", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21123, "totalSubmissionRaw": 44131}, "2267": {"acRate": 38.95774990868136, "difficulty": "Hard", "likes": 515, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "2267", "paidOnly": false, "title": " Check if There Is a Valid Parentheses String Path", "titleSlug": "check-if-there-is-a-valid-parentheses-string-path", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15998, "totalSubmissionRaw": 41065}, "2268": {"acRate": 71.29557430117436, "difficulty": "Medium", "likes": 244, "dislikes": 37, "categoryTitle": "Algorithms", "frontendQuestionId": "2268", "paidOnly": true, "title": "Minimum Number of Keypresses", "titleSlug": "minimum-number-of-keypresses", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30171, "totalSubmissionRaw": 42317}, "2269": {"acRate": 60.23204291044776, "difficulty": "Easy", "likes": 657, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "2269", "paidOnly": false, "title": "Find the K-Beauty of a Number", "titleSlug": "find-the-k-beauty-of-a-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 61986, "totalSubmissionRaw": 102912}, "2270": {"acRate": 48.061981086000976, "difficulty": "Medium", "likes": 567, "dislikes": 52, "categoryTitle": "Algorithms", "frontendQuestionId": "2270", "paidOnly": false, "title": "Number of Ways to Split Array", "titleSlug": "number-of-ways-to-split-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 43291, "totalSubmissionRaw": 90083}, "2271": {"acRate": 33.86019948519948, "difficulty": "Medium", "likes": 774, "dislikes": 49, "categoryTitle": "Algorithms", "frontendQuestionId": "2271", "paidOnly": false, "title": "Maximum White Tiles Covered by a Carpet", "titleSlug": "maximum-white-tiles-covered-by-a-carpet", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16834, "totalSubmissionRaw": 49724}, "2272": {"acRate": 46.23567976296614, "difficulty": "Hard", "likes": 1850, "dislikes": 205, "categoryTitle": "Algorithms", "frontendQuestionId": "2272", "paidOnly": false, "title": "Substring With Largest Variance", "titleSlug": "substring-with-largest-variance", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 68973, "totalSubmissionRaw": 149177}, "2273": {"acRate": 58.430031613194586, "difficulty": "Easy", "likes": 673, "dislikes": 185, "categoryTitle": "Algorithms", "frontendQuestionId": "2273", "paidOnly": false, "title": "Find Resultant Array After Removing Anagrams", "titleSlug": "find-resultant-array-after-removing-anagrams", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 63396, "totalSubmissionRaw": 108499}, "2274": {"acRate": 51.803149606299215, "difficulty": "Medium", "likes": 406, "dislikes": 35, "categoryTitle": "Algorithms", "frontendQuestionId": "2274", "paidOnly": false, "title": "Maximum Consecutive Floors Without Special Floors", "titleSlug": "maximum-consecutive-floors-without-special-floors", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 32895, "totalSubmissionRaw": 63500}, "2275": {"acRate": 72.97283311772316, "difficulty": "Medium", "likes": 563, "dislikes": 18, "categoryTitle": "Algorithms", "frontendQuestionId": "2275", "paidOnly": false, "title": "Largest Combination With Bitwise AND Greater Than Zero", "titleSlug": "largest-combination-with-bitwise-and-greater-than-zero", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28204, "totalSubmissionRaw": 38650}, "2276": {"acRate": 35.32045106817023, "difficulty": "Hard", "likes": 575, "dislikes": 59, "categoryTitle": "Algorithms", "frontendQuestionId": "2276", "paidOnly": false, "title": "Count Integers in Intervals", "titleSlug": "count-integers-in-intervals", "topicTags": [{"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18699, "totalSubmissionRaw": 52941}, "2277": {"acRate": 62.53738783649053, "difficulty": "Hard", "likes": 134, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "2277", "paidOnly": true, "title": "Closest Node to Path in Tree", "titleSlug": "closest-node-to-path-in-tree", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5018, "totalSubmissionRaw": 8024}, "2278": {"acRate": 74.12912305052724, "difficulty": "Easy", "likes": 520, "dislikes": 60, "categoryTitle": "Algorithms", "frontendQuestionId": "2278", "paidOnly": false, "title": "Percentage of Letter in String", "titleSlug": "percentage-of-letter-in-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 76906, "totalSubmissionRaw": 103746}, "2279": {"acRate": 67.4985303585925, "difficulty": "Medium", "likes": 1670, "dislikes": 70, "categoryTitle": "Algorithms", "frontendQuestionId": "2279", "paidOnly": false, "title": "Maximum Bags With Full Capacity of Rocks", "titleSlug": "maximum-bags-with-full-capacity-of-rocks", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 96449, "totalSubmissionRaw": 142891}, "2280": {"acRate": 25.38775819020958, "difficulty": "Medium", "likes": 341, "dislikes": 523, "categoryTitle": "Algorithms", "frontendQuestionId": "2280", "paidOnly": false, "title": "Minimum Lines to Represent a Line Chart", "titleSlug": "minimum-lines-to-represent-a-line-chart", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26844, "totalSubmissionRaw": 105736}, "2281": {"acRate": 27.90694452142105, "difficulty": "Hard", "likes": 1182, "dislikes": 101, "categoryTitle": "Algorithms", "frontendQuestionId": "2281", "paidOnly": false, "title": "Sum of Total Strength of Wizards", "titleSlug": "sum-of-total-strength-of-wizards", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 20139, "totalSubmissionRaw": 72169}, "2282": {"acRate": 48.28660436137071, "difficulty": "Medium", "likes": 63, "dislikes": 28, "categoryTitle": "Algorithms", "frontendQuestionId": "2282", "paidOnly": true, "title": "Number of People That Can Be Seen in a Grid", "titleSlug": "number-of-people-that-can-be-seen-in-a-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1860, "totalSubmissionRaw": 3852}, "2283": {"acRate": 72.38072201729454, "difficulty": "Easy", "likes": 599, "dislikes": 78, "categoryTitle": "Algorithms", "frontendQuestionId": "2283", "paidOnly": false, "title": "Check if Number Has Equal Digit Count and Digit Value", "titleSlug": "check-if-number-has-equal-digit-count-and-digit-value", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 59849, "totalSubmissionRaw": 82686}, "2284": {"acRate": 57.093675202465654, "difficulty": "Medium", "likes": 432, "dislikes": 40, "categoryTitle": "Algorithms", "frontendQuestionId": "2284", "paidOnly": false, "title": "Sender With Largest Word Count", "titleSlug": "sender-with-largest-word-count", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34823, "totalSubmissionRaw": 60995}, "2285": {"acRate": 69.34205725682874, "difficulty": "Medium", "likes": 1263, "dislikes": 76, "categoryTitle": "Algorithms", "frontendQuestionId": "2285", "paidOnly": false, "title": "Maximum Total Importance of Roads", "titleSlug": "maximum-total-importance-of-roads", "topicTags": [{"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 142541, "totalSubmissionRaw": 205563}, "2286": {"acRate": 17.974945698843257, "difficulty": "Hard", "likes": 331, "dislikes": 56, "categoryTitle": "Algorithms", "frontendQuestionId": "2286", "paidOnly": false, "title": "Booking Concert Tickets in Groups", "titleSlug": "booking-concert-tickets-in-groups", "topicTags": [{"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7117, "totalSubmissionRaw": 39594}, "2287": {"acRate": 59.33523320448069, "difficulty": "Easy", "likes": 473, "dislikes": 35, "categoryTitle": "Algorithms", "frontendQuestionId": "2287", "paidOnly": false, "title": "Rearrange Characters to Make Target String", "titleSlug": "rearrange-characters-to-make-target-string", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 42058, "totalSubmissionRaw": 70882}, "2288": {"acRate": 31.190671289000942, "difficulty": "Medium", "likes": 199, "dislikes": 1102, "categoryTitle": "Algorithms", "frontendQuestionId": "2288", "paidOnly": false, "title": "Apply Discount to Prices", "titleSlug": "apply-discount-to-prices", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24742, "totalSubmissionRaw": 79325}, "2289": {"acRate": 22.10032279145296, "difficulty": "Medium", "likes": 1334, "dislikes": 135, "categoryTitle": "Algorithms", "frontendQuestionId": "2289", "paidOnly": false, "title": "Steps to Make Array Non-decreasing", "titleSlug": "steps-to-make-array-non-decreasing", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22320, "totalSubmissionRaw": 100994}, "2290": {"acRate": 54.66943137411276, "difficulty": "Hard", "likes": 952, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2290", "paidOnly": false, "title": "Minimum Obstacle Removal to Reach Corner", "titleSlug": "minimum-obstacle-removal-to-reach-corner", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27420, "totalSubmissionRaw": 50156}, "2291": {"acRate": 45.436202920830134, "difficulty": "Medium", "likes": 158, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "2291", "paidOnly": true, "title": "Maximum Profit From Trading Stocks", "titleSlug": "maximum-profit-from-trading-stocks", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9458, "totalSubmissionRaw": 20816}, "2292": {"acRate": 39.38504997827032, "difficulty": "Medium", "likes": 60, "dislikes": 26, "categoryTitle": "Database", "frontendQuestionId": "2292", "paidOnly": true, "title": "Products With Three or More Orders in Two Consecutive Years", "titleSlug": "products-with-three-or-more-orders-in-two-consecutive-years", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7250, "totalSubmissionRaw": 18408}, "2293": {"acRate": 63.18098023011888, "difficulty": "Easy", "likes": 534, "dislikes": 27, "categoryTitle": "Algorithms", "frontendQuestionId": "2293", "paidOnly": false, "title": "Min Max Game", "titleSlug": "min-max-game", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 49696, "totalSubmissionRaw": 78656}, "2294": {"acRate": 74.01489870900328, "difficulty": "Medium", "likes": 767, "dislikes": 29, "categoryTitle": "Algorithms", "frontendQuestionId": "2294", "paidOnly": false, "title": "Partition Array Such That Maximum Difference Is K", "titleSlug": "partition-array-such-that-maximum-difference-is-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 43916, "totalSubmissionRaw": 59334}, "2295": {"acRate": 57.9392669492198, "difficulty": "Medium", "likes": 633, "dislikes": 36, "categoryTitle": "Algorithms", "frontendQuestionId": "2295", "paidOnly": false, "title": "Replace Elements in an Array", "titleSlug": "replace-elements-in-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 36500, "totalSubmissionRaw": 62997}, "2296": {"acRate": 45.317939609236234, "difficulty": "Hard", "likes": 572, "dislikes": 224, "categoryTitle": "Algorithms", "frontendQuestionId": "2296", "paidOnly": false, "title": "Design a Text Editor", "titleSlug": "design-a-text-editor", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}, {"name": "Doubly-Linked List", "id": "VG9waWNUYWdOb2RlOjYxMDU4", "slug": "doubly-linked-list"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25514, "totalSubmissionRaw": 56300}, "2297": {"acRate": 45.59742811216289, "difficulty": "Medium", "likes": 146, "dislikes": 41, "categoryTitle": "Algorithms", "frontendQuestionId": "2297", "paidOnly": true, "title": "Jump Game VIII", "titleSlug": "jump-game-viii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5106, "totalSubmissionRaw": 11198}, "2298": {"acRate": 81.45661811272957, "difficulty": "Medium", "likes": 48, "dislikes": 10, "categoryTitle": "Database", "frontendQuestionId": "2298", "paidOnly": true, "title": "Tasks Count in the Weekend", "titleSlug": "tasks-count-in-the-weekend", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6431, "totalSubmissionRaw": 7895}, "2299": {"acRate": 54.87956232111648, "difficulty": "Easy", "likes": 348, "dislikes": 41, "categoryTitle": "Algorithms", "frontendQuestionId": "2299", "paidOnly": false, "title": "Strong Password Checker II", "titleSlug": "strong-password-checker-ii", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 43333, "totalSubmissionRaw": 78961}, "2300": {"acRate": 43.5162794095013, "difficulty": "Medium", "likes": 2576, "dislikes": 78, "categoryTitle": "Algorithms", "frontendQuestionId": "2300", "paidOnly": false, "title": "Successful Pairs of Spells and Potions", "titleSlug": "successful-pairs-of-spells-and-potions", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 166813, "totalSubmissionRaw": 383334}, "2301": {"acRate": 41.09677965623324, "difficulty": "Hard", "likes": 380, "dislikes": 76, "categoryTitle": "Algorithms", "frontendQuestionId": "2301", "paidOnly": false, "title": "Match Substring After Replacement", "titleSlug": "match-substring-after-replacement", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14561, "totalSubmissionRaw": 35431}, "2302": {"acRate": 54.92619473370499, "difficulty": "Hard", "likes": 1039, "dislikes": 26, "categoryTitle": "Algorithms", "frontendQuestionId": "2302", "paidOnly": false, "title": "Count Subarrays With Score Less Than K", "titleSlug": "count-subarrays-with-score-less-than-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 31331, "totalSubmissionRaw": 57042}, "2303": {"acRate": 65.845728006403, "difficulty": "Easy", "likes": 264, "dislikes": 278, "categoryTitle": "Algorithms", "frontendQuestionId": "2303", "paidOnly": false, "title": "Calculate Amount Paid in Taxes", "titleSlug": "calculate-amount-paid-in-taxes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 39489, "totalSubmissionRaw": 59972}, "2304": {"acRate": 66.86940361547559, "difficulty": "Medium", "likes": 886, "dislikes": 153, "categoryTitle": "Algorithms", "frontendQuestionId": "2304", "paidOnly": false, "title": "Minimum Path Cost in a Grid", "titleSlug": "minimum-path-cost-in-a-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 31664, "totalSubmissionRaw": 47352}, "2305": {"acRate": 69.23971333338031, "difficulty": "Medium", "likes": 2566, "dislikes": 117, "categoryTitle": "Algorithms", "frontendQuestionId": "2305", "paidOnly": false, "title": "Fair Distribution of Cookies", "titleSlug": "fair-distribution-of-cookies", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 98256, "totalSubmissionRaw": 141907}, "2306": {"acRate": 46.41593390739138, "difficulty": "Hard", "likes": 1944, "dislikes": 71, "categoryTitle": "Algorithms", "frontendQuestionId": "2306", "paidOnly": false, "title": "Naming a Company", "titleSlug": "naming-a-company", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 61127, "totalSubmissionRaw": 131694}, "2307": {"acRate": 43.365939302733885, "difficulty": "Hard", "likes": 60, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "2307", "paidOnly": true, "title": "Check for Contradictions in Equations", "titleSlug": "check-for-contradictions-in-equations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3458, "totalSubmissionRaw": 7974}, "2308": {"acRate": 69.27029804727647, "difficulty": "Medium", "likes": 79, "dislikes": 15, "categoryTitle": "Database", "frontendQuestionId": "2308", "paidOnly": true, "title": "Arrange Table by Gender", "titleSlug": "arrange-table-by-gender", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6066, "totalSubmissionRaw": 8757}, "2309": {"acRate": 70.11994134529822, "difficulty": "Easy", "likes": 481, "dislikes": 30, "categoryTitle": "Algorithms", "frontendQuestionId": "2309", "paidOnly": false, "title": "Greatest English Letter in Upper and Lower Case", "titleSlug": "greatest-english-letter-in-upper-and-lower-case", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 55948, "totalSubmissionRaw": 79789}, "2310": {"acRate": 26.845523919583975, "difficulty": "Medium", "likes": 405, "dislikes": 326, "categoryTitle": "Algorithms", "frontendQuestionId": "2310", "paidOnly": false, "title": "Sum of Numbers With Units Digit K", "titleSlug": "sum-of-numbers-with-units-digit-k", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26947, "totalSubmissionRaw": 100378}, "2311": {"acRate": 38.0333389459505, "difficulty": "Medium", "likes": 685, "dislikes": 50, "categoryTitle": "Algorithms", "frontendQuestionId": "2311", "paidOnly": false, "title": "Longest Binary Subsequence Less Than or Equal to K", "titleSlug": "longest-binary-subsequence-less-than-or-equal-to-k", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22588, "totalSubmissionRaw": 59390}, "2312": {"acRate": 50.110038176510216, "difficulty": "Hard", "likes": 546, "dislikes": 10, "categoryTitle": "Algorithms", "frontendQuestionId": "2312", "paidOnly": false, "title": "Selling Pieces of Wood", "titleSlug": "selling-pieces-of-wood", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11157, "totalSubmissionRaw": 22265}, "2313": {"acRate": 58.611391978429396, "difficulty": "Hard", "likes": 100, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "2313", "paidOnly": true, "title": "Minimum Flips in Binary Tree to Get Result", "titleSlug": "minimum-flips-in-binary-tree-to-get-result", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3478, "totalSubmissionRaw": 5934}, "2314": {"acRate": 71.89235896802863, "difficulty": "Medium", "likes": 52, "dislikes": 2, "categoryTitle": "Database", "frontendQuestionId": "2314", "paidOnly": true, "title": "The First Day of the Maximum Recorded Degree in Each City", "titleSlug": "the-first-day-of-the-maximum-recorded-degree-in-each-city", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5824, "totalSubmissionRaw": 8101}, "2315": {"acRate": 82.44099782841144, "difficulty": "Easy", "likes": 627, "dislikes": 104, "categoryTitle": "Algorithms", "frontendQuestionId": "2315", "paidOnly": false, "title": "Count Asterisks", "titleSlug": "count-asterisks", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 74788, "totalSubmissionRaw": 90717}, "2316": {"acRate": 49.21867995675447, "difficulty": "Medium", "likes": 2045, "dislikes": 49, "categoryTitle": "Algorithms", "frontendQuestionId": "2316", "paidOnly": false, "title": "Count Unreachable Pairs of Nodes in an Undirected Graph", "titleSlug": "count-unreachable-pairs-of-nodes-in-an-undirected-graph", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 93326, "totalSubmissionRaw": 189615}, "2317": {"acRate": 79.61603440331746, "difficulty": "Medium", "likes": 611, "dislikes": 168, "categoryTitle": "Algorithms", "frontendQuestionId": "2317", "paidOnly": false, "title": "Maximum XOR After Operations ", "titleSlug": "maximum-xor-after-operations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25919, "totalSubmissionRaw": 32555}, "2318": {"acRate": 57.317763259426926, "difficulty": "Hard", "likes": 438, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "2318", "paidOnly": false, "title": "Number of Distinct Roll Sequences", "titleSlug": "number-of-distinct-roll-sequences", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11142, "totalSubmissionRaw": 19439}, "2319": {"acRate": 65.22701304949186, "difficulty": "Easy", "likes": 492, "dislikes": 23, "categoryTitle": "Algorithms", "frontendQuestionId": "2319", "paidOnly": false, "title": "Check if Matrix Is X-Matrix", "titleSlug": "check-if-matrix-is-x-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 54233, "totalSubmissionRaw": 83145}, "2320": {"acRate": 42.00925592018272, "difficulty": "Medium", "likes": 581, "dislikes": 193, "categoryTitle": "Algorithms", "frontendQuestionId": "2320", "paidOnly": false, "title": "Count Number of Ways to Place Houses", "titleSlug": "count-number-of-ways-to-place-houses", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27958, "totalSubmissionRaw": 66552}, "2321": {"acRate": 56.90452496634081, "difficulty": "Hard", "likes": 788, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "2321", "paidOnly": false, "title": "Maximum Score Of Spliced Array", "titleSlug": "maximum-score-of-spliced-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19442, "totalSubmissionRaw": 34166}, "2322": {"acRate": 52.493896058597834, "difficulty": "Hard", "likes": 453, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "2322", "paidOnly": false, "title": "Minimum Score After Removals on a Tree", "titleSlug": "minimum-score-after-removals-on-a-tree", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7525, "totalSubmissionRaw": 14335}, "2323": {"acRate": 65.86504786364698, "difficulty": "Medium", "likes": 63, "dislikes": 18, "categoryTitle": "Algorithms", "frontendQuestionId": "2323", "paidOnly": true, "title": "Find Minimum Time to Finish All Jobs II", "titleSlug": "find-minimum-time-to-finish-all-jobs-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8463, "totalSubmissionRaw": 12849}, "2324": {"acRate": 74.4780033019326, "difficulty": "Medium", "likes": 49, "dislikes": 1, "categoryTitle": "Database", "frontendQuestionId": "2324", "paidOnly": true, "title": "Product Sales Analysis IV", "titleSlug": "product-sales-analysis-iv", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7669, "totalSubmissionRaw": 10297}, "2325": {"acRate": 84.57992438328995, "difficulty": "Easy", "likes": 995, "dislikes": 101, "categoryTitle": "Algorithms", "frontendQuestionId": "2325", "paidOnly": false, "title": "Decode the Message", "titleSlug": "decode-the-message", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 109169, "totalSubmissionRaw": 129072}, "2326": {"acRate": 75.75348403013936, "difficulty": "Medium", "likes": 768, "dislikes": 27, "categoryTitle": "Algorithms", "frontendQuestionId": "2326", "paidOnly": false, "title": "Spiral Matrix IV", "titleSlug": "spiral-matrix-iv", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 45443, "totalSubmissionRaw": 59989}, "2327": {"acRate": 46.019063899366394, "difficulty": "Medium", "likes": 849, "dislikes": 117, "categoryTitle": "Algorithms", "frontendQuestionId": "2327", "paidOnly": false, "title": "Number of People Aware of a Secret", "titleSlug": "number-of-people-aware-of-a-secret", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24767, "totalSubmissionRaw": 53819}, "2328": {"acRate": 58.225547205695484, "difficulty": "Hard", "likes": 1979, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "2328", "paidOnly": false, "title": "Number of Increasing Paths in a Grid", "titleSlug": "number-of-increasing-paths-in-a-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 69190, "totalSubmissionRaw": 118831}, "2329": {"acRate": 69.79553903345726, "difficulty": "Easy", "likes": 32, "dislikes": 7, "categoryTitle": "Database", "frontendQuestionId": "2329", "paidOnly": true, "title": "Product Sales Analysis V", "titleSlug": "product-sales-analysis-v", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7510, "totalSubmissionRaw": 10760}, "2330": {"acRate": 76.07898782074022, "difficulty": "Medium", "likes": 102, "dislikes": 33, "categoryTitle": "Algorithms", "frontendQuestionId": "2330", "paidOnly": true, "title": "Valid Palindrome IV", "titleSlug": "valid-palindrome-iv", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12866, "totalSubmissionRaw": 16912}, "2331": {"acRate": 82.79187487831786, "difficulty": "Easy", "likes": 1433, "dislikes": 38, "categoryTitle": "Algorithms", "frontendQuestionId": "2331", "paidOnly": false, "title": "Evaluate Boolean Binary Tree", "titleSlug": "evaluate-boolean-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 191361, "totalSubmissionRaw": 231135}, "2332": {"acRate": 27.48042346559342, "difficulty": "Medium", "likes": 461, "dislikes": 743, "categoryTitle": "Algorithms", "frontendQuestionId": "2332", "paidOnly": false, "title": "The Latest Time to Catch a Bus", "titleSlug": "the-latest-time-to-catch-a-bus", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25127, "totalSubmissionRaw": 91436}, "2333": {"acRate": 25.54889870919285, "difficulty": "Medium", "likes": 627, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "2333", "paidOnly": false, "title": "Minimum Sum of Squared Difference", "titleSlug": "minimum-sum-of-squared-difference", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14627, "totalSubmissionRaw": 57251}, "2334": {"acRate": 43.14352253527559, "difficulty": "Hard", "likes": 548, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "2334", "paidOnly": false, "title": "Subarray With Elements Greater Than Varying Threshold", "titleSlug": "subarray-with-elements-greater-than-varying-threshold", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9448, "totalSubmissionRaw": 21899}, "2335": {"acRate": 57.945145842403136, "difficulty": "Easy", "likes": 692, "dislikes": 81, "categoryTitle": "Algorithms", "frontendQuestionId": "2335", "paidOnly": false, "title": "Minimum Amount of Time to Fill Cups", "titleSlug": "minimum-amount-of-time-to-fill-cups", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 49247, "totalSubmissionRaw": 84989}, "2336": {"acRate": 71.61289704586382, "difficulty": "Medium", "likes": 1673, "dislikes": 195, "categoryTitle": "Algorithms", "frontendQuestionId": "2336", "paidOnly": false, "title": "Smallest Number in Infinite Set", "titleSlug": "smallest-number-in-infinite-set", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 149521, "totalSubmissionRaw": 208790}, "2337": {"acRate": 47.679563040509784, "difficulty": "Medium", "likes": 656, "dislikes": 45, "categoryTitle": "Algorithms", "frontendQuestionId": "2337", "paidOnly": false, "title": "Move Pieces to Obtain a String", "titleSlug": "move-pieces-to-obtain-a-string", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26188, "totalSubmissionRaw": 54925}, "2338": {"acRate": 26.931875953228268, "difficulty": "Hard", "likes": 483, "dislikes": 28, "categoryTitle": "Algorithms", "frontendQuestionId": "2338", "paidOnly": false, "title": "Count the Number of Ideal Arrays", "titleSlug": "count-the-number-of-ideal-arrays", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6357, "totalSubmissionRaw": 23604}, "2339": {"acRate": 87.73675762439808, "difficulty": "Easy", "likes": 42, "dislikes": 4, "categoryTitle": "Database", "frontendQuestionId": "2339", "paidOnly": true, "title": "All the Matches of the League", "titleSlug": "all-the-matches-of-the-league", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8199, "totalSubmissionRaw": 9345}, "2340": {"acRate": 72.49727223131478, "difficulty": "Medium", "likes": 176, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "2340", "paidOnly": true, "title": "Minimum Adjacent Swaps to Make a Valid Array", "titleSlug": "minimum-adjacent-swaps-to-make-a-valid-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 31893, "totalSubmissionRaw": 43992}, "2341": {"acRate": 75.34728809629208, "difficulty": "Easy", "likes": 677, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "2341", "paidOnly": false, "title": "Maximum Number of Pairs in Array", "titleSlug": "maximum-number-of-pairs-in-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 71488, "totalSubmissionRaw": 94878}, "2342": {"acRate": 55.17176187987233, "difficulty": "Medium", "likes": 700, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "2342", "paidOnly": false, "title": "Max Sum of a Pair With Equal Sum of Digits", "titleSlug": "max-sum-of-a-pair-with-equal-sum-of-digits", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 49611, "totalSubmissionRaw": 89921}, "2343": {"acRate": 44.29367191704117, "difficulty": "Medium", "likes": 311, "dislikes": 430, "categoryTitle": "Algorithms", "frontendQuestionId": "2343", "paidOnly": false, "title": "Query Kth Smallest Trimmed Number", "titleSlug": "query-kth-smallest-trimmed-number", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Radix Sort", "id": "VG9waWNUYWdOb2RlOjYxMDYx", "slug": "radix-sort"}, {"name": "Quickselect", "id": "VG9waWNUYWdOb2RlOjYxMDY5", "slug": "quickselect"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30455, "totalSubmissionRaw": 68757}, "2344": {"acRate": 56.30450617162431, "difficulty": "Hard", "likes": 546, "dislikes": 127, "categoryTitle": "Algorithms", "frontendQuestionId": "2344", "paidOnly": false, "title": "Minimum Deletions to Make Array Divisible", "titleSlug": "minimum-deletions-to-make-array-divisible", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28601, "totalSubmissionRaw": 50797}, "2345": {"acRate": 37.707513263734384, "difficulty": "Medium", "likes": 156, "dislikes": 71, "categoryTitle": "Algorithms", "frontendQuestionId": "2345", "paidOnly": true, "title": "Finding the Number of Visible Mountains", "titleSlug": "finding-the-number-of-visible-mountains", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8813, "totalSubmissionRaw": 23372}, "2346": {"acRate": 33.59316749135769, "difficulty": "Medium", "likes": 26, "dislikes": 74, "categoryTitle": "Database", "frontendQuestionId": "2346", "paidOnly": true, "title": "Compute the Rank as a Percentage", "titleSlug": "compute-the-rank-as-a-percentage", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4956, "totalSubmissionRaw": 14753}, "2347": {"acRate": 60.73331423660843, "difficulty": "Easy", "likes": 371, "dislikes": 37, "categoryTitle": "Algorithms", "frontendQuestionId": "2347", "paidOnly": false, "title": "Best Poker Hand", "titleSlug": "best-poker-hand", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 42404, "totalSubmissionRaw": 69820}, "2348": {"acRate": 66.75915591392241, "difficulty": "Medium", "likes": 2259, "dislikes": 83, "categoryTitle": "Algorithms", "frontendQuestionId": "2348", "paidOnly": false, "title": "Number of Zero-Filled Subarrays", "titleSlug": "number-of-zero-filled-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 128000, "totalSubmissionRaw": 191734}, "2349": {"acRate": 44.8348599445099, "difficulty": "Medium", "likes": 398, "dislikes": 31, "categoryTitle": "Algorithms", "frontendQuestionId": "2349", "paidOnly": false, "title": "Design a Number Container System", "titleSlug": "design-a-number-container-system", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23593, "totalSubmissionRaw": 52622}, "2350": {"acRate": 68.61307341500492, "difficulty": "Hard", "likes": 641, "dislikes": 51, "categoryTitle": "Algorithms", "frontendQuestionId": "2350", "paidOnly": false, "title": "Shortest Impossible Sequence of Rolls", "titleSlug": "shortest-impossible-sequence-of-rolls", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15346, "totalSubmissionRaw": 22366}, "2351": {"acRate": 73.64423896419274, "difficulty": "Easy", "likes": 1034, "dislikes": 60, "categoryTitle": "Algorithms", "frontendQuestionId": "2351", "paidOnly": false, "title": "First Letter to Appear Twice", "titleSlug": "first-letter-to-appear-twice", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 126157, "totalSubmissionRaw": 171306}, "2352": {"acRate": 70.43044421558123, "difficulty": "Medium", "likes": 2216, "dislikes": 156, "categoryTitle": "Algorithms", "frontendQuestionId": "2352", "paidOnly": false, "title": "Equal Row and Column Pairs", "titleSlug": "equal-row-and-column-pairs", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 237296, "totalSubmissionRaw": 336924}, "2353": {"acRate": 45.24082905649696, "difficulty": "Medium", "likes": 1489, "dislikes": 293, "categoryTitle": "Algorithms", "frontendQuestionId": "2353", "paidOnly": false, "title": "Design a Food Rating System", "titleSlug": "design-a-food-rating-system", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 84713, "totalSubmissionRaw": 187249}, "2354": {"acRate": 47.587193926760214, "difficulty": "Hard", "likes": 590, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "2354", "paidOnly": false, "title": "Number of Excellent Pairs", "titleSlug": "number-of-excellent-pairs", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15295, "totalSubmissionRaw": 32141}, "2355": {"acRate": 40.205706939037896, "difficulty": "Hard", "likes": 284, "dislikes": 33, "categoryTitle": "Algorithms", "frontendQuestionId": "2355", "paidOnly": true, "title": "Maximum Number of Books You Can Take", "titleSlug": "maximum-number-of-books-you-can-take", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 11258, "totalSubmissionRaw": 28001}, "2356": {"acRate": 88.56208300840481, "difficulty": "Easy", "likes": 465, "dislikes": 36, "categoryTitle": "Database", "frontendQuestionId": "2356", "paidOnly": false, "title": "Number of Unique Subjects Taught by Each Teacher", "titleSlug": "number-of-unique-subjects-taught-by-each-teacher", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 204417, "totalSubmissionRaw": 230818}, "2357": {"acRate": 72.46100487321489, "difficulty": "Easy", "likes": 1174, "dislikes": 54, "categoryTitle": "Algorithms", "frontendQuestionId": "2357", "paidOnly": false, "title": "Make Array Zero by Subtracting Equal Amounts", "titleSlug": "make-array-zero-by-subtracting-equal-amounts", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 115532, "totalSubmissionRaw": 159441}, "2358": {"acRate": 68.09733496029851, "difficulty": "Medium", "likes": 669, "dislikes": 115, "categoryTitle": "Algorithms", "frontendQuestionId": "2358", "paidOnly": false, "title": "Maximum Number of Groups Entering a Competition", "titleSlug": "maximum-number-of-groups-entering-a-competition", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 38506, "totalSubmissionRaw": 56545}, "2359": {"acRate": 45.51369169823324, "difficulty": "Medium", "likes": 1684, "dislikes": 403, "categoryTitle": "Algorithms", "frontendQuestionId": "2359", "paidOnly": false, "title": "Find Closest Node to Given Two Nodes", "titleSlug": "find-closest-node-to-given-two-nodes", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 78700, "totalSubmissionRaw": 172915}, "2360": {"acRate": 49.828414106880885, "difficulty": "Hard", "likes": 2332, "dislikes": 46, "categoryTitle": "Algorithms", "frontendQuestionId": "2360", "paidOnly": false, "title": "Longest Cycle in a Graph", "titleSlug": "longest-cycle-in-a-graph", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 77101, "totalSubmissionRaw": 154733}, "2361": {"acRate": 78.63783631497394, "difficulty": "Hard", "likes": 183, "dislikes": 31, "categoryTitle": "Algorithms", "frontendQuestionId": "2361", "paidOnly": true, "title": "Minimum Costs Using the Train Line", "titleSlug": "minimum-costs-using-the-train-line", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 11163, "totalSubmissionRaw": 14196}, "2362": {"acRate": 74.56844640706544, "difficulty": "Hard", "likes": 32, "dislikes": 28, "categoryTitle": "Database", "frontendQuestionId": "2362", "paidOnly": true, "title": "Generate the Invoice", "titleSlug": "generate-the-invoice", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3715, "totalSubmissionRaw": 4982}, "2363": {"acRate": 75.67519432111644, "difficulty": "Easy", "likes": 557, "dislikes": 27, "categoryTitle": "Algorithms", "frontendQuestionId": "2363", "paidOnly": false, "title": "Merge Similar Items", "titleSlug": "merge-similar-items", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 59486, "totalSubmissionRaw": 78607}, "2364": {"acRate": 41.784620059251004, "difficulty": "Medium", "likes": 985, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "2364", "paidOnly": false, "title": "Count Number of Bad Pairs", "titleSlug": "count-number-of-bad-pairs", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33004, "totalSubmissionRaw": 78986}, "2365": {"acRate": 52.66183837791826, "difficulty": "Medium", "likes": 556, "dislikes": 60, "categoryTitle": "Algorithms", "frontendQuestionId": "2365", "paidOnly": false, "title": "Task Scheduler II", "titleSlug": "task-scheduler-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 37738, "totalSubmissionRaw": 71661}, "2366": {"acRate": 53.55953638779496, "difficulty": "Hard", "likes": 1998, "dislikes": 67, "categoryTitle": "Algorithms", "frontendQuestionId": "2366", "paidOnly": false, "title": "Minimum Replacements to Sort the Array", "titleSlug": "minimum-replacements-to-sort-the-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 66913, "totalSubmissionRaw": 124932}, "2367": {"acRate": 84.40764044381622, "difficulty": "Easy", "likes": 1261, "dislikes": 80, "categoryTitle": "Algorithms", "frontendQuestionId": "2367", "paidOnly": false, "title": "Number of Arithmetic Triplets", "titleSlug": "number-of-arithmetic-triplets", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 134956, "totalSubmissionRaw": 159886}, "2368": {"acRate": 58.98106014020416, "difficulty": "Medium", "likes": 705, "dislikes": 31, "categoryTitle": "Algorithms", "frontendQuestionId": "2368", "paidOnly": false, "title": "Reachable Nodes With Restrictions", "titleSlug": "reachable-nodes-with-restrictions", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 57549, "totalSubmissionRaw": 97572}, "2369": {"acRate": 51.859741684710606, "difficulty": "Medium", "likes": 1991, "dislikes": 197, "categoryTitle": "Algorithms", "frontendQuestionId": "2369", "paidOnly": false, "title": "Check if There is a Valid Partition For The Array", "titleSlug": "check-if-there-is-a-valid-partition-for-the-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 88857, "totalSubmissionRaw": 171341}, "2370": {"acRate": 47.33311052520827, "difficulty": "Medium", "likes": 1452, "dislikes": 79, "categoryTitle": "Algorithms", "frontendQuestionId": "2370", "paidOnly": false, "title": "Longest Ideal Subsequence", "titleSlug": "longest-ideal-subsequence", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 114717, "totalSubmissionRaw": 242361}, "2371": {"acRate": 66.3215859030837, "difficulty": "Hard", "likes": 99, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "2371", "paidOnly": true, "title": "Minimize Maximum Value in a Grid", "titleSlug": "minimize-maximum-value-in-a-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3011, "totalSubmissionRaw": 4540}, "2372": {"acRate": 83.12892611426862, "difficulty": "Medium", "likes": 37, "dislikes": 4, "categoryTitle": "Database", "frontendQuestionId": "2372", "paidOnly": true, "title": "Calculate the Influence of Each Salesperson", "titleSlug": "calculate-the-influence-of-each-salesperson", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5558, "totalSubmissionRaw": 6686}, "2373": {"acRate": 88.00295945228687, "difficulty": "Easy", "likes": 1209, "dislikes": 161, "categoryTitle": "Algorithms", "frontendQuestionId": "2373", "paidOnly": false, "title": "Largest Local Values in a Matrix", "titleSlug": "largest-local-values-in-a-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 164142, "totalSubmissionRaw": 186519}, "2374": {"acRate": 47.799230958029945, "difficulty": "Medium", "likes": 442, "dislikes": 41, "categoryTitle": "Algorithms", "frontendQuestionId": "2374", "paidOnly": false, "title": "Node With Highest Edge Score", "titleSlug": "node-with-highest-edge-score", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 35055, "totalSubmissionRaw": 73338}, "2375": {"acRate": 76.22282310009012, "difficulty": "Medium", "likes": 938, "dislikes": 44, "categoryTitle": "Algorithms", "frontendQuestionId": "2375", "paidOnly": false, "title": "Construct Smallest Number From DI String", "titleSlug": "construct-smallest-number-from-di-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34673, "totalSubmissionRaw": 45489}, "2376": {"acRate": 38.87408816999683, "difficulty": "Hard", "likes": 571, "dislikes": 32, "categoryTitle": "Algorithms", "frontendQuestionId": "2376", "paidOnly": false, "title": "Count Special Integers", "titleSlug": "count-special-integers", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12257, "totalSubmissionRaw": 31530}, "2377": {"acRate": 78.90231621349446, "difficulty": "Easy", "likes": 38, "dislikes": 2, "categoryTitle": "Database", "frontendQuestionId": "2377", "paidOnly": true, "title": "Sort the Olympic Table", "titleSlug": "sort-the-olympic-table", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6268, "totalSubmissionRaw": 7944}, "2378": {"acRate": 58.10757754220651, "difficulty": "Medium", "likes": 54, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "2378", "paidOnly": true, "title": "Choose Edges to Maximize Score in a Tree", "titleSlug": "choose-edges-to-maximize-score-in-a-tree", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1480, "totalSubmissionRaw": 2547}, "2379": {"acRate": 59.12097603998237, "difficulty": "Easy", "likes": 735, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "2379", "paidOnly": false, "title": "Minimum Recolors to Get K Consecutive Black Blocks", "titleSlug": "minimum-recolors-to-get-k-consecutive-black-blocks", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 56306, "totalSubmissionRaw": 95240}, "2380": {"acRate": 50.6904293271005, "difficulty": "Medium", "likes": 502, "dislikes": 110, "categoryTitle": "Algorithms", "frontendQuestionId": "2380", "paidOnly": false, "title": "Time Needed to Rearrange a Binary String", "titleSlug": "time-needed-to-rearrange-a-binary-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 32965, "totalSubmissionRaw": 65032}, "2381": {"acRate": 37.761236282493215, "difficulty": "Medium", "likes": 758, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "2381", "paidOnly": false, "title": "Shifting Letters II", "titleSlug": "shifting-letters-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22676, "totalSubmissionRaw": 60051}, "2382": {"acRate": 49.21957952856233, "difficulty": "Hard", "likes": 462, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "2382", "paidOnly": false, "title": "Maximum Segment Sum After Removals", "titleSlug": "maximum-segment-sum-after-removals", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9271, "totalSubmissionRaw": 18836}, "2383": {"acRate": 41.31649502618457, "difficulty": "Easy", "likes": 344, "dislikes": 277, "categoryTitle": "Algorithms", "frontendQuestionId": "2383", "paidOnly": false, "title": "Minimum Hours of Training to Win a Competition", "titleSlug": "minimum-hours-of-training-to-win-a-competition", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 32978, "totalSubmissionRaw": 79818}, "2384": {"acRate": 35.45295251445593, "difficulty": "Medium", "likes": 608, "dislikes": 230, "categoryTitle": "Algorithms", "frontendQuestionId": "2384", "paidOnly": false, "title": "Largest Palindromic Number", "titleSlug": "largest-palindromic-number", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 40466, "totalSubmissionRaw": 114140}, "2385": {"acRate": 62.75149345009129, "difficulty": "Medium", "likes": 2722, "dislikes": 67, "categoryTitle": "Algorithms", "frontendQuestionId": "2385", "paidOnly": false, "title": "Amount of Time for Binary Tree to Be Infected", "titleSlug": "amount-of-time-for-binary-tree-to-be-infected", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 141599, "totalSubmissionRaw": 225651}, "2386": {"acRate": 39.097840439579166, "difficulty": "Hard", "likes": 565, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "2386", "paidOnly": false, "title": "Find the K-Sum of an Array", "titleSlug": "find-the-k-sum-of-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9179, "totalSubmissionRaw": 23477}, "2387": {"acRate": 69.75421490960795, "difficulty": "Medium", "likes": 77, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "2387", "paidOnly": true, "title": "Median of a Row Wise Sorted Matrix", "titleSlug": "median-of-a-row-wise-sorted-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3433, "totalSubmissionRaw": 4922}, "2388": {"acRate": 50.67567567567568, "difficulty": "Medium", "likes": 84, "dislikes": 29, "categoryTitle": "Database", "frontendQuestionId": "2388", "paidOnly": true, "title": "Change Null Values in a Table to the Previous Value", "titleSlug": "change-null-values-in-a-table-to-the-previous-value", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4500, "totalSubmissionRaw": 8880}, "2389": {"acRate": 71.92842425704899, "difficulty": "Easy", "likes": 1897, "dislikes": 171, "categoryTitle": "Algorithms", "frontendQuestionId": "2389", "paidOnly": false, "title": "Longest Subsequence With Limited Sum", "titleSlug": "longest-subsequence-with-limited-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 116250, "totalSubmissionRaw": 161619}, "2390": {"acRate": 75.99911350824723, "difficulty": "Medium", "likes": 2915, "dislikes": 208, "categoryTitle": "Algorithms", "frontendQuestionId": "2390", "paidOnly": false, "title": "Removing Stars From a String", "titleSlug": "removing-stars-from-a-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 346350, "totalSubmissionRaw": 455729}, "2391": {"acRate": 85.21597103082406, "difficulty": "Medium", "likes": 1527, "dislikes": 239, "categoryTitle": "Algorithms", "frontendQuestionId": "2391", "paidOnly": false, "title": "Minimum Amount of Time to Collect Garbage", "titleSlug": "minimum-amount-of-time-to-collect-garbage", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 134607, "totalSubmissionRaw": 157960}, "2392": {"acRate": 79.57276717291347, "difficulty": "Hard", "likes": 1348, "dislikes": 50, "categoryTitle": "Algorithms", "frontendQuestionId": "2392", "paidOnly": false, "title": "Build a Matrix With Conditions", "titleSlug": "build-a-matrix-with-conditions", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 91375, "totalSubmissionRaw": 114832}, "2393": {"acRate": 74.79547237476186, "difficulty": "Medium", "likes": 133, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "2393", "paidOnly": true, "title": "Count Strictly Increasing Subarrays", "titleSlug": "count-strictly-increasing-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 6674, "totalSubmissionRaw": 8923}, "2394": {"acRate": 40.597414177440925, "difficulty": "Medium", "likes": 27, "dislikes": 36, "categoryTitle": "Database", "frontendQuestionId": "2394", "paidOnly": true, "title": "Employees With Deductions", "titleSlug": "employees-with-deductions", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4553, "totalSubmissionRaw": 11215}, "2395": {"acRate": 65.30469617741392, "difficulty": "Easy", "likes": 538, "dislikes": 31, "categoryTitle": "Algorithms", "frontendQuestionId": "2395", "paidOnly": false, "title": "Find Subarrays With Equal Sum", "titleSlug": "find-subarrays-with-equal-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 52327, "totalSubmissionRaw": 80128}, "2396": {"acRate": 87.74091980363114, "difficulty": "Medium", "likes": 624, "dislikes": 1572, "categoryTitle": "Algorithms", "frontendQuestionId": "2396", "paidOnly": false, "title": "Strictly Palindromic Number", "titleSlug": "strictly-palindromic-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Brainteaser", "id": "VG9waWNUYWdOb2RlOjMy", "slug": "brainteaser"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 94180, "totalSubmissionRaw": 107339}, "2397": {"acRate": 55.754265724280714, "difficulty": "Medium", "likes": 266, "dislikes": 411, "categoryTitle": "Algorithms", "frontendQuestionId": "2397", "paidOnly": false, "title": "Maximum Rows Covered by Columns", "titleSlug": "maximum-rows-covered-by-columns", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15619, "totalSubmissionRaw": 28014}, "2398": {"acRate": 34.77874138314432, "difficulty": "Hard", "likes": 801, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "2398", "paidOnly": false, "title": "Maximum Number of Robots Within Budget", "titleSlug": "maximum-number-of-robots-within-budget", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21896, "totalSubmissionRaw": 62958}, "2399": {"acRate": 70.7218576476527, "difficulty": "Easy", "likes": 485, "dislikes": 57, "categoryTitle": "Algorithms", "frontendQuestionId": "2399", "paidOnly": false, "title": "Check Distances Between Same Letters", "titleSlug": "check-distances-between-same-letters", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 50436, "totalSubmissionRaw": 71316}, "2400": {"acRate": 35.29287139973907, "difficulty": "Medium", "likes": 794, "dislikes": 61, "categoryTitle": "Algorithms", "frontendQuestionId": "2400", "paidOnly": false, "title": "Number of Ways to Reach a Position After Exactly k Steps", "titleSlug": "number-of-ways-to-reach-a-position-after-exactly-k-steps", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 31651, "totalSubmissionRaw": 89681}, "2401": {"acRate": 51.55029370798765, "difficulty": "Medium", "likes": 1307, "dislikes": 30, "categoryTitle": "Algorithms", "frontendQuestionId": "2401", "paidOnly": false, "title": "Longest Nice Subarray", "titleSlug": "longest-nice-subarray", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34050, "totalSubmissionRaw": 66052}, "2402": {"acRate": 44.22178132955003, "difficulty": "Hard", "likes": 1716, "dislikes": 110, "categoryTitle": "Algorithms", "frontendQuestionId": "2402", "paidOnly": false, "title": "Meeting Rooms III", "titleSlug": "meeting-rooms-iii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 119692, "totalSubmissionRaw": 270662}, "2403": {"acRate": 56.26266720713418, "difficulty": "Hard", "likes": 47, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "2403", "paidOnly": true, "title": "Minimum Time to Kill All Monsters", "titleSlug": "minimum-time-to-kill-all-monsters", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1388, "totalSubmissionRaw": 2467}, "2404": {"acRate": 50.73997024709138, "difficulty": "Easy", "likes": 973, "dislikes": 34, "categoryTitle": "Algorithms", "frontendQuestionId": "2404", "paidOnly": false, "title": "Most Frequent Even Element", "titleSlug": "most-frequent-even-element", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 85610, "totalSubmissionRaw": 168723}, "2405": {"acRate": 78.0071630537229, "difficulty": "Medium", "likes": 2630, "dislikes": 102, "categoryTitle": "Algorithms", "frontendQuestionId": "2405", "paidOnly": false, "title": "Optimal Partition of String", "titleSlug": "optimal-partition-of-string", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 206914, "totalSubmissionRaw": 265250}, "2406": {"acRate": 47.37630152310472, "difficulty": "Medium", "likes": 782, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "2406", "paidOnly": false, "title": "Divide Intervals Into Minimum Number of Groups", "titleSlug": "divide-intervals-into-minimum-number-of-groups", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27528, "totalSubmissionRaw": 58105}, "2407": {"acRate": 24.274716981132073, "difficulty": "Hard", "likes": 882, "dislikes": 37, "categoryTitle": "Algorithms", "frontendQuestionId": "2407", "paidOnly": false, "title": "Longest Increasing Subsequence II", "titleSlug": "longest-increasing-subsequence-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Monotonic Queue", "id": "VG9waWNUYWdOb2RlOjYxMDcx", "slug": "monotonic-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16082, "totalSubmissionRaw": 66250}, "2408": {"acRate": 78.55050450254963, "difficulty": "Medium", "likes": 51, "dislikes": 80, "categoryTitle": "Algorithms", "frontendQuestionId": "2408", "paidOnly": true, "title": "Design SQL", "titleSlug": "design-sql", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7240, "totalSubmissionRaw": 9217}, "2409": {"acRate": 45.33020410518823, "difficulty": "Easy", "likes": 254, "dislikes": 583, "categoryTitle": "Algorithms", "frontendQuestionId": "2409", "paidOnly": false, "title": "Count Days Spent Together", "titleSlug": "count-days-spent-together", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23564, "totalSubmissionRaw": 51983}, "2410": {"acRate": 63.44669663302519, "difficulty": "Medium", "likes": 503, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2410", "paidOnly": false, "title": "Maximum Matching of Players With Trainers", "titleSlug": "maximum-matching-of-players-with-trainers", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 37405, "totalSubmissionRaw": 58955}, "2411": {"acRate": 44.344589383320475, "difficulty": "Medium", "likes": 566, "dislikes": 29, "categoryTitle": "Algorithms", "frontendQuestionId": "2411", "paidOnly": false, "title": "Smallest Subarrays With Maximum Bitwise OR", "titleSlug": "smallest-subarrays-with-maximum-bitwise-or", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13224, "totalSubmissionRaw": 29821}, "2412": {"acRate": 40.56060887321329, "difficulty": "Hard", "likes": 400, "dislikes": 35, "categoryTitle": "Algorithms", "frontendQuestionId": "2412", "paidOnly": false, "title": "Minimum Money Required Before Transactions", "titleSlug": "minimum-money-required-before-transactions", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10925, "totalSubmissionRaw": 26935}, "2413": {"acRate": 87.90213045752763, "difficulty": "Easy", "likes": 901, "dislikes": 106, "categoryTitle": "Algorithms", "frontendQuestionId": "2413", "paidOnly": false, "title": "Smallest Even Multiple", "titleSlug": "smallest-even-multiple", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 183151, "totalSubmissionRaw": 208358}, "2414": {"acRate": 58.64894932014833, "difficulty": "Medium", "likes": 508, "dislikes": 30, "categoryTitle": "Algorithms", "frontendQuestionId": "2414", "paidOnly": false, "title": "Length of the Longest Alphabetical Continuous Substring", "titleSlug": "length-of-the-longest-alphabetical-continuous-substring", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 47447, "totalSubmissionRaw": 80900}, "2415": {"acRate": 78.12963385422607, "difficulty": "Medium", "likes": 1125, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "2415", "paidOnly": false, "title": "Reverse Odd Levels of Binary Tree", "titleSlug": "reverse-odd-levels-of-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 54797, "totalSubmissionRaw": 70136}, "2416": {"acRate": 46.396083605305186, "difficulty": "Hard", "likes": 670, "dislikes": 54, "categoryTitle": "Algorithms", "frontendQuestionId": "2416", "paidOnly": false, "title": "Sum of Prefix Scores of Strings", "titleSlug": "sum-of-prefix-scores-of-strings", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26726, "totalSubmissionRaw": 57604}, "2417": {"acRate": 45.20603835169318, "difficulty": "Medium", "likes": 28, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "2417", "paidOnly": true, "title": "Closest Fair Integer", "titleSlug": "closest-fair-integer", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1108, "totalSubmissionRaw": 2451}, "2418": {"acRate": 85.02756476450043, "difficulty": "Easy", "likes": 1712, "dislikes": 32, "categoryTitle": "Algorithms", "frontendQuestionId": "2418", "paidOnly": false, "title": "Sort the People", "titleSlug": "sort-the-people", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 301370, "totalSubmissionRaw": 354438}, "2419": {"acRate": 49.678719044145744, "difficulty": "Medium", "likes": 461, "dislikes": 39, "categoryTitle": "Algorithms", "frontendQuestionId": "2419", "paidOnly": false, "title": "Longest Subarray With Maximum Bitwise AND", "titleSlug": "longest-subarray-with-maximum-bitwise-and", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Brainteaser", "id": "VG9waWNUYWdOb2RlOjMy", "slug": "brainteaser"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28606, "totalSubmissionRaw": 57582}, "2420": {"acRate": 38.94346142770294, "difficulty": "Medium", "likes": 625, "dislikes": 37, "categoryTitle": "Algorithms", "frontendQuestionId": "2420", "paidOnly": false, "title": "Find All Good Indices", "titleSlug": "find-all-good-indices", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24342, "totalSubmissionRaw": 62506}, "2421": {"acRate": 56.32934060249114, "difficulty": "Hard", "likes": 2240, "dislikes": 104, "categoryTitle": "Algorithms", "frontendQuestionId": "2421", "paidOnly": false, "title": "Number of Good Paths", "titleSlug": "number-of-good-paths", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 56620, "totalSubmissionRaw": 100516}, "2422": {"acRate": 69.20407601211788, "difficulty": "Medium", "likes": 135, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2422", "paidOnly": true, "title": "Merge Operations to Turn Array Into a Palindrome", "titleSlug": "merge-operations-to-turn-array-into-a-palindrome", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12564, "totalSubmissionRaw": 18155}, "2423": {"acRate": 17.433132316424263, "difficulty": "Easy", "likes": 673, "dislikes": 1221, "categoryTitle": "Algorithms", "frontendQuestionId": "2423", "paidOnly": false, "title": "Remove Letter To Equalize Frequency", "titleSlug": "remove-letter-to-equalize-frequency", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 49143, "totalSubmissionRaw": 281899}, "2424": {"acRate": 55.557547967313056, "difficulty": "Medium", "likes": 360, "dislikes": 29, "categoryTitle": "Algorithms", "frontendQuestionId": "2424", "paidOnly": false, "title": "Longest Uploaded Prefix", "titleSlug": "longest-uploaded-prefix", "topicTags": [{"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21688, "totalSubmissionRaw": 39037}, "2425": {"acRate": 58.17555938037866, "difficulty": "Medium", "likes": 404, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "2425", "paidOnly": false, "title": "Bitwise XOR of All Pairings", "titleSlug": "bitwise-xor-of-all-pairings", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Brainteaser", "id": "VG9waWNUYWdOb2RlOjMy", "slug": "brainteaser"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20618, "totalSubmissionRaw": 35441}, "2426": {"acRate": 44.278897653130784, "difficulty": "Hard", "likes": 532, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "2426", "paidOnly": false, "title": "Number of Pairs Satisfying Inequality", "titleSlug": "number-of-pairs-satisfying-inequality", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Merge Sort", "id": "VG9waWNUYWdOb2RlOjYxMDUx", "slug": "merge-sort"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13641, "totalSubmissionRaw": 30807}, "2427": {"acRate": 79.10298860460117, "difficulty": "Easy", "likes": 577, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "2427", "paidOnly": false, "title": "Number of Common Factors", "titleSlug": "number-of-common-factors", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 91977, "totalSubmissionRaw": 116275}, "2428": {"acRate": 74.94916785902554, "difficulty": "Medium", "likes": 452, "dislikes": 61, "categoryTitle": "Algorithms", "frontendQuestionId": "2428", "paidOnly": false, "title": "Maximum Sum of an Hourglass", "titleSlug": "maximum-sum-of-an-hourglass", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 39810, "totalSubmissionRaw": 53116}, "2429": {"acRate": 44.34306929715425, "difficulty": "Medium", "likes": 480, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "2429", "paidOnly": false, "title": "Minimize XOR", "titleSlug": "minimize-xor", "topicTags": [{"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22454, "totalSubmissionRaw": 50637}, "2430": {"acRate": 33.62795024973068, "difficulty": "Hard", "likes": 483, "dislikes": 54, "categoryTitle": "Algorithms", "frontendQuestionId": "2430", "paidOnly": false, "title": "Maximum Deletions on a String", "titleSlug": "maximum-deletions-on-a-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13735, "totalSubmissionRaw": 40844}, "2431": {"acRate": 63.90728476821192, "difficulty": "Medium", "likes": 46, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "2431", "paidOnly": true, "title": "Maximize Total Tastiness of Purchased Fruits", "titleSlug": "maximize-total-tastiness-of-purchased-fruits", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2316, "totalSubmissionRaw": 3624}, "2432": {"acRate": 50.31749167466275, "difficulty": "Easy", "likes": 275, "dislikes": 68, "categoryTitle": "Algorithms", "frontendQuestionId": "2432", "paidOnly": false, "title": "The Employee That Worked on the Longest Task", "titleSlug": "the-employee-that-worked-on-the-longest-task", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 35659, "totalSubmissionRaw": 70868}, "2433": {"acRate": 88.06734738716654, "difficulty": "Medium", "likes": 1391, "dislikes": 83, "categoryTitle": "Algorithms", "frontendQuestionId": "2433", "paidOnly": false, "title": "Find The Original Array of Prefix Xor", "titleSlug": "find-the-original-array-of-prefix-xor", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 152315, "totalSubmissionRaw": 172952}, "2434": {"acRate": 40.125437572928824, "difficulty": "Medium", "likes": 651, "dislikes": 193, "categoryTitle": "Algorithms", "frontendQuestionId": "2434", "paidOnly": false, "title": "Using a Robot to Print the Lexicographically Smallest String", "titleSlug": "using-a-robot-to-print-the-lexicographically-smallest-string", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19257, "totalSubmissionRaw": 47992}, "2435": {"acRate": 43.05644089096108, "difficulty": "Hard", "likes": 897, "dislikes": 32, "categoryTitle": "Algorithms", "frontendQuestionId": "2435", "paidOnly": false, "title": "Paths in Matrix Whose Sum Is Divisible by K", "titleSlug": "paths-in-matrix-whose-sum-is-divisible-by-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23641, "totalSubmissionRaw": 54907}, "2436": {"acRate": 71.13339410513521, "difficulty": "Medium", "likes": 40, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "2436", "paidOnly": true, "title": "Minimum Split Into Subarrays With GCD Greater Than One", "titleSlug": "minimum-split-into-subarrays-with-gcd-greater-than-one", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2341, "totalSubmissionRaw": 3291}, "2437": {"acRate": 46.89863842662632, "difficulty": "Easy", "likes": 286, "dislikes": 237, "categoryTitle": "Algorithms", "frontendQuestionId": "2437", "paidOnly": false, "title": "Number of Valid Clock Times", "titleSlug": "number-of-valid-clock-times", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 32240, "totalSubmissionRaw": 68744}, "2438": {"acRate": 40.6103000316849, "difficulty": "Medium", "likes": 293, "dislikes": 51, "categoryTitle": "Algorithms", "frontendQuestionId": "2438", "paidOnly": false, "title": "Range Product Queries of Powers", "titleSlug": "range-product-queries-of-powers", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16662, "totalSubmissionRaw": 41029}, "2439": {"acRate": 46.50164759317808, "difficulty": "Medium", "likes": 2420, "dislikes": 619, "categoryTitle": "Algorithms", "frontendQuestionId": "2439", "paidOnly": false, "title": "Minimize Maximum of Array", "titleSlug": "minimize-maximum-of-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 83543, "totalSubmissionRaw": 179656}, "2440": {"acRate": 53.02659737083461, "difficulty": "Hard", "likes": 390, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "2440", "paidOnly": false, "title": "Create Components With Same Value", "titleSlug": "create-components-with-same-value", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6938, "totalSubmissionRaw": 13084}, "2441": {"acRate": 75.08609953338537, "difficulty": "Easy", "likes": 996, "dislikes": 24, "categoryTitle": "Algorithms", "frontendQuestionId": "2441", "paidOnly": false, "title": "Largest Positive Integer That Exists With Its Negative", "titleSlug": "largest-positive-integer-that-exists-with-its-negative", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 226085, "totalSubmissionRaw": 301102}, "2442": {"acRate": 79.75647430791881, "difficulty": "Medium", "likes": 630, "dislikes": 54, "categoryTitle": "Algorithms", "frontendQuestionId": "2442", "paidOnly": false, "title": "Count Number of Distinct Integers After Reverse Operations", "titleSlug": "count-number-of-distinct-integers-after-reverse-operations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 66090, "totalSubmissionRaw": 82865}, "2443": {"acRate": 47.53672958248341, "difficulty": "Medium", "likes": 256, "dislikes": 300, "categoryTitle": "Algorithms", "frontendQuestionId": "2443", "paidOnly": false, "title": "Sum of Number and Its Reverse", "titleSlug": "sum-of-number-and-its-reverse", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 36821, "totalSubmissionRaw": 77458}, "2444": {"acRate": 67.88914230810491, "difficulty": "Hard", "likes": 3151, "dislikes": 82, "categoryTitle": "Algorithms", "frontendQuestionId": "2444", "paidOnly": false, "title": "Count Subarrays With Fixed Bounds", "titleSlug": "count-subarrays-with-fixed-bounds", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Monotonic Queue", "id": "VG9waWNUYWdOb2RlOjYxMDcx", "slug": "monotonic-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 145555, "totalSubmissionRaw": 214401}, "2445": {"acRate": 68.51851851851852, "difficulty": "Medium", "likes": 76, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "2445", "paidOnly": true, "title": "Number of Nodes With Value One", "titleSlug": "number-of-nodes-with-value-one", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2072, "totalSubmissionRaw": 3024}, "2446": {"acRate": 51.12577511025632, "difficulty": "Easy", "likes": 458, "dislikes": 67, "categoryTitle": "Algorithms", "frontendQuestionId": "2446", "paidOnly": false, "title": "Determine if Two Events Have Conflict", "titleSlug": "determine-if-two-events-have-conflict", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 46253, "totalSubmissionRaw": 90470}, "2447": {"acRate": 50.31842319103502, "difficulty": "Medium", "likes": 443, "dislikes": 68, "categoryTitle": "Algorithms", "frontendQuestionId": "2447", "paidOnly": false, "title": "Number of Subarrays With GCD Equal to K", "titleSlug": "number-of-subarrays-with-gcd-equal-to-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26627, "totalSubmissionRaw": 52917}, "2448": {"acRate": 45.96217167188067, "difficulty": "Hard", "likes": 2384, "dislikes": 35, "categoryTitle": "Algorithms", "frontendQuestionId": "2448", "paidOnly": false, "title": "Minimum Cost to Make Array Equal", "titleSlug": "minimum-cost-to-make-array-equal", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 67142, "totalSubmissionRaw": 146081}, "2449": {"acRate": 62.036949313121745, "difficulty": "Hard", "likes": 425, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "2449", "paidOnly": false, "title": "Minimum Number of Operations to Make Arrays Similar", "titleSlug": "minimum-number-of-operations-to-make-arrays-similar", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13096, "totalSubmissionRaw": 21110}, "2450": {"acRate": 63.53312302839117, "difficulty": "Medium", "likes": 37, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "2450", "paidOnly": true, "title": "Number of Distinct Binary Strings After Applying Operations", "titleSlug": "number-of-distinct-binary-strings-after-applying-operations", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1007, "totalSubmissionRaw": 1585}, "2451": {"acRate": 59.33607520564043, "difficulty": "Easy", "likes": 395, "dislikes": 111, "categoryTitle": "Algorithms", "frontendQuestionId": "2451", "paidOnly": false, "title": "Odd String Difference", "titleSlug": "odd-string-difference", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30297, "totalSubmissionRaw": 51060}, "2452": {"acRate": 60.81866601779004, "difficulty": "Medium", "likes": 297, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "2452", "paidOnly": false, "title": "Words Within Two Edits of Dictionary", "titleSlug": "words-within-two-edits-of-dictionary", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22495, "totalSubmissionRaw": 36987}, "2453": {"acRate": 39.57317876432618, "difficulty": "Medium", "likes": 565, "dislikes": 24, "categoryTitle": "Algorithms", "frontendQuestionId": "2453", "paidOnly": false, "title": "Destroy Sequential Targets", "titleSlug": "destroy-sequential-targets", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18024, "totalSubmissionRaw": 45546}, "2454": {"acRate": 38.921078202036924, "difficulty": "Hard", "likes": 663, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "2454", "paidOnly": false, "title": "Next Greater Element IV", "titleSlug": "next-greater-element-iv", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10815, "totalSubmissionRaw": 27787}, "2455": {"acRate": 60.63199339038546, "difficulty": "Easy", "likes": 334, "dislikes": 36, "categoryTitle": "Algorithms", "frontendQuestionId": "2455", "paidOnly": false, "title": "Average Value of Even Numbers That Are Divisible by Three", "titleSlug": "average-value-of-even-numbers-that-are-divisible-by-three", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 59443, "totalSubmissionRaw": 98039}, "2456": {"acRate": 43.96487544144316, "difficulty": "Medium", "likes": 271, "dislikes": 365, "categoryTitle": "Algorithms", "frontendQuestionId": "2456", "paidOnly": false, "title": "Most Popular Video Creator", "titleSlug": "most-popular-video-creator", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23031, "totalSubmissionRaw": 52385}, "2457": {"acRate": 37.70049495738901, "difficulty": "Medium", "likes": 524, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "2457", "paidOnly": false, "title": "Minimum Addition to Make Integer Beautiful", "titleSlug": "minimum-addition-to-make-integer-beautiful", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20261, "totalSubmissionRaw": 53742}, "2458": {"acRate": 41.13390365805047, "difficulty": "Hard", "likes": 843, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "2458", "paidOnly": false, "title": "Height of Binary Tree After Subtree Removal Queries", "titleSlug": "height-of-binary-tree-after-subtree-removal-queries", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26830, "totalSubmissionRaw": 65226}, "2459": {"acRate": 45.87133349765837, "difficulty": "Hard", "likes": 54, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "2459", "paidOnly": true, "title": "Sort Array by Moving Items to Empty Space", "titleSlug": "sort-array-by-moving-items-to-empty-space", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1861, "totalSubmissionRaw": 4057}, "2460": {"acRate": 67.80680208322717, "difficulty": "Easy", "likes": 550, "dislikes": 27, "categoryTitle": "Algorithms", "frontendQuestionId": "2460", "paidOnly": false, "title": "Apply Operations to an Array", "titleSlug": "apply-operations-to-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 66530, "totalSubmissionRaw": 98117}, "2461": {"acRate": 34.1636776825562, "difficulty": "Medium", "likes": 1315, "dislikes": 24, "categoryTitle": "Algorithms", "frontendQuestionId": "2461", "paidOnly": false, "title": "Maximum Sum of Distinct Subarrays With Length K", "titleSlug": "maximum-sum-of-distinct-subarrays-with-length-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 62388, "totalSubmissionRaw": 182615}, "2462": {"acRate": 42.91792886563049, "difficulty": "Medium", "likes": 1895, "dislikes": 591, "categoryTitle": "Algorithms", "frontendQuestionId": "2462", "paidOnly": false, "title": "Total Cost to Hire K Workers", "titleSlug": "total-cost-to-hire-k-workers", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 103991, "totalSubmissionRaw": 242303}, "2463": {"acRate": 40.913415794481445, "difficulty": "Hard", "likes": 466, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "2463", "paidOnly": false, "title": "Minimum Total Distance Traveled", "titleSlug": "minimum-total-distance-traveled", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8600, "totalSubmissionRaw": 21020}, "2464": {"acRate": 54.53703703703704, "difficulty": "Medium", "likes": 29, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "2464", "paidOnly": true, "title": "Minimum Subarrays in a Valid Split", "titleSlug": "minimum-subarrays-in-a-valid-split", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1178, "totalSubmissionRaw": 2160}, "2465": {"acRate": 58.16360472851952, "difficulty": "Easy", "likes": 371, "dislikes": 27, "categoryTitle": "Algorithms", "frontendQuestionId": "2465", "paidOnly": false, "title": "Number of Distinct Averages", "titleSlug": "number-of-distinct-averages", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 45463, "totalSubmissionRaw": 78164}, "2466": {"acRate": 54.451547026240696, "difficulty": "Medium", "likes": 1704, "dislikes": 147, "categoryTitle": "Algorithms", "frontendQuestionId": "2466", "paidOnly": false, "title": "Count Ways To Build Good Strings", "titleSlug": "count-ways-to-build-good-strings", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 77857, "totalSubmissionRaw": 142984}, "2467": {"acRate": 49.53155448958177, "difficulty": "Medium", "likes": 703, "dislikes": 69, "categoryTitle": "Algorithms", "frontendQuestionId": "2467", "paidOnly": false, "title": "Most Profitable Path in a Tree", "titleSlug": "most-profitable-path-in-a-tree", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13217, "totalSubmissionRaw": 26684}, "2468": {"acRate": 44.605976693204106, "difficulty": "Hard", "likes": 159, "dislikes": 168, "categoryTitle": "Algorithms", "frontendQuestionId": "2468", "paidOnly": false, "title": "Split Message Based on Limit", "titleSlug": "split-message-based-on-limit", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11598, "totalSubmissionRaw": 26001}, "2469": {"acRate": 89.66338293472604, "difficulty": "Easy", "likes": 618, "dislikes": 336, "categoryTitle": "Algorithms", "frontendQuestionId": "2469", "paidOnly": false, "title": "Convert the Temperature", "titleSlug": "convert-the-temperature", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 194686, "totalSubmissionRaw": 217130}, "2470": {"acRate": 39.04766782763095, "difficulty": "Medium", "likes": 356, "dislikes": 38, "categoryTitle": "Algorithms", "frontendQuestionId": "2470", "paidOnly": false, "title": "Number of Subarrays With LCM Equal to K", "titleSlug": "number-of-subarrays-with-lcm-equal-to-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22871, "totalSubmissionRaw": 58572}, "2471": {"acRate": 62.05649088632252, "difficulty": "Medium", "likes": 641, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2471", "paidOnly": false, "title": "Minimum Number of Operations to Sort a Binary Tree by Level", "titleSlug": "minimum-number-of-operations-to-sort-a-binary-tree-by-level", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22298, "totalSubmissionRaw": 35932}, "2472": {"acRate": 40.53129402294224, "difficulty": "Hard", "likes": 459, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "2472", "paidOnly": false, "title": "Maximum Number of Non-overlapping Palindrome Substrings", "titleSlug": "maximum-number-of-non-overlapping-palindrome-substrings", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16112, "totalSubmissionRaw": 39752}, "2473": {"acRate": 67.61221606347137, "difficulty": "Medium", "likes": 110, "dislikes": 24, "categoryTitle": "Algorithms", "frontendQuestionId": "2473", "paidOnly": true, "title": "Minimum Cost to Buy Apples", "titleSlug": "minimum-cost-to-buy-apples", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 6221, "totalSubmissionRaw": 9201}, "2474": {"acRate": 44.91964042495233, "difficulty": "Hard", "likes": 38, "dislikes": 6, "categoryTitle": "Database", "frontendQuestionId": "2474", "paidOnly": true, "title": "Customers With Strictly Increasing Purchases", "titleSlug": "customers-with-strictly-increasing-purchases", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3298, "totalSubmissionRaw": 7342}, "2475": {"acRate": 71.61898835743176, "difficulty": "Easy", "likes": 402, "dislikes": 46, "categoryTitle": "Algorithms", "frontendQuestionId": "2475", "paidOnly": false, "title": "Number of Unequal Triplets in Array", "titleSlug": "number-of-unequal-triplets-in-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 43737, "totalSubmissionRaw": 61069}, "2476": {"acRate": 41.592246452059534, "difficulty": "Medium", "likes": 443, "dislikes": 117, "categoryTitle": "Algorithms", "frontendQuestionId": "2476", "paidOnly": false, "title": "Closest Nodes Queries in a Binary Search Tree", "titleSlug": "closest-nodes-queries-in-a-binary-search-tree", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Search Tree", "id": "VG9waWNUYWdOb2RlOjMw", "slug": "binary-search-tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24032, "totalSubmissionRaw": 57780}, "2477": {"acRate": 64.48685743410513, "difficulty": "Medium", "likes": 2192, "dislikes": 87, "categoryTitle": "Algorithms", "frontendQuestionId": "2477", "paidOnly": false, "title": "Minimum Fuel Cost to Report to the Capital", "titleSlug": "minimum-fuel-cost-to-report-to-the-capital", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 70853, "totalSubmissionRaw": 109872}, "2478": {"acRate": 31.157926191543407, "difficulty": "Hard", "likes": 348, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "2478", "paidOnly": false, "title": "Number of Beautiful Partitions", "titleSlug": "number-of-beautiful-partitions", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10427, "totalSubmissionRaw": 33465}, "2479": {"acRate": 49.48529411764706, "difficulty": "Hard", "likes": 31, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "2479", "paidOnly": true, "title": "Maximum XOR of Two Non-Overlapping Subtrees", "titleSlug": "maximum-xor-of-two-non-overlapping-subtrees", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 673, "totalSubmissionRaw": 1360}, "2480": {"acRate": 76.5073106620667, "difficulty": "Easy", "likes": 27, "dislikes": 9, "categoryTitle": "Database", "frontendQuestionId": "2480", "paidOnly": true, "title": "Form a Chemical Bond", "titleSlug": "form-a-chemical-bond", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4657, "totalSubmissionRaw": 6087}, "2481": {"acRate": 53.490310165613586, "difficulty": "Easy", "likes": 222, "dislikes": 49, "categoryTitle": "Algorithms", "frontendQuestionId": "2481", "paidOnly": false, "title": "Minimum Cuts to Divide a Circle", "titleSlug": "minimum-cuts-to-divide-a-circle", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 35302, "totalSubmissionRaw": 65997}, "2482": {"acRate": 84.43077370372083, "difficulty": "Medium", "likes": 1175, "dislikes": 82, "categoryTitle": "Algorithms", "frontendQuestionId": "2482", "paidOnly": false, "title": "Difference Between Ones and Zeros in Row and Column", "titleSlug": "difference-between-ones-and-zeros-in-row-and-column", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 127775, "totalSubmissionRaw": 151337}, "2483": {"acRate": 67.38301150625016, "difficulty": "Medium", "likes": 1930, "dislikes": 102, "categoryTitle": "Algorithms", "frontendQuestionId": "2483", "paidOnly": false, "title": "Minimum Penalty for a Shop", "titleSlug": "minimum-penalty-for-a-shop", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": true, "totalAcceptedRaw": 108457, "totalSubmissionRaw": 160956}, "2484": {"acRate": 38.30196455557082, "difficulty": "Hard", "likes": 496, "dislikes": 28, "categoryTitle": "Algorithms", "frontendQuestionId": "2484", "paidOnly": false, "title": "Count Palindromic Subsequences", "titleSlug": "count-palindromic-subsequences", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11152, "totalSubmissionRaw": 29116}, "2485": {"acRate": 83.93014265726197, "difficulty": "Easy", "likes": 1282, "dislikes": 56, "categoryTitle": "Algorithms", "frontendQuestionId": "2485", "paidOnly": false, "title": "Find the Pivot Integer", "titleSlug": "find-the-pivot-integer", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 232745, "totalSubmissionRaw": 277308}, "2486": {"acRate": 73.01452971636138, "difficulty": "Medium", "likes": 1097, "dislikes": 86, "categoryTitle": "Algorithms", "frontendQuestionId": "2486", "paidOnly": false, "title": "Append Characters to String to Make Subsequence", "titleSlug": "append-characters-to-string-to-make-subsequence", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 188947, "totalSubmissionRaw": 258780}, "2487": {"acRate": 74.32700503384564, "difficulty": "Medium", "likes": 2083, "dislikes": 72, "categoryTitle": "Algorithms", "frontendQuestionId": "2487", "paidOnly": false, "title": "Remove Nodes From Linked List", "titleSlug": "remove-nodes-from-linked-list", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 194460, "totalSubmissionRaw": 261628}, "2488": {"acRate": 44.49353219763908, "difficulty": "Hard", "likes": 572, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "2488", "paidOnly": false, "title": "Count Subarrays With Median K", "titleSlug": "count-subarrays-with-median-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12589, "totalSubmissionRaw": 28294}, "2489": {"acRate": 57.0229434806939, "difficulty": "Medium", "likes": 47, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "2489", "paidOnly": true, "title": "Number of Substrings With Fixed Ratio", "titleSlug": "number-of-substrings-with-fixed-ratio", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1019, "totalSubmissionRaw": 1787}, "2490": {"acRate": 62.81809396714371, "difficulty": "Easy", "likes": 364, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "2490", "paidOnly": false, "title": "Circular Sentence", "titleSlug": "circular-sentence", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 40953, "totalSubmissionRaw": 65193}, "2491": {"acRate": 60.15105110402001, "difficulty": "Medium", "likes": 483, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "2491", "paidOnly": false, "title": "Divide Players Into Teams of Equal Skill", "titleSlug": "divide-players-into-teams-of-equal-skill", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 37512, "totalSubmissionRaw": 62363}, "2492": {"acRate": 57.44156468905891, "difficulty": "Medium", "likes": 1775, "dislikes": 303, "categoryTitle": "Algorithms", "frontendQuestionId": "2492", "paidOnly": false, "title": "Minimum Score of a Path Between Two Cities", "titleSlug": "minimum-score-of-a-path-between-two-cities", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 87167, "totalSubmissionRaw": 151749}, "2493": {"acRate": 38.8909426987061, "difficulty": "Hard", "likes": 414, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "2493", "paidOnly": false, "title": "Divide Nodes Into the Maximum Number of Groups", "titleSlug": "divide-nodes-into-the-maximum-number-of-groups", "topicTags": [{"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8416, "totalSubmissionRaw": 21640}, "2494": {"acRate": 31.827411167512693, "difficulty": "Hard", "likes": 47, "dislikes": 6, "categoryTitle": "Database", "frontendQuestionId": "2494", "paidOnly": true, "title": "Merge Overlapping Events in the Same Hall", "titleSlug": "merge-overlapping-events-in-the-same-hall", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1881, "totalSubmissionRaw": 5910}, "2495": {"acRate": 64.0220765781304, "difficulty": "Medium", "likes": 45, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "2495", "paidOnly": true, "title": "Number of Subarrays Having Even Product", "titleSlug": "number-of-subarrays-having-even-product", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1856, "totalSubmissionRaw": 2899}, "2496": {"acRate": 72.50673010705566, "difficulty": "Easy", "likes": 397, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "2496", "paidOnly": false, "title": "Maximum Value of a String in an Array", "titleSlug": "maximum-value-of-a-string-in-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 46325, "totalSubmissionRaw": 63891}, "2497": {"acRate": 39.578121446440754, "difficulty": "Medium", "likes": 398, "dislikes": 51, "categoryTitle": "Algorithms", "frontendQuestionId": "2497", "paidOnly": false, "title": "Maximum Star Sum of a Graph", "titleSlug": "maximum-star-sum-of-a-graph", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20883, "totalSubmissionRaw": 52762}, "2498": {"acRate": 61.78216166513416, "difficulty": "Medium", "likes": 704, "dislikes": 105, "categoryTitle": "Algorithms", "frontendQuestionId": "2498", "paidOnly": false, "title": "Frog Jump II", "titleSlug": "frog-jump-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22173, "totalSubmissionRaw": 35889}, "2499": {"acRate": 43.20111992533831, "difficulty": "Hard", "likes": 228, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "2499", "paidOnly": false, "title": "Minimum Total Cost to Make Arrays Unequal", "titleSlug": "minimum-total-cost-to-make-arrays-unequal", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4629, "totalSubmissionRaw": 10715}, "2500": {"acRate": 78.35557888422315, "difficulty": "Easy", "likes": 637, "dislikes": 47, "categoryTitle": "Algorithms", "frontendQuestionId": "2500", "paidOnly": false, "title": "Delete Greatest Value in Each Row", "titleSlug": "delete-greatest-value-in-each-row", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 62697, "totalSubmissionRaw": 80016}, "2501": {"acRate": 39.95187421534047, "difficulty": "Medium", "likes": 459, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "2501", "paidOnly": false, "title": "Longest Square Streak in an Array", "titleSlug": "longest-square-streak-in-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26731, "totalSubmissionRaw": 66908}, "2502": {"acRate": 53.35441132189099, "difficulty": "Medium", "likes": 287, "dislikes": 86, "categoryTitle": "Algorithms", "frontendQuestionId": "2502", "paidOnly": false, "title": "Design Memory Allocator", "titleSlug": "design-memory-allocator", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17719, "totalSubmissionRaw": 33210}, "2503": {"acRate": 37.82516990860089, "difficulty": "Hard", "likes": 471, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "2503", "paidOnly": false, "title": "Maximum Number of Points From Grid Queries", "titleSlug": "maximum-number-of-points-from-grid-queries", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9684, "totalSubmissionRaw": 25602}, "2504": {"acRate": 76.03079555175364, "difficulty": "Easy", "likes": 30, "dislikes": 4, "categoryTitle": "Database", "frontendQuestionId": "2504", "paidOnly": true, "title": "Concatenate the Name and the Profession", "titleSlug": "concatenate-the-name-and-the-profession", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4444, "totalSubmissionRaw": 5845}, "2505": {"acRate": 66.89919776770144, "difficulty": "Medium", "likes": 53, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "2505", "paidOnly": true, "title": "Bitwise OR of All Subsequence Sums", "titleSlug": "bitwise-or-of-all-subsequence-sums", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Brainteaser", "id": "VG9waWNUYWdOb2RlOjMy", "slug": "brainteaser"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3836, "totalSubmissionRaw": 5734}, "2506": {"acRate": 70.57356983013682, "difficulty": "Easy", "likes": 499, "dislikes": 37, "categoryTitle": "Algorithms", "frontendQuestionId": "2506", "paidOnly": false, "title": "Count Pairs Of Similar Strings", "titleSlug": "count-pairs-of-similar-strings", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 46990, "totalSubmissionRaw": 66583}, "2507": {"acRate": 48.73039660594804, "difficulty": "Medium", "likes": 389, "dislikes": 24, "categoryTitle": "Algorithms", "frontendQuestionId": "2507", "paidOnly": false, "title": "Smallest Value After Replacing With Sum of Prime Factors", "titleSlug": "smallest-value-after-replacing-with-sum-of-prime-factors", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23086, "totalSubmissionRaw": 47375}, "2508": {"acRate": 32.53188225141432, "difficulty": "Hard", "likes": 329, "dislikes": 56, "categoryTitle": "Algorithms", "frontendQuestionId": "2508", "paidOnly": false, "title": "Add Edges to Make Degrees of All Nodes Even", "titleSlug": "add-edges-to-make-degrees-of-all-nodes-even", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13571, "totalSubmissionRaw": 41716}, "2509": {"acRate": 56.46649333221505, "difficulty": "Hard", "likes": 349, "dislikes": 29, "categoryTitle": "Algorithms", "frontendQuestionId": "2509", "paidOnly": false, "title": "Cycle Length Queries in a Tree", "titleSlug": "cycle-length-queries-in-a-tree", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13465, "totalSubmissionRaw": 23846}, "2510": {"acRate": 50.31418807187741, "difficulty": "Medium", "likes": 93, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "2510", "paidOnly": true, "title": "Check if There is a Path With Equal Number of 0's And 1's", "titleSlug": "check-if-there-is-a-path-with-equal-number-of-0s-and-1s", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4564, "totalSubmissionRaw": 9071}, "2511": {"acRate": 38.6047102542521, "difficulty": "Easy", "likes": 278, "dislikes": 274, "categoryTitle": "Algorithms", "frontendQuestionId": "2511", "paidOnly": false, "title": "Maximum Enemy Forts That Can Be Captured", "titleSlug": "maximum-enemy-forts-that-can-be-captured", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24309, "totalSubmissionRaw": 62968}, "2512": {"acRate": 45.2838699976371, "difficulty": "Medium", "likes": 328, "dislikes": 82, "categoryTitle": "Algorithms", "frontendQuestionId": "2512", "paidOnly": false, "title": "Reward Top K Students", "titleSlug": "reward-top-k-students", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21081, "totalSubmissionRaw": 46553}, "2513": {"acRate": 30.665010466266416, "difficulty": "Medium", "likes": 478, "dislikes": 96, "categoryTitle": "Algorithms", "frontendQuestionId": "2513", "paidOnly": false, "title": "Minimize the Maximum of Two Arrays", "titleSlug": "minimize-the-maximum-of-two-arrays", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13331, "totalSubmissionRaw": 43473}, "2514": {"acRate": 33.671484157865486, "difficulty": "Hard", "likes": 415, "dislikes": 36, "categoryTitle": "Algorithms", "frontendQuestionId": "2514", "paidOnly": false, "title": "Count Anagrams", "titleSlug": "count-anagrams", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12115, "totalSubmissionRaw": 35980}, "2515": {"acRate": 49.52407341004662, "difficulty": "Easy", "likes": 345, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "2515", "paidOnly": false, "title": "Shortest Distance to Target String in a Circular Array", "titleSlug": "shortest-distance-to-target-string-in-a-circular-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30385, "totalSubmissionRaw": 61354}, "2516": {"acRate": 34.50873834372877, "difficulty": "Medium", "likes": 708, "dislikes": 65, "categoryTitle": "Algorithms", "frontendQuestionId": "2516", "paidOnly": false, "title": "Take K of Each Character From Left and Right", "titleSlug": "take-k-of-each-character-from-left-and-right", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16764, "totalSubmissionRaw": 48579}, "2517": {"acRate": 64.0638456680255, "difficulty": "Medium", "likes": 904, "dislikes": 145, "categoryTitle": "Algorithms", "frontendQuestionId": "2517", "paidOnly": false, "title": "Maximum Tastiness of Candy Basket", "titleSlug": "maximum-tastiness-of-candy-basket", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22316, "totalSubmissionRaw": 34834}, "2518": {"acRate": 31.582444483301273, "difficulty": "Hard", "likes": 434, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "2518", "paidOnly": false, "title": "Number of Great Partitions", "titleSlug": "number-of-great-partitions", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9031, "totalSubmissionRaw": 28595}, "2519": {"acRate": 53.53557085484796, "difficulty": "Hard", "likes": 103, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "2519", "paidOnly": true, "title": "Count the Number of K-Big Indices", "titleSlug": "count-the-number-of-k-big-indices", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Merge Sort", "id": "VG9waWNUYWdOb2RlOjYxMDUx", "slug": "merge-sort"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7465, "totalSubmissionRaw": 13944}, "2520": {"acRate": 84.79993120843842, "difficulty": "Easy", "likes": 506, "dislikes": 32, "categoryTitle": "Algorithms", "frontendQuestionId": "2520", "paidOnly": false, "title": "Count the Digits That Divide a Number", "titleSlug": "count-the-digits-that-divide-a-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 88755, "totalSubmissionRaw": 104664}, "2521": {"acRate": 51.44703886240608, "difficulty": "Medium", "likes": 465, "dislikes": 10, "categoryTitle": "Algorithms", "frontendQuestionId": "2521", "paidOnly": false, "title": "Distinct Prime Factors of Product of Array", "titleSlug": "distinct-prime-factors-of-product-of-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 31838, "totalSubmissionRaw": 61885}, "2522": {"acRate": 46.32750329801268, "difficulty": "Medium", "likes": 370, "dislikes": 47, "categoryTitle": "Algorithms", "frontendQuestionId": "2522", "paidOnly": false, "title": "Partition String Into Substrings With Values at Most K", "titleSlug": "partition-string-into-substrings-with-values-at-most-k", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21773, "totalSubmissionRaw": 46998}, "2523": {"acRate": 37.70210909997196, "difficulty": "Medium", "likes": 364, "dislikes": 29, "categoryTitle": "Algorithms", "frontendQuestionId": "2523", "paidOnly": false, "title": "Closest Prime Numbers in Range", "titleSlug": "closest-prime-numbers-in-range", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24203, "totalSubmissionRaw": 64196}, "2524": {"acRate": 39.33333333333333, "difficulty": "Hard", "likes": 23, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "2524", "paidOnly": true, "title": "Maximum Frequency Score of a Subarray", "titleSlug": "maximum-frequency-score-of-a-subarray", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 944, "totalSubmissionRaw": 2400}, "2525": {"acRate": 35.9028355427332, "difficulty": "Easy", "likes": 196, "dislikes": 58, "categoryTitle": "Algorithms", "frontendQuestionId": "2525", "paidOnly": false, "title": "Categorize Box According to Criteria", "titleSlug": "categorize-box-according-to-criteria", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34098, "totalSubmissionRaw": 94973}, "2526": {"acRate": 49.521824879991065, "difficulty": "Medium", "likes": 310, "dislikes": 34, "categoryTitle": "Algorithms", "frontendQuestionId": "2526", "paidOnly": false, "title": "Find Consecutive Integers from a Data Stream", "titleSlug": "find-consecutive-integers-from-a-data-stream", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}, {"name": "Data Stream", "id": "VG9waWNUYWdOb2RlOjYxMDYz", "slug": "data-stream"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26616, "totalSubmissionRaw": 53746}, "2527": {"acRate": 68.82852292020374, "difficulty": "Medium", "likes": 360, "dislikes": 52, "categoryTitle": "Algorithms", "frontendQuestionId": "2527", "paidOnly": false, "title": "Find Xor-Beauty of Array", "titleSlug": "find-xor-beauty-of-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20270, "totalSubmissionRaw": 29450}, "2528": {"acRate": 32.74912368552829, "difficulty": "Hard", "likes": 458, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "2528", "paidOnly": false, "title": "Maximize the Minimum Powered City", "titleSlug": "maximize-the-minimum-powered-city", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7194, "totalSubmissionRaw": 21967}, "2529": {"acRate": 71.01362878216145, "difficulty": "Easy", "likes": 904, "dislikes": 53, "categoryTitle": "Algorithms", "frontendQuestionId": "2529", "paidOnly": false, "title": "Maximum Count of Positive Integer and Negative Integer", "titleSlug": "maximum-count-of-positive-integer-and-negative-integer", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 111975, "totalSubmissionRaw": 157681}, "2530": {"acRate": 46.17220664797757, "difficulty": "Medium", "likes": 390, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "2530", "paidOnly": false, "title": "Maximal Score After Applying K Operations", "titleSlug": "maximal-score-after-applying-k-operations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28823, "totalSubmissionRaw": 62425}, "2531": {"acRate": 26.472212252560666, "difficulty": "Medium", "likes": 563, "dislikes": 147, "categoryTitle": "Algorithms", "frontendQuestionId": "2531", "paidOnly": false, "title": "Make Number of Distinct Characters Equal", "titleSlug": "make-number-of-distinct-characters-equal", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19177, "totalSubmissionRaw": 72442}, "2532": {"acRate": 44.03834000421319, "difficulty": "Hard", "likes": 112, "dislikes": 217, "categoryTitle": "Algorithms", "frontendQuestionId": "2532", "paidOnly": false, "title": "Time to Cross a Bridge", "titleSlug": "time-to-cross-a-bridge", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4181, "totalSubmissionRaw": 9494}, "2533": {"acRate": 51.77134400147997, "difficulty": "Medium", "likes": 53, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "2533", "paidOnly": true, "title": "Number of Good Binary Strings", "titleSlug": "number-of-good-binary-strings", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5597, "totalSubmissionRaw": 10811}, "2534": {"acRate": 49.32933975778096, "difficulty": "Hard", "likes": 84, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "2534", "paidOnly": true, "title": "Time Taken to Cross the Door", "titleSlug": "time-taken-to-cross-the-door", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7576, "totalSubmissionRaw": 15358}, "2535": {"acRate": 84.51578630722656, "difficulty": "Easy", "likes": 696, "dislikes": 18, "categoryTitle": "Algorithms", "frontendQuestionId": "2535", "paidOnly": false, "title": "Difference Between Element Sum and Digit Sum of an Array", "titleSlug": "difference-between-element-sum-and-digit-sum-of-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 132049, "totalSubmissionRaw": 156242}, "2536": {"acRate": 49.951960255899515, "difficulty": "Medium", "likes": 460, "dislikes": 59, "categoryTitle": "Algorithms", "frontendQuestionId": "2536", "paidOnly": false, "title": "Increment Submatrices by One", "titleSlug": "increment-submatrices-by-one", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21316, "totalSubmissionRaw": 42673}, "2537": {"acRate": 51.21552800999327, "difficulty": "Medium", "likes": 853, "dislikes": 24, "categoryTitle": "Algorithms", "frontendQuestionId": "2537", "paidOnly": false, "title": "Count the Number of Good Subarrays", "titleSlug": "count-the-number-of-good-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21320, "totalSubmissionRaw": 41628}, "2538": {"acRate": 32.135297948550964, "difficulty": "Hard", "likes": 431, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "2538", "paidOnly": false, "title": "Difference Between Maximum and Minimum Price Sum", "titleSlug": "difference-between-maximum-and-minimum-price-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7895, "totalSubmissionRaw": 24568}, "2539": {"acRate": 52.287882271786614, "difficulty": "Medium", "likes": 28, "dislikes": 68, "categoryTitle": "Algorithms", "frontendQuestionId": "2539", "paidOnly": true, "title": "Count the Number of Good Subsequences", "titleSlug": "count-the-number-of-good-subsequences", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2274, "totalSubmissionRaw": 4349}, "2540": {"acRate": 58.741377800694636, "difficulty": "Easy", "likes": 1122, "dislikes": 37, "categoryTitle": "Algorithms", "frontendQuestionId": "2540", "paidOnly": false, "title": "Minimum Common Value", "titleSlug": "minimum-common-value", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 241514, "totalSubmissionRaw": 411148}, "2541": {"acRate": 31.674473886597216, "difficulty": "Medium", "likes": 413, "dislikes": 24, "categoryTitle": "Algorithms", "frontendQuestionId": "2541", "paidOnly": false, "title": "Minimum Operations to Make Array Equal II", "titleSlug": "minimum-operations-to-make-array-equal-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22652, "totalSubmissionRaw": 71515}, "2542": {"acRate": 53.82512580978577, "difficulty": "Medium", "likes": 2752, "dislikes": 164, "categoryTitle": "Algorithms", "frontendQuestionId": "2542", "paidOnly": false, "title": "Maximum Subsequence Score", "titleSlug": "maximum-subsequence-score", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 95299, "totalSubmissionRaw": 177053}, "2543": {"acRate": 42.74018908783606, "difficulty": "Hard", "likes": 246, "dislikes": 50, "categoryTitle": "Algorithms", "frontendQuestionId": "2543", "paidOnly": false, "title": "Check if Point Is Reachable", "titleSlug": "check-if-point-is-reachable", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8092, "totalSubmissionRaw": 18933}, "2544": {"acRate": 68.26777935912365, "difficulty": "Easy", "likes": 392, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "2544", "paidOnly": false, "title": "Alternating Digit Sum", "titleSlug": "alternating-digit-sum", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 63316, "totalSubmissionRaw": 92747}, "2545": {"acRate": 85.55915362906896, "difficulty": "Medium", "likes": 662, "dislikes": 47, "categoryTitle": "Algorithms", "frontendQuestionId": "2545", "paidOnly": false, "title": "Sort the Students by Their Kth Score", "titleSlug": "sort-the-students-by-their-kth-score", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 65789, "totalSubmissionRaw": 76893}, "2546": {"acRate": 41.27924512042742, "difficulty": "Medium", "likes": 250, "dislikes": 99, "categoryTitle": "Algorithms", "frontendQuestionId": "2546", "paidOnly": false, "title": "Apply Bitwise Operations to Make Strings Equal", "titleSlug": "apply-bitwise-operations-to-make-strings-equal", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19161, "totalSubmissionRaw": 46418}, "2547": {"acRate": 40.75562436180375, "difficulty": "Hard", "likes": 430, "dislikes": 24, "categoryTitle": "Algorithms", "frontendQuestionId": "2547", "paidOnly": false, "title": "Minimum Cost to Split an Array", "titleSlug": "minimum-cost-to-split-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12373, "totalSubmissionRaw": 30359}, "2548": {"acRate": 65.83732057416269, "difficulty": "Medium", "likes": 39, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "2548", "paidOnly": true, "title": "Maximum Price to Fill a Bag", "titleSlug": "maximum-price-to-fill-a-bag", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1376, "totalSubmissionRaw": 2090}, "2549": {"acRate": 60.54112921475448, "difficulty": "Easy", "likes": 265, "dislikes": 271, "categoryTitle": "Algorithms", "frontendQuestionId": "2549", "paidOnly": false, "title": "Count Distinct Numbers on Board", "titleSlug": "count-distinct-numbers-on-board", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 42805, "totalSubmissionRaw": 70704}, "2550": {"acRate": 27.771535327006646, "difficulty": "Medium", "likes": 240, "dislikes": 514, "categoryTitle": "Algorithms", "frontendQuestionId": "2550", "paidOnly": false, "title": "Count Collisions of Monkeys on a Polygon", "titleSlug": "count-collisions-of-monkeys-on-a-polygon", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20514, "totalSubmissionRaw": 73867}, "2551": {"acRate": 66.57053974885898, "difficulty": "Hard", "likes": 2037, "dislikes": 86, "categoryTitle": "Algorithms", "frontendQuestionId": "2551", "paidOnly": false, "title": "Put Marbles in Bags", "titleSlug": "put-marbles-in-bags", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 58634, "totalSubmissionRaw": 88078}, "2552": {"acRate": 33.53046594982079, "difficulty": "Hard", "likes": 374, "dislikes": 68, "categoryTitle": "Algorithms", "frontendQuestionId": "2552", "paidOnly": false, "title": "Count Increasing Quadruplets", "titleSlug": "count-increasing-quadruplets", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9355, "totalSubmissionRaw": 27900}, "2553": {"acRate": 79.54219402556826, "difficulty": "Easy", "likes": 487, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "2553", "paidOnly": false, "title": "Separate the Digits in an Array", "titleSlug": "separate-the-digits-in-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 74850, "totalSubmissionRaw": 94101}, "2554": {"acRate": 54.23494233233661, "difficulty": "Medium", "likes": 332, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "2554", "paidOnly": false, "title": "Maximum Number of Integers to Choose From a Range I", "titleSlug": "maximum-number-of-integers-to-choose-from-a-range-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 31741, "totalSubmissionRaw": 58525}, "2555": {"acRate": 33.43497871799759, "difficulty": "Medium", "likes": 545, "dislikes": 50, "categoryTitle": "Algorithms", "frontendQuestionId": "2555", "paidOnly": false, "title": "Maximize Win From Two Segments", "titleSlug": "maximize-win-from-two-segments", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10526, "totalSubmissionRaw": 31482}, "2556": {"acRate": 27.314257315977596, "difficulty": "Medium", "likes": 588, "dislikes": 28, "categoryTitle": "Algorithms", "frontendQuestionId": "2556", "paidOnly": false, "title": "Disconnect Path in a Binary Matrix by at Most One Flip", "titleSlug": "disconnect-path-in-a-binary-matrix-by-at-most-one-flip", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14289, "totalSubmissionRaw": 52316}, "2557": {"acRate": 40.06977323697981, "difficulty": "Medium", "likes": 33, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "2557", "paidOnly": true, "title": "Maximum Number of Integers to Choose From a Range II", "titleSlug": "maximum-number-of-integers-to-choose-from-a-range-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1608, "totalSubmissionRaw": 4013}, "2558": {"acRate": 67.0522136901246, "difficulty": "Easy", "likes": 379, "dislikes": 39, "categoryTitle": "Algorithms", "frontendQuestionId": "2558", "paidOnly": false, "title": "Take Gifts From the Richest Pile", "titleSlug": "take-gifts-from-the-richest-pile", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 48812, "totalSubmissionRaw": 72797}, "2559": {"acRate": 52.4204601524095, "difficulty": "Medium", "likes": 443, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "2559", "paidOnly": false, "title": "Count Vowel Strings in Ranges", "titleSlug": "count-vowel-strings-in-ranges", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28685, "totalSubmissionRaw": 54721}, "2560": {"acRate": 43.883193957377934, "difficulty": "Medium", "likes": 910, "dislikes": 31, "categoryTitle": "Algorithms", "frontendQuestionId": "2560", "paidOnly": false, "title": "House Robber IV", "titleSlug": "house-robber-iv", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19521, "totalSubmissionRaw": 44484}, "2561": {"acRate": 34.21666895510092, "difficulty": "Hard", "likes": 378, "dislikes": 18, "categoryTitle": "Algorithms", "frontendQuestionId": "2561", "paidOnly": false, "title": "Rearranging Fruits", "titleSlug": "rearranging-fruits", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9968, "totalSubmissionRaw": 29132}, "2562": {"acRate": 70.0143752355166, "difficulty": "Easy", "likes": 355, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "2562", "paidOnly": false, "title": "Find the Array Concatenation Value", "titleSlug": "find-the-array-concatenation-value", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 50166, "totalSubmissionRaw": 71651}, "2563": {"acRate": 33.05432421790655, "difficulty": "Medium", "likes": 801, "dislikes": 41, "categoryTitle": "Algorithms", "frontendQuestionId": "2563", "paidOnly": false, "title": "Count the Number of Fair Pairs", "titleSlug": "count-the-number-of-fair-pairs", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26024, "totalSubmissionRaw": 78731}, "2564": {"acRate": 33.69412761002461, "difficulty": "Medium", "likes": 368, "dislikes": 82, "categoryTitle": "Algorithms", "frontendQuestionId": "2564", "paidOnly": false, "title": "Substring XOR Queries", "titleSlug": "substring-xor-queries", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12732, "totalSubmissionRaw": 37787}, "2565": {"acRate": 31.816032667096493, "difficulty": "Hard", "likes": 375, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "2565", "paidOnly": false, "title": "Subsequence With the Minimum Score", "titleSlug": "subsequence-with-the-minimum-score", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7402, "totalSubmissionRaw": 23265}, "2566": {"acRate": 60.05288529040108, "difficulty": "Easy", "likes": 227, "dislikes": 41, "categoryTitle": "Algorithms", "frontendQuestionId": "2566", "paidOnly": false, "title": "Maximum Difference by Remapping a Digit", "titleSlug": "maximum-difference-by-remapping-a-digit", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25663, "totalSubmissionRaw": 42734}, "2567": {"acRate": 48.06838365896981, "difficulty": "Medium", "likes": 241, "dislikes": 222, "categoryTitle": "Algorithms", "frontendQuestionId": "2567", "paidOnly": false, "title": "Minimum Score by Changing Two Elements", "titleSlug": "minimum-score-by-changing-two-elements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17320, "totalSubmissionRaw": 36032}, "2568": {"acRate": 57.7063550036523, "difficulty": "Medium", "likes": 350, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "2568", "paidOnly": false, "title": "Minimum Impossible OR", "titleSlug": "minimum-impossible-or", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Brainteaser", "id": "VG9waWNUYWdOb2RlOjMy", "slug": "brainteaser"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15800, "totalSubmissionRaw": 27380}, "2569": {"acRate": 28.47080997966371, "difficulty": "Hard", "likes": 175, "dislikes": 24, "categoryTitle": "Algorithms", "frontendQuestionId": "2569", "paidOnly": false, "title": "Handling Sum Queries After Update", "titleSlug": "handling-sum-queries-after-update", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5740, "totalSubmissionRaw": 20161}, "2570": {"acRate": 73.78670266621667, "difficulty": "Easy", "likes": 334, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "2570", "paidOnly": false, "title": "Merge Two 2D Arrays by Summing Values", "titleSlug": "merge-two-2d-arrays-by-summing-values", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 43725, "totalSubmissionRaw": 59258}, "2571": {"acRate": 55.53263702675842, "difficulty": "Medium", "likes": 533, "dislikes": 192, "categoryTitle": "Algorithms", "frontendQuestionId": "2571", "paidOnly": false, "title": "Minimum Operations to Reduce an Integer to 0", "titleSlug": "minimum-operations-to-reduce-an-integer-to-0", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29615, "totalSubmissionRaw": 53329}, "2572": {"acRate": 23.250548021101825, "difficulty": "Medium", "likes": 457, "dislikes": 113, "categoryTitle": "Algorithms", "frontendQuestionId": "2572", "paidOnly": false, "title": "Count the Number of Square-Free Subsets", "titleSlug": "count-the-number-of-square-free-subsets", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9652, "totalSubmissionRaw": 41513}, "2573": {"acRate": 31.528783835303088, "difficulty": "Hard", "likes": 186, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2573", "paidOnly": false, "title": "Find the String with LCP", "titleSlug": "find-the-string-with-lcp", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4962, "totalSubmissionRaw": 15738}, "2574": {"acRate": 86.87209364796055, "difficulty": "Easy", "likes": 1049, "dislikes": 99, "categoryTitle": "Algorithms", "frontendQuestionId": "2574", "paidOnly": false, "title": "Left and Right Sum Differences", "titleSlug": "left-and-right-sum-differences", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 145529, "totalSubmissionRaw": 167521}, "2575": {"acRate": 33.001553420401585, "difficulty": "Medium", "likes": 526, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "2575", "paidOnly": false, "title": "Find the Divisibility Array of a String", "titleSlug": "find-the-divisibility-array-of-a-string", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28680, "totalSubmissionRaw": 86905}, "2576": {"acRate": 38.76568482505023, "difficulty": "Medium", "likes": 555, "dislikes": 27, "categoryTitle": "Algorithms", "frontendQuestionId": "2576", "paidOnly": false, "title": "Find the Maximum Number of Marked Indices", "titleSlug": "find-the-maximum-number-of-marked-indices", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20452, "totalSubmissionRaw": 52758}, "2577": {"acRate": 35.714072437371236, "difficulty": "Hard", "likes": 542, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "2577", "paidOnly": false, "title": "Minimum Time to Visit a Cell In a Grid", "titleSlug": "minimum-time-to-visit-a-cell-in-a-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11961, "totalSubmissionRaw": 33491}, "2578": {"acRate": 70.95640079587382, "difficulty": "Easy", "likes": 371, "dislikes": 29, "categoryTitle": "Algorithms", "frontendQuestionId": "2578", "paidOnly": false, "title": "Split With Minimum Sum", "titleSlug": "split-with-minimum-sum", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 36732, "totalSubmissionRaw": 51767}, "2579": {"acRate": 57.83816582152299, "difficulty": "Medium", "likes": 290, "dislikes": 23, "categoryTitle": "Algorithms", "frontendQuestionId": "2579", "paidOnly": false, "title": "Count Total Number of Colored Cells", "titleSlug": "count-total-number-of-colored-cells", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26690, "totalSubmissionRaw": 46146}, "2580": {"acRate": 36.3791196637912, "difficulty": "Medium", "likes": 313, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "2580", "paidOnly": false, "title": "Count Ways to Group Overlapping Ranges", "titleSlug": "count-ways-to-group-overlapping-ranges", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16447, "totalSubmissionRaw": 45210}, "2581": {"acRate": 46.02931524830453, "difficulty": "Hard", "likes": 297, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "2581", "paidOnly": false, "title": "Count Number of Possible Root Nodes", "titleSlug": "count-number-of-possible-root-nodes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6311, "totalSubmissionRaw": 13708}, "2582": {"acRate": 56.9861903350492, "difficulty": "Easy", "likes": 1008, "dislikes": 53, "categoryTitle": "Algorithms", "frontendQuestionId": "2582", "paidOnly": false, "title": "Pass the Pillow", "titleSlug": "pass-the-pillow", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 188418, "totalSubmissionRaw": 330638}, "2583": {"acRate": 47.75580702799285, "difficulty": "Medium", "likes": 553, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "2583", "paidOnly": false, "title": "Kth Largest Sum in a Binary Tree", "titleSlug": "kth-largest-sum-in-a-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 40091, "totalSubmissionRaw": 83950}, "2584": {"acRate": 23.207525077085204, "difficulty": "Hard", "likes": 303, "dislikes": 111, "categoryTitle": "Algorithms", "frontendQuestionId": "2584", "paidOnly": false, "title": "Split the Array to Make Coprime Products", "titleSlug": "split-the-array-to-make-coprime-products", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11892, "totalSubmissionRaw": 51242}, "2585": {"acRate": 57.57442340908321, "difficulty": "Hard", "likes": 470, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "2585", "paidOnly": false, "title": "Number of Ways to Earn Points", "titleSlug": "number-of-ways-to-earn-points", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17000, "totalSubmissionRaw": 29527}, "2586": {"acRate": 74.26249925864421, "difficulty": "Easy", "likes": 339, "dislikes": 24, "categoryTitle": "Algorithms", "frontendQuestionId": "2586", "paidOnly": false, "title": "Count the Number of Vowel Strings in Range", "titleSlug": "count-the-number-of-vowel-strings-in-range", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 62607, "totalSubmissionRaw": 84305}, "2587": {"acRate": 41.17861142217245, "difficulty": "Medium", "likes": 288, "dislikes": 48, "categoryTitle": "Algorithms", "frontendQuestionId": "2587", "paidOnly": false, "title": "Rearrange Array to Maximize Prefix Score", "titleSlug": "rearrange-array-to-maximize-prefix-score", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29418, "totalSubmissionRaw": 71440}, "2588": {"acRate": 50.64585127364649, "difficulty": "Medium", "likes": 500, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "2588", "paidOnly": false, "title": "Count the Number of Beautiful Subarrays", "titleSlug": "count-the-number-of-beautiful-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18232, "totalSubmissionRaw": 35999}, "2589": {"acRate": 39.49240219851277, "difficulty": "Hard", "likes": 424, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "2589", "paidOnly": false, "title": "Minimum Time to Complete All Tasks", "titleSlug": "minimum-time-to-complete-all-tasks", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9772, "totalSubmissionRaw": 24744}, "2590": {"acRate": 58.66976474005228, "difficulty": "Medium", "likes": 38, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "2590", "paidOnly": true, "title": "Design a Todo List", "titleSlug": "design-a-todo-list", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2020, "totalSubmissionRaw": 3443}, "2591": {"acRate": 19.233380013820685, "difficulty": "Easy", "likes": 301, "dislikes": 834, "categoryTitle": "Algorithms", "frontendQuestionId": "2591", "paidOnly": false, "title": "Distribute Money to Maximum Children", "titleSlug": "distribute-money-to-maximum-children", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 31451, "totalSubmissionRaw": 163523}, "2592": {"acRate": 58.08951707891637, "difficulty": "Medium", "likes": 436, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2592", "paidOnly": false, "title": "Maximize Greatness of an Array", "titleSlug": "maximize-greatness-of-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24659, "totalSubmissionRaw": 42450}, "2593": {"acRate": 52.70551653294094, "difficulty": "Medium", "likes": 362, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "2593", "paidOnly": false, "title": "Find Score of an Array After Marking All Elements", "titleSlug": "find-score-of-an-array-after-marking-all-elements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18984, "totalSubmissionRaw": 36019}, "2594": {"acRate": 44.93658244282433, "difficulty": "Medium", "likes": 579, "dislikes": 30, "categoryTitle": "Algorithms", "frontendQuestionId": "2594", "paidOnly": false, "title": "Minimum Time to Repair Cars", "titleSlug": "minimum-time-to-repair-cars", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17998, "totalSubmissionRaw": 40052}, "2595": {"acRate": 73.45161389770941, "difficulty": "Easy", "likes": 320, "dislikes": 109, "categoryTitle": "Algorithms", "frontendQuestionId": "2595", "paidOnly": false, "title": "Number of Even and Odd Bits", "titleSlug": "number-of-even-and-odd-bits", "topicTags": [{"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 47651, "totalSubmissionRaw": 64874}, "2596": {"acRate": 57.04879185766452, "difficulty": "Medium", "likes": 387, "dislikes": 56, "categoryTitle": "Algorithms", "frontendQuestionId": "2596", "paidOnly": false, "title": "Check Knight Tour Configuration", "titleSlug": "check-knight-tour-configuration", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29371, "totalSubmissionRaw": 51484}, "2597": {"acRate": 51.17646016601554, "difficulty": "Medium", "likes": 1191, "dislikes": 172, "categoryTitle": "Algorithms", "frontendQuestionId": "2597", "paidOnly": false, "title": "The Number of Beautiful Subsets", "titleSlug": "the-number-of-beautiful-subsets", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 115537, "totalSubmissionRaw": 225762}, "2598": {"acRate": 39.40261763006506, "difficulty": "Medium", "likes": 347, "dislikes": 43, "categoryTitle": "Algorithms", "frontendQuestionId": "2598", "paidOnly": false, "title": "Smallest Missing Non-negative Integer After Operations", "titleSlug": "smallest-missing-non-negative-integer-after-operations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15685, "totalSubmissionRaw": 39807}, "2599": {"acRate": 50.78561917443408, "difficulty": "Medium", "likes": 45, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "2599", "paidOnly": true, "title": "Make the Prefix Sum Non-negative", "titleSlug": "make-the-prefix-sum-non-negative", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1907, "totalSubmissionRaw": 3755}, "2600": {"acRate": 61.88996609055465, "difficulty": "Easy", "likes": 278, "dislikes": 26, "categoryTitle": "Algorithms", "frontendQuestionId": "2600", "paidOnly": false, "title": "K Items With the Maximum Sum", "titleSlug": "k-items-with-the-maximum-sum", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 41431, "totalSubmissionRaw": 66943}, "2601": {"acRate": 37.91570812766623, "difficulty": "Medium", "likes": 380, "dislikes": 38, "categoryTitle": "Algorithms", "frontendQuestionId": "2601", "paidOnly": false, "title": "Prime Subtraction Operation", "titleSlug": "prime-subtraction-operation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16976, "totalSubmissionRaw": 44773}, "2602": {"acRate": 35.694454866061385, "difficulty": "Medium", "likes": 709, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "2602", "paidOnly": false, "title": "Minimum Operations to Make All Array Elements Equal", "titleSlug": "minimum-operations-to-make-all-array-elements-equal", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19028, "totalSubmissionRaw": 53308}, "2603": {"acRate": 37.524567610062896, "difficulty": "Hard", "likes": 431, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "2603", "paidOnly": false, "title": "Collect Coins in a Tree", "titleSlug": "collect-coins-in-a-tree", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Topological Sort", "id": "VG9waWNUYWdOb2RlOjI2", "slug": "topological-sort"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7637, "totalSubmissionRaw": 20352}, "2604": {"acRate": 40.86642599277978, "difficulty": "Hard", "likes": 40, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "2604", "paidOnly": true, "title": "Minimum Time to Eat All Grains", "titleSlug": "minimum-time-to-eat-all-grains", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1132, "totalSubmissionRaw": 2770}, "2605": {"acRate": 54.2076813655761, "difficulty": "Easy", "likes": 295, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "2605", "paidOnly": false, "title": "Form Smallest Number From Two Digit Arrays", "titleSlug": "form-smallest-number-from-two-digit-arrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 38108, "totalSubmissionRaw": 70300}, "2606": {"acRate": 56.92342752962626, "difficulty": "Medium", "likes": 357, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "2606", "paidOnly": false, "title": "Find the Substring With Maximum Cost", "titleSlug": "find-the-substring-with-maximum-cost", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24978, "totalSubmissionRaw": 43880}, "2607": {"acRate": 37.09303957339321, "difficulty": "Medium", "likes": 461, "dislikes": 82, "categoryTitle": "Algorithms", "frontendQuestionId": "2607", "paidOnly": false, "title": "Make K-Subarray Sums Equal", "titleSlug": "make-k-subarray-sums-equal", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10573, "totalSubmissionRaw": 28504}, "2608": {"acRate": 36.497660535656664, "difficulty": "Hard", "likes": 506, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "2608", "paidOnly": false, "title": "Shortest Cycle in a Graph", "titleSlug": "shortest-cycle-in-a-graph", "topicTags": [{"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18097, "totalSubmissionRaw": 49584}, "2609": {"acRate": 46.52529268831456, "difficulty": "Easy", "likes": 363, "dislikes": 28, "categoryTitle": "Algorithms", "frontendQuestionId": "2609", "paidOnly": false, "title": "Find the Longest Balanced Substring of a Binary String", "titleSlug": "find-the-longest-balanced-substring-of-a-binary-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 31593, "totalSubmissionRaw": 67905}, "2610": {"acRate": 87.18122761903518, "difficulty": "Medium", "likes": 1603, "dislikes": 78, "categoryTitle": "Algorithms", "frontendQuestionId": "2610", "paidOnly": false, "title": "Convert an Array Into a 2D Array With Conditions", "titleSlug": "convert-an-array-into-a-2d-array-with-conditions", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 200366, "totalSubmissionRaw": 229827}, "2611": {"acRate": 46.01338596190149, "difficulty": "Medium", "likes": 618, "dislikes": 56, "categoryTitle": "Algorithms", "frontendQuestionId": "2611", "paidOnly": false, "title": "Mice and Cheese", "titleSlug": "mice-and-cheese", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26812, "totalSubmissionRaw": 58270}, "2612": {"acRate": 16.67605260542618, "difficulty": "Hard", "likes": 241, "dislikes": 71, "categoryTitle": "Algorithms", "frontendQuestionId": "2612", "paidOnly": false, "title": "Minimum Reverse Operations", "titleSlug": "minimum-reverse-operations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5034, "totalSubmissionRaw": 30187}, "2613": {"acRate": 42.6481909160893, "difficulty": "Hard", "likes": 17, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "2613", "paidOnly": true, "title": "Beautiful Pairs", "titleSlug": "beautiful-pairs", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 554, "totalSubmissionRaw": 1299}, "2614": {"acRate": 34.16608608729894, "difficulty": "Easy", "likes": 345, "dislikes": 40, "categoryTitle": "Algorithms", "frontendQuestionId": "2614", "paidOnly": false, "title": "Prime In Diagonal", "titleSlug": "prime-in-diagonal", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 45117, "totalSubmissionRaw": 132052}, "2615": {"acRate": 31.161132023713368, "difficulty": "Medium", "likes": 732, "dislikes": 90, "categoryTitle": "Algorithms", "frontendQuestionId": "2615", "paidOnly": false, "title": "Sum of Distances", "titleSlug": "sum-of-distances", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20447, "totalSubmissionRaw": 65617}, "2616": {"acRate": 43.955424065483655, "difficulty": "Medium", "likes": 2308, "dislikes": 247, "categoryTitle": "Algorithms", "frontendQuestionId": "2616", "paidOnly": false, "title": "Minimize the Maximum Difference of Pairs", "titleSlug": "minimize-the-maximum-difference-of-pairs", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 73246, "totalSubmissionRaw": 166637}, "2617": {"acRate": 24.95806680881308, "difficulty": "Hard", "likes": 377, "dislikes": 33, "categoryTitle": "Algorithms", "frontendQuestionId": "2617", "paidOnly": false, "title": "Minimum Number of Visited Cells in a Grid", "titleSlug": "minimum-number-of-visited-cells-in-a-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8779, "totalSubmissionRaw": 35175}, "2618": {"acRate": 27.610506840759374, "difficulty": "Medium", "likes": 265, "dislikes": 99, "categoryTitle": "JavaScript", "frontendQuestionId": "2618", "paidOnly": false, "title": "Check if Object Instance of Class", "titleSlug": "check-if-object-instance-of-class", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 23430, "totalSubmissionRaw": 84859}, "2619": {"acRate": 73.52987997070903, "difficulty": "Easy", "likes": 498, "dislikes": 21, "categoryTitle": "JavaScript", "frontendQuestionId": "2619", "paidOnly": false, "title": "Array Prototype Last", "titleSlug": "array-prototype-last", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 138567, "totalSubmissionRaw": 188451}, "2620": {"acRate": 81.17128719307084, "difficulty": "Easy", "likes": 1270, "dislikes": 104, "categoryTitle": "JavaScript", "frontendQuestionId": "2620", "paidOnly": false, "title": "Counter", "titleSlug": "counter", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 399602, "totalSubmissionRaw": 492295}, "2621": {"acRate": 86.94574122739218, "difficulty": "Easy", "likes": 584, "dislikes": 47, "categoryTitle": "JavaScript", "frontendQuestionId": "2621", "paidOnly": false, "title": "Sleep", "titleSlug": "sleep", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 140613, "totalSubmissionRaw": 161725}, "2622": {"acRate": 74.42471625905425, "difficulty": "Medium", "likes": 426, "dislikes": 29, "categoryTitle": "JavaScript", "frontendQuestionId": "2622", "paidOnly": false, "title": "Cache With Time Limit", "titleSlug": "cache-with-time-limit", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 45312, "totalSubmissionRaw": 60883}, "2623": {"acRate": 62.56487323480917, "difficulty": "Medium", "likes": 591, "dislikes": 86, "categoryTitle": "JavaScript", "frontendQuestionId": "2623", "paidOnly": false, "title": "Memoize", "titleSlug": "memoize", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 102831, "totalSubmissionRaw": 164359}, "2624": {"acRate": 65.55377602562523, "difficulty": "Medium", "likes": 100, "dislikes": 44, "categoryTitle": "JavaScript", "frontendQuestionId": "2624", "paidOnly": false, "title": "Snail Traversal", "titleSlug": "snail-traversal", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 10642, "totalSubmissionRaw": 16234}, "2625": {"acRate": 63.578491327861364, "difficulty": "Medium", "likes": 333, "dislikes": 25, "categoryTitle": "JavaScript", "frontendQuestionId": "2625", "paidOnly": false, "title": "Flatten Deeply Nested Array", "titleSlug": "flatten-deeply-nested-array", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 43145, "totalSubmissionRaw": 67861}, "2626": {"acRate": 84.7521859826785, "difficulty": "Easy", "likes": 583, "dislikes": 36, "categoryTitle": "JavaScript", "frontendQuestionId": "2626", "paidOnly": false, "title": "Array Reduce Transformation", "titleSlug": "array-reduce-transformation", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 163031, "totalSubmissionRaw": 192362}, "2627": {"acRate": 90.85235211923614, "difficulty": "Medium", "likes": 393, "dislikes": 44, "categoryTitle": "JavaScript", "frontendQuestionId": "2627", "paidOnly": false, "title": "Debounce", "titleSlug": "debounce", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 48765, "totalSubmissionRaw": 53675}, "2628": {"acRate": 38.717964401492445, "difficulty": "Medium", "likes": 213, "dislikes": 16, "categoryTitle": "JavaScript", "frontendQuestionId": "2628", "paidOnly": true, "title": "JSON Deep Equal", "titleSlug": "json-deep-equal", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 12660, "totalSubmissionRaw": 32698}, "2629": {"acRate": 86.27086148914103, "difficulty": "Easy", "likes": 657, "dislikes": 48, "categoryTitle": "JavaScript", "frontendQuestionId": "2629", "paidOnly": false, "title": "Function Composition", "titleSlug": "function-composition", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 137244, "totalSubmissionRaw": 159085}, "2630": {"acRate": 30.8595988538682, "difficulty": "Hard", "likes": 116, "dislikes": 41, "categoryTitle": "JavaScript", "frontendQuestionId": "2630", "paidOnly": false, "title": "Memoize II", "titleSlug": "memoize-ii", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 5385, "totalSubmissionRaw": 17450}, "2631": {"acRate": 80.80969552771478, "difficulty": "Medium", "likes": 303, "dislikes": 17, "categoryTitle": "JavaScript", "frontendQuestionId": "2631", "paidOnly": false, "title": "Group By", "titleSlug": "group-by", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 43474, "totalSubmissionRaw": 53798}, "2632": {"acRate": 89.2160570533254, "difficulty": "Medium", "likes": 343, "dislikes": 35, "categoryTitle": "JavaScript", "frontendQuestionId": "2632", "paidOnly": true, "title": "Curry", "titleSlug": "curry", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 16513, "totalSubmissionRaw": 18509}, "2633": {"acRate": 77.23337268791815, "difficulty": "Medium", "likes": 203, "dislikes": 12, "categoryTitle": "JavaScript", "frontendQuestionId": "2633", "paidOnly": true, "title": "Convert Object to JSON String", "titleSlug": "convert-object-to-json-string", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 11775, "totalSubmissionRaw": 15246}, "2634": {"acRate": 84.78197533262116, "difficulty": "Easy", "likes": 630, "dislikes": 78, "categoryTitle": "JavaScript", "frontendQuestionId": "2634", "paidOnly": false, "title": "Filter Elements from Array", "titleSlug": "filter-elements-from-array", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 174598, "totalSubmissionRaw": 205938}, "2635": {"acRate": 85.80662440853494, "difficulty": "Easy", "likes": 727, "dislikes": 70, "categoryTitle": "JavaScript", "frontendQuestionId": "2635", "paidOnly": false, "title": "Apply Transform Over Each Element in Array", "titleSlug": "apply-transform-over-each-element-in-array", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 192224, "totalSubmissionRaw": 224019}, "2636": {"acRate": 79.79254706108337, "difficulty": "Medium", "likes": 285, "dislikes": 27, "categoryTitle": "JavaScript", "frontendQuestionId": "2636", "paidOnly": true, "title": "Promise Pool", "titleSlug": "promise-pool", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 12462, "totalSubmissionRaw": 15618}, "2637": {"acRate": 81.49550402271652, "difficulty": "Medium", "likes": 477, "dislikes": 71, "categoryTitle": "JavaScript", "frontendQuestionId": "2637", "paidOnly": false, "title": "Promise Time Limit", "titleSlug": "promise-time-limit", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 55104, "totalSubmissionRaw": 67616}, "2638": {"acRate": 46.89129562775772, "difficulty": "Medium", "likes": 83, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "2638", "paidOnly": true, "title": "Count the Number of K-Free Subsets", "titleSlug": "count-the-number-of-k-free-subsets", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3507, "totalSubmissionRaw": 7479}, "2639": {"acRate": 67.83548324990375, "difficulty": "Easy", "likes": 168, "dislikes": 44, "categoryTitle": "Algorithms", "frontendQuestionId": "2639", "paidOnly": false, "title": "Find the Width of Columns of a Grid", "titleSlug": "find-the-width-of-columns-of-a-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28187, "totalSubmissionRaw": 41552}, "2640": {"acRate": 70.8601881163315, "difficulty": "Medium", "likes": 291, "dislikes": 35, "categoryTitle": "Algorithms", "frontendQuestionId": "2640", "paidOnly": false, "title": "Find the Score of All Prefixes of an Array", "titleSlug": "find-the-score-of-all-prefixes-of-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 31114, "totalSubmissionRaw": 43909}, "2641": {"acRate": 67.71973229295524, "difficulty": "Medium", "likes": 580, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "2641", "paidOnly": false, "title": "Cousins in Binary Tree II", "titleSlug": "cousins-in-binary-tree-ii", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21350, "totalSubmissionRaw": 31527}, "2642": {"acRate": 70.60512735142333, "difficulty": "Hard", "likes": 808, "dislikes": 57, "categoryTitle": "Algorithms", "frontendQuestionId": "2642", "paidOnly": false, "title": "Design Graph With Shortest Path Calculator", "titleSlug": "design-graph-with-shortest-path-calculator", "topicTags": [{"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 67860, "totalSubmissionRaw": 96112}, "2643": {"acRate": 75.41153581788738, "difficulty": "Easy", "likes": 451, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "2643", "paidOnly": false, "title": "Row With Maximum Ones", "titleSlug": "row-with-maximum-ones", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 64731, "totalSubmissionRaw": 85837}, "2644": {"acRate": 49.43413729128015, "difficulty": "Easy", "likes": 232, "dislikes": 57, "categoryTitle": "Algorithms", "frontendQuestionId": "2644", "paidOnly": false, "title": "Find the Maximum Divisibility Score", "titleSlug": "find-the-maximum-divisibility-score", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 31974, "totalSubmissionRaw": 64680}, "2645": {"acRate": 50.66446610621143, "difficulty": "Medium", "likes": 540, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "2645", "paidOnly": false, "title": "Minimum Additions to Make Valid String", "titleSlug": "minimum-additions-to-make-valid-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29470, "totalSubmissionRaw": 58167}, "2646": {"acRate": 45.88075880758807, "difficulty": "Hard", "likes": 473, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "2646", "paidOnly": false, "title": "Minimize the Total Price of the Trips", "titleSlug": "minimize-the-total-price-of-the-trips", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10158, "totalSubmissionRaw": 22140}, "2647": {"acRate": 66.59663865546219, "difficulty": "Hard", "likes": 10, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "2647", "paidOnly": true, "title": "Color the Triangle Red", "titleSlug": "color-the-triangle-red", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 317, "totalSubmissionRaw": 476}, "2648": {"acRate": 83.22701688555347, "difficulty": "Easy", "likes": 244, "dislikes": 28, "categoryTitle": "JavaScript", "frontendQuestionId": "2648", "paidOnly": false, "title": "Generate Fibonacci Sequence", "titleSlug": "generate-fibonacci-sequence", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 28834, "totalSubmissionRaw": 34645}, "2649": {"acRate": 79.11288281447735, "difficulty": "Medium", "likes": 160, "dislikes": 11, "categoryTitle": "JavaScript", "frontendQuestionId": "2649", "paidOnly": false, "title": "Nested Array Generator", "titleSlug": "nested-array-generator", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 12503, "totalSubmissionRaw": 15804}, "2650": {"acRate": 52.24529212940608, "difficulty": "Hard", "likes": 63, "dislikes": 15, "categoryTitle": "JavaScript", "frontendQuestionId": "2650", "paidOnly": false, "title": "Design Cancellable Function", "titleSlug": "design-cancellable-function", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2164, "totalSubmissionRaw": 4142}, "2651": {"acRate": 78.48102997715114, "difficulty": "Easy", "likes": 228, "dislikes": 47, "categoryTitle": "Algorithms", "frontendQuestionId": "2651", "paidOnly": false, "title": "Calculate Delayed Arrival Time", "titleSlug": "calculate-delayed-arrival-time", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 57361, "totalSubmissionRaw": 73089}, "2652": {"acRate": 85.68178186328598, "difficulty": "Easy", "likes": 489, "dislikes": 32, "categoryTitle": "Algorithms", "frontendQuestionId": "2652", "paidOnly": false, "title": "Sum Multiples", "titleSlug": "sum-multiples", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 112597, "totalSubmissionRaw": 131413}, "2653": {"acRate": 33.464291394941945, "difficulty": "Medium", "likes": 620, "dislikes": 124, "categoryTitle": "Algorithms", "frontendQuestionId": "2653", "paidOnly": false, "title": "Sliding Subarray Beauty", "titleSlug": "sliding-subarray-beauty", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21036, "totalSubmissionRaw": 62867}, "2654": {"acRate": 35.40611930442439, "difficulty": "Medium", "likes": 380, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "2654", "paidOnly": false, "title": "Minimum Number of Operations to Make All Array Elements Equal to 1", "titleSlug": "minimum-number-of-operations-to-make-all-array-elements-equal-to-1", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12868, "totalSubmissionRaw": 36344}, "2655": {"acRate": 52.10819411296739, "difficulty": "Medium", "likes": 26, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "2655", "paidOnly": true, "title": "Find Maximal Uncovered Ranges", "titleSlug": "find-maximal-uncovered-ranges", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1310, "totalSubmissionRaw": 2514}, "2656": {"acRate": 82.36327145007526, "difficulty": "Easy", "likes": 370, "dislikes": 49, "categoryTitle": "Algorithms", "frontendQuestionId": "2656", "paidOnly": false, "title": "Maximum Sum With Exactly K Elements ", "titleSlug": "maximum-sum-with-exactly-k-elements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 75500, "totalSubmissionRaw": 91668}, "2657": {"acRate": 81.46836771014819, "difficulty": "Medium", "likes": 478, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "2657", "paidOnly": false, "title": "Find the Prefix Common Array of Two Arrays", "titleSlug": "find-the-prefix-common-array-of-two-arrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 43487, "totalSubmissionRaw": 53379}, "2658": {"acRate": 60.058876911839576, "difficulty": "Medium", "likes": 433, "dislikes": 23, "categoryTitle": "Algorithms", "frontendQuestionId": "2658", "paidOnly": false, "title": "Maximum Number of Fish in a Grid", "titleSlug": "maximum-number-of-fish-in-a-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27134, "totalSubmissionRaw": 45179}, "2659": {"acRate": 25.586870715324423, "difficulty": "Hard", "likes": 538, "dislikes": 32, "categoryTitle": "Algorithms", "frontendQuestionId": "2659", "paidOnly": false, "title": "Make Array Empty", "titleSlug": "make-array-empty", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11085, "totalSubmissionRaw": 43323}, "2660": {"acRate": 34.293838306853495, "difficulty": "Easy", "likes": 272, "dislikes": 155, "categoryTitle": "Algorithms", "frontendQuestionId": "2660", "paidOnly": false, "title": "Determine the Winner of a Bowling Game", "titleSlug": "determine-the-winner-of-a-bowling-game", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 35097, "totalSubmissionRaw": 102342}, "2661": {"acRate": 50.70501856409828, "difficulty": "Medium", "likes": 430, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "2661", "paidOnly": false, "title": "First Completely Painted Row or Column", "titleSlug": "first-completely-painted-row-or-column", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24309, "totalSubmissionRaw": 47942}, "2662": {"acRate": 39.2556077356124, "difficulty": "Medium", "likes": 607, "dislikes": 83, "categoryTitle": "Algorithms", "frontendQuestionId": "2662", "paidOnly": false, "title": "Minimum Cost of a Path With Special Roads", "titleSlug": "minimum-cost-of-a-path-with-special-roads", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13458, "totalSubmissionRaw": 34283}, "2663": {"acRate": 37.71773906861002, "difficulty": "Hard", "likes": 191, "dislikes": 18, "categoryTitle": "Algorithms", "frontendQuestionId": "2663", "paidOnly": false, "title": "Lexicographically Smallest Beautiful String", "titleSlug": "lexicographically-smallest-beautiful-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5305, "totalSubmissionRaw": 14065}, "2664": {"acRate": 66.2568306010929, "difficulty": "Medium", "likes": 35, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "2664", "paidOnly": true, "title": "The Knight\u2019s Tour", "titleSlug": "the-knights-tour", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1455, "totalSubmissionRaw": 2196}, "2665": {"acRate": 80.18973171934884, "difficulty": "Easy", "likes": 721, "dislikes": 27, "categoryTitle": "JavaScript", "frontendQuestionId": "2665", "paidOnly": false, "title": "Counter II", "titleSlug": "counter-ii", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 211321, "totalSubmissionRaw": 263526}, "2666": {"acRate": 86.25982688795362, "difficulty": "Easy", "likes": 472, "dislikes": 54, "categoryTitle": "JavaScript", "frontendQuestionId": "2666", "paidOnly": false, "title": "Allow One Function Call", "titleSlug": "allow-one-function-call", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 108626, "totalSubmissionRaw": 125929}, "2667": {"acRate": 81.3297130196962, "difficulty": "Easy", "likes": 1265, "dislikes": 175, "categoryTitle": "JavaScript", "frontendQuestionId": "2667", "paidOnly": false, "title": "Create Hello World Function", "titleSlug": "create-hello-world-function", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 454089, "totalSubmissionRaw": 558331}, "2668": {"acRate": 72.1159420289855, "difficulty": "Easy", "likes": 19, "dislikes": 18, "categoryTitle": "Database", "frontendQuestionId": "2668", "paidOnly": true, "title": "Find Latest Salaries", "titleSlug": "find-latest-salaries", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 3732, "totalSubmissionRaw": 5175}, "2669": {"acRate": 72.66384778012684, "difficulty": "Easy", "likes": 16, "dislikes": 1, "categoryTitle": "Database", "frontendQuestionId": "2669", "paidOnly": true, "title": "Count Artist Occurrences On Spotify Ranking List", "titleSlug": "count-artist-occurrences-on-spotify-ranking-list", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3437, "totalSubmissionRaw": 4730}, "2670": {"acRate": 77.86534653465347, "difficulty": "Easy", "likes": 332, "dislikes": 32, "categoryTitle": "Algorithms", "frontendQuestionId": "2670", "paidOnly": false, "title": "Find the Distinct Difference Array", "titleSlug": "find-the-distinct-difference-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 39321, "totalSubmissionRaw": 50499}, "2671": {"acRate": 30.02378680571421, "difficulty": "Medium", "likes": 322, "dislikes": 28, "categoryTitle": "Algorithms", "frontendQuestionId": "2671", "paidOnly": false, "title": "Frequency Tracker", "titleSlug": "frequency-tracker", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22341, "totalSubmissionRaw": 74411}, "2672": {"acRate": 54.81427682091721, "difficulty": "Medium", "likes": 345, "dislikes": 96, "categoryTitle": "Algorithms", "frontendQuestionId": "2672", "paidOnly": false, "title": "Number of Adjacent Elements With the Same Color", "titleSlug": "number-of-adjacent-elements-with-the-same-color", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15849, "totalSubmissionRaw": 28914}, "2673": {"acRate": 59.253869089876474, "difficulty": "Medium", "likes": 596, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "2673", "paidOnly": false, "title": "Make Costs of Paths Equal in a Binary Tree", "titleSlug": "make-costs-of-paths-equal-in-a-binary-tree", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16693, "totalSubmissionRaw": 28172}, "2674": {"acRate": 74.53540934203917, "difficulty": "Medium", "likes": 39, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "2674", "paidOnly": true, "title": "Split a Circular Linked List", "titleSlug": "split-a-circular-linked-list", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1484, "totalSubmissionRaw": 1991}, "2675": {"acRate": 69.09624413145539, "difficulty": "Hard", "likes": 132, "dislikes": 72, "categoryTitle": "JavaScript", "frontendQuestionId": "2675", "paidOnly": true, "title": "Array of Objects to Matrix", "titleSlug": "array-of-objects-to-matrix", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 5887, "totalSubmissionRaw": 8520}, "2676": {"acRate": 82.67103283476413, "difficulty": "Medium", "likes": 162, "dislikes": 29, "categoryTitle": "JavaScript", "frontendQuestionId": "2676", "paidOnly": true, "title": "Throttle", "titleSlug": "throttle", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 9341, "totalSubmissionRaw": 11299}, "2677": {"acRate": 83.43841283688225, "difficulty": "Easy", "likes": 333, "dislikes": 5, "categoryTitle": "JavaScript", "frontendQuestionId": "2677", "paidOnly": false, "title": "Chunk Array", "titleSlug": "chunk-array", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 63127, "totalSubmissionRaw": 75657}, "2678": {"acRate": 81.79644006628979, "difficulty": "Easy", "likes": 702, "dislikes": 58, "categoryTitle": "Algorithms", "frontendQuestionId": "2678", "paidOnly": false, "title": "Number of Senior Citizens", "titleSlug": "number-of-senior-citizens", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 247278, "totalSubmissionRaw": 302309}, "2679": {"acRate": 60.089265940955, "difficulty": "Medium", "likes": 348, "dislikes": 58, "categoryTitle": "Algorithms", "frontendQuestionId": "2679", "paidOnly": false, "title": "Sum in a Matrix", "titleSlug": "sum-in-a-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 35273, "totalSubmissionRaw": 58701}, "2680": {"acRate": 41.01304322395742, "difficulty": "Medium", "likes": 389, "dislikes": 45, "categoryTitle": "Algorithms", "frontendQuestionId": "2680", "paidOnly": false, "title": "Maximum OR", "titleSlug": "maximum-or", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14024, "totalSubmissionRaw": 34194}, "2681": {"acRate": 30.953262222820417, "difficulty": "Hard", "likes": 313, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2681", "paidOnly": false, "title": "Power of Heroes", "titleSlug": "power-of-heroes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9199, "totalSubmissionRaw": 29719}, "2682": {"acRate": 49.2117415998726, "difficulty": "Easy", "likes": 247, "dislikes": 38, "categoryTitle": "Algorithms", "frontendQuestionId": "2682", "paidOnly": false, "title": "Find the Losers of the Circular Game", "titleSlug": "find-the-losers-of-the-circular-game", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27813, "totalSubmissionRaw": 56517}, "2683": {"acRate": 61.994002998500754, "difficulty": "Medium", "likes": 270, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "2683", "paidOnly": false, "title": "Neighboring Bitwise XOR", "titleSlug": "neighboring-bitwise-xor", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22329, "totalSubmissionRaw": 36018}, "2684": {"acRate": 46.01000790097445, "difficulty": "Medium", "likes": 432, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "2684", "paidOnly": false, "title": "Maximum Number of Moves in a Grid", "titleSlug": "maximum-number-of-moves-in-a-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24458, "totalSubmissionRaw": 53158}, "2685": {"acRate": 65.99545014302768, "difficulty": "Medium", "likes": 663, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2685", "paidOnly": false, "title": "Count the Number of Complete Components", "titleSlug": "count-the-number-of-complete-components", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29300, "totalSubmissionRaw": 44397}, "2686": {"acRate": 67.31437921865412, "difficulty": "Medium", "likes": 14, "dislikes": 1, "categoryTitle": "Database", "frontendQuestionId": "2686", "paidOnly": true, "title": "Immediate Food Delivery III", "titleSlug": "immediate-food-delivery-iii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3291, "totalSubmissionRaw": 4889}, "2687": {"acRate": 80.5111111111111, "difficulty": "Easy", "likes": 21, "dislikes": 3, "categoryTitle": "Database", "frontendQuestionId": "2687", "paidOnly": true, "title": "Bikes Last Time Used ", "titleSlug": "bikes-last-time-used", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3623, "totalSubmissionRaw": 4500}, "2688": {"acRate": 42.264835449598344, "difficulty": "Medium", "likes": 20, "dislikes": 8, "categoryTitle": "Database", "frontendQuestionId": "2688", "paidOnly": true, "title": "Find Active Users", "titleSlug": "find-active-users", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3262, "totalSubmissionRaw": 7718}, "2689": {"acRate": 74.20212765957447, "difficulty": "Easy", "likes": 36, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "2689", "paidOnly": true, "title": "Extract Kth Character From The Rope Tree", "titleSlug": "extract-kth-character-from-the-rope-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2790, "totalSubmissionRaw": 3760}, "2690": {"acRate": 93.01801801801803, "difficulty": "Easy", "likes": 27, "dislikes": 6, "categoryTitle": "JavaScript", "frontendQuestionId": "2690", "paidOnly": true, "title": "Infinite Method Object", "titleSlug": "infinite-method-object", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1239, "totalSubmissionRaw": 1332}, "2691": {"acRate": 37.23196881091618, "difficulty": "Hard", "likes": 11, "dislikes": 8, "categoryTitle": "JavaScript", "frontendQuestionId": "2691", "paidOnly": true, "title": "Immutability Helper", "titleSlug": "immutability-helper", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 191, "totalSubmissionRaw": 513}, "2692": {"acRate": 62.70096463022507, "difficulty": "Medium", "likes": 16, "dislikes": 0, "categoryTitle": "JavaScript", "frontendQuestionId": "2692", "paidOnly": true, "title": "Make Object Immutable", "titleSlug": "make-object-immutable", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 390, "totalSubmissionRaw": 622}, "2693": {"acRate": 79.8443579766537, "difficulty": "Medium", "likes": 139, "dislikes": 13, "categoryTitle": "JavaScript", "frontendQuestionId": "2693", "paidOnly": false, "title": "Call Function with Custom Context", "titleSlug": "call-function-with-custom-context", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 10260, "totalSubmissionRaw": 12850}, "2694": {"acRate": 74.326708220628, "difficulty": "Medium", "likes": 238, "dislikes": 28, "categoryTitle": "JavaScript", "frontendQuestionId": "2694", "paidOnly": false, "title": "Event Emitter", "titleSlug": "event-emitter", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 25280, "totalSubmissionRaw": 34012}, "2695": {"acRate": 88.15562723697583, "difficulty": "Easy", "likes": 226, "dislikes": 47, "categoryTitle": "JavaScript", "frontendQuestionId": "2695", "paidOnly": false, "title": "Array Wrapper", "titleSlug": "array-wrapper", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 39901, "totalSubmissionRaw": 45262}, "2696": {"acRate": 69.91284627454083, "difficulty": "Easy", "likes": 408, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "2696", "paidOnly": false, "title": "Minimum String Length After Removing Substrings", "titleSlug": "minimum-string-length-after-removing-substrings", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 53024, "totalSubmissionRaw": 75843}, "2697": {"acRate": 82.02514950315492, "difficulty": "Easy", "likes": 348, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "2697", "paidOnly": false, "title": "Lexicographically Smallest Palindrome", "titleSlug": "lexicographically-smallest-palindrome", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 54724, "totalSubmissionRaw": 66717}, "2698": {"acRate": 62.783914608415046, "difficulty": "Medium", "likes": 476, "dislikes": 30, "categoryTitle": "Algorithms", "frontendQuestionId": "2698", "paidOnly": false, "title": "Find the Punishment Number of an Integer", "titleSlug": "find-the-punishment-number-of-an-integer", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20234, "totalSubmissionRaw": 32228}, "2699": {"acRate": 24.77392523816432, "difficulty": "Hard", "likes": 275, "dislikes": 48, "categoryTitle": "Algorithms", "frontendQuestionId": "2699", "paidOnly": false, "title": "Modify Graph Edge Weights", "titleSlug": "modify-graph-edge-weights", "topicTags": [{"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5123, "totalSubmissionRaw": 20679}, "2700": {"acRate": 76.3838024484671, "difficulty": "Medium", "likes": 145, "dislikes": 30, "categoryTitle": "JavaScript", "frontendQuestionId": "2700", "paidOnly": true, "title": "Differences Between Two Objects", "titleSlug": "differences-between-two-objects", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 7300, "totalSubmissionRaw": 9557}, "2701": {"acRate": 32.51683306245647, "difficulty": "Hard", "likes": 46, "dislikes": 5, "categoryTitle": "Database", "frontendQuestionId": "2701", "paidOnly": true, "title": "Consecutive Transactions with Increasing Amounts", "titleSlug": "consecutive-transactions-with-increasing-amounts", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 2801, "totalSubmissionRaw": 8614}, "2702": {"acRate": 46.41803058760397, "difficulty": "Hard", "likes": 38, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "2702", "paidOnly": true, "title": "Minimum Operations to Make Numbers Non-positive", "titleSlug": "minimum-operations-to-make-numbers-non-positive", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1729, "totalSubmissionRaw": 3726}, "2703": {"acRate": 94.31459707484944, "difficulty": "Easy", "likes": 308, "dislikes": 153, "categoryTitle": "JavaScript", "frontendQuestionId": "2703", "paidOnly": false, "title": "Return Length of Arguments Passed", "titleSlug": "return-length-of-arguments-passed", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 157859, "totalSubmissionRaw": 167375}, "2704": {"acRate": 62.40582486291068, "difficulty": "Easy", "likes": 642, "dislikes": 155, "categoryTitle": "JavaScript", "frontendQuestionId": "2704", "paidOnly": false, "title": "To Be Or Not To Be", "titleSlug": "to-be-or-not-to-be", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 185044, "totalSubmissionRaw": 296513}, "2705": {"acRate": 65.01069711872412, "difficulty": "Medium", "likes": 175, "dislikes": 21, "categoryTitle": "JavaScript", "frontendQuestionId": "2705", "paidOnly": false, "title": "Compact Object", "titleSlug": "compact-object", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 23398, "totalSubmissionRaw": 35991}, "2706": {"acRate": 69.15492428512381, "difficulty": "Easy", "likes": 983, "dislikes": 68, "categoryTitle": "Algorithms", "frontendQuestionId": "2706", "paidOnly": false, "title": "Buy Two Chocolates", "titleSlug": "buy-two-chocolates", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 184042, "totalSubmissionRaw": 266130}, "2707": {"acRate": 52.56090808416389, "difficulty": "Medium", "likes": 2082, "dislikes": 94, "categoryTitle": "Algorithms", "frontendQuestionId": "2707", "paidOnly": false, "title": "Extra Characters in a String", "titleSlug": "extra-characters-in-a-string", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 87331, "totalSubmissionRaw": 166152}, "2708": {"acRate": 24.325147148366145, "difficulty": "Medium", "likes": 356, "dislikes": 58, "categoryTitle": "Algorithms", "frontendQuestionId": "2708", "paidOnly": false, "title": "Maximum Strength of a Group", "titleSlug": "maximum-strength-of-a-group", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28763, "totalSubmissionRaw": 118247}, "2709": {"acRate": 42.48237139988819, "difficulty": "Hard", "likes": 811, "dislikes": 135, "categoryTitle": "Algorithms", "frontendQuestionId": "2709", "paidOnly": false, "title": "Greatest Common Divisor Traversal", "titleSlug": "greatest-common-divisor-traversal", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 70669, "totalSubmissionRaw": 166349}, "2710": {"acRate": 78.86634506242906, "difficulty": "Easy", "likes": 315, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "2710", "paidOnly": false, "title": "Remove Trailing Zeros From a String", "titleSlug": "remove-trailing-zeros-from-a-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 66700, "totalSubmissionRaw": 84574}, "2711": {"acRate": 71.19406746103172, "difficulty": "Medium", "likes": 124, "dislikes": 206, "categoryTitle": "Algorithms", "frontendQuestionId": "2711", "paidOnly": false, "title": "Difference of Number of Distinct Values on Diagonals", "titleSlug": "difference-of-number-of-distinct-values-on-diagonals", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19777, "totalSubmissionRaw": 27779}, "2712": {"acRate": 54.605109659356046, "difficulty": "Medium", "likes": 531, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "2712", "paidOnly": false, "title": "Minimum Cost to Make All Characters Equal", "titleSlug": "minimum-cost-to-make-all-characters-equal", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18723, "totalSubmissionRaw": 34288}, "2713": {"acRate": 30.715429540316503, "difficulty": "Hard", "likes": 577, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "2713", "paidOnly": false, "title": "Maximum Strictly Increasing Cells in a Matrix", "titleSlug": "maximum-strictly-increasing-cells-in-a-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13043, "totalSubmissionRaw": 42464}, "2714": {"acRate": 61.7738913179263, "difficulty": "Hard", "likes": 30, "dislikes": 0, "categoryTitle": "Algorithms", "frontendQuestionId": "2714", "paidOnly": true, "title": "Find Shortest Path with K Hops", "titleSlug": "find-shortest-path-with-k-hops", "topicTags": [{"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 989, "totalSubmissionRaw": 1601}, "2715": {"acRate": 88.70750205811774, "difficulty": "Easy", "likes": 228, "dislikes": 290, "categoryTitle": "JavaScript", "frontendQuestionId": "2715", "paidOnly": false, "title": "Timeout Cancellation", "titleSlug": "timeout-cancellation", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 50644, "totalSubmissionRaw": 57091}, "2716": {"acRate": 76.42855227522591, "difficulty": "Easy", "likes": 324, "dislikes": 93, "categoryTitle": "Algorithms", "frontendQuestionId": "2716", "paidOnly": false, "title": "Minimize String Length", "titleSlug": "minimize-string-length", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 57005, "totalSubmissionRaw": 74586}, "2717": {"acRate": 64.03740061658283, "difficulty": "Easy", "likes": 207, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2717", "paidOnly": false, "title": "Semi-Ordered Permutation", "titleSlug": "semi-ordered-permutation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 31573, "totalSubmissionRaw": 49304}, "2718": {"acRate": 30.997541271513875, "difficulty": "Medium", "likes": 690, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "2718", "paidOnly": false, "title": "Sum of Matrix After Queries", "titleSlug": "sum-of-matrix-after-queries", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21180, "totalSubmissionRaw": 68328}, "2719": {"acRate": 34.629404617253954, "difficulty": "Hard", "likes": 525, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "2719", "paidOnly": false, "title": "Count of Integers", "titleSlug": "count-of-integers", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11115, "totalSubmissionRaw": 32097}, "2720": {"acRate": 51.40943343566844, "difficulty": "Hard", "likes": 13, "dislikes": 9, "categoryTitle": "Database", "frontendQuestionId": "2720", "paidOnly": true, "title": "Popularity Percentage", "titleSlug": "popularity-percentage", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1842, "totalSubmissionRaw": 3583}, "2721": {"acRate": 75.12442079972541, "difficulty": "Medium", "likes": 186, "dislikes": 45, "categoryTitle": "JavaScript", "frontendQuestionId": "2721", "paidOnly": false, "title": "Execute Asynchronous Functions in Parallel", "titleSlug": "execute-asynchronous-functions-in-parallel", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 26265, "totalSubmissionRaw": 34962}, "2722": {"acRate": 54.66728528346331, "difficulty": "Medium", "likes": 166, "dislikes": 52, "categoryTitle": "JavaScript", "frontendQuestionId": "2722", "paidOnly": false, "title": "Join Two Arrays by ID", "titleSlug": "join-two-arrays-by-id", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 30635, "totalSubmissionRaw": 56039}, "2723": {"acRate": 91.37426621029887, "difficulty": "Easy", "likes": 267, "dislikes": 27, "categoryTitle": "JavaScript", "frontendQuestionId": "2723", "paidOnly": false, "title": "Add Two Promises", "titleSlug": "add-two-promises", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 95572, "totalSubmissionRaw": 104594}, "2724": {"acRate": 82.55540802778062, "difficulty": "Easy", "likes": 169, "dislikes": 37, "categoryTitle": "JavaScript", "frontendQuestionId": "2724", "paidOnly": false, "title": "Sort By", "titleSlug": "sort-by", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 40415, "totalSubmissionRaw": 48955}, "2725": {"acRate": 80.7566144840997, "difficulty": "Easy", "likes": 158, "dislikes": 84, "categoryTitle": "JavaScript", "frontendQuestionId": "2725", "paidOnly": false, "title": "Interval Cancellation", "titleSlug": "interval-cancellation", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 41114, "totalSubmissionRaw": 50911}, "2726": {"acRate": 75.44476288325312, "difficulty": "Easy", "likes": 109, "dislikes": 19, "categoryTitle": "JavaScript", "frontendQuestionId": "2726", "paidOnly": false, "title": "Calculator with Method Chaining", "titleSlug": "calculator-with-method-chaining", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 27904, "totalSubmissionRaw": 36986}, "2727": {"acRate": 80.21523074001394, "difficulty": "Easy", "likes": 173, "dislikes": 11, "categoryTitle": "JavaScript", "frontendQuestionId": "2727", "paidOnly": false, "title": "Is Object Empty", "titleSlug": "is-object-empty", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 63358, "totalSubmissionRaw": 78985}, "2728": {"acRate": 84.88604558176729, "difficulty": "Easy", "likes": 52, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "2728", "paidOnly": true, "title": "Count Houses in a Circular Street", "titleSlug": "count-houses-in-a-circular-street", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2123, "totalSubmissionRaw": 2501}, "2729": {"acRate": 52.23235883613242, "difficulty": "Easy", "likes": 230, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "2729", "paidOnly": false, "title": "Check if The Number is Fascinating", "titleSlug": "check-if-the-number-is-fascinating", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 45345, "totalSubmissionRaw": 86814}, "2730": {"acRate": 37.063242215503536, "difficulty": "Medium", "likes": 286, "dislikes": 84, "categoryTitle": "Algorithms", "frontendQuestionId": "2730", "paidOnly": false, "title": "Find the Longest Semi-Repetitive Substring", "titleSlug": "find-the-longest-semi-repetitive-substring", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23782, "totalSubmissionRaw": 64166}, "2731": {"acRate": 27.99515271016904, "difficulty": "Medium", "likes": 484, "dislikes": 93, "categoryTitle": "Algorithms", "frontendQuestionId": "2731", "paidOnly": false, "title": "Movement of Robots", "titleSlug": "movement-of-robots", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Brainteaser", "id": "VG9waWNUYWdOb2RlOjMy", "slug": "brainteaser"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13630, "totalSubmissionRaw": 48687}, "2732": {"acRate": 45.88149329081971, "difficulty": "Hard", "likes": 208, "dislikes": 26, "categoryTitle": "Algorithms", "frontendQuestionId": "2732", "paidOnly": false, "title": "Find a Good Subset of the Matrix", "titleSlug": "find-a-good-subset-of-the-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6907, "totalSubmissionRaw": 15054}, "2733": {"acRate": 76.62118657059635, "difficulty": "Easy", "likes": 346, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "2733", "paidOnly": false, "title": "Neither Minimum nor Maximum", "titleSlug": "neither-minimum-nor-maximum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 94962, "totalSubmissionRaw": 123937}, "2734": {"acRate": 31.113733487620728, "difficulty": "Medium", "likes": 241, "dislikes": 184, "categoryTitle": "Algorithms", "frontendQuestionId": "2734", "paidOnly": false, "title": "Lexicographically Smallest String After Substring Operation", "titleSlug": "lexicographically-smallest-string-after-substring-operation", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27157, "totalSubmissionRaw": 87283}, "2735": {"acRate": 33.36777725025833, "difficulty": "Medium", "likes": 287, "dislikes": 537, "categoryTitle": "Algorithms", "frontendQuestionId": "2735", "paidOnly": false, "title": "Collecting Chocolates", "titleSlug": "collecting-chocolates", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11948, "totalSubmissionRaw": 35807}, "2736": {"acRate": 29.348107492362658, "difficulty": "Hard", "likes": 330, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "2736", "paidOnly": false, "title": "Maximum Sum Queries", "titleSlug": "maximum-sum-queries", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5668, "totalSubmissionRaw": 19313}, "2737": {"acRate": 57.362270450751254, "difficulty": "Medium", "likes": 34, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "2737", "paidOnly": true, "title": "Find the Closest Marked Node", "titleSlug": "find-the-closest-marked-node", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1718, "totalSubmissionRaw": 2995}, "2738": {"acRate": 55.55062659421094, "difficulty": "Medium", "likes": 20, "dislikes": 45, "categoryTitle": "Database", "frontendQuestionId": "2738", "paidOnly": true, "title": "Count Occurrences in Text", "titleSlug": "count-occurrences-in-text", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 5009, "totalSubmissionRaw": 9017}, "2739": {"acRate": 39.328891515770245, "difficulty": "Easy", "likes": 283, "dislikes": 96, "categoryTitle": "Algorithms", "frontendQuestionId": "2739", "paidOnly": false, "title": "Total Distance Traveled", "titleSlug": "total-distance-traveled", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 43917, "totalSubmissionRaw": 111666}, "2740": {"acRate": 65.4175984443364, "difficulty": "Medium", "likes": 283, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "2740", "paidOnly": false, "title": "Find the Value of the Partition", "titleSlug": "find-the-value-of-the-partition", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33641, "totalSubmissionRaw": 51425}, "2741": {"acRate": 28.558685352944675, "difficulty": "Medium", "likes": 556, "dislikes": 61, "categoryTitle": "Algorithms", "frontendQuestionId": "2741", "paidOnly": false, "title": "Special Permutations", "titleSlug": "special-permutations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14407, "totalSubmissionRaw": 50447}, "2742": {"acRate": 50.81474053647531, "difficulty": "Hard", "likes": 1370, "dislikes": 83, "categoryTitle": "Algorithms", "frontendQuestionId": "2742", "paidOnly": false, "title": "Painting the Walls", "titleSlug": "painting-the-walls", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 64864, "totalSubmissionRaw": 127648}, "2743": {"acRate": 76.67167109365978, "difficulty": "Medium", "likes": 83, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "2743", "paidOnly": true, "title": "Count Substrings Without Repeating Character", "titleSlug": "count-substrings-without-repeating-character", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 6639, "totalSubmissionRaw": 8659}, "2744": {"acRate": 81.57365627849344, "difficulty": "Easy", "likes": 354, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "2744", "paidOnly": false, "title": "Find Maximum Number of String Pairs", "titleSlug": "find-maximum-number-of-string-pairs", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 69781, "totalSubmissionRaw": 85544}, "2745": {"acRate": 53.9855945591346, "difficulty": "Medium", "likes": 308, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "2745", "paidOnly": false, "title": "Construct the Longest New String", "titleSlug": "construct-the-longest-new-string", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Brainteaser", "id": "VG9waWNUYWdOb2RlOjMy", "slug": "brainteaser"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20162, "totalSubmissionRaw": 37347}, "2746": {"acRate": 27.010777447312034, "difficulty": "Medium", "likes": 358, "dislikes": 32, "categoryTitle": "Algorithms", "frontendQuestionId": "2746", "paidOnly": false, "title": "Decremental String Concatenation", "titleSlug": "decremental-string-concatenation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8446, "totalSubmissionRaw": 31269}, "2747": {"acRate": 32.56231306081755, "difficulty": "Medium", "likes": 339, "dislikes": 38, "categoryTitle": "Algorithms", "frontendQuestionId": "2747", "paidOnly": false, "title": "Count Zero Request Servers", "titleSlug": "count-zero-request-servers", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6532, "totalSubmissionRaw": 20060}, "2748": {"acRate": 50.36721630040294, "difficulty": "Easy", "likes": 206, "dislikes": 36, "categoryTitle": "Algorithms", "frontendQuestionId": "2748", "paidOnly": false, "title": "Number of Beautiful Pairs", "titleSlug": "number-of-beautiful-pairs", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 35250, "totalSubmissionRaw": 69986}, "2749": {"acRate": 29.991900816148526, "difficulty": "Medium", "likes": 284, "dislikes": 286, "categoryTitle": "Algorithms", "frontendQuestionId": "2749", "paidOnly": false, "title": "Minimum Operations to Make the Integer Zero", "titleSlug": "minimum-operations-to-make-the-integer-zero", "topicTags": [{"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Brainteaser", "id": "VG9waWNUYWdOb2RlOjMy", "slug": "brainteaser"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9628, "totalSubmissionRaw": 32102}, "2750": {"acRate": 34.19032820078166, "difficulty": "Medium", "likes": 436, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "2750", "paidOnly": false, "title": "Ways to Split Array Into Good Subarrays", "titleSlug": "ways-to-split-array-into-good-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21783, "totalSubmissionRaw": 63711}, "2751": {"acRate": 57.13554613247551, "difficulty": "Hard", "likes": 1117, "dislikes": 97, "categoryTitle": "Algorithms", "frontendQuestionId": "2751", "paidOnly": false, "title": "Robot Collisions", "titleSlug": "robot-collisions", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 109410, "totalSubmissionRaw": 191492}, "2752": {"acRate": 37.912490833537035, "difficulty": "Hard", "likes": 12, "dislikes": 25, "categoryTitle": "Database", "frontendQuestionId": "2752", "paidOnly": true, "title": "Customers with Maximum Number of Transactions on Consecutive Days", "titleSlug": "customers-with-maximum-number-of-transactions-on-consecutive-days", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1551, "totalSubmissionRaw": 4091}, "2753": {"acRate": 67.6328502415459, "difficulty": "Hard", "likes": 27, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "2753", "paidOnly": true, "title": "Count Houses in a Circular Street II", "titleSlug": "count-houses-in-a-circular-street-ii", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 700, "totalSubmissionRaw": 1035}, "2754": {"acRate": 86.86440677966102, "difficulty": "Medium", "likes": 16, "dislikes": 0, "categoryTitle": "JavaScript", "frontendQuestionId": "2754", "paidOnly": true, "title": "Bind Function to Context", "titleSlug": "bind-function-to-context", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 615, "totalSubmissionRaw": 708}, "2755": {"acRate": 64.43037974683544, "difficulty": "Medium", "likes": 14, "dislikes": 4, "categoryTitle": "JavaScript", "frontendQuestionId": "2755", "paidOnly": true, "title": "Deep Merge of Two Objects", "titleSlug": "deep-merge-of-two-objects", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 509, "totalSubmissionRaw": 790}, "2756": {"acRate": 63.1004366812227, "difficulty": "Hard", "likes": 14, "dislikes": 5, "categoryTitle": "JavaScript", "frontendQuestionId": "2756", "paidOnly": true, "title": "Query Batching", "titleSlug": "query-batching", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 289, "totalSubmissionRaw": 458}, "2757": {"acRate": 71.24542124542124, "difficulty": "Medium", "likes": 11, "dislikes": 1, "categoryTitle": "JavaScript", "frontendQuestionId": "2757", "paidOnly": true, "title": "Generate Circular Array Values", "titleSlug": "generate-circular-array-values", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 389, "totalSubmissionRaw": 546}, "2758": {"acRate": 83.75224416517055, "difficulty": "Easy", "likes": 13, "dislikes": 1, "categoryTitle": "JavaScript", "frontendQuestionId": "2758", "paidOnly": true, "title": "Next Day", "titleSlug": "next-day", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 933, "totalSubmissionRaw": 1114}, "2759": {"acRate": 61.63522012578616, "difficulty": "Hard", "likes": 16, "dislikes": 3, "categoryTitle": "JavaScript", "frontendQuestionId": "2759", "paidOnly": true, "title": "Convert JSON String to Object", "titleSlug": "convert-json-string-to-object", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 490, "totalSubmissionRaw": 795}, "2760": {"acRate": 29.799262597296188, "difficulty": "Easy", "likes": 293, "dislikes": 270, "categoryTitle": "Algorithms", "frontendQuestionId": "2760", "paidOnly": false, "title": "Longest Even Odd Subarray With Threshold", "titleSlug": "longest-even-odd-subarray-with-threshold", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 36370, "totalSubmissionRaw": 122050}, "2761": {"acRate": 34.38644688644688, "difficulty": "Medium", "likes": 360, "dislikes": 33, "categoryTitle": "Algorithms", "frontendQuestionId": "2761", "paidOnly": false, "title": "Prime Pairs With Target Sum", "titleSlug": "prime-pairs-with-target-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30040, "totalSubmissionRaw": 87360}, "2762": {"acRate": 41.34819532908705, "difficulty": "Medium", "likes": 699, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "2762", "paidOnly": false, "title": "Continuous Subarrays", "titleSlug": "continuous-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}, {"name": "Monotonic Queue", "id": "VG9waWNUYWdOb2RlOjYxMDcx", "slug": "monotonic-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20254, "totalSubmissionRaw": 48984}, "2763": {"acRate": 46.72559985567382, "difficulty": "Hard", "likes": 305, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "2763", "paidOnly": false, "title": "Sum of Imbalance Numbers of All Subarrays", "titleSlug": "sum-of-imbalance-numbers-of-all-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7770, "totalSubmissionRaw": 16629}, "2764": {"acRate": 65.83333333333333, "difficulty": "Medium", "likes": 31, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "2764", "paidOnly": true, "title": "Is Array a Preorder of Some \u200cBinary Tree", "titleSlug": "is-array-a-preorder-of-some-binary-tree", "topicTags": [{"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1106, "totalSubmissionRaw": 1680}, "2765": {"acRate": 34.19655345672809, "difficulty": "Easy", "likes": 215, "dislikes": 174, "categoryTitle": "Algorithms", "frontendQuestionId": "2765", "paidOnly": false, "title": "Longest Alternating Subarray", "titleSlug": "longest-alternating-subarray", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25182, "totalSubmissionRaw": 73639}, "2766": {"acRate": 51.90977062476239, "difficulty": "Medium", "likes": 196, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "2766", "paidOnly": false, "title": "Relocate Marbles", "titleSlug": "relocate-marbles", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20481, "totalSubmissionRaw": 39455}, "2767": {"acRate": 53.56337392873252, "difficulty": "Medium", "likes": 351, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "2767", "paidOnly": false, "title": "Partition String Into Minimum Beautiful Substrings", "titleSlug": "partition-string-into-minimum-beautiful-substrings", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Backtracking", "id": "VG9waWNUYWdOb2RlOjE0", "slug": "backtracking"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16625, "totalSubmissionRaw": 31038}, "2768": {"acRate": 36.54305411616276, "difficulty": "Medium", "likes": 226, "dislikes": 23, "categoryTitle": "Algorithms", "frontendQuestionId": "2768", "paidOnly": false, "title": "Number of Black Blocks", "titleSlug": "number-of-black-blocks", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8110, "totalSubmissionRaw": 22193}, "2769": {"acRate": 90.68062306122788, "difficulty": "Easy", "likes": 352, "dislikes": 513, "categoryTitle": "Algorithms", "frontendQuestionId": "2769", "paidOnly": false, "title": "Find the Maximum Achievable Number", "titleSlug": "find-the-maximum-achievable-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 109329, "totalSubmissionRaw": 120565}, "2770": {"acRate": 31.32019423021994, "difficulty": "Medium", "likes": 422, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "2770", "paidOnly": false, "title": "Maximum Number of Jumps to Reach the Last Index", "titleSlug": "maximum-number-of-jumps-to-reach-the-last-index", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27413, "totalSubmissionRaw": 87525}, "2771": {"acRate": 29.606856274630832, "difficulty": "Medium", "likes": 588, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "2771", "paidOnly": false, "title": "Longest Non-decreasing Subarray From Two Arrays", "titleSlug": "longest-non-decreasing-subarray-from-two-arrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24942, "totalSubmissionRaw": 84244}, "2772": {"acRate": 33.367214697735875, "difficulty": "Medium", "likes": 384, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "2772", "paidOnly": false, "title": "Apply Operations to Make All Array Elements Equal to Zero", "titleSlug": "apply-operations-to-make-all-array-elements-equal-to-zero", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13131, "totalSubmissionRaw": 39353}, "2773": {"acRate": 74.87875848690592, "difficulty": "Medium", "likes": 10, "dislikes": 36, "categoryTitle": "Algorithms", "frontendQuestionId": "2773", "paidOnly": true, "title": "Height of Special Binary Tree", "titleSlug": "height-of-special-binary-tree", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 772, "totalSubmissionRaw": 1031}, "2774": {"acRate": 81.6775728732897, "difficulty": "Easy", "likes": 21, "dislikes": 2, "categoryTitle": "JavaScript", "frontendQuestionId": "2774", "paidOnly": true, "title": "Array Upper Bound", "titleSlug": "array-upper-bound", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1373, "totalSubmissionRaw": 1681}, "2775": {"acRate": 68.50490196078431, "difficulty": "Medium", "likes": 15, "dislikes": 1, "categoryTitle": "JavaScript", "frontendQuestionId": "2775", "paidOnly": true, "title": "Undefined to Null", "titleSlug": "undefined-to-null", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 559, "totalSubmissionRaw": 816}, "2776": {"acRate": 91.69764560099132, "difficulty": "Medium", "likes": 17, "dislikes": 9, "categoryTitle": "JavaScript", "frontendQuestionId": "2776", "paidOnly": true, "title": "Convert Callback Based Function to Promise Based Function", "titleSlug": "convert-callback-based-function-to-promise-based-function", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 740, "totalSubmissionRaw": 807}, "2777": {"acRate": 80.67940552016985, "difficulty": "Medium", "likes": 10, "dislikes": 2, "categoryTitle": "JavaScript", "frontendQuestionId": "2777", "paidOnly": true, "title": "Date Range Generator", "titleSlug": "date-range-generator", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 380, "totalSubmissionRaw": 471}, "2778": {"acRate": 81.59514114471337, "difficulty": "Easy", "likes": 276, "dislikes": 109, "categoryTitle": "Algorithms", "frontendQuestionId": "2778", "paidOnly": false, "title": "Sum of Squares of Special Elements ", "titleSlug": "sum-of-squares-of-special-elements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 71336, "totalSubmissionRaw": 87427}, "2779": {"acRate": 38.46614829130897, "difficulty": "Medium", "likes": 611, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "2779", "paidOnly": false, "title": "Maximum Beauty of an Array After Applying Operation", "titleSlug": "maximum-beauty-of-an-array-after-applying-operation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25675, "totalSubmissionRaw": 66747}, "2780": {"acRate": 62.3072097035604, "difficulty": "Medium", "likes": 333, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "2780", "paidOnly": false, "title": "Minimum Index of a Valid Split", "titleSlug": "minimum-index-of-a-valid-split", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23835, "totalSubmissionRaw": 38254}, "2781": {"acRate": 37.94550022237448, "difficulty": "Hard", "likes": 556, "dislikes": 23, "categoryTitle": "Algorithms", "frontendQuestionId": "2781", "paidOnly": false, "title": "Length of the Longest Valid Substring", "titleSlug": "length-of-the-longest-valid-substring", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 31567, "totalSubmissionRaw": 83189}, "2782": {"acRate": 83.4785903751421, "difficulty": "Medium", "likes": 33, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "2782", "paidOnly": true, "title": "Number of Unique Categories", "titleSlug": "number-of-unique-categories", "topicTags": [{"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 2203, "totalSubmissionRaw": 2639}, "2783": {"acRate": 37.623906705539355, "difficulty": "Medium", "likes": 17, "dislikes": 5, "categoryTitle": "Database", "frontendQuestionId": "2783", "paidOnly": true, "title": "Flight Occupancy and Waitlist Analysis", "titleSlug": "flight-occupancy-and-waitlist-analysis", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 2581, "totalSubmissionRaw": 6860}, "2784": {"acRate": 49.34914979916905, "difficulty": "Easy", "likes": 270, "dislikes": 50, "categoryTitle": "Algorithms", "frontendQuestionId": "2784", "paidOnly": false, "title": "Check if Array is Good", "titleSlug": "check-if-array-is-good", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 50005, "totalSubmissionRaw": 101329}, "2785": {"acRate": 81.31898671467668, "difficulty": "Medium", "likes": 990, "dislikes": 57, "categoryTitle": "Algorithms", "frontendQuestionId": "2785", "paidOnly": false, "title": "Sort Vowels in a String", "titleSlug": "sort-vowels-in-a-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 134600, "totalSubmissionRaw": 165521}, "2786": {"acRate": 36.199443141852285, "difficulty": "Medium", "likes": 475, "dislikes": 26, "categoryTitle": "Algorithms", "frontendQuestionId": "2786", "paidOnly": false, "title": "Visit Array Positions to Maximize Score", "titleSlug": "visit-array-positions-to-maximize-score", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19762, "totalSubmissionRaw": 54592}, "2787": {"acRate": 33.94840527000766, "difficulty": "Medium", "likes": 402, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "2787", "paidOnly": false, "title": "Ways to Express an Integer as Sum of Powers", "titleSlug": "ways-to-express-an-integer-as-sum-of-powers", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19042, "totalSubmissionRaw": 56091}, "2788": {"acRate": 74.43802612094612, "difficulty": "Easy", "likes": 310, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "2788", "paidOnly": false, "title": "Split Strings by Separator", "titleSlug": "split-strings-by-separator", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 55798, "totalSubmissionRaw": 74959}, "2789": {"acRate": 47.30411892226696, "difficulty": "Medium", "likes": 464, "dislikes": 31, "categoryTitle": "Algorithms", "frontendQuestionId": "2789", "paidOnly": false, "title": "Largest Element in an Array after Merge Operations", "titleSlug": "largest-element-in-an-array-after-merge-operations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30549, "totalSubmissionRaw": 64580}, "2790": {"acRate": 20.205486890978996, "difficulty": "Hard", "likes": 400, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "2790", "paidOnly": false, "title": "Maximum Number of Groups With Increasing Length", "titleSlug": "maximum-number-of-groups-with-increasing-length", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9302, "totalSubmissionRaw": 46037}, "2791": {"acRate": 48.554446727326095, "difficulty": "Hard", "likes": 384, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "2791", "paidOnly": false, "title": "Count Paths That Can Form a Palindrome in a Tree", "titleSlug": "count-paths-that-can-form-a-palindrome-in-a-tree", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6617, "totalSubmissionRaw": 13628}, "2792": {"acRate": 58.723404255319146, "difficulty": "Hard", "likes": 19, "dislikes": 0, "categoryTitle": "Algorithms", "frontendQuestionId": "2792", "paidOnly": true, "title": "Count Nodes That Are Great Enough", "titleSlug": "count-nodes-that-are-great-enough", "topicTags": [{"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 828, "totalSubmissionRaw": 1410}, "2793": {"acRate": 74.89557226399332, "difficulty": "Hard", "likes": 10, "dislikes": 20, "categoryTitle": "Database", "frontendQuestionId": "2793", "paidOnly": true, "title": "Status of Flight Tickets", "titleSlug": "status-of-flight-tickets", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1793, "totalSubmissionRaw": 2394}, "2794": {"acRate": 63.67684478371501, "difficulty": "Easy", "likes": 9, "dislikes": 3, "categoryTitle": "JavaScript", "frontendQuestionId": "2794", "paidOnly": true, "title": "Create Object from Two Arrays", "titleSlug": "create-object-from-two-arrays", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1001, "totalSubmissionRaw": 1572}, "2795": {"acRate": 87.93893129770993, "difficulty": "Medium", "likes": 13, "dislikes": 5, "categoryTitle": "JavaScript", "frontendQuestionId": "2795", "paidOnly": true, "title": "Parallel Execution of Promises for Individual Results Retrieval", "titleSlug": "parallel-execution-of-promises-for-individual-results-retrieval", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 576, "totalSubmissionRaw": 655}, "2796": {"acRate": 92.7710843373494, "difficulty": "Easy", "likes": 25, "dislikes": 2, "categoryTitle": "JavaScript", "frontendQuestionId": "2796", "paidOnly": true, "title": "Repeat String", "titleSlug": "repeat-string", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 2310, "totalSubmissionRaw": 2490}, "2797": {"acRate": 90.57971014492753, "difficulty": "Easy", "likes": 10, "dislikes": 4, "categoryTitle": "JavaScript", "frontendQuestionId": "2797", "paidOnly": true, "title": "Partial Function with Placeholders", "titleSlug": "partial-function-with-placeholders", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1000, "totalSubmissionRaw": 1104}, "2798": {"acRate": 87.77933514928729, "difficulty": "Easy", "likes": 497, "dislikes": 68, "categoryTitle": "Algorithms", "frontendQuestionId": "2798", "paidOnly": false, "title": "Number of Employees Who Met the Target", "titleSlug": "number-of-employees-who-met-the-target", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 165960, "totalSubmissionRaw": 189065}, "2799": {"acRate": 65.24837327408348, "difficulty": "Medium", "likes": 558, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "2799", "paidOnly": false, "title": "Count Complete Subarrays in an Array", "titleSlug": "count-complete-subarrays-in-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 41113, "totalSubmissionRaw": 63010}, "2800": {"acRate": 30.660074358125865, "difficulty": "Medium", "likes": 323, "dislikes": 262, "categoryTitle": "Algorithms", "frontendQuestionId": "2800", "paidOnly": false, "title": "Shortest String That Contains Three Strings", "titleSlug": "shortest-string-that-contains-three-strings", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15751, "totalSubmissionRaw": 51373}, "2801": {"acRate": 28.111694578484247, "difficulty": "Hard", "likes": 332, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "2801", "paidOnly": false, "title": "Count Stepping Numbers in Range", "titleSlug": "count-stepping-numbers-in-range", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7923, "totalSubmissionRaw": 28184}, "2802": {"acRate": 77.20229555236729, "difficulty": "Medium", "likes": 58, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "2802", "paidOnly": true, "title": "Find The K-th Lucky Number", "titleSlug": "find-the-k-th-lucky-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 5381, "totalSubmissionRaw": 6970}, "2803": {"acRate": 86.23762376237623, "difficulty": "Easy", "likes": 18, "dislikes": 1, "categoryTitle": "JavaScript", "frontendQuestionId": "2803", "paidOnly": true, "title": "Factorial Generator", "titleSlug": "factorial-generator", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 871, "totalSubmissionRaw": 1010}, "2804": {"acRate": 89.16155419222905, "difficulty": "Easy", "likes": 8, "dislikes": 9, "categoryTitle": "JavaScript", "frontendQuestionId": "2804", "paidOnly": true, "title": "Array Prototype ForEach", "titleSlug": "array-prototype-foreach", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 872, "totalSubmissionRaw": 978}, "2805": {"acRate": 81.6, "difficulty": "Medium", "likes": 16, "dislikes": 7, "categoryTitle": "JavaScript", "frontendQuestionId": "2805", "paidOnly": true, "title": "Custom Interval", "titleSlug": "custom-interval", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 408, "totalSubmissionRaw": 500}, "2806": {"acRate": 52.89066206074465, "difficulty": "Easy", "likes": 253, "dislikes": 47, "categoryTitle": "Algorithms", "frontendQuestionId": "2806", "paidOnly": false, "title": "Account Balance After Rounded Purchase", "titleSlug": "account-balance-after-rounded-purchase", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 43483, "totalSubmissionRaw": 82213}, "2807": {"acRate": 88.83294170303235, "difficulty": "Medium", "likes": 539, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "2807", "paidOnly": false, "title": "Insert Greatest Common Divisors in Linked List", "titleSlug": "insert-greatest-common-divisors-in-linked-list", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 79389, "totalSubmissionRaw": 89369}, "2808": {"acRate": 26.961924265037656, "difficulty": "Medium", "likes": 513, "dislikes": 30, "categoryTitle": "Algorithms", "frontendQuestionId": "2808", "paidOnly": false, "title": "Minimum Seconds to Equalize a Circular Array", "titleSlug": "minimum-seconds-to-equalize-a-circular-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15536, "totalSubmissionRaw": 57622}, "2809": {"acRate": 26.43655359386365, "difficulty": "Hard", "likes": 233, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "2809", "paidOnly": false, "title": "Minimum Time to Make Array Sum At Most x", "titleSlug": "minimum-time-to-make-array-sum-at-most-x", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3998, "totalSubmissionRaw": 15123}, "2810": {"acRate": 83.95822668168323, "difficulty": "Easy", "likes": 426, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "2810", "paidOnly": false, "title": "Faulty Keyboard", "titleSlug": "faulty-keyboard", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 82002, "totalSubmissionRaw": 97670}, "2811": {"acRate": 33.812866843135, "difficulty": "Medium", "likes": 498, "dislikes": 99, "categoryTitle": "Algorithms", "frontendQuestionId": "2811", "paidOnly": false, "title": "Check if it is Possible to Split Array", "titleSlug": "check-if-it-is-possible-to-split-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29380, "totalSubmissionRaw": 86890}, "2812": {"acRate": 49.015708060208155, "difficulty": "Medium", "likes": 1583, "dislikes": 293, "categoryTitle": "Algorithms", "frontendQuestionId": "2812", "paidOnly": false, "title": "Find the Safest Path in a Grid", "titleSlug": "find-the-safest-path-in-a-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 94143, "totalSubmissionRaw": 192067}, "2813": {"acRate": 33.14282824195833, "difficulty": "Hard", "likes": 306, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "2813", "paidOnly": false, "title": "Maximum Elegance of a K-Length Subsequence", "titleSlug": "maximum-elegance-of-a-k-length-subsequence", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6553, "totalSubmissionRaw": 19772}, "2814": {"acRate": 63.957597173144876, "difficulty": "Hard", "likes": 20, "dislikes": 0, "categoryTitle": "Algorithms", "frontendQuestionId": "2814", "paidOnly": true, "title": "Minimum Time Takes to Reach Destination Without Drowning", "titleSlug": "minimum-time-takes-to-reach-destination-without-drowning", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 905, "totalSubmissionRaw": 1415}, "2815": {"acRate": 58.273100460875916, "difficulty": "Easy", "likes": 376, "dislikes": 121, "categoryTitle": "Algorithms", "frontendQuestionId": "2815", "paidOnly": false, "title": "Max Pair Sum in an Array", "titleSlug": "max-pair-sum-in-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 46277, "totalSubmissionRaw": 79414}, "2816": {"acRate": 61.591890713665556, "difficulty": "Medium", "likes": 1138, "dislikes": 30, "categoryTitle": "Algorithms", "frontendQuestionId": "2816", "paidOnly": false, "title": "Double a Number Represented as a Linked List", "titleSlug": "double-a-number-represented-as-a-linked-list", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 168128, "totalSubmissionRaw": 272971}, "2817": {"acRate": 34.03246492466738, "difficulty": "Medium", "likes": 671, "dislikes": 72, "categoryTitle": "Algorithms", "frontendQuestionId": "2817", "paidOnly": false, "title": "Minimum Absolute Difference Between Elements With Constraint", "titleSlug": "minimum-absolute-difference-between-elements-with-constraint", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26270, "totalSubmissionRaw": 77191}, "2818": {"acRate": 32.62307474251158, "difficulty": "Hard", "likes": 325, "dislikes": 10, "categoryTitle": "Algorithms", "frontendQuestionId": "2818", "paidOnly": false, "title": "Apply Operations to Maximize Score", "titleSlug": "apply-operations-to-maximize-score", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6905, "totalSubmissionRaw": 21166}, "2819": {"acRate": 51.93370165745856, "difficulty": "Hard", "likes": 16, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "2819", "paidOnly": true, "title": "Minimum Relative Loss After Buying Chocolates", "titleSlug": "minimum-relative-loss-after-buying-chocolates", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 376, "totalSubmissionRaw": 724}, "2820": {"acRate": 66.3296568627451, "difficulty": "Medium", "likes": 19, "dislikes": 3, "categoryTitle": "Database", "frontendQuestionId": "2820", "paidOnly": true, "title": "Election Results", "titleSlug": "election-results", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2165, "totalSubmissionRaw": 3264}, "2821": {"acRate": 65.97374179431073, "difficulty": "Medium", "likes": 16, "dislikes": 5, "categoryTitle": "JavaScript", "frontendQuestionId": "2821", "paidOnly": true, "title": "Delay the Resolution of Each Promise", "titleSlug": "delay-the-resolution-of-each-promise", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 603, "totalSubmissionRaw": 914}, "2822": {"acRate": 57.97317436661699, "difficulty": "Easy", "likes": 15, "dislikes": 1, "categoryTitle": "JavaScript", "frontendQuestionId": "2822", "paidOnly": true, "title": "Inversion of Object", "titleSlug": "inversion-of-object", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 778, "totalSubmissionRaw": 1342}, "2823": {"acRate": 52.60869565217391, "difficulty": "Medium", "likes": 14, "dislikes": 3, "categoryTitle": "JavaScript", "frontendQuestionId": "2823", "paidOnly": true, "title": "Deep Object Filter", "titleSlug": "deep-object-filter", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 363, "totalSubmissionRaw": 690}, "2824": {"acRate": 87.36298397053986, "difficulty": "Easy", "likes": 594, "dislikes": 66, "categoryTitle": "Algorithms", "frontendQuestionId": "2824", "paidOnly": false, "title": "Count Pairs Whose Sum is Less than Target", "titleSlug": "count-pairs-whose-sum-is-less-than-target", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 162031, "totalSubmissionRaw": 185469}, "2825": {"acRate": 49.478317115698296, "difficulty": "Medium", "likes": 321, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "2825", "paidOnly": false, "title": "Make String a Subsequence Using Cyclic Increments", "titleSlug": "make-string-a-subsequence-using-cyclic-increments", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 35187, "totalSubmissionRaw": 71116}, "2826": {"acRate": 42.2685827135594, "difficulty": "Medium", "likes": 494, "dislikes": 91, "categoryTitle": "Algorithms", "frontendQuestionId": "2826", "paidOnly": false, "title": "Sorting Three Groups", "titleSlug": "sorting-three-groups", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20118, "totalSubmissionRaw": 47597}, "2827": {"acRate": 18.202697705198826, "difficulty": "Hard", "likes": 350, "dislikes": 36, "categoryTitle": "Algorithms", "frontendQuestionId": "2827", "paidOnly": false, "title": "Number of Beautiful Integers in the Range", "titleSlug": "number-of-beautiful-integers-in-the-range", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9352, "totalSubmissionRaw": 51377}, "2828": {"acRate": 83.12912264824129, "difficulty": "Easy", "likes": 318, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "2828", "paidOnly": false, "title": "Check if a String Is an Acronym of Words", "titleSlug": "check-if-a-string-is-an-acronym-of-words", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 95527, "totalSubmissionRaw": 114914}, "2829": {"acRate": 61.461764912034766, "difficulty": "Medium", "likes": 329, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "2829", "paidOnly": false, "title": "Determine the Minimum Sum of a k-avoiding Array", "titleSlug": "determine-the-minimum-sum-of-a-k-avoiding-array", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 35075, "totalSubmissionRaw": 57068}, "2830": {"acRate": 36.5087008501594, "difficulty": "Medium", "likes": 663, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "2830", "paidOnly": false, "title": "Maximize the Profit as the Salesman", "titleSlug": "maximize-the-profit-as-the-salesman", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21987, "totalSubmissionRaw": 60224}, "2831": {"acRate": 35.93328038125496, "difficulty": "Medium", "likes": 668, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2831", "paidOnly": false, "title": "Find the Longest Equal Subarray", "titleSlug": "find-the-longest-equal-subarray", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20358, "totalSubmissionRaw": 56655}, "2832": {"acRate": 74.09872434830838, "difficulty": "Medium", "likes": 37, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "2832", "paidOnly": true, "title": "Maximal Range That Each Element Is Maximum in It", "titleSlug": "maximal-range-that-each-element-is-maximum-in-it", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1336, "totalSubmissionRaw": 1803}, "2833": {"acRate": 64.93725088872132, "difficulty": "Easy", "likes": 238, "dislikes": 44, "categoryTitle": "Algorithms", "frontendQuestionId": "2833", "paidOnly": false, "title": "Furthest Point From Origin", "titleSlug": "furthest-point-from-origin", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 48225, "totalSubmissionRaw": 74264}, "2834": {"acRate": 38.073618250722305, "difficulty": "Medium", "likes": 295, "dislikes": 52, "categoryTitle": "Algorithms", "frontendQuestionId": "2834", "paidOnly": false, "title": "Find the Minimum Possible Sum of a Beautiful Array", "titleSlug": "find-the-minimum-possible-sum-of-a-beautiful-array", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30441, "totalSubmissionRaw": 79953}, "2835": {"acRate": 32.54428297969858, "difficulty": "Hard", "likes": 521, "dislikes": 126, "categoryTitle": "Algorithms", "frontendQuestionId": "2835", "paidOnly": false, "title": "Minimum Operations to Form Subsequence With Target Sum", "titleSlug": "minimum-operations-to-form-subsequence-with-target-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12071, "totalSubmissionRaw": 37091}, "2836": {"acRate": 31.318285901210334, "difficulty": "Hard", "likes": 290, "dislikes": 92, "categoryTitle": "Algorithms", "frontendQuestionId": "2836", "paidOnly": false, "title": "Maximize Value of Function in a Ball Passing Game", "titleSlug": "maximize-value-of-function-in-a-ball-passing-game", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4787, "totalSubmissionRaw": 15285}, "2837": {"acRate": 75.2241238793806, "difficulty": "Easy", "likes": 14, "dislikes": 4, "categoryTitle": "Database", "frontendQuestionId": "2837", "paidOnly": true, "title": "Total Traveled Distance", "titleSlug": "total-traveled-distance", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 2769, "totalSubmissionRaw": 3681}, "2838": {"acRate": 68.93411890733798, "difficulty": "Medium", "likes": 30, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "2838", "paidOnly": true, "title": "Maximum Coins Heroes Can Collect", "titleSlug": "maximum-coins-heroes-can-collect", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1287, "totalSubmissionRaw": 1867}, "2839": {"acRate": 47.27541231804023, "difficulty": "Easy", "likes": 181, "dislikes": 24, "categoryTitle": "Algorithms", "frontendQuestionId": "2839", "paidOnly": false, "title": "Check if Strings Can be Made Equal With Operations I", "titleSlug": "check-if-strings-can-be-made-equal-with-operations-i", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 38095, "totalSubmissionRaw": 80581}, "2840": {"acRate": 55.96877011565855, "difficulty": "Medium", "likes": 253, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "2840", "paidOnly": false, "title": "Check if Strings Can be Made Equal With Operations II", "titleSlug": "check-if-strings-can-be-made-equal-with-operations-ii", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26954, "totalSubmissionRaw": 48159}, "2841": {"acRate": 38.20062800540024, "difficulty": "Medium", "likes": 271, "dislikes": 135, "categoryTitle": "Algorithms", "frontendQuestionId": "2841", "paidOnly": false, "title": "Maximum Sum of Almost Unique Subarray", "titleSlug": "maximum-sum-of-almost-unique-subarray", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25183, "totalSubmissionRaw": 65923}, "2842": {"acRate": 29.47926278183926, "difficulty": "Hard", "likes": 334, "dislikes": 32, "categoryTitle": "Algorithms", "frontendQuestionId": "2842", "paidOnly": false, "title": "Count K-Subsequences of a String With Maximum Beauty", "titleSlug": "count-k-subsequences-of-a-string-with-maximum-beauty", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12460, "totalSubmissionRaw": 42267}, "2843": {"acRate": 74.54239227151392, "difficulty": "Easy", "likes": 252, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "2843", "paidOnly": false, "title": "  Count Symmetric Integers", "titleSlug": "count-symmetric-integers", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 46914, "totalSubmissionRaw": 62936}, "2844": {"acRate": 38.28745094567879, "difficulty": "Medium", "likes": 345, "dislikes": 52, "categoryTitle": "Algorithms", "frontendQuestionId": "2844", "paidOnly": false, "title": "Minimum Operations to Make a Special Number", "titleSlug": "minimum-operations-to-make-a-special-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25952, "totalSubmissionRaw": 67782}, "2845": {"acRate": 35.65662876421342, "difficulty": "Medium", "likes": 495, "dislikes": 68, "categoryTitle": "Algorithms", "frontendQuestionId": "2845", "paidOnly": false, "title": "Count of Interesting Subarrays", "titleSlug": "count-of-interesting-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14268, "totalSubmissionRaw": 40015}, "2846": {"acRate": 44.825258737063145, "difficulty": "Hard", "likes": 299, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "2846", "paidOnly": false, "title": "Minimum Edge Weight Equilibrium Queries in a Tree", "titleSlug": "minimum-edge-weight-equilibrium-queries-in-a-tree", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Strongly Connected Component", "id": "VG9waWNUYWdOb2RlOjYxMDg1", "slug": "strongly-connected-component"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5977, "totalSubmissionRaw": 13334}, "2847": {"acRate": 43.389990557129366, "difficulty": "Medium", "likes": 18, "dislikes": 0, "categoryTitle": "Algorithms", "frontendQuestionId": "2847", "paidOnly": true, "title": "Smallest Number With Given Digit Product", "titleSlug": "smallest-number-with-given-digit-product", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 919, "totalSubmissionRaw": 2118}, "2848": {"acRate": 75.35887341005451, "difficulty": "Easy", "likes": 272, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "2848", "paidOnly": false, "title": "Points That Intersect With Cars", "titleSlug": "points-that-intersect-with-cars", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 49767, "totalSubmissionRaw": 66040}, "2849": {"acRate": 35.6998763584304, "difficulty": "Medium", "likes": 817, "dislikes": 755, "categoryTitle": "Algorithms", "frontendQuestionId": "2849", "paidOnly": false, "title": "Determine if a Cell Is Reachable at a Given Time", "titleSlug": "determine-if-a-cell-is-reachable-at-a-given-time", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 98748, "totalSubmissionRaw": 276606}, "2850": {"acRate": 44.614286563968356, "difficulty": "Medium", "likes": 502, "dislikes": 69, "categoryTitle": "Algorithms", "frontendQuestionId": "2850", "paidOnly": false, "title": "Minimum Moves to Spread Stones Over Grid", "titleSlug": "minimum-moves-to-spread-stones-over-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22502, "totalSubmissionRaw": 50438}, "2851": {"acRate": 29.669845928099782, "difficulty": "Hard", "likes": 163, "dislikes": 34, "categoryTitle": "Algorithms", "frontendQuestionId": "2851", "paidOnly": false, "title": "String Transformation", "titleSlug": "string-transformation", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4044, "totalSubmissionRaw": 13630}, "2852": {"acRate": 64.66372657111357, "difficulty": "Medium", "likes": 28, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "2852", "paidOnly": true, "title": "Sum of Remoteness of All Cells", "titleSlug": "sum-of-remoteness-of-all-cells", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1173, "totalSubmissionRaw": 1814}, "2853": {"acRate": 73.65180989903965, "difficulty": "Easy", "likes": 15, "dislikes": 1, "categoryTitle": "Database", "frontendQuestionId": "2853", "paidOnly": true, "title": "Highest Salaries Difference", "titleSlug": "highest-salaries-difference", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2991, "totalSubmissionRaw": 4061}, "2854": {"acRate": 67.1453692848769, "difficulty": "Medium", "likes": 16, "dislikes": 2, "categoryTitle": "Database", "frontendQuestionId": "2854", "paidOnly": true, "title": "Rolling Average Steps", "titleSlug": "rolling-average-steps", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2291, "totalSubmissionRaw": 3412}, "2855": {"acRate": 58.058998848472534, "difficulty": "Easy", "likes": 214, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "2855", "paidOnly": false, "title": "Minimum Right Shifts to Sort the Array", "titleSlug": "minimum-right-shifts-to-sort-the-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34285, "totalSubmissionRaw": 59052}, "2856": {"acRate": 22.706621461860887, "difficulty": "Medium", "likes": 368, "dislikes": 96, "categoryTitle": "Algorithms", "frontendQuestionId": "2856", "paidOnly": false, "title": "Minimum Array Length After Pair Removals", "titleSlug": "minimum-array-length-after-pair-removals", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23239, "totalSubmissionRaw": 102347}, "2857": {"acRate": 32.166172106824924, "difficulty": "Medium", "likes": 265, "dislikes": 39, "categoryTitle": "Algorithms", "frontendQuestionId": "2857", "paidOnly": false, "title": "Count Pairs of Points With Distance k", "titleSlug": "count-pairs-of-points-with-distance-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10840, "totalSubmissionRaw": 33700}, "2858": {"acRate": 58.89587700908455, "difficulty": "Hard", "likes": 299, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "2858", "paidOnly": false, "title": "Minimum Edge Reversals So Every Node Is Reachable", "titleSlug": "minimum-edge-reversals-so-every-node-is-reachable", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8427, "totalSubmissionRaw": 14309}, "2859": {"acRate": 86.6786830088921, "difficulty": "Easy", "likes": 264, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "2859", "paidOnly": false, "title": "Sum of Values at Indices With K Set Bits", "titleSlug": "sum-of-values-at-indices-with-k-set-bits", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 72134, "totalSubmissionRaw": 83220}, "2860": {"acRate": 52.274305971400516, "difficulty": "Medium", "likes": 163, "dislikes": 292, "categoryTitle": "Algorithms", "frontendQuestionId": "2860", "paidOnly": false, "title": "Happy Students", "titleSlug": "happy-students", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21824, "totalSubmissionRaw": 41749}, "2861": {"acRate": 38.594635641255124, "difficulty": "Medium", "likes": 270, "dislikes": 46, "categoryTitle": "Algorithms", "frontendQuestionId": "2861", "paidOnly": false, "title": "Maximum Number of Alloys", "titleSlug": "maximum-number-of-alloys", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14231, "totalSubmissionRaw": 36873}, "2862": {"acRate": 44.285301761478486, "difficulty": "Hard", "likes": 208, "dislikes": 54, "categoryTitle": "Algorithms", "frontendQuestionId": "2862", "paidOnly": false, "title": "Maximum Element-Sum of a Complete Subset of Indices", "titleSlug": "maximum-element-sum-of-a-complete-subset-of-indices", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7668, "totalSubmissionRaw": 17315}, "2863": {"acRate": 70.88230135064025, "difficulty": "Medium", "likes": 122, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2863", "paidOnly": true, "title": "Maximum Length of Semi-Decreasing Subarrays", "titleSlug": "maximum-length-of-semi-decreasing-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12123, "totalSubmissionRaw": 17103}, "2864": {"acRate": 83.16434649365891, "difficulty": "Easy", "likes": 764, "dislikes": 29, "categoryTitle": "Algorithms", "frontendQuestionId": "2864", "paidOnly": false, "title": "Maximum Odd Binary Number", "titleSlug": "maximum-odd-binary-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 204072, "totalSubmissionRaw": 245384}, "2865": {"acRate": 43.619782407736615, "difficulty": "Medium", "likes": 282, "dislikes": 49, "categoryTitle": "Algorithms", "frontendQuestionId": "2865", "paidOnly": false, "title": "Beautiful Towers I", "titleSlug": "beautiful-towers-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24537, "totalSubmissionRaw": 56252}, "2866": {"acRate": 34.92449686615714, "difficulty": "Medium", "likes": 402, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "2866", "paidOnly": false, "title": "Beautiful Towers II", "titleSlug": "beautiful-towers-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13206, "totalSubmissionRaw": 37813}, "2867": {"acRate": 35.73555076480854, "difficulty": "Hard", "likes": 248, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "2867", "paidOnly": false, "title": "Count Valid Paths in a Tree", "titleSlug": "count-valid-paths-in-a-tree", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6962, "totalSubmissionRaw": 19482}, "2868": {"acRate": 58.97435897435898, "difficulty": "Hard", "likes": 10, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "2868", "paidOnly": true, "title": "The Wording Game", "titleSlug": "the-wording-game", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 460, "totalSubmissionRaw": 780}, "2869": {"acRate": 60.45886181021316, "difficulty": "Easy", "likes": 170, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "2869", "paidOnly": false, "title": "Minimum Operations to Collect Elements", "titleSlug": "minimum-operations-to-collect-elements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 36418, "totalSubmissionRaw": 60236}, "2870": {"acRate": 62.0161111016094, "difficulty": "Medium", "likes": 1388, "dislikes": 66, "categoryTitle": "Algorithms", "frontendQuestionId": "2870", "paidOnly": false, "title": "Minimum Number of Operations to Make Array Empty", "titleSlug": "minimum-number-of-operations-to-make-array-empty", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 181301, "totalSubmissionRaw": 292345}, "2871": {"acRate": 44.08625453757382, "difficulty": "Medium", "likes": 222, "dislikes": 31, "categoryTitle": "Algorithms", "frontendQuestionId": "2871", "paidOnly": false, "title": "Split Array Into Maximum Number of Subarrays", "titleSlug": "split-array-into-maximum-number-of-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16274, "totalSubmissionRaw": 36914}, "2872": {"acRate": 57.841974776328556, "difficulty": "Hard", "likes": 185, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "2872", "paidOnly": false, "title": "Maximum Number of K-Divisible Components", "titleSlug": "maximum-number-of-k-divisible-components", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10732, "totalSubmissionRaw": 18554}, "2873": {"acRate": 45.83754391030268, "difficulty": "Easy", "likes": 164, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2873", "paidOnly": false, "title": "Maximum Value of an Ordered Triplet I", "titleSlug": "maximum-value-of-an-ordered-triplet-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 38102, "totalSubmissionRaw": 83124}, "2874": {"acRate": 41.462954520444576, "difficulty": "Medium", "likes": 274, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "2874", "paidOnly": false, "title": "Maximum Value of an Ordered Triplet II", "titleSlug": "maximum-value-of-an-ordered-triplet-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26375, "totalSubmissionRaw": 63611}, "2875": {"acRate": 30.907742322381086, "difficulty": "Medium", "likes": 369, "dislikes": 27, "categoryTitle": "Algorithms", "frontendQuestionId": "2875", "paidOnly": false, "title": "Minimum Size Subarray in Infinite Array", "titleSlug": "minimum-size-subarray-in-infinite-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19585, "totalSubmissionRaw": 63366}, "2876": {"acRate": 32.99152354042986, "difficulty": "Hard", "likes": 317, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "2876", "paidOnly": false, "title": "Count Visited Nodes in a Directed Graph", "titleSlug": "count-visited-nodes-in-a-directed-graph", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10392, "totalSubmissionRaw": 31499}, "2877": {"acRate": 81.17181553133123, "difficulty": "Easy", "likes": 183, "dislikes": 7, "categoryTitle": "pandas", "frontendQuestionId": "2877", "paidOnly": false, "title": "Create a DataFrame from List", "titleSlug": "create-a-dataframe-from-list", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 113035, "totalSubmissionRaw": 139254}, "2878": {"acRate": 84.93047653944805, "difficulty": "Easy", "likes": 95, "dislikes": 8, "categoryTitle": "pandas", "frontendQuestionId": "2878", "paidOnly": false, "title": "Get the Size of a DataFrame", "titleSlug": "get-the-size-of-a-dataframe", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 88076, "totalSubmissionRaw": 103703}, "2879": {"acRate": 92.88731544434164, "difficulty": "Easy", "likes": 77, "dislikes": 19, "categoryTitle": "pandas", "frontendQuestionId": "2879", "paidOnly": false, "title": "Display the First Three Rows", "titleSlug": "display-the-first-three-rows", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 92356, "totalSubmissionRaw": 99428}, "2880": {"acRate": 79.19578329620171, "difficulty": "Easy", "likes": 77, "dislikes": 7, "categoryTitle": "pandas", "frontendQuestionId": "2880", "paidOnly": false, "title": "Select Data", "titleSlug": "select-data", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 72872, "totalSubmissionRaw": 92015}, "2881": {"acRate": 90.12882299641501, "difficulty": "Easy", "likes": 69, "dislikes": 5, "categoryTitle": "pandas", "frontendQuestionId": "2881", "paidOnly": false, "title": "Create a New Column", "titleSlug": "create-a-new-column", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 68634, "totalSubmissionRaw": 76151}, "2882": {"acRate": 85.37528981256459, "difficulty": "Easy", "likes": 81, "dislikes": 6, "categoryTitle": "pandas", "frontendQuestionId": "2882", "paidOnly": false, "title": "Drop Duplicate Rows", "titleSlug": "drop-duplicate-rows", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 61125, "totalSubmissionRaw": 71596}, "2883": {"acRate": 63.96225355277201, "difficulty": "Easy", "likes": 64, "dislikes": 4, "categoryTitle": "pandas", "frontendQuestionId": "2883", "paidOnly": false, "title": "Drop Missing Data", "titleSlug": "drop-missing-data", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 56933, "totalSubmissionRaw": 89009}, "2884": {"acRate": 91.93073009076646, "difficulty": "Easy", "likes": 63, "dislikes": 4, "categoryTitle": "pandas", "frontendQuestionId": "2884", "paidOnly": false, "title": "Modify Columns", "titleSlug": "modify-columns", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 62689, "totalSubmissionRaw": 68192}, "2885": {"acRate": 85.25997849326333, "difficulty": "Easy", "likes": 53, "dislikes": 3, "categoryTitle": "pandas", "frontendQuestionId": "2885", "paidOnly": false, "title": "Rename Columns", "titleSlug": "rename-columns", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 53912, "totalSubmissionRaw": 63233}, "2886": {"acRate": 87.1410819319029, "difficulty": "Easy", "likes": 58, "dislikes": 7, "categoryTitle": "pandas", "frontendQuestionId": "2886", "paidOnly": false, "title": "Change Data Type", "titleSlug": "change-data-type", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 52592, "totalSubmissionRaw": 60353}, "2887": {"acRate": 71.8406515177402, "difficulty": "Easy", "likes": 57, "dislikes": 3, "categoryTitle": "pandas", "frontendQuestionId": "2887", "paidOnly": false, "title": "Fill Missing Data", "titleSlug": "fill-missing-data", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 50455, "totalSubmissionRaw": 70233}, "2888": {"acRate": 90.5631373084872, "difficulty": "Easy", "likes": 59, "dislikes": 6, "categoryTitle": "pandas", "frontendQuestionId": "2888", "paidOnly": false, "title": "Reshape Data: Concatenate", "titleSlug": "reshape-data-concatenate", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 53018, "totalSubmissionRaw": 58543}, "2889": {"acRate": 82.07423540486167, "difficulty": "Easy", "likes": 81, "dislikes": 12, "categoryTitle": "pandas", "frontendQuestionId": "2889", "paidOnly": false, "title": "Reshape Data: Pivot", "titleSlug": "reshape-data-pivot", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 44467, "totalSubmissionRaw": 54179}, "2890": {"acRate": 85.81510954728637, "difficulty": "Easy", "likes": 70, "dislikes": 3, "categoryTitle": "pandas", "frontendQuestionId": "2890", "paidOnly": false, "title": "Reshape Data: Melt", "titleSlug": "reshape-data-melt", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 41947, "totalSubmissionRaw": 48881}, "2891": {"acRate": 76.11178614823815, "difficulty": "Easy", "likes": 65, "dislikes": 5, "categoryTitle": "pandas", "frontendQuestionId": "2891", "paidOnly": false, "title": "Method Chaining", "titleSlug": "method-chaining", "topicTags": [], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 43847, "totalSubmissionRaw": 57609}, "2892": {"acRate": 40.07651841224295, "difficulty": "Medium", "likes": 22, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "2892", "paidOnly": true, "title": "Minimizing Array After Replacing Pairs With Their Product", "titleSlug": "minimizing-array-after-replacing-pairs-with-their-product", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 838, "totalSubmissionRaw": 2091}, "2893": {"acRate": 68.36469824789097, "difficulty": "Medium", "likes": 18, "dislikes": 3, "categoryTitle": "Database", "frontendQuestionId": "2893", "paidOnly": true, "title": "Calculate Orders Within Each Interval", "titleSlug": "calculate-orders-within-each-interval", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2107, "totalSubmissionRaw": 3082}, "2894": {"acRate": 89.1356265553504, "difficulty": "Easy", "likes": 216, "dislikes": 18, "categoryTitle": "Algorithms", "frontendQuestionId": "2894", "paidOnly": false, "title": "Divisible and Non-divisible Sums Difference", "titleSlug": "divisible-and-non-divisible-sums-difference", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 88829, "totalSubmissionRaw": 99656}, "2895": {"acRate": 69.29219750138927, "difficulty": "Medium", "likes": 255, "dislikes": 43, "categoryTitle": "Algorithms", "frontendQuestionId": "2895", "paidOnly": false, "title": "Minimum Processing Time", "titleSlug": "minimum-processing-time", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33667, "totalSubmissionRaw": 48587}, "2896": {"acRate": 27.01757379286811, "difficulty": "Medium", "likes": 350, "dislikes": 68, "categoryTitle": "Algorithms", "frontendQuestionId": "2896", "paidOnly": false, "title": "Apply Operations to Make Two Strings Equal", "titleSlug": "apply-operations-to-make-two-strings-equal", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12668, "totalSubmissionRaw": 46888}, "2897": {"acRate": 47.2311809510739, "difficulty": "Hard", "likes": 179, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "2897", "paidOnly": false, "title": "Apply Operations on Array to Maximize Sum of Squares", "titleSlug": "apply-operations-on-array-to-maximize-sum-of-squares", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6883, "totalSubmissionRaw": 14573}, "2898": {"acRate": 68.07760141093475, "difficulty": "Medium", "likes": 20, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "2898", "paidOnly": true, "title": "Maximum Linear Stock Score", "titleSlug": "maximum-linear-stock-score", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 772, "totalSubmissionRaw": 1134}, "2899": {"acRate": 66.06197848721294, "difficulty": "Easy", "likes": 153, "dislikes": 207, "categoryTitle": "Algorithms", "frontendQuestionId": "2899", "paidOnly": false, "title": "Last Visited Integers", "titleSlug": "last-visited-integers", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26839, "totalSubmissionRaw": 40627}, "2900": {"acRate": 62.45878882526462, "difficulty": "Easy", "likes": 180, "dislikes": 80, "categoryTitle": "Algorithms", "frontendQuestionId": "2900", "paidOnly": false, "title": "Longest Unequal Adjacent Groups Subsequence I", "titleSlug": "longest-unequal-adjacent-groups-subsequence-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28796, "totalSubmissionRaw": 46104}, "2901": {"acRate": 27.317591678688025, "difficulty": "Medium", "likes": 193, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "2901", "paidOnly": false, "title": "Longest Unequal Adjacent Groups Subsequence II", "titleSlug": "longest-unequal-adjacent-groups-subsequence-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10794, "totalSubmissionRaw": 39513}, "2902": {"acRate": 21.16736990154712, "difficulty": "Hard", "likes": 146, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "2902", "paidOnly": false, "title": "Count of Sub-Multisets With Bounded Sum", "titleSlug": "count-of-sub-multisets-with-bounded-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4214, "totalSubmissionRaw": 19908}, "2903": {"acRate": 61.90682021674026, "difficulty": "Easy", "likes": 136, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2903", "paidOnly": false, "title": "Find Indices With Index and Value Difference I", "titleSlug": "find-indices-with-index-and-value-difference-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 40102, "totalSubmissionRaw": 64778}, "2904": {"acRate": 39.279273772045116, "difficulty": "Medium", "likes": 180, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "2904", "paidOnly": false, "title": "Shortest and Lexicographically Smallest Beautiful String", "titleSlug": "shortest-and-lexicographically-smallest-beautiful-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25702, "totalSubmissionRaw": 65434}, "2905": {"acRate": 32.224746219919076, "difficulty": "Medium", "likes": 258, "dislikes": 10, "categoryTitle": "Algorithms", "frontendQuestionId": "2905", "paidOnly": false, "title": "Find Indices With Index and Value Difference II", "titleSlug": "find-indices-with-index-and-value-difference-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18158, "totalSubmissionRaw": 56348}, "2906": {"acRate": 30.931998882312595, "difficulty": "Medium", "likes": 220, "dislikes": 18, "categoryTitle": "Algorithms", "frontendQuestionId": "2906", "paidOnly": false, "title": "Construct Product Matrix", "titleSlug": "construct-product-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12177, "totalSubmissionRaw": 39367}, "2907": {"acRate": 56.651492159838135, "difficulty": "Medium", "likes": 18, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "2907", "paidOnly": true, "title": "Maximum Profitable Triplets With Increasing Prices I", "titleSlug": "maximum-profitable-triplets-with-increasing-prices-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1120, "totalSubmissionRaw": 1977}, "2908": {"acRate": 65.14695152751014, "difficulty": "Easy", "likes": 155, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "2908", "paidOnly": false, "title": "Minimum Sum of Mountain Triplets I", "titleSlug": "minimum-sum-of-mountain-triplets-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34823, "totalSubmissionRaw": 53453}, "2909": {"acRate": 54.11796807494657, "difficulty": "Medium", "likes": 189, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "2909", "paidOnly": false, "title": "Minimum Sum of Mountain Triplets II", "titleSlug": "minimum-sum-of-mountain-triplets-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23800, "totalSubmissionRaw": 43978}, "2910": {"acRate": 25.10961880308118, "difficulty": "Medium", "likes": 368, "dislikes": 177, "categoryTitle": "Algorithms", "frontendQuestionId": "2910", "paidOnly": false, "title": "Minimum Number of Groups to Create a Valid Assignment", "titleSlug": "minimum-number-of-groups-to-create-a-valid-assignment", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12713, "totalSubmissionRaw": 50630}, "2911": {"acRate": 36.686280003735874, "difficulty": "Hard", "likes": 121, "dislikes": 101, "categoryTitle": "Algorithms", "frontendQuestionId": "2911", "paidOnly": false, "title": "Minimum Changes to Make K Semi-palindromes", "titleSlug": "minimum-changes-to-make-k-semi-palindromes", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3928, "totalSubmissionRaw": 10707}, "2912": {"acRate": 61.81159420289855, "difficulty": "Hard", "likes": 15, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "2912", "paidOnly": true, "title": "Number of Ways to Reach Destination in the Grid", "titleSlug": "number-of-ways-to-reach-destination-in-the-grid", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 853, "totalSubmissionRaw": 1380}, "2913": {"acRate": 82.75769875799043, "difficulty": "Easy", "likes": 145, "dislikes": 27, "categoryTitle": "Algorithms", "frontendQuestionId": "2913", "paidOnly": false, "title": "Subarrays Distinct Element Sum of Squares I", "titleSlug": "subarrays-distinct-element-sum-of-squares-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34049, "totalSubmissionRaw": 41143}, "2914": {"acRate": 60.13374164114743, "difficulty": "Medium", "likes": 142, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "2914", "paidOnly": false, "title": "Minimum Number of Changes to Make Binary String Beautiful", "titleSlug": "minimum-number-of-changes-to-make-binary-string-beautiful", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19244, "totalSubmissionRaw": 32002}, "2915": {"acRate": 35.87421769751539, "difficulty": "Medium", "likes": 221, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "2915", "paidOnly": false, "title": "Length of the Longest Subsequence That Sums to Target", "titleSlug": "length-of-the-longest-subsequence-that-sums-to-target", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21037, "totalSubmissionRaw": 58641}, "2916": {"acRate": 21.440660754180488, "difficulty": "Hard", "likes": 141, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "2916", "paidOnly": false, "title": "Subarrays Distinct Element Sum of Squares II", "titleSlug": "subarrays-distinct-element-sum-of-squares-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3167, "totalSubmissionRaw": 14771}, "2917": {"acRate": 74.7583579713441, "difficulty": "Easy", "likes": 219, "dislikes": 269, "categoryTitle": "Algorithms", "frontendQuestionId": "2917", "paidOnly": false, "title": "Find the K-or of an Array", "titleSlug": "find-the-k-or-of-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26297, "totalSubmissionRaw": 35176}, "2918": {"acRate": 35.39161139849114, "difficulty": "Medium", "likes": 177, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "2918", "paidOnly": false, "title": "Minimum Equal Sum of Two Arrays After Replacing Zeros", "titleSlug": "minimum-equal-sum-of-two-arrays-after-replacing-zeros", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27161, "totalSubmissionRaw": 76742}, "2919": {"acRate": 34.47401774397972, "difficulty": "Medium", "likes": 313, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "2919", "paidOnly": false, "title": "Minimum Increment Operations to Make Array Beautiful", "titleSlug": "minimum-increment-operations-to-make-array-beautiful", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13872, "totalSubmissionRaw": 40239}, "2920": {"acRate": 37.64831744796732, "difficulty": "Hard", "likes": 196, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "2920", "paidOnly": false, "title": "Maximum Points After Collecting Coins From All Nodes", "titleSlug": "maximum-points-after-collecting-coins-from-all-nodes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7742, "totalSubmissionRaw": 20564}, "2921": {"acRate": 48.99645808736718, "difficulty": "Hard", "likes": 8, "dislikes": 0, "categoryTitle": "Algorithms", "frontendQuestionId": "2921", "paidOnly": true, "title": "Maximum Profitable Triplets With Increasing Prices II", "titleSlug": "maximum-profitable-triplets-with-increasing-prices-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 415, "totalSubmissionRaw": 847}, "2922": {"acRate": 41.00735457989748, "difficulty": "Medium", "likes": 12, "dislikes": 6, "categoryTitle": "Database", "frontendQuestionId": "2922", "paidOnly": true, "title": "Market Analysis III", "titleSlug": "market-analysis-iii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1840, "totalSubmissionRaw": 4487}, "2923": {"acRate": 73.595286405494, "difficulty": "Easy", "likes": 139, "dislikes": 40, "categoryTitle": "Algorithms", "frontendQuestionId": "2923", "paidOnly": false, "title": "Find Champion I", "titleSlug": "find-champion-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 37722, "totalSubmissionRaw": 51256}, "2924": {"acRate": 58.7134814026688, "difficulty": "Medium", "likes": 148, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "2924", "paidOnly": false, "title": "Find Champion II", "titleSlug": "find-champion-ii", "topicTags": [{"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26488, "totalSubmissionRaw": 45114}, "2925": {"acRate": 49.71494164912952, "difficulty": "Medium", "likes": 319, "dislikes": 66, "categoryTitle": "Algorithms", "frontendQuestionId": "2925", "paidOnly": false, "title": "Maximum Score After Applying Operations on a Tree", "titleSlug": "maximum-score-after-applying-operations-on-a-tree", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12986, "totalSubmissionRaw": 26127}, "2926": {"acRate": 24.232511323603422, "difficulty": "Hard", "likes": 192, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "2926", "paidOnly": false, "title": "Maximum Balanced Subsequence Sum", "titleSlug": "maximum-balanced-subsequence-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5778, "totalSubmissionRaw": 23844}, "2927": {"acRate": 44.073455759599334, "difficulty": "Hard", "likes": 8, "dislikes": 0, "categoryTitle": "Algorithms", "frontendQuestionId": "2927", "paidOnly": true, "title": "Distribute Candies Among Children III", "titleSlug": "distribute-candies-among-children-iii", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 528, "totalSubmissionRaw": 1198}, "2928": {"acRate": 75.98806424245971, "difficulty": "Easy", "likes": 103, "dislikes": 48, "categoryTitle": "Algorithms", "frontendQuestionId": "2928", "paidOnly": false, "title": "Distribute Candies Among Children I", "titleSlug": "distribute-candies-among-children-i", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25975, "totalSubmissionRaw": 34183}, "2929": {"acRate": 35.41536184023231, "difficulty": "Medium", "likes": 92, "dislikes": 108, "categoryTitle": "Algorithms", "frontendQuestionId": "2929", "paidOnly": false, "title": "Distribute Candies Among Children II", "titleSlug": "distribute-candies-among-children-ii", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12440, "totalSubmissionRaw": 35126}, "2930": {"acRate": 56.58838293295088, "difficulty": "Medium", "likes": 165, "dislikes": 64, "categoryTitle": "Algorithms", "frontendQuestionId": "2930", "paidOnly": false, "title": "Number of Strings Which Can Be Rearranged to Contain Substring", "titleSlug": "number-of-strings-which-can-be-rearranged-to-contain-substring", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6313, "totalSubmissionRaw": 11156}, "2931": {"acRate": 65.60591253359395, "difficulty": "Hard", "likes": 93, "dislikes": 28, "categoryTitle": "Algorithms", "frontendQuestionId": "2931", "paidOnly": false, "title": "Maximum Spending After Buying Items", "titleSlug": "maximum-spending-after-buying-items", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10741, "totalSubmissionRaw": 16372}, "2932": {"acRate": 76.32379072063179, "difficulty": "Easy", "likes": 140, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "2932", "paidOnly": false, "title": "Maximum Strong Pair XOR I", "titleSlug": "maximum-strong-pair-xor-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 38658, "totalSubmissionRaw": 50646}, "2933": {"acRate": 44.47159814350844, "difficulty": "Medium", "likes": 190, "dislikes": 18, "categoryTitle": "Algorithms", "frontendQuestionId": "2933", "paidOnly": false, "title": "High-Access Employees", "titleSlug": "high-access-employees", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21655, "totalSubmissionRaw": 48694}, "2934": {"acRate": 45.091733060448796, "difficulty": "Medium", "likes": 180, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "2934", "paidOnly": false, "title": "Minimum Operations to Maximize Last Elements in Arrays", "titleSlug": "minimum-operations-to-maximize-last-elements-in-arrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12338, "totalSubmissionRaw": 27362}, "2935": {"acRate": 30.56195188868747, "difficulty": "Hard", "likes": 172, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "2935", "paidOnly": false, "title": "Maximum Strong Pair XOR II", "titleSlug": "maximum-strong-pair-xor-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6238, "totalSubmissionRaw": 20411}, "2936": {"acRate": 66.40390390390391, "difficulty": "Medium", "likes": 19, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "2936", "paidOnly": true, "title": "Number of Equal Numbers Blocks", "titleSlug": "number-of-equal-numbers-blocks", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1769, "totalSubmissionRaw": 2664}, "2937": {"acRate": 43.45286606900299, "difficulty": "Easy", "likes": 296, "dislikes": 38, "categoryTitle": "Algorithms", "frontendQuestionId": "2937", "paidOnly": false, "title": "Make Three Strings Equal", "titleSlug": "make-three-strings-equal", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28791, "totalSubmissionRaw": 66258}, "2938": {"acRate": 53.47706522934771, "difficulty": "Medium", "likes": 187, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "2938", "paidOnly": false, "title": "Separate Black and White Balls", "titleSlug": "separate-black-and-white-balls", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24308, "totalSubmissionRaw": 45455}, "2939": {"acRate": 26.395295202952028, "difficulty": "Medium", "likes": 201, "dislikes": 69, "categoryTitle": "Algorithms", "frontendQuestionId": "2939", "paidOnly": false, "title": "Maximum Xor Product", "titleSlug": "maximum-xor-product", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9156, "totalSubmissionRaw": 34688}, "2940": {"acRate": 35.7230643179025, "difficulty": "Hard", "likes": 231, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "2940", "paidOnly": false, "title": "Find Building Where Alice and Bob Can Meet", "titleSlug": "find-building-where-alice-and-bob-can-meet", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6976, "totalSubmissionRaw": 19528}, "2941": {"acRate": 47.77636594663278, "difficulty": "Hard", "likes": 13, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "2941", "paidOnly": true, "title": "Maximum GCD-Sum of a Subarray", "titleSlug": "maximum-gcd-sum-of-a-subarray", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 376, "totalSubmissionRaw": 787}, "2942": {"acRate": 88.66522698858029, "difficulty": "Easy", "likes": 340, "dislikes": 27, "categoryTitle": "Algorithms", "frontendQuestionId": "2942", "paidOnly": false, "title": "Find Words Containing Character", "titleSlug": "find-words-containing-character", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 148217, "totalSubmissionRaw": 167165}, "2943": {"acRate": 36.95845226768157, "difficulty": "Medium", "likes": 224, "dislikes": 146, "categoryTitle": "Algorithms", "frontendQuestionId": "2943", "paidOnly": false, "title": "Maximize Area of Square Hole in Grid", "titleSlug": "maximize-area-of-square-hole-in-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11653, "totalSubmissionRaw": 31530}, "2944": {"acRate": 46.146895948703005, "difficulty": "Medium", "likes": 252, "dislikes": 47, "categoryTitle": "Algorithms", "frontendQuestionId": "2944", "paidOnly": false, "title": "Minimum Number of Coins for Fruits", "titleSlug": "minimum-number-of-coins-for-fruits", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Monotonic Queue", "id": "VG9waWNUYWdOb2RlOjYxMDcx", "slug": "monotonic-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15833, "totalSubmissionRaw": 34310}, "2945": {"acRate": 16.332193846772572, "difficulty": "Hard", "likes": 162, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "2945", "paidOnly": false, "title": "Find Maximum Non-decreasing Array Length", "titleSlug": "find-maximum-non-decreasing-array-length", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}, {"name": "Monotonic Queue", "id": "VG9waWNUYWdOb2RlOjYxMDcx", "slug": "monotonic-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4061, "totalSubmissionRaw": 24865}, "2946": {"acRate": 58.41251389871627, "difficulty": "Easy", "likes": 172, "dislikes": 63, "categoryTitle": "Algorithms", "frontendQuestionId": "2946", "paidOnly": false, "title": "Matrix Similarity After Cyclic Shifts", "titleSlug": "matrix-similarity-after-cyclic-shifts", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23115, "totalSubmissionRaw": 39572}, "2947": {"acRate": 62.091522880720184, "difficulty": "Medium", "likes": 136, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "2947", "paidOnly": false, "title": "Count Beautiful Substrings I", "titleSlug": "count-beautiful-substrings-i", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20691, "totalSubmissionRaw": 33324}, "2948": {"acRate": 39.77563819450579, "difficulty": "Medium", "likes": 257, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "2948", "paidOnly": false, "title": "Make Lexicographically Smallest Array by Swapping Elements", "titleSlug": "make-lexicographically-smallest-array-by-swapping-elements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9006, "totalSubmissionRaw": 22642}, "2949": {"acRate": 25.32809703718433, "difficulty": "Hard", "likes": 177, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "2949", "paidOnly": false, "title": "Count Beautiful Substrings II", "titleSlug": "count-beautiful-substrings-ii", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5095, "totalSubmissionRaw": 20116}, "2950": {"acRate": 76.2545899632803, "difficulty": "Medium", "likes": 22, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "2950", "paidOnly": true, "title": "Number of Divisible Substrings", "titleSlug": "number-of-divisible-substrings", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1246, "totalSubmissionRaw": 1634}, "2951": {"acRate": 75.74182835706159, "difficulty": "Easy", "likes": 153, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "2951", "paidOnly": false, "title": "Find the Peaks", "titleSlug": "find-the-peaks", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 49263, "totalSubmissionRaw": 65041}, "2952": {"acRate": 57.17919480747303, "difficulty": "Medium", "likes": 352, "dislikes": 55, "categoryTitle": "Algorithms", "frontendQuestionId": "2952", "paidOnly": false, "title": "Minimum Number of Coins to be Added", "titleSlug": "minimum-number-of-coins-to-be-added", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19555, "totalSubmissionRaw": 34201}, "2953": {"acRate": 28.04815064955703, "difficulty": "Hard", "likes": 198, "dislikes": 36, "categoryTitle": "Algorithms", "frontendQuestionId": "2953", "paidOnly": false, "title": "Count Complete Substrings", "titleSlug": "count-complete-substrings", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7060, "totalSubmissionRaw": 25171}, "2954": {"acRate": 36.83545757262602, "difficulty": "Hard", "likes": 115, "dislikes": 27, "categoryTitle": "Algorithms", "frontendQuestionId": "2954", "paidOnly": false, "title": "Count the Number of Infection Sequences", "titleSlug": "count-the-number-of-infection-sequences", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3208, "totalSubmissionRaw": 8709}, "2955": {"acRate": 64.31860036832413, "difficulty": "Medium", "likes": 29, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "2955", "paidOnly": true, "title": "Number of Same-End Substrings", "titleSlug": "number-of-same-end-substrings", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1396, "totalSubmissionRaw": 2171}, "2956": {"acRate": 83.7024992142984, "difficulty": "Easy", "likes": 218, "dislikes": 87, "categoryTitle": "Algorithms", "frontendQuestionId": "2956", "paidOnly": false, "title": "Find Common Elements Between Two Arrays", "titleSlug": "find-common-elements-between-two-arrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 61251, "totalSubmissionRaw": 73178}, "2957": {"acRate": 52.725485023621665, "difficulty": "Medium", "likes": 161, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "2957", "paidOnly": false, "title": "Remove Adjacent Almost-Equal Characters", "titleSlug": "remove-adjacent-almost-equal-characters", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21986, "totalSubmissionRaw": 41699}, "2958": {"acRate": 55.8481890476011, "difficulty": "Medium", "likes": 1030, "dislikes": 31, "categoryTitle": "Algorithms", "frontendQuestionId": "2958", "paidOnly": false, "title": "Length of Longest Subarray With at Most K Frequency", "titleSlug": "length-of-longest-subarray-with-at-most-k-frequency", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 148182, "totalSubmissionRaw": 265330}, "2959": {"acRate": 51.58274440518257, "difficulty": "Hard", "likes": 158, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "2959", "paidOnly": false, "title": "Number of Possible Sets of Closing Branches", "titleSlug": "number-of-possible-sets-of-closing-branches", "topicTags": [{"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7007, "totalSubmissionRaw": 13584}, "2960": {"acRate": 80.78445905092548, "difficulty": "Easy", "likes": 140, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "2960", "paidOnly": false, "title": "Count Tested Devices After Test Operations", "titleSlug": "count-tested-devices-after-test-operations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 41419, "totalSubmissionRaw": 51271}, "2961": {"acRate": 48.094415135528465, "difficulty": "Medium", "likes": 110, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2961", "paidOnly": false, "title": "Double Modular Exponentiation", "titleSlug": "double-modular-exponentiation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21150, "totalSubmissionRaw": 43975}, "2962": {"acRate": 58.96802267019433, "difficulty": "Medium", "likes": 1212, "dislikes": 59, "categoryTitle": "Algorithms", "frontendQuestionId": "2962", "paidOnly": false, "title": "Count Subarrays Where Max Element Appears at Least K Times", "titleSlug": "count-subarrays-where-max-element-appears-at-least-k-times", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 131720, "totalSubmissionRaw": 223376}, "2963": {"acRate": 49.967052621669964, "difficulty": "Hard", "likes": 241, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "2963", "paidOnly": false, "title": "Count the Number of Good Partitions", "titleSlug": "count-the-number-of-good-partitions", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10616, "totalSubmissionRaw": 21246}, "2964": {"acRate": 66.99840764331209, "difficulty": "Medium", "likes": 19, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "2964", "paidOnly": true, "title": "Number of Divisible Triplet Sums", "titleSlug": "number-of-divisible-triplet-sums", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1683, "totalSubmissionRaw": 2512}, "2965": {"acRate": 75.97370875338633, "difficulty": "Easy", "likes": 197, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "2965", "paidOnly": false, "title": "Find Missing and Repeated Values", "titleSlug": "find-missing-and-repeated-values", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 51321, "totalSubmissionRaw": 67551}, "2966": {"acRate": 71.68175069273035, "difficulty": "Medium", "likes": 828, "dislikes": 191, "categoryTitle": "Algorithms", "frontendQuestionId": "2966", "paidOnly": false, "title": "Divide Array Into Arrays With Max Difference", "titleSlug": "divide-array-into-arrays-with-max-difference", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 151594, "totalSubmissionRaw": 211482}, "2967": {"acRate": 22.213254108636292, "difficulty": "Medium", "likes": 222, "dislikes": 87, "categoryTitle": "Algorithms", "frontendQuestionId": "2967", "paidOnly": false, "title": "Minimum Cost to Make Array Equalindromic", "titleSlug": "minimum-cost-to-make-array-equalindromic", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12935, "totalSubmissionRaw": 58231}, "2968": {"acRate": 38.61027190332326, "difficulty": "Hard", "likes": 238, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "2968", "paidOnly": false, "title": "Apply Operations to Maximize Frequency Score", "titleSlug": "apply-operations-to-maximize-frequency-score", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6390, "totalSubmissionRaw": 16550}, "2969": {"acRate": 54.07882676443629, "difficulty": "Hard", "likes": 18, "dislikes": 0, "categoryTitle": "Algorithms", "frontendQuestionId": "2969", "paidOnly": true, "title": "Minimum Number of Coins for Fruits II", "titleSlug": "minimum-number-of-coins-for-fruits-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Monotonic Queue", "id": "VG9waWNUYWdOb2RlOjYxMDcx", "slug": "monotonic-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 590, "totalSubmissionRaw": 1091}, "2970": {"acRate": 52.16734271852383, "difficulty": "Easy", "likes": 146, "dislikes": 93, "categoryTitle": "Algorithms", "frontendQuestionId": "2970", "paidOnly": false, "title": "Count the Number of Incremovable Subarrays I", "titleSlug": "count-the-number-of-incremovable-subarrays-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19677, "totalSubmissionRaw": 37719}, "2971": {"acRate": 66.09717791411043, "difficulty": "Medium", "likes": 782, "dislikes": 69, "categoryTitle": "Algorithms", "frontendQuestionId": "2971", "paidOnly": false, "title": "Find Polygon With the Largest Perimeter", "titleSlug": "find-polygon-with-the-largest-perimeter", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 134673, "totalSubmissionRaw": 203750}, "2972": {"acRate": 40.039160839160836, "difficulty": "Hard", "likes": 194, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "2972", "paidOnly": false, "title": "Count the Number of Incremovable Subarrays II", "titleSlug": "count-the-number-of-incremovable-subarrays-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7157, "totalSubmissionRaw": 17875}, "2973": {"acRate": 37.230061764573286, "difficulty": "Hard", "likes": 173, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "2973", "paidOnly": false, "title": "Find Number of Coins to Place in Tree Nodes", "titleSlug": "find-number-of-coins-to-place-in-tree-nodes", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8258, "totalSubmissionRaw": 22181}, "2974": {"acRate": 85.94297450767186, "difficulty": "Easy", "likes": 227, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "2974", "paidOnly": false, "title": "Minimum Number Game", "titleSlug": "minimum-number-game", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 85362, "totalSubmissionRaw": 99324}, "2975": {"acRate": 22.956954679591803, "difficulty": "Medium", "likes": 135, "dislikes": 115, "categoryTitle": "Algorithms", "frontendQuestionId": "2975", "paidOnly": false, "title": "Maximum Square Area by Removing Fences From a Field", "titleSlug": "maximum-square-area-by-removing-fences-from-a-field", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13925, "totalSubmissionRaw": 60655}, "2976": {"acRate": 58.634039487633025, "difficulty": "Medium", "likes": 859, "dislikes": 59, "categoryTitle": "Algorithms", "frontendQuestionId": "2976", "paidOnly": false, "title": "Minimum Cost to Convert String I", "titleSlug": "minimum-cost-to-convert-string-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 100110, "totalSubmissionRaw": 170737}, "2977": {"acRate": 25.63151671503816, "difficulty": "Hard", "likes": 95, "dislikes": 73, "categoryTitle": "Algorithms", "frontendQuestionId": "2977", "paidOnly": false, "title": "Minimum Cost to Convert String II", "titleSlug": "minimum-cost-to-convert-string-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4769, "totalSubmissionRaw": 18606}, "2978": {"acRate": 42.72, "difficulty": "Medium", "likes": 8, "dislikes": 2, "categoryTitle": "Database", "frontendQuestionId": "2978", "paidOnly": true, "title": "Symmetric Coordinates", "titleSlug": "symmetric-coordinates", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1335, "totalSubmissionRaw": 3125}, "2979": {"acRate": 77.1887159533074, "difficulty": "Medium", "likes": 15, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "2979", "paidOnly": true, "title": "Most Expensive Item That Can Not Be Bought", "titleSlug": "most-expensive-item-that-can-not-be-bought", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1587, "totalSubmissionRaw": 2056}, "2980": {"acRate": 70.78293679907766, "difficulty": "Easy", "likes": 107, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "2980", "paidOnly": false, "title": "Check if Bitwise OR Has Trailing Zeros", "titleSlug": "check-if-bitwise-or-has-trailing-zeros", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33767, "totalSubmissionRaw": 47705}, "2981": {"acRate": 43.082873837544234, "difficulty": "Medium", "likes": 162, "dislikes": 10, "categoryTitle": "Algorithms", "frontendQuestionId": "2981", "paidOnly": false, "title": "Find Longest Special Substring That Occurs Thrice I", "titleSlug": "find-longest-special-substring-that-occurs-thrice-i", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20940, "totalSubmissionRaw": 48604}, "2982": {"acRate": 34.084718329319806, "difficulty": "Medium", "likes": 248, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "2982", "paidOnly": false, "title": "Find Longest Special Substring That Occurs Thrice II", "titleSlug": "find-longest-special-substring-that-occurs-thrice-ii", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17268, "totalSubmissionRaw": 50662}, "2983": {"acRate": 26.085518153998844, "difficulty": "Hard", "likes": 85, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "2983", "paidOnly": false, "title": "Palindrome Rearrangement Queries", "titleSlug": "palindrome-rearrangement-queries", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3154, "totalSubmissionRaw": 12091}, "2984": {"acRate": 61.70531039640987, "difficulty": "Medium", "likes": 8, "dislikes": 4, "categoryTitle": "Database", "frontendQuestionId": "2984", "paidOnly": true, "title": "Find Peak Calling Hours for Each City", "titleSlug": "find-peak-calling-hours-for-each-city", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1650, "totalSubmissionRaw": 2674}, "2985": {"acRate": 87.36669401148482, "difficulty": "Easy", "likes": 7, "dislikes": 4, "categoryTitle": "Database", "frontendQuestionId": "2985", "paidOnly": true, "title": "Calculate Compressed Mean", "titleSlug": "calculate-compressed-mean", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2130, "totalSubmissionRaw": 2438}, "2986": {"acRate": 52.22987129601916, "difficulty": "Medium", "likes": 7, "dislikes": 8, "categoryTitle": "Database", "frontendQuestionId": "2986", "paidOnly": true, "title": "Find Third Transaction", "titleSlug": "find-third-transaction", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1745, "totalSubmissionRaw": 3341}, "2987": {"acRate": 79.27702219040802, "difficulty": "Easy", "likes": 8, "dislikes": 6, "categoryTitle": "Database", "frontendQuestionId": "2987", "paidOnly": true, "title": "Find Expensive Cities", "titleSlug": "find-expensive-cities", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2215, "totalSubmissionRaw": 2794}, "2988": {"acRate": 79.97601918465229, "difficulty": "Medium", "likes": 2, "dislikes": 1, "categoryTitle": "Database", "frontendQuestionId": "2988", "paidOnly": true, "title": "Manager of the Largest Department", "titleSlug": "manager-of-the-largest-department", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2001, "totalSubmissionRaw": 2502}, "2989": {"acRate": 89.11364472232438, "difficulty": "Medium", "likes": 6, "dislikes": 2, "categoryTitle": "Database", "frontendQuestionId": "2989", "paidOnly": true, "title": "Class Performance", "titleSlug": "class-performance", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2423, "totalSubmissionRaw": 2719}, "2990": {"acRate": 61.12424481218808, "difficulty": "Easy", "likes": 13, "dislikes": 8, "categoryTitle": "Database", "frontendQuestionId": "2990", "paidOnly": true, "title": "Loan Types", "titleSlug": "loan-types", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2327, "totalSubmissionRaw": 3807}, "2991": {"acRate": 53.79339905700814, "difficulty": "Hard", "likes": 8, "dislikes": 5, "categoryTitle": "Database", "frontendQuestionId": "2991", "paidOnly": true, "title": "Top Three Wineries ", "titleSlug": "top-three-wineries", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1255, "totalSubmissionRaw": 2333}, "2992": {"acRate": 73.02709069493521, "difficulty": "Medium", "likes": 16, "dislikes": 0, "categoryTitle": "Algorithms", "frontendQuestionId": "2992", "paidOnly": true, "title": "Number of Self-Divisible Permutations", "titleSlug": "number-of-self-divisible-permutations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1240, "totalSubmissionRaw": 1698}, "2993": {"acRate": 81.07981220657277, "difficulty": "Medium", "likes": 10, "dislikes": 4, "categoryTitle": "Database", "frontendQuestionId": "2993", "paidOnly": true, "title": "Friday Purchases I", "titleSlug": "friday-purchases-i", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1727, "totalSubmissionRaw": 2130}, "2994": {"acRate": 73.69109947643979, "difficulty": "Hard", "likes": 10, "dislikes": 4, "categoryTitle": "Database", "frontendQuestionId": "2994", "paidOnly": true, "title": "Friday Purchases II ", "titleSlug": "friday-purchases-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1126, "totalSubmissionRaw": 1528}, "2995": {"acRate": 42.68859492313193, "difficulty": "Hard", "likes": 5, "dislikes": 5, "categoryTitle": "Database", "frontendQuestionId": "2995", "paidOnly": true, "title": "Viewers Turned Streamers", "titleSlug": "viewers-turned-streamers", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1194, "totalSubmissionRaw": 2797}, "2996": {"acRate": 32.696217544156895, "difficulty": "Easy", "likes": 107, "dislikes": 232, "categoryTitle": "Algorithms", "frontendQuestionId": "2996", "paidOnly": false, "title": "Smallest Missing Integer Greater Than Sequential Prefix Sum", "titleSlug": "smallest-missing-integer-greater-than-sequential-prefix-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30876, "totalSubmissionRaw": 94434}, "2997": {"acRate": 86.4038203488831, "difficulty": "Medium", "likes": 568, "dislikes": 54, "categoryTitle": "Algorithms", "frontendQuestionId": "2997", "paidOnly": false, "title": "Minimum Number of Operations to Make Array XOR Equal to K", "titleSlug": "minimum-number-of-operations-to-make-array-xor-equal-to-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 109464, "totalSubmissionRaw": 126689}, "2998": {"acRate": 46.72626180319225, "difficulty": "Medium", "likes": 243, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "2998", "paidOnly": false, "title": "Minimum Number of Operations to Make X and Y Equal", "titleSlug": "minimum-number-of-operations-to-make-x-and-y-equal", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19497, "totalSubmissionRaw": 41726}, "2999": {"acRate": 26.28799370751166, "difficulty": "Hard", "likes": 105, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "2999", "paidOnly": false, "title": "Count the Number of Powerful Integers", "titleSlug": "count-the-number-of-powerful-integers", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4679, "totalSubmissionRaw": 17799}, "3000": {"acRate": 36.266138679206364, "difficulty": "Easy", "likes": 102, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "3000", "paidOnly": false, "title": "Maximum Area of Longest Diagonal Rectangle", "titleSlug": "maximum-area-of-longest-diagonal-rectangle", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 35168, "totalSubmissionRaw": 96972}, "3001": {"acRate": 21.03313979881968, "difficulty": "Medium", "likes": 150, "dislikes": 194, "categoryTitle": "Algorithms", "frontendQuestionId": "3001", "paidOnly": false, "title": "Minimum Moves to Capture The Queen", "titleSlug": "minimum-moves-to-capture-the-queen", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17606, "totalSubmissionRaw": 83706}, "3002": {"acRate": 45.906195715112915, "difficulty": "Medium", "likes": 281, "dislikes": 24, "categoryTitle": "Algorithms", "frontendQuestionId": "3002", "paidOnly": false, "title": "Maximum Size of a Set After Removals", "titleSlug": "maximum-size-of-a-set-after-removals", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15856, "totalSubmissionRaw": 34540}, "3003": {"acRate": 28.41925862803579, "difficulty": "Hard", "likes": 131, "dislikes": 28, "categoryTitle": "Algorithms", "frontendQuestionId": "3003", "paidOnly": false, "title": "Maximize the Number of Partitions After Operations", "titleSlug": "maximize-the-number-of-partitions-after-operations", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3335, "totalSubmissionRaw": 11735}, "3004": {"acRate": 64.79591836734694, "difficulty": "Medium", "likes": 17, "dislikes": 0, "categoryTitle": "Algorithms", "frontendQuestionId": "3004", "paidOnly": true, "title": "Maximum Subtree of the Same Color", "titleSlug": "maximum-subtree-of-the-same-color", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1270, "totalSubmissionRaw": 1960}, "3005": {"acRate": 78.75062972292191, "difficulty": "Easy", "likes": 635, "dislikes": 68, "categoryTitle": "Algorithms", "frontendQuestionId": "3005", "paidOnly": false, "title": "Count Elements With Maximum Frequency", "titleSlug": "count-elements-with-maximum-frequency", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 211032, "totalSubmissionRaw": 267975}, "3006": {"acRate": 36.51545541188352, "difficulty": "Medium", "likes": 150, "dislikes": 31, "categoryTitle": "Algorithms", "frontendQuestionId": "3006", "paidOnly": false, "title": "Find Beautiful Indices in the Given Array I", "titleSlug": "find-beautiful-indices-in-the-given-array-i", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25670, "totalSubmissionRaw": 70299}, "3007": {"acRate": 36.65699930558392, "difficulty": "Medium", "likes": 287, "dislikes": 113, "categoryTitle": "Algorithms", "frontendQuestionId": "3007", "paidOnly": false, "title": "Maximum Number That Sum of the Prices Is Less Than or Equal to K", "titleSlug": "maximum-number-that-sum-of-the-prices-is-less-than-or-equal-to-k", "topicTags": [{"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8974, "totalSubmissionRaw": 24481}, "3008": {"acRate": 24.68769594366469, "difficulty": "Hard", "likes": 160, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "3008", "paidOnly": false, "title": "Find Beautiful Indices in the Given Array II", "titleSlug": "find-beautiful-indices-in-the-given-array-ii", "topicTags": [{"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10237, "totalSubmissionRaw": 41466}, "3009": {"acRate": 46.00357507660878, "difficulty": "Hard", "likes": 28, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "3009", "paidOnly": true, "title": "Maximum Number of Intersections on the Chart", "titleSlug": "maximum-number-of-intersections-on-the-chart", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3603, "totalSubmissionRaw": 7832}, "3010": {"acRate": 66.49104531431547, "difficulty": "Easy", "likes": 89, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "3010", "paidOnly": false, "title": "Divide an Array Into Subarrays With Minimum Cost I", "titleSlug": "divide-an-array-into-subarrays-with-minimum-cost-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33191, "totalSubmissionRaw": 49918}, "3011": {"acRate": 51.55874761530692, "difficulty": "Medium", "likes": 116, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "3011", "paidOnly": false, "title": "Find if Array Can Be Sorted", "titleSlug": "find-if-array-can-be-sorted", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22972, "totalSubmissionRaw": 44555}, "3012": {"acRate": 35.41310613983624, "difficulty": "Medium", "likes": 161, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "3012", "paidOnly": false, "title": "Minimize Length of Array Using Operations", "titleSlug": "minimize-length-of-array-using-operations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13883, "totalSubmissionRaw": 39203}, "3013": {"acRate": 32.29160103333123, "difficulty": "Hard", "likes": 114, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "3013", "paidOnly": false, "title": "Divide an Array Into Subarrays With Minimum Cost II", "titleSlug": "divide-an-array-into-subarrays-with-minimum-cost-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5125, "totalSubmissionRaw": 15871}, "3014": {"acRate": 66.48286532573987, "difficulty": "Easy", "likes": 157, "dislikes": 26, "categoryTitle": "Algorithms", "frontendQuestionId": "3014", "paidOnly": false, "title": "Minimum Number of Pushes to Type Word I", "titleSlug": "minimum-number-of-pushes-to-type-word-i", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 40391, "totalSubmissionRaw": 60754}, "3015": {"acRate": 56.4977876754476, "difficulty": "Medium", "likes": 148, "dislikes": 33, "categoryTitle": "Algorithms", "frontendQuestionId": "3015", "paidOnly": false, "title": "Count the Number of Houses at a Certain Distance I", "titleSlug": "count-the-number-of-houses-at-a-certain-distance-i", "topicTags": [{"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19281, "totalSubmissionRaw": 34127}, "3016": {"acRate": 80.70810340917681, "difficulty": "Medium", "likes": 726, "dislikes": 73, "categoryTitle": "Algorithms", "frontendQuestionId": "3016", "paidOnly": false, "title": "Minimum Number of Pushes to Type Word II", "titleSlug": "minimum-number-of-pushes-to-type-word-ii", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 170829, "totalSubmissionRaw": 211663}, "3017": {"acRate": 21.853388658367912, "difficulty": "Hard", "likes": 79, "dislikes": 23, "categoryTitle": "Algorithms", "frontendQuestionId": "3017", "paidOnly": false, "title": "Count the Number of Houses at a Certain Distance II", "titleSlug": "count-the-number-of-houses-at-a-certain-distance-ii", "topicTags": [{"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3002, "totalSubmissionRaw": 13737}, "3018": {"acRate": 43.69834710743802, "difficulty": "Hard", "likes": 5, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "3018", "paidOnly": true, "title": "Maximum Number of Removal Queries That Can Be Processed I", "titleSlug": "maximum-number-of-removal-queries-that-can-be-processed-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 423, "totalSubmissionRaw": 968}, "3019": {"acRate": 80.97587456690776, "difficulty": "Easy", "likes": 112, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "3019", "paidOnly": false, "title": "Number of Changing Keys", "titleSlug": "number-of-changing-keys", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 50715, "totalSubmissionRaw": 62630}, "3020": {"acRate": 24.785192521975983, "difficulty": "Medium", "likes": 171, "dislikes": 37, "categoryTitle": "Algorithms", "frontendQuestionId": "3020", "paidOnly": false, "title": "Find the Maximum Number of Elements in Subset", "titleSlug": "find-the-maximum-number-of-elements-in-subset", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20019, "totalSubmissionRaw": 80770}, "3021": {"acRate": 47.84732008358035, "difficulty": "Medium", "likes": 90, "dislikes": 72, "categoryTitle": "Algorithms", "frontendQuestionId": "3021", "paidOnly": false, "title": "Alice and Bob Playing Flower Game", "titleSlug": "alice-and-bob-playing-flower-game", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19693, "totalSubmissionRaw": 41158}, "3022": {"acRate": 34.13333333333333, "difficulty": "Hard", "likes": 89, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "3022", "paidOnly": false, "title": "Minimize OR of Remaining Elements Using Operations", "titleSlug": "minimize-or-of-remaining-elements-using-operations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3072, "totalSubmissionRaw": 9000}, "3023": {"acRate": 58.54166666666667, "difficulty": "Medium", "likes": 10, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "3023", "paidOnly": true, "title": "Find Pattern in Infinite Stream I", "titleSlug": "find-pattern-in-infinite-stream-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 843, "totalSubmissionRaw": 1440}, "3024": {"acRate": 38.31166672208, "difficulty": "Easy", "likes": 91, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "3024", "paidOnly": false, "title": "Type of Triangle", "titleSlug": "type-of-triangle", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 46092, "totalSubmissionRaw": 120308}, "3025": {"acRate": 41.24985113731094, "difficulty": "Medium", "likes": 83, "dislikes": 70, "categoryTitle": "Algorithms", "frontendQuestionId": "3025", "paidOnly": false, "title": "Find the Number of Ways to Place People I", "titleSlug": "find-the-number-of-ways-to-place-people-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13855, "totalSubmissionRaw": 33588}, "3026": {"acRate": 18.318361628481952, "difficulty": "Medium", "likes": 315, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "3026", "paidOnly": false, "title": "Maximum Good Subarray Sum", "titleSlug": "maximum-good-subarray-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17782, "totalSubmissionRaw": 97072}, "3027": {"acRate": 47.86752827140549, "difficulty": "Hard", "likes": 91, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "3027", "paidOnly": false, "title": "Find the Number of Ways to Place People II", "titleSlug": "find-the-number-of-ways-to-place-people-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8889, "totalSubmissionRaw": 18570}, "3028": {"acRate": 74.90682837470786, "difficulty": "Easy", "likes": 104, "dislikes": 36, "categoryTitle": "Algorithms", "frontendQuestionId": "3028", "paidOnly": false, "title": "Ant on the Boundary", "titleSlug": "ant-on-the-boundary", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 47434, "totalSubmissionRaw": 63324}, "3029": {"acRate": 40.97086177386427, "difficulty": "Medium", "likes": 140, "dislikes": 31, "categoryTitle": "Algorithms", "frontendQuestionId": "3029", "paidOnly": false, "title": "Minimum Time to Revert Word to Initial State I", "titleSlug": "minimum-time-to-revert-word-to-initial-state-i", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19868, "totalSubmissionRaw": 48493}, "3030": {"acRate": 44.33637926354836, "difficulty": "Medium", "likes": 76, "dislikes": 122, "categoryTitle": "Algorithms", "frontendQuestionId": "3030", "paidOnly": false, "title": "Find the Grid of Region Average", "titleSlug": "find-the-grid-of-region-average", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9801, "totalSubmissionRaw": 22106}, "3031": {"acRate": 35.62238766980146, "difficulty": "Hard", "likes": 129, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "3031", "paidOnly": false, "title": "Minimum Time to Revert Word to Initial State II", "titleSlug": "minimum-time-to-revert-word-to-initial-state-ii", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10909, "totalSubmissionRaw": 30624}, "3032": {"acRate": 87.14876933130037, "difficulty": "Easy", "likes": 23, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "3032", "paidOnly": true, "title": "Count Numbers With Unique Digits II", "titleSlug": "count-numbers-with-unique-digits-ii", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4001, "totalSubmissionRaw": 4591}, "3033": {"acRate": 68.47876687529096, "difficulty": "Easy", "likes": 108, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "3033", "paidOnly": false, "title": "Modify the Matrix", "titleSlug": "modify-the-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 39717, "totalSubmissionRaw": 57999}, "3034": {"acRate": 66.82340782844594, "difficulty": "Medium", "likes": 91, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "3034", "paidOnly": false, "title": "Number of Subarrays That Match a Pattern I", "titleSlug": "number-of-subarrays-that-match-a-pattern-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25864, "totalSubmissionRaw": 38705}, "3035": {"acRate": 42.71538778634945, "difficulty": "Medium", "likes": 208, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "3035", "paidOnly": false, "title": "Maximum Palindromes After Operations", "titleSlug": "maximum-palindromes-after-operations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14507, "totalSubmissionRaw": 33962}, "3036": {"acRate": 32.641453245979754, "difficulty": "Hard", "likes": 141, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "3036", "paidOnly": false, "title": "Number of Subarrays That Match a Pattern II", "titleSlug": "number-of-subarrays-that-match-a-pattern-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10961, "totalSubmissionRaw": 33580}, "3037": {"acRate": 71.0720887245841, "difficulty": "Hard", "likes": 4, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "3037", "paidOnly": true, "title": "Find Pattern in Infinite Stream II", "titleSlug": "find-pattern-in-infinite-stream-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 769, "totalSubmissionRaw": 1082}, "3038": {"acRate": 52.18842672380332, "difficulty": "Easy", "likes": 73, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "3038", "paidOnly": false, "title": "Maximum Number of Operations With the Same Score I", "titleSlug": "maximum-number-of-operations-with-the-same-score-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33613, "totalSubmissionRaw": 64407}, "3039": {"acRate": 56.84973503262821, "difficulty": "Medium", "likes": 129, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "3039", "paidOnly": false, "title": "Apply Operations to Make String Empty", "titleSlug": "apply-operations-to-make-string-empty", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25961, "totalSubmissionRaw": 45666}, "3040": {"acRate": 33.434111407627604, "difficulty": "Medium", "likes": 151, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "3040", "paidOnly": false, "title": "Maximum Number of Operations With the Same Score II", "titleSlug": "maximum-number-of-operations-with-the-same-score-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19795, "totalSubmissionRaw": 59206}, "3041": {"acRate": 32.35169311720275, "difficulty": "Hard", "likes": 150, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "3041", "paidOnly": false, "title": "Maximize Consecutive Elements in an Array After Modification", "titleSlug": "maximize-consecutive-elements-in-an-array-after-modification", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7624, "totalSubmissionRaw": 23566}, "3042": {"acRate": 65.39355638592805, "difficulty": "Easy", "likes": 101, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "3042", "paidOnly": false, "title": "Count Prefix and Suffix Pairs I", "titleSlug": "count-prefix-and-suffix-pairs-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 37976, "totalSubmissionRaw": 58073}, "3043": {"acRate": 35.303556707101635, "difficulty": "Medium", "likes": 162, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "3043", "paidOnly": false, "title": "Find the Length of the Longest Common Prefix", "titleSlug": "find-the-length-of-the-longest-common-prefix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23981, "totalSubmissionRaw": 67928}, "3044": {"acRate": 48.34713335842429, "difficulty": "Medium", "likes": 87, "dislikes": 64, "categoryTitle": "Algorithms", "frontendQuestionId": "3044", "paidOnly": false, "title": "Most Frequent Prime", "titleSlug": "most-frequent-prime", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 15415, "totalSubmissionRaw": 31884}, "3045": {"acRate": 25.050728097397943, "difficulty": "Hard", "likes": 155, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "3045", "paidOnly": false, "title": "Count Prefix and Suffix Pairs II", "titleSlug": "count-prefix-and-suffix-pairs-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}, {"name": "Rolling Hash", "id": "VG9waWNUYWdOb2RlOjU2NTk4", "slug": "rolling-hash"}, {"name": "String Matching", "id": "VG9waWNUYWdOb2RlOjYxMDUy", "slug": "string-matching"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8395, "totalSubmissionRaw": 33512}, "3046": {"acRate": 58.66641543208423, "difficulty": "Easy", "likes": 103, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "3046", "paidOnly": false, "title": "Split the Array", "titleSlug": "split-the-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 49816, "totalSubmissionRaw": 84914}, "3047": {"acRate": 45.439538722652344, "difficulty": "Medium", "likes": 101, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "3047", "paidOnly": false, "title": "Find the Largest Area of Square Inside Two Rectangles", "titleSlug": "find-the-largest-area-of-square-inside-two-rectangles", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19544, "totalSubmissionRaw": 43011}, "3048": {"acRate": 36.11244071189243, "difficulty": "Medium", "likes": 172, "dislikes": 79, "categoryTitle": "Algorithms", "frontendQuestionId": "3048", "paidOnly": false, "title": "Earliest Second to Mark Indices I", "titleSlug": "earliest-second-to-mark-indices-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8299, "totalSubmissionRaw": 22981}, "3049": {"acRate": 23.045899750336083, "difficulty": "Hard", "likes": 73, "dislikes": 18, "categoryTitle": "Algorithms", "frontendQuestionId": "3049", "paidOnly": false, "title": "Earliest Second to Mark Indices II", "titleSlug": "earliest-second-to-mark-indices-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2400, "totalSubmissionRaw": 10414}, "3050": {"acRate": 68.38235294117648, "difficulty": "Medium", "likes": 7, "dislikes": 0, "categoryTitle": "Database", "frontendQuestionId": "3050", "paidOnly": true, "title": "Pizza Toppings Cost Analysis", "titleSlug": "pizza-toppings-cost-analysis", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1302, "totalSubmissionRaw": 1904}, "3051": {"acRate": 74.04914170313026, "difficulty": "Easy", "likes": 10, "dislikes": 0, "categoryTitle": "Database", "frontendQuestionId": "3051", "paidOnly": true, "title": "Find Candidates for Data Scientist Position", "titleSlug": "find-candidates-for-data-scientist-position", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2200, "totalSubmissionRaw": 2971}, "3052": {"acRate": 73.75954198473282, "difficulty": "Hard", "likes": 4, "dislikes": 5, "categoryTitle": "Database", "frontendQuestionId": "3052", "paidOnly": true, "title": "Maximize Items", "titleSlug": "maximize-items", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 773, "totalSubmissionRaw": 1048}, "3053": {"acRate": 50.21937225784677, "difficulty": "Easy", "likes": 7, "dislikes": 0, "categoryTitle": "Database", "frontendQuestionId": "3053", "paidOnly": true, "title": "Classifying Triangles by Lengths", "titleSlug": "classifying-triangles-by-lengths", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1488, "totalSubmissionRaw": 2963}, "3054": {"acRate": 79.65496728138012, "difficulty": "Medium", "likes": 7, "dislikes": 1, "categoryTitle": "Database", "frontendQuestionId": "3054", "paidOnly": true, "title": "Binary Tree Nodes", "titleSlug": "binary-tree-nodes", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1339, "totalSubmissionRaw": 1681}, "3055": {"acRate": 60.29411764705882, "difficulty": "Medium", "likes": 5, "dislikes": 3, "categoryTitle": "Database", "frontendQuestionId": "3055", "paidOnly": true, "title": "Top Percentile Fraud", "titleSlug": "top-percentile-fraud", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1230, "totalSubmissionRaw": 2040}, "3056": {"acRate": 59.21969345099861, "difficulty": "Medium", "likes": 2, "dislikes": 1, "categoryTitle": "Database", "frontendQuestionId": "3056", "paidOnly": true, "title": "Snaps Analysis", "titleSlug": "snaps-analysis", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1275, "totalSubmissionRaw": 2153}, "3057": {"acRate": 68.43971631205675, "difficulty": "Hard", "likes": 5, "dislikes": 3, "categoryTitle": "Database", "frontendQuestionId": "3057", "paidOnly": true, "title": "Employees Project Allocation", "titleSlug": "employees-project-allocation", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 965, "totalSubmissionRaw": 1410}, "3058": {"acRate": 52.47148288973384, "difficulty": "Medium", "likes": 9, "dislikes": 2, "categoryTitle": "Database", "frontendQuestionId": "3058", "paidOnly": true, "title": "Friends With No Mutual Friends", "titleSlug": "friends-with-no-mutual-friends", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1104, "totalSubmissionRaw": 2104}, "3059": {"acRate": 67.41303478608557, "difficulty": "Easy", "likes": 6, "dislikes": 7, "categoryTitle": "Database", "frontendQuestionId": "3059", "paidOnly": true, "title": "Find All Unique Email Domains", "titleSlug": "find-all-unique-email-domains", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 1686, "totalSubmissionRaw": 2501}, "3060": {"acRate": 40.3485254691689, "difficulty": "Hard", "likes": 3, "dislikes": 10, "categoryTitle": "Database", "frontendQuestionId": "3060", "paidOnly": true, "title": "User Activities within Time Bounds", "titleSlug": "user-activities-within-time-bounds", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 903, "totalSubmissionRaw": 2238}, "3061": {"acRate": 77.93017456359102, "difficulty": "Hard", "likes": 8, "dislikes": 4, "categoryTitle": "Database", "frontendQuestionId": "3061", "paidOnly": true, "title": "Calculate Trapping Rain Water", "titleSlug": "calculate-trapping-rain-water", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 625, "totalSubmissionRaw": 802}, "3062": {"acRate": 80.44515103338632, "difficulty": "Easy", "likes": 26, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "3062", "paidOnly": true, "title": "Winner of the Linked List Game", "titleSlug": "winner-of-the-linked-list-game", "topicTags": [{"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 8600, "totalSubmissionRaw": 10690}, "3063": {"acRate": 86.04466413628741, "difficulty": "Easy", "likes": 37, "dislikes": 18, "categoryTitle": "Algorithms", "frontendQuestionId": "3063", "paidOnly": true, "title": "Linked List Frequency", "titleSlug": "linked-list-frequency", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 9748, "totalSubmissionRaw": 11329}, "3064": {"acRate": 90.83402146985962, "difficulty": "Medium", "likes": 9, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "3064", "paidOnly": true, "title": "Guess the Number Using Bitwise Questions I", "titleSlug": "guess-the-number-using-bitwise-questions-i", "topicTags": [{"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1100, "totalSubmissionRaw": 1211}, "3065": {"acRate": 86.22335842714087, "difficulty": "Easy", "likes": 85, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "3065", "paidOnly": false, "title": "Minimum Operations to Exceed Threshold Value I", "titleSlug": "minimum-operations-to-exceed-threshold-value-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 61047, "totalSubmissionRaw": 70801}, "3066": {"acRate": 27.76828991401692, "difficulty": "Medium", "likes": 84, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "3066", "paidOnly": false, "title": "Minimum Operations to Exceed Threshold Value II", "titleSlug": "minimum-operations-to-exceed-threshold-value-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28129, "totalSubmissionRaw": 101299}, "3067": {"acRate": 57.96935414578262, "difficulty": "Medium", "likes": 188, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "3067", "paidOnly": false, "title": "Count Pairs of Connectable Servers in a Weighted Tree Network", "titleSlug": "count-pairs-of-connectable-servers-in-a-weighted-tree-network", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 12144, "totalSubmissionRaw": 20949}, "3068": {"acRate": 66.92199305890475, "difficulty": "Hard", "likes": 627, "dislikes": 92, "categoryTitle": "Algorithms", "frontendQuestionId": "3068", "paidOnly": false, "title": "Find the Maximum Sum of Node Values", "titleSlug": "find-the-maximum-sum-of-node-values", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 70768, "totalSubmissionRaw": 105747}, "3069": {"acRate": 72.80346039470128, "difficulty": "Easy", "likes": 74, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "3069", "paidOnly": false, "title": "Distribute Elements Into Two Arrays I", "titleSlug": "distribute-elements-into-two-arrays-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 43088, "totalSubmissionRaw": 59184}, "3070": {"acRate": 59.57275570272259, "difficulty": "Medium", "likes": 135, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "3070", "paidOnly": false, "title": "Count Submatrices with Top-Left Element and Sum Less Than k", "titleSlug": "count-submatrices-with-top-left-element-and-sum-less-than-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25907, "totalSubmissionRaw": 43488}, "3071": {"acRate": 62.88401253918495, "difficulty": "Medium", "likes": 92, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "3071", "paidOnly": false, "title": "Minimum Operations to Write the Letter Y on a Grid", "titleSlug": "minimum-operations-to-write-the-letter-y-on-a-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18054, "totalSubmissionRaw": 28710}, "3072": {"acRate": 27.802751668709984, "difficulty": "Hard", "likes": 130, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "3072", "paidOnly": false, "title": "Distribute Elements Into Two Arrays II", "titleSlug": "distribute-elements-into-two-arrays-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10205, "totalSubmissionRaw": 36705}, "3073": {"acRate": 41.31106988249845, "difficulty": "Medium", "likes": 12, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "3073", "paidOnly": true, "title": "Maximum Increasing Triplet Value", "titleSlug": "maximum-increasing-triplet-value", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 668, "totalSubmissionRaw": 1617}, "3074": {"acRate": 67.13261545548774, "difficulty": "Easy", "likes": 87, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "3074", "paidOnly": false, "title": "Apple Redistribution into Boxes", "titleSlug": "apple-redistribution-into-boxes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 46633, "totalSubmissionRaw": 69464}, "3075": {"acRate": 55.04345235454079, "difficulty": "Medium", "likes": 641, "dislikes": 89, "categoryTitle": "Algorithms", "frontendQuestionId": "3075", "paidOnly": false, "title": "Maximize Happiness of Selected Children", "titleSlug": "maximize-happiness-of-selected-children", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 173672, "totalSubmissionRaw": 315518}, "3076": {"acRate": 45.907624384445576, "difficulty": "Medium", "likes": 127, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "3076", "paidOnly": false, "title": "Shortest Uncommon Substring in an Array", "titleSlug": "shortest-uncommon-substring-in-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21628, "totalSubmissionRaw": 47112}, "3077": {"acRate": 27.974621330592914, "difficulty": "Hard", "likes": 130, "dislikes": 75, "categoryTitle": "Algorithms", "frontendQuestionId": "3077", "paidOnly": false, "title": "Maximum Strength of K Disjoint Subarrays", "titleSlug": "maximum-strength-of-k-disjoint-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6261, "totalSubmissionRaw": 22381}, "3078": {"acRate": 67.02269692923899, "difficulty": "Medium", "likes": 8, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "3078", "paidOnly": true, "title": "Match Alphanumerical Pattern in Matrix I", "titleSlug": "match-alphanumerical-pattern-in-matrix-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 502, "totalSubmissionRaw": 749}, "3079": {"acRate": 74.44513937017192, "difficulty": "Easy", "likes": 94, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "3079", "paidOnly": false, "title": "Find the Sum of Encrypted Integers", "titleSlug": "find-the-sum-of-encrypted-integers", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 44041, "totalSubmissionRaw": 59159}, "3080": {"acRate": 49.411346936545655, "difficulty": "Medium", "likes": 111, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "3080", "paidOnly": false, "title": "Mark Elements on Array by Performing Queries", "titleSlug": "mark-elements-on-array-by-performing-queries", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18089, "totalSubmissionRaw": 36609}, "3081": {"acRate": 27.43694194132412, "difficulty": "Medium", "likes": 160, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "3081", "paidOnly": false, "title": "Replace Question Marks in String to Minimize Its Value", "titleSlug": "replace-question-marks-in-string-to-minimize-its-value", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13336, "totalSubmissionRaw": 48606}, "3082": {"acRate": 39.225050198078904, "difficulty": "Hard", "likes": 132, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "3082", "paidOnly": false, "title": "Find the Sum of the Power of All Subsequences", "titleSlug": "find-the-sum-of-the-power-of-all-subsequences", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7228, "totalSubmissionRaw": 18427}, "3083": {"acRate": 66.21385278774538, "difficulty": "Easy", "likes": 89, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "3083", "paidOnly": false, "title": "Existence of a Substring in a String and Its Reverse", "titleSlug": "existence-of-a-substring-in-a-string-and-its-reverse", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 43917, "totalSubmissionRaw": 66326}, "3084": {"acRate": 48.878006780390685, "difficulty": "Medium", "likes": 108, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "3084", "paidOnly": false, "title": "Count Substrings Starting and Ending with Given Character", "titleSlug": "count-substrings-starting-and-ending-with-given-character", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 36332, "totalSubmissionRaw": 74332}, "3085": {"acRate": 44.0269272334294, "difficulty": "Medium", "likes": 193, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "3085", "paidOnly": false, "title": "Minimum Deletions to Make String K-Special", "titleSlug": "minimum-deletions-to-make-string-k-special", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19555, "totalSubmissionRaw": 44416}, "3086": {"acRate": 23.091305702711125, "difficulty": "Hard", "likes": 50, "dislikes": 45, "categoryTitle": "Algorithms", "frontendQuestionId": "3086", "paidOnly": false, "title": "Minimum Moves to Pick K Ones", "titleSlug": "minimum-moves-to-pick-k-ones", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2964, "totalSubmissionRaw": 12836}, "3087": {"acRate": 63.9686684073107, "difficulty": "Medium", "likes": 5, "dislikes": 6, "categoryTitle": "Database", "frontendQuestionId": "3087", "paidOnly": true, "title": "Find Trending Hashtags", "titleSlug": "find-trending-hashtags", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 980, "totalSubmissionRaw": 1532}, "3088": {"acRate": 54.08299866131191, "difficulty": "Hard", "likes": 8, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "3088", "paidOnly": true, "title": "Make String Anti-palindrome", "titleSlug": "make-string-anti-palindrome", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 404, "totalSubmissionRaw": 747}, "3089": {"acRate": 39.86519017814155, "difficulty": "Medium", "likes": 7, "dislikes": 15, "categoryTitle": "Database", "frontendQuestionId": "3089", "paidOnly": true, "title": "Find Bursty Behavior", "titleSlug": "find-bursty-behavior", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 828, "totalSubmissionRaw": 2077}, "3090": {"acRate": 63.760015507883175, "difficulty": "Easy", "likes": 166, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "3090", "paidOnly": false, "title": "Maximum Length Substring With Two Occurrences", "titleSlug": "maximum-length-substring-with-two-occurrences", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 39470, "totalSubmissionRaw": 61904}, "3091": {"acRate": 44.63044748977074, "difficulty": "Medium", "likes": 156, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "3091", "paidOnly": false, "title": "Apply Operations to Make Sum of Array Greater Than or Equal to k", "titleSlug": "apply-operations-to-make-sum-of-array-greater-than-or-equal-to-k", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27487, "totalSubmissionRaw": 61588}, "3092": {"acRate": 42.686417163706274, "difficulty": "Medium", "likes": 221, "dislikes": 28, "categoryTitle": "Algorithms", "frontendQuestionId": "3092", "paidOnly": false, "title": "Most Frequent IDs", "titleSlug": "most-frequent-ids", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19538, "totalSubmissionRaw": 45771}, "3093": {"acRate": 41.42629623075562, "difficulty": "Hard", "likes": 125, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "3093", "paidOnly": false, "title": "Longest Common Suffix Queries", "titleSlug": "longest-common-suffix-queries", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Trie", "id": "VG9waWNUYWdOb2RlOjI3", "slug": "trie"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9364, "totalSubmissionRaw": 22604}, "3094": {"acRate": 80.85443037974683, "difficulty": "Medium", "likes": 11, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "3094", "paidOnly": true, "title": "Guess the Number Using Bitwise Questions II", "titleSlug": "guess-the-number-using-bitwise-questions-ii", "topicTags": [{"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Interactive", "id": "VG9waWNUYWdOb2RlOjYxMDU5", "slug": "interactive"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 511, "totalSubmissionRaw": 632}, "3095": {"acRate": 41.06634894631022, "difficulty": "Easy", "likes": 84, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "3095", "paidOnly": false, "title": "Shortest Subarray With OR at Least K I", "titleSlug": "shortest-subarray-with-or-at-least-k-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27574, "totalSubmissionRaw": 67145}, "3096": {"acRate": 40.64815159524962, "difficulty": "Medium", "likes": 78, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "3096", "paidOnly": false, "title": "Minimum Levels to Gain More Points", "titleSlug": "minimum-levels-to-gain-more-points", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21837, "totalSubmissionRaw": 53722}, "3097": {"acRate": 30.337333545064766, "difficulty": "Medium", "likes": 188, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "3097", "paidOnly": false, "title": "Shortest Subarray With OR at Least K II", "titleSlug": "shortest-subarray-with-or-at-least-k-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13373, "totalSubmissionRaw": 44081}, "3098": {"acRate": 24.478549724468248, "difficulty": "Hard", "likes": 122, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "3098", "paidOnly": false, "title": "Find the Sum of Subsequence Powers", "titleSlug": "find-the-sum-of-subsequence-powers", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4753, "totalSubmissionRaw": 19417}, "3099": {"acRate": 83.00189460388745, "difficulty": "Easy", "likes": 121, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "3099", "paidOnly": false, "title": "Harshad Number", "titleSlug": "harshad-number", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 59143, "totalSubmissionRaw": 71255}, "3100": {"acRate": 63.79005198923343, "difficulty": "Medium", "likes": 136, "dislikes": 36, "categoryTitle": "Algorithms", "frontendQuestionId": "3100", "paidOnly": false, "title": "Water Bottles II", "titleSlug": "water-bottles-ii", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34601, "totalSubmissionRaw": 54242}, "3101": {"acRate": 57.19995356473573, "difficulty": "Medium", "likes": 203, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "3101", "paidOnly": false, "title": "Count Alternating Subarrays", "titleSlug": "count-alternating-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34491, "totalSubmissionRaw": 60299}, "3102": {"acRate": 32.6388618960625, "difficulty": "Hard", "likes": 162, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "3102", "paidOnly": false, "title": "Minimize Manhattan Distances", "titleSlug": "minimize-manhattan-distances", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8397, "totalSubmissionRaw": 25727}, "3103": {"acRate": 65.35244922341697, "difficulty": "Hard", "likes": 7, "dislikes": 0, "categoryTitle": "Database", "frontendQuestionId": "3103", "paidOnly": true, "title": "Find Trending Hashtags II ", "titleSlug": "find-trending-hashtags-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 547, "totalSubmissionRaw": 837}, "3104": {"acRate": 56.860465116279066, "difficulty": "Hard", "likes": 8, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "3104", "paidOnly": true, "title": "Find Longest Self-Contained Substring", "titleSlug": "find-longest-self-contained-substring", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 489, "totalSubmissionRaw": 860}, "3105": {"acRate": 57.01725729706697, "difficulty": "Easy", "likes": 108, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "3105", "paidOnly": false, "title": "Longest Strictly Increasing or Strictly Decreasing Subarray", "titleSlug": "longest-strictly-increasing-or-strictly-decreasing-subarray", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 40143, "totalSubmissionRaw": 70405}, "3106": {"acRate": 63.53424449121383, "difficulty": "Medium", "likes": 143, "dislikes": 18, "categoryTitle": "Algorithms", "frontendQuestionId": "3106", "paidOnly": false, "title": "Lexicographically Smallest String After Operations With Constraint", "titleSlug": "lexicographically-smallest-string-after-operations-with-constraint", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25056, "totalSubmissionRaw": 39437}, "3107": {"acRate": 48.5361326760732, "difficulty": "Medium", "likes": 130, "dislikes": 178, "categoryTitle": "Algorithms", "frontendQuestionId": "3107", "paidOnly": false, "title": "Minimum Operations to Make Median of Array Equal to K", "titleSlug": "minimum-operations-to-make-median-of-array-equal-to-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24320, "totalSubmissionRaw": 50107}, "3108": {"acRate": 45.80910289214546, "difficulty": "Hard", "likes": 177, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "3108", "paidOnly": false, "title": "Minimum Cost Walk in Weighted Graph", "titleSlug": "minimum-cost-walk-in-weighted-graph", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11816, "totalSubmissionRaw": 25794}, "3109": {"acRate": 41.2262156448203, "difficulty": "Medium", "likes": 10, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "3109", "paidOnly": true, "title": "Find the Index of Permutation", "titleSlug": "find-the-index-of-permutation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Merge Sort", "id": "VG9waWNUYWdOb2RlOjYxMDUx", "slug": "merge-sort"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 390, "totalSubmissionRaw": 946}, "3110": {"acRate": 93.17122397236169, "difficulty": "Easy", "likes": 570, "dislikes": 36, "categoryTitle": "Algorithms", "frontendQuestionId": "3110", "paidOnly": false, "title": "Score of a String", "titleSlug": "score-of-a-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 259436, "totalSubmissionRaw": 278451}, "3111": {"acRate": 63.83113559363346, "difficulty": "Medium", "likes": 87, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "3111", "paidOnly": false, "title": "Minimum Rectangles to Cover Points", "titleSlug": "minimum-rectangles-to-cover-points", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 26188, "totalSubmissionRaw": 41026}, "3112": {"acRate": 34.67628858269924, "difficulty": "Medium", "likes": 153, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "3112", "paidOnly": false, "title": "Minimum Time to Visit Disappearing Nodes", "titleSlug": "minimum-time-to-visit-disappearing-nodes", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18548, "totalSubmissionRaw": 53489}, "3113": {"acRate": 30.040415882516275, "difficulty": "Hard", "likes": 200, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "3113", "paidOnly": false, "title": "Find the Number of Subarrays Where Boundary Elements Are Maximum", "titleSlug": "find-the-number-of-subarrays-where-boundary-elements-are-maximum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9737, "totalSubmissionRaw": 32413}, "3114": {"acRate": 35.60740795961618, "difficulty": "Easy", "likes": 92, "dislikes": 42, "categoryTitle": "Algorithms", "frontendQuestionId": "3114", "paidOnly": false, "title": "Latest Time You Can Obtain After Replacing Characters", "titleSlug": "latest-time-you-can-obtain-after-replacing-characters", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 33435, "totalSubmissionRaw": 93899}, "3115": {"acRate": 58.33536995173214, "difficulty": "Medium", "likes": 102, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "3115", "paidOnly": false, "title": "Maximum Prime Difference", "titleSlug": "maximum-prime-difference", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 38190, "totalSubmissionRaw": 65467}, "3116": {"acRate": 16.541735226603286, "difficulty": "Hard", "likes": 209, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "3116", "paidOnly": false, "title": "Kth Smallest Amount With Single Denomination Combination", "titleSlug": "kth-smallest-amount-with-single-denomination-combination", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8143, "totalSubmissionRaw": 49227}, "3117": {"acRate": 27.87029435909464, "difficulty": "Hard", "likes": 109, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "3117", "paidOnly": false, "title": "Minimum Sum of Values by Dividing Array", "titleSlug": "minimum-sum-of-values-by-dividing-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4753, "totalSubmissionRaw": 17054}, "3118": {"acRate": 62.61151662611517, "difficulty": "Medium", "likes": 3, "dislikes": 4, "categoryTitle": "Database", "frontendQuestionId": "3118", "paidOnly": true, "title": "Friday Purchase III ", "titleSlug": "friday-purchase-iii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 772, "totalSubmissionRaw": 1233}, "3119": {"acRate": 60.20042949176807, "difficulty": "Medium", "likes": 8, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "3119", "paidOnly": true, "title": "Maximum Number of Potholes That Can Be Fixed", "titleSlug": "maximum-number-of-potholes-that-can-be-fixed", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 841, "totalSubmissionRaw": 1397}, "3120": {"acRate": 65.57311903920876, "difficulty": "Easy", "likes": 121, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "3120", "paidOnly": false, "title": "Count the Number of Special Characters I", "titleSlug": "count-the-number-of-special-characters-i", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 44553, "totalSubmissionRaw": 67944}, "3121": {"acRate": 41.477096508852604, "difficulty": "Medium", "likes": 142, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "3121", "paidOnly": false, "title": "Count the Number of Special Characters II", "titleSlug": "count-the-number-of-special-characters-ii", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30759, "totalSubmissionRaw": 74159}, "3122": {"acRate": 41.17109136112937, "difficulty": "Medium", "likes": 211, "dislikes": 10, "categoryTitle": "Algorithms", "frontendQuestionId": "3122", "paidOnly": false, "title": "Minimum Number of Operations to Satisfy Conditions", "titleSlug": "minimum-number-of-operations-to-satisfy-conditions", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 14407, "totalSubmissionRaw": 34993}, "3123": {"acRate": 48.74551971326165, "difficulty": "Hard", "likes": 224, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "3123", "paidOnly": false, "title": "Find Edges in Shortest Paths", "titleSlug": "find-edges-in-shortest-paths", "topicTags": [{"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}, {"name": "Shortest Path", "id": "VG9waWNUYWdOb2RlOjYxMDc2", "slug": "shortest-path"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11560, "totalSubmissionRaw": 23715}, "3124": {"acRate": 71.83098591549296, "difficulty": "Medium", "likes": 4, "dislikes": 3, "categoryTitle": "Database", "frontendQuestionId": "3124", "paidOnly": true, "title": "Find Longest Calls", "titleSlug": "find-longest-calls", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 918, "totalSubmissionRaw": 1278}, "3125": {"acRate": 68.8787185354691, "difficulty": "Medium", "likes": 9, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "3125", "paidOnly": true, "title": "Maximum Number That Makes Result of Bitwise AND Zero", "titleSlug": "maximum-number-that-makes-result-of-bitwise-and-zero", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 602, "totalSubmissionRaw": 874}, "3126": {"acRate": 56.85096153846154, "difficulty": "Medium", "likes": 6, "dislikes": 12, "categoryTitle": "Database", "frontendQuestionId": "3126", "paidOnly": true, "title": "Server Utilization Time", "titleSlug": "server-utilization-time", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 946, "totalSubmissionRaw": 1664}, "3127": {"acRate": 51.13046626704752, "difficulty": "Easy", "likes": 66, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "3127", "paidOnly": false, "title": "Make a Square with the Same Color", "titleSlug": "make-a-square-with-the-same-color", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25419, "totalSubmissionRaw": 49714}, "3128": {"acRate": 47.579590056694286, "difficulty": "Medium", "likes": 102, "dislikes": 18, "categoryTitle": "Algorithms", "frontendQuestionId": "3128", "paidOnly": false, "title": "Right Triangles", "titleSlug": "right-triangles", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 18547, "totalSubmissionRaw": 38981}, "3129": {"acRate": 26.976711510766094, "difficulty": "Medium", "likes": 112, "dislikes": 34, "categoryTitle": "Algorithms", "frontendQuestionId": "3129", "paidOnly": false, "title": "Find All Possible Stable Binary Arrays I", "titleSlug": "find-all-possible-stable-binary-arrays-i", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 7680, "totalSubmissionRaw": 28469}, "3130": {"acRate": 28.350857251113005, "difficulty": "Hard", "likes": 58, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "3130", "paidOnly": false, "title": "Find All Possible Stable Binary Arrays II", "titleSlug": "find-all-possible-stable-binary-arrays-ii", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 2993, "totalSubmissionRaw": 10557}, "3131": {"acRate": 82.20973498367378, "difficulty": "Easy", "likes": 116, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "3131", "paidOnly": false, "title": "Find the Integer Added to Array I", "titleSlug": "find-the-integer-added-to-array-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 54131, "totalSubmissionRaw": 65845}, "3132": {"acRate": 31.201117318435756, "difficulty": "Medium", "likes": 150, "dislikes": 36, "categoryTitle": "Algorithms", "frontendQuestionId": "3132", "paidOnly": false, "title": "Find the Integer Added to Array II", "titleSlug": "find-the-integer-added-to-array-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 21223, "totalSubmissionRaw": 68020}, "3133": {"acRate": 37.949694911510534, "difficulty": "Medium", "likes": 194, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "3133", "paidOnly": false, "title": "Minimum Array End", "titleSlug": "minimum-array-end", "topicTags": [{"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13745, "totalSubmissionRaw": 36219}, "3134": {"acRate": 28.626873004175877, "difficulty": "Hard", "likes": 141, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "3134", "paidOnly": false, "title": "Find the Median of the Uniqueness Array", "titleSlug": "find-the-median-of-the-uniqueness-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5827, "totalSubmissionRaw": 20355}, "3135": {"acRate": 56.09756097560976, "difficulty": "Medium", "likes": 10, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "3135", "paidOnly": true, "title": "Equalize Strings by Adding or Removing Characters at Ends", "titleSlug": "equalize-strings-by-adding-or-removing-characters-at-ends", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Hash Function", "id": "VG9waWNUYWdOb2RlOjYxMDY1", "slug": "hash-function"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 575, "totalSubmissionRaw": 1025}, "3136": {"acRate": 37.649597984364, "difficulty": "Easy", "likes": 99, "dislikes": 95, "categoryTitle": "Algorithms", "frontendQuestionId": "3136", "paidOnly": false, "title": "Valid Word", "titleSlug": "valid-word", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 40645, "totalSubmissionRaw": 107956}, "3137": {"acRate": 62.627634293474, "difficulty": "Medium", "likes": 112, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "3137", "paidOnly": false, "title": "Minimum Number of Operations to Make Word K-Periodic", "titleSlug": "minimum-number-of-operations-to-make-word-k-periodic", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23982, "totalSubmissionRaw": 38293}, "3138": {"acRate": 41.996722207047256, "difficulty": "Medium", "likes": 166, "dislikes": 95, "categoryTitle": "Algorithms", "frontendQuestionId": "3138", "paidOnly": false, "title": "Minimum Length of Anagram Concatenation", "titleSlug": "minimum-length-of-anagram-concatenation", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27675, "totalSubmissionRaw": 65898}, "3139": {"acRate": 16.604728394085555, "difficulty": "Hard", "likes": 116, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "3139", "paidOnly": false, "title": "Minimum Cost to Equalize Array", "titleSlug": "minimum-cost-to-equalize-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4200, "totalSubmissionRaw": 25294}, "3140": {"acRate": 63.71473354231975, "difficulty": "Medium", "likes": 4, "dislikes": 2, "categoryTitle": "Database", "frontendQuestionId": "3140", "paidOnly": true, "title": "Consecutive Available Seats II", "titleSlug": "consecutive-available-seats-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 813, "totalSubmissionRaw": 1276}, "3141": {"acRate": 71.84801381692574, "difficulty": "Hard", "likes": 11, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "3141", "paidOnly": true, "title": "Maximum Hamming Distances", "titleSlug": "maximum-hamming-distances", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 416, "totalSubmissionRaw": 579}, "3142": {"acRate": 43.146862665033346, "difficulty": "Easy", "likes": 64, "dislikes": 0, "categoryTitle": "Algorithms", "frontendQuestionId": "3142", "paidOnly": false, "title": "Check if Grid Satisfies Conditions", "titleSlug": "check-if-grid-satisfies-conditions", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 31700, "totalSubmissionRaw": 73470}, "3143": {"acRate": 38.90686308253597, "difficulty": "Medium", "likes": 142, "dislikes": 20, "categoryTitle": "Algorithms", "frontendQuestionId": "3143", "paidOnly": false, "title": "Maximum Points Inside the Square", "titleSlug": "maximum-points-inside-the-square", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16956, "totalSubmissionRaw": 43581}, "3144": {"acRate": 40.92923735289622, "difficulty": "Medium", "likes": 129, "dislikes": 30, "categoryTitle": "Algorithms", "frontendQuestionId": "3144", "paidOnly": false, "title": "Minimum Substring Partition of Equal Character Frequency", "titleSlug": "minimum-substring-partition-of-equal-character-frequency", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13390, "totalSubmissionRaw": 32715}, "3145": {"acRate": 24.847857050369026, "difficulty": "Hard", "likes": 54, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "3145", "paidOnly": false, "title": "Find Products of Elements of Big Array", "titleSlug": "find-products-of-elements-of-big-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1919, "totalSubmissionRaw": 7723}, "3146": {"acRate": 89.08438970421615, "difficulty": "Easy", "likes": 115, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "3146", "paidOnly": false, "title": "Permutation Difference between Two Strings", "titleSlug": "permutation-difference-between-two-strings", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 66832, "totalSubmissionRaw": 75021}, "3147": {"acRate": 40.52188011013431, "difficulty": "Medium", "likes": 147, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "3147", "paidOnly": false, "title": "Taking Maximum Energy From the Mystic Dungeon", "titleSlug": "taking-maximum-energy-from-the-mystic-dungeon", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 28993, "totalSubmissionRaw": 71549}, "3148": {"acRate": 47.92218068705831, "difficulty": "Medium", "likes": 221, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "3148", "paidOnly": false, "title": "Maximum Difference Score in a Grid", "titleSlug": "maximum-difference-score-in-a-grid", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17563, "totalSubmissionRaw": 36649}, "3149": {"acRate": 23.036706241150203, "difficulty": "Hard", "likes": 102, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "3149", "paidOnly": false, "title": "Find the Minimum Cost Array Permutation", "titleSlug": "find-the-minimum-cost-array-permutation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Bitmask", "id": "VG9waWNUYWdOb2RlOjYxMDc4", "slug": "bitmask"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4230, "totalSubmissionRaw": 18362}, "3150": {"acRate": 87.32901367890568, "difficulty": "Easy", "likes": 4, "dislikes": 2, "categoryTitle": "Database", "frontendQuestionId": "3150", "paidOnly": true, "title": "Invalid Tweets II", "titleSlug": "invalid-tweets-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1213, "totalSubmissionRaw": 1389}, "3151": {"acRate": 75.64976909032328, "difficulty": "Easy", "likes": 90, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "3151", "paidOnly": false, "title": "Special Array I", "titleSlug": "special-array-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 56350, "totalSubmissionRaw": 74488}, "3152": {"acRate": 30.032387010182944, "difficulty": "Medium", "likes": 180, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "3152", "paidOnly": false, "title": "Special Array II", "titleSlug": "special-array-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30879, "totalSubmissionRaw": 102819}, "3153": {"acRate": 43.69485853361728, "difficulty": "Medium", "likes": 168, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "3153", "paidOnly": false, "title": "Sum of Digit Differences of All Pairs", "titleSlug": "sum-of-digit-differences-of-all-pairs", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22980, "totalSubmissionRaw": 52592}, "3154": {"acRate": 36.441528884128786, "difficulty": "Hard", "likes": 126, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "3154", "paidOnly": false, "title": "Find Number of Ways to Reach the K-th Stair", "titleSlug": "find-number-of-ways-to-reach-the-k-th-stair", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Memoization", "id": "VG9waWNUYWdOb2RlOjMz", "slug": "memoization"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10888, "totalSubmissionRaw": 29878}, "3155": {"acRate": 50.661375661375665, "difficulty": "Medium", "likes": 6, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "3155", "paidOnly": true, "title": "Maximum Number of Upgradable Servers", "titleSlug": "maximum-number-of-upgradable-servers", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 766, "totalSubmissionRaw": 1512}, "3156": {"acRate": 56.63265306122449, "difficulty": "Hard", "likes": 6, "dislikes": 1, "categoryTitle": "Database", "frontendQuestionId": "3156", "paidOnly": true, "title": "Employee Task Duration and Concurrent Tasks", "titleSlug": "employee-task-duration-and-concurrent-tasks", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 444, "totalSubmissionRaw": 784}, "3157": {"acRate": 69.17339962709758, "difficulty": "Medium", "likes": 10, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "3157", "paidOnly": true, "title": "Find the Level of Tree with Minimum Sum", "titleSlug": "find-the-level-of-tree-with-minimum-sum", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Binary Tree", "id": "VG9waWNUYWdOb2RlOjYxMDU3", "slug": "binary-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1113, "totalSubmissionRaw": 1609}, "3158": {"acRate": 82.0734420682934, "difficulty": "Easy", "likes": 91, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "3158", "paidOnly": false, "title": "Find the XOR of Numbers Which Appear Twice", "titleSlug": "find-the-xor-of-numbers-which-appear-twice", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 44634, "totalSubmissionRaw": 54383}, "3159": {"acRate": 73.63071951012077, "difficulty": "Medium", "likes": 109, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "3159", "paidOnly": false, "title": "Find Occurrences of an Element in an Array", "titleSlug": "find-occurrences-of-an-element-in-an-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34630, "totalSubmissionRaw": 47032}, "3160": {"acRate": 41.17400492516199, "difficulty": "Medium", "likes": 106, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "3160", "paidOnly": false, "title": "Find the Number of Distinct Colors Among the Balls", "titleSlug": "find-the-number-of-distinct-colors-among-the-balls", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23575, "totalSubmissionRaw": 57257}, "3161": {"acRate": 13.691758387677416, "difficulty": "Hard", "likes": 96, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "3161", "paidOnly": false, "title": "Block Placement Queries", "titleSlug": "block-placement-queries", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4640, "totalSubmissionRaw": 33889}, "3162": {"acRate": 86.77371109292548, "difficulty": "Easy", "likes": 98, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "3162", "paidOnly": false, "title": "Find the Number of Good Pairs I", "titleSlug": "find-the-number-of-good-pairs-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 61500, "totalSubmissionRaw": 70874}, "3163": {"acRate": 55.858975814692855, "difficulty": "Medium", "likes": 105, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "3163", "paidOnly": false, "title": "String Compression III", "titleSlug": "string-compression-iii", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 39356, "totalSubmissionRaw": 70456}, "3164": {"acRate": 25.66652405747498, "difficulty": "Medium", "likes": 200, "dislikes": 34, "categoryTitle": "Algorithms", "frontendQuestionId": "3164", "paidOnly": false, "title": "Find the Number of Good Pairs II", "titleSlug": "find-the-number-of-good-pairs-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24597, "totalSubmissionRaw": 95833}, "3165": {"acRate": 17.111164264785025, "difficulty": "Hard", "likes": 104, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "3165", "paidOnly": false, "title": "Maximum Sum of Subsequence With Non-adjacent Elements", "titleSlug": "maximum-sum-of-subsequence-with-non-adjacent-elements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Divide and Conquer", "id": "VG9waWNUYWdOb2RlOjEy", "slug": "divide-and-conquer"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5723, "totalSubmissionRaw": 33446}, "3166": {"acRate": 61.40489344909235, "difficulty": "Medium", "likes": 4, "dislikes": 2, "categoryTitle": "Database", "frontendQuestionId": "3166", "paidOnly": true, "title": "Calculate Parking Fees and Duration", "titleSlug": "calculate-parking-fees-and-duration", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 778, "totalSubmissionRaw": 1267}, "3167": {"acRate": 77.22725107193902, "difficulty": "Medium", "likes": 9, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "3167", "paidOnly": true, "title": "Better Compression of String", "titleSlug": "better-compression-of-string", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1621, "totalSubmissionRaw": 2099}, "3168": {"acRate": 80.35527364194542, "difficulty": "Easy", "likes": 107, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "3168", "paidOnly": false, "title": "Minimum Number of Chairs in a Waiting Room", "titleSlug": "minimum-number-of-chairs-in-a-waiting-room", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 51433, "totalSubmissionRaw": 64007}, "3169": {"acRate": 33.67365377665342, "difficulty": "Medium", "likes": 193, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "3169", "paidOnly": false, "title": "Count Days Without Meetings", "titleSlug": "count-days-without-meetings", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 37270, "totalSubmissionRaw": 110680}, "3170": {"acRate": 35.852574616926724, "difficulty": "Medium", "likes": 190, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "3170", "paidOnly": false, "title": "Lexicographically Minimum String After Removing Stars", "titleSlug": "lexicographically-minimum-string-after-removing-stars", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Heap (Priority Queue)", "id": "VG9waWNUYWdOb2RlOjYxMDUw", "slug": "heap-priority-queue"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25574, "totalSubmissionRaw": 71331}, "3171": {"acRate": 31.067808595898484, "difficulty": "Hard", "likes": 161, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "3171", "paidOnly": false, "title": "Find Subarray With Bitwise OR Closest to K", "titleSlug": "find-subarray-with-bitwise-or-closest-to-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11862, "totalSubmissionRaw": 38181}, "3172": {"acRate": 73.71937639198218, "difficulty": "Easy", "likes": 3, "dislikes": 0, "categoryTitle": "Database", "frontendQuestionId": "3172", "paidOnly": true, "title": "Second Day Verification", "titleSlug": "second-day-verification", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 993, "totalSubmissionRaw": 1347}, "3173": {"acRate": 95.85163494387507, "difficulty": "Easy", "likes": 9, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "3173", "paidOnly": true, "title": "Bitwise OR of Adjacent Elements", "titleSlug": "bitwise-or-of-adjacent-elements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1964, "totalSubmissionRaw": 2049}, "3174": {"acRate": 72.48403955447883, "difficulty": "Easy", "likes": 76, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "3174", "paidOnly": false, "title": "Clear Digits", "titleSlug": "clear-digits", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 47572, "totalSubmissionRaw": 65631}, "3175": {"acRate": 39.455932335313804, "difficulty": "Medium", "likes": 114, "dislikes": 13, "categoryTitle": "Algorithms", "frontendQuestionId": "3175", "paidOnly": false, "title": "Find The First Player to win K Games in a Row", "titleSlug": "find-the-first-player-to-win-k-games-in-a-row", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30415, "totalSubmissionRaw": 77086}, "3176": {"acRate": 30.330009288631064, "difficulty": "Medium", "likes": 124, "dislikes": 68, "categoryTitle": "Algorithms", "frontendQuestionId": "3176", "paidOnly": false, "title": "Find the Maximum Length of a Good Subsequence I", "titleSlug": "find-the-maximum-length-of-a-good-subsequence-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 17306, "totalSubmissionRaw": 57059}, "3177": {"acRate": 24.06696764484575, "difficulty": "Hard", "likes": 98, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "3177", "paidOnly": false, "title": "Find the Maximum Length of a Good Subsequence II", "titleSlug": "find-the-maximum-length-of-a-good-subsequence-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6397, "totalSubmissionRaw": 26580}, "3178": {"acRate": 61.82914905044551, "difficulty": "Easy", "likes": 128, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "3178", "paidOnly": false, "title": "Find the Child Who Has the Ball After K Seconds", "titleSlug": "find-the-child-who-has-the-ball-after-k-seconds", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 44896, "totalSubmissionRaw": 72613}, "3179": {"acRate": 54.60406654343808, "difficulty": "Medium", "likes": 94, "dislikes": 14, "categoryTitle": "Algorithms", "frontendQuestionId": "3179", "paidOnly": false, "title": "Find the N-th Value After K Seconds", "titleSlug": "find-the-n-th-value-after-k-seconds", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 36926, "totalSubmissionRaw": 67625}, "3180": {"acRate": 29.31506203122789, "difficulty": "Medium", "likes": 161, "dislikes": 16, "categoryTitle": "Algorithms", "frontendQuestionId": "3180", "paidOnly": false, "title": "Maximum Total Reward Using Operations I", "titleSlug": "maximum-total-reward-using-operations-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24858, "totalSubmissionRaw": 84796}, "3181": {"acRate": 20.786262991414368, "difficulty": "Hard", "likes": 108, "dislikes": 32, "categoryTitle": "Algorithms", "frontendQuestionId": "3181", "paidOnly": false, "title": "Maximum Total Reward Using Operations II", "titleSlug": "maximum-total-reward-using-operations-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6440, "totalSubmissionRaw": 30982}, "3182": {"acRate": 55.57132718239887, "difficulty": "Medium", "likes": 6, "dislikes": 2, "categoryTitle": "Database", "frontendQuestionId": "3182", "paidOnly": true, "title": "Find Top Scoring Students", "titleSlug": "find-top-scoring-students", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 783, "totalSubmissionRaw": 1409}, "3183": {"acRate": 58.33998403830806, "difficulty": "Medium", "likes": 11, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "3183", "paidOnly": true, "title": "The Number of Ways to Make the Sum", "titleSlug": "the-number-of-ways-to-make-the-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 731, "totalSubmissionRaw": 1253}, "3184": {"acRate": 79.13946846951859, "difficulty": "Easy", "likes": 100, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "3184", "paidOnly": false, "title": "Count Pairs That Form a Complete Day I", "titleSlug": "count-pairs-that-form-a-complete-day-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 54315, "totalSubmissionRaw": 68632}, "3185": {"acRate": 42.91925669401444, "difficulty": "Medium", "likes": 146, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "3185", "paidOnly": false, "title": "Count Pairs That Form a Complete Day II", "titleSlug": "count-pairs-that-form-a-complete-day-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 39287, "totalSubmissionRaw": 91537}, "3186": {"acRate": 26.04182131722303, "difficulty": "Medium", "likes": 222, "dislikes": 28, "categoryTitle": "Algorithms", "frontendQuestionId": "3186", "paidOnly": false, "title": "Maximum Total Damage With Spell Casting", "titleSlug": "maximum-total-damage-with-spell-casting", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22803, "totalSubmissionRaw": 87563}, "3187": {"acRate": 26.835357208900945, "difficulty": "Hard", "likes": 109, "dislikes": 10, "categoryTitle": "Algorithms", "frontendQuestionId": "3187", "paidOnly": false, "title": "Peaks in Array", "titleSlug": "peaks-in-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8707, "totalSubmissionRaw": 32446}, "3188": {"acRate": 48.70349492671927, "difficulty": "Hard", "likes": 4, "dislikes": 3, "categoryTitle": "Database", "frontendQuestionId": "3188", "paidOnly": true, "title": "Find Top Scoring Students II", "titleSlug": "find-top-scoring-students-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 432, "totalSubmissionRaw": 887}, "3189": {"acRate": 77.0138089758343, "difficulty": "Medium", "likes": 38, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "3189", "paidOnly": true, "title": "Minimum Moves to Get a Peaceful Board", "titleSlug": "minimum-moves-to-get-a-peaceful-board", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}, {"name": "Counting Sort", "id": "VG9waWNUYWdOb2RlOjYxMDcy", "slug": "counting-sort"}], "hasSolution": true, "hasVideoSolution": false, "totalAcceptedRaw": 2677, "totalSubmissionRaw": 3476}, "3190": {"acRate": 89.79943226767183, "difficulty": "Easy", "likes": 118, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "3190", "paidOnly": false, "title": "Find Minimum Operations to Make All Elements Divisible by Three", "titleSlug": "find-minimum-operations-to-make-all-elements-divisible-by-three", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 77188, "totalSubmissionRaw": 85956}, "3191": {"acRate": 70.81170715529393, "difficulty": "Medium", "likes": 138, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "3191", "paidOnly": false, "title": "Minimum Operations to Make Binary Array Elements Equal to One I", "titleSlug": "minimum-operations-to-make-binary-array-elements-equal-to-one-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Queue", "id": "VG9waWNUYWdOb2RlOjM0", "slug": "queue"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 42703, "totalSubmissionRaw": 60305}, "3192": {"acRate": 65.0948406676783, "difficulty": "Medium", "likes": 114, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "3192", "paidOnly": false, "title": "Minimum Operations to Make Binary Array Elements Equal to One II", "titleSlug": "minimum-operations-to-make-binary-array-elements-equal-to-one-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34318, "totalSubmissionRaw": 52720}, "3193": {"acRate": 33.35085413929041, "difficulty": "Hard", "likes": 88, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "3193", "paidOnly": false, "title": "Count the Number of Inversions", "titleSlug": "count-the-number-of-inversions", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6345, "totalSubmissionRaw": 19025}, "3194": {"acRate": 85.14530249209857, "difficulty": "Easy", "likes": 97, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "3194", "paidOnly": false, "title": "Minimum Average of Smallest and Largest Elements", "titleSlug": "minimum-average-of-smallest-and-largest-elements", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 60884, "totalSubmissionRaw": 71506}, "3195": {"acRate": 73.9561950319215, "difficulty": "Medium", "likes": 99, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "3195", "paidOnly": false, "title": "Find the Minimum Area to Cover All Ones I", "titleSlug": "find-the-minimum-area-to-cover-all-ones-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 39270, "totalSubmissionRaw": 53099}, "3196": {"acRate": 28.396890543883014, "difficulty": "Medium", "likes": 156, "dislikes": 24, "categoryTitle": "Algorithms", "frontendQuestionId": "3196", "paidOnly": false, "title": "Maximize Total Cost of Alternating Subarrays", "titleSlug": "maximize-total-cost-of-alternating-subarrays", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 20895, "totalSubmissionRaw": 73582}, "3197": {"acRate": 36.96783550891562, "difficulty": "Hard", "likes": 64, "dislikes": 9, "categoryTitle": "Algorithms", "frontendQuestionId": "3197", "paidOnly": false, "title": "Find the Minimum Area to Cover All Ones II", "titleSlug": "find-the-minimum-area-to-cover-all-ones-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4333, "totalSubmissionRaw": 11721}, "3198": {"acRate": 81.69014084507043, "difficulty": "Easy", "likes": 4, "dislikes": 1, "categoryTitle": "Database", "frontendQuestionId": "3198", "paidOnly": true, "title": "Find Cities in Each State", "titleSlug": "find-cities-in-each-state", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 812, "totalSubmissionRaw": 994}, "3199": {"acRate": 83.89715832205682, "difficulty": "Easy", "likes": 7, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "3199", "paidOnly": true, "title": "Count Triplets with Even XOR Set Bits I", "titleSlug": "count-triplets-with-even-xor-set-bits-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 620, "totalSubmissionRaw": 739}, "3200": {"acRate": 42.34184914841849, "difficulty": "Easy", "likes": 123, "dislikes": 18, "categoryTitle": "Algorithms", "frontendQuestionId": "3200", "paidOnly": false, "title": "Maximum Height of a Triangle", "titleSlug": "maximum-height-of-a-triangle", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 34805, "totalSubmissionRaw": 82200}, "3201": {"acRate": 37.46644953104738, "difficulty": "Medium", "likes": 121, "dislikes": 15, "categoryTitle": "Algorithms", "frontendQuestionId": "3201", "paidOnly": false, "title": "Find the Maximum Length of Valid Subsequence I", "titleSlug": "find-the-maximum-length-of-valid-subsequence-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24847, "totalSubmissionRaw": 66318}, "3202": {"acRate": 39.02450791200309, "difficulty": "Medium", "likes": 175, "dislikes": 11, "categoryTitle": "Algorithms", "frontendQuestionId": "3202", "paidOnly": false, "title": "Find the Maximum Length of Valid Subsequence II", "titleSlug": "find-the-maximum-length-of-valid-subsequence-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16176, "totalSubmissionRaw": 41454}, "3203": {"acRate": 35.67179919848134, "difficulty": "Hard", "likes": 124, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "3203", "paidOnly": false, "title": "Find Minimum Diameter After Merging Two Trees", "titleSlug": "find-minimum-diameter-after-merging-two-trees", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8456, "totalSubmissionRaw": 23705}, "3204": {"acRate": 94.10526315789474, "difficulty": "Medium", "likes": 4, "dislikes": 2, "categoryTitle": "Database", "frontendQuestionId": "3204", "paidOnly": true, "title": "Bitwise User Permissions Analysis", "titleSlug": "bitwise-user-permissions-analysis", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 447, "totalSubmissionRaw": 475}, "3205": {"acRate": 79.85212569316081, "difficulty": "Medium", "likes": 16, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "3205", "paidOnly": true, "title": "Maximum Array Hopping Score I", "titleSlug": "maximum-array-hopping-score-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 864, "totalSubmissionRaw": 1082}, "3206": {"acRate": 66.81760442352238, "difficulty": "Easy", "likes": 81, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "3206", "paidOnly": false, "title": "Alternating Groups I", "titleSlug": "alternating-groups-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 44711, "totalSubmissionRaw": 66915}, "3207": {"acRate": 31.709426714323875, "difficulty": "Medium", "likes": 91, "dislikes": 36, "categoryTitle": "Algorithms", "frontendQuestionId": "3207", "paidOnly": false, "title": "Maximum Points After Enemy Battles", "titleSlug": "maximum-points-after-enemy-battles", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24929, "totalSubmissionRaw": 78617}, "3208": {"acRate": 40.26902134976358, "difficulty": "Medium", "likes": 136, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "3208", "paidOnly": false, "title": "Alternating Groups II", "titleSlug": "alternating-groups-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22483, "totalSubmissionRaw": 55830}, "3209": {"acRate": 34.118859056081384, "difficulty": "Hard", "likes": 134, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "3209", "paidOnly": false, "title": "Number of Subarrays With AND Value of K", "titleSlug": "number-of-subarrays-with-and-value-of-k", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Segment Tree", "id": "VG9waWNUYWdOb2RlOjI5", "slug": "segment-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 10598, "totalSubmissionRaw": 31062}, "3210": {"acRate": 69.33192840330614, "difficulty": "Easy", "likes": 78, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "3210", "paidOnly": false, "title": "Find the Encrypted String", "titleSlug": "find-the-encrypted-string", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 50665, "totalSubmissionRaw": 73076}, "3211": {"acRate": 86.24104373863759, "difficulty": "Medium", "likes": 130, "dislikes": 19, "categoryTitle": "Algorithms", "frontendQuestionId": "3211", "paidOnly": false, "title": "Generate Binary Strings Without Adjacent Zeros", "titleSlug": "generate-binary-strings-without-adjacent-zeros", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}, {"name": "Recursion", "id": "VG9waWNUYWdOb2RlOjMx", "slug": "recursion"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 40322, "totalSubmissionRaw": 46755}, "3212": {"acRate": 51.74930491195552, "difficulty": "Medium", "likes": 128, "dislikes": 25, "categoryTitle": "Algorithms", "frontendQuestionId": "3212", "paidOnly": false, "title": "Count Submatrices With Equal Frequency of X and Y", "titleSlug": "count-submatrices-with-equal-frequency-of-x-and-y", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 22335, "totalSubmissionRaw": 43160}, "3213": {"acRate": 20.466439342827446, "difficulty": "Hard", "likes": 135, "dislikes": 28, "categoryTitle": "Algorithms", "frontendQuestionId": "3213", "paidOnly": false, "title": "Construct String with Minimum Cost", "titleSlug": "construct-string-with-minimum-cost", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Suffix Array", "id": "VG9waWNUYWdOb2RlOjU2Njk4", "slug": "suffix-array"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11224, "totalSubmissionRaw": 54839}, "3214": {"acRate": 52.80487804878049, "difficulty": "Hard", "likes": 1, "dislikes": 1, "categoryTitle": "Database", "frontendQuestionId": "3214", "paidOnly": true, "title": "Year on Year Growth Rate", "titleSlug": "year-on-year-growth-rate", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 433, "totalSubmissionRaw": 820}, "3215": {"acRate": 73.55371900826447, "difficulty": "Medium", "likes": 12, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "3215", "paidOnly": true, "title": "Count Triplets with Even XOR Set Bits II", "titleSlug": "count-triplets-with-even-xor-set-bits-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 356, "totalSubmissionRaw": 484}, "3216": {"acRate": 53.371234789547174, "difficulty": "Easy", "likes": 71, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "3216", "paidOnly": false, "title": "Lexicographically Smallest String After a Swap", "titleSlug": "lexicographically-smallest-string-after-a-swap", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 42808, "totalSubmissionRaw": 80208}, "3217": {"acRate": 61.27570264022387, "difficulty": "Medium", "likes": 112, "dislikes": 4, "categoryTitle": "Algorithms", "frontendQuestionId": "3217", "paidOnly": false, "title": "Delete Nodes From Linked List Present in Array", "titleSlug": "delete-nodes-from-linked-list-present-in-array", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Linked List", "id": "VG9waWNUYWdOb2RlOjc=", "slug": "linked-list"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 40290, "totalSubmissionRaw": 65752}, "3218": {"acRate": 57.728158041179746, "difficulty": "Medium", "likes": 145, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "3218", "paidOnly": false, "title": "Minimum Cost for Cutting Cake I", "titleSlug": "minimum-cost-for-cutting-cake-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24897, "totalSubmissionRaw": 43128}, "3219": {"acRate": 55.92885932523465, "difficulty": "Hard", "likes": 96, "dislikes": 17, "categoryTitle": "Algorithms", "frontendQuestionId": "3219", "paidOnly": false, "title": "Minimum Cost for Cutting Cake II", "titleSlug": "minimum-cost-for-cutting-cake-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Sorting", "id": "VG9waWNUYWdOb2RlOjYxMDQ5", "slug": "sorting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 19843, "totalSubmissionRaw": 35479}, "3220": {"acRate": 71.95945945945947, "difficulty": "Medium", "likes": 19, "dislikes": 3, "categoryTitle": "Database", "frontendQuestionId": "3220", "paidOnly": false, "title": "Odd and Even Transactions", "titleSlug": "odd-and-even-transactions", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3193, "totalSubmissionRaw": 4437}, "3221": {"acRate": 68.72586872586872, "difficulty": "Medium", "likes": 12, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "3221", "paidOnly": true, "title": "Maximum Array Hopping Score II", "titleSlug": "maximum-array-hopping-score-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 356, "totalSubmissionRaw": 518}, "3222": {"acRate": 50.91543777160362, "difficulty": "Easy", "likes": 78, "dislikes": 7, "categoryTitle": "Algorithms", "frontendQuestionId": "3222", "paidOnly": false, "title": "Find the Winning Player in Coin Game", "titleSlug": "find-the-winning-player-in-coin-game", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 35734, "totalSubmissionRaw": 70183}, "3223": {"acRate": 54.66401371131381, "difficulty": "Medium", "likes": 84, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "3223", "paidOnly": false, "title": "Minimum Length of String After Operations", "titleSlug": "minimum-length-of-string-after-operations", "topicTags": [{"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 27748, "totalSubmissionRaw": 50761}, "3224": {"acRate": 22.680902896730235, "difficulty": "Medium", "likes": 187, "dislikes": 18, "categoryTitle": "Algorithms", "frontendQuestionId": "3224", "paidOnly": false, "title": "Minimum Array Changes to Make Differences Equal", "titleSlug": "minimum-array-changes-to-make-differences-equal", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 11917, "totalSubmissionRaw": 52542}, "3225": {"acRate": 26.163141993957705, "difficulty": "Hard", "likes": 51, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "3225", "paidOnly": false, "title": "Maximum Score From Grid Operations", "titleSlug": "maximum-score-from-grid-operations", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1299, "totalSubmissionRaw": 4965}, "3226": {"acRate": 64.28373420301672, "difficulty": "Easy", "likes": 78, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "3226", "paidOnly": false, "title": "Number of Bit Changes to Make Two Integers Equal", "titleSlug": "number-of-bit-changes-to-make-two-integers-equal", "topicTags": [{"name": "Bit Manipulation", "id": "VG9waWNUYWdOb2RlOjE5", "slug": "bit-manipulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 39422, "totalSubmissionRaw": 61325}, "3227": {"acRate": 62.22017241990989, "difficulty": "Medium", "likes": 116, "dislikes": 24, "categoryTitle": "Algorithms", "frontendQuestionId": "3227", "paidOnly": false, "title": "Vowels Game in a String", "titleSlug": "vowels-game-in-a-string", "topicTags": [{"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Brainteaser", "id": "VG9waWNUYWdOb2RlOjMy", "slug": "brainteaser"}, {"name": "Game Theory", "id": "VG9waWNUYWdOb2RlOjYxMDcz", "slug": "game-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 35076, "totalSubmissionRaw": 56374}, "3228": {"acRate": 53.6695349991726, "difficulty": "Medium", "likes": 141, "dislikes": 10, "categoryTitle": "Algorithms", "frontendQuestionId": "3228", "paidOnly": false, "title": "Maximum Number of Operations to Move Ones to the End", "titleSlug": "maximum-number-of-operations-to-move-ones-to-the-end", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 25946, "totalSubmissionRaw": 48344}, "3229": {"acRate": 37.72551455433524, "difficulty": "Hard", "likes": 179, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "3229", "paidOnly": false, "title": "Minimum Operations to Make Array Equal to Target", "titleSlug": "minimum-operations-to-make-array-equal-to-target", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Stack", "id": "VG9waWNUYWdOb2RlOjE1", "slug": "stack"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Monotonic Stack", "id": "VG9waWNUYWdOb2RlOjYxMDU0", "slug": "monotonic-stack"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13362, "totalSubmissionRaw": 35419}, "3230": {"acRate": 44.06779661016949, "difficulty": "Medium", "likes": 3, "dislikes": 0, "categoryTitle": "Database", "frontendQuestionId": "3230", "paidOnly": true, "title": "Customer Purchasing Behavior Analysis", "titleSlug": "customer-purchasing-behavior-analysis", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 442, "totalSubmissionRaw": 1003}, "3231": {"acRate": 56.801909307875896, "difficulty": "Hard", "likes": 6, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "3231", "paidOnly": true, "title": "Minimum Number of Increasing Subsequence to Be Removed", "titleSlug": "minimum-number-of-increasing-subsequence-to-be-removed", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Search", "id": "VG9waWNUYWdOb2RlOjEx", "slug": "binary-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 238, "totalSubmissionRaw": 419}, "3232": {"acRate": 83.16689362989862, "difficulty": "Easy", "likes": 85, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "3232", "paidOnly": false, "title": "Find if Digit Game Can Be Won", "titleSlug": "find-if-digit-game-can-be-won", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 54965, "totalSubmissionRaw": 66090}, "3233": {"acRate": 26.544317424514276, "difficulty": "Medium", "likes": 153, "dislikes": 21, "categoryTitle": "Algorithms", "frontendQuestionId": "3233", "paidOnly": false, "title": "Find the Count of Numbers Which Are Not Special", "titleSlug": "find-the-count-of-numbers-which-are-not-special", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Number Theory", "id": "VG9waWNUYWdOb2RlOjYxMDY3", "slug": "number-theory"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 31068, "totalSubmissionRaw": 117042}, "3234": {"acRate": 14.798959318826869, "difficulty": "Medium", "likes": 202, "dislikes": 37, "categoryTitle": "Algorithms", "frontendQuestionId": "3234", "paidOnly": false, "title": "Count the Number of Substrings With Dominant Ones", "titleSlug": "count-the-number-of-substrings-with-dominant-ones", "topicTags": [{"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Sliding Window", "id": "VG9waWNUYWdOb2RlOjU1ODIx", "slug": "sliding-window"}, {"name": "Enumeration", "id": "VG9waWNUYWdOb2RlOjYxMDY2", "slug": "enumeration"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 6257, "totalSubmissionRaw": 42279}, "3235": {"acRate": 29.0906422736389, "difficulty": "Hard", "likes": 88, "dislikes": 22, "categoryTitle": "Algorithms", "frontendQuestionId": "3235", "paidOnly": false, "title": "Check if the Rectangle Corner Is Reachable", "titleSlug": "check-if-the-rectangle-corner-is-reachable", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Union Find", "id": "VG9waWNUYWdOb2RlOjIz", "slug": "union-find"}, {"name": "Geometry", "id": "VG9waWNUYWdOb2RlOjM4", "slug": "geometry"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 5947, "totalSubmissionRaw": 20443}, "3236": {"acRate": 80.18018018018019, "difficulty": "Hard", "likes": 3, "dislikes": 0, "categoryTitle": "Database", "frontendQuestionId": "3236", "paidOnly": true, "title": "CEO Subordinate Hierarchy", "titleSlug": "ceo-subordinate-hierarchy", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 267, "totalSubmissionRaw": 333}, "3237": {"acRate": 80.73394495412845, "difficulty": "Medium", "likes": 12, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "3237", "paidOnly": true, "title": "Alt and Tab Simulation", "titleSlug": "alt-and-tab-simulation", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 440, "totalSubmissionRaw": 545}, "3238": {"acRate": 60.93036626196354, "difficulty": "Easy", "likes": 55, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "3238", "paidOnly": false, "title": "Find the Number of Winning Players", "titleSlug": "find-the-number-of-winning-players", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Counting", "id": "VG9waWNUYWdOb2RlOjYxMDYy", "slug": "counting"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 36033, "totalSubmissionRaw": 59138}, "3239": {"acRate": 78.07606835423638, "difficulty": "Medium", "likes": 49, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "3239", "paidOnly": false, "title": "Minimum Number of Flips to Make Binary Grid Palindromic I", "titleSlug": "minimum-number-of-flips-to-make-binary-grid-palindromic-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 30566, "totalSubmissionRaw": 39149}, "3240": {"acRate": 22.46564981721921, "difficulty": "Medium", "likes": 102, "dislikes": 44, "categoryTitle": "Algorithms", "frontendQuestionId": "3240", "paidOnly": false, "title": "Minimum Number of Flips to Make Binary Grid Palindromic II", "titleSlug": "minimum-number-of-flips-to-make-binary-grid-palindromic-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Two Pointers", "id": "VG9waWNUYWdOb2RlOjk=", "slug": "two-pointers"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 8911, "totalSubmissionRaw": 39665}, "3241": {"acRate": 21.45287867213001, "difficulty": "Hard", "likes": 67, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "3241", "paidOnly": false, "title": "Time Taken to Mark All Nodes", "titleSlug": "time-taken-to-mark-all-nodes", "topicTags": [{"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3089, "totalSubmissionRaw": 14399}, "3242": {"acRate": 83.47637825717158, "difficulty": "Easy", "likes": 67, "dislikes": 12, "categoryTitle": "Algorithms", "frontendQuestionId": "3242", "paidOnly": false, "title": "Design Neighbor Sum Service", "titleSlug": "design-neighbor-sum-service", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Hash Table", "id": "VG9waWNUYWdOb2RlOjY=", "slug": "hash-table"}, {"name": "Design", "id": "VG9waWNUYWdOb2RlOjI1", "slug": "design"}, {"name": "Matrix", "id": "VG9waWNUYWdOb2RlOjYxMDUz", "slug": "matrix"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 32388, "totalSubmissionRaw": 38799}, "3243": {"acRate": 47.116590873451464, "difficulty": "Medium", "likes": 83, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "3243", "paidOnly": false, "title": "Shortest Distance After Road Addition Queries I", "titleSlug": "shortest-distance-after-road-addition-queries-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Breadth-First Search", "id": "VG9waWNUYWdOb2RlOjIy", "slug": "breadth-first-search"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 24034, "totalSubmissionRaw": 51010}, "3244": {"acRate": 22.427416391032708, "difficulty": "Hard", "likes": 132, "dislikes": 3, "categoryTitle": "Algorithms", "frontendQuestionId": "3244", "paidOnly": false, "title": "Shortest Distance After Road Addition Queries II", "titleSlug": "shortest-distance-after-road-addition-queries-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Greedy", "id": "VG9waWNUYWdOb2RlOjE3", "slug": "greedy"}, {"name": "Graph", "id": "VG9waWNUYWdOb2RlOjI0", "slug": "graph"}, {"name": "Ordered Set", "id": "VG9waWNUYWdOb2RlOjYxMDcw", "slug": "ordered-set"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 9764, "totalSubmissionRaw": 43534}, "3245": {"acRate": 13.205378692104356, "difficulty": "Hard", "likes": 42, "dislikes": 8, "categoryTitle": "Algorithms", "frontendQuestionId": "3245", "paidOnly": false, "title": "Alternating Groups III", "titleSlug": "alternating-groups-iii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Binary Indexed Tree", "id": "VG9waWNUYWdOb2RlOjI4", "slug": "binary-indexed-tree"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1149, "totalSubmissionRaw": 8701}, "3246": {"acRate": 89.92537313432835, "difficulty": "Easy", "likes": 4, "dislikes": 0, "categoryTitle": "Database", "frontendQuestionId": "3246", "paidOnly": true, "title": "Premier League Table Ranking", "titleSlug": "premier-league-table-ranking", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 482, "totalSubmissionRaw": 536}, "3247": {"acRate": 55.69176882661997, "difficulty": "Medium", "likes": 5, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "3247", "paidOnly": true, "title": "Number of Subsequences with Odd Sum", "titleSlug": "number-of-subsequences-with-odd-sum", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 318, "totalSubmissionRaw": 571}, "3248": {"acRate": 81.47942371062916, "difficulty": "Easy", "likes": 75, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "3248", "paidOnly": false, "title": "Snake in Matrix", "titleSlug": "snake-in-matrix", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "String", "id": "VG9waWNUYWdOb2RlOjEw", "slug": "string"}, {"name": "Simulation", "id": "VG9waWNUYWdOb2RlOjYxMDU1", "slug": "simulation"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 42526, "totalSubmissionRaw": 52193}, "3249": {"acRate": 55.455020423672465, "difficulty": "Medium", "likes": 124, "dislikes": 31, "categoryTitle": "Algorithms", "frontendQuestionId": "3249", "paidOnly": false, "title": "Count the Number of Good Nodes", "titleSlug": "count-the-number-of-good-nodes", "topicTags": [{"name": "Tree", "id": "VG9waWNUYWdOb2RlOjIw", "slug": "tree"}, {"name": "Depth-First Search", "id": "VG9waWNUYWdOb2RlOjIx", "slug": "depth-first-search"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 23351, "totalSubmissionRaw": 42107}, "3250": {"acRate": 45.18371076160021, "difficulty": "Hard", "likes": 103, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "3250", "paidOnly": false, "title": "Find the Count of Monotonic Pairs I", "titleSlug": "find-the-count-of-monotonic-pairs-i", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 13847, "totalSubmissionRaw": 30646}, "3251": {"acRate": 21.319510713975884, "difficulty": "Hard", "likes": 69, "dislikes": 6, "categoryTitle": "Algorithms", "frontendQuestionId": "3251", "paidOnly": false, "title": "Find the Count of Monotonic Pairs II", "titleSlug": "find-the-count-of-monotonic-pairs-ii", "topicTags": [{"name": "Array", "id": "VG9waWNUYWdOb2RlOjU=", "slug": "array"}, {"name": "Math", "id": "VG9waWNUYWdOb2RlOjg=", "slug": "math"}, {"name": "Dynamic Programming", "id": "VG9waWNUYWdOb2RlOjEz", "slug": "dynamic-programming"}, {"name": "Combinatorics", "id": "VG9waWNUYWdOb2RlOjYxMDU2", "slug": "combinatorics"}, {"name": "Prefix Sum", "id": "VG9waWNUYWdOb2RlOjYxMDY4", "slug": "prefix-sum"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 4915, "totalSubmissionRaw": 23054}, "3252": {"acRate": 75.47169811320755, "difficulty": "Medium", "likes": 2, "dislikes": 4, "categoryTitle": "Database", "frontendQuestionId": "3252", "paidOnly": true, "title": "Premier League Table Ranking II", "titleSlug": "premier-league-table-ranking-ii", "topicTags": [{"name": "Database", "id": "VG9waWNUYWdOb2RlOjYxMDQz", "slug": "database"}], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 200, "totalSubmissionRaw": 265}, "3253": {"acRate": 52.71317829457365, "difficulty": "Medium", "likes": 4, "dislikes": 1, "categoryTitle": "Algorithms", "frontendQuestionId": "3253", "paidOnly": true, "title": "Construct String with Minimum Cost (Easy)", "titleSlug": "construct-string-with-minimum-cost-easy", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 204, "totalSubmissionRaw": 387}, "3254": {"acRate": 51.49398257020334, "difficulty": "Medium", "likes": 23, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "3254", "paidOnly": false, "title": "Find the Power of K-Size Subarrays I", "titleSlug": "find-the-power-of-k-size-subarrays-i", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 29747, "totalSubmissionRaw": 57777}, "3255": {"acRate": 21.809967862599443, "difficulty": "Medium", "likes": 47, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "3255", "paidOnly": false, "title": "Find the Power of K-Size Subarrays II", "titleSlug": "find-the-power-of-k-size-subarrays-ii", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 16539, "totalSubmissionRaw": 75881}, "3256": {"acRate": 8.531898539584935, "difficulty": "Hard", "likes": 33, "dislikes": 5, "categoryTitle": "Algorithms", "frontendQuestionId": "3256", "paidOnly": false, "title": "Maximum Value Sum by Placing Three Rooks I", "titleSlug": "maximum-value-sum-by-placing-three-rooks-i", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 3325, "totalSubmissionRaw": 39015}, "3257": {"acRate": 20.213483146067414, "difficulty": "Hard", "likes": 16, "dislikes": 2, "categoryTitle": "Algorithms", "frontendQuestionId": "3257", "paidOnly": false, "title": "Maximum Value Sum by Placing Three Rooks II", "titleSlug": "maximum-value-sum-by-placing-three-rooks-ii", "topicTags": [], "hasSolution": false, "hasVideoSolution": false, "totalAcceptedRaw": 1783, "totalSubmissionRaw": 8864}}
\ No newline at end of file